{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008095,0.0024321887,0.9537729,0.0014515426,0.0006271674,0.0002246186,0.000154981,0.007091167,0.026150407],"genre_scores_gemma":[0.50115204,0.0037555997,0.464704,0.002156584,0.00082801026,0.0005188466,0.000578001,0.00052788446,0.025779024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889153,0.00021759818,0.000053318217,0.00013387411,0.00057750643,0.00012617564],"domain_scores_gemma":[0.99904376,0.00030453262,0.00009865723,0.00027858577,0.00017814091,0.000096325704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715208,0.0006113307,0.000514264,0.00085611484,0.00062905706,0.001675593,0.0023024413,0.0008505183,0.004250549],"category_scores_gemma":[0.0029692745,0.00032454878,0.00038668237,0.0006447106,0.0014468376,0.002756558,0.002319624,0.002478777,0.0016685472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032025107,0.00019736352,0.0005437079,0.00040251523,0.00008462449,0.00045541755,0.00049527833,0.034348425,0.0421543,0.5279167,0.04183944,0.35124192],"study_design_scores_gemma":[0.00017440804,0.0004054451,0.000368487,0.00013151707,0.00010848944,0.000872365,0.00017096243,0.44810882,0.032115143,0.3118999,0.20552373,0.00012073658],"about_ca_topic_score_codex":0.0008334368,"about_ca_topic_score_gemma":0.0014126578,"teacher_disagreement_score":0.004250549,"about_ca_system_score_codex":0.00062376243,"about_ca_system_score_gemma":0.001129445,"threshold_uncertainty_score":0.0142195225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15356915,0.00211216,0.83177006,0.00042085393,0.00024367728,0.0001240367,0.000095223026,0.0005580414,0.011106809],"genre_scores_gemma":[0.9831109,0.00044919158,0.0134534445,0.000042603926,0.0000849989,0.000040329083,0.000071827344,0.00003578142,0.0027109762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893206,0.0002554711,0.000041984287,0.00013067451,0.00040181683,0.00023791753],"domain_scores_gemma":[0.99837273,0.0006972639,0.00016618664,0.00012817633,0.0005686174,0.000067110836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016484163,0.0007237901,0.00061481027,0.00074585347,0.0004918412,0.0013257173,0.0019296418,0.0005797001,0.0033081968],"category_scores_gemma":[0.0030005763,0.00026720142,0.00060894236,0.0006534969,0.0007134397,0.0015188566,0.0005004372,0.0010064441,0.0003125026],"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.00035369815,0.00028801154,0.0016957641,0.00015781293,0.000079112055,0.00015262298,0.00016797817,0.74518555,0.031695407,0.16922091,0.0024945594,0.048508637],"study_design_scores_gemma":[0.0000023537602,0.000025782096,0.00018530723,0.00000293175,0.0000065618788,0.000016146676,0.000008085253,0.9948265,0.0007209309,0.004064876,0.00013570058,0.0000047950757],"about_ca_topic_score_codex":0.0038401226,"about_ca_topic_score_gemma":0.0016820568,"teacher_disagreement_score":0.0038401226,"about_ca_system_score_codex":0.0022969632,"about_ca_system_score_gemma":0.001360461,"threshold_uncertainty_score":0.016665757},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04024399,0.24764961,0.4043182,0.085020155,0.07098072,0.0042510075,0.03544169,0.02187788,0.090216845],"genre_scores_gemma":[0.150236,0.15641451,0.3952015,0.012170154,0.026179366,0.004678157,0.11377053,0.0031165518,0.1382332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9828845,0.006311106,0.0016594782,0.0016492128,0.00678174,0.00071393687],"domain_scores_gemma":[0.97642106,0.0076840497,0.0014105204,0.0052925376,0.0067987633,0.0023931393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01953337,0.0030691875,0.004744995,0.007285649,0.0020478142,0.015688436,0.0044171936,0.0033300363,0.027821613],"category_scores_gemma":[0.040942624,0.001537628,0.0019596424,0.0067735575,0.0017020353,0.01087617,0.00704999,0.007033096,0.014355553],"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.00032003433,0.00038496673,0.00484983,0.0009968454,0.00036600794,0.00023124991,0.0004168761,0.0052975244,0.001076025,0.011949941,0.6979472,0.27616352],"study_design_scores_gemma":[0.00010223243,0.000283842,0.00692981,0.0010221357,0.00020005186,0.00077696826,0.0006320359,0.038768418,0.0018721811,0.029487032,0.9197522,0.00017320726],"about_ca_topic_score_codex":0.006959985,"about_ca_topic_score_gemma":0.0057098716,"teacher_disagreement_score":0.027821613,"about_ca_system_score_codex":0.004112639,"about_ca_system_score_gemma":0.007094846,"threshold_uncertainty_score":0.10330355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007124073,0.0019129982,0.98287845,0.00019133529,0.0003348669,0.0001480596,0.00011293154,0.003498231,0.0037990182],"genre_scores_gemma":[0.29909503,0.0024939023,0.684887,0.0003473934,0.0005732142,0.00042422645,0.0003492158,0.00052918325,0.011300881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948263,0.000089476554,0.000039679468,0.00008111302,0.00022101944,0.00008601889],"domain_scores_gemma":[0.99935097,0.00017655855,0.00003957312,0.0001164274,0.00027552308,0.00004096339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011560048,0.00089816435,0.00061835145,0.0010644251,0.0008452092,0.0017538336,0.0027532657,0.0008747514,0.006983678],"category_scores_gemma":[0.0021747963,0.0005674103,0.00042341367,0.0008110521,0.00056485966,0.0016726484,0.0005201061,0.0010780216,0.0013573808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091301155,0.0002463966,0.00078054477,0.000562501,0.00013718277,0.00016095981,0.00031240654,0.08599357,0.05902379,0.15756562,0.038674884,0.6556291],"study_design_scores_gemma":[0.00022082335,0.0006241614,0.00049746566,0.00017002504,0.00024874078,0.00031118287,0.000048981783,0.8124422,0.06437322,0.04372473,0.07724545,0.000093012895],"about_ca_topic_score_codex":0.0036437532,"about_ca_topic_score_gemma":0.0053813714,"teacher_disagreement_score":0.006983678,"about_ca_system_score_codex":0.0014117098,"about_ca_system_score_gemma":0.0015388825,"threshold_uncertainty_score":0.023362696},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6956202,0.0032615259,0.25773323,0.0010876426,0.0005006745,0.000051548566,0.0007010247,0.0028894267,0.03815476],"genre_scores_gemma":[0.9914825,0.00027119077,0.0033090883,0.000049025562,0.00007308202,0.000018384393,0.00022799493,0.00028388205,0.0042849076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992531,0.00015543056,0.000020219708,0.00011087113,0.00027594678,0.00018431521],"domain_scores_gemma":[0.99466467,0.003933935,0.00021253167,0.00026393274,0.0006354186,0.00028955596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010642026,0.0004978846,0.00044100545,0.0008188452,0.00030089935,0.00086780527,0.00089366024,0.0005542437,0.005605521],"category_scores_gemma":[0.008769761,0.0002533225,0.00025595957,0.00086233945,0.000597131,0.0008101102,0.00034760355,0.00092381064,0.0007757402],"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.0032899175,0.00023979816,0.0048253713,0.00038407114,0.00009845521,0.000575383,0.0012471017,0.5707936,0.07298349,0.20474178,0.014671971,0.12614907],"study_design_scores_gemma":[0.000022199572,0.000079956,0.0017614402,0.000020513613,0.000017940441,0.00014450795,0.00009343596,0.96769494,0.004468537,0.023994634,0.0016788181,0.000023084101],"about_ca_topic_score_codex":0.0038217306,"about_ca_topic_score_gemma":0.0014910991,"teacher_disagreement_score":0.005605521,"about_ca_system_score_codex":0.0018422866,"about_ca_system_score_gemma":0.0006810319,"threshold_uncertainty_score":0.018752337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38401252,0.0009028015,0.60092634,0.0006280149,0.000075011834,0.000058471443,0.0001362326,0.00068941514,0.012571209],"genre_scores_gemma":[0.98913926,0.00029430122,0.007149536,0.00005338453,0.000045777448,0.000034054163,0.000051547762,0.000042509324,0.003189748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994686,0.00015184567,0.00001546296,0.00006400136,0.00022410089,0.00007599655],"domain_scores_gemma":[0.9967084,0.0017474549,0.00046081143,0.00019973375,0.0007370438,0.00014659677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402827,0.00042480562,0.0005173097,0.0007781846,0.0004668062,0.00081039465,0.00092438026,0.00072231854,0.0022985372],"category_scores_gemma":[0.009698552,0.00030062065,0.00039157452,0.00053709897,0.0013214137,0.0013328183,0.00094122894,0.0009949086,0.00022616705],"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.00020106012,0.000070714435,0.002384185,0.00010950481,0.000049638555,0.00030347245,0.00019016684,0.8425802,0.01766859,0.1223983,0.0010413101,0.013002853],"study_design_scores_gemma":[0.000002577662,0.00001243826,0.00016482787,0.0000029601158,0.0000037688044,0.000021452315,0.0000067988094,0.99606884,0.0004056212,0.0032312463,0.00007485045,0.000004643598],"about_ca_topic_score_codex":0.0041613663,"about_ca_topic_score_gemma":0.0012069352,"teacher_disagreement_score":0.0041613663,"about_ca_system_score_codex":0.0017787676,"about_ca_system_score_gemma":0.00079530233,"threshold_uncertainty_score":0.012905896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031664697,0.0011801653,0.98990613,0.00051046215,0.00007131208,0.000029484063,0.00010367242,0.00012843168,0.0049037654],"genre_scores_gemma":[0.66505456,0.01056475,0.30862385,0.000887378,0.0013266834,0.00081281096,0.0006700491,0.0005400235,0.011519892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968971,0.0016225282,0.00012224467,0.00036005874,0.00076929346,0.00022880976],"domain_scores_gemma":[0.98687685,0.01009003,0.00075134024,0.0007578767,0.001232959,0.00029096237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056843814,0.0018567955,0.0016315387,0.0026925527,0.00096258166,0.0024689364,0.0014203022,0.0011571617,0.004513873],"category_scores_gemma":[0.024491703,0.0007134363,0.0017390455,0.0025315667,0.0027776884,0.0031270327,0.00204388,0.0042895195,0.0008551682],"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.000007398284,0.000020039022,0.00033572284,0.00006537022,0.000045254943,0.00007304115,0.00009289174,0.14000697,0.00033387684,0.84973866,0.001766488,0.007514236],"study_design_scores_gemma":[0.0000033352828,0.00000876879,0.00014198359,0.000018494879,0.000008554388,0.000018932695,0.000017443097,0.60236377,0.00008700647,0.39536658,0.001953841,0.000011288961],"about_ca_topic_score_codex":0.007034008,"about_ca_topic_score_gemma":0.0032294884,"teacher_disagreement_score":0.007034008,"about_ca_system_score_codex":0.003173977,"about_ca_system_score_gemma":0.002351929,"threshold_uncertainty_score":0.030062199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012357301,0.00043279718,0.9942259,0.00014835465,0.00012373776,0.000038359667,0.000022990625,0.0002954442,0.003476713],"genre_scores_gemma":[0.3759897,0.0020892874,0.60743004,0.00039042838,0.00069482735,0.0005930666,0.00018801811,0.0002796921,0.012344858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992861,0.00012527544,0.00004680478,0.00010595851,0.00036898677,0.00006691074],"domain_scores_gemma":[0.99946874,0.0001838865,0.000050397633,0.00007377678,0.00017694771,0.00004628701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000953697,0.0008592334,0.0006838728,0.0005719068,0.0005458559,0.0022359735,0.0019385905,0.0010256403,0.0024682658],"category_scores_gemma":[0.0019294067,0.00033110593,0.00062920543,0.00061420404,0.0012573417,0.0017638634,0.0011161477,0.0016734191,0.00074160594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003725041,0.00007298008,0.00017543195,0.0001342441,0.00004322859,0.0001521877,0.00013778388,0.4067146,0.0064054816,0.5018887,0.0034366539,0.080801435],"study_design_scores_gemma":[0.000025788571,0.000044947294,0.000040962543,0.000021069829,0.000014578647,0.000053827454,0.000015102568,0.8767903,0.0011355038,0.106483385,0.015358003,0.00001643501],"about_ca_topic_score_codex":0.0029254353,"about_ca_topic_score_gemma":0.0020908953,"teacher_disagreement_score":0.0029254353,"about_ca_system_score_codex":0.00074531516,"about_ca_system_score_gemma":0.0008355428,"threshold_uncertainty_score":0.008257151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022529736,0.00038239177,0.97286665,0.00009993263,0.00012638018,0.00006782207,0.000036577352,0.0019527886,0.0019376852],"genre_scores_gemma":[0.70771766,0.00022376199,0.28691196,0.00012298129,0.00015356558,0.0001504993,0.00010045905,0.00019383019,0.004425334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994796,0.00009134831,0.000031022395,0.00009067011,0.0002477508,0.000059691716],"domain_scores_gemma":[0.9990914,0.00024290479,0.00006757147,0.00034366615,0.0002019342,0.000052686224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007785099,0.00039322436,0.00069455925,0.00070404826,0.000639914,0.00071425945,0.0017813627,0.00061626284,0.0018779356],"category_scores_gemma":[0.0018782152,0.00030134665,0.00023885987,0.0005229027,0.0005566242,0.0009282301,0.001275656,0.0011341842,0.00038732894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010077978,0.0002819973,0.00046227727,0.00016201942,0.00006676117,0.00017771224,0.00026714808,0.15696846,0.15587011,0.063555114,0.006127851,0.61505276],"study_design_scores_gemma":[0.00007541333,0.00016423225,0.00022175086,0.000012279698,0.00002683481,0.00015392684,0.000013317516,0.96592486,0.017082112,0.012304205,0.0039880225,0.000033130338],"about_ca_topic_score_codex":0.0005771434,"about_ca_topic_score_gemma":0.000743009,"teacher_disagreement_score":0.0018779356,"about_ca_system_score_codex":0.00059385644,"about_ca_system_score_gemma":0.0003779383,"threshold_uncertainty_score":0.0062823296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0380269,0.0013588046,0.94372123,0.00016908156,0.00041108942,0.0006490187,0.00034990086,0.0046123574,0.010701642],"genre_scores_gemma":[0.64004946,0.00068246835,0.34410614,0.0002934707,0.00030761096,0.0004614411,0.0007753787,0.00029332968,0.013030734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941313,0.00006937416,0.000051039762,0.000115184965,0.0002220003,0.0001293736],"domain_scores_gemma":[0.99933535,0.000088400855,0.00007322513,0.00011452583,0.00030084062,0.00008759438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063195796,0.0006186999,0.0005330601,0.00069556583,0.0005953815,0.0011819337,0.0020444356,0.00043368482,0.004198062],"category_scores_gemma":[0.0011147095,0.00035644407,0.00035827796,0.00056008453,0.0002548103,0.0008465427,0.0007993779,0.0005808087,0.0011630999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011825042,0.00041175986,0.00575517,0.00061972166,0.00024576706,0.0006891554,0.0004200509,0.349284,0.11064931,0.08578441,0.021827346,0.42313075],"study_design_scores_gemma":[0.00011346054,0.00030157363,0.0010040579,0.000020260979,0.000082042956,0.00024707158,0.00005038095,0.9129315,0.040585883,0.005802579,0.038806457,0.000054707514],"about_ca_topic_score_codex":0.0040742257,"about_ca_topic_score_gemma":0.0048431065,"teacher_disagreement_score":0.004198062,"about_ca_system_score_codex":0.0012630882,"about_ca_system_score_gemma":0.0028478098,"threshold_uncertainty_score":0.014043987},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018959861,0.0728315,0.34148303,0.3858974,0.008444816,0.00007710512,0.00014541019,0.00049617374,0.17166482],"genre_scores_gemma":[0.57735795,0.113775186,0.10674908,0.07566227,0.013238238,0.00017885276,0.000108559056,0.00026903086,0.112660855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917847,0.00022034446,0.00003411872,0.00013799433,0.00034289563,0.00008623647],"domain_scores_gemma":[0.99845207,0.0009271948,0.00007384933,0.00009711924,0.000357648,0.00009216003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011894177,0.0004402641,0.00036994196,0.00089683506,0.0011917958,0.0023379626,0.00062428403,0.002965512,0.004476562],"category_scores_gemma":[0.003796648,0.00027917817,0.00030731794,0.0007749733,0.0035259207,0.004848848,0.00076702744,0.0039866697,0.0009343655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005670457,0.00011925693,0.00058211695,0.00027164546,0.000017564047,0.00012870079,0.0003954033,0.0090711145,0.0019128234,0.85107434,0.028361661,0.10800867],"study_design_scores_gemma":[0.000035356294,0.00031782483,0.000534619,0.00023994085,0.000018023784,0.00022340327,0.000774587,0.021254221,0.0022983109,0.67636824,0.2978854,0.000050053797],"about_ca_topic_score_codex":0.0014895969,"about_ca_topic_score_gemma":0.0010863029,"teacher_disagreement_score":0.004476562,"about_ca_system_score_codex":0.0010130574,"about_ca_system_score_gemma":0.0009244353,"threshold_uncertainty_score":0.014975667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98422986,0.00004247357,0.013511288,0.00004923648,0.00001923456,0.00007224812,0.00008159574,0.00030928175,0.0016848787],"genre_scores_gemma":[0.990185,0.000027251517,0.009114197,0.0000102049435,0.0000048175834,0.000045477205,0.0001434315,0.000010873285,0.00045872614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993105,0.00026321845,0.000025868856,0.00010971676,0.00016269223,0.00012802039],"domain_scores_gemma":[0.99880993,0.00031853127,0.0002151218,0.0002439808,0.0001566566,0.0002557404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012185983,0.00033916178,0.00025715472,0.000377372,0.0006240259,0.00051120843,0.0008986694,0.00032870081,0.0010012831],"category_scores_gemma":[0.0009958855,0.00014684825,0.00012967348,0.00038030415,0.0006449423,0.00079570635,0.00073187606,0.00040342906,0.00013177318],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026603327,0.002654714,0.026577434,0.0002192831,0.00016202278,0.0016969604,0.0006824192,0.6736458,0.2176345,0.014892533,0.0026570393,0.056517057],"study_design_scores_gemma":[0.00032162113,0.004016505,0.014465853,0.000019872763,0.000046264642,0.00035177678,0.00054925826,0.8509859,0.12164251,0.0023877572,0.005168469,0.00004422922],"about_ca_topic_score_codex":0.0033724122,"about_ca_topic_score_gemma":0.002912407,"teacher_disagreement_score":0.0033724122,"about_ca_system_score_codex":0.0010767997,"about_ca_system_score_gemma":0.00053164293,"threshold_uncertainty_score":0.007812798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002728294,0.00021730852,0.99378175,0.00015104088,0.00004668709,0.000040017647,0.000041371626,0.000072650604,0.0029209324],"genre_scores_gemma":[0.450826,0.0011917312,0.5384188,0.00018921061,0.00023175382,0.0005308717,0.00018718473,0.00012375336,0.008300801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00029163534,0.000031752003,0.00013595661,0.00033664,0.00009355923],"domain_scores_gemma":[0.99946433,0.00017498902,0.000043772336,0.00011981977,0.00013875034,0.000058315076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012534496,0.00078542787,0.0005928314,0.00050326216,0.00062843174,0.0011301624,0.0025283464,0.0010513375,0.0029625006],"category_scores_gemma":[0.001466675,0.00024955638,0.0007115869,0.0007358431,0.0009976827,0.001552065,0.0015397179,0.0015718545,0.0005575864],"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.000043205968,0.00004311245,0.00016754738,0.00009863439,0.000024063114,0.00016496032,0.00011301125,0.49097,0.0044586975,0.47522542,0.0018544832,0.026836999],"study_design_scores_gemma":[0.000016303034,0.000048346927,0.000050077142,0.0000127077055,0.000010758018,0.00006585153,0.000021857833,0.9191039,0.00078525604,0.07049269,0.009379942,0.000012226163],"about_ca_topic_score_codex":0.0026869643,"about_ca_topic_score_gemma":0.0024525146,"teacher_disagreement_score":0.0029625006,"about_ca_system_score_codex":0.0011714714,"about_ca_system_score_gemma":0.001683651,"threshold_uncertainty_score":0.009910524},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09563165,0.0051809633,0.15817487,0.0071113924,0.0011358198,0.00017965729,0.00015764506,0.00235088,0.7300772],"genre_scores_gemma":[0.8634712,0.004624347,0.048083633,0.0019699514,0.00056105154,0.0001557193,0.00022627915,0.00028212613,0.08062569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956757,0.00006323654,0.000011257547,0.000039382663,0.00020199096,0.00011664569],"domain_scores_gemma":[0.99970514,0.000049556897,0.000019458019,0.00006860657,0.000120448014,0.000036796668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041612226,0.00031986923,0.00015557863,0.00045964975,0.0007476848,0.0018370934,0.0005514567,0.0008971294,0.010770399],"category_scores_gemma":[0.0013039253,0.00016700322,0.00012176913,0.0007395962,0.000406268,0.0027409315,0.0015742247,0.00088508485,0.0022872547],"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.000112455964,0.00016034284,0.0016416523,0.00012460117,0.000011580456,0.0005858917,0.00031681042,0.010683352,0.015308495,0.69807804,0.03610313,0.23687372],"study_design_scores_gemma":[0.000036319158,0.00016757732,0.0026069826,0.00011685713,0.000021441103,0.0024765367,0.00067823974,0.06988767,0.009978425,0.28889528,0.62509954,0.00003503739],"about_ca_topic_score_codex":0.00069926586,"about_ca_topic_score_gemma":0.0010142617,"teacher_disagreement_score":0.010770399,"about_ca_system_score_codex":0.00064823456,"about_ca_system_score_gemma":0.00039614295,"threshold_uncertainty_score":0.03603059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11790313,0.0019401176,0.87608695,0.00031057186,0.00012616972,0.00016841949,0.000048765945,0.0012107103,0.0022051544],"genre_scores_gemma":[0.9486259,0.0005466388,0.049582466,0.000032941018,0.00008099507,0.00007899208,0.000047774196,0.00005310368,0.0009512784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.00012194328,0.000029579758,0.000038673872,0.00019828224,0.000053132426],"domain_scores_gemma":[0.99914575,0.00038072135,0.0001163319,0.000091731796,0.00021445517,0.00005093917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301262,0.0003963556,0.00038028765,0.0005073838,0.0004992835,0.0005552179,0.0007780104,0.0002294542,0.00060949224],"category_scores_gemma":[0.0036525682,0.00018492556,0.00013498196,0.00040099683,0.00047683596,0.0008565182,0.00045455006,0.0005292274,0.000095671385],"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.00060016254,0.00012841418,0.0021612025,0.00033465232,0.000094159615,0.0004070973,0.00034955994,0.56657463,0.11909294,0.031818997,0.0037492584,0.27468887],"study_design_scores_gemma":[0.000030555362,0.00010626403,0.00045520978,0.000008698435,0.000021091617,0.00005320957,0.000016650476,0.9850347,0.007216639,0.0056541907,0.0013909163,0.000011893909],"about_ca_topic_score_codex":0.002072686,"about_ca_topic_score_gemma":0.0018334419,"teacher_disagreement_score":0.002072686,"about_ca_system_score_codex":0.0006151306,"about_ca_system_score_gemma":0.00046826917,"threshold_uncertainty_score":0.005447924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06759035,0.017532952,0.86673117,0.00089009793,0.00112196,0.00008416378,0.00009015456,0.0030543152,0.042904783],"genre_scores_gemma":[0.8866216,0.007447015,0.08733699,0.00025681948,0.000974419,0.000059574864,0.00007921464,0.00037610342,0.016848322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977,0.00004122855,0.000011148064,0.000033091885,0.00010302681,0.00004158148],"domain_scores_gemma":[0.9995173,0.00023094623,0.000033998003,0.00006642731,0.00012860775,0.000022773105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004822219,0.00081977155,0.00042648995,0.0004771552,0.00027326873,0.0010669739,0.000913525,0.00054234365,0.003963789],"category_scores_gemma":[0.0015242645,0.00029089127,0.0002461357,0.0006052981,0.00037712185,0.001350625,0.00061257737,0.0010144148,0.00063080597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025777388,0.00027330927,0.0006531884,0.00047445027,0.00008186308,0.00017538699,0.00015402146,0.16811663,0.16300689,0.057067517,0.009297369,0.60044163],"study_design_scores_gemma":[0.000046184916,0.00029651332,0.0008167632,0.00008747998,0.00018674093,0.0003034616,0.00003243211,0.8494708,0.08206697,0.03251072,0.034134507,0.00004750515],"about_ca_topic_score_codex":0.0005888206,"about_ca_topic_score_gemma":0.0007338564,"teacher_disagreement_score":0.003963789,"about_ca_system_score_codex":0.0005048453,"about_ca_system_score_gemma":0.000280474,"threshold_uncertainty_score":0.013260245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90883636,0.003333434,0.08257583,0.00020333477,0.00008956321,0.0001455494,0.000052641353,0.00017868768,0.004584618],"genre_scores_gemma":[0.9884015,0.0008907038,0.009838478,0.000021300402,0.00004141405,0.0000258813,0.000027022701,0.000016449005,0.0007373751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989343,0.0003698946,0.000038587634,0.00009117544,0.00044779692,0.000118253505],"domain_scores_gemma":[0.99681705,0.0020180922,0.00027174054,0.00012724994,0.00066238287,0.00010350981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345057,0.000559069,0.0008310715,0.0006097401,0.0003358089,0.0006803695,0.00067252363,0.00053769106,0.0005966716],"category_scores_gemma":[0.0038764293,0.00023503765,0.00034483676,0.0004091501,0.00043068413,0.00081429334,0.00028052693,0.0004981791,0.00014933234],"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.0014746567,0.00097558886,0.0059044384,0.0007008952,0.00022165336,0.0011433484,0.00057340995,0.50927,0.3908296,0.02503109,0.00088035123,0.06299494],"study_design_scores_gemma":[0.00004563695,0.0011406501,0.0017535848,0.000017696302,0.00006161755,0.00029363643,0.000073526186,0.9603847,0.034311946,0.0007421195,0.001150526,0.000024298213],"about_ca_topic_score_codex":0.0010667325,"about_ca_topic_score_gemma":0.00036295495,"teacher_disagreement_score":0.001345057,"about_ca_system_score_codex":0.00044381584,"about_ca_system_score_gemma":0.00040505393,"threshold_uncertainty_score":0.007113397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021820545,0.00039579163,0.96631384,0.00026125374,0.000080047284,0.000078292986,0.00003784709,0.00096069527,0.010051662],"genre_scores_gemma":[0.6573003,0.0009092728,0.33689985,0.0002908168,0.00009348678,0.00009245721,0.00022691359,0.000089669455,0.004097261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946135,0.00013247278,0.000037517664,0.00006520149,0.00022157082,0.00008189385],"domain_scores_gemma":[0.9995425,0.00014070528,0.00004490804,0.00009052876,0.00014529849,0.000036181766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330226,0.0004303845,0.00030009518,0.0003623976,0.00037824284,0.0011238551,0.00094627653,0.00063187757,0.00087008096],"category_scores_gemma":[0.0014921273,0.00015576788,0.00021180496,0.00040972483,0.00048829446,0.0011092013,0.0009180571,0.0007329097,0.0005931912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000233802,0.00035560498,0.003049785,0.00022717648,0.000057236226,0.0007179856,0.00047886005,0.17810255,0.18464841,0.27449784,0.0058979825,0.35173288],"study_design_scores_gemma":[0.000030662573,0.00013638582,0.0005731247,0.000033617463,0.000026364285,0.00032844243,0.00007788435,0.8443471,0.040700234,0.072357744,0.041349277,0.000039193572],"about_ca_topic_score_codex":0.0008427515,"about_ca_topic_score_gemma":0.0007488692,"teacher_disagreement_score":0.0011238551,"about_ca_system_score_codex":0.00049541786,"about_ca_system_score_gemma":0.00079706335,"threshold_uncertainty_score":0.0049343705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27026173,0.0012645491,0.6374379,0.0047287825,0.00011347529,0.0004150611,0.00010624221,0.00041411654,0.08525822],"genre_scores_gemma":[0.96870416,0.00027009842,0.028203312,0.00029039523,0.000051184925,0.000060131788,0.000022253369,0.000036454876,0.0023620473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984993,0.0007225788,0.000027751603,0.0001409391,0.0003901256,0.0002193425],"domain_scores_gemma":[0.9988901,0.0003676216,0.00017146708,0.000053289674,0.00030857453,0.00020898979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018137065,0.0009164054,0.0006021977,0.00090998027,0.00043509103,0.0019329147,0.0010044135,0.0014066397,0.0019624038],"category_scores_gemma":[0.0025716776,0.0002969959,0.0002450499,0.0008443901,0.0005111261,0.0014682631,0.0007984392,0.00068865006,0.00029529477],"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.0006269581,0.0009900249,0.008255678,0.00034794002,0.00019303206,0.0006237846,0.0004972753,0.46474442,0.024861874,0.14178155,0.010617268,0.34646013],"study_design_scores_gemma":[0.0000760137,0.0005672956,0.0057406262,0.00004879932,0.00011772054,0.00044322354,0.000338597,0.9266608,0.008137034,0.051570505,0.006246271,0.00005314842],"about_ca_topic_score_codex":0.0009873902,"about_ca_topic_score_gemma":0.002347708,"teacher_disagreement_score":0.0019624038,"about_ca_system_score_codex":0.0016605298,"about_ca_system_score_gemma":0.0018601384,"threshold_uncertainty_score":0.012048006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78418726,0.002485492,0.17561312,0.000875799,0.00021311169,0.00020738435,0.00027618342,0.0028493237,0.033292305],"genre_scores_gemma":[0.98999655,0.00027996887,0.007884916,0.000047705653,0.00005146408,0.00004306962,0.00011030755,0.000052317962,0.0015337364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996062,0.00009713909,0.000015702517,0.00003740288,0.00015177681,0.000091756825],"domain_scores_gemma":[0.9984433,0.000815587,0.00013975767,0.00012994933,0.0003856854,0.00008581611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088678364,0.00044808636,0.00027212812,0.0016723488,0.0010395849,0.0015235172,0.000914632,0.0005258221,0.0028321473],"category_scores_gemma":[0.004379691,0.00017392781,0.00016574582,0.0010551322,0.00031530223,0.0010458336,0.00043803224,0.0004051385,0.00044615436],"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.0013928366,0.00053258217,0.010820131,0.00028656016,0.000078075216,0.0004787997,0.00073185825,0.543102,0.1069354,0.030556954,0.007701234,0.2973835],"study_design_scores_gemma":[0.000037843794,0.00023640398,0.0038429068,0.000035113695,0.0000588479,0.00017441098,0.00020798712,0.952389,0.030801604,0.00578688,0.006398648,0.000030348172],"about_ca_topic_score_codex":0.0042029265,"about_ca_topic_score_gemma":0.0057475837,"teacher_disagreement_score":0.0042029265,"about_ca_system_score_codex":0.0013334093,"about_ca_system_score_gemma":0.0005533772,"threshold_uncertainty_score":0.009674668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5943466,0.001471171,0.39744595,0.0008132431,0.00021261816,0.00014489974,0.00007102333,0.000541099,0.0049533457],"genre_scores_gemma":[0.9883172,0.00014554596,0.010916577,0.000051923533,0.000041438132,0.000012861123,0.000025527757,0.00001888846,0.00047002753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854666,0.0004163091,0.0001189051,0.00013366871,0.0004916842,0.00029268189],"domain_scores_gemma":[0.9949399,0.002132796,0.0006123192,0.0004710148,0.0015419977,0.000301908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003700206,0.0005609981,0.0007633116,0.0008401817,0.00075250294,0.0024846522,0.0013847149,0.00080724934,0.00061615126],"category_scores_gemma":[0.008916527,0.0003919403,0.00028035822,0.00090588746,0.0006322101,0.0022369109,0.0010075815,0.0011388335,0.00016739157],"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.0015093931,0.0009082021,0.017751325,0.0001997617,0.00021158106,0.00044924289,0.0009875284,0.5348586,0.1276085,0.04479222,0.002673767,0.2680498],"study_design_scores_gemma":[0.000043496653,0.00015737415,0.0021911243,0.00001100628,0.000078954334,0.000070929615,0.000089067384,0.9747386,0.012513813,0.009121735,0.0009565697,0.000027353839],"about_ca_topic_score_codex":0.0029694368,"about_ca_topic_score_gemma":0.0033614314,"teacher_disagreement_score":0.003700206,"about_ca_system_score_codex":0.002056252,"about_ca_system_score_gemma":0.0010485896,"threshold_uncertainty_score":0.0195688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1343356,0.0024014064,0.85873926,0.00032942748,0.000361156,0.00026925438,0.0001565494,0.001554347,0.0018530183],"genre_scores_gemma":[0.82396907,0.0006517922,0.17230959,0.00019940114,0.00019944242,0.0001913112,0.00018161222,0.000053395015,0.0022444092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996203,0.00006991896,0.000039879258,0.00007064639,0.00012635755,0.00007281753],"domain_scores_gemma":[0.9992867,0.00019721671,0.000120750505,0.0001291992,0.00018892168,0.00007717279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226873,0.00051078515,0.00042570598,0.0006477936,0.0007108811,0.0012526112,0.0022211664,0.00048356134,0.0010257346],"category_scores_gemma":[0.0016559504,0.0002726587,0.00022365338,0.0004917971,0.00056545134,0.002068032,0.00073803245,0.0006926004,0.0001998478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017676925,0.0006744673,0.009527156,0.000840191,0.000147212,0.00059052894,0.00090853847,0.13886458,0.2288801,0.07737178,0.0057896185,0.53463817],"study_design_scores_gemma":[0.0003507299,0.001239701,0.0016092855,0.00006091216,0.00022789568,0.0007099739,0.0001314485,0.8876051,0.07464641,0.010370332,0.02294034,0.00010792178],"about_ca_topic_score_codex":0.0017582278,"about_ca_topic_score_gemma":0.0023357593,"teacher_disagreement_score":0.0022211664,"about_ca_system_score_codex":0.0008636103,"about_ca_system_score_gemma":0.0010457878,"threshold_uncertainty_score":0.006265998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828486,0.00012289647,0.013232433,0.0001721549,0.00010052783,0.000027505146,0.0001729367,0.0005741382,0.002748805],"genre_scores_gemma":[0.9931503,0.000055210116,0.0051377974,0.00003662777,0.000009444337,0.000022321776,0.0001016575,0.00011591252,0.0013707015],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.000041102256,0.000014682166,0.000048753704,0.000081821076,0.00008178628],"domain_scores_gemma":[0.99771845,0.0012051979,0.00015067437,0.0005128136,0.00022171454,0.0001911902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006000887,0.00044099765,0.0006333783,0.0004140141,0.00063856575,0.0006660891,0.0010277927,0.00055108755,0.0033930552],"category_scores_gemma":[0.0029873236,0.00029399386,0.00022143326,0.00058966974,0.0009562475,0.0012011937,0.00060897,0.0011621087,0.0002616372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017381929,0.005536092,0.005715188,0.0006940905,0.0002186345,0.00079063023,0.0005252778,0.3230713,0.51896393,0.04832601,0.0067692,0.07200776],"study_design_scores_gemma":[0.0005967384,0.001439601,0.0012652026,0.000013180375,0.00004476994,0.0001025366,0.00012450844,0.74577487,0.24259399,0.0067996364,0.0012045978,0.00004037089],"about_ca_topic_score_codex":0.0021311855,"about_ca_topic_score_gemma":0.0010706354,"teacher_disagreement_score":0.0033930552,"about_ca_system_score_codex":0.00043196022,"about_ca_system_score_gemma":0.00063674105,"threshold_uncertainty_score":0.01135087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076790694,0.0027801697,0.95658267,0.0007495896,0.00041048648,0.000091247704,0.00022740434,0.0002855245,0.031193856],"genre_scores_gemma":[0.54973316,0.013621117,0.33209103,0.00068214885,0.0011507339,0.00045510125,0.0009046463,0.0005002487,0.10086171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.00006816894,0.000016687683,0.00007414588,0.00016183245,0.00004555101],"domain_scores_gemma":[0.9995245,0.000198312,0.000051874864,0.00004961764,0.00015358557,0.000022147971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045122008,0.00081851246,0.00089728675,0.0011852167,0.000990724,0.0020349033,0.0009331022,0.0011472803,0.006647672],"category_scores_gemma":[0.0023107445,0.00029289856,0.00093851157,0.0007279071,0.0010329068,0.0021299254,0.0012201442,0.00096572924,0.0012135111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022636079,0.00004716702,0.0006646344,0.000120880875,0.000026575055,0.00012412689,0.0001695447,0.29303282,0.0037790826,0.661687,0.0054867445,0.034838744],"study_design_scores_gemma":[0.0000062292575,0.000018205139,0.00024443443,0.00003950457,0.000009654671,0.0001152953,0.00004646593,0.8580188,0.0011135351,0.11379719,0.026570858,0.000019805866],"about_ca_topic_score_codex":0.005122934,"about_ca_topic_score_gemma":0.0017858223,"teacher_disagreement_score":0.006647672,"about_ca_system_score_codex":0.0010987772,"about_ca_system_score_gemma":0.001231142,"threshold_uncertainty_score":0.022238672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01465773,0.00023012426,0.97890544,0.00016365584,0.00012161778,0.00007451573,0.00007427932,0.0014296741,0.0043428796],"genre_scores_gemma":[0.27145025,0.0002605015,0.71682626,0.00016780518,0.00008747378,0.00021647452,0.00031605057,0.00022423592,0.010450877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971825,0.00005027339,0.000013393119,0.000049103797,0.00012815448,0.000040864415],"domain_scores_gemma":[0.9996414,0.00011841318,0.000026774998,0.000070400245,0.00011464485,0.000028258628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048331826,0.00051052426,0.0007803139,0.00064707315,0.00057910336,0.0007126429,0.0014320961,0.00064516795,0.0041352245],"category_scores_gemma":[0.0010065372,0.00024308586,0.00025550436,0.0007004754,0.00029170193,0.0011266158,0.0008568766,0.000953029,0.0008306048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003447482,0.00038281124,0.00039951195,0.000089750356,0.000033900244,0.000057150522,0.00006189205,0.2413041,0.011000902,0.028190121,0.010017549,0.7081176],"study_design_scores_gemma":[0.000031714684,0.00003833881,0.00009861336,0.000004447259,0.000009476904,0.000037706246,0.00000933717,0.9878328,0.0025380335,0.0070274784,0.0023649677,0.0000071086574],"about_ca_topic_score_codex":0.0018813405,"about_ca_topic_score_gemma":0.0031445855,"teacher_disagreement_score":0.0041352245,"about_ca_system_score_codex":0.0007901483,"about_ca_system_score_gemma":0.000976984,"threshold_uncertainty_score":0.013833702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030607903,0.0060933423,0.88874376,0.008659666,0.00079508475,0.00059973804,0.00013343136,0.0010440996,0.06332298],"genre_scores_gemma":[0.6225338,0.007054406,0.34142116,0.0027698576,0.0010101025,0.0017395129,0.00024464724,0.000538805,0.02268771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944666,0.0022402536,0.00021494593,0.00027118227,0.0025005809,0.00030644197],"domain_scores_gemma":[0.9935707,0.0033904042,0.00045284777,0.00069194415,0.0017331442,0.0001610087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004569509,0.00094915694,0.0007088107,0.00058999273,0.0014071522,0.0034192041,0.0019416801,0.0028418312,0.0052869185],"category_scores_gemma":[0.014964443,0.0008094123,0.00053578435,0.00061790284,0.001412604,0.004688431,0.0010176387,0.001978531,0.002174607],"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.0002108533,0.00015263575,0.0010544937,0.0010788421,0.000085916996,0.0004228648,0.0004260186,0.26640996,0.02683837,0.6168455,0.0073733493,0.07910112],"study_design_scores_gemma":[0.0001854891,0.0008292861,0.0006698149,0.00027824347,0.00022384097,0.0011840283,0.00031537504,0.4435348,0.014642586,0.3976381,0.14038992,0.00010851487],"about_ca_topic_score_codex":0.0006857439,"about_ca_topic_score_gemma":0.0009084334,"teacher_disagreement_score":0.0052869185,"about_ca_system_score_codex":0.0015204144,"about_ca_system_score_gemma":0.0012020917,"threshold_uncertainty_score":0.024166226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01327997,0.00035729245,0.98007065,0.00017432534,0.000037627935,0.000034252917,0.000013370747,0.00015367894,0.0058788164],"genre_scores_gemma":[0.8888482,0.00067136815,0.10416261,0.00021292079,0.00007210739,0.00013745259,0.000034265693,0.00006124065,0.0057997936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996532,0.00012046049,0.000012188107,0.00005445364,0.00011061394,0.000049068116],"domain_scores_gemma":[0.99961287,0.00021017512,0.000051071533,0.000016019187,0.0000957258,0.0000142092495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007713792,0.0009010011,0.00065592857,0.00027090783,0.00024846403,0.00096268253,0.00094673503,0.0007185781,0.0019318655],"category_scores_gemma":[0.001323519,0.0002777999,0.00031939536,0.00025689325,0.0005938788,0.000760405,0.00053972396,0.0009350882,0.00027405383],"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.000049595117,0.000043995988,0.00012557603,0.00008344355,0.000022269538,0.000045700403,0.000048922277,0.94933707,0.0052083577,0.018955963,0.0005232739,0.025555816],"study_design_scores_gemma":[0.000007522671,0.000034351175,0.000030161045,0.0000036721883,0.0000048410934,0.0000066972884,0.0000061617516,0.9961993,0.00068745966,0.0026834977,0.00033291266,0.000003485765],"about_ca_topic_score_codex":0.0024717904,"about_ca_topic_score_gemma":0.0015972066,"teacher_disagreement_score":0.0024717904,"about_ca_system_score_codex":0.00056194025,"about_ca_system_score_gemma":0.0007513991,"threshold_uncertainty_score":0.006462753},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06418326,0.002806438,0.86096126,0.00063360116,0.001462556,0.00037559393,0.0003088382,0.016266387,0.053002167],"genre_scores_gemma":[0.76241344,0.001880019,0.19379827,0.00036365626,0.00063082896,0.00027925684,0.0005788202,0.0008273771,0.03922836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996039,0.00005844131,0.000042837757,0.00006582229,0.00016423363,0.00006485108],"domain_scores_gemma":[0.9989887,0.00015991676,0.00010093049,0.0005381751,0.00016898518,0.000043185904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760215,0.0006960412,0.00053428253,0.00091740827,0.0008612289,0.0021245012,0.0018612603,0.0007160362,0.0042975266],"category_scores_gemma":[0.0011717656,0.00035376695,0.00044905598,0.0007249574,0.00053393096,0.0015897426,0.0009362913,0.0012023424,0.0016343419],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012649888,0.0003146757,0.0012046176,0.00068055734,0.00023911613,0.0011973481,0.00039925633,0.057945807,0.2689357,0.16492318,0.030654877,0.4722399],"study_design_scores_gemma":[0.00020427513,0.0010668176,0.0017981965,0.00015376424,0.0005624484,0.0022452604,0.00013232548,0.5070893,0.27199632,0.05298711,0.16150638,0.0002578298],"about_ca_topic_score_codex":0.00043314527,"about_ca_topic_score_gemma":0.00070885115,"teacher_disagreement_score":0.0042975266,"about_ca_system_score_codex":0.0003977286,"about_ca_system_score_gemma":0.00041011933,"threshold_uncertainty_score":0.01437664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9613266,0.0012450571,0.027146947,0.00030030066,0.00007808748,0.000051093702,0.00014886999,0.0015015404,0.008201578],"genre_scores_gemma":[0.98946303,0.00020878381,0.009153759,0.000068493784,0.000011366182,0.000015636804,0.000117625284,0.000035047517,0.0009263908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918336,0.00029567492,0.00003578388,0.00010155357,0.00022407391,0.00015966337],"domain_scores_gemma":[0.99676275,0.001660258,0.00018485094,0.00027759155,0.000906181,0.00020830419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020229772,0.0004578053,0.00053063896,0.0005066277,0.00039210345,0.00050515984,0.0009364969,0.00048093146,0.0009182723],"category_scores_gemma":[0.004156526,0.00016162284,0.000106633255,0.000518846,0.00045373294,0.0011986814,0.0007493361,0.00028911815,0.0001404611],"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.004077862,0.00054554135,0.013225894,0.00048239843,0.00018159271,0.00028658158,0.00024831342,0.7663265,0.064320944,0.004178087,0.0044492427,0.14167717],"study_design_scores_gemma":[0.00009114302,0.00068726845,0.003835647,0.000017462198,0.00003558329,0.00012521424,0.00007199458,0.96811074,0.024848718,0.0007575622,0.0013952577,0.000023406747],"about_ca_topic_score_codex":0.0052445577,"about_ca_topic_score_gemma":0.0049797194,"teacher_disagreement_score":0.0052445577,"about_ca_system_score_codex":0.0009948716,"about_ca_system_score_gemma":0.00051610696,"threshold_uncertainty_score":0.010698676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02288763,0.00023694863,0.97300965,0.00012001824,0.00014020158,0.000047774345,0.000009888238,0.0012767983,0.0022711044],"genre_scores_gemma":[0.8827505,0.00013135154,0.11465337,0.00015786028,0.00016736312,0.00011515893,0.00002475849,0.0000419613,0.0019577586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.000049879716,0.000020991723,0.00007795966,0.00016809811,0.000029001032],"domain_scores_gemma":[0.99954563,0.00009416961,0.000063144274,0.00005630116,0.0002145271,0.000026292568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014873,0.0004002578,0.0003172277,0.00040891478,0.0003736052,0.00050970644,0.0011168576,0.00047512594,0.0010436678],"category_scores_gemma":[0.0010524212,0.00018716727,0.00025982747,0.00021034868,0.00039834462,0.0004722427,0.00033459137,0.00073825085,0.0002922475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005280123,0.0005217939,0.0024522291,0.0002753446,0.00011118065,0.00031247767,0.00027751605,0.2406978,0.22783644,0.030552639,0.0049479217,0.49148655],"study_design_scores_gemma":[0.0000753654,0.00022103662,0.00043288432,0.000006140738,0.000029386621,0.00012048388,0.0000070952638,0.97216034,0.021939805,0.0024104775,0.0025796841,0.000017325827],"about_ca_topic_score_codex":0.00071461994,"about_ca_topic_score_gemma":0.00056335144,"teacher_disagreement_score":0.0011168576,"about_ca_system_score_codex":0.00036125068,"about_ca_system_score_gemma":0.0004020425,"threshold_uncertainty_score":0.0034914613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8319771,0.0013300503,0.15628234,0.00074815116,0.00011220635,0.0001447737,0.0004695224,0.0008778846,0.008058075],"genre_scores_gemma":[0.9744485,0.00036696013,0.023944017,0.000035451194,0.00002299186,0.00004538625,0.000403376,0.000043959204,0.0006894661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994388,0.00016536645,0.000021966312,0.000037082496,0.0002592465,0.00007755546],"domain_scores_gemma":[0.9988846,0.0004705479,0.00013129823,0.0001810299,0.00026285596,0.00006965893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013586159,0.0002720127,0.00031521084,0.00032120373,0.0005635279,0.00066316774,0.00077349175,0.00037228956,0.0016332632],"category_scores_gemma":[0.005472764,0.00021788984,0.0001895507,0.00072395115,0.00040892573,0.0011623944,0.00042164262,0.0010324533,0.00019184133],"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.0003267901,0.00011001564,0.010443305,0.00017266112,0.000037763963,0.00013931784,0.00010408118,0.9037791,0.014124321,0.014008226,0.0028659827,0.053888604],"study_design_scores_gemma":[0.000050847524,0.0003122325,0.004293142,0.000010855083,0.000022275988,0.00008511421,0.000038029866,0.9809152,0.0053669624,0.0056181005,0.0032672824,0.00001996902],"about_ca_topic_score_codex":0.015012618,"about_ca_topic_score_gemma":0.019119332,"teacher_disagreement_score":0.015012618,"about_ca_system_score_codex":0.00076433463,"about_ca_system_score_gemma":0.001996687,"threshold_uncertainty_score":0.029850483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33931217,0.00064023363,0.6416506,0.00198872,0.0003011501,0.00015761051,0.00022890395,0.0004749729,0.015245548],"genre_scores_gemma":[0.9713926,0.00018977847,0.02276897,0.00012923956,0.00019598988,0.00011364192,0.00006126857,0.00011992383,0.00502856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709237,0.0012978384,0.00010651103,0.00040362656,0.0006227317,0.00047688204],"domain_scores_gemma":[0.9778175,0.016009422,0.0011075927,0.0012814782,0.002809018,0.0009750103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059406324,0.0009274261,0.001602192,0.0014285395,0.0023843993,0.0041173366,0.0021482685,0.0018490808,0.0042902487],"category_scores_gemma":[0.028266033,0.0006627994,0.00072876713,0.0013188953,0.0034524554,0.0035659284,0.0024287042,0.0024159888,0.0006755083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019362641,0.00017867735,0.0012189146,0.000069607384,0.000073756506,0.00016585056,0.00068359205,0.24734253,0.014332466,0.7159084,0.0019480931,0.016141837],"study_design_scores_gemma":[0.00009042997,0.00008304139,0.00021132563,0.000009182053,0.000023347675,0.000041830684,0.000040073333,0.87693906,0.0018446579,0.12032789,0.00035983682,0.000029337152],"about_ca_topic_score_codex":0.0036021327,"about_ca_topic_score_gemma":0.001440715,"teacher_disagreement_score":0.0059406324,"about_ca_system_score_codex":0.0032249268,"about_ca_system_score_gemma":0.0034272303,"threshold_uncertainty_score":0.03141743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08932371,0.0011195755,0.90475464,0.00022283602,0.00022545907,0.00016441023,0.000034906614,0.0018067835,0.0023476153],"genre_scores_gemma":[0.93129116,0.00027620172,0.06750701,0.00006574101,0.000120480996,0.00005916914,0.00003257372,0.00003683311,0.0006108569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998845,0.000267584,0.00008253703,0.00020401126,0.00049995375,0.0001008593],"domain_scores_gemma":[0.9971673,0.0011241133,0.0004011932,0.00032859962,0.00085443776,0.00012437244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011768293,0.00065973407,0.00056150364,0.0013124308,0.00055537827,0.0009888823,0.0018712787,0.00056123984,0.00050338235],"category_scores_gemma":[0.0036475358,0.00032515457,0.00033084842,0.0005195928,0.0008416934,0.0014206439,0.00073781377,0.00089983945,0.00009036394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080801424,0.0007860458,0.0070160166,0.00051455945,0.0002989871,0.0003244247,0.0005392613,0.24375695,0.2053047,0.028939795,0.0037278472,0.5079835],"study_design_scores_gemma":[0.00009309377,0.00033714355,0.0012483327,0.000023333869,0.00011246271,0.00021883183,0.000021187941,0.9442013,0.04706231,0.0030953258,0.0035093473,0.000077450546],"about_ca_topic_score_codex":0.0024140265,"about_ca_topic_score_gemma":0.0016307546,"teacher_disagreement_score":0.0024140265,"about_ca_system_score_codex":0.00059313915,"about_ca_system_score_gemma":0.00059235306,"threshold_uncertainty_score":0.006223798},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079848915,0.004855519,0.8541287,0.001226602,0.0003295983,0.00038273144,0.00029673256,0.0023343996,0.05659686],"genre_scores_gemma":[0.6414181,0.004366601,0.32329357,0.0002293647,0.00041051142,0.0002550291,0.00086828513,0.0002666872,0.028891778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00005803212,0.000018638899,0.000026037662,0.00016224495,0.000048877548],"domain_scores_gemma":[0.9997738,0.000041321604,0.00002483924,0.00003622902,0.000104401544,0.000019510382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076857634,0.0003243304,0.00014785115,0.0006065539,0.00044907205,0.0008016408,0.0005150216,0.00037786423,0.00149529],"category_scores_gemma":[0.0009805551,0.00012768891,0.00020334823,0.00038918995,0.00024494875,0.00066333497,0.00036205765,0.0005575027,0.00066600373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024589337,0.00024838388,0.0026700958,0.00026481462,0.000036779104,0.00031876063,0.0010904301,0.016811602,0.16737506,0.09437884,0.014988794,0.7015706],"study_design_scores_gemma":[0.000085116466,0.0005495734,0.010497038,0.0002414474,0.00017012897,0.0011426349,0.00082043395,0.35661012,0.24506414,0.03952511,0.34519175,0.00010248272],"about_ca_topic_score_codex":0.0027317812,"about_ca_topic_score_gemma":0.0027334003,"teacher_disagreement_score":0.0027317812,"about_ca_system_score_codex":0.0008888748,"about_ca_system_score_gemma":0.0005276534,"threshold_uncertainty_score":0.0064492226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441427,0.00052198826,0.446488,0.00015204493,0.000103231076,0.0005023527,0.00014865502,0.003161995,0.0047790254],"genre_scores_gemma":[0.92155105,0.000080145255,0.07693466,0.000039844534,0.000018184039,0.00009390925,0.000057063233,0.000053123083,0.0011720128],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992192,0.00023297744,0.00004602256,0.00010431973,0.00029239594,0.00010514564],"domain_scores_gemma":[0.9979886,0.00064566947,0.0002230857,0.00017766448,0.00082184677,0.00014321558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300945,0.00042200997,0.00044475668,0.00050239416,0.00043059938,0.0006703214,0.0018205399,0.00050750934,0.0015425069],"category_scores_gemma":[0.0024484128,0.00026946398,0.00019195276,0.0002541319,0.00027045413,0.00050446193,0.0003000989,0.0003052389,0.0001954336],"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.003287724,0.0011037599,0.013562505,0.00069345307,0.00027989992,0.00034735948,0.00030126466,0.21756786,0.44059843,0.006903456,0.0024487048,0.3129056],"study_design_scores_gemma":[0.00021600696,0.002496514,0.0026954703,0.00001446505,0.00020113507,0.00013873736,0.00006911223,0.85323846,0.13746442,0.00048774248,0.0029549848,0.000022853785],"about_ca_topic_score_codex":0.0028518655,"about_ca_topic_score_gemma":0.0029010093,"teacher_disagreement_score":0.0028518655,"about_ca_system_score_codex":0.0009497427,"about_ca_system_score_gemma":0.00066730904,"threshold_uncertainty_score":0.0070343018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39593133,0.0012188461,0.5903989,0.00034754872,0.0001466689,0.000060662293,0.00006740721,0.000918953,0.010909683],"genre_scores_gemma":[0.92212975,0.00032410488,0.07506438,0.000030405037,0.000069591726,0.00003112521,0.000054267235,0.00012418944,0.0021721506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.0002580082,0.000030187799,0.00009738999,0.00025133204,0.00010021849],"domain_scores_gemma":[0.99593544,0.0026443785,0.00023530716,0.00032913522,0.0006892638,0.0001664582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746249,0.0006470266,0.00066651584,0.0010776792,0.00063056336,0.00069160876,0.0009816188,0.00072831305,0.0019308652],"category_scores_gemma":[0.008404541,0.0003089931,0.00027897517,0.0008789472,0.00064393226,0.0018359649,0.00079847424,0.00095146935,0.00026228908],"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.0009573904,0.00018066818,0.001333499,0.000079077116,0.000043251333,0.000099658515,0.00015301148,0.7923596,0.034379046,0.030342003,0.002174826,0.13789794],"study_design_scores_gemma":[0.000014656304,0.00009574462,0.00018806876,0.0000036048934,0.00001531892,0.000035235313,0.000014038621,0.9901328,0.0039764526,0.005323845,0.00019463066,0.000005551892],"about_ca_topic_score_codex":0.0011335377,"about_ca_topic_score_gemma":0.0013346887,"teacher_disagreement_score":0.0019308652,"about_ca_system_score_codex":0.0008741257,"about_ca_system_score_gemma":0.0006316481,"threshold_uncertainty_score":0.009235203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043523382,0.002385923,0.91060567,0.0010180024,0.00081839215,0.00045562765,0.00063175225,0.0051997234,0.035361465],"genre_scores_gemma":[0.37974522,0.0038157767,0.5936643,0.00055498705,0.00078629015,0.00063821353,0.0019185218,0.0004206531,0.018456167],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992368,0.00015464028,0.00006794339,0.000052551222,0.00034367142,0.00014444414],"domain_scores_gemma":[0.9985494,0.00024419877,0.00012289149,0.00038925305,0.000596971,0.000097323245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016451895,0.0006078212,0.00040493635,0.00085915683,0.00073719,0.00076599454,0.0011516677,0.0007932645,0.0033120262],"category_scores_gemma":[0.0035426987,0.00028534676,0.0006716029,0.0005981218,0.0003470595,0.0026165983,0.0013474239,0.0013086643,0.0012889482],"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.00043219642,0.00037099703,0.0017634076,0.0005010925,0.0000901681,0.0009315743,0.0005063607,0.04831243,0.025560087,0.2856431,0.044368904,0.5915197],"study_design_scores_gemma":[0.0001694763,0.00062334567,0.0013266325,0.0002551255,0.00019328498,0.0023416744,0.00022073204,0.28382322,0.019961987,0.28496847,0.4059391,0.00017699179],"about_ca_topic_score_codex":0.000945193,"about_ca_topic_score_gemma":0.0010513354,"teacher_disagreement_score":0.0033120262,"about_ca_system_score_codex":0.000414888,"about_ca_system_score_gemma":0.0008633647,"threshold_uncertainty_score":0.011079788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9421039,0.0014273856,0.049156033,0.0002968038,0.000093550705,0.00006901813,0.00014833703,0.0016043349,0.005100659],"genre_scores_gemma":[0.9976889,0.0001209552,0.0015162821,0.000014524793,0.000024293458,0.000007746579,0.00005542255,0.000025565576,0.00054639846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997532,0.0006364231,0.00011081948,0.0002432869,0.0010019634,0.0004754512],"domain_scores_gemma":[0.9959311,0.0019449133,0.0002989236,0.0004930676,0.0011481256,0.00018379428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015427853,0.00077509444,0.00095437566,0.0012088997,0.0007257527,0.001331164,0.00091765483,0.0007047307,0.0025337082],"category_scores_gemma":[0.0037309139,0.00026498133,0.0003980497,0.0009281509,0.00064096844,0.0015823359,0.00048098195,0.0004986055,0.0004851105],"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.0107706515,0.0009383826,0.024911352,0.0006793794,0.00038898253,0.00080905476,0.00048284314,0.62703335,0.16537808,0.031290967,0.008060132,0.12925681],"study_design_scores_gemma":[0.000037365382,0.00042119122,0.0027320627,0.0000061505566,0.00006050222,0.000113945425,0.000041951695,0.9798274,0.015204211,0.0012949499,0.00024256924,0.000017682705],"about_ca_topic_score_codex":0.0030671896,"about_ca_topic_score_gemma":0.0016650368,"teacher_disagreement_score":0.0030671896,"about_ca_system_score_codex":0.0019934145,"about_ca_system_score_gemma":0.00078826887,"threshold_uncertainty_score":0.0144633055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005686438,0.0011680868,0.9902002,0.00018138776,0.000031936062,0.000010913166,0.00004945307,0.00011211687,0.0025593562],"genre_scores_gemma":[0.61818624,0.0035423792,0.36097866,0.00020104669,0.00046625637,0.00017884292,0.00024833792,0.00014560865,0.016052568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997439,0.000082919214,0.000018877112,0.00005045162,0.00007466086,0.000029348908],"domain_scores_gemma":[0.9992391,0.0005235433,0.00004664679,0.000041885196,0.00013298221,0.000015911173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827107,0.0006343636,0.0006438804,0.0006908996,0.0002970429,0.0010902217,0.001240139,0.0011207418,0.0015552782],"category_scores_gemma":[0.002808383,0.00048741416,0.00042404764,0.00087451516,0.00073550764,0.0019367224,0.0005393372,0.0012002033,0.00020289737],"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.000025862071,0.000023327608,0.00024342329,0.000056984336,0.000031358384,0.000031071915,0.00003291641,0.86178565,0.0017452396,0.060326185,0.001184584,0.07451329],"study_design_scores_gemma":[5.8682997e-7,0.0000028374172,0.000053967768,0.0000028916313,0.0000029529638,0.0000053092504,0.0000021639335,0.9831014,0.0002258214,0.016392265,0.00020693228,0.0000028452944],"about_ca_topic_score_codex":0.0068871784,"about_ca_topic_score_gemma":0.0056398413,"teacher_disagreement_score":0.0068871784,"about_ca_system_score_codex":0.00087104645,"about_ca_system_score_gemma":0.00045213397,"threshold_uncertainty_score":0.013694167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8345728,0.00030389626,0.16116259,0.00019948087,0.000019978463,0.000052067924,0.000106271145,0.00026096182,0.003321897],"genre_scores_gemma":[0.9961182,0.000108233435,0.0029877129,0.000020131627,0.000011302893,0.00002429088,0.000037876365,0.00002235151,0.0006699263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999514,0.00015742415,0.000021569174,0.0000661974,0.0001320966,0.00010867618],"domain_scores_gemma":[0.99047685,0.0065059154,0.001519371,0.00040691474,0.00072149927,0.00036940968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023758565,0.00053446967,0.00045924442,0.001266,0.00051185547,0.0009368977,0.0009313928,0.0006739162,0.0021302437],"category_scores_gemma":[0.013895106,0.000351354,0.00035095797,0.0006747475,0.0013516414,0.0014598205,0.0005572495,0.00081719813,0.00019460799],"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.00044668594,0.0001381973,0.017047964,0.00011610418,0.00006268813,0.00072869903,0.0006194352,0.67377627,0.018763276,0.26813245,0.00096569996,0.019202523],"study_design_scores_gemma":[0.000006245452,0.000036491205,0.0013023601,0.000008917201,0.00001020196,0.000121356825,0.000045029996,0.9769588,0.0022610687,0.019093515,0.00013825022,0.000017793518],"about_ca_topic_score_codex":0.0012609966,"about_ca_topic_score_gemma":0.00063261605,"teacher_disagreement_score":0.0023758565,"about_ca_system_score_codex":0.0013414449,"about_ca_system_score_gemma":0.0003953514,"threshold_uncertainty_score":0.012564898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014018137,0.0003422648,0.95061564,0.0003639174,0.00015695136,0.000086342145,0.000040332092,0.00042023958,0.033956114],"genre_scores_gemma":[0.8415744,0.00079648825,0.11575415,0.00035686343,0.00039945924,0.00018042854,0.0001337485,0.00017255172,0.040631887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967694,0.00007787243,0.000014950949,0.00006425998,0.00013624222,0.000029805225],"domain_scores_gemma":[0.9998548,0.00004488905,0.000025768813,0.000011334013,0.000053240412,0.000009890699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047875478,0.00053344236,0.00034162935,0.00024795972,0.00029096892,0.0012373739,0.00080884283,0.0005940401,0.0040350505],"category_scores_gemma":[0.00062943634,0.00014712183,0.00036815804,0.00025772196,0.00045386943,0.0008498479,0.00048256584,0.000951304,0.0006968347],"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.00017791078,0.00022437972,0.00044569856,0.00022458695,0.00005592608,0.00017065676,0.00014900131,0.67578095,0.0282001,0.12700392,0.008420874,0.15914604],"study_design_scores_gemma":[0.00001388055,0.000082146296,0.00007744792,0.00000742798,0.0000059879,0.00001519148,0.000008206796,0.9911459,0.0019528882,0.0033747565,0.0033096704,0.000006561111],"about_ca_topic_score_codex":0.0039617643,"about_ca_topic_score_gemma":0.0035517854,"teacher_disagreement_score":0.0040350505,"about_ca_system_score_codex":0.0007703111,"about_ca_system_score_gemma":0.0009796624,"threshold_uncertainty_score":0.013498604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060119885,0.068189465,0.8715867,0.0060790693,0.0031036383,0.00020288913,0.000060557504,0.0005580375,0.04420768],"genre_scores_gemma":[0.20165184,0.13778308,0.6116367,0.004707412,0.005517604,0.00056497694,0.0002833546,0.00035747336,0.03749759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983884,0.00026070196,0.00012317448,0.0003399264,0.0007829137,0.00010496119],"domain_scores_gemma":[0.99663514,0.0012173011,0.00013880336,0.00022947899,0.0016585384,0.00012075234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032667972,0.0010279607,0.0005059492,0.0014184944,0.00061013823,0.0020725795,0.0020825872,0.002528374,0.0020470289],"category_scores_gemma":[0.005990441,0.0005971879,0.0006406475,0.001299605,0.0017670281,0.0033591317,0.0011950617,0.004085184,0.001067585],"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.000060103364,0.00008893925,0.00038871635,0.0007064568,0.0000336668,0.00016543116,0.00039006324,0.012717969,0.010833248,0.4959146,0.006041038,0.47265983],"study_design_scores_gemma":[0.000063636246,0.00056181796,0.0008707547,0.001148156,0.00009409546,0.00081389403,0.00028693266,0.124300405,0.03301922,0.19680154,0.6419068,0.00013280107],"about_ca_topic_score_codex":0.0022397968,"about_ca_topic_score_gemma":0.00082418125,"teacher_disagreement_score":0.0032667972,"about_ca_system_score_codex":0.0019836728,"about_ca_system_score_gemma":0.0016157104,"threshold_uncertainty_score":0.017276704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8967793,0.00025624793,0.1001496,0.00067033735,0.000106994994,0.000054403037,0.000120321565,0.00024324731,0.0016194896],"genre_scores_gemma":[0.9951617,0.00006018916,0.0033029148,0.000056349552,0.00005134097,0.000016144235,0.00004188418,0.000019635232,0.0012897251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.0002415531,0.00006429818,0.00014293012,0.00024734883,0.00023468686],"domain_scores_gemma":[0.98904604,0.0073497933,0.0012043633,0.00030957142,0.00092970894,0.0011605468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030288526,0.00060287473,0.001098953,0.0013339758,0.0012282055,0.0021337953,0.0018442288,0.0020325514,0.0015150503],"category_scores_gemma":[0.016095147,0.00074422464,0.00057298003,0.0008393036,0.001847171,0.0026205485,0.0016349419,0.0011033313,0.00011162318],"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.0028049108,0.0006865488,0.016371476,0.0001983285,0.00016221995,0.0023111878,0.0011413038,0.8058389,0.020682806,0.13062122,0.0027496296,0.016431555],"study_design_scores_gemma":[0.00003633478,0.000056392826,0.000868509,0.000005148779,0.000025678451,0.00005730143,0.000034918226,0.98953164,0.0007770993,0.00854073,0.000048639347,0.000017612592],"about_ca_topic_score_codex":0.005445978,"about_ca_topic_score_gemma":0.0036940812,"teacher_disagreement_score":0.005445978,"about_ca_system_score_codex":0.0026834093,"about_ca_system_score_gemma":0.001228947,"threshold_uncertainty_score":0.019469619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990168,0.00062764226,0.006940182,0.000041864332,0.000022005774,0.000015385789,0.00005152407,0.00024271155,0.0018907301],"genre_scores_gemma":[0.99831474,0.0000908525,0.0012629528,0.0000055788933,0.000006704192,0.0000022502597,0.00006769908,0.000012064312,0.00023724319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990182,0.00031295072,0.000045549634,0.00006680438,0.00041108284,0.00014545389],"domain_scores_gemma":[0.99876547,0.000594285,0.00010314251,0.00007580227,0.0003667244,0.000094610805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233432,0.00042381103,0.00029048912,0.0005591457,0.000294464,0.0006285935,0.0004369015,0.00039091005,0.00081645563],"category_scores_gemma":[0.0032887708,0.000093539355,0.00012811748,0.0005310934,0.0002137153,0.00063653145,0.00026873304,0.00020194257,0.00012329424],"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.010414288,0.00062835624,0.03289568,0.00052377756,0.00039606416,0.0010552735,0.00037759292,0.46139187,0.25552538,0.003483459,0.0017590189,0.2315493],"study_design_scores_gemma":[0.00009644349,0.002854518,0.0139375795,0.000017913493,0.00012040522,0.00037771722,0.0001304874,0.8575336,0.123440705,0.0003920198,0.0010626778,0.000035996563],"about_ca_topic_score_codex":0.003486662,"about_ca_topic_score_gemma":0.0024675766,"teacher_disagreement_score":0.003486662,"about_ca_system_score_codex":0.00080603786,"about_ca_system_score_gemma":0.00022483229,"threshold_uncertainty_score":0.0069327354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060281284,0.0026928503,0.8387785,0.008832581,0.00076590304,0.00026040192,0.0005129401,0.00049212156,0.08738336],"genre_scores_gemma":[0.7450766,0.0062187547,0.16325371,0.0013883489,0.000571944,0.0007682547,0.00049872143,0.0002907635,0.081932984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903417,0.00027608188,0.000048808368,0.00017505622,0.00037538164,0.000090465546],"domain_scores_gemma":[0.99843067,0.0006416907,0.00020795608,0.00027441172,0.0003308961,0.00011437557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937659,0.00057484454,0.00052646705,0.00087924796,0.0008448754,0.0027459345,0.0010083349,0.0017679401,0.008425466],"category_scores_gemma":[0.0027371908,0.00049194664,0.0007039111,0.0007376753,0.0018150089,0.0042760745,0.001028963,0.0023169068,0.0030925868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014008548,0.00026120275,0.0023762526,0.0003038727,0.000042387626,0.00035101053,0.0015483117,0.06891759,0.010777025,0.85982966,0.00865782,0.04679472],"study_design_scores_gemma":[0.00007691242,0.00028029887,0.00216611,0.00024837913,0.0000539741,0.00054005283,0.0010817512,0.21659909,0.008717597,0.5477213,0.22238733,0.00012716501],"about_ca_topic_score_codex":0.0012283945,"about_ca_topic_score_gemma":0.0009217357,"teacher_disagreement_score":0.008425466,"about_ca_system_score_codex":0.0015324119,"about_ca_system_score_gemma":0.0012043404,"threshold_uncertainty_score":0.028186023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13168854,0.0014223913,0.85851777,0.00016979125,0.00010852401,0.00009152923,0.00010530923,0.00062468403,0.0072715012],"genre_scores_gemma":[0.94533247,0.0004494411,0.05231376,0.000046975838,0.00003112289,0.000060615785,0.000105515166,0.000046922738,0.0016132308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988996,0.00014314755,0.000042079606,0.00015458484,0.0006205322,0.00014008074],"domain_scores_gemma":[0.99777216,0.0010350267,0.00018610797,0.00012382232,0.0008381183,0.00004478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013127495,0.0006363631,0.00036419457,0.0010936033,0.00032343896,0.0007179357,0.0012247564,0.00052542106,0.0014476507],"category_scores_gemma":[0.004705797,0.00021453378,0.00029733617,0.00055749575,0.00043339902,0.0010617322,0.0003240652,0.00084748375,0.00016221045],"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.00042690244,0.0000937052,0.0034232659,0.00014420095,0.000051986757,0.00018928322,0.00012477148,0.86966187,0.028203662,0.04077076,0.0011782423,0.05573138],"study_design_scores_gemma":[0.0000044406315,0.000021909622,0.0003675167,0.0000031038408,0.000004780569,0.000026922915,0.0000036794752,0.99661714,0.001899932,0.0008275153,0.00021641767,0.0000067137466],"about_ca_topic_score_codex":0.004749282,"about_ca_topic_score_gemma":0.0027576343,"teacher_disagreement_score":0.004749282,"about_ca_system_score_codex":0.0014077546,"about_ca_system_score_gemma":0.00094727194,"threshold_uncertainty_score":0.010214031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98271805,0.00008786054,0.0131565165,0.0001581072,0.000025090354,0.00006183518,0.00029908627,0.0002851956,0.0032081874],"genre_scores_gemma":[0.9963654,0.000034085435,0.0031877789,0.00001689701,0.0000024957767,0.00003193711,0.00014193979,0.000012499955,0.00020695808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990094,0.0004264791,0.000060542603,0.0000899613,0.00022182787,0.00019185338],"domain_scores_gemma":[0.99204004,0.0054998705,0.0005698702,0.00046607005,0.0010591097,0.000365001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017454147,0.00061537715,0.0005587765,0.00082218344,0.0003611959,0.0005884091,0.0011020115,0.0007381081,0.0009581179],"category_scores_gemma":[0.005767343,0.00028154886,0.00030941438,0.00069798256,0.00056548044,0.0006585744,0.00042275366,0.00079679483,0.00009228111],"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.000293163,0.00034749001,0.003449998,0.000043918768,0.000048121845,0.000053969412,0.00005813128,0.98662823,0.0026210232,0.0022092308,0.0003352832,0.0039114743],"study_design_scores_gemma":[0.00003308942,0.00012179716,0.00036691027,0.000002644369,0.00000512399,0.000007711735,0.000021442904,0.9975527,0.0014281058,0.0003138263,0.00014124218,0.0000054861302],"about_ca_topic_score_codex":0.010553884,"about_ca_topic_score_gemma":0.0063050813,"teacher_disagreement_score":0.010553884,"about_ca_system_score_codex":0.0015764942,"about_ca_system_score_gemma":0.001006389,"threshold_uncertainty_score":0.020984948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3162891,0.0020332981,0.6763237,0.0003019622,0.00015396393,0.00012685906,0.000031400898,0.0010698494,0.0036698927],"genre_scores_gemma":[0.9858337,0.00018787502,0.01361005,0.000017399967,0.000024598381,0.00003178674,0.000012321609,0.000009831835,0.00027239704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996847,0.00012457599,0.000017167886,0.000045074525,0.00008188825,0.00004668629],"domain_scores_gemma":[0.9992889,0.0003148583,0.0001234243,0.00009792843,0.00011891068,0.000056025514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008136046,0.00036152473,0.00036606763,0.00039950036,0.0004902381,0.00069887284,0.00087977893,0.0003668906,0.00035376844],"category_scores_gemma":[0.0019119696,0.00019286714,0.0002604242,0.00029398658,0.00061345403,0.0007711525,0.0005979642,0.00041747274,0.000053078016],"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.00048011827,0.0001529672,0.003594476,0.00017951395,0.00012083945,0.0006180625,0.00021497694,0.76417017,0.08483146,0.045625184,0.0017877446,0.09822448],"study_design_scores_gemma":[0.000028485214,0.00009493071,0.00040880247,0.000006932848,0.000032092157,0.0000807642,0.00001395735,0.98798233,0.0063559692,0.0037806574,0.001201441,0.000013687339],"about_ca_topic_score_codex":0.0012754848,"about_ca_topic_score_gemma":0.0008971927,"teacher_disagreement_score":0.0012754848,"about_ca_system_score_codex":0.0006041296,"about_ca_system_score_gemma":0.00043213667,"threshold_uncertainty_score":0.004383266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068928576,0.0009134213,0.9828441,0.0004535536,0.00011565666,0.000092263974,0.00005782097,0.00016611174,0.008464152],"genre_scores_gemma":[0.34366757,0.0025881098,0.6432932,0.0002524842,0.0004406524,0.00048905984,0.00021678742,0.00021893992,0.008833117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997109,0.0017258367,0.00008235288,0.00016696948,0.0006106157,0.00030522034],"domain_scores_gemma":[0.9919258,0.0068621226,0.00023418285,0.00041354756,0.00038190986,0.00018254832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044280314,0.0013267695,0.001976549,0.0017093876,0.0013613118,0.002747153,0.0036942672,0.0023597279,0.007004071],"category_scores_gemma":[0.013991308,0.0015251356,0.0011382721,0.0035818594,0.0031536298,0.0035616662,0.001974711,0.003383645,0.0006630806],"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.000070095426,0.00007641415,0.00013595936,0.00010479518,0.00003159355,0.000034615605,0.00011424985,0.6631916,0.00016250648,0.3040669,0.0026067866,0.029404555],"study_design_scores_gemma":[0.00002917067,0.000016575783,0.000025954754,0.000016236418,0.000010314434,0.00001104021,0.000031210464,0.8191736,0.000103209335,0.17928486,0.001290489,0.000007315409],"about_ca_topic_score_codex":0.0044812057,"about_ca_topic_score_gemma":0.004549814,"teacher_disagreement_score":0.007004071,"about_ca_system_score_codex":0.0029763568,"about_ca_system_score_gemma":0.00258689,"threshold_uncertainty_score":0.023431003},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028138098,0.0002922334,0.98784816,0.00036075787,0.00016384665,0.000106795225,0.000023722101,0.0012782186,0.007112502],"genre_scores_gemma":[0.28865805,0.0007377764,0.6889414,0.00046031084,0.00051973027,0.0005436454,0.00014038045,0.0003394249,0.019659245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984036,0.000502121,0.00012174723,0.00023350993,0.0005848445,0.0001541056],"domain_scores_gemma":[0.99746823,0.0011206967,0.00011361346,0.0007722444,0.00036488616,0.0001603029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034425245,0.0004954481,0.00072886475,0.0009079609,0.001500127,0.0027097242,0.0030589437,0.0015928934,0.0042748037],"category_scores_gemma":[0.0054564737,0.0005401086,0.0004440105,0.0010707072,0.0014180209,0.003471677,0.00200164,0.0027793597,0.0013363805],"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.00036528462,0.00029956477,0.0004069029,0.00018300052,0.000059952046,0.00023760267,0.0006242454,0.024073806,0.01912082,0.6988815,0.011485141,0.24426223],"study_design_scores_gemma":[0.00016452816,0.00024917145,0.00031162877,0.000082024555,0.00011811254,0.00063469494,0.0001281713,0.60061014,0.020540945,0.30636948,0.07071802,0.00007307984],"about_ca_topic_score_codex":0.001293742,"about_ca_topic_score_gemma":0.0016077858,"teacher_disagreement_score":0.0042748037,"about_ca_system_score_codex":0.0014147251,"about_ca_system_score_gemma":0.0017027232,"threshold_uncertainty_score":0.01820606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01888706,0.0018293213,0.9317105,0.00059851224,0.00083798607,0.00022491369,0.00019252443,0.01326791,0.032451313],"genre_scores_gemma":[0.39820048,0.002237267,0.5345579,0.00058715313,0.00095196534,0.00043413573,0.0006442115,0.0017139814,0.06067305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929917,0.00011251954,0.00005710768,0.0000844815,0.00034923226,0.000097482174],"domain_scores_gemma":[0.99904114,0.00015230113,0.000064117405,0.0004744082,0.00019912119,0.0000688931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008374031,0.00064033497,0.0005315791,0.0008074112,0.00074624195,0.0020288774,0.0024059217,0.0008707905,0.004417688],"category_scores_gemma":[0.0016090468,0.00053135114,0.00046352833,0.0006752892,0.0007178406,0.0022492798,0.0013396319,0.0022801354,0.0022020233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083448,0.00029628183,0.00094518496,0.00040789173,0.00012727559,0.0006028985,0.00038454722,0.034214664,0.117735155,0.33792567,0.047091078,0.45943487],"study_design_scores_gemma":[0.00017143294,0.000708823,0.001289798,0.0001258216,0.00035702344,0.0018028675,0.00011842344,0.5318146,0.11212571,0.10764164,0.24364765,0.00019625363],"about_ca_topic_score_codex":0.0006880243,"about_ca_topic_score_gemma":0.001053771,"teacher_disagreement_score":0.004417688,"about_ca_system_score_codex":0.00054463616,"about_ca_system_score_gemma":0.0007533083,"threshold_uncertainty_score":0.014778614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014079996,0.0003852556,0.9822161,0.00017718285,0.0001230689,0.00006875898,0.000013835958,0.00034832174,0.002587433],"genre_scores_gemma":[0.40812704,0.00049781305,0.58575416,0.0002103058,0.000118678276,0.00023345294,0.000073037096,0.00006020893,0.004925274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.000071241535,0.000016101407,0.00003811823,0.00014819078,0.00002774702],"domain_scores_gemma":[0.9996119,0.00015667059,0.00003016366,0.000030661377,0.00014680931,0.000023819697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049747777,0.0003661465,0.00029565816,0.00037934422,0.0003228576,0.00043654826,0.00080158236,0.00058804074,0.0014460565],"category_scores_gemma":[0.0017973155,0.000120572804,0.0001833103,0.000359546,0.00037423725,0.0005975116,0.00042946733,0.00065969035,0.00035212206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036332477,0.00018692773,0.0012576673,0.000140409,0.000060045913,0.00014438375,0.00013436783,0.42510825,0.02965663,0.08961225,0.005996809,0.44733894],"study_design_scores_gemma":[0.000034247754,0.0000727033,0.000098344855,0.0000042402135,0.000007551137,0.00004838093,0.0000039822526,0.99256104,0.0018043919,0.003098248,0.0022585401,0.000008294156],"about_ca_topic_score_codex":0.0014818903,"about_ca_topic_score_gemma":0.0011656731,"teacher_disagreement_score":0.0014818903,"about_ca_system_score_codex":0.0005783855,"about_ca_system_score_gemma":0.00052495697,"threshold_uncertainty_score":0.0048375726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17355561,0.00059466437,0.8190744,0.0006145559,0.000093669216,0.00010201274,0.0002496829,0.00087674736,0.0048387176],"genre_scores_gemma":[0.98939764,0.00024282963,0.0077624302,0.0000673647,0.000046999987,0.0000807592,0.000070270675,0.000055873134,0.0022758509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993543,0.000119152304,0.000034907687,0.00012567446,0.00020402305,0.00016189946],"domain_scores_gemma":[0.998173,0.0009648285,0.0002899475,0.00017339118,0.00029154657,0.000107277614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187589,0.0005064546,0.0005937916,0.00090702105,0.0004732711,0.00091345015,0.0017776958,0.0011295016,0.0021685348],"category_scores_gemma":[0.0052952147,0.0003800713,0.0005576502,0.00057285686,0.0010355636,0.0021286164,0.00061720976,0.0013642905,0.00033976938],"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.00008866124,0.0001025959,0.0020333596,0.000053504333,0.000028836183,0.00019477935,0.00013450386,0.9402474,0.008170981,0.038356874,0.000803011,0.009785453],"study_design_scores_gemma":[0.0000042667434,0.000011351386,0.00018628704,0.00000268848,0.0000055441287,0.000027114469,0.0000053853328,0.9944563,0.0003512432,0.004762983,0.00018153386,0.000005234898],"about_ca_topic_score_codex":0.0063054156,"about_ca_topic_score_gemma":0.0022555839,"teacher_disagreement_score":0.0063054156,"about_ca_system_score_codex":0.0014341419,"about_ca_system_score_gemma":0.0009035238,"threshold_uncertainty_score":0.01253742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129220765,0.002724007,0.9293579,0.0014716934,0.0011490086,0.00059544755,0.00033531766,0.0055056843,0.04593885],"genre_scores_gemma":[0.7698814,0.003151419,0.20155777,0.0010986046,0.0008404574,0.000709554,0.00050917186,0.0005349634,0.021716675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775213,0.0005390204,0.00014182672,0.00026134407,0.0010753331,0.00023039726],"domain_scores_gemma":[0.9976794,0.0008903049,0.0002003834,0.0003754078,0.0007134006,0.00014117353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003240539,0.0007353626,0.0007223482,0.00067705225,0.0010065449,0.0024407627,0.0016232945,0.0009069848,0.003704443],"category_scores_gemma":[0.004993264,0.00032324536,0.00038641138,0.00091885217,0.0010983523,0.0014048357,0.0011474295,0.0014947705,0.0023461003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063612184,0.00043132945,0.0013314772,0.0004835842,0.00015851842,0.00050839805,0.00075608253,0.12871891,0.045565784,0.43174872,0.047139633,0.34252152],"study_design_scores_gemma":[0.00027649416,0.00023324811,0.0006462373,0.00012538566,0.000095197174,0.00042960484,0.0001670001,0.6497967,0.030175038,0.17424037,0.14364384,0.00017090187],"about_ca_topic_score_codex":0.0031906369,"about_ca_topic_score_gemma":0.001640608,"teacher_disagreement_score":0.003704443,"about_ca_system_score_codex":0.001050557,"about_ca_system_score_gemma":0.0020199413,"threshold_uncertainty_score":0.017137825},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076310616,0.0075365775,0.27948797,0.0035126791,0.0017363528,0.00019841414,0.00031266676,0.0028120454,0.69677234],"genre_scores_gemma":[0.12142456,0.008017787,0.14227472,0.00080370554,0.0007029448,0.00021593258,0.0004541387,0.00034877335,0.72575736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983096,0.000029259294,0.0000071641944,0.00003416751,0.000070536655,0.000027902166],"domain_scores_gemma":[0.99979585,0.000034127854,0.00001555542,0.000040630533,0.00007730141,0.000036419446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368372,0.000435083,0.00023062543,0.00086476153,0.00072112936,0.0019043076,0.0005971848,0.0008765295,0.015970659],"category_scores_gemma":[0.00066864945,0.00022234618,0.000185745,0.0010108617,0.0004360446,0.001998808,0.0008605214,0.00094148505,0.006744683],"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.000069509646,0.000053826625,0.00040995696,0.00012461685,0.000011702133,0.00017517731,0.0003123107,0.0027011037,0.0059017874,0.49977106,0.13384667,0.35662237],"study_design_scores_gemma":[0.000008942544,0.00003268795,0.00029539483,0.00004834395,0.000012879646,0.00034111345,0.000098006785,0.011169576,0.0020092768,0.015348782,0.9706232,0.000011751793],"about_ca_topic_score_codex":0.0023766896,"about_ca_topic_score_gemma":0.0044141137,"teacher_disagreement_score":0.015970659,"about_ca_system_score_codex":0.0009367406,"about_ca_system_score_gemma":0.0009710426,"threshold_uncertainty_score":0.05342716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006735053,0.00043354311,0.9905724,0.00016207754,0.00009830247,0.000054869804,0.00001652477,0.00011462392,0.0018125939],"genre_scores_gemma":[0.65841717,0.0016126845,0.33497775,0.00018265516,0.0003456208,0.00018630763,0.000051009993,0.000057831447,0.0041690795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990196,0.0003128515,0.000061141975,0.00013705988,0.00033221793,0.00013709885],"domain_scores_gemma":[0.99939203,0.00022194245,0.00007316149,0.000061912964,0.00018840846,0.000062581035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259667,0.0005931937,0.00075774407,0.00078895275,0.00090671825,0.0013468964,0.0018415712,0.000752047,0.001072369],"category_scores_gemma":[0.0017898695,0.00036733417,0.0004931495,0.0010026194,0.0009513244,0.0013651612,0.00082145043,0.0009846874,0.00020305839],"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.000145911,0.000117894655,0.00058524363,0.00014944043,0.0000562316,0.00039623742,0.00029505292,0.5495479,0.013771395,0.32002205,0.002478223,0.112434395],"study_design_scores_gemma":[0.000016160744,0.00005147284,0.000058624886,0.000007707151,0.000014359552,0.000066165085,0.000017756116,0.9702443,0.0010408986,0.026283847,0.0021844355,0.000014275551],"about_ca_topic_score_codex":0.0050847004,"about_ca_topic_score_gemma":0.0046753096,"teacher_disagreement_score":0.0050847004,"about_ca_system_score_codex":0.0018678735,"about_ca_system_score_gemma":0.001718025,"threshold_uncertainty_score":0.013552427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024710132,0.00028287363,0.9706727,0.00022375333,0.000084739244,0.00006375285,0.000026592901,0.0002080007,0.003727363],"genre_scores_gemma":[0.9780124,0.00018755774,0.020062111,0.00006402099,0.000037671547,0.00007468547,0.000027397014,0.000009652468,0.0015244703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974614,0.000050960447,0.000015536709,0.000050315997,0.00010421422,0.000032868855],"domain_scores_gemma":[0.99977976,0.00007882552,0.000038259932,0.00001170645,0.000073678355,0.000017825809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056537,0.0004709963,0.00032355028,0.0002693836,0.0003010609,0.00048620903,0.00075303664,0.00038227826,0.00079826807],"category_scores_gemma":[0.00066968356,0.00016567853,0.00033693065,0.00020464482,0.00045881627,0.00040684312,0.0004583127,0.0006069749,0.000082718994],"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.0001259461,0.00012224869,0.00051881303,0.00017722906,0.00005854904,0.00029979894,0.00023493773,0.8122423,0.029714096,0.07542985,0.001960334,0.0791159],"study_design_scores_gemma":[0.00001120832,0.00006979826,0.00007966561,0.0000031353954,0.000008773331,0.00001450658,0.0000047978256,0.996454,0.0008707,0.002066959,0.00041066384,0.000005848803],"about_ca_topic_score_codex":0.006458467,"about_ca_topic_score_gemma":0.005099182,"teacher_disagreement_score":0.006458467,"about_ca_system_score_codex":0.0009041124,"about_ca_system_score_gemma":0.000993901,"threshold_uncertainty_score":0.012841761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006696961,0.0013209678,0.9433689,0.00090628845,0.00045020605,0.000088680805,0.000060429054,0.00095240254,0.046155166],"genre_scores_gemma":[0.6115105,0.0033901986,0.32830626,0.0006005054,0.0008050323,0.00038609447,0.00022875494,0.00026629533,0.054506436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921525,0.00025256444,0.00004792348,0.00010679726,0.0002891239,0.00008837354],"domain_scores_gemma":[0.99892104,0.0005463673,0.000073600466,0.00025577762,0.00013181343,0.000071446186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017142702,0.0005941837,0.0004449278,0.00045334193,0.00060357933,0.0027549001,0.0018865239,0.0009001383,0.0058504487],"category_scores_gemma":[0.003366944,0.00042221314,0.0003399009,0.0006415252,0.0010260526,0.0038363393,0.0012139649,0.0017924852,0.0011226545],"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.00009649088,0.00012881626,0.00017439114,0.0001091445,0.000033553326,0.00007444059,0.0001704375,0.076310456,0.0023987258,0.75876105,0.009312106,0.1524304],"study_design_scores_gemma":[0.000025824509,0.000046376117,0.000089445435,0.00003804002,0.000027162445,0.00007301946,0.00003876607,0.39725846,0.002668474,0.56281585,0.036899123,0.000019511775],"about_ca_topic_score_codex":0.00081487856,"about_ca_topic_score_gemma":0.0007743096,"teacher_disagreement_score":0.0058504487,"about_ca_system_score_codex":0.0007515502,"about_ca_system_score_gemma":0.00074470247,"threshold_uncertainty_score":0.019571662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027730703,0.0004586766,0.96783864,0.00036624464,0.00003061157,0.000052970743,0.00004940643,0.000071069444,0.0034017283],"genre_scores_gemma":[0.7361188,0.00071080873,0.25384292,0.00012334088,0.00007771418,0.00035170207,0.0001812131,0.00013944825,0.008454045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992269,0.00029263922,0.00002162107,0.000106001164,0.000265647,0.000087065295],"domain_scores_gemma":[0.9992342,0.00046186073,0.00008004682,0.000060669983,0.00010940518,0.0000538701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033877,0.00095096603,0.00067276944,0.00069160777,0.0004504942,0.00076217187,0.0009627994,0.0010201479,0.0022887527],"category_scores_gemma":[0.0026516067,0.00032263112,0.00052455213,0.0010089898,0.00073494366,0.0017767443,0.0013542352,0.00080185203,0.0002531706],"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.00004357372,0.00003418999,0.00019669843,0.0000586518,0.000020800819,0.00003834221,0.00004607269,0.93374974,0.0010401064,0.039947394,0.0011837306,0.023640763],"study_design_scores_gemma":[0.000009038893,0.000033979723,0.00008509514,0.00000620614,0.000005543764,0.00001593055,0.000016949833,0.9731416,0.00043544517,0.025380908,0.00086489995,0.000004484333],"about_ca_topic_score_codex":0.002398266,"about_ca_topic_score_gemma":0.001684759,"teacher_disagreement_score":0.002398266,"about_ca_system_score_codex":0.0012260217,"about_ca_system_score_gemma":0.0008084363,"threshold_uncertainty_score":0.008895457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19597524,0.0002736265,0.80145574,0.00021708793,0.000109674875,0.00003683214,0.000053149888,0.00023101135,0.001647615],"genre_scores_gemma":[0.9731935,0.00014645589,0.025556361,0.00004621308,0.000048218026,0.000028197217,0.000038749626,0.000022086853,0.00092027686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.000115662435,0.000021393196,0.00007369205,0.0002021298,0.00008859321],"domain_scores_gemma":[0.9984748,0.00068565796,0.00022820289,0.00014153015,0.00036068654,0.000109211986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671782,0.00049997855,0.00047696035,0.00052268995,0.00039910065,0.00081253116,0.0012193263,0.00057134865,0.0008634852],"category_scores_gemma":[0.0046420507,0.0003690235,0.00041415085,0.00065453316,0.00050151645,0.0014153408,0.00050282653,0.0008636465,0.00010711377],"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.0002879585,0.0001684212,0.005561893,0.00011777515,0.00007808061,0.0005557325,0.00023189983,0.8068588,0.051137034,0.09141115,0.0015298971,0.04206136],"study_design_scores_gemma":[0.0000032456421,0.000013146669,0.00018600246,8.992972e-7,0.0000031422583,0.000012301194,0.0000068462737,0.99691075,0.0006093097,0.0021839843,0.00006685943,0.000003614],"about_ca_topic_score_codex":0.003838554,"about_ca_topic_score_gemma":0.0034816521,"teacher_disagreement_score":0.003838554,"about_ca_system_score_codex":0.0015996965,"about_ca_system_score_gemma":0.00089139683,"threshold_uncertainty_score":0.011606693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04899691,0.0003133872,0.9377146,0.00023211443,0.00018893315,0.00011302928,0.000070140195,0.0012731309,0.011097898],"genre_scores_gemma":[0.49821776,0.00023799438,0.49306554,0.00015526694,0.000044221928,0.00024240688,0.0001591729,0.00010335653,0.0077741127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999747,0.00008000171,0.000010381014,0.000042497628,0.00008796043,0.000032236396],"domain_scores_gemma":[0.99963427,0.00015097753,0.000023857445,0.000043441152,0.00012915,0.0000183502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005357693,0.0003617052,0.0006243465,0.0007378458,0.0005772153,0.0007935888,0.0010515492,0.00085234124,0.0017823805],"category_scores_gemma":[0.0011621885,0.0002554045,0.000435609,0.000671322,0.00036580669,0.00048391244,0.0005272148,0.0006319203,0.00029880193],"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.000066140194,0.0001108519,0.00087066804,0.00004609265,0.000055389355,0.000073213734,0.0000658924,0.7910558,0.006298947,0.018190268,0.0020421701,0.18112458],"study_design_scores_gemma":[0.000013394915,0.000023891409,0.000119294935,0.0000052502833,0.000013210445,0.000020973093,0.0000074745863,0.99563134,0.0010650102,0.002106431,0.0009864022,0.000007343252],"about_ca_topic_score_codex":0.0070259264,"about_ca_topic_score_gemma":0.0048108664,"teacher_disagreement_score":0.0070259264,"about_ca_system_score_codex":0.00081403024,"about_ca_system_score_gemma":0.0009309634,"threshold_uncertainty_score":0.013970077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02546738,0.00059863407,0.9632462,0.00034853021,0.0004125451,0.0001046228,0.000029045003,0.0010807218,0.008712284],"genre_scores_gemma":[0.9039209,0.00034027637,0.09037441,0.00034306096,0.00038057534,0.00017585588,0.00006674469,0.000061055274,0.004337167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940157,0.00013219855,0.000037336285,0.00012751223,0.00022977585,0.00007160329],"domain_scores_gemma":[0.99941707,0.00012895776,0.000057740344,0.00006180738,0.00028999813,0.000044377965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011085322,0.0006006188,0.00055348146,0.0005318074,0.00075931236,0.001219342,0.0017063373,0.0007710859,0.0014675208],"category_scores_gemma":[0.0014264345,0.00016708222,0.0004140295,0.00031981737,0.00055303815,0.0010249531,0.0007333139,0.0013212017,0.00036941946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046044204,0.0005004447,0.0020919635,0.00028111355,0.00010175037,0.00039886186,0.0003251187,0.29889327,0.0742089,0.19187397,0.0101535665,0.42071062],"study_design_scores_gemma":[0.000017998955,0.000092313974,0.00011318292,0.000008253892,0.000015784386,0.000050507486,0.000013150696,0.98767006,0.0037581953,0.00478936,0.003458618,0.000012507084],"about_ca_topic_score_codex":0.0021727425,"about_ca_topic_score_gemma":0.002159919,"teacher_disagreement_score":0.0021727425,"about_ca_system_score_codex":0.00082433876,"about_ca_system_score_gemma":0.001292322,"threshold_uncertainty_score":0.0059809685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02139863,0.0008873385,0.8964316,0.00037083513,0.0007816216,0.00055717095,0.00034873668,0.06320645,0.016017688],"genre_scores_gemma":[0.59907866,0.0020931154,0.32438764,0.00095242145,0.0006934163,0.0017400975,0.0051711714,0.008338349,0.057545103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867177,0.00028960148,0.00021376774,0.00012194437,0.0005035152,0.00019942796],"domain_scores_gemma":[0.99910873,0.0001316373,0.00007643048,0.0002791374,0.00026828155,0.00013564169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018859187,0.0008448287,0.0008775134,0.0010600736,0.00069744623,0.0025369725,0.0025148308,0.00090080925,0.0053025717],"category_scores_gemma":[0.0023213474,0.0004805784,0.0008697589,0.000850084,0.0006244658,0.0030095435,0.0024448982,0.0018657056,0.0027337668],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027795695,0.0011308065,0.006590513,0.0014605485,0.00051925756,0.001643591,0.0019176862,0.023484223,0.100076,0.2699121,0.11327448,0.47721133],"study_design_scores_gemma":[0.00060987246,0.0014305138,0.0036181316,0.00023237804,0.00041624886,0.0019981116,0.0003379741,0.42027012,0.062102396,0.056773223,0.4518865,0.00032458233],"about_ca_topic_score_codex":0.0012151686,"about_ca_topic_score_gemma":0.0008669334,"teacher_disagreement_score":0.0053025717,"about_ca_system_score_codex":0.0007035402,"about_ca_system_score_gemma":0.0012599408,"threshold_uncertainty_score":0.017738879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091887,0.00038844053,0.95688707,0.0001806387,0.000059703794,0.00013475312,0.000017845477,0.00030721116,0.0011055673],"genre_scores_gemma":[0.69013923,0.00045561002,0.3071635,0.00030400543,0.00012292575,0.000089832465,0.00002578399,0.00006219542,0.0016369418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990332,0.00028988702,0.00006580335,0.00016972097,0.0003062337,0.00013517599],"domain_scores_gemma":[0.9979401,0.00079698453,0.00035107924,0.0001641416,0.0005929519,0.00015472058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027558263,0.0007390593,0.00066895026,0.00050710625,0.0005998877,0.001464702,0.0019527263,0.0008251384,0.0007012325],"category_scores_gemma":[0.004048629,0.00039959748,0.0003142108,0.00046006768,0.0006077436,0.0013231031,0.00082190224,0.00093308394,0.00023165945],"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.0010478763,0.0006204611,0.0074977675,0.0005674582,0.00019124859,0.00063972495,0.0007033613,0.5839193,0.1529588,0.079511434,0.0028134612,0.16952908],"study_design_scores_gemma":[0.000060161692,0.00026841834,0.00030698805,0.000013876581,0.00005089696,0.000103690174,0.0000358807,0.98372746,0.011060559,0.002797665,0.0015521446,0.000022300388],"about_ca_topic_score_codex":0.002320104,"about_ca_topic_score_gemma":0.0033680464,"teacher_disagreement_score":0.0027558263,"about_ca_system_score_codex":0.0011951188,"about_ca_system_score_gemma":0.0012212471,"threshold_uncertainty_score":0.014574349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370934,0.0020254282,0.984089,0.00026211454,0.00025856003,0.00005010555,0.00019802584,0.00051755295,0.002228274],"genre_scores_gemma":[0.6965901,0.0069306213,0.262392,0.00043828195,0.0012921263,0.00030658994,0.0014033224,0.0010037676,0.029643157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994562,0.00010339581,0.000030463783,0.00008439797,0.00021889436,0.000106649975],"domain_scores_gemma":[0.99898547,0.00050554756,0.000043933414,0.00009094424,0.000323909,0.000050126182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014027428,0.0009776126,0.0010867966,0.0017300196,0.00064159645,0.0014859255,0.0022415963,0.00064064265,0.0034866284],"category_scores_gemma":[0.0041703274,0.0004446194,0.0010275955,0.0016834299,0.0005957763,0.0023290871,0.0009770297,0.0017354725,0.0007590992],"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.00033887272,0.00030232573,0.002529617,0.00038206714,0.00018922969,0.00016545512,0.0002570516,0.5259039,0.014757543,0.2547139,0.025992803,0.17446715],"study_design_scores_gemma":[0.0000045943275,0.00000975204,0.00016803583,0.000005324063,0.000009015525,0.000010338796,0.000009162714,0.9783393,0.0004523456,0.02027231,0.00071300694,0.0000068619997],"about_ca_topic_score_codex":0.011100777,"about_ca_topic_score_gemma":0.0066846805,"teacher_disagreement_score":0.011100777,"about_ca_system_score_codex":0.001639977,"about_ca_system_score_gemma":0.0013038167,"threshold_uncertainty_score":0.022072315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037571654,0.000014167188,0.99838233,0.00005025253,0.00001242102,0.00003151758,0.000027661663,0.0004212375,0.0006848035],"genre_scores_gemma":[0.023379061,0.000088108216,0.9740423,0.000046473844,0.000030201132,0.0002896875,0.00010828693,0.00021763363,0.0017982905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.000490427,0.00011846995,0.00012921456,0.0004786573,0.00008273029],"domain_scores_gemma":[0.99768484,0.0011752443,0.000092429094,0.0004469869,0.0005350327,0.00006544823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026706185,0.0008395127,0.00085105456,0.0012234901,0.0014595148,0.0026894533,0.0024201572,0.0016103726,0.010765884],"category_scores_gemma":[0.009536402,0.000878445,0.0014858277,0.0017533354,0.000957417,0.0025529624,0.0019026225,0.0024118035,0.0036045844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051551906,0.0002224161,0.00079205475,0.00016191103,0.000060483555,0.00017711599,0.00035101356,0.09522213,0.0033033486,0.67854184,0.009536889,0.21157926],"study_design_scores_gemma":[0.000028075765,0.000025613765,0.00010716696,0.00003148084,0.000027853104,0.00009788253,0.00006692792,0.7767346,0.0018387907,0.20420656,0.016817397,0.000017692426],"about_ca_topic_score_codex":0.0048454627,"about_ca_topic_score_gemma":0.0036084207,"teacher_disagreement_score":0.010765884,"about_ca_system_score_codex":0.00091249583,"about_ca_system_score_gemma":0.0022286887,"threshold_uncertainty_score":0.03601545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023108503,0.00047812803,0.9714679,0.00018746899,0.00015242095,0.00008968,0.000027852824,0.0012188776,0.0032691185],"genre_scores_gemma":[0.7092467,0.0005787294,0.28663778,0.00019328934,0.0003079135,0.00025522735,0.00009860238,0.000112095724,0.002569635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885726,0.00033857898,0.00008843663,0.00010826001,0.00047483188,0.0001325869],"domain_scores_gemma":[0.99831676,0.0005539418,0.00020436048,0.00041615294,0.00034558293,0.00016319365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015524286,0.00072124036,0.00057180895,0.0007482693,0.0008961449,0.0014387005,0.002172118,0.0007426345,0.00095168833],"category_scores_gemma":[0.003938352,0.00035802496,0.00062347355,0.00050834595,0.0008220033,0.002215058,0.0023480877,0.0015280277,0.0002659005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000992441,0.00054238614,0.0028937908,0.00050602714,0.00026806246,0.0010504998,0.0010297466,0.15688042,0.13275138,0.34969994,0.006696644,0.34668863],"study_design_scores_gemma":[0.0001093583,0.0003400887,0.00043437403,0.000058984366,0.0001712626,0.00038665615,0.000049177223,0.88197464,0.028125636,0.07172882,0.016529566,0.00009147638],"about_ca_topic_score_codex":0.0007285852,"about_ca_topic_score_gemma":0.0006037123,"teacher_disagreement_score":0.002172118,"about_ca_system_score_codex":0.0007339708,"about_ca_system_score_gemma":0.00053660007,"threshold_uncertainty_score":0.008210123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2547953,0.0006119468,0.7375262,0.00049059663,0.0000901349,0.0001322317,0.0002715864,0.0004967931,0.0055851554],"genre_scores_gemma":[0.97619694,0.00034789235,0.019960286,0.000091976544,0.0000611249,0.000077485995,0.00013330104,0.000042656236,0.00308839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979387,0.00059657946,0.000059075057,0.00028572106,0.00061696913,0.00050287263],"domain_scores_gemma":[0.99429333,0.0031653538,0.0007259826,0.00056908163,0.0010131741,0.00023312615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027901637,0.0011606916,0.0009704849,0.0014580069,0.0007143946,0.001352468,0.0022170036,0.0023417673,0.0010290821],"category_scores_gemma":[0.011197718,0.0005252753,0.0007062676,0.001550007,0.001622227,0.003208895,0.0010970248,0.0015139838,0.00035268834],"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.0001627592,0.00008485264,0.0023596594,0.00004125909,0.000026796492,0.00018588021,0.00018045084,0.9259072,0.002714746,0.060104184,0.00083111593,0.0074011656],"study_design_scores_gemma":[0.0000076200367,0.000027430106,0.00050099334,0.0000031347759,0.000006794953,0.00006948052,0.000015877007,0.9905027,0.00033886396,0.008290506,0.000220299,0.000016380154],"about_ca_topic_score_codex":0.0106590865,"about_ca_topic_score_gemma":0.0073385523,"teacher_disagreement_score":0.0106590865,"about_ca_system_score_codex":0.0022144124,"about_ca_system_score_gemma":0.0012961513,"threshold_uncertainty_score":0.0211941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14141119,0.010575575,0.739495,0.00852471,0.0011443711,0.0007858744,0.00015397558,0.00095661834,0.09695264],"genre_scores_gemma":[0.8535575,0.0018045296,0.13771863,0.0006228852,0.00047919402,0.00047627566,0.00006269732,0.0001719058,0.0051064547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9785469,0.011010621,0.00096673414,0.0010652529,0.006727086,0.0016834378],"domain_scores_gemma":[0.9416981,0.03991767,0.0025142415,0.009808489,0.004709655,0.0013519148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036108743,0.0015542812,0.0009491741,0.001572904,0.002575979,0.007944324,0.004031727,0.0035822357,0.005649305],"category_scores_gemma":[0.08849277,0.0010850307,0.00067777437,0.0016553489,0.0027233413,0.013374552,0.0042993985,0.0037326086,0.0012501266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011670034,0.00036796802,0.0036092605,0.00048736314,0.00015387597,0.00019497842,0.0006172645,0.08224925,0.009697855,0.7608608,0.002445975,0.13814832],"study_design_scores_gemma":[0.00044801753,0.0015289144,0.0023786759,0.0005260174,0.000383338,0.0013422196,0.0008783343,0.33835185,0.034724392,0.5721176,0.04707135,0.00024925242],"about_ca_topic_score_codex":0.000731373,"about_ca_topic_score_gemma":0.000790439,"teacher_disagreement_score":0.036108743,"about_ca_system_score_codex":0.0027573404,"about_ca_system_score_gemma":0.0023640976,"threshold_uncertainty_score":0.19096357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03214569,0.0011575521,0.95771235,0.0005975429,0.0006638742,0.00017521398,0.00009457226,0.00084238854,0.0066109337],"genre_scores_gemma":[0.7152813,0.0011360267,0.2697326,0.00024772424,0.00037467148,0.00018700009,0.0001255567,0.00020427207,0.012710849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989492,0.00025697163,0.00007474629,0.00010769863,0.0004410387,0.00017021825],"domain_scores_gemma":[0.99823403,0.00077048055,0.00008843474,0.0003454217,0.00038111614,0.00018049616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024031275,0.00064698164,0.0013528997,0.0007803403,0.0010152676,0.0018252097,0.0031208938,0.0009899206,0.0044067837],"category_scores_gemma":[0.006018642,0.0004133738,0.0006214636,0.0012634806,0.00077487325,0.0024517134,0.0013939363,0.0016413054,0.0006208843],"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.00081179244,0.000617302,0.0005453618,0.00030712548,0.00007906003,0.00026091715,0.00028595538,0.20021462,0.019060997,0.2866375,0.013842312,0.477337],"study_design_scores_gemma":[0.00011522937,0.00023865154,0.00020961296,0.000024803327,0.000045916586,0.00027708785,0.000037488928,0.9261901,0.0041100136,0.06040133,0.008300777,0.00004902949],"about_ca_topic_score_codex":0.0011458746,"about_ca_topic_score_gemma":0.0010921344,"teacher_disagreement_score":0.0044067837,"about_ca_system_score_codex":0.0018727195,"about_ca_system_score_gemma":0.0012120098,"threshold_uncertainty_score":0.014742136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14702803,0.00024766018,0.8494594,0.00022775913,0.000031251828,0.00011215246,0.00015131959,0.00086262036,0.0018798492],"genre_scores_gemma":[0.87932986,0.00022695595,0.11916488,0.000035582725,0.000048602386,0.00008110056,0.0003659589,0.0000713834,0.0006756769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99922,0.00032555626,0.000039611015,0.0000761516,0.0002687332,0.00006987237],"domain_scores_gemma":[0.99810827,0.00079899264,0.00025253347,0.00027191563,0.00046682137,0.00010160754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361467,0.0007552562,0.000424305,0.001469718,0.0006012405,0.001108169,0.00093498616,0.00060016674,0.00081707514],"category_scores_gemma":[0.0047078608,0.00019836776,0.00039349397,0.0011248185,0.00058250956,0.0017988707,0.00048038192,0.000691023,0.0002080203],"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.0004430706,0.00037105544,0.025098035,0.00023844719,0.000061909486,0.00032101915,0.0003757983,0.48440868,0.115356885,0.0688737,0.0028501458,0.30160132],"study_design_scores_gemma":[0.0000037402085,0.00006611943,0.0012846796,0.00000791578,0.0000073628744,0.00010809146,0.000055412533,0.9801789,0.008131828,0.009121506,0.0010217394,0.000012738053],"about_ca_topic_score_codex":0.001872543,"about_ca_topic_score_gemma":0.0013947509,"teacher_disagreement_score":0.001872543,"about_ca_system_score_codex":0.0008160625,"about_ca_system_score_gemma":0.00075031864,"threshold_uncertainty_score":0.0059209466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04317058,0.004856672,0.8904121,0.003936781,0.0009721865,0.0002685057,0.00009514357,0.0008209531,0.055467118],"genre_scores_gemma":[0.71493334,0.005786648,0.23485853,0.00076181465,0.00082893565,0.00079428306,0.00030994255,0.00034003545,0.041386575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605113,0.0023661286,0.00021878864,0.00030852997,0.00078278483,0.0002725789],"domain_scores_gemma":[0.9879673,0.009035368,0.00089016143,0.0011180411,0.0006731683,0.00031593276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050979075,0.0009203663,0.0006234109,0.00094113214,0.0024945163,0.0038800878,0.0016957015,0.0024994821,0.009260573],"category_scores_gemma":[0.023254367,0.0007202461,0.0005831106,0.0013908957,0.0044811103,0.008123725,0.0016537241,0.002757667,0.0016012356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024479447,0.0000883785,0.00042433655,0.00012610461,0.000021614009,0.00029919797,0.00077423156,0.031109354,0.002712398,0.904276,0.004074169,0.055849303],"study_design_scores_gemma":[0.000095832766,0.00012717095,0.00030036396,0.00006726492,0.000039631577,0.0005060776,0.00031569926,0.25797814,0.0046147434,0.68618184,0.049701422,0.0000718022],"about_ca_topic_score_codex":0.0017853753,"about_ca_topic_score_gemma":0.0018517387,"teacher_disagreement_score":0.009260573,"about_ca_system_score_codex":0.0017720931,"about_ca_system_score_gemma":0.0014637148,"threshold_uncertainty_score":0.030979693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036407806,0.00015761473,0.96090317,0.00018449768,0.000055911183,0.000042350777,0.00026891168,0.00054608064,0.0014335406],"genre_scores_gemma":[0.80615747,0.00068691326,0.18685439,0.00008734846,0.00013870135,0.00013717802,0.0009778893,0.00011885849,0.0048411735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.00023138944,0.000041961095,0.00014420888,0.00014162628,0.00008224442],"domain_scores_gemma":[0.9992754,0.00029273267,0.00011173339,0.000084935265,0.00020329494,0.00003188452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011797261,0.00059175125,0.0005456125,0.0006661383,0.00040167168,0.0007351131,0.0010867692,0.0006577483,0.0010391324],"category_scores_gemma":[0.003326147,0.00035061556,0.0008462044,0.00096532353,0.00029477832,0.0014381764,0.00046101902,0.0011221311,0.00035476172],"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.000082189865,0.00006394168,0.0054274653,0.00004517583,0.00006803785,0.00008057503,0.00008364482,0.920447,0.0039310893,0.014343316,0.0017007794,0.053726785],"study_design_scores_gemma":[0.0000019548954,0.000009348209,0.00032913746,0.0000015879933,0.0000062582794,0.000009976059,0.0000058404275,0.9965179,0.00024298835,0.0024726212,0.00039666586,0.0000056109875],"about_ca_topic_score_codex":0.0139838625,"about_ca_topic_score_gemma":0.013033746,"teacher_disagreement_score":0.0139838625,"about_ca_system_score_codex":0.0004813656,"about_ca_system_score_gemma":0.0006317186,"threshold_uncertainty_score":0.02780497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92277825,0.0027608254,0.05791444,0.0005494475,0.00024128471,0.00023088061,0.00028004363,0.0013195704,0.013925298],"genre_scores_gemma":[0.99011725,0.00028206533,0.008146403,0.000033539964,0.00003553614,0.00004372584,0.00015287541,0.000053601252,0.0011350428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956827,0.0016859656,0.0001860522,0.0003164025,0.0015795702,0.00054932956],"domain_scores_gemma":[0.9865797,0.009570938,0.0006065612,0.0009600415,0.0019062712,0.00037655508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005381014,0.001149841,0.0011244933,0.0012599454,0.0009144725,0.001743075,0.0017925772,0.0009074706,0.002464052],"category_scores_gemma":[0.012905029,0.00033933495,0.00026947967,0.001315914,0.0010979908,0.0020502713,0.0009601755,0.0010341346,0.0003030404],"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.0147856735,0.0022590677,0.009203952,0.0006620377,0.00032572652,0.00044452405,0.0003648597,0.6637798,0.0667402,0.026119074,0.0066558756,0.2086593],"study_design_scores_gemma":[0.0001837795,0.0010580904,0.0010599326,0.000010610096,0.00006953465,0.0001230534,0.000065160544,0.98215896,0.01270084,0.0020708358,0.00047928467,0.00001995662],"about_ca_topic_score_codex":0.004459374,"about_ca_topic_score_gemma":0.0022803987,"teacher_disagreement_score":0.005381014,"about_ca_system_score_codex":0.0019957959,"about_ca_system_score_gemma":0.0016374041,"threshold_uncertainty_score":0.02845788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08625909,0.0011982657,0.8995681,0.00073527027,0.000061621955,0.00026348652,0.00023674252,0.00022677855,0.011450709],"genre_scores_gemma":[0.5482406,0.0013410774,0.4415295,0.00022594497,0.00008359845,0.0004492231,0.00041575555,0.00015136857,0.0075629163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992435,0.0004233765,0.000022693663,0.00010915816,0.00009900535,0.00010220952],"domain_scores_gemma":[0.9984352,0.0012361946,0.00010290771,0.000043108168,0.00012499817,0.00005751251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015855642,0.0010749482,0.0010353684,0.00088647916,0.00075259723,0.0012203035,0.0006519936,0.0015216134,0.0056705987],"category_scores_gemma":[0.0038151972,0.00060856383,0.00074924255,0.0010851434,0.0008816326,0.0015992922,0.0008388998,0.00083251763,0.0004415365],"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.00006428356,0.000057126035,0.0003800799,0.00015809796,0.000025940524,0.00008865109,0.000061110855,0.9526389,0.0006999419,0.011688528,0.001243825,0.032893408],"study_design_scores_gemma":[0.000037828613,0.00008358243,0.00013095287,0.00002016662,0.000019573712,0.00005296851,0.0000782241,0.9851998,0.0005299691,0.011998864,0.001840374,0.000007689967],"about_ca_topic_score_codex":0.005207132,"about_ca_topic_score_gemma":0.0043579605,"teacher_disagreement_score":0.0056705987,"about_ca_system_score_codex":0.0010101512,"about_ca_system_score_gemma":0.0014535501,"threshold_uncertainty_score":0.018970072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43477908,0.0017729145,0.5315907,0.00097598165,0.00013895454,0.00012642656,0.00015147535,0.0030323833,0.027432125],"genre_scores_gemma":[0.9065167,0.0005596141,0.090272345,0.0001226152,0.000060855706,0.000030032788,0.00013955618,0.000049570503,0.0022487515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997131,0.00009278658,0.00001641419,0.000026142867,0.000100629,0.000050867195],"domain_scores_gemma":[0.9997259,0.0000961215,0.000030550218,0.000061825296,0.00005753526,0.000028034645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487465,0.00026706033,0.00023060894,0.00038961275,0.00050321635,0.0009366915,0.0005320741,0.00031903625,0.0008579686],"category_scores_gemma":[0.0013973729,0.0001567976,0.00013437016,0.00039980435,0.00051543885,0.00085894275,0.0004902544,0.00038078663,0.0002880973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005676403,0.00024338365,0.004888813,0.00014525605,0.00003912199,0.0010369114,0.0003977806,0.23158154,0.18404777,0.13915496,0.006629575,0.43126723],"study_design_scores_gemma":[0.00007691924,0.00024135242,0.0015678578,0.000032122312,0.000032736567,0.00023418684,0.00011380097,0.91001296,0.04539902,0.026750118,0.015511619,0.000027290465],"about_ca_topic_score_codex":0.0020873502,"about_ca_topic_score_gemma":0.0017740873,"teacher_disagreement_score":0.0020873502,"about_ca_system_score_codex":0.00071137847,"about_ca_system_score_gemma":0.0005326132,"threshold_uncertainty_score":0.005161464},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004228077,0.0039095976,0.31351402,0.0035049214,0.004087033,0.005931767,0.0146940565,0.029471412,0.6206591],"genre_scores_gemma":[0.15109618,0.01008462,0.16387214,0.0067035533,0.0038970031,0.012361108,0.04354037,0.0042307335,0.6042144],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966987,0.0006976678,0.00040008864,0.0003958627,0.0014674452,0.00034023137],"domain_scores_gemma":[0.99264294,0.00097347156,0.0003888496,0.0018644242,0.0037577718,0.0003725747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027693217,0.0010649936,0.0010958925,0.0026506535,0.001467249,0.0046698498,0.00256503,0.0018168127,0.09797912],"category_scores_gemma":[0.008328379,0.00031140487,0.0003827357,0.0029344538,0.00079487055,0.002203221,0.0023496232,0.001791066,0.09339966],"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.0003413444,0.000231559,0.0007373855,0.0008233201,0.000056564244,0.00058115076,0.00045459752,0.003482088,0.009738368,0.07339397,0.534302,0.37585768],"study_design_scores_gemma":[0.0000864335,0.000111095804,0.0004950786,0.00024656873,0.00004187299,0.0004474937,0.00008362863,0.0060964953,0.0048576975,0.011402941,0.9760633,0.00006737973],"about_ca_topic_score_codex":0.0023170235,"about_ca_topic_score_gemma":0.00092950405,"teacher_disagreement_score":0.09797912,"about_ca_system_score_codex":0.0013660014,"about_ca_system_score_gemma":0.0021231428,"threshold_uncertainty_score":0.32777286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597091,0.0004156598,0.031614706,0.00036922647,0.00012839923,0.0000736795,0.00022250427,0.0031638548,0.004302908],"genre_scores_gemma":[0.9948078,0.00004356636,0.00402778,0.000052594183,0.000016419688,0.00001266221,0.00009251322,0.000029621382,0.00091716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.00044723245,0.00009340421,0.00018526356,0.00034374272,0.00034268302],"domain_scores_gemma":[0.99645644,0.0018746979,0.00020804445,0.00040742607,0.0006219145,0.00043146807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024156189,0.0006810342,0.00085384626,0.00058594893,0.0007913898,0.001547867,0.0011839286,0.0008837033,0.004469426],"category_scores_gemma":[0.0038476342,0.00033827455,0.00023493725,0.00074620143,0.00075652037,0.0014247634,0.00079393265,0.00069916557,0.0005268561],"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.010364566,0.0013082473,0.010019915,0.00013113895,0.00027694023,0.00031295215,0.00031232083,0.7932255,0.05337254,0.0061277766,0.0077811307,0.11676692],"study_design_scores_gemma":[0.00009749106,0.00035858303,0.0016490328,0.0000025838976,0.000036649417,0.000029739414,0.000033268465,0.9915249,0.005287615,0.0007477333,0.00021249616,0.000020041414],"about_ca_topic_score_codex":0.016644089,"about_ca_topic_score_gemma":0.008482452,"teacher_disagreement_score":0.016644089,"about_ca_system_score_codex":0.0016963272,"about_ca_system_score_gemma":0.0014256672,"threshold_uncertainty_score":0.033094406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013124918,0.0012444198,0.9773208,0.0003974372,0.00020019038,0.00031830563,0.000046803892,0.0003977942,0.006949378],"genre_scores_gemma":[0.55466443,0.0034037489,0.4354658,0.00037443714,0.00029905222,0.000830478,0.00024820975,0.00022878192,0.0044851205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818534,0.0007739244,0.00013612899,0.00015891796,0.0005830945,0.00016260314],"domain_scores_gemma":[0.99844754,0.0007082608,0.00011440609,0.0001778849,0.0004901756,0.00006178972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661558,0.00092357915,0.0008844138,0.0011067315,0.0013395931,0.002301957,0.0019021255,0.0010310885,0.002267442],"category_scores_gemma":[0.005368129,0.0006776322,0.00059622305,0.0009365053,0.0010232609,0.001891313,0.0012448208,0.0011566652,0.00057437486],"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.0003924291,0.0001424714,0.0010029713,0.0006059525,0.0001901042,0.00029528758,0.00042944626,0.51884055,0.016774878,0.28999344,0.0067748786,0.16455755],"study_design_scores_gemma":[0.00006799253,0.0001788456,0.00013338661,0.00007836886,0.00013854099,0.00015623175,0.00005453037,0.9296919,0.0042438763,0.054204777,0.011018494,0.0000331433],"about_ca_topic_score_codex":0.0020023012,"about_ca_topic_score_gemma":0.003489592,"teacher_disagreement_score":0.002661558,"about_ca_system_score_codex":0.0012787057,"about_ca_system_score_gemma":0.0016278914,"threshold_uncertainty_score":0.014075816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030218408,0.00035335784,0.96259654,0.00033183154,0.000059246286,0.0000907646,0.00031545287,0.00025711377,0.005777297],"genre_scores_gemma":[0.51737064,0.0009047699,0.47136465,0.00019627012,0.00015569423,0.00039968223,0.0006700756,0.00035786204,0.008580433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00042446592,0.000025899993,0.00010227569,0.00014151946,0.00013997333],"domain_scores_gemma":[0.9988123,0.00068701676,0.0001157475,0.00011248833,0.00017931905,0.00009318676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844582,0.0012740145,0.0014479244,0.0014748183,0.0006990123,0.0016706008,0.0014536094,0.0009783664,0.004941447],"category_scores_gemma":[0.004568692,0.0010106363,0.0010656564,0.002203109,0.0013621321,0.0023784381,0.0013171366,0.0017567755,0.0005484398],"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.00011898333,0.00005071826,0.00015608667,0.000054947406,0.000028320374,0.000017379536,0.00005678475,0.9298301,0.0009564605,0.04522025,0.0018224007,0.021687675],"study_design_scores_gemma":[0.000016606064,0.000014458658,0.000057621575,0.000007498485,0.00000812884,0.0000062846134,0.000014239807,0.93349063,0.0002972075,0.06549918,0.00058139063,0.0000068292393],"about_ca_topic_score_codex":0.0064554685,"about_ca_topic_score_gemma":0.004418452,"teacher_disagreement_score":0.0064554685,"about_ca_system_score_codex":0.0015827527,"about_ca_system_score_gemma":0.0015878092,"threshold_uncertainty_score":0.016530752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2813578,0.00068540836,0.7145363,0.0005822141,0.000046861052,0.00004337917,0.00017181387,0.0003321101,0.0022440746],"genre_scores_gemma":[0.9788208,0.0005578628,0.019092621,0.000090531976,0.000094499235,0.00008509065,0.00016571599,0.00009133927,0.0010015144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.00053911656,0.00004646786,0.00026814797,0.0004960785,0.000231259],"domain_scores_gemma":[0.9646418,0.02744977,0.0039641666,0.0018598485,0.0015635468,0.00052085065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004258704,0.0005836224,0.00063542585,0.0015705774,0.00070405734,0.0009826383,0.0011793617,0.0006183883,0.0012797907],"category_scores_gemma":[0.029269645,0.00055025594,0.00037484852,0.0015889708,0.0019475301,0.0021691478,0.0011433471,0.0014903643,0.00014636846],"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.000045228382,0.00004264381,0.0037830276,0.00005094425,0.000044245597,0.00008438435,0.00007935572,0.88347405,0.0037202751,0.099749185,0.00051018223,0.008416574],"study_design_scores_gemma":[0.0000042567544,0.000022063594,0.0012979144,0.0000049220725,0.000007039699,0.000022620101,0.000013981127,0.95975465,0.0006974383,0.037931092,0.0002324792,0.000011541434],"about_ca_topic_score_codex":0.0022670028,"about_ca_topic_score_gemma":0.001776981,"teacher_disagreement_score":0.004258704,"about_ca_system_score_codex":0.001746456,"about_ca_system_score_gemma":0.0016003082,"threshold_uncertainty_score":0.02252245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019928668,0.0013392859,0.97306764,0.0002960998,0.00018146503,0.00017622412,0.000016389911,0.0012065759,0.0037876402],"genre_scores_gemma":[0.5512285,0.0009491852,0.44352445,0.00027841982,0.00030462054,0.00023124051,0.000078311285,0.000118916796,0.003286316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800855,0.00051881303,0.00012623216,0.00025611097,0.0009262823,0.0001640239],"domain_scores_gemma":[0.9982247,0.0006267839,0.00014194437,0.00023517961,0.00066546106,0.00010596727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029146648,0.00078045746,0.0009343668,0.0014338647,0.0008429824,0.0012306414,0.0017630467,0.00082105753,0.00077875215],"category_scores_gemma":[0.0038791809,0.0004869839,0.00035021934,0.0007841027,0.0007790831,0.0025439626,0.0014819758,0.0012776052,0.00018352453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038453744,0.00027253176,0.0039106337,0.0003025355,0.00012839783,0.00028326377,0.00023876333,0.18627879,0.029068025,0.034325603,0.0030013009,0.74180555],"study_design_scores_gemma":[0.000043875774,0.00016487196,0.00069054373,0.000034481836,0.000056684792,0.00023366284,0.000033168923,0.97728705,0.008294712,0.006973383,0.0061471146,0.00004038042],"about_ca_topic_score_codex":0.0033883466,"about_ca_topic_score_gemma":0.004337025,"teacher_disagreement_score":0.0033883466,"about_ca_system_score_codex":0.0009271981,"about_ca_system_score_gemma":0.0013682819,"threshold_uncertainty_score":0.015414417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16421558,0.0022930626,0.8253177,0.00071003224,0.00008682459,0.00006166587,0.000064300315,0.00085627206,0.00639453],"genre_scores_gemma":[0.9448437,0.000923212,0.052692987,0.00009300522,0.000051416027,0.00004520914,0.000057532718,0.000040031464,0.0012528859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987263,0.00033932165,0.000065484506,0.00009115385,0.000598205,0.00017939718],"domain_scores_gemma":[0.99853134,0.0006523911,0.00016675047,0.000252194,0.00032318023,0.000074077114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021955038,0.00050528435,0.0003892677,0.00046668522,0.00054269814,0.0016389808,0.0011745823,0.00079948915,0.0005069792],"category_scores_gemma":[0.0051654372,0.0004278292,0.00027147512,0.00059523655,0.00096492725,0.0020927805,0.0010059453,0.0010971088,0.00020150654],"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.0005071893,0.00012678807,0.0030166493,0.0002552996,0.000047163245,0.0004159101,0.000580117,0.5710255,0.026810432,0.29041988,0.0022470874,0.10454802],"study_design_scores_gemma":[0.00003805233,0.00011175843,0.00039594382,0.000024530224,0.000031407504,0.00009764836,0.000041608975,0.93370384,0.008490005,0.053575963,0.003464589,0.00002465316],"about_ca_topic_score_codex":0.0026113817,"about_ca_topic_score_gemma":0.0013334582,"teacher_disagreement_score":0.0026113817,"about_ca_system_score_codex":0.0015667449,"about_ca_system_score_gemma":0.001038043,"threshold_uncertainty_score":0.011611104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075804956,0.00059093174,0.8982026,0.0003210336,0.00016768201,0.0002981966,0.00046961475,0.01028659,0.013858354],"genre_scores_gemma":[0.62076867,0.00020893037,0.37434042,0.0001503479,0.0001242324,0.0001930542,0.0007224501,0.00025766238,0.0032342274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992169,0.00016852787,0.000042158816,0.00014807205,0.00035628868,0.00006799876],"domain_scores_gemma":[0.9987942,0.00022563145,0.00012115412,0.00052790414,0.00027626075,0.000054829386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096338114,0.00033038383,0.00036763807,0.0005179718,0.00030274558,0.00078947574,0.0010532968,0.00050094025,0.0008945969],"category_scores_gemma":[0.0029772937,0.00021506095,0.00015677682,0.00077674026,0.00027979427,0.00068589393,0.00083714613,0.00078778644,0.0005259269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015484139,0.00043887986,0.0055204295,0.00021750528,0.00017055539,0.00026856601,0.00019235145,0.2629824,0.08704065,0.06895509,0.02290805,0.5497571],"study_design_scores_gemma":[0.00019116535,0.00024521854,0.0020813423,0.000011400616,0.000055757802,0.00030929048,0.00001210958,0.93397784,0.024562582,0.017578062,0.020920876,0.000054358236],"about_ca_topic_score_codex":0.0011117079,"about_ca_topic_score_gemma":0.001072989,"teacher_disagreement_score":0.0011117079,"about_ca_system_score_codex":0.00033985538,"about_ca_system_score_gemma":0.00060882396,"threshold_uncertainty_score":0.005094886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0976196,0.001130177,0.898034,0.00021509104,0.00009340434,0.0001718049,0.000019382078,0.0010366824,0.0016799063],"genre_scores_gemma":[0.848364,0.00029304987,0.15012634,0.00013783376,0.00009478219,0.000056157925,0.00003343469,0.000053247146,0.00084121176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.00014760272,0.00003111109,0.000068335125,0.00017587886,0.00006067502],"domain_scores_gemma":[0.9986224,0.0006773772,0.00014392535,0.00013348037,0.0003554619,0.00006735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011724824,0.000706448,0.00036417408,0.00056926376,0.00058048964,0.00066452805,0.0010266887,0.00049919164,0.00047943817],"category_scores_gemma":[0.0041963854,0.0002585642,0.00021425557,0.0001790336,0.00055140647,0.0007772945,0.00046958175,0.0006155423,0.000118251264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015748603,0.0005697361,0.008247469,0.00027600318,0.00017847095,0.0006462526,0.0010107983,0.15333568,0.2472764,0.013193955,0.0015663105,0.57212406],"study_design_scores_gemma":[0.00010484522,0.0007794501,0.0028049208,0.000042841435,0.00017113725,0.00090275536,0.00009203223,0.90623915,0.08239499,0.003342746,0.003060935,0.00006421161],"about_ca_topic_score_codex":0.002368134,"about_ca_topic_score_gemma":0.0028272565,"teacher_disagreement_score":0.002368134,"about_ca_system_score_codex":0.00058324455,"about_ca_system_score_gemma":0.00047739313,"threshold_uncertainty_score":0.006200731},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7253966,0.0001718254,0.17941596,0.00028720972,0.00013762915,0.00037622973,0.025890252,0.063344225,0.0049799955],"genre_scores_gemma":[0.92048025,0.00008667585,0.04772638,0.00006059589,0.000044197644,0.00032842223,0.02522349,0.0033683877,0.002681569],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9971866,0.0006025613,0.00032469025,0.00043610716,0.0012828708,0.0001672287],"domain_scores_gemma":[0.95740396,0.029389812,0.0021308078,0.004974867,0.0056294594,0.00047108796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040753772,0.0007179647,0.0009330986,0.0038391068,0.00037514273,0.00093224813,0.0010760624,0.00052725273,0.0048090015],"category_scores_gemma":[0.026060736,0.00032437246,0.00046781986,0.00240097,0.00030736192,0.0013640592,0.00042721603,0.001072222,0.0018159162],"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.0036973802,0.0021241314,0.3630994,0.00093236146,0.0005857765,0.0028349003,0.0038967356,0.081715904,0.035057127,0.005391352,0.054238517,0.44642633],"study_design_scores_gemma":[0.00007555649,0.00092956814,0.20755441,0.00005161288,0.000088347624,0.001971227,0.0006804342,0.7359243,0.03556168,0.0016922203,0.015337508,0.00013313137],"about_ca_topic_score_codex":0.0028824059,"about_ca_topic_score_gemma":0.0019083322,"teacher_disagreement_score":0.0048090015,"about_ca_system_score_codex":0.0004691491,"about_ca_system_score_gemma":0.00041411535,"threshold_uncertainty_score":0.02155292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01626434,0.000073057374,0.9828358,0.00012698282,0.00000775397,0.000023080036,0.000026969095,0.00024938543,0.00039258838],"genre_scores_gemma":[0.72713625,0.00014511155,0.27070126,0.00012395217,0.000057144476,0.00018561413,0.00019764893,0.00009569826,0.0013574065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999047,0.00038315315,0.00003859673,0.0002091989,0.00022267259,0.000099332756],"domain_scores_gemma":[0.99161047,0.0067692795,0.000591594,0.00031553966,0.000548956,0.00016408556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795869,0.00093516835,0.0016562854,0.0015207893,0.00056695595,0.0013650613,0.0032640705,0.0017835278,0.0010231268],"category_scores_gemma":[0.010826806,0.0012063547,0.00084439816,0.0011658486,0.0015822719,0.0030119983,0.0016811625,0.0023510777,0.00025199543],"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.00006355257,0.00004825414,0.0006876969,0.00001922341,0.000029166555,0.000016854987,0.00003990917,0.9649151,0.0006040057,0.00550115,0.00026414462,0.027810965],"study_design_scores_gemma":[0.0000033064528,0.0000031059649,0.000029160832,0.0000012637313,0.0000014573644,0.0000021936276,0.0000019062875,0.9968142,0.000104487925,0.0030099612,0.00002697291,0.000001912683],"about_ca_topic_score_codex":0.0069429833,"about_ca_topic_score_gemma":0.0065752943,"teacher_disagreement_score":0.0069429833,"about_ca_system_score_codex":0.0014040826,"about_ca_system_score_gemma":0.0012646924,"threshold_uncertainty_score":0.014786184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016411956,0.00031940083,0.9758788,0.00017109961,0.00006421366,0.000052914293,0.00009887624,0.0001753582,0.0068273745],"genre_scores_gemma":[0.90195686,0.0012207344,0.08663681,0.00014158168,0.00008938713,0.0002173696,0.00016076601,0.00011561743,0.009460925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895847,0.00017541696,0.000049685263,0.00011965295,0.00052704674,0.00016970503],"domain_scores_gemma":[0.9989629,0.00047368932,0.00014089957,0.00015858754,0.00021516666,0.000048731166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338585,0.0005382544,0.00072168617,0.00053283,0.0004459456,0.0016522596,0.0019246836,0.0008419116,0.0034148681],"category_scores_gemma":[0.0043485053,0.00038965512,0.00085232256,0.000554001,0.0012304948,0.0023877919,0.0010364939,0.0015973707,0.00047486878],"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.000036759386,0.000030350495,0.00016587511,0.00007277387,0.000012622273,0.000057691104,0.00008161814,0.8297417,0.0022766574,0.15905344,0.00052500126,0.007945475],"study_design_scores_gemma":[0.000003867134,0.000006646092,0.000023601193,0.000004215201,0.0000028804088,0.000005214986,0.0000042450333,0.99003893,0.00028826707,0.009240654,0.0003775728,0.0000038528583],"about_ca_topic_score_codex":0.006967104,"about_ca_topic_score_gemma":0.0017673932,"teacher_disagreement_score":0.006967104,"about_ca_system_score_codex":0.001505365,"about_ca_system_score_gemma":0.0013342606,"threshold_uncertainty_score":0.013853073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16098826,0.0006370446,0.6752224,0.00042302333,0.00031075865,0.000743701,0.0007501232,0.14032021,0.020604482],"genre_scores_gemma":[0.68733686,0.00060555845,0.28819135,0.0004573389,0.00022376538,0.0004722413,0.0022920885,0.004219645,0.016201215],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995788,0.000051881292,0.000034392317,0.000082251005,0.00018512232,0.00006745483],"domain_scores_gemma":[0.9994485,0.00011490575,0.00008332406,0.00008308379,0.00014468654,0.00012565238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151912,0.0004879262,0.00046056352,0.0008336588,0.00046102365,0.0010047595,0.0014418282,0.0004829777,0.0025774746],"category_scores_gemma":[0.001376623,0.00031401135,0.00027763838,0.0003146644,0.0005732029,0.001352988,0.00071331323,0.0007265187,0.00084682915],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031363855,0.0014646132,0.009238959,0.00063357566,0.00018733376,0.0014714664,0.0010110337,0.009635219,0.41462898,0.031723358,0.055519536,0.47134957],"study_design_scores_gemma":[0.0018654598,0.0021464925,0.014577219,0.00011288348,0.00036649682,0.0031768545,0.00021116789,0.43177503,0.3578397,0.012060487,0.17549826,0.00036993285],"about_ca_topic_score_codex":0.0024457031,"about_ca_topic_score_gemma":0.0016962134,"teacher_disagreement_score":0.0025774746,"about_ca_system_score_codex":0.0004503104,"about_ca_system_score_gemma":0.00072445115,"threshold_uncertainty_score":0.008622527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45389032,0.0005623537,0.52144635,0.00030662183,0.00020594137,0.00031413842,0.00027564756,0.0038080288,0.019190708],"genre_scores_gemma":[0.854446,0.00038409146,0.1417637,0.0000683586,0.000020687532,0.0000875745,0.0001804062,0.000088065295,0.0029612617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957794,0.0000992963,0.000021497608,0.00006951688,0.00014091062,0.0000908623],"domain_scores_gemma":[0.99956685,0.00011354867,0.00007157567,0.00015623533,0.00005634087,0.000035434856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055691204,0.00041010292,0.00025251467,0.00039091567,0.00040015572,0.0008417191,0.0009758966,0.00031234266,0.0021198087],"category_scores_gemma":[0.0009940767,0.00027130148,0.00023329663,0.0005084298,0.0004864072,0.00096160034,0.0006967952,0.0005855405,0.00030548868],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010932087,0.0006519734,0.012123826,0.000676381,0.00023623023,0.0008743451,0.00039997464,0.36265668,0.30366895,0.14017344,0.00520528,0.17223968],"study_design_scores_gemma":[0.00018018771,0.0021236078,0.009309715,0.000100048535,0.00017888234,0.00062938064,0.00027195702,0.68188226,0.22037566,0.027750827,0.057125673,0.00007185062],"about_ca_topic_score_codex":0.0014574358,"about_ca_topic_score_gemma":0.0010108757,"teacher_disagreement_score":0.0021198087,"about_ca_system_score_codex":0.0005016831,"about_ca_system_score_gemma":0.00047065702,"threshold_uncertainty_score":0.0070914626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071548456,0.0008818018,0.97954077,0.0018381885,0.00013473451,0.000030652416,0.000018541026,0.00011225017,0.010288235],"genre_scores_gemma":[0.7397209,0.0025589506,0.24841066,0.00067161873,0.0011719228,0.00019935067,0.000039444847,0.0001593697,0.0070678685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652267,0.0014103588,0.00008749575,0.00022211611,0.0015204205,0.00023693862],"domain_scores_gemma":[0.99567574,0.0028888802,0.00016176829,0.00049105287,0.0006254044,0.00015708964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028088535,0.0011423936,0.0012792386,0.0008453997,0.0009204245,0.0029038538,0.0030359265,0.002636275,0.002665211],"category_scores_gemma":[0.00917617,0.0004720625,0.0006759424,0.00107524,0.0029793056,0.0042856983,0.0017756553,0.0035875668,0.00042727366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000153397,0.00007106394,0.00026454346,0.00010173928,0.00002834795,0.00011494098,0.00018053154,0.12852296,0.004814115,0.8126974,0.0017108975,0.051340017],"study_design_scores_gemma":[0.000030269668,0.000102435435,0.00009174787,0.000038333106,0.00001798332,0.00012888019,0.00003429855,0.7613156,0.0022151666,0.23143591,0.0045579583,0.00003146677],"about_ca_topic_score_codex":0.0013819812,"about_ca_topic_score_gemma":0.0007207113,"teacher_disagreement_score":0.0030359265,"about_ca_system_score_codex":0.0014353012,"about_ca_system_score_gemma":0.0010492412,"threshold_uncertainty_score":0.014854789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020535888,0.0060964534,0.95315677,0.0002853478,0.0004533004,0.000037607744,0.00002768711,0.00046247136,0.018944401],"genre_scores_gemma":[0.80582166,0.0043352325,0.17458937,0.00014295567,0.00029998206,0.00007549978,0.00009288447,0.0001312024,0.0145112015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974734,0.00004733852,0.000009244945,0.00003684169,0.00012094957,0.000038179598],"domain_scores_gemma":[0.99982435,0.00008166228,0.000010717421,0.00003437794,0.00003662766,0.000012268824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020069,0.00044279004,0.00052573613,0.00028016075,0.00026743437,0.00091830513,0.0012708161,0.00039811534,0.0012763476],"category_scores_gemma":[0.0006231213,0.00030412636,0.00023343189,0.0005023008,0.00060986215,0.000979348,0.00051947887,0.0010638635,0.00030133603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002104054,0.000090002024,0.000285677,0.00018212579,0.000055969398,0.00012431963,0.00018334217,0.33940756,0.028405044,0.23606643,0.0068338807,0.38815525],"study_design_scores_gemma":[0.00001577632,0.000068515554,0.00022762676,0.00002629862,0.000025048772,0.00010652385,0.000022562142,0.9221686,0.0053236787,0.062327396,0.009668404,0.000019638686],"about_ca_topic_score_codex":0.00097619824,"about_ca_topic_score_gemma":0.0010772598,"teacher_disagreement_score":0.0012763476,"about_ca_system_score_codex":0.0007698166,"about_ca_system_score_gemma":0.00043917552,"threshold_uncertainty_score":0.0055854917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09136026,0.000758423,0.90490764,0.00013361273,0.000050193834,0.00012366954,0.000024302957,0.0004150397,0.0022268991],"genre_scores_gemma":[0.945789,0.00017912127,0.052663974,0.00003735553,0.000030408783,0.00008402526,0.000020067395,0.000020893212,0.0011751363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00017799056,0.00004065455,0.00009378558,0.00014896436,0.00008251227],"domain_scores_gemma":[0.99934226,0.00027177215,0.00012182649,0.000034792043,0.00017857195,0.000050761835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150312,0.00067282264,0.00049453345,0.000771816,0.0005136122,0.0008490996,0.0011802965,0.00035647445,0.0012677877],"category_scores_gemma":[0.0019046512,0.00023547548,0.00026833187,0.0002734319,0.0005295981,0.0009919892,0.00059399544,0.00043397784,0.00015972495],"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.0008126506,0.00019821814,0.0014064594,0.000236825,0.000117647185,0.00040673857,0.00060902134,0.65195215,0.051440265,0.055172086,0.0024467178,0.23520114],"study_design_scores_gemma":[0.000041846633,0.00020112186,0.00023062801,0.000010391329,0.000035258974,0.000057098703,0.000041338444,0.98814607,0.0053292774,0.0046187537,0.0012700126,0.000018265095],"about_ca_topic_score_codex":0.0025270972,"about_ca_topic_score_gemma":0.0028505113,"teacher_disagreement_score":0.0025270972,"about_ca_system_score_codex":0.0010181075,"about_ca_system_score_gemma":0.00039735457,"threshold_uncertainty_score":0.007386923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020302476,0.0013840982,0.9763703,0.0024116125,0.00022109188,0.00004670373,0.00010356322,0.000059468064,0.017372925],"genre_scores_gemma":[0.42182645,0.014041253,0.5242404,0.002563455,0.0028971669,0.0008841267,0.0005522091,0.00024850643,0.032746505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.0005646333,0.000041148458,0.00020151616,0.0003354814,0.00008773265],"domain_scores_gemma":[0.9986266,0.0009892645,0.00008880171,0.00007734469,0.00015977358,0.000058253027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944396,0.0014779494,0.0008906581,0.002048052,0.00085190806,0.0021350586,0.0015581747,0.0017776528,0.006342791],"category_scores_gemma":[0.002664774,0.0004337615,0.00096102105,0.0021909415,0.0031102975,0.0028504313,0.0012955324,0.0032463123,0.00066255126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063569923,0.000022374521,0.00006484231,0.00008293449,0.000015504544,0.000051184783,0.000039466628,0.09484909,0.00033421503,0.89207274,0.0020472743,0.01041408],"study_design_scores_gemma":[0.000011035084,0.00002804837,0.000072445284,0.000028004215,0.000010439004,0.000062266496,0.000040987135,0.2188485,0.00019196724,0.7663675,0.0143258935,0.000012911142],"about_ca_topic_score_codex":0.0039405976,"about_ca_topic_score_gemma":0.0025009008,"teacher_disagreement_score":0.006342791,"about_ca_system_score_codex":0.002754071,"about_ca_system_score_gemma":0.0016772457,"threshold_uncertainty_score":0.021218777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012049386,0.011594324,0.8068465,0.002699682,0.0009911407,0.00011694524,0.00007528026,0.00071054435,0.16491611],"genre_scores_gemma":[0.3479826,0.01789355,0.3773224,0.001500317,0.001003245,0.00024206881,0.00028802833,0.00042494675,0.25334296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996013,0.00006100703,0.00001428565,0.000037539416,0.000251344,0.000034538505],"domain_scores_gemma":[0.9997458,0.00009892938,0.00001159739,0.00005055344,0.000072217284,0.000020983083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076865836,0.0006772494,0.000340392,0.00051292626,0.00046304252,0.0016468979,0.001358674,0.0009607564,0.0048621264],"category_scores_gemma":[0.0011573551,0.00035614413,0.00037717362,0.001048739,0.0008973086,0.0026566451,0.0007018533,0.001918451,0.0014960506],"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.00005175688,0.0000740687,0.0001922259,0.000090645524,0.000015657415,0.00009216259,0.0002310394,0.033306208,0.0035451713,0.66848284,0.016377317,0.27754095],"study_design_scores_gemma":[0.000026318428,0.000059730726,0.00035810558,0.000093970426,0.000023049075,0.0003137626,0.00007043835,0.30349872,0.0049012224,0.50664836,0.18397024,0.000036093916],"about_ca_topic_score_codex":0.001676904,"about_ca_topic_score_gemma":0.0013923766,"teacher_disagreement_score":0.0048621264,"about_ca_system_score_codex":0.0015263807,"about_ca_system_score_gemma":0.0008014063,"threshold_uncertainty_score":0.016265452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912363,0.00021054428,0.0069153327,0.00009592824,0.000017121642,0.000019873049,0.00003118266,0.00014091209,0.0013327218],"genre_scores_gemma":[0.99946254,0.000035868266,0.00035808134,0.000011237766,0.0000050740623,0.0000029760538,0.000024272624,0.000011561608,0.00008835277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985347,0.00040348867,0.00009927519,0.00017786972,0.0005396688,0.00024492916],"domain_scores_gemma":[0.9794756,0.013318236,0.002085551,0.0018863874,0.002254474,0.0009798477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558342,0.00032565405,0.00047370553,0.00080418284,0.0006225479,0.0010952245,0.00070126593,0.0007442839,0.00072248245],"category_scores_gemma":[0.021586683,0.00023177743,0.00026302383,0.0005389975,0.00087970175,0.0020231563,0.0010416633,0.00050663424,0.0002124372],"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.0016369382,0.0012000093,0.19427532,0.0003049988,0.00047989615,0.0018390082,0.0007165323,0.6424784,0.0733589,0.009154796,0.0012185988,0.07333663],"study_design_scores_gemma":[0.000051384908,0.001056714,0.03573171,0.000022095843,0.00009911249,0.0011890902,0.00036572997,0.9106636,0.044230144,0.005778745,0.00075940276,0.000052259304],"about_ca_topic_score_codex":0.0007796149,"about_ca_topic_score_gemma":0.0006277544,"teacher_disagreement_score":0.0017558342,"about_ca_system_score_codex":0.0008687488,"about_ca_system_score_gemma":0.00045984954,"threshold_uncertainty_score":0.009285867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067217937,0.0003570699,0.99123317,0.000113880626,0.000038804028,0.000045207744,0.000011223269,0.00047010966,0.0010086739],"genre_scores_gemma":[0.36541986,0.0007993205,0.63021064,0.0001612007,0.00015376203,0.00023367089,0.00008878075,0.00009532489,0.0028374328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991866,0.00025837976,0.00004142237,0.00011805133,0.00034555714,0.000050004575],"domain_scores_gemma":[0.99847597,0.0006374562,0.00016062944,0.0003796517,0.00024766184,0.00009852577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012129303,0.00046030086,0.00073118834,0.00077958783,0.00057194557,0.0010153087,0.0017919034,0.0008075347,0.0009990229],"category_scores_gemma":[0.0022526637,0.0003145975,0.0003557349,0.00075578614,0.000957065,0.0020645002,0.001398075,0.0008462568,0.0002839475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036455656,0.00022900604,0.002197064,0.0003996685,0.00011623821,0.00042442206,0.0006284048,0.15575747,0.09419713,0.08882825,0.004498368,0.65235955],"study_design_scores_gemma":[0.00008500893,0.00028074346,0.00085004105,0.000036794037,0.000064282336,0.0008112657,0.00009779252,0.9163537,0.02250918,0.039961327,0.01888257,0.00006728454],"about_ca_topic_score_codex":0.00043427743,"about_ca_topic_score_gemma":0.0005986365,"teacher_disagreement_score":0.0017919034,"about_ca_system_score_codex":0.00042614955,"about_ca_system_score_gemma":0.0004733363,"threshold_uncertainty_score":0.006414652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25910535,0.0016918171,0.7255662,0.0005676037,0.00021581378,0.00019902295,0.00009758763,0.00092061167,0.011635991],"genre_scores_gemma":[0.9563736,0.00042519328,0.04171531,0.00008521897,0.000056776516,0.00007691582,0.00005360789,0.00003209957,0.0011813944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991233,0.00037441164,0.000035522342,0.00007534465,0.0002572403,0.00013423672],"domain_scores_gemma":[0.99787676,0.0013176763,0.00022145912,0.00011264005,0.0003715922,0.00009975777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023554123,0.00056037016,0.00044193363,0.0008403787,0.0006888877,0.001154318,0.0010882377,0.00065855245,0.0012605643],"category_scores_gemma":[0.0069162822,0.00024661605,0.00023174871,0.0004805012,0.0009250335,0.001679406,0.00054250855,0.0006622151,0.00014276186],"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.00037435014,0.00017111056,0.0020035543,0.00009230678,0.000033128366,0.00012541647,0.00018568845,0.8900132,0.008805224,0.060254935,0.0012605662,0.03668059],"study_design_scores_gemma":[0.000038626127,0.000074526564,0.0001860844,0.0000051184807,0.00000904534,0.000023066914,0.00001623313,0.9846763,0.001021403,0.013205785,0.0007380702,0.000005674688],"about_ca_topic_score_codex":0.005062503,"about_ca_topic_score_gemma":0.0024595147,"teacher_disagreement_score":0.005062503,"about_ca_system_score_codex":0.0013922971,"about_ca_system_score_gemma":0.0006944908,"threshold_uncertainty_score":0.012456775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35678765,0.00094964326,0.6368434,0.000389976,0.00006369149,0.00004333176,0.000018065379,0.0007812607,0.0041230526],"genre_scores_gemma":[0.9801082,0.00025345062,0.01918114,0.000048623828,0.00003408358,0.000016162478,0.000010828665,0.000026927202,0.00032061533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909043,0.00038496786,0.000029085832,0.00006998453,0.0002592575,0.00016628993],"domain_scores_gemma":[0.9976421,0.0012418904,0.00034959844,0.00026459305,0.0004201375,0.00008153768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014810249,0.00076504506,0.00036055275,0.0005336425,0.00047683032,0.0007675553,0.00070077355,0.0003860822,0.0006007467],"category_scores_gemma":[0.005995651,0.0001805532,0.00021444155,0.00049494987,0.0007259194,0.0012578424,0.0005398636,0.00047888665,0.00015066865],"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.00043605067,0.00025815866,0.0041684564,0.00017379719,0.000057541594,0.0002519839,0.00019899645,0.681303,0.103500694,0.046806533,0.00095430063,0.1618905],"study_design_scores_gemma":[0.00001524805,0.00022317997,0.00084642135,0.0000111653535,0.000029368013,0.0001526026,0.000042501397,0.96349883,0.0259246,0.008298134,0.00094288745,0.000015022503],"about_ca_topic_score_codex":0.0007705938,"about_ca_topic_score_gemma":0.00097613264,"teacher_disagreement_score":0.0014810249,"about_ca_system_score_codex":0.0007065049,"about_ca_system_score_gemma":0.0010338997,"threshold_uncertainty_score":0.007832527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063778562,0.00019958818,0.94469607,0.00007790535,0.000100754536,0.00020575871,0.001966565,0.039850745,0.0065248637],"genre_scores_gemma":[0.20589237,0.00063203514,0.76160395,0.00027587631,0.00008013015,0.0019526822,0.006455282,0.007573096,0.01553454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988568,0.00026850385,0.00009425758,0.000083995525,0.0006314112,0.00006493952],"domain_scores_gemma":[0.9972372,0.0015509474,0.00011245626,0.0004265378,0.00060661184,0.0000661551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001458368,0.0013691592,0.00089508964,0.0011043451,0.00035599238,0.00072751637,0.0016979236,0.0008638774,0.017824873],"category_scores_gemma":[0.005713246,0.00065207813,0.00048794365,0.00095670536,0.0002993588,0.0010918971,0.0008204084,0.0011641047,0.0049917246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000908832,0.00048696084,0.0026387174,0.0012304984,0.00020405154,0.0006257777,0.00037430864,0.29082197,0.06782563,0.057975963,0.0992411,0.4776661],"study_design_scores_gemma":[0.0002142092,0.0002397815,0.0010009134,0.00012277444,0.000052933905,0.00038662454,0.00001874964,0.8724897,0.041930262,0.008677845,0.07478575,0.00008044237],"about_ca_topic_score_codex":0.0012613041,"about_ca_topic_score_gemma":0.0010562737,"teacher_disagreement_score":0.017824873,"about_ca_system_score_codex":0.0005520499,"about_ca_system_score_gemma":0.0006902392,"threshold_uncertainty_score":0.059630096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064424346,0.0002664741,0.9901759,0.00005485804,0.000081987055,0.000027122405,0.0000080637055,0.00068992336,0.00225329],"genre_scores_gemma":[0.8869625,0.00028318094,0.10772369,0.00014973621,0.000129346,0.00012418104,0.000038203838,0.0001033071,0.0044858945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957305,0.000083136634,0.000027397753,0.00010690706,0.00015363976,0.000055914283],"domain_scores_gemma":[0.9996338,0.00013845976,0.000032114862,0.000036700607,0.00014437907,0.000014587666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994149,0.0004982164,0.0008386177,0.0002805689,0.00034521305,0.0007397118,0.0010089378,0.0005926738,0.0017888712],"category_scores_gemma":[0.0010243854,0.00024527032,0.0004162734,0.00021458206,0.0003524519,0.0005066647,0.00060493854,0.0010371933,0.00042758294],"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.0003704617,0.0003381502,0.00055140967,0.00033666613,0.00013193846,0.00018353549,0.0002483724,0.57079947,0.06859151,0.021410583,0.004514346,0.33252352],"study_design_scores_gemma":[0.00001665429,0.00006952483,0.00011800334,0.0000054719007,0.000012752335,0.000030690935,0.000006614405,0.9946256,0.003102122,0.001430027,0.00057410967,0.000008415405],"about_ca_topic_score_codex":0.0014458157,"about_ca_topic_score_gemma":0.001212149,"teacher_disagreement_score":0.0017888712,"about_ca_system_score_codex":0.00039828292,"about_ca_system_score_gemma":0.00043507133,"threshold_uncertainty_score":0.0059844255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.851882,0.005221172,0.116749056,0.0004476189,0.00013949552,0.00051248574,0.00014345083,0.0006534561,0.024251163],"genre_scores_gemma":[0.97300804,0.00085430563,0.024670115,0.000058287536,0.000041897543,0.0000727577,0.000082731174,0.000035627127,0.0011762403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919984,0.003137697,0.0003334299,0.00037265677,0.0036235212,0.00053432107],"domain_scores_gemma":[0.96609145,0.022734016,0.0021644495,0.0014326727,0.006870228,0.00070724107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010744221,0.00085590273,0.0007136627,0.0018070516,0.0005513794,0.00095524394,0.0013566769,0.0010246655,0.001265818],"category_scores_gemma":[0.020552803,0.00022977055,0.0004026345,0.0012879524,0.0008381496,0.0027910885,0.00089900347,0.00096342206,0.00011211462],"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.0043015056,0.0016816303,0.012676034,0.0008242799,0.00016189834,0.00014383506,0.0002271338,0.65462905,0.02203013,0.02052453,0.0009046539,0.28189537],"study_design_scores_gemma":[0.00011825006,0.002260035,0.0032574623,0.000045907425,0.00007225304,0.00010159417,0.00008064322,0.98034817,0.010789296,0.0014711602,0.0014291873,0.000026126447],"about_ca_topic_score_codex":0.004425917,"about_ca_topic_score_gemma":0.0013942749,"teacher_disagreement_score":0.010744221,"about_ca_system_score_codex":0.0018641781,"about_ca_system_score_gemma":0.0010096635,"threshold_uncertainty_score":0.056821525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7021811,0.040342163,0.21861851,0.0046740333,0.0009963936,0.00017150777,0.00039438604,0.0033952824,0.02922667],"genre_scores_gemma":[0.9914091,0.0023892592,0.005162217,0.00007728969,0.0001266779,0.000025486803,0.00006546167,0.00009318951,0.0006513539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983006,0.00054648356,0.000082499355,0.00019815912,0.0005986733,0.00027356733],"domain_scores_gemma":[0.9920276,0.005146728,0.0009409087,0.0005913376,0.0010634357,0.00023013649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003807819,0.0007339169,0.0006087648,0.0013511704,0.00088630134,0.002628817,0.0008876447,0.0010836951,0.0010104458],"category_scores_gemma":[0.019804848,0.00036017157,0.00017798443,0.0013223743,0.0009652844,0.0041814297,0.00076748355,0.0011262348,0.0002879556],"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.0018314829,0.00061959476,0.029724563,0.0006745126,0.00025220372,0.0008921007,0.0009863906,0.6151118,0.064443186,0.11310945,0.011616721,0.16073795],"study_design_scores_gemma":[0.000034546872,0.0002339056,0.0042266827,0.00008357064,0.0001008917,0.0003161762,0.00013136677,0.9544378,0.017385416,0.019953212,0.0030419014,0.000054537504],"about_ca_topic_score_codex":0.0023419869,"about_ca_topic_score_gemma":0.0012712247,"teacher_disagreement_score":0.003807819,"about_ca_system_score_codex":0.0015694377,"about_ca_system_score_gemma":0.00083332683,"threshold_uncertainty_score":0.020137906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027147567,0.0013415372,0.9538834,0.001932429,0.00049847004,0.00013786391,0.000045850647,0.00020681303,0.014806121],"genre_scores_gemma":[0.84970886,0.0014265849,0.14161356,0.00067472435,0.001009376,0.00029597478,0.00006277674,0.00010535879,0.005102773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962823,0.002246601,0.00011662623,0.00022507214,0.00081165147,0.00031777032],"domain_scores_gemma":[0.9931427,0.004958529,0.00024541374,0.00082951086,0.00062307937,0.00020074048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061327037,0.0007185127,0.0009670519,0.00095832336,0.0015577585,0.002142406,0.0025945061,0.0016082972,0.004070447],"category_scores_gemma":[0.014210704,0.0003150384,0.0004054889,0.001314722,0.00438463,0.004130187,0.0021053075,0.00205806,0.00045979634],"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.00024087357,0.000056462573,0.00026656248,0.00007159818,0.000023866618,0.00008501067,0.00016433076,0.17239226,0.0017285122,0.7975908,0.0022105013,0.025169116],"study_design_scores_gemma":[0.000059920992,0.00007814425,0.00013739525,0.00003423311,0.000018833503,0.000053974247,0.000029128532,0.5885608,0.0011173474,0.40238017,0.0075041526,0.000025808762],"about_ca_topic_score_codex":0.0019195452,"about_ca_topic_score_gemma":0.0013847155,"teacher_disagreement_score":0.0061327037,"about_ca_system_score_codex":0.0023360604,"about_ca_system_score_gemma":0.0010289904,"threshold_uncertainty_score":0.03243327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09743646,0.00073851825,0.87675595,0.00017129413,0.00009231878,0.00018101481,0.0009772951,0.004529317,0.019117858],"genre_scores_gemma":[0.84003204,0.0006891582,0.15356627,0.000052261734,0.000041218977,0.00017451473,0.001001102,0.00030231054,0.004141074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.00008077198,0.00002466928,0.000071899645,0.00031164064,0.00006745901],"domain_scores_gemma":[0.99849415,0.0004526771,0.00014094873,0.00018008887,0.0006865065,0.00004557152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058054604,0.00048673793,0.00039955578,0.0015702508,0.00041581967,0.00054622465,0.0008324947,0.00035087636,0.0038551274],"category_scores_gemma":[0.0028713236,0.00020718992,0.0002652781,0.00090172986,0.000278997,0.0006099516,0.00033892016,0.0005809344,0.00085132546],"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.00023606038,0.00019493833,0.010089387,0.00025382114,0.00008629285,0.00019329555,0.00012092758,0.6426461,0.035101496,0.08008032,0.010674896,0.22032247],"study_design_scores_gemma":[0.000005598466,0.000026914753,0.001863258,0.000010625979,0.000013179887,0.00011098202,0.000010335112,0.9780075,0.011348698,0.0054976726,0.0030897362,0.000015543274],"about_ca_topic_score_codex":0.008090948,"about_ca_topic_score_gemma":0.0036311944,"teacher_disagreement_score":0.008090948,"about_ca_system_score_codex":0.0012813391,"about_ca_system_score_gemma":0.00090139825,"threshold_uncertainty_score":0.01608771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21106897,0.0014482973,0.7300987,0.0022758646,0.001568409,0.00052537426,0.00024271048,0.0036913317,0.04908028],"genre_scores_gemma":[0.84261906,0.0011939782,0.14155929,0.0005375675,0.00070453924,0.00012119533,0.00027587338,0.00016546507,0.012823083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986677,0.00026951992,0.00007515769,0.000094375726,0.00063787785,0.00025538472],"domain_scores_gemma":[0.9978173,0.0006335828,0.00021024483,0.0003624182,0.00077460613,0.00020178941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011708807,0.000528756,0.00028238518,0.0006044046,0.00073949894,0.0017846131,0.0012051229,0.0007749548,0.0047358857],"category_scores_gemma":[0.0049527325,0.00032549666,0.00054956746,0.00063856243,0.00066621037,0.0021165512,0.00085574697,0.0029672764,0.0011483693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014510794,0.00045971113,0.0073970226,0.0007516723,0.00009719086,0.0009623318,0.000640704,0.105168074,0.113896795,0.25624448,0.009332207,0.50359875],"study_design_scores_gemma":[0.00032344958,0.003663696,0.005360998,0.00019000651,0.00036568052,0.002809502,0.00031761848,0.5193269,0.14625071,0.057656337,0.26351202,0.00022312453],"about_ca_topic_score_codex":0.004053743,"about_ca_topic_score_gemma":0.003981941,"teacher_disagreement_score":0.0047358857,"about_ca_system_score_codex":0.0007719671,"about_ca_system_score_gemma":0.0015251378,"threshold_uncertainty_score":0.015843093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55071425,0.014086757,0.17870916,0.0030809413,0.00064149714,0.00040092805,0.00082352746,0.001419303,0.25012368],"genre_scores_gemma":[0.91552067,0.00470059,0.041107394,0.00028370201,0.00040141545,0.00012885839,0.0005257926,0.00006968248,0.037261847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997795,0.000054211483,0.000004583611,0.000025179252,0.00008201004,0.00005462099],"domain_scores_gemma":[0.9996735,0.00013164063,0.000027158509,0.000036217367,0.00010116751,0.000030281763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022072546,0.000392067,0.00015917412,0.0003288867,0.00045647364,0.0008435598,0.00026952208,0.00045886304,0.024809375],"category_scores_gemma":[0.0009878597,0.000090107606,0.00019225042,0.00053915835,0.00024309444,0.0008103449,0.00045703634,0.0004188288,0.0024049503],"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.0007414611,0.00024313174,0.008987198,0.0010326391,0.000064096705,0.0015295817,0.0009138524,0.03194734,0.2300405,0.3276401,0.01783988,0.3790202],"study_design_scores_gemma":[0.00020482593,0.0015013373,0.014694302,0.0003318267,0.00025055287,0.0051359124,0.0010246455,0.21059826,0.10709196,0.064034976,0.59499675,0.00013462425],"about_ca_topic_score_codex":0.0021714524,"about_ca_topic_score_gemma":0.0019120278,"teacher_disagreement_score":0.024809375,"about_ca_system_score_codex":0.0005395195,"about_ca_system_score_gemma":0.0005269628,"threshold_uncertainty_score":0.08299565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815555,0.00012300476,0.015033121,0.00018055407,0.00004379784,0.00003659,0.00012237807,0.00028803002,0.002616994],"genre_scores_gemma":[0.9978258,0.000038413877,0.0016549058,0.00001354442,0.0000039032266,0.000013144663,0.00004436764,0.000016124726,0.00038964837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956626,0.00014191003,0.000018161692,0.00004364299,0.00010766664,0.00012237564],"domain_scores_gemma":[0.99378055,0.0048982995,0.00030082092,0.00020025944,0.0006095189,0.00021053503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600032,0.0006104242,0.0006506763,0.0009950759,0.0005951012,0.0006289896,0.0009859777,0.0010861281,0.0012939441],"category_scores_gemma":[0.0054712696,0.00037888324,0.00040658744,0.0007648093,0.0008797148,0.0007173595,0.00039985697,0.00087591074,0.00011819896],"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.00019230224,0.0001888612,0.0028889538,0.000017466631,0.00001716906,0.00005140793,0.000046971923,0.9914812,0.0015138125,0.001079339,0.00022144748,0.0023009947],"study_design_scores_gemma":[0.000005847962,0.000021216698,0.00025857706,7.399065e-7,0.0000032943979,0.000003658022,0.000007717903,0.9990422,0.0005654285,0.00007259747,0.000017101784,0.0000016012171],"about_ca_topic_score_codex":0.019407868,"about_ca_topic_score_gemma":0.0067523443,"teacher_disagreement_score":0.019407868,"about_ca_system_score_codex":0.0015429115,"about_ca_system_score_gemma":0.0008357518,"threshold_uncertainty_score":0.038589776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8927327,0.00081322406,0.103470095,0.00017870977,0.000033987086,0.000067264475,0.0000843692,0.0003482343,0.0022715179],"genre_scores_gemma":[0.9965467,0.00023664243,0.002682092,0.00002245736,0.000011344578,0.000016027878,0.000059206603,0.000025097643,0.00040061594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999587,0.000098389915,0.000018242477,0.000042971194,0.00018990363,0.000063474494],"domain_scores_gemma":[0.99822515,0.001000885,0.00037725,0.00009758881,0.0002454625,0.000053719705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086259836,0.00046756087,0.00030193993,0.0008626982,0.0003348658,0.0005299932,0.0005687439,0.000467652,0.00038464135],"category_scores_gemma":[0.0068187085,0.00017741733,0.00020816435,0.0005984095,0.0006158231,0.0011311931,0.00042643913,0.0004430214,0.00008183758],"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.00044069198,0.00019408866,0.025292978,0.00013858118,0.0000662102,0.00091159414,0.0003330349,0.89299744,0.02697855,0.007963693,0.00077685085,0.043906268],"study_design_scores_gemma":[0.000012387487,0.00015669268,0.0058611166,0.000013351268,0.00002214682,0.00026828583,0.00008695035,0.98080486,0.008798822,0.003589125,0.00037268584,0.000013583913],"about_ca_topic_score_codex":0.0016013698,"about_ca_topic_score_gemma":0.00055424817,"teacher_disagreement_score":0.0016013698,"about_ca_system_score_codex":0.00064525404,"about_ca_system_score_gemma":0.00019101887,"threshold_uncertainty_score":0.004681647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047073923,0.00499793,0.9125262,0.0013937661,0.00042777165,0.00012755732,0.00004419156,0.0019819124,0.03142675],"genre_scores_gemma":[0.8097715,0.0048897048,0.16273838,0.0004384666,0.00061366556,0.00023369247,0.00009712734,0.00020722338,0.021010341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.00021497621,0.000051097566,0.000101479614,0.00038708193,0.0001095856],"domain_scores_gemma":[0.9991386,0.0003238542,0.00018340848,0.00018459048,0.00010570894,0.000063794156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097216363,0.00033179732,0.00028713644,0.00042194658,0.00086347986,0.0020789802,0.0006687916,0.0007808398,0.001173227],"category_scores_gemma":[0.0024747998,0.00030076056,0.00025377236,0.00045101237,0.0012156796,0.002744428,0.0013350288,0.0008536063,0.00039350093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001344995,0.00011029504,0.00092539866,0.0003509524,0.00003560501,0.00071154296,0.0010799415,0.049121596,0.04137672,0.6403302,0.010099645,0.2557236],"study_design_scores_gemma":[0.000060757557,0.00014651936,0.001070047,0.00013548939,0.000081479106,0.00060530525,0.00021106376,0.46343213,0.029385244,0.3432489,0.16153155,0.000091578935],"about_ca_topic_score_codex":0.0009319795,"about_ca_topic_score_gemma":0.0005752186,"teacher_disagreement_score":0.0020789802,"about_ca_system_score_codex":0.00058183155,"about_ca_system_score_gemma":0.00064513047,"threshold_uncertainty_score":0.0051413774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8816387,0.010254532,0.090727374,0.0008395362,0.00028786768,0.000069451366,0.00023157035,0.0016657381,0.014285262],"genre_scores_gemma":[0.99604803,0.0006618826,0.0026690995,0.00002412241,0.00005802033,0.000009443849,0.0000430557,0.000025230956,0.00046120913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.0002649,0.000050966933,0.00017355147,0.00044017925,0.00018432377],"domain_scores_gemma":[0.99739826,0.0011116698,0.00028836267,0.00035993737,0.0007442789,0.000097469114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580336,0.0004180462,0.00035059464,0.00061383395,0.00045980242,0.00096950395,0.0005440327,0.00082404463,0.0006995238],"category_scores_gemma":[0.0072772596,0.00018871664,0.0001656283,0.0009580426,0.00050108874,0.0013511839,0.00046752745,0.0005378895,0.00025440272],"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.0022895222,0.00032702475,0.045773678,0.00042027226,0.00027128324,0.0011375307,0.00047419718,0.46425065,0.15737353,0.0157021,0.006206006,0.30577418],"study_design_scores_gemma":[0.000061002967,0.0015548792,0.03477134,0.0000565533,0.0002803162,0.0016535472,0.00020277873,0.8516142,0.091883056,0.006405775,0.011412761,0.00010389451],"about_ca_topic_score_codex":0.0011659596,"about_ca_topic_score_gemma":0.00055931683,"teacher_disagreement_score":0.0013580336,"about_ca_system_score_codex":0.00057131844,"about_ca_system_score_gemma":0.00028145386,"threshold_uncertainty_score":0.0071820617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012157942,0.00015756399,0.98630863,0.000073777235,0.00004209353,0.00010192548,0.000009154083,0.00046317303,0.0006857678],"genre_scores_gemma":[0.43200594,0.00020558405,0.5656192,0.00013199248,0.00006021552,0.00024700747,0.00007080893,0.0000845216,0.0015748116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986519,0.0002753968,0.00009901131,0.00030414067,0.0005404919,0.00012898544],"domain_scores_gemma":[0.99884975,0.0004986319,0.00011786093,0.00015259147,0.00031854335,0.00006266153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019961912,0.000701775,0.0006810371,0.0009797558,0.0011309077,0.0012494207,0.0022673933,0.001292746,0.0014731194],"category_scores_gemma":[0.0052680015,0.00029280197,0.00046555817,0.0006508717,0.0008275219,0.0016523863,0.0013430326,0.0014258757,0.00032494043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005096193,0.00018462805,0.00083127926,0.00010772248,0.000044664528,0.0001765915,0.00036126186,0.39211172,0.027370427,0.029661197,0.0018418954,0.54679894],"study_design_scores_gemma":[0.000041942785,0.00007284432,0.000091543516,0.000007669926,0.000008099874,0.000062293795,0.000013050344,0.991093,0.0033816074,0.0038907626,0.001320188,0.000016965885],"about_ca_topic_score_codex":0.0027451995,"about_ca_topic_score_gemma":0.0021134294,"teacher_disagreement_score":0.0027451995,"about_ca_system_score_codex":0.0008295686,"about_ca_system_score_gemma":0.0009711527,"threshold_uncertainty_score":0.010556996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019595267,0.000347625,0.9755157,0.0004403323,0.00013486888,0.000056690507,0.00009787155,0.00020144373,0.003610234],"genre_scores_gemma":[0.7007627,0.002441582,0.28363663,0.0004384658,0.0006944778,0.00037308157,0.00047870254,0.00015793946,0.011016403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994905,0.00012239334,0.000032052194,0.00007708465,0.00020371564,0.00007421916],"domain_scores_gemma":[0.99924517,0.00032092386,0.0001009667,0.00008897442,0.0001970598,0.000046921425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261787,0.0007562761,0.0005917594,0.00092038687,0.0004420221,0.0013823806,0.0017867745,0.001721963,0.000791991],"category_scores_gemma":[0.0016183648,0.00038570917,0.00082458346,0.000825173,0.000484552,0.0030451773,0.00075104256,0.0011250102,0.00046856538],"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.00006320604,0.0001491936,0.0018182616,0.000099166224,0.000069899754,0.0003987376,0.00016401845,0.82725114,0.008174448,0.12691298,0.0025682996,0.03233061],"study_design_scores_gemma":[0.0000046576283,0.00002257007,0.00010919081,0.00000607679,0.000009988442,0.00005451271,0.0000105694635,0.9851559,0.0008514359,0.01144215,0.0023223958,0.000010637438],"about_ca_topic_score_codex":0.0028011573,"about_ca_topic_score_gemma":0.0016816533,"teacher_disagreement_score":0.0028011573,"about_ca_system_score_codex":0.0008069636,"about_ca_system_score_gemma":0.0007041241,"threshold_uncertainty_score":0.0058549047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33694738,0.0013803528,0.6576246,0.00019043572,0.0000900589,0.0000733524,0.000024916135,0.00035875794,0.0033101419],"genre_scores_gemma":[0.9665472,0.00024653482,0.032419547,0.000022405064,0.000031160896,0.000023418472,0.000011698984,0.00001032471,0.0006877471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969864,0.00012970067,0.000014301587,0.00002550837,0.00009420873,0.000037588605],"domain_scores_gemma":[0.9995852,0.0001762392,0.000058918176,0.00006273662,0.000092728704,0.00002424622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480538,0.00021513518,0.00018931372,0.0003882937,0.00033159903,0.00067498424,0.00063001073,0.00027864848,0.0006788633],"category_scores_gemma":[0.0016152313,0.00013245674,0.00017623053,0.00026442914,0.000490522,0.00084293226,0.0002589108,0.00034895606,0.00009662748],"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.0009741788,0.00029732625,0.006869749,0.00030478367,0.00008585491,0.0012150229,0.00049831497,0.36509958,0.24184002,0.17545132,0.0017909738,0.20557286],"study_design_scores_gemma":[0.000026405678,0.000181719,0.00052299525,0.000007683522,0.00002029351,0.00026434564,0.000041659234,0.981794,0.009928403,0.004923342,0.0022754816,0.00001377365],"about_ca_topic_score_codex":0.0011335312,"about_ca_topic_score_gemma":0.0010923382,"teacher_disagreement_score":0.0011335312,"about_ca_system_score_codex":0.00048260103,"about_ca_system_score_gemma":0.00041559478,"threshold_uncertainty_score":0.0035015345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018724741,0.000063756735,0.97842854,0.00008710509,0.00002693556,0.00006591209,0.000049795683,0.00053892937,0.0020143276],"genre_scores_gemma":[0.6838871,0.000121821424,0.3134898,0.00003791756,0.000043252574,0.00015946437,0.00019474323,0.00009026646,0.0019755587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994247,0.0001584055,0.000035813217,0.00006308066,0.00022974786,0.00008827792],"domain_scores_gemma":[0.99919754,0.0003111925,0.00006233609,0.0001786522,0.00018757225,0.000062775354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011862642,0.00045796265,0.0005469994,0.000680471,0.0006805816,0.0009844993,0.0011482429,0.0005595899,0.0022443389],"category_scores_gemma":[0.003644354,0.00030098256,0.00039438347,0.00075720204,0.0005020825,0.00095480715,0.0010628803,0.0007063955,0.0003682837],"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.00021988392,0.00006119247,0.00038151146,0.000047341557,0.000015340822,0.000085027365,0.00012514685,0.826448,0.007812613,0.06075065,0.0015081461,0.102545105],"study_design_scores_gemma":[0.000009825502,0.000013535202,0.00003383854,0.0000020970258,0.0000018985074,0.000009590859,0.000004386432,0.99562067,0.0005740694,0.0031448896,0.0005808552,0.0000042889005],"about_ca_topic_score_codex":0.0034580524,"about_ca_topic_score_gemma":0.002104976,"teacher_disagreement_score":0.0034580524,"about_ca_system_score_codex":0.0013691005,"about_ca_system_score_gemma":0.0010051434,"threshold_uncertainty_score":0.009933591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06322492,0.0021691232,0.9290387,0.000349135,0.00018287878,0.0000823329,0.000017531775,0.0006620965,0.0042733755],"genre_scores_gemma":[0.92026323,0.0006589638,0.07691609,0.00010424853,0.00016061324,0.00005387397,0.00002090392,0.000018700966,0.001803365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997967,0.000048893577,0.0000127227,0.000045332166,0.00007253364,0.000023717103],"domain_scores_gemma":[0.99951124,0.00020494558,0.00006678554,0.00003559264,0.00016140963,0.000019927522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478755,0.0004155102,0.00031082792,0.0003793983,0.00023970653,0.00058713014,0.000922635,0.00043246243,0.0007916937],"category_scores_gemma":[0.0014369662,0.00013888396,0.00021934144,0.00026026857,0.00055769854,0.0005208466,0.00025471288,0.00053675735,0.00013818305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030705018,0.0002826092,0.0024098903,0.00031838578,0.000088223955,0.00024233294,0.0001897437,0.45811576,0.040655497,0.029665234,0.0031048628,0.46462044],"study_design_scores_gemma":[0.00003953896,0.000110626424,0.00028823878,0.0000073277897,0.000019222342,0.00003249286,0.000008076388,0.9914449,0.0038564855,0.0028210185,0.0013628792,0.000009222488],"about_ca_topic_score_codex":0.0020226797,"about_ca_topic_score_gemma":0.0012837675,"teacher_disagreement_score":0.0020226797,"about_ca_system_score_codex":0.0003877052,"about_ca_system_score_gemma":0.00042233613,"threshold_uncertainty_score":0.0040218234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23459607,0.0018674213,0.74956256,0.00048023858,0.00011429331,0.00024886272,0.00024921377,0.0014121169,0.011469224],"genre_scores_gemma":[0.98793715,0.0003357981,0.010704878,0.000029375256,0.000026847982,0.00009774333,0.00010040116,0.00005697155,0.00071088877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977514,0.0005051588,0.0001164883,0.00025543792,0.0009979001,0.00037364307],"domain_scores_gemma":[0.99139154,0.004291151,0.0008722796,0.0003774202,0.0028825242,0.00018508651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026670215,0.0009155671,0.0008718457,0.0016826999,0.000653538,0.0010060497,0.0008417372,0.0009024036,0.0026474632],"category_scores_gemma":[0.010079052,0.00023060782,0.000720019,0.0005573834,0.0006833565,0.00095875526,0.0007076683,0.00084431045,0.00042675348],"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.0006820336,0.00023736076,0.0040141153,0.00047601474,0.000091850845,0.0005780618,0.00042890647,0.8297132,0.08819398,0.032283653,0.0026234095,0.04067735],"study_design_scores_gemma":[0.000006005065,0.00007053338,0.00037869046,0.000010494915,0.000012151418,0.000045957437,0.0000211314,0.9923552,0.0059299925,0.0009588146,0.00019921633,0.000011719631],"about_ca_topic_score_codex":0.003371281,"about_ca_topic_score_gemma":0.0011837786,"teacher_disagreement_score":0.003371281,"about_ca_system_score_codex":0.001335397,"about_ca_system_score_gemma":0.0012993991,"threshold_uncertainty_score":0.014104724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77580965,0.0043097753,0.17957965,0.0008532562,0.00006977256,0.00006535613,0.00025372545,0.00041286158,0.038645983],"genre_scores_gemma":[0.9874653,0.0019084555,0.007493299,0.000055892488,0.00004988786,0.000017735081,0.00009368419,0.000047754653,0.0028678724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.00006965253,0.000008784552,0.00003611183,0.0001394282,0.000038212438],"domain_scores_gemma":[0.9962914,0.0026559064,0.00017809219,0.00032479133,0.00044507466,0.000104762206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007216491,0.00034086275,0.00035963464,0.0008224338,0.00034545487,0.0007099819,0.0007941153,0.0004957079,0.0014737647],"category_scores_gemma":[0.005328643,0.00045418623,0.00020491837,0.0008161806,0.0006003438,0.0021415723,0.00030078378,0.0011247124,0.00019505942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045223057,0.0005677659,0.01316323,0.0004155128,0.0000794788,0.00048339445,0.0011557024,0.34681216,0.085978724,0.4274243,0.0034551127,0.12001237],"study_design_scores_gemma":[0.000008864183,0.00008145297,0.0045331134,0.000033079486,0.000015414376,0.0003039671,0.00017839318,0.91404593,0.009018314,0.069582894,0.0021787358,0.000019779922],"about_ca_topic_score_codex":0.00072153215,"about_ca_topic_score_gemma":0.00046768252,"teacher_disagreement_score":0.0014737647,"about_ca_system_score_codex":0.00060618,"about_ca_system_score_gemma":0.00025004058,"threshold_uncertainty_score":0.004930198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.437807,0.001900472,0.5495993,0.0007247432,0.00018882162,0.00011835203,0.00017210284,0.0028378994,0.006651311],"genre_scores_gemma":[0.97636104,0.00020339522,0.020889325,0.000052405565,0.00005191163,0.000025238784,0.00007473749,0.000049740815,0.0022921802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997509,0.000048277427,0.000014651897,0.000041642434,0.00007722896,0.000067309185],"domain_scores_gemma":[0.9994572,0.00014822933,0.00005868359,0.00013197299,0.00013631271,0.00006755239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587812,0.00026691548,0.0004155197,0.0005561088,0.0007437645,0.0012204221,0.0011143219,0.00029608834,0.0020551113],"category_scores_gemma":[0.0015480445,0.00022390598,0.00013683512,0.00038012816,0.00038341276,0.0013909088,0.00090710056,0.00075352157,0.0002781118],"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.0020955575,0.000539686,0.0069069997,0.00023642907,0.00010064145,0.00022976477,0.0007274573,0.22054029,0.11022778,0.042617902,0.009336538,0.6064409],"study_design_scores_gemma":[0.000064144726,0.00017324758,0.0012209781,0.000016892784,0.000058384383,0.000056386016,0.00012047064,0.95585036,0.020881211,0.017643426,0.0038942231,0.000020221025],"about_ca_topic_score_codex":0.0021432126,"about_ca_topic_score_gemma":0.0040768813,"teacher_disagreement_score":0.0021432126,"about_ca_system_score_codex":0.0008024234,"about_ca_system_score_gemma":0.00055896404,"threshold_uncertainty_score":0.006875038},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260901,0.0016786292,0.15928398,0.0015961652,0.00033282157,0.00008743991,0.00018947566,0.0004226423,0.010318722],"genre_scores_gemma":[0.9951024,0.00030450211,0.002009534,0.000045412173,0.000104750805,0.000022751572,0.00004130045,0.000028781922,0.0023406234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946433,0.00017543267,0.000014739678,0.00009492319,0.00011800546,0.00013259324],"domain_scores_gemma":[0.9956012,0.002798653,0.00040711713,0.000121714795,0.0006375201,0.00043373366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976603,0.0005813609,0.0012842452,0.0011099043,0.0010187528,0.002098124,0.00090199366,0.0009780625,0.0031134554],"category_scores_gemma":[0.008036023,0.00067835534,0.00029757238,0.00086846616,0.0011196833,0.0017367821,0.0011708846,0.00090337323,0.00021199185],"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.00061726,0.00015497157,0.002801862,0.00020122343,0.000060108174,0.00054348365,0.00020921572,0.9132728,0.012291472,0.05298461,0.0037388725,0.0131241195],"study_design_scores_gemma":[0.000021440668,0.00003600591,0.00062366633,0.000007305165,0.00001374504,0.000040967458,0.000041063602,0.990302,0.00037004697,0.008332516,0.00020164622,0.000009580999],"about_ca_topic_score_codex":0.0038842792,"about_ca_topic_score_gemma":0.0026786611,"teacher_disagreement_score":0.0038842792,"about_ca_system_score_codex":0.0016202751,"about_ca_system_score_gemma":0.0004743347,"threshold_uncertainty_score":0.011756003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052782744,0.00035485107,0.9455377,0.00010138759,0.000031009295,0.00004066582,0.000025422452,0.00034037518,0.00078580657],"genre_scores_gemma":[0.6882793,0.00021939796,0.31005082,0.000070802846,0.00002700416,0.000093180664,0.00011446682,0.00008178795,0.0010633353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00008715662,0.000022073706,0.00007778478,0.00008462758,0.00008076953],"domain_scores_gemma":[0.99938214,0.00036339634,0.00007576174,0.000048366514,0.00008811561,0.000042186264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006638432,0.00068342354,0.00083578407,0.0006182121,0.00059158826,0.0008150813,0.0012108738,0.0005953974,0.0008465818],"category_scores_gemma":[0.0016366645,0.00042466514,0.00031401616,0.00043175457,0.00043974712,0.0011552304,0.000873803,0.0005895728,0.00017307549],"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.0004117518,0.00010350733,0.0012401154,0.000094824274,0.000042222204,0.00013336526,0.00019951822,0.81659967,0.01580818,0.024920829,0.0013476585,0.13909847],"study_design_scores_gemma":[0.000012837747,0.000011086995,0.00004266417,0.0000034518434,0.0000038793505,0.000015392123,0.000008604566,0.99399275,0.0021251505,0.0035760703,0.00020369064,0.0000043577875],"about_ca_topic_score_codex":0.0025507973,"about_ca_topic_score_gemma":0.0024033687,"teacher_disagreement_score":0.0025507973,"about_ca_system_score_codex":0.0010513593,"about_ca_system_score_gemma":0.001003079,"threshold_uncertainty_score":0.007628262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99056315,0.00015098462,0.0067454227,0.00006252486,0.000055210163,0.00017100318,0.00013474032,0.00055631157,0.0015606015],"genre_scores_gemma":[0.9967338,0.00005112658,0.0027082765,0.000016725664,0.000011116393,0.000032164106,0.00013709939,0.00002328111,0.00028638836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967919,0.001167323,0.00024833047,0.00033453378,0.0010288453,0.000429077],"domain_scores_gemma":[0.98813665,0.004966301,0.0009096574,0.0012041376,0.0041795783,0.00060377544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00279755,0.001164093,0.00081385695,0.0013394597,0.0005675742,0.00089397404,0.0013883937,0.0008300597,0.0015028236],"category_scores_gemma":[0.012339319,0.00028030394,0.0002580266,0.0008562388,0.0006048281,0.0016650384,0.0005902169,0.00054787,0.00024785526],"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.01747451,0.004512484,0.0272363,0.0010575323,0.00042495376,0.0026181892,0.00041940052,0.49372715,0.30511108,0.002843739,0.0036578462,0.14091676],"study_design_scores_gemma":[0.0007960593,0.026990142,0.03255549,0.000090992056,0.00042447748,0.0015228678,0.0006252582,0.6490296,0.28451005,0.000939329,0.0023568717,0.00015885255],"about_ca_topic_score_codex":0.0018983146,"about_ca_topic_score_gemma":0.0013920148,"teacher_disagreement_score":0.00279755,"about_ca_system_score_codex":0.0012171934,"about_ca_system_score_gemma":0.0006173321,"threshold_uncertainty_score":0.014795005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012423487,0.0017692709,0.97381955,0.00058643805,0.0017284027,0.00042086793,0.000119754404,0.0029662293,0.0061660637],"genre_scores_gemma":[0.62853605,0.0017009302,0.35393676,0.0010316583,0.0012345085,0.0010852626,0.00028226292,0.00023660982,0.011955999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976799,0.0005519432,0.00020845489,0.0002882832,0.001052119,0.00021932644],"domain_scores_gemma":[0.9962514,0.00090950687,0.0004946778,0.00081199565,0.0013599113,0.00017251674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042055417,0.00072363176,0.00082405406,0.0016741665,0.0012870622,0.0019761513,0.0023980285,0.0012926365,0.0027335759],"category_scores_gemma":[0.0072652195,0.00042908717,0.0005740145,0.0009230465,0.0010350784,0.0022037085,0.0014857796,0.0025635909,0.0007772001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097421533,0.0007557397,0.0024125883,0.0014339327,0.00021062818,0.0009835187,0.0006784241,0.042591907,0.124713644,0.4116817,0.020743791,0.3928198],"study_design_scores_gemma":[0.00052160025,0.0015117133,0.0019418132,0.0003534581,0.000429652,0.0030326832,0.000098842575,0.6802195,0.09360548,0.08691103,0.13087545,0.0004988042],"about_ca_topic_score_codex":0.00089666934,"about_ca_topic_score_gemma":0.00092000497,"teacher_disagreement_score":0.0042055417,"about_ca_system_score_codex":0.0012860633,"about_ca_system_score_gemma":0.0018873448,"threshold_uncertainty_score":0.022241294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038398035,0.0010599778,0.889841,0.0020848378,0.00084834296,0.00023257233,0.00012524365,0.0060881367,0.061321765],"genre_scores_gemma":[0.5719058,0.002076091,0.38037568,0.0017104434,0.0010860261,0.0006123832,0.0004641455,0.0008754013,0.040894024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985891,0.00032850186,0.000066781926,0.00023925153,0.000630077,0.0001462437],"domain_scores_gemma":[0.99905497,0.00019218335,0.00006148832,0.00019587218,0.0002656479,0.0002298423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012037262,0.00052790466,0.00045571625,0.00054396666,0.0012145228,0.0038578806,0.0016808378,0.0011213463,0.0024498645],"category_scores_gemma":[0.0016498003,0.0003403987,0.00041788846,0.0005181674,0.0014515995,0.005964084,0.003185144,0.0018602987,0.0009833538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061337365,0.00032454677,0.0021936928,0.0003760262,0.00006242852,0.0014726367,0.002272997,0.017434614,0.05405766,0.7283664,0.020226464,0.17259912],"study_design_scores_gemma":[0.00013374242,0.0005265351,0.0010185252,0.0001289733,0.000093167044,0.0022245182,0.00057170796,0.17217724,0.025124282,0.13941568,0.65841734,0.0001683015],"about_ca_topic_score_codex":0.0009686438,"about_ca_topic_score_gemma":0.0008366391,"teacher_disagreement_score":0.0038578806,"about_ca_system_score_codex":0.000810158,"about_ca_system_score_gemma":0.0012806583,"threshold_uncertainty_score":0.008195639},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6375871,0.00041277253,0.34965733,0.0002721881,0.0001047005,0.00026797745,0.00025727635,0.00087646436,0.010564171],"genre_scores_gemma":[0.90797925,0.0005085542,0.089761056,0.000054165193,0.000009568276,0.00007676659,0.00012784815,0.00003087099,0.0014519155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929225,0.00015565084,0.000036512116,0.00004980397,0.0004004746,0.00006513819],"domain_scores_gemma":[0.99905616,0.0003860237,0.00010971405,0.00016565397,0.0002411375,0.00004127234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013298754,0.00036195718,0.00041879047,0.00035530597,0.0003602904,0.0009955026,0.00080634485,0.0005197324,0.0007737218],"category_scores_gemma":[0.0030654753,0.00016950173,0.00026833825,0.0005014237,0.0005798222,0.0011786693,0.0005118703,0.00070904876,0.00021345138],"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.00059921254,0.0004557249,0.006667871,0.00032375485,0.00009877356,0.00027573056,0.00026581666,0.77169037,0.11920811,0.041400213,0.00096425915,0.058050208],"study_design_scores_gemma":[0.00009436616,0.00057041494,0.0009869048,0.000016944918,0.000058146623,0.00011365214,0.000043758548,0.9413141,0.04902489,0.0037437866,0.0040118033,0.000021322858],"about_ca_topic_score_codex":0.0023003225,"about_ca_topic_score_gemma":0.0014467377,"teacher_disagreement_score":0.0023003225,"about_ca_system_score_codex":0.0009870229,"about_ca_system_score_gemma":0.00085002644,"threshold_uncertainty_score":0.007161379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039808843,0.0036003436,0.68302685,0.0013651438,0.002311732,0.000369432,0.03634906,0.09552926,0.17346731],"genre_scores_gemma":[0.07091403,0.010554265,0.5447463,0.0022983772,0.0008767627,0.0019282994,0.07276796,0.045904856,0.25000918],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999582,0.00006371702,0.00002732595,0.00004429758,0.00023439969,0.00004836774],"domain_scores_gemma":[0.9991954,0.00029048318,0.00002759857,0.00015861886,0.0002758109,0.000051997093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005956491,0.0014443782,0.00083438674,0.0009875726,0.00046885584,0.0014605785,0.0019792786,0.0009414972,0.073957235],"category_scores_gemma":[0.002537512,0.0008949464,0.00064670574,0.0014613792,0.0002521228,0.0021142794,0.0006809709,0.0026573667,0.032225106],"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.00016302761,0.00018786782,0.00054522045,0.0007274735,0.000093225804,0.000083743376,0.000106796586,0.15637508,0.0059028617,0.042385094,0.60905564,0.18437402],"study_design_scores_gemma":[0.0000811452,0.000044365843,0.0003004362,0.00015861646,0.000041625815,0.0001232609,0.000025555517,0.27374706,0.0064228857,0.03444725,0.6845407,0.000067045774],"about_ca_topic_score_codex":0.0059657386,"about_ca_topic_score_gemma":0.0070423526,"teacher_disagreement_score":0.073957235,"about_ca_system_score_codex":0.0008525561,"about_ca_system_score_gemma":0.0011946788,"threshold_uncertainty_score":0.24741161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07392922,0.0006858943,0.9166927,0.00040072814,0.00014431999,0.00008190812,0.00013997621,0.0022235853,0.0057016225],"genre_scores_gemma":[0.8441672,0.000704361,0.15088183,0.00018294308,0.000066285524,0.00006205234,0.00018541774,0.00008833626,0.0036615022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.00007084841,0.000014790381,0.000032190852,0.00012233514,0.000024976665],"domain_scores_gemma":[0.9996387,0.00014028241,0.00003038737,0.000055053864,0.000115585586,0.00001994748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047621844,0.00039410722,0.00022284535,0.00038629054,0.00032309903,0.0004654974,0.00073006033,0.0004101535,0.0007847022],"category_scores_gemma":[0.0012104696,0.00017683297,0.00021763695,0.0004192241,0.00038130733,0.0007013475,0.0003266789,0.0005032828,0.00021049395],"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.00038508183,0.00016443965,0.0017866797,0.0001803702,0.000049515766,0.00038692643,0.00023638313,0.5214609,0.07344569,0.099536106,0.0059760613,0.2963919],"study_design_scores_gemma":[0.00001939316,0.000038788112,0.00013758795,0.0000056441836,0.00001161651,0.00006870327,0.0000084743615,0.97072786,0.010610385,0.013589219,0.004770902,0.00001135053],"about_ca_topic_score_codex":0.0019808128,"about_ca_topic_score_gemma":0.0013344797,"teacher_disagreement_score":0.0019808128,"about_ca_system_score_codex":0.0007494161,"about_ca_system_score_gemma":0.00036917342,"threshold_uncertainty_score":0.005437374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035622776,0.00020270809,0.9617701,0.00026085984,0.000051290477,0.000029099285,0.000018429686,0.00072663033,0.0013180296],"genre_scores_gemma":[0.631542,0.00013596614,0.36614847,0.00008441669,0.00004753876,0.00008201508,0.0001021403,0.000064493455,0.0017929866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00006653465,0.000019801382,0.000060481554,0.00015696102,0.00004625092],"domain_scores_gemma":[0.9995358,0.0001831728,0.00005576969,0.00006735608,0.0001318094,0.000026174599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864358,0.00037532588,0.00044962243,0.00046054358,0.00055417215,0.00044205325,0.0009860815,0.0006749446,0.0012179264],"category_scores_gemma":[0.0022499198,0.00017228615,0.00022256932,0.0003138276,0.00036564944,0.0008351193,0.00066205004,0.00059199205,0.00027278275],"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.00054232683,0.000110635876,0.0013327866,0.00010037378,0.000044955555,0.00023261696,0.00017725212,0.6698603,0.02556282,0.03254057,0.003036702,0.26645866],"study_design_scores_gemma":[0.000033805092,0.000038292274,0.000086805296,0.000004333118,0.000006700878,0.000049078724,0.0000106890775,0.99292314,0.0021315177,0.003714651,0.0009968908,0.000004085401],"about_ca_topic_score_codex":0.0013647103,"about_ca_topic_score_gemma":0.0009000465,"teacher_disagreement_score":0.0013647103,"about_ca_system_score_codex":0.0006266912,"about_ca_system_score_gemma":0.0005619518,"threshold_uncertainty_score":0.0045470595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04735049,0.0003833274,0.93347734,0.00054578873,0.00012394143,0.000077984216,0.00003985769,0.0003114693,0.017689873],"genre_scores_gemma":[0.9754912,0.00018583541,0.020286385,0.0000924551,0.000054704586,0.00012306034,0.000038886148,0.00002752496,0.0037000172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995521,0.00014550996,0.000015162934,0.00008718978,0.0001417718,0.000058261543],"domain_scores_gemma":[0.9993544,0.00027651587,0.000120199016,0.00005670478,0.00014567237,0.000046444955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317349,0.0006291677,0.0005318406,0.0003676076,0.00044708888,0.0008170716,0.0007273438,0.000742215,0.0026337674],"category_scores_gemma":[0.0016634563,0.00025779422,0.00029485562,0.00026019762,0.00069397467,0.00070714956,0.00086418114,0.0006348895,0.00024333887],"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.00007553105,0.000057860652,0.00016813292,0.00006548304,0.000024146308,0.00009847104,0.00007239379,0.88190305,0.0047158897,0.08789365,0.0017280846,0.023197275],"study_design_scores_gemma":[0.000028944107,0.000038067905,0.000047919053,0.0000041356125,0.0000040542923,0.0000133817875,0.000010068749,0.97893983,0.0003692428,0.01937358,0.0011666272,0.0000040856776],"about_ca_topic_score_codex":0.0019597476,"about_ca_topic_score_gemma":0.0013477954,"teacher_disagreement_score":0.0026337674,"about_ca_system_score_codex":0.0007515541,"about_ca_system_score_gemma":0.00060241245,"threshold_uncertainty_score":0.008810878},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008633209,0.002965048,0.847015,0.0012719523,0.0008144804,0.000055767963,0.0005801493,0.0017457881,0.13691862],"genre_scores_gemma":[0.4179614,0.01986911,0.19870152,0.00080208515,0.0016350969,0.00043813392,0.0037051097,0.0013144715,0.35557306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984336,0.000026342195,0.000004767797,0.000041277093,0.00007102104,0.000013133863],"domain_scores_gemma":[0.99985325,0.000054811415,0.000009621771,0.000033611956,0.00003953958,0.0000090386275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022538968,0.0012338173,0.00052631553,0.00049811625,0.00032077255,0.0010941473,0.0010972056,0.00072635844,0.006870952],"category_scores_gemma":[0.00079885556,0.0004493381,0.0005715826,0.00061439583,0.00040326273,0.0017932806,0.0005599975,0.0011509621,0.002970726],"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.00001719365,0.00007116545,0.0003900927,0.000118389224,0.000034538436,0.00006514268,0.00007990229,0.5431629,0.002785312,0.28048494,0.03594594,0.13684455],"study_design_scores_gemma":[0.000003422762,0.000010291967,0.00014193091,0.000039541508,0.000015842788,0.000042263797,0.000016581245,0.786719,0.001239358,0.16040543,0.051351693,0.000014710962],"about_ca_topic_score_codex":0.004632668,"about_ca_topic_score_gemma":0.0034033079,"teacher_disagreement_score":0.006870952,"about_ca_system_score_codex":0.00093195116,"about_ca_system_score_gemma":0.000685888,"threshold_uncertainty_score":0.022985637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898099,0.00013728092,0.00876488,0.00004628322,0.00001965473,0.000017393806,0.000033710447,0.00018945,0.0009813996],"genre_scores_gemma":[0.9982799,0.00003441829,0.0014516161,0.000007601,0.000004945141,0.0000034076609,0.000031761272,0.0000071436393,0.00017911871],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952924,0.00014920376,0.000019078383,0.00005402565,0.00014825203,0.00010023565],"domain_scores_gemma":[0.9991867,0.00036197715,0.00006464665,0.000069926165,0.00022395203,0.00009280602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094508537,0.0004944526,0.00035087066,0.0003986267,0.00030336852,0.00036444725,0.00040268348,0.0003859841,0.0007816845],"category_scores_gemma":[0.0012173031,0.00010887511,0.00015937747,0.00023678534,0.000263222,0.00041163067,0.00026830373,0.00026675366,0.00011335538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009258195,0.001451058,0.021732047,0.000317656,0.00024228255,0.00059651455,0.00022952854,0.3420415,0.5348778,0.0023472272,0.0011341565,0.08577203],"study_design_scores_gemma":[0.00020628206,0.0061842017,0.0077573555,0.00001003314,0.00011306751,0.0002662514,0.000060423965,0.813801,0.17070392,0.00033303854,0.0005340378,0.000030332585],"about_ca_topic_score_codex":0.0011397239,"about_ca_topic_score_gemma":0.00053427386,"teacher_disagreement_score":0.0011397239,"about_ca_system_score_codex":0.00047190435,"about_ca_system_score_gemma":0.00021058989,"threshold_uncertainty_score":0.004998207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16549535,0.0011456358,0.8048193,0.0009888702,0.0002203776,0.00012858104,0.00008525866,0.004005267,0.023111342],"genre_scores_gemma":[0.8898038,0.0007139314,0.10374663,0.0001855239,0.00014092217,0.00010352029,0.000077555,0.000076049015,0.005152009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997663,0.000041813397,0.000010255848,0.000039721934,0.00010954959,0.00003243717],"domain_scores_gemma":[0.9996557,0.00015596888,0.000060929822,0.00006407106,0.0000431379,0.000020247697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029481345,0.00038112313,0.00020427674,0.0003923564,0.0003545697,0.00071820157,0.0006278265,0.00043180666,0.0014952032],"category_scores_gemma":[0.0009156979,0.00013062735,0.00017386381,0.00024194339,0.00060968864,0.0014967103,0.00069807534,0.00047301062,0.00022909633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004050753,0.00026427011,0.0013658612,0.0001704438,0.00003329744,0.00036452553,0.0004362267,0.051872227,0.37993482,0.12184256,0.007201847,0.43610883],"study_design_scores_gemma":[0.00011370366,0.0002785056,0.0010362827,0.00003179149,0.000057342964,0.00049267785,0.00010484506,0.7072678,0.16298059,0.07110503,0.056464,0.0000674617],"about_ca_topic_score_codex":0.0008607587,"about_ca_topic_score_gemma":0.00079119863,"teacher_disagreement_score":0.0014952032,"about_ca_system_score_codex":0.00030339137,"about_ca_system_score_gemma":0.0002713716,"threshold_uncertainty_score":0.005001962},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062553436,0.0002906071,0.97743726,0.0006708348,0.00015124887,0.00016428418,0.000039054714,0.0015257656,0.0134655675],"genre_scores_gemma":[0.32016134,0.00090085977,0.6612329,0.00062197185,0.00028458273,0.00068332104,0.00031531678,0.0005060353,0.015293658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973882,0.0007629665,0.00020709113,0.00040126772,0.0010157157,0.0002246862],"domain_scores_gemma":[0.99680555,0.00092571124,0.00036032678,0.0011911595,0.0003322865,0.0003850557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048759542,0.0007283717,0.0003723477,0.0011207167,0.0014434328,0.005368513,0.0033434997,0.0015718731,0.0024750023],"category_scores_gemma":[0.004578339,0.00076320866,0.0006112305,0.0007246513,0.0024082942,0.0070167775,0.0035178629,0.0034755112,0.0009192742],"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.00009992295,0.0001809559,0.0008130503,0.00012222215,0.000046163143,0.00032027334,0.0011316531,0.020311527,0.012196256,0.86893606,0.0043350756,0.091506734],"study_design_scores_gemma":[0.00006934069,0.00015836634,0.00055209326,0.00017638152,0.000067692185,0.00049731723,0.00033405673,0.2320132,0.017704912,0.40096852,0.347327,0.00013116091],"about_ca_topic_score_codex":0.0012882431,"about_ca_topic_score_gemma":0.0013864455,"teacher_disagreement_score":0.005368513,"about_ca_system_score_codex":0.0016013668,"about_ca_system_score_gemma":0.001412191,"threshold_uncertainty_score":0.025786817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97967404,0.0004096642,0.012067289,0.0002241012,0.00004978571,0.00004221472,0.000036234007,0.00008830617,0.0074085016],"genre_scores_gemma":[0.9954847,0.00021536164,0.0030320866,0.000028836372,0.000011781766,0.00000788011,0.000018283336,0.0000069005287,0.0011943632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995925,0.00017432633,0.000008970851,0.00004492845,0.000077681165,0.000101653204],"domain_scores_gemma":[0.99947566,0.00022060516,0.000076244556,0.000051940697,0.00009424432,0.0000813309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741488,0.00025533632,0.0002065534,0.00015778268,0.00055225095,0.00065428804,0.0006285276,0.00046883457,0.0017905512],"category_scores_gemma":[0.0014216149,0.0000930198,0.00013258247,0.0003438075,0.00046273106,0.0010250537,0.00034886607,0.00036154213,0.00021857588],"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.0019706665,0.00064026384,0.021097228,0.0002777209,0.00008127855,0.0014244256,0.00038093654,0.7140873,0.055232428,0.030511823,0.004668018,0.16962782],"study_design_scores_gemma":[0.00013861358,0.0020830333,0.0067634154,0.000035388504,0.00010377055,0.00067845173,0.00080728694,0.94218916,0.029611578,0.009087771,0.008457544,0.000043880085],"about_ca_topic_score_codex":0.002574627,"about_ca_topic_score_gemma":0.0029989479,"teacher_disagreement_score":0.002574627,"about_ca_system_score_codex":0.0006439596,"about_ca_system_score_gemma":0.00037314979,"threshold_uncertainty_score":0.005989969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085694894,0.002315872,0.9023841,0.0015624654,0.0001776219,0.00009991299,0.000084367864,0.00092777715,0.0067530028],"genre_scores_gemma":[0.48375338,0.0024442961,0.5048213,0.00043853562,0.00032330918,0.00007812696,0.00027904133,0.00008963607,0.0077724587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.0000709782,0.000013906794,0.00003338339,0.00017157514,0.00005607668],"domain_scores_gemma":[0.99974996,0.00004726782,0.00002431369,0.000022088625,0.00013379163,0.00002250792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554264,0.00033017003,0.00021235134,0.00048756125,0.00030385828,0.0009235682,0.0009482996,0.0008311975,0.0013137771],"category_scores_gemma":[0.0009834882,0.00017093551,0.00013795226,0.0004302578,0.00031957784,0.0012066616,0.0005649905,0.0006601646,0.0007698312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047837867,0.0002555479,0.0021950607,0.00037978718,0.000037647584,0.00043728997,0.00034179393,0.06353152,0.18379296,0.16419388,0.010225529,0.5741306],"study_design_scores_gemma":[0.00013854472,0.0006702103,0.0012877084,0.00008682948,0.00006478683,0.00082680886,0.00023927653,0.806243,0.06541828,0.029436843,0.09554779,0.000039933388],"about_ca_topic_score_codex":0.0010001428,"about_ca_topic_score_gemma":0.0007468552,"teacher_disagreement_score":0.0013137771,"about_ca_system_score_codex":0.00053208147,"about_ca_system_score_gemma":0.00055531744,"threshold_uncertainty_score":0.0050528646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24097072,0.0013137554,0.7489214,0.00063712907,0.00007032224,0.00008021002,0.00009606705,0.001311247,0.0065991557],"genre_scores_gemma":[0.94664556,0.00048009786,0.05149557,0.00011370572,0.000031695647,0.00004664858,0.00008744708,0.00004321099,0.0010560708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998992,0.000290088,0.00006114115,0.0000713445,0.00046067004,0.00012480766],"domain_scores_gemma":[0.99894077,0.0004903759,0.00013256713,0.00017055479,0.00020962679,0.0000562289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994538,0.00053190143,0.00036793278,0.00046155523,0.0004973569,0.0012595496,0.0011904428,0.0006507294,0.00049018644],"category_scores_gemma":[0.0046931747,0.00036409427,0.00020495256,0.00046234037,0.00068115327,0.0019114383,0.00084122113,0.00091042556,0.00020548089],"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.00060299295,0.00025915971,0.0058958805,0.00024060167,0.00004761191,0.00045868973,0.00051675114,0.5815858,0.048500225,0.21998961,0.0030508225,0.13885175],"study_design_scores_gemma":[0.000045297886,0.0001137446,0.0007493032,0.000020393885,0.00002112502,0.00008029552,0.00004023179,0.9299968,0.01677361,0.048696138,0.0034398558,0.000023285194],"about_ca_topic_score_codex":0.0015220055,"about_ca_topic_score_gemma":0.0009846607,"teacher_disagreement_score":0.001994538,"about_ca_system_score_codex":0.0011535931,"about_ca_system_score_gemma":0.000683805,"threshold_uncertainty_score":0.010548234},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025216568,0.0013012076,0.9656084,0.00043301814,0.0005014139,0.00018618195,0.00007359528,0.0020889624,0.0045907376],"genre_scores_gemma":[0.73676527,0.0012057323,0.24592195,0.0003536594,0.0006665618,0.00048244357,0.00021334423,0.00014715045,0.014243945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953294,0.0000942882,0.00003261818,0.000087850145,0.00019821498,0.000054005868],"domain_scores_gemma":[0.9994357,0.00014103497,0.00008011933,0.00009282587,0.00018720608,0.000063176114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529689,0.0004892752,0.00036117408,0.0007280969,0.00066581526,0.0012196323,0.0013857161,0.00094533217,0.0028215474],"category_scores_gemma":[0.0015487522,0.00021792766,0.0003100002,0.0004377275,0.00093573204,0.0018685635,0.0006620207,0.0010371247,0.0005093839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039620147,0.00027991153,0.0014800676,0.00051165384,0.00018043643,0.00093067816,0.000520416,0.15500052,0.09065915,0.43707958,0.019480215,0.29348114],"study_design_scores_gemma":[0.00028872624,0.00068258547,0.0010809412,0.00007855728,0.00012458173,0.00095489895,0.00004988045,0.80680025,0.027583577,0.06486666,0.09737324,0.000116068244],"about_ca_topic_score_codex":0.0010029471,"about_ca_topic_score_gemma":0.0007413349,"teacher_disagreement_score":0.0028215474,"about_ca_system_score_codex":0.0008513279,"about_ca_system_score_gemma":0.0006302894,"threshold_uncertainty_score":0.009438992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35551316,0.009454693,0.5460361,0.00062969007,0.0005260039,0.00053132005,0.0003343857,0.006451271,0.0805235],"genre_scores_gemma":[0.8811997,0.0023245371,0.11018526,0.00010528529,0.00012967824,0.00015040988,0.00045139255,0.0003272009,0.005126644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794155,0.0005792938,0.00014222047,0.0002330902,0.000904974,0.00019894338],"domain_scores_gemma":[0.99533975,0.002662383,0.00020792766,0.00043117034,0.0012139649,0.000144826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030745235,0.00082231587,0.00092942076,0.0018885756,0.00068055274,0.0017870833,0.0013902567,0.0008659971,0.0032659664],"category_scores_gemma":[0.00787214,0.00025067767,0.00049372524,0.0012412907,0.00046532636,0.001800794,0.0006174739,0.00067600195,0.0005831045],"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.0012336017,0.00061362295,0.0029164744,0.0006945001,0.00012865756,0.000092212875,0.00037849482,0.2610364,0.01433864,0.03514131,0.006160481,0.6772657],"study_design_scores_gemma":[0.000051106672,0.00047529928,0.0021563198,0.00007316261,0.000069257345,0.00013159917,0.0002108081,0.9748948,0.01102445,0.0041105645,0.006771174,0.000031420666],"about_ca_topic_score_codex":0.0014916622,"about_ca_topic_score_gemma":0.0009781631,"teacher_disagreement_score":0.0032659664,"about_ca_system_score_codex":0.0014785441,"about_ca_system_score_gemma":0.000921899,"threshold_uncertainty_score":0.01625985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014466773,0.00024117104,0.98807037,0.0006253959,0.0001136737,0.000091637514,0.000022553233,0.00070043426,0.008688098],"genre_scores_gemma":[0.09492506,0.0009065782,0.8919416,0.0004895966,0.0002545758,0.0005370263,0.00012314555,0.00028764995,0.010534846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968561,0.0010755771,0.00017144969,0.0003975975,0.0012352291,0.00026389994],"domain_scores_gemma":[0.99838436,0.00038322562,0.00015129868,0.0006800968,0.00021313877,0.00018784494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038327181,0.0009300679,0.00070581207,0.0014683547,0.0018941036,0.0067097843,0.0042874427,0.0019686925,0.005650095],"category_scores_gemma":[0.0056930017,0.00088256603,0.0007879527,0.00092818623,0.0045177033,0.00923467,0.0064641754,0.0042115585,0.0017612493],"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.000048966154,0.000036661888,0.00022995226,0.000088187255,0.000017320015,0.00015532233,0.0004113307,0.015337493,0.002858818,0.9057661,0.004335795,0.07071401],"study_design_scores_gemma":[0.000042002775,0.00015384563,0.00014212284,0.00013633192,0.000028839164,0.0005478636,0.00028056157,0.2076427,0.0049798563,0.53289264,0.2530985,0.000054721848],"about_ca_topic_score_codex":0.0011231268,"about_ca_topic_score_gemma":0.0015891963,"teacher_disagreement_score":0.0067097843,"about_ca_system_score_codex":0.0016520175,"about_ca_system_score_gemma":0.0018838323,"threshold_uncertainty_score":0.020269573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015771322,0.01079595,0.8961172,0.0012499203,0.0009463994,0.00019317235,0.00013729582,0.003368316,0.071420416],"genre_scores_gemma":[0.34531742,0.009665324,0.59930444,0.0005658307,0.0006081479,0.0003783761,0.000445297,0.00037716742,0.043338023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995679,0.000075060045,0.000032934153,0.00003836113,0.0002462246,0.000039576353],"domain_scores_gemma":[0.99954957,0.00009588867,0.000047543046,0.00010185476,0.00018454932,0.000020495567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031553526,0.00053639605,0.00022406019,0.0008342953,0.00058400416,0.0015954974,0.0010493186,0.0007108224,0.008067607],"category_scores_gemma":[0.0006733512,0.0003220141,0.00028218093,0.0008613003,0.0006243634,0.0013738779,0.00061512296,0.0012879965,0.0027758991],"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.00019128746,0.00009407497,0.0005517315,0.00085264014,0.00007025693,0.00033142048,0.0002631441,0.039067775,0.085820064,0.61771065,0.016630339,0.23841664],"study_design_scores_gemma":[0.00011560066,0.0005613426,0.000727947,0.00033665943,0.00011612142,0.0011216151,0.00013143469,0.2135331,0.08766607,0.11852926,0.57707345,0.00008736155],"about_ca_topic_score_codex":0.0007188353,"about_ca_topic_score_gemma":0.00091298815,"teacher_disagreement_score":0.008067607,"about_ca_system_score_codex":0.0007651661,"about_ca_system_score_gemma":0.00045986185,"threshold_uncertainty_score":0.026988864},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032907426,0.03709319,0.3624778,0.021194056,0.0103590675,0.0005829669,0.001239448,0.0027023114,0.5314438],"genre_scores_gemma":[0.43820938,0.07187752,0.21357886,0.012928761,0.007575269,0.0008397454,0.003368721,0.00065371935,0.250968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921393,0.00013667248,0.000054969623,0.00008671159,0.00037846947,0.00012928715],"domain_scores_gemma":[0.99928313,0.000099278666,0.00007310534,0.00010155809,0.00034432134,0.00009866383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261412,0.00041310594,0.00027209937,0.0006665715,0.0010606778,0.0027921998,0.0011350136,0.0013687628,0.008540664],"category_scores_gemma":[0.0017356236,0.00016343946,0.00031435673,0.0011555033,0.00071270874,0.0036758936,0.0010980881,0.001093435,0.0024775844],"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.00014686742,0.00004931773,0.0008179101,0.00035350063,0.00002221443,0.00033950998,0.00019114446,0.0039405786,0.004410115,0.57465214,0.085299626,0.32977715],"study_design_scores_gemma":[0.000016732563,0.00006017295,0.000341476,0.00011808209,0.000017806355,0.00045240574,0.000092391674,0.004749043,0.0024699655,0.07394772,0.9177128,0.000021363794],"about_ca_topic_score_codex":0.0019790751,"about_ca_topic_score_gemma":0.0014258003,"teacher_disagreement_score":0.008540664,"about_ca_system_score_codex":0.0013125151,"about_ca_system_score_gemma":0.0015665196,"threshold_uncertainty_score":0.028571367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059570298,0.00037089112,0.9271644,0.00013330654,0.000033894386,0.0001147131,0.000066615234,0.0005589199,0.0119868675],"genre_scores_gemma":[0.8289421,0.00047351542,0.16624644,0.000081629194,0.00004286397,0.00024815983,0.00014239481,0.00014339383,0.0036794255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00011407433,0.000012449998,0.000040940926,0.00023973125,0.00010496219],"domain_scores_gemma":[0.999585,0.00016873247,0.00007403077,0.00003696084,0.00011009787,0.000025203564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056960434,0.0006893635,0.00036861916,0.00034168555,0.00035806114,0.00055941177,0.0007472656,0.0002763117,0.0017222867],"category_scores_gemma":[0.0010847967,0.00031684537,0.00029028425,0.00026464855,0.00034097375,0.0003067413,0.00024574008,0.00046897854,0.00031592807],"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.00013049488,0.00006291993,0.00053755817,0.00008266166,0.00003760723,0.000036883637,0.000056799956,0.9045664,0.02420678,0.026360327,0.0011210648,0.042800482],"study_design_scores_gemma":[0.000015648657,0.000057763897,0.00010197086,0.000004457716,0.000017778275,0.00001385551,0.000005660989,0.98957497,0.0053914245,0.002924575,0.0018869676,0.0000048555567],"about_ca_topic_score_codex":0.003796605,"about_ca_topic_score_gemma":0.0034476914,"teacher_disagreement_score":0.003796605,"about_ca_system_score_codex":0.0010975981,"about_ca_system_score_gemma":0.0010728315,"threshold_uncertainty_score":0.007963717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059671693,0.0022148713,0.90352285,0.0048577283,0.00012491453,0.0003560371,0.00050074665,0.00025597063,0.02849519],"genre_scores_gemma":[0.62280566,0.005031099,0.3640263,0.0005651007,0.00066880207,0.0006217839,0.0008216201,0.00016568991,0.0052939653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969753,0.00095439993,0.00031172668,0.00034000707,0.001165512,0.00025298595],"domain_scores_gemma":[0.9951918,0.001693301,0.00096550694,0.0005325563,0.0013271127,0.0002898086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004447516,0.0011637615,0.0009326524,0.004735989,0.0008892184,0.0067111896,0.001719748,0.0016657353,0.0017930347],"category_scores_gemma":[0.010067831,0.00042058664,0.0007217684,0.0032887424,0.0025915375,0.015092468,0.0018102007,0.0023341118,0.00044287363],"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.000074710704,0.00023776686,0.011560397,0.00028297567,0.000052210475,0.00012346127,0.0009086238,0.039191768,0.0016184103,0.815082,0.0038586615,0.1270089],"study_design_scores_gemma":[0.00002000991,0.000121966405,0.00615207,0.00018459036,0.00003804097,0.0002168523,0.0009198372,0.30462155,0.001298805,0.66422254,0.022135494,0.00006815126],"about_ca_topic_score_codex":0.0015549377,"about_ca_topic_score_gemma":0.0010145714,"teacher_disagreement_score":0.0067111896,"about_ca_system_score_codex":0.0017640239,"about_ca_system_score_gemma":0.00086539367,"threshold_uncertainty_score":0.023521006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052607972,0.00024126036,0.9448884,0.00013337786,0.000021375696,0.000041265135,0.000020645157,0.00019174108,0.0018538816],"genre_scores_gemma":[0.65891033,0.00027145763,0.33896565,0.000078825135,0.000023578876,0.00015052228,0.000069134905,0.000034652956,0.0014958068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997209,0.00012036747,0.000010171286,0.000034793342,0.00007958338,0.000034209363],"domain_scores_gemma":[0.999642,0.00022098323,0.000045984285,0.00002713632,0.000048009835,0.000015879474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052546634,0.00042990173,0.00054402114,0.00048153265,0.00034959603,0.00048690985,0.00071114424,0.00077138917,0.0004881907],"category_scores_gemma":[0.001550201,0.00022955266,0.0004148809,0.0004990696,0.00037164043,0.00049356313,0.00042287516,0.000433417,0.00006193061],"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.000025434425,0.000022668537,0.00036579723,0.000017118029,0.000026846486,0.00004094014,0.00003339704,0.95913136,0.0028909997,0.008174176,0.00027465643,0.028996564],"study_design_scores_gemma":[0.000009966895,0.000023927405,0.00008416192,0.0000035938867,0.000007482807,0.000020499616,0.00000547936,0.9949903,0.000698029,0.0036045297,0.0005475748,0.000004446547],"about_ca_topic_score_codex":0.0047623883,"about_ca_topic_score_gemma":0.0026143282,"teacher_disagreement_score":0.0047623883,"about_ca_system_score_codex":0.0007932236,"about_ca_system_score_gemma":0.0006999596,"threshold_uncertainty_score":0.00946933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14545071,0.058525674,0.7112159,0.006309056,0.0019805806,0.00030398878,0.0005988272,0.0011821523,0.0744332],"genre_scores_gemma":[0.90198725,0.0168476,0.068889,0.00062668376,0.001367265,0.00020202443,0.00039767034,0.00015643818,0.009525998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980872,0.00058936665,0.000067332534,0.00023731201,0.000755556,0.00026321405],"domain_scores_gemma":[0.99776125,0.0010899192,0.00034366385,0.00024669,0.0004550649,0.000103400664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025785828,0.00057691766,0.00074479193,0.0011090038,0.00071893184,0.0027043098,0.00093676464,0.0011731214,0.0024028977],"category_scores_gemma":[0.008401779,0.0003497859,0.00044262438,0.0023371198,0.0014672198,0.001950458,0.000790489,0.0011063869,0.0008728952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036527406,0.00016158639,0.0040487116,0.00028153334,0.000058711597,0.00029271067,0.0003008877,0.2431121,0.006089823,0.55576646,0.007877634,0.18164463],"study_design_scores_gemma":[0.000058018235,0.00029320124,0.0071643093,0.000106256506,0.000072682524,0.00042083758,0.00016425907,0.5421135,0.002106739,0.4080043,0.039414387,0.00008145089],"about_ca_topic_score_codex":0.0040239915,"about_ca_topic_score_gemma":0.0012584572,"teacher_disagreement_score":0.0040239915,"about_ca_system_score_codex":0.00236393,"about_ca_system_score_gemma":0.0011320226,"threshold_uncertainty_score":0.017151654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47197336,0.00029413993,0.5238669,0.0002058659,0.000047579306,0.00003089659,0.000034819655,0.0013912405,0.002155153],"genre_scores_gemma":[0.9773467,0.00006562877,0.022007836,0.000018818404,0.000014904709,0.000009609685,0.000020528658,0.0000132133055,0.0005027366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.00006124089,0.000007725447,0.000027321781,0.000053155174,0.000018751269],"domain_scores_gemma":[0.99951065,0.0002684591,0.00006970338,0.000045352444,0.00008731681,0.000018541668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050793716,0.00031045388,0.00021870971,0.0003076979,0.00020949583,0.00033204159,0.00045487907,0.0003590346,0.00038288714],"category_scores_gemma":[0.0016033287,0.00013969294,0.00015166945,0.00016727207,0.00031930677,0.0005290661,0.00014711074,0.00030958463,0.00012303764],"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.00056042196,0.00020236467,0.0052742385,0.00007473896,0.000059530405,0.00018632149,0.00018125032,0.59569436,0.14380178,0.0050983783,0.00083940965,0.2480272],"study_design_scores_gemma":[0.000011332648,0.00008605114,0.00070849387,0.0000032108646,0.000010796448,0.000024782776,0.000011049221,0.9845681,0.013553901,0.0006836436,0.000331174,0.0000074455397],"about_ca_topic_score_codex":0.0025370994,"about_ca_topic_score_gemma":0.0035943557,"teacher_disagreement_score":0.0025370994,"about_ca_system_score_codex":0.00032388823,"about_ca_system_score_gemma":0.0002883218,"threshold_uncertainty_score":0.0050445795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16208927,0.00078428315,0.79108983,0.0003602057,0.00032876583,0.00038374538,0.00032536042,0.021074887,0.023563687],"genre_scores_gemma":[0.71816397,0.00025482167,0.2751624,0.00019751191,0.000046871468,0.00013154294,0.00022228727,0.00015537435,0.0056652348],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999637,0.000073588206,0.000028181694,0.000058998317,0.000096610114,0.000105597894],"domain_scores_gemma":[0.99966836,0.00009183309,0.000043640208,0.000075524425,0.000089935085,0.000030760584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005461942,0.00052781636,0.000317421,0.00052182854,0.00039543587,0.0009085654,0.0013252597,0.00035804563,0.0048078354],"category_scores_gemma":[0.0008082526,0.00024429243,0.00024640266,0.00055170513,0.0003589102,0.00081872236,0.0002844816,0.00048585163,0.0008877715],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020930318,0.0004981053,0.007560832,0.0008057941,0.00015387483,0.00083843875,0.00048010165,0.23435391,0.08909151,0.05853629,0.024394855,0.58119327],"study_design_scores_gemma":[0.0003400948,0.0009346441,0.0022471875,0.00009210875,0.000102052094,0.00049451797,0.00013155685,0.8052794,0.118347764,0.011157034,0.060784366,0.000089367284],"about_ca_topic_score_codex":0.0072714845,"about_ca_topic_score_gemma":0.0053264294,"teacher_disagreement_score":0.0072714845,"about_ca_system_score_codex":0.0011814327,"about_ca_system_score_gemma":0.0010831971,"threshold_uncertainty_score":0.016083777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36518684,0.00020515632,0.6329511,0.000070685164,0.0000113290025,0.000021110813,0.000052825453,0.00022808356,0.0012729119],"genre_scores_gemma":[0.94610864,0.00010445963,0.053024627,0.0000135462715,0.000008008589,0.000025053268,0.00007238599,0.000022116643,0.00062111777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00013240408,0.000034003762,0.00006451992,0.0002621786,0.00007860432],"domain_scores_gemma":[0.9973425,0.0016459525,0.0003825848,0.00015749976,0.00038987174,0.00008162451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012761756,0.00024762613,0.0003896358,0.00094439765,0.00024365832,0.00063824485,0.00056737324,0.00046888954,0.0006782199],"category_scores_gemma":[0.005851475,0.00016596456,0.00021721238,0.00035321424,0.00035736783,0.00093436457,0.00044659135,0.00028037344,0.00014718271],"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.0004553233,0.000060654846,0.0075829416,0.0000840656,0.00003675431,0.000306509,0.00018452846,0.8816818,0.02191218,0.023272589,0.00041845857,0.06400425],"study_design_scores_gemma":[0.0000045315355,0.00003301257,0.0009814955,0.0000034669085,0.00000512502,0.000075634074,0.000012245161,0.99471104,0.0019658993,0.002085254,0.00011722905,0.00000512479],"about_ca_topic_score_codex":0.0009022463,"about_ca_topic_score_gemma":0.0005082461,"teacher_disagreement_score":0.0012761756,"about_ca_system_score_codex":0.000577095,"about_ca_system_score_gemma":0.00030038887,"threshold_uncertainty_score":0.006749153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92205477,0.0013605456,0.06720983,0.00051495805,0.000099216035,0.0002142108,0.0006504823,0.0016303799,0.006265661],"genre_scores_gemma":[0.9843152,0.0001743633,0.014524686,0.000071390394,0.000027835515,0.00005286546,0.00034353268,0.00004878888,0.00044133633],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9944911,0.0013319955,0.0003675256,0.0008446593,0.0024567768,0.0005080247],"domain_scores_gemma":[0.9791309,0.008769426,0.0030908512,0.0028643198,0.00525351,0.00089089887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004399225,0.0009136804,0.0006957415,0.0017094511,0.0006254587,0.0008478044,0.0021309392,0.00079481676,0.00054848235],"category_scores_gemma":[0.01589326,0.0004545427,0.00026564204,0.0022697635,0.0006266727,0.0023937935,0.00070896506,0.0013652783,0.00033823407],"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.0035245006,0.0047377883,0.13353439,0.0012350009,0.0004710769,0.0007081447,0.002372318,0.23037739,0.19204636,0.028160289,0.009104822,0.39372796],"study_design_scores_gemma":[0.00015470071,0.0043521263,0.05760596,0.000048445647,0.0000817368,0.0011220084,0.0006815776,0.865291,0.058770988,0.004292839,0.007461262,0.00013732584],"about_ca_topic_score_codex":0.0055174623,"about_ca_topic_score_gemma":0.002831719,"teacher_disagreement_score":0.0055174623,"about_ca_system_score_codex":0.0019940208,"about_ca_system_score_gemma":0.0009115792,"threshold_uncertainty_score":0.0232656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9020299,0.0012148647,0.085398555,0.00030613178,0.00012837922,0.0001740755,0.00035173038,0.002766347,0.0076299785],"genre_scores_gemma":[0.97516394,0.00028024905,0.022896668,0.000048126138,0.000029487821,0.000051905463,0.0003016749,0.000056866913,0.0011710506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880195,0.00025888594,0.00006517762,0.00018685753,0.0004890867,0.0001980181],"domain_scores_gemma":[0.9948415,0.0018736778,0.00033687046,0.0005707238,0.0019955814,0.00038161996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403664,0.0005043994,0.00059892045,0.0021090675,0.0006742149,0.0012115921,0.00074050244,0.0007233784,0.0025828076],"category_scores_gemma":[0.009859654,0.00016488171,0.0002576716,0.001629751,0.00035887535,0.0016951326,0.0008983185,0.0003643616,0.00048770162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009965603,0.0011440411,0.035783622,0.00045832395,0.00026746167,0.00037070393,0.0006366333,0.20595476,0.052926693,0.016391851,0.0065525994,0.6695477],"study_design_scores_gemma":[0.00011628802,0.001256699,0.0068671377,0.00004344446,0.000050543884,0.00029404362,0.00017955303,0.969729,0.016074276,0.0030483434,0.002284904,0.000055720946],"about_ca_topic_score_codex":0.0037422297,"about_ca_topic_score_gemma":0.0028918034,"teacher_disagreement_score":0.0037422297,"about_ca_system_score_codex":0.0012811829,"about_ca_system_score_gemma":0.00076680153,"threshold_uncertainty_score":0.009732902},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015549945,0.041354787,0.9131509,0.0016315795,0.0006374823,0.00022261724,0.0010910692,0.0024761946,0.023885408],"genre_scores_gemma":[0.38933966,0.13923919,0.4539014,0.0007523749,0.0019049213,0.0011441503,0.0032465234,0.0009498581,0.009521948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974069,0.0007549013,0.00023406323,0.00020798726,0.0012436039,0.0001524552],"domain_scores_gemma":[0.99182445,0.004625596,0.0006338386,0.00083900976,0.0019523288,0.00012481428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003801295,0.001402097,0.0013441881,0.0040693916,0.0007412085,0.002735935,0.0032931594,0.0014970789,0.0022299425],"category_scores_gemma":[0.017397579,0.00071604265,0.0013026964,0.0045115226,0.00049765967,0.003626124,0.0011729823,0.0017805032,0.00096022803],"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.00024306665,0.00022531224,0.002796733,0.0013679333,0.00017169015,0.00019464544,0.00021737505,0.5918122,0.002344305,0.14076883,0.0121801365,0.24767767],"study_design_scores_gemma":[0.000024376739,0.00013696423,0.00088908273,0.0004600384,0.00014794542,0.00025582916,0.000098670826,0.9034276,0.002501187,0.046969783,0.04502376,0.00006479772],"about_ca_topic_score_codex":0.004679752,"about_ca_topic_score_gemma":0.001723599,"teacher_disagreement_score":0.004679752,"about_ca_system_score_codex":0.0021093807,"about_ca_system_score_gemma":0.0016299628,"threshold_uncertainty_score":0.020103455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96427464,0.0002739511,0.031477638,0.00021623487,0.00002543248,0.00009396823,0.00019627929,0.00018373855,0.0032581934],"genre_scores_gemma":[0.9946137,0.0001215601,0.0048132823,0.000023752591,0.000005902595,0.000044577206,0.000093501876,0.000008715637,0.00027496569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.0003017813,0.000041853273,0.000054329885,0.00018285676,0.00014723772],"domain_scores_gemma":[0.987135,0.010169087,0.0007994618,0.00051043055,0.001114008,0.00027195376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019936431,0.00059386686,0.00067718845,0.000836653,0.00041223085,0.00051387126,0.000939285,0.0010610218,0.00089697173],"category_scores_gemma":[0.007110163,0.00024123256,0.00043232657,0.0010656158,0.000724252,0.00079017953,0.00051108125,0.0008441476,0.00008583106],"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.00013734355,0.00022091619,0.0040964186,0.000040306484,0.000033144966,0.000106811895,0.00004793201,0.9886395,0.0011686668,0.0024338854,0.00027303922,0.0028021373],"study_design_scores_gemma":[0.000011646352,0.00005699762,0.00028806215,0.0000026879782,0.0000061995515,0.000018894341,0.000015248647,0.99862003,0.0006088031,0.0003213222,0.00004589839,0.0000042520683],"about_ca_topic_score_codex":0.007853399,"about_ca_topic_score_gemma":0.0047169025,"teacher_disagreement_score":0.007853399,"about_ca_system_score_codex":0.0010315626,"about_ca_system_score_gemma":0.0006235502,"threshold_uncertainty_score":0.015615344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09427769,0.01385374,0.8088445,0.014240311,0.0006617205,0.00011099138,0.00021791279,0.0016477755,0.06614537],"genre_scores_gemma":[0.913552,0.005690841,0.07311402,0.00061240327,0.0016282832,0.00017500219,0.0001208873,0.000179856,0.0049266657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782217,0.0005252106,0.00011775259,0.00016861169,0.0011142645,0.00025196729],"domain_scores_gemma":[0.9941738,0.0039586793,0.00047721606,0.0005058865,0.0006234848,0.00026085894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026009441,0.0007170126,0.0006071337,0.00070625043,0.0009285392,0.0023241143,0.0011931423,0.000952606,0.002420034],"category_scores_gemma":[0.0105005745,0.0003431853,0.00025888608,0.0011774158,0.0020624285,0.0069990386,0.0020554282,0.001935508,0.00036325038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020818226,0.00007071516,0.0013319072,0.00043958973,0.000034901608,0.00042161276,0.00051353296,0.10343589,0.011795548,0.7546856,0.008307651,0.11875491],"study_design_scores_gemma":[0.000059207094,0.00014116673,0.0009232015,0.00010579879,0.00003549583,0.00039125985,0.00022625634,0.35324985,0.005644885,0.60941774,0.029767618,0.00003748635],"about_ca_topic_score_codex":0.001166903,"about_ca_topic_score_gemma":0.00061498344,"teacher_disagreement_score":0.0026009441,"about_ca_system_score_codex":0.0013431445,"about_ca_system_score_gemma":0.0010949678,"threshold_uncertainty_score":0.013755262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074584964,0.0002628715,0.9874649,0.00028309514,0.00011993567,0.00015354276,0.00025259552,0.0009898554,0.0030147338],"genre_scores_gemma":[0.16803846,0.00038692867,0.824343,0.00015227425,0.00009930433,0.00032643558,0.0011276343,0.00013821256,0.005387708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.00014608914,0.000047909165,0.00013463305,0.0002539042,0.00007757537],"domain_scores_gemma":[0.99936026,0.00020511795,0.0000453374,0.00010158909,0.00023897139,0.000048641974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005638602,0.0007139416,0.001111781,0.0009466305,0.00095639506,0.0009612902,0.0018286784,0.0011622516,0.0040237256],"category_scores_gemma":[0.0020185604,0.00039178308,0.00063261756,0.0014608796,0.00030448553,0.0015460309,0.0014941393,0.00090025156,0.0014342825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002778,0.00019848305,0.0010640594,0.0002790517,0.00012790474,0.00023072628,0.00015412609,0.40630955,0.010852274,0.04672005,0.02306559,0.5107204],"study_design_scores_gemma":[0.00009459999,0.00008434369,0.00015909606,0.00001393164,0.00003107539,0.00021790383,0.000036228674,0.9592247,0.0030287446,0.022711698,0.014374901,0.000022724445],"about_ca_topic_score_codex":0.0014538338,"about_ca_topic_score_gemma":0.0017972351,"teacher_disagreement_score":0.0040237256,"about_ca_system_score_codex":0.000578493,"about_ca_system_score_gemma":0.002106961,"threshold_uncertainty_score":0.013460696},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013053967,0.0032351601,0.00021007296,0.022603773,0.97236824,0.000019518895,0.000051718176,0.00005927347,0.0013217542],"genre_scores_gemma":[0.0010522297,0.0023658928,0.00010495702,0.0073639974,0.9826027,0.000017609533,0.000034789853,0.000034648703,0.006423247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997479,0.00033286161,0.00031717107,0.0004983374,0.0010887177,0.00028393316],"domain_scores_gemma":[0.9843098,0.0039701345,0.0013263187,0.00054126524,0.0072327964,0.0026197752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003649902,0.004771668,0.004832569,0.004321316,0.002391375,0.0069109397,0.0036437998,0.01591421,0.013516073],"category_scores_gemma":[0.015864618,0.0016352992,0.002698869,0.0017224672,0.0017793594,0.003194874,0.0012381863,0.016355915,0.0094682425],"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.00008216446,0.000048789214,0.00009220403,0.00021800656,0.000036667767,0.00029095903,0.0000074595896,0.00007441439,0.0001366809,0.00038410895,0.9924045,0.0062240427],"study_design_scores_gemma":[0.00020072819,0.000115733004,0.001459391,0.00031492123,0.00021886535,0.00092330476,0.000041616586,0.0013181476,0.00048266762,0.0016887565,0.9931946,0.000041322975],"about_ca_topic_score_codex":0.0008190325,"about_ca_topic_score_gemma":0.0017881622,"teacher_disagreement_score":0.01591421,"about_ca_system_score_codex":0.0023808912,"about_ca_system_score_gemma":0.0012544685,"threshold_uncertainty_score":0.045215726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95418257,0.00051995757,0.042990975,0.000097760225,0.000026725216,0.00004025547,0.000016189812,0.000857849,0.0012677667],"genre_scores_gemma":[0.9934378,0.00009692805,0.006255753,0.000011632647,0.0000072118137,0.00000947131,0.000015151776,0.000020667327,0.00014526624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.0004660514,0.0000576523,0.000050286388,0.0002007297,0.00011799109],"domain_scores_gemma":[0.99419034,0.0039605354,0.0004639681,0.0005795077,0.0006752592,0.00013031905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010677,0.00060646515,0.00051129714,0.0004575407,0.00042348047,0.00075210835,0.00085672067,0.00058955816,0.00035525215],"category_scores_gemma":[0.009749381,0.00024029368,0.00023506994,0.00034194198,0.0005075519,0.0012436439,0.00045353553,0.00058172917,0.00011641527],"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.0014369137,0.00046760464,0.013486782,0.0001892166,0.00019155003,0.00040163076,0.00030440153,0.8352496,0.08486846,0.0030469156,0.0006657789,0.05969114],"study_design_scores_gemma":[0.000048134276,0.00035996453,0.0015025969,0.000008403157,0.0000528058,0.00006595559,0.000020149955,0.9731742,0.024007607,0.0004938171,0.00025011736,0.000016144857],"about_ca_topic_score_codex":0.0012823512,"about_ca_topic_score_gemma":0.0012971812,"teacher_disagreement_score":0.002010677,"about_ca_system_score_codex":0.00045451106,"about_ca_system_score_gemma":0.000353171,"threshold_uncertainty_score":0.010633588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47477967,0.0004255746,0.521559,0.00019296125,0.00008217716,0.00008798038,0.000031179723,0.0010894729,0.0017519881],"genre_scores_gemma":[0.9554035,0.00005980917,0.04389969,0.00004501606,0.00002654193,0.000014551351,0.000014561041,0.00002257957,0.0005137621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998382,0.00059103355,0.00007567307,0.00027423823,0.0003343377,0.00034276675],"domain_scores_gemma":[0.9929073,0.0040732124,0.0007538123,0.00094696163,0.0009784279,0.00034025335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039503663,0.00091904134,0.0009492058,0.000633583,0.000691913,0.0011596582,0.00213041,0.0005952292,0.0006562984],"category_scores_gemma":[0.008931529,0.00037334155,0.0003145597,0.0003981778,0.0006657826,0.0017786454,0.001491802,0.0008508453,0.00020462686],"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.004603782,0.0010255619,0.013411401,0.0002695312,0.0003391668,0.00035664643,0.0007497064,0.58641523,0.100269705,0.027698092,0.0022178032,0.26264334],"study_design_scores_gemma":[0.00004707457,0.00032817008,0.0006024812,0.0000061085316,0.00004746469,0.00006320515,0.000034398738,0.9837419,0.013765691,0.001092943,0.00025347027,0.000017058665],"about_ca_topic_score_codex":0.0018648889,"about_ca_topic_score_gemma":0.0025051797,"teacher_disagreement_score":0.0039503663,"about_ca_system_score_codex":0.0011359222,"about_ca_system_score_gemma":0.0011337812,"threshold_uncertainty_score":0.020891845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043449686,0.076881975,0.7160515,0.010519434,0.013251003,0.0007546414,0.0011155941,0.0038692097,0.17321168],"genre_scores_gemma":[0.0900795,0.07008234,0.66958076,0.004541433,0.010660923,0.0014671959,0.0022869299,0.0007778846,0.15052311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992543,0.00016539333,0.000052572894,0.00010328761,0.00037240412,0.000052122392],"domain_scores_gemma":[0.9995436,0.00013131561,0.000050079103,0.00007739549,0.00014468125,0.00005295419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069095066,0.0011708997,0.00062496413,0.0010316009,0.00094163755,0.0017783721,0.0018040523,0.0016495688,0.0158596],"category_scores_gemma":[0.0013213035,0.0003311438,0.00036362628,0.0018083776,0.0012724143,0.0026383721,0.001081656,0.002400553,0.010910969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071935145,0.00006617768,0.00013342034,0.00092471216,0.000036695914,0.0007182104,0.0002321642,0.0068727396,0.011233791,0.6721657,0.09978061,0.20776379],"study_design_scores_gemma":[0.00002747349,0.00006506874,0.00014191259,0.00014114406,0.000020184132,0.0007587758,0.00003996409,0.011509428,0.002201031,0.17633905,0.8087256,0.000030316387],"about_ca_topic_score_codex":0.00052818,"about_ca_topic_score_gemma":0.0007403261,"teacher_disagreement_score":0.0158596,"about_ca_system_score_codex":0.0008127429,"about_ca_system_score_gemma":0.0008344527,"threshold_uncertainty_score":0.053055644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069054896,0.0009257267,0.9824373,0.00050068507,0.00013714633,0.000056212535,0.00015342735,0.0000520645,0.008831978],"genre_scores_gemma":[0.48630837,0.005028486,0.47531095,0.0006701611,0.00095173094,0.0007287841,0.00066624396,0.0003026818,0.030032575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.00026410542,0.000027795042,0.00008681634,0.00018290611,0.00009113679],"domain_scores_gemma":[0.99950063,0.00024823376,0.00004769798,0.000041026145,0.00012742044,0.0000351173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015433443,0.0008937491,0.0012645262,0.0007043718,0.0005030056,0.0018779384,0.0016755875,0.0016835108,0.0040970994],"category_scores_gemma":[0.0028279799,0.0005532275,0.00082916085,0.0013546977,0.00056086254,0.0026886873,0.001428411,0.0016216834,0.0005330317],"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.0000306175,0.00005122261,0.00016755778,0.00012998054,0.000031466425,0.000088648674,0.00006272969,0.7807672,0.0010180805,0.19319683,0.0042012297,0.020254401],"study_design_scores_gemma":[0.000006585629,0.000018268813,0.000062716244,0.000013597401,0.000008816488,0.000022970062,0.000021173326,0.9705758,0.00011728912,0.02681367,0.002333508,0.000005554558],"about_ca_topic_score_codex":0.0031462829,"about_ca_topic_score_gemma":0.0043994007,"teacher_disagreement_score":0.0040970994,"about_ca_system_score_codex":0.0013116241,"about_ca_system_score_gemma":0.0015520413,"threshold_uncertainty_score":0.013706207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9046222,0.0003129355,0.09322413,0.000072940915,0.000026725509,0.0002497615,0.00006606097,0.00013714664,0.0012880441],"genre_scores_gemma":[0.95678777,0.00022306756,0.042319097,0.000029548566,0.000015283656,0.00024252699,0.000035459292,0.000015035114,0.0003323068],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979352,0.0010688086,0.00010970461,0.0001720801,0.0005544303,0.00015981989],"domain_scores_gemma":[0.99637645,0.0023079591,0.00055131206,0.0003178337,0.0002920614,0.00015425144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022273096,0.00057323434,0.00056991825,0.0003080149,0.00055510754,0.0009527562,0.0005276104,0.0005205771,0.0005648868],"category_scores_gemma":[0.0060353125,0.00033002434,0.0002923434,0.000495501,0.00060043164,0.000635444,0.0004667326,0.00041900275,0.000088404784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062321154,0.0022322435,0.013653009,0.0009109656,0.00022666687,0.0004528384,0.0010838544,0.17249657,0.6652788,0.022726165,0.00063175167,0.11407503],"study_design_scores_gemma":[0.0005246059,0.017383015,0.019299246,0.00008429918,0.00040200152,0.00032426996,0.00029286352,0.6045052,0.3356746,0.017151194,0.004200359,0.00015833043],"about_ca_topic_score_codex":0.000850873,"about_ca_topic_score_gemma":0.00070608355,"teacher_disagreement_score":0.0022273096,"about_ca_system_score_codex":0.00073147827,"about_ca_system_score_gemma":0.00061156263,"threshold_uncertainty_score":0.011779249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023852102,0.0019605905,0.9691459,0.00031755917,0.00015910222,0.00004556334,0.00002981058,0.00021592407,0.0042734356],"genre_scores_gemma":[0.73237115,0.003959819,0.26085705,0.00034351918,0.00036337881,0.0001390964,0.00005639159,0.000089183486,0.0018204054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991848,0.00021286683,0.000045496356,0.000087444314,0.0003924761,0.000076938966],"domain_scores_gemma":[0.9979122,0.0012338221,0.0002061653,0.00026847387,0.00032027668,0.000059047812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018775727,0.0008900923,0.00052598154,0.000832593,0.00037944244,0.001244714,0.0014814311,0.00070317695,0.00062350923],"category_scores_gemma":[0.006350631,0.00031600308,0.00032888795,0.00072104036,0.001496426,0.0031129818,0.0009338724,0.0016718117,0.00016565261],"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.00012598812,0.000101786485,0.0011605241,0.00025668778,0.00006777533,0.0002273771,0.0002172082,0.27107278,0.0372088,0.5138287,0.00096833694,0.1747641],"study_design_scores_gemma":[0.000018861676,0.00013685106,0.00041235052,0.000038660073,0.000038124424,0.00021693837,0.00003051493,0.7567371,0.01708013,0.21293575,0.012314928,0.000039836792],"about_ca_topic_score_codex":0.00078460015,"about_ca_topic_score_gemma":0.00039021941,"teacher_disagreement_score":0.0018775727,"about_ca_system_score_codex":0.00068692316,"about_ca_system_score_gemma":0.00058539567,"threshold_uncertainty_score":0.009929717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05044868,0.0040937793,0.92307955,0.00092115486,0.00048544316,0.00020757009,0.00002979116,0.0009926892,0.01974143],"genre_scores_gemma":[0.94731,0.0016268331,0.046004258,0.00012447877,0.000507754,0.00015558275,0.000041292962,0.000049773585,0.0041800714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845433,0.00040579945,0.00006114916,0.00014170284,0.00074597594,0.00019101036],"domain_scores_gemma":[0.998004,0.0010794648,0.00019044994,0.00015814594,0.00046747693,0.00010051456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737318,0.0005677728,0.00060254504,0.0008272952,0.0011698846,0.0013907526,0.0012669137,0.00067362085,0.002325969],"category_scores_gemma":[0.0053430684,0.00018971977,0.00026612903,0.00091566,0.0011583643,0.0012387395,0.0008062007,0.0017101291,0.0003434324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035119578,0.00024748268,0.0017648197,0.00020123844,0.000083793355,0.0002884043,0.00036795315,0.36109623,0.01829252,0.2232049,0.008789464,0.38531187],"study_design_scores_gemma":[0.000031832926,0.00008711353,0.00040271823,0.000019152332,0.000027598724,0.00011022762,0.000030414469,0.96500975,0.0032738575,0.023466054,0.007520478,0.000020888036],"about_ca_topic_score_codex":0.004940955,"about_ca_topic_score_gemma":0.0025970528,"teacher_disagreement_score":0.004940955,"about_ca_system_score_codex":0.001728895,"about_ca_system_score_gemma":0.001171693,"threshold_uncertainty_score":0.012544036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21122357,0.0019066881,0.7717355,0.0006423892,0.00041766078,0.00030936106,0.000120217934,0.00892617,0.004718489],"genre_scores_gemma":[0.8871564,0.0003950518,0.109214954,0.00031557036,0.00016924577,0.00011303052,0.00007391524,0.00012015821,0.0024416873],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.00007074901,0.000042054864,0.00009680071,0.00015431047,0.00006050682],"domain_scores_gemma":[0.9983236,0.00045318136,0.00031103034,0.00043465805,0.00034615348,0.00013140196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012115043,0.00056669314,0.00034971253,0.00086690317,0.0006029521,0.00090878794,0.0020670295,0.0006270321,0.0010462616],"category_scores_gemma":[0.0036190832,0.0003517562,0.00021436714,0.000470335,0.00052244414,0.0018572058,0.00092249736,0.0009383788,0.00028861524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010957986,0.001151869,0.004345044,0.00035301145,0.00013263723,0.00041300277,0.00060703943,0.03287929,0.46357396,0.026237577,0.0061243484,0.46308643],"study_design_scores_gemma":[0.00044648934,0.0015943915,0.0054486706,0.000065159045,0.0003429231,0.0012539988,0.000097815035,0.6970529,0.26313505,0.012373408,0.017974332,0.0002148487],"about_ca_topic_score_codex":0.0006116267,"about_ca_topic_score_gemma":0.00076908624,"teacher_disagreement_score":0.0020670295,"about_ca_system_score_codex":0.00042816985,"about_ca_system_score_gemma":0.0006322306,"threshold_uncertainty_score":0.0064071417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7610108,0.0040216655,0.18154421,0.0019349767,0.00038942735,0.00020273635,0.0005322996,0.0066000707,0.04376377],"genre_scores_gemma":[0.99212533,0.00035152477,0.0058739586,0.000079621175,0.00012850764,0.000029546694,0.00022731724,0.000056332505,0.0011278096],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990951,0.00015323669,0.000042633495,0.000066708606,0.0004146051,0.00022779306],"domain_scores_gemma":[0.9970644,0.0010640845,0.00035528204,0.0002747485,0.0009849675,0.0002564599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011185836,0.00040331963,0.00036024628,0.0008246884,0.0005490436,0.0016446694,0.0011443186,0.0006147918,0.004603308],"category_scores_gemma":[0.006512258,0.00013435504,0.00012844898,0.0006744639,0.00030060002,0.0014015824,0.00086880475,0.00044941483,0.000640108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004489413,0.0008419219,0.018797008,0.0008148545,0.00013540844,0.0024648963,0.0013120036,0.1270038,0.13276398,0.09000307,0.022634784,0.5987389],"study_design_scores_gemma":[0.0007107224,0.0012829081,0.009648639,0.00017452317,0.00012839111,0.0012573615,0.000563224,0.84124875,0.040651444,0.04051217,0.0637188,0.00010303183],"about_ca_topic_score_codex":0.0013751934,"about_ca_topic_score_gemma":0.0006904148,"teacher_disagreement_score":0.004603308,"about_ca_system_score_codex":0.000644249,"about_ca_system_score_gemma":0.00043710164,"threshold_uncertainty_score":0.015399575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008383531,0.00078528357,0.9737378,0.0011529763,0.00026166972,0.00013035467,0.00016558148,0.00031580526,0.015067146],"genre_scores_gemma":[0.6543201,0.0027463948,0.29922956,0.00086538936,0.0005310944,0.0007129083,0.0004324286,0.00017721127,0.040984873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880123,0.0002486932,0.000058928304,0.00016806302,0.0005949545,0.00012813782],"domain_scores_gemma":[0.99940777,0.0001541403,0.000043771113,0.000084738735,0.0002527767,0.000056795816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015487529,0.0007543302,0.00059886056,0.00067768653,0.000849151,0.0016669163,0.0025410266,0.0017094273,0.0035086945],"category_scores_gemma":[0.0024175225,0.00034086013,0.0007485596,0.00092535885,0.0009853631,0.0030529841,0.0010226113,0.002112191,0.0011762063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006828585,0.00006332814,0.00024746702,0.00007307427,0.000016353286,0.00025299846,0.00025439935,0.19000901,0.0043061166,0.77495587,0.0047429907,0.025010046],"study_design_scores_gemma":[0.000031354175,0.000052282998,0.00007511804,0.000015546595,0.000014957774,0.00016425355,0.0000270295,0.88784534,0.00059266866,0.09743958,0.013715219,0.000026556598],"about_ca_topic_score_codex":0.0062868153,"about_ca_topic_score_gemma":0.00345386,"teacher_disagreement_score":0.0062868153,"about_ca_system_score_codex":0.002322757,"about_ca_system_score_gemma":0.0021149535,"threshold_uncertainty_score":0.016852915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056822635,0.0012666142,0.98591554,0.00061833987,0.00013586959,0.00011263115,0.00003256951,0.00047173255,0.0057644607],"genre_scores_gemma":[0.2461521,0.004697029,0.7422254,0.0004492382,0.0005201649,0.00070031395,0.00015876719,0.00016867364,0.0049283747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979746,0.00079859537,0.00010093646,0.00015213736,0.0008348394,0.00013897692],"domain_scores_gemma":[0.9969618,0.0014212998,0.00022897283,0.000707752,0.00057578203,0.00010433053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023414977,0.00097416824,0.0005673955,0.0015077076,0.0014414396,0.0030267225,0.003118176,0.0016663151,0.0030758493],"category_scores_gemma":[0.0066348338,0.0007540061,0.0006722048,0.0023539136,0.002157117,0.004109785,0.0018716922,0.003153104,0.0007455116],"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.00009161306,0.00013631157,0.00050877145,0.00021373878,0.00007335065,0.00014191339,0.00026163022,0.34073696,0.0047560832,0.54420453,0.0036087607,0.10526627],"study_design_scores_gemma":[0.000035225858,0.000090191774,0.00013591396,0.000043134187,0.000041077998,0.00015904778,0.00004222751,0.6682068,0.0028702605,0.31099343,0.01732967,0.000053019336],"about_ca_topic_score_codex":0.0015940373,"about_ca_topic_score_gemma":0.0021336938,"teacher_disagreement_score":0.003118176,"about_ca_system_score_codex":0.0014326586,"about_ca_system_score_gemma":0.0011083706,"threshold_uncertainty_score":0.012383163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07069267,0.000816066,0.9038169,0.0004500403,0.00044025178,0.00039812125,0.00019611395,0.009941543,0.013248364],"genre_scores_gemma":[0.6575548,0.00060178695,0.32574028,0.00040566095,0.0002432448,0.0003052999,0.0004252825,0.0002969457,0.014426719],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00016023031,0.0000824103,0.000098107244,0.0003883841,0.000085902124],"domain_scores_gemma":[0.9984804,0.0004216215,0.00014886665,0.0004692132,0.00035947017,0.000120455086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021625576,0.00041337206,0.0005110024,0.0006088876,0.00055411534,0.0009845856,0.0017163794,0.0008829966,0.0024680875],"category_scores_gemma":[0.0024380288,0.00037235592,0.0003006949,0.00034416383,0.00041290044,0.0012538066,0.0007142166,0.0011073073,0.001299311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013222782,0.0011723508,0.0019049405,0.00041636144,0.00010793648,0.00094435806,0.0007043714,0.021654543,0.49105132,0.18741696,0.013032255,0.28027233],"study_design_scores_gemma":[0.0005055254,0.0010723216,0.0012831728,0.000076597076,0.00015746948,0.0012932774,0.00006170111,0.53447086,0.34238794,0.023574961,0.09493195,0.00018425468],"about_ca_topic_score_codex":0.00034503406,"about_ca_topic_score_gemma":0.0002628917,"teacher_disagreement_score":0.0024680875,"about_ca_system_score_codex":0.0004301405,"about_ca_system_score_gemma":0.00058417587,"threshold_uncertainty_score":0.01143688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026577981,0.00012280604,0.9956755,0.00008603943,0.000061974475,0.000048446313,0.000014114624,0.00071024784,0.0006229948],"genre_scores_gemma":[0.27627307,0.00033465342,0.718179,0.00033664683,0.00016051879,0.00031318978,0.00017164223,0.00014116347,0.0040900507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989023,0.00023851474,0.00007130095,0.00029137582,0.0003777908,0.00011864722],"domain_scores_gemma":[0.99853647,0.0006850014,0.000111866386,0.00014150505,0.00046745656,0.00005766499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020577856,0.0008522946,0.0009231239,0.00086568814,0.0006688381,0.0012759956,0.0025895822,0.0012759446,0.0027591768],"category_scores_gemma":[0.0041794586,0.00035392042,0.0004200976,0.0006016022,0.0007532904,0.0018664427,0.0010120532,0.0016310822,0.00077473733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032843003,0.00019162372,0.0011425343,0.00013786608,0.000054620225,0.000079671394,0.00014402623,0.4445835,0.010555331,0.033548746,0.004235064,0.50499856],"study_design_scores_gemma":[0.000052032578,0.000057693982,0.00007313255,0.0000055998044,0.000008291307,0.000028608461,0.0000047198137,0.9940329,0.0015837849,0.0026301132,0.0015122877,0.000010725207],"about_ca_topic_score_codex":0.0036781349,"about_ca_topic_score_gemma":0.0022867392,"teacher_disagreement_score":0.0036781349,"about_ca_system_score_codex":0.0010564639,"about_ca_system_score_gemma":0.0015202579,"threshold_uncertainty_score":0.010882795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028898198,0.00052338326,0.9611115,0.0005166036,0.0001232191,0.00017970432,0.000027104812,0.002557793,0.0060624736],"genre_scores_gemma":[0.29089433,0.0007229309,0.69903255,0.00029941185,0.00015085441,0.0002232211,0.00014416692,0.00019843057,0.008334154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.000071963375,0.000043927153,0.0000624114,0.00018838652,0.00006211943],"domain_scores_gemma":[0.99945146,0.00006991962,0.000044741213,0.00014277713,0.00020935966,0.0000817585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012107885,0.00040982425,0.00035949872,0.00080216426,0.0009940123,0.0016360895,0.0026165259,0.0011564129,0.0013198145],"category_scores_gemma":[0.0012187852,0.00047327625,0.00069005165,0.00045120032,0.00083523476,0.0019377448,0.0013613319,0.0017835042,0.0007054738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005583653,0.00041895875,0.004036246,0.0005081313,0.00021750502,0.0008139903,0.0017946339,0.09711325,0.21377032,0.2891417,0.009520811,0.38210607],"study_design_scores_gemma":[0.00007240533,0.00039033362,0.0012464615,0.00010880621,0.00022784661,0.00073920935,0.00015851848,0.84687,0.04363736,0.043667827,0.06276744,0.00011377114],"about_ca_topic_score_codex":0.0031778673,"about_ca_topic_score_gemma":0.0035572604,"teacher_disagreement_score":0.0031778673,"about_ca_system_score_codex":0.0014858029,"about_ca_system_score_gemma":0.0012957285,"threshold_uncertainty_score":0.0107803345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1913298,0.00059756316,0.80557036,0.00014322968,0.00004558939,0.000075139265,0.000012111964,0.00015839149,0.0020678192],"genre_scores_gemma":[0.9775359,0.00011689656,0.021854242,0.000021634723,0.000016451486,0.00002461412,0.000009935069,0.0000054570783,0.00041483482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993869,0.00025071655,0.00002971828,0.0000987121,0.00013013642,0.0001038838],"domain_scores_gemma":[0.9988531,0.0006090698,0.00012884566,0.000122064266,0.0001863423,0.000100592304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017121148,0.0005204441,0.0004922084,0.00054857176,0.0005736773,0.00065756217,0.00084109046,0.00046810514,0.00034264819],"category_scores_gemma":[0.0023321917,0.00027626008,0.0003236018,0.00045163513,0.0005278297,0.0011597316,0.0008593521,0.00047241853,0.000059805687],"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.00036095083,0.0002244358,0.0029913704,0.00008395388,0.00011275422,0.00064276066,0.00036205474,0.8497593,0.048665784,0.022035439,0.0007099428,0.07405125],"study_design_scores_gemma":[0.000013442608,0.000093638875,0.000399547,0.00000422056,0.000032932243,0.000058764927,0.000040232888,0.99259937,0.0038271449,0.0024473728,0.00047353466,0.000009919154],"about_ca_topic_score_codex":0.001634391,"about_ca_topic_score_gemma":0.0026037907,"teacher_disagreement_score":0.0017121148,"about_ca_system_score_codex":0.00053966657,"about_ca_system_score_gemma":0.0005213751,"threshold_uncertainty_score":0.009054601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05132471,0.00052931055,0.9436104,0.0007760346,0.00013032132,0.000112555164,0.00032579617,0.0004222395,0.0027686402],"genre_scores_gemma":[0.96014583,0.0007214751,0.032103363,0.00016395394,0.0002596991,0.00026011598,0.00033629825,0.00012660441,0.005882573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963845,0.0012578727,0.00015640384,0.0005755318,0.0011050419,0.0005206202],"domain_scores_gemma":[0.99090296,0.006143608,0.00082707364,0.00048633115,0.0013270163,0.0003129831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005945842,0.0016926224,0.0017530599,0.0015663458,0.0007578474,0.0027057813,0.0034708541,0.0027290597,0.0021282518],"category_scores_gemma":[0.017765723,0.0010286841,0.0011549582,0.0014375349,0.0021982936,0.0026853087,0.0011959432,0.002567332,0.00047243744],"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.00004500142,0.000036510854,0.0003218038,0.00002719603,0.000023798157,0.000055789704,0.000034752622,0.952932,0.0010056887,0.04310005,0.00043166458,0.0019858058],"study_design_scores_gemma":[0.0000034507163,0.000005387674,0.00004620117,0.0000019754548,0.000004901165,0.000005946517,0.0000015582548,0.9970408,0.00007318154,0.0027605246,0.000051793904,0.0000041845033],"about_ca_topic_score_codex":0.015228006,"about_ca_topic_score_gemma":0.0076750247,"teacher_disagreement_score":0.015228006,"about_ca_system_score_codex":0.004622457,"about_ca_system_score_gemma":0.0023694977,"threshold_uncertainty_score":0.03353846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028796308,0.0014451019,0.9303785,0.008395791,0.00026127868,0.00009717577,0.00009575309,0.00021453698,0.030315606],"genre_scores_gemma":[0.9163348,0.0021166962,0.07379434,0.0016535879,0.00071649504,0.0002794808,0.00008292711,0.00014303235,0.0048786593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915256,0.0048188707,0.00025350632,0.0011400265,0.0016790753,0.00058290805],"domain_scores_gemma":[0.91225755,0.07513493,0.0032462107,0.0061467076,0.0021322297,0.0010823715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013066676,0.0012805162,0.0012839632,0.0013072268,0.0019939211,0.003698842,0.0026317693,0.0040845475,0.004619099],"category_scores_gemma":[0.062675886,0.00078864564,0.0012120734,0.0008307449,0.011345689,0.008935834,0.004951894,0.0073442967,0.0005349615],"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.00004522782,0.000039105373,0.0007501454,0.00009966099,0.000036391553,0.00012994724,0.00019759523,0.14796355,0.00056119676,0.84308356,0.0015922857,0.005501363],"study_design_scores_gemma":[0.000020166672,0.0000412445,0.00013029495,0.00004339048,0.000009889387,0.00006209983,0.00004669231,0.29394335,0.00023517909,0.7036016,0.0018461356,0.000019934441],"about_ca_topic_score_codex":0.0019885944,"about_ca_topic_score_gemma":0.00096342387,"teacher_disagreement_score":0.013066676,"about_ca_system_score_codex":0.0033378555,"about_ca_system_score_gemma":0.0018547721,"threshold_uncertainty_score":0.069104016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27832493,0.0019744707,0.6367868,0.0004609807,0.00078004,0.00069802575,0.00054595,0.066295214,0.014133518],"genre_scores_gemma":[0.9539806,0.0002562336,0.039992105,0.00017031404,0.00015229132,0.00017698278,0.00041437597,0.00050176954,0.004355412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994135,0.00015058358,0.00004852484,0.000103652914,0.00018511362,0.000098664284],"domain_scores_gemma":[0.9989649,0.00014547096,0.000056359695,0.00020571213,0.00047593852,0.00015165297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094807695,0.0008030556,0.0011318447,0.0016225236,0.0011968076,0.0011493061,0.001946771,0.0005252951,0.0032581773],"category_scores_gemma":[0.0018856208,0.00038015968,0.00028333635,0.00069416355,0.00031762142,0.000979389,0.0010347886,0.00081203226,0.0008641713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006109587,0.0018274358,0.015463841,0.00081948854,0.0005733632,0.0019953314,0.0015278652,0.044328246,0.36554462,0.018877348,0.06027556,0.48265734],"study_design_scores_gemma":[0.0003482942,0.0010684191,0.0051287827,0.000065250286,0.00060326996,0.0012425358,0.00016022763,0.82315,0.14302424,0.004761646,0.020197453,0.00024992533],"about_ca_topic_score_codex":0.0020270785,"about_ca_topic_score_gemma":0.0015041527,"teacher_disagreement_score":0.0032581773,"about_ca_system_score_codex":0.0006319634,"about_ca_system_score_gemma":0.000853634,"threshold_uncertainty_score":0.010899663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81041646,0.0028803619,0.1575956,0.0012741949,0.00021443986,0.00022391831,0.00036674738,0.0029193272,0.024108887],"genre_scores_gemma":[0.9800024,0.0003526348,0.016145214,0.00008810575,0.000022029777,0.000028918987,0.00012641116,0.000029902747,0.0032042426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00008103788,0.000021927135,0.00006055881,0.00011847729,0.00010563629],"domain_scores_gemma":[0.9993593,0.00020245256,0.00008172563,0.00007980345,0.00021449712,0.00006227488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010919475,0.00035954977,0.00026739688,0.0008730348,0.0007091681,0.0018055195,0.00095397333,0.00031293547,0.0017770834],"category_scores_gemma":[0.0022075777,0.000168646,0.00012798794,0.00068753364,0.00047190048,0.0013679889,0.0006031785,0.00036594603,0.0001730656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015973429,0.00040657262,0.055074546,0.00040047415,0.00009787725,0.0011250406,0.0011202248,0.3200391,0.13034065,0.063185155,0.013027477,0.4135856],"study_design_scores_gemma":[0.00014006784,0.0008198332,0.015255893,0.00008377971,0.00013472853,0.0006476891,0.00090722553,0.85308385,0.08553256,0.015673352,0.027587665,0.00013336756],"about_ca_topic_score_codex":0.018299593,"about_ca_topic_score_gemma":0.024317259,"teacher_disagreement_score":0.018299593,"about_ca_system_score_codex":0.0023331682,"about_ca_system_score_gemma":0.0012918414,"threshold_uncertainty_score":0.036386132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027145986,0.00027900518,0.9624809,0.00029032127,0.000075053504,0.000110051114,0.00004300664,0.0014015321,0.008174203],"genre_scores_gemma":[0.50822765,0.00035424452,0.48610842,0.0001681755,0.00012955317,0.00009859767,0.00018125742,0.000121648234,0.004610477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938166,0.00014780805,0.00003799763,0.00006164119,0.00029526575,0.0000756446],"domain_scores_gemma":[0.9993839,0.00014792953,0.00006833636,0.0001420767,0.00021727629,0.00004030304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066470605,0.00033563143,0.0004115084,0.000559332,0.00031451441,0.0007814949,0.0010194577,0.0003744219,0.00095467165],"category_scores_gemma":[0.0010232828,0.0002563386,0.00028024518,0.0004027614,0.00029063318,0.0009839128,0.0006538031,0.00060865487,0.00034413577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033390167,0.00040358683,0.002900612,0.00026680794,0.0001576815,0.0005732232,0.00031048708,0.16075687,0.13604023,0.15264079,0.0053864983,0.54022926],"study_design_scores_gemma":[0.000029060591,0.0002500021,0.0007772091,0.000019896077,0.00006675951,0.00045626587,0.000065669294,0.90299875,0.05314725,0.015613447,0.02653355,0.000042110514],"about_ca_topic_score_codex":0.0010197529,"about_ca_topic_score_gemma":0.0016212611,"teacher_disagreement_score":0.0010197529,"about_ca_system_score_codex":0.0004134696,"about_ca_system_score_gemma":0.00070213963,"threshold_uncertainty_score":0.0035153627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009424005,0.0003489004,0.98724455,0.00016766306,0.00010443112,0.00006809605,0.000093054165,0.002105381,0.0004439366],"genre_scores_gemma":[0.23623969,0.00021581016,0.76023716,0.00029744577,0.00011528407,0.00026005102,0.00031465784,0.0002049995,0.0021149267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.00013148051,0.00006166058,0.00018162037,0.0002697774,0.00007293412],"domain_scores_gemma":[0.99834836,0.00078389945,0.00012193233,0.00021446985,0.0004483867,0.000082804574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015676909,0.00062847155,0.0010739199,0.0012587472,0.0007854455,0.0010799807,0.0020703697,0.0007897617,0.0017831365],"category_scores_gemma":[0.0050300816,0.0004103004,0.00048138923,0.0012054445,0.00051486725,0.0011018226,0.0014066203,0.0013281646,0.00041075356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006161353,0.00018136641,0.002727729,0.00009939349,0.00012244114,0.00006201388,0.00007699528,0.13115756,0.0044195238,0.0062584155,0.0051003494,0.8491781],"study_design_scores_gemma":[0.000029180826,0.00002986044,0.00018017822,0.000004609563,0.000011057217,0.000023424833,0.000007241079,0.99379456,0.002067972,0.0024155548,0.0014305664,0.0000058313863],"about_ca_topic_score_codex":0.008216087,"about_ca_topic_score_gemma":0.008646328,"teacher_disagreement_score":0.008216087,"about_ca_system_score_codex":0.0007200375,"about_ca_system_score_gemma":0.0015945975,"threshold_uncertainty_score":0.0163365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102192536,0.0005218004,0.8818612,0.0012805252,0.00012831809,0.0001285393,0.00008060386,0.0021538069,0.011652595],"genre_scores_gemma":[0.924868,0.00019549971,0.07355529,0.0002260415,0.00005565666,0.0000920039,0.00002919076,0.00010185031,0.0008763833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989593,0.00026802917,0.000047041187,0.00018795473,0.0002693624,0.00026827108],"domain_scores_gemma":[0.9970476,0.0013818066,0.00031180336,0.0005236955,0.0005935192,0.00014158743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003795449,0.00065342593,0.00076204335,0.0006121233,0.0007708942,0.0011623661,0.0020974162,0.0009842943,0.0016027549],"category_scores_gemma":[0.0103539685,0.00023781434,0.00031850717,0.00053749816,0.0011754826,0.00314997,0.0008953656,0.0008609031,0.00041972994],"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.000716844,0.00034007218,0.0034907209,0.00032341073,0.0000939591,0.00024268519,0.00035088192,0.57018006,0.03360789,0.1775566,0.00573389,0.20736293],"study_design_scores_gemma":[0.000035731948,0.0001140915,0.0003954103,0.000008874711,0.00001683169,0.00005282104,0.000052944855,0.9617828,0.0078766355,0.028106181,0.0015407788,0.000016871336],"about_ca_topic_score_codex":0.0034989915,"about_ca_topic_score_gemma":0.0025301015,"teacher_disagreement_score":0.003795449,"about_ca_system_score_codex":0.0010857809,"about_ca_system_score_gemma":0.0015829772,"threshold_uncertainty_score":0.02007246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013388976,0.00031472393,0.98234826,0.00017511312,0.00021640811,0.00011573532,0.000040483923,0.0012395864,0.0021607596],"genre_scores_gemma":[0.108461425,0.0002966634,0.88415396,0.00017981709,0.00013143208,0.00015504542,0.00026488098,0.00014595315,0.0062107574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936515,0.00011197694,0.000050308572,0.0001232689,0.00028397076,0.000065313456],"domain_scores_gemma":[0.999298,0.00019426896,0.00007781143,0.00010296315,0.00026932557,0.000057666384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742534,0.0006254611,0.0005547471,0.0009977706,0.00074842584,0.001006368,0.0015656614,0.0008441218,0.002794746],"category_scores_gemma":[0.00146972,0.0003531082,0.00041298507,0.0006108525,0.0004075978,0.0018064333,0.00069278525,0.0012788866,0.0008906123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050596753,0.00043784856,0.0017329986,0.00025485078,0.00012513027,0.00017444706,0.00020770026,0.10168585,0.06069782,0.03142263,0.009381152,0.7933736],"study_design_scores_gemma":[0.00016110092,0.00032027287,0.0009417064,0.000035669796,0.00007070802,0.0004548105,0.000054528562,0.9058334,0.034376636,0.008638136,0.049044237,0.00006878393],"about_ca_topic_score_codex":0.0017309124,"about_ca_topic_score_gemma":0.0025393532,"teacher_disagreement_score":0.002794746,"about_ca_system_score_codex":0.001127783,"about_ca_system_score_gemma":0.0012314997,"threshold_uncertainty_score":0.009349346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15551168,0.0009877157,0.83109754,0.00047584635,0.00025058107,0.00024184825,0.00006822378,0.004605464,0.0067611407],"genre_scores_gemma":[0.8918258,0.00013321203,0.104267724,0.0003084521,0.00012036472,0.000058947084,0.00005867182,0.00006541658,0.0031614255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980856,0.0004990594,0.00014799385,0.00036186285,0.00056201906,0.00034340075],"domain_scores_gemma":[0.9959518,0.0010995152,0.0005593982,0.0011163562,0.000884384,0.0003884758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031190265,0.0005794507,0.0007178755,0.0011479356,0.00071484165,0.0019914394,0.0025023846,0.0008053508,0.0017958604],"category_scores_gemma":[0.0034949656,0.00035838626,0.00048976025,0.00050922687,0.00081854017,0.0016447094,0.0020111152,0.0016044772,0.00070581044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017836146,0.0016358106,0.0075969566,0.00036109154,0.0002098331,0.00060924,0.0006087064,0.099174246,0.23537143,0.13236645,0.007266859,0.51301575],"study_design_scores_gemma":[0.00014308913,0.0005784398,0.0014659838,0.000040277242,0.00010350115,0.00053745566,0.00003628132,0.9116637,0.057531573,0.017229576,0.010563286,0.00010678602],"about_ca_topic_score_codex":0.0006876283,"about_ca_topic_score_gemma":0.00062225957,"teacher_disagreement_score":0.0031190265,"about_ca_system_score_codex":0.0009800078,"about_ca_system_score_gemma":0.0006635421,"threshold_uncertainty_score":0.016495168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61604726,0.00051306497,0.36477578,0.00027795308,0.00009631798,0.000114447634,0.0000462092,0.000861205,0.017267793],"genre_scores_gemma":[0.99636984,0.000045904588,0.0028804173,0.00001803942,0.0000047427134,0.000014399943,0.000010896029,0.000008136084,0.0006476419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994438,0.00012273497,0.000038045102,0.00007781271,0.00017368248,0.00014391617],"domain_scores_gemma":[0.9971625,0.0014435223,0.00031057294,0.00022353159,0.0007631464,0.000096582036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582721,0.00053150154,0.000447869,0.0003411781,0.00048587497,0.0009814907,0.00049425376,0.0008283818,0.001673205],"category_scores_gemma":[0.005317055,0.00012887875,0.00019384314,0.00014753568,0.0006512294,0.0007085253,0.0007581598,0.000717726,0.00018244401],"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.00061428995,0.00013570093,0.0025379064,0.00011405737,0.000038187096,0.00011395148,0.00019789423,0.9373109,0.013012974,0.00957942,0.000734887,0.035609875],"study_design_scores_gemma":[0.000014929338,0.00012618999,0.00035775133,0.0000068669024,0.000004479865,0.000021416556,0.000023116616,0.9959764,0.0026478523,0.00065834244,0.00015565037,0.0000070095693],"about_ca_topic_score_codex":0.0045884633,"about_ca_topic_score_gemma":0.0015353514,"teacher_disagreement_score":0.0045884633,"about_ca_system_score_codex":0.0005836661,"about_ca_system_score_gemma":0.00077849394,"threshold_uncertainty_score":0.009123504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045987047,0.0029290891,0.9287368,0.0038110986,0.00016873186,0.0001995582,0.000039634444,0.0008538581,0.017274138],"genre_scores_gemma":[0.6448035,0.0027846212,0.34457242,0.00048811134,0.0003214904,0.00016526323,0.000056684232,0.000112270856,0.006695709],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985109,0.00034607682,0.00007108667,0.00022415299,0.00071960816,0.00012815483],"domain_scores_gemma":[0.9990139,0.00025180145,0.00014882408,0.0001909425,0.00030875995,0.00008572474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011450938,0.0007919853,0.00046216368,0.001952888,0.00085668074,0.0015703428,0.0013650182,0.00089801254,0.0017799514],"category_scores_gemma":[0.0015920753,0.0003074287,0.00049820595,0.0006389962,0.0009817806,0.002509905,0.0012462308,0.0017378605,0.0004487363],"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.00044112297,0.0011987995,0.005800693,0.00072403,0.00021884142,0.0004542299,0.00047066464,0.08282222,0.22146937,0.20148252,0.0052884226,0.47962913],"study_design_scores_gemma":[0.00020693397,0.0017610107,0.0053095752,0.00031146905,0.0004142006,0.002606101,0.00051118276,0.5368179,0.18264106,0.2086302,0.060557257,0.00023312808],"about_ca_topic_score_codex":0.0006268322,"about_ca_topic_score_gemma":0.0005806509,"teacher_disagreement_score":0.001952888,"about_ca_system_score_codex":0.0011800067,"about_ca_system_score_gemma":0.0014712471,"threshold_uncertainty_score":0.008561611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6831571,0.008005014,0.26492113,0.0023309807,0.00031897103,0.00013708278,0.0001678062,0.0077993604,0.03316246],"genre_scores_gemma":[0.9835961,0.0008477223,0.014277259,0.00006587649,0.000121169214,0.00002052532,0.000047166766,0.00007682105,0.0009473639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983266,0.0007263696,0.00006638235,0.00017100824,0.00043665653,0.00027298232],"domain_scores_gemma":[0.9957106,0.0017082882,0.00032863504,0.0006504288,0.0014103967,0.00019157068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025176983,0.00060410367,0.0006149494,0.0010992854,0.0011559185,0.0013591995,0.0015473452,0.0010303814,0.0015046821],"category_scores_gemma":[0.00954051,0.00036126844,0.00017469685,0.0014833369,0.00077131746,0.0021628118,0.0009773066,0.0007744296,0.00062448694],"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.00087157544,0.0007190495,0.014647646,0.00051860086,0.00010187966,0.0008694776,0.00072927936,0.4511761,0.059306115,0.02431164,0.018619454,0.42812914],"study_design_scores_gemma":[0.000042411797,0.00032795826,0.0034984997,0.00004564077,0.00007334094,0.00029598313,0.00021455031,0.9510722,0.025071252,0.011516427,0.007787687,0.00005401209],"about_ca_topic_score_codex":0.0029494702,"about_ca_topic_score_gemma":0.0024206997,"teacher_disagreement_score":0.0029494702,"about_ca_system_score_codex":0.0013043502,"about_ca_system_score_gemma":0.0009012024,"threshold_uncertainty_score":0.013315022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008838692,0.00058765995,0.98484343,0.00018304521,0.000100507335,0.000026556518,0.000012044298,0.00020796705,0.0052000745],"genre_scores_gemma":[0.91247964,0.0008936524,0.08165275,0.00014894306,0.00018671581,0.000087337685,0.00003555675,0.000025972251,0.004489375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998287,0.000028180486,0.000007903386,0.000039855557,0.0000757685,0.00001951886],"domain_scores_gemma":[0.9998907,0.000037636222,0.000016118756,0.000012567878,0.00003460674,0.000008386915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032684777,0.0004081635,0.00035869764,0.0002842468,0.0003980457,0.0005923618,0.00086084247,0.00055990944,0.00090220204],"category_scores_gemma":[0.0006432392,0.00019671836,0.0003571669,0.00023734476,0.00038612305,0.00057399395,0.000531,0.000826805,0.00013621937],"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.000060327668,0.00005187236,0.0004690822,0.00008288025,0.000031717587,0.00020407574,0.00011856297,0.8325323,0.010199279,0.042706333,0.0011258489,0.11241761],"study_design_scores_gemma":[0.0000024497008,0.000017235561,0.00004385534,0.0000033060196,0.000004722485,0.000016033426,0.0000048266256,0.99588925,0.0004683333,0.0028734033,0.0006733284,0.0000032132332],"about_ca_topic_score_codex":0.0026286244,"about_ca_topic_score_gemma":0.0022507408,"teacher_disagreement_score":0.0026286244,"about_ca_system_score_codex":0.00045441813,"about_ca_system_score_gemma":0.00048700292,"threshold_uncertainty_score":0.0052266717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029371848,0.044714946,0.7175147,0.010103515,0.009499515,0.00037250924,0.0029790865,0.006127081,0.17931676],"genre_scores_gemma":[0.21141486,0.021948365,0.2522334,0.005317206,0.005596187,0.00041042618,0.0040830593,0.003716443,0.49528012],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99909866,0.00012447934,0.000056779492,0.00029847145,0.00034493938,0.000076705146],"domain_scores_gemma":[0.9980742,0.0004063719,0.000058338297,0.000274796,0.0010890785,0.00009726671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242884,0.0015301076,0.00089374493,0.003071037,0.00054514257,0.003988156,0.0010741353,0.0010169109,0.006698522],"category_scores_gemma":[0.0035487723,0.0004934199,0.0004795753,0.0039834958,0.0010034202,0.0056026094,0.0009770837,0.0022494467,0.0051106177],"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.00012786592,0.00025469097,0.0023879216,0.0002389023,0.000037768554,0.00009901558,0.00049158186,0.0039832657,0.008760737,0.08922863,0.14108282,0.7533069],"study_design_scores_gemma":[0.000018608962,0.00014434528,0.00888293,0.00047733102,0.000080451115,0.00065005047,0.00052413554,0.059565954,0.02226024,0.097174294,0.81004983,0.00017186262],"about_ca_topic_score_codex":0.0058146124,"about_ca_topic_score_gemma":0.005344997,"teacher_disagreement_score":0.006698522,"about_ca_system_score_codex":0.0018727863,"about_ca_system_score_gemma":0.00096105394,"threshold_uncertainty_score":0.022408783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21110594,0.0012325865,0.7755955,0.0014888312,0.00020039975,0.00010845887,0.00016749775,0.00026153013,0.009839209],"genre_scores_gemma":[0.96303445,0.0004367433,0.03229829,0.00014447127,0.0002371746,0.00008193378,0.00009170654,0.0001512819,0.0035239316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996479,0.0010901921,0.00010028739,0.000299402,0.0012544612,0.00077675557],"domain_scores_gemma":[0.95854294,0.035065826,0.001675344,0.0014790288,0.0022421519,0.0009947174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007032673,0.0010684722,0.0015816047,0.0016312855,0.0012034974,0.003544305,0.0032681124,0.0012030362,0.0035352325],"category_scores_gemma":[0.03804141,0.00085987383,0.00081643614,0.001692608,0.0024277915,0.006223964,0.0020342497,0.0025579385,0.00019602408],"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.00023944241,0.00012727587,0.0012268054,0.000090190755,0.000053102136,0.00007429339,0.00017646862,0.78267914,0.0019550205,0.20166583,0.0013279638,0.010384433],"study_design_scores_gemma":[0.000005473414,0.000008936676,0.00013388705,0.0000028300049,0.000007751829,0.000008839781,0.000008853871,0.971473,0.00014179049,0.028121183,0.00008193488,0.0000055410815],"about_ca_topic_score_codex":0.0065679695,"about_ca_topic_score_gemma":0.00479676,"teacher_disagreement_score":0.007032673,"about_ca_system_score_codex":0.005380414,"about_ca_system_score_gemma":0.0038355319,"threshold_uncertainty_score":0.039037764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007850379,0.00016153797,0.98771346,0.00019237831,0.00002577892,0.000044619184,0.000013646342,0.00005282846,0.003945384],"genre_scores_gemma":[0.49459663,0.0007817196,0.49819615,0.0001951281,0.00010345411,0.00024086398,0.000042584896,0.00009046469,0.0057529015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993061,0.00034114046,0.000019863555,0.000079748235,0.00018974276,0.000063371626],"domain_scores_gemma":[0.9995584,0.0001594074,0.00006751478,0.000051758616,0.00013971936,0.000023092036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012226892,0.0005706735,0.00041225093,0.0005995564,0.0004035175,0.0008733931,0.0010937128,0.0008168377,0.0017393851],"category_scores_gemma":[0.0014721209,0.00036954595,0.00046931548,0.000401297,0.0005165253,0.0010251992,0.0005062164,0.00076145603,0.00025085316],"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.000038895614,0.0000548538,0.0003982664,0.00009912793,0.000021123818,0.000089942776,0.00005024105,0.85569924,0.011613504,0.0822827,0.0010494898,0.048602663],"study_design_scores_gemma":[0.000004375495,0.000034779103,0.000054962893,0.000006071906,0.0000054072,0.000036273454,0.000010958152,0.9883393,0.0013393925,0.008394951,0.001768817,0.000004706238],"about_ca_topic_score_codex":0.0006673809,"about_ca_topic_score_gemma":0.0008809646,"teacher_disagreement_score":0.0017393851,"about_ca_system_score_codex":0.0011263828,"about_ca_system_score_gemma":0.00090374507,"threshold_uncertainty_score":0.008172512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741938,0.000061832114,0.9122314,0.00015248003,0.00012935458,0.00014935294,0.00019449928,0.038944513,0.010717231],"genre_scores_gemma":[0.55596316,0.000071815346,0.4341107,0.00014971558,0.000051483534,0.0002793519,0.0006304837,0.002668335,0.006074895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00013098035,0.000034167686,0.00007682122,0.00019491279,0.00006643112],"domain_scores_gemma":[0.99812907,0.0004998289,0.00007589636,0.0006476273,0.000525528,0.000121993944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895215,0.001018142,0.00071732124,0.00062480546,0.0007013635,0.00087578857,0.0030117878,0.0008344571,0.013552151],"category_scores_gemma":[0.0046068425,0.0005377413,0.00056888704,0.00048330607,0.00047250948,0.000987045,0.0016015322,0.0015074844,0.0035181888],"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.0013752793,0.00074842374,0.005626376,0.0003190348,0.0002779716,0.0005073481,0.00038655484,0.5758564,0.024978496,0.023588866,0.015475205,0.35086],"study_design_scores_gemma":[0.000028362456,0.00002849666,0.00011454316,0.000006451818,0.000008688853,0.000022016733,0.000010333334,0.99291223,0.004346627,0.0010453252,0.001470675,0.0000063457915],"about_ca_topic_score_codex":0.00600433,"about_ca_topic_score_gemma":0.005226538,"teacher_disagreement_score":0.013552151,"about_ca_system_score_codex":0.0005894456,"about_ca_system_score_gemma":0.001278833,"threshold_uncertainty_score":0.045336485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009220306,0.00017792555,0.98700976,0.0001634282,0.000022881994,0.000030943924,0.00002414862,0.00011116726,0.0032394866],"genre_scores_gemma":[0.5634813,0.0010350349,0.42976528,0.00026238078,0.00015688225,0.00030509415,0.00014415807,0.00014803381,0.0047017727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.0006019428,0.000049384613,0.00019076024,0.00033732492,0.00016055781],"domain_scores_gemma":[0.99943095,0.00022237378,0.000066008586,0.00014263744,0.0001028165,0.00003520411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001650582,0.0011136445,0.00093945814,0.00072352076,0.00057712663,0.0013465367,0.0012803717,0.0009376187,0.0010213912],"category_scores_gemma":[0.0019755014,0.0003671404,0.001021711,0.0008812584,0.0017359235,0.0019994855,0.0018214424,0.0012693282,0.00014583378],"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.000014947389,0.000022048504,0.00008602678,0.000050913848,0.00001652409,0.000069924274,0.00005651974,0.6291731,0.003181794,0.3502368,0.0006773924,0.016413897],"study_design_scores_gemma":[0.000005674384,0.000018495795,0.000036275884,0.0000057100815,0.0000061012443,0.000023155359,0.000011048199,0.89210224,0.000502965,0.10602061,0.0012594761,0.000008231186],"about_ca_topic_score_codex":0.0024028632,"about_ca_topic_score_gemma":0.002807502,"teacher_disagreement_score":0.0024028632,"about_ca_system_score_codex":0.0017669515,"about_ca_system_score_gemma":0.0019740928,"threshold_uncertainty_score":0.012820184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07103814,0.0015128466,0.92394954,0.00031518453,0.00012017816,0.0001480666,0.000057947673,0.0012872294,0.001570952],"genre_scores_gemma":[0.75953484,0.0009495556,0.2379697,0.000049523558,0.00015656951,0.00012573732,0.00007133222,0.00006107044,0.0010817234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951875,0.000190943,0.000025896019,0.00004937059,0.00015191283,0.000063145584],"domain_scores_gemma":[0.99876046,0.00066653296,0.00014211203,0.00014469853,0.00022028337,0.00006592054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951902,0.0005644796,0.00053818175,0.0007141802,0.00064688234,0.00056803314,0.0009048557,0.00048107613,0.0009241795],"category_scores_gemma":[0.0030067577,0.00021829367,0.00028391505,0.00064228935,0.000494731,0.00082353014,0.00059818994,0.0005067927,0.00012708144],"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.0008110069,0.0002245023,0.0019449661,0.00024439176,0.0001028837,0.00031883936,0.00024054247,0.6261817,0.05352103,0.0264394,0.0034184086,0.28655237],"study_design_scores_gemma":[0.000035229732,0.00018698376,0.00034079448,0.0000067711826,0.000035585264,0.000101692145,0.000025702018,0.9876017,0.0049471073,0.0049670003,0.001727714,0.000023770934],"about_ca_topic_score_codex":0.0038666127,"about_ca_topic_score_gemma":0.0040211966,"teacher_disagreement_score":0.0038666127,"about_ca_system_score_codex":0.0009974883,"about_ca_system_score_gemma":0.00085812266,"threshold_uncertainty_score":0.0076882243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28723976,0.026924266,0.5884793,0.010672335,0.0016653123,0.0004777228,0.00026971922,0.0047877613,0.079483815],"genre_scores_gemma":[0.901471,0.005030286,0.085561216,0.001100546,0.0006168483,0.00016518339,0.00018139042,0.00009895859,0.0057745734],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541324,0.0012473322,0.00029779677,0.00031436302,0.0023463215,0.00038092383],"domain_scores_gemma":[0.993082,0.0025257752,0.0004216673,0.0011549492,0.002623861,0.00019175187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00634666,0.00049388927,0.0005302886,0.0008815058,0.0008044162,0.0026190807,0.0033138997,0.0015413844,0.0036543508],"category_scores_gemma":[0.0080731185,0.00038216493,0.00029048635,0.00068709016,0.0009357116,0.0034303798,0.0010376371,0.0015453479,0.0010859806],"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.0011052046,0.0006289682,0.007609885,0.0013015055,0.00015155858,0.00044613375,0.0007400265,0.06762344,0.07820949,0.30736193,0.02177632,0.51304555],"study_design_scores_gemma":[0.00024928487,0.0013285453,0.0063530887,0.00074994477,0.0002602303,0.0020295759,0.0007630889,0.55023634,0.08221757,0.09623737,0.25936338,0.00021154857],"about_ca_topic_score_codex":0.0016727757,"about_ca_topic_score_gemma":0.0014241548,"teacher_disagreement_score":0.00634666,"about_ca_system_score_codex":0.001538095,"about_ca_system_score_gemma":0.00086211885,"threshold_uncertainty_score":0.033564746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018495742,0.0003260833,0.97268146,0.00043202785,0.00011282804,0.000098205426,0.00037388608,0.000587922,0.006892017],"genre_scores_gemma":[0.71243554,0.0009556424,0.2731556,0.00038806468,0.00026042078,0.00042315337,0.0011441191,0.00026298806,0.01097446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962175,0.000110977315,0.00002024952,0.000042876123,0.00015909765,0.00004505089],"domain_scores_gemma":[0.99959534,0.00010627724,0.00005553036,0.000061603474,0.00014909229,0.000032212338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006558338,0.0005365379,0.0003933931,0.00038366523,0.0003203044,0.0008365314,0.0019641651,0.0008262211,0.0016017313],"category_scores_gemma":[0.0011902433,0.00023320277,0.00045011583,0.0005424729,0.000363137,0.0014599791,0.0005244054,0.00093988294,0.00043662067],"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.00012059282,0.00007498762,0.00065554766,0.0001375453,0.0000436852,0.0001927463,0.00008351452,0.81001824,0.009299205,0.11845692,0.006737472,0.054179538],"study_design_scores_gemma":[0.0000073323445,0.000017651791,0.0000490684,0.0000034167547,0.0000045748534,0.000024687712,0.000003426217,0.9899244,0.00088221557,0.005310895,0.0037677917,0.000004589755],"about_ca_topic_score_codex":0.0033559117,"about_ca_topic_score_gemma":0.0027992667,"teacher_disagreement_score":0.0033559117,"about_ca_system_score_codex":0.0007431474,"about_ca_system_score_gemma":0.0008910677,"threshold_uncertainty_score":0.0066727996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8073374,0.002732634,0.17364307,0.0006801451,0.0003644113,0.0015141653,0.00033541827,0.0050931163,0.00829964],"genre_scores_gemma":[0.98067427,0.00040725298,0.017451823,0.00006177423,0.000038248625,0.00018395111,0.00021133487,0.00007652064,0.0008949578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996358,0.0012343634,0.00028559755,0.00027937363,0.0013974631,0.0004450806],"domain_scores_gemma":[0.9843264,0.009340604,0.00084792706,0.0010566863,0.0037726515,0.0006557686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005927295,0.001293139,0.001317892,0.00220344,0.0013063456,0.0016617333,0.0018134778,0.0010182152,0.0018236396],"category_scores_gemma":[0.019408047,0.0003931419,0.0004563768,0.0013904639,0.0011418897,0.0021291573,0.0010579837,0.0011464659,0.00028020726],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01097849,0.001765855,0.010920286,0.0010549712,0.0006387274,0.0010661932,0.0010153375,0.6174024,0.10614692,0.021060204,0.006729493,0.2212212],"study_design_scores_gemma":[0.00014798998,0.0012821862,0.000781522,0.000018373888,0.000077309014,0.00019895131,0.000091416114,0.98118883,0.014744684,0.00080284965,0.00062505784,0.0000408353],"about_ca_topic_score_codex":0.004582039,"about_ca_topic_score_gemma":0.0018097708,"teacher_disagreement_score":0.005927295,"about_ca_system_score_codex":0.0026161761,"about_ca_system_score_gemma":0.0015996424,"threshold_uncertainty_score":0.031346917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027801016,0.0009681267,0.9564807,0.00056725554,0.00076927705,0.0003539783,0.00009965154,0.005253662,0.0077063995],"genre_scores_gemma":[0.7551058,0.0007508169,0.22965547,0.0006035101,0.00032012007,0.00030225678,0.00031303483,0.0002581455,0.012690818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988813,0.00017567628,0.000092753406,0.00020640154,0.0004919639,0.00015182186],"domain_scores_gemma":[0.99903935,0.00020840358,0.0000835634,0.00019674978,0.00038378252,0.000088186505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079169293,0.00041119297,0.0007765738,0.0004999016,0.0010697871,0.0023755718,0.0021849503,0.0008360413,0.0044367486],"category_scores_gemma":[0.0021313133,0.00019200952,0.00030439848,0.00071610784,0.0008085612,0.0016257494,0.0011771977,0.0018886216,0.0010137554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021684554,0.00059010566,0.0033841657,0.00063141953,0.0001567762,0.0007137535,0.00071932486,0.13440225,0.10107743,0.20353077,0.038529426,0.51409626],"study_design_scores_gemma":[0.00006219607,0.00033404137,0.00033740504,0.000023215121,0.000029363378,0.0002750248,0.00006062357,0.9376911,0.02330643,0.01246348,0.025352642,0.000064551554],"about_ca_topic_score_codex":0.0021351024,"about_ca_topic_score_gemma":0.0015752668,"teacher_disagreement_score":0.0044367486,"about_ca_system_score_codex":0.0013864158,"about_ca_system_score_gemma":0.0012583865,"threshold_uncertainty_score":0.014842451},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15418646,0.0006099878,0.7925123,0.0010648526,0.0005327067,0.00034584984,0.0009480656,0.013891927,0.03590792],"genre_scores_gemma":[0.7782479,0.000218306,0.19021817,0.000300505,0.000066592766,0.00013132223,0.0006766401,0.0001251206,0.030015504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982387,0.000030530085,0.000011764706,0.000035215697,0.00007880758,0.000019773102],"domain_scores_gemma":[0.9996153,0.00009495247,0.000040194514,0.000048057107,0.00017793947,0.000023597768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058728404,0.00037622234,0.00022228132,0.00043308493,0.0003049521,0.0005342491,0.0011475268,0.0005891917,0.008212113],"category_scores_gemma":[0.0011608264,0.000090085174,0.0001755759,0.00030041093,0.0003647481,0.0005647253,0.00034386254,0.00034577085,0.0014897578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010498742,0.00040852232,0.0044882847,0.00029320052,0.00005706328,0.00033401465,0.00014305091,0.09939786,0.08401818,0.02259974,0.03818246,0.7490277],"study_design_scores_gemma":[0.00014151602,0.0003480651,0.0025839366,0.00002221031,0.00002336987,0.00024786976,0.000027164777,0.91755146,0.04683218,0.0058584865,0.026323717,0.000040037776],"about_ca_topic_score_codex":0.0038279279,"about_ca_topic_score_gemma":0.0032386512,"teacher_disagreement_score":0.008212113,"about_ca_system_score_codex":0.00045534738,"about_ca_system_score_gemma":0.00041166894,"threshold_uncertainty_score":0.027472258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032386217,0.00075070176,0.96065605,0.00024174643,0.00014152394,0.00009323017,0.000042335076,0.0005652256,0.005122982],"genre_scores_gemma":[0.79204977,0.00078632025,0.20334284,0.00015854996,0.000099992765,0.0001486622,0.00006551385,0.00008106763,0.0032672673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990496,0.0002841311,0.000037333102,0.00014434467,0.0003190017,0.00016554311],"domain_scores_gemma":[0.9992797,0.0002952269,0.000060369963,0.00022249541,0.000098801436,0.00004344745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014962872,0.00078347273,0.000552564,0.00041614802,0.00081730913,0.0013824248,0.0015850367,0.0005589235,0.002047023],"category_scores_gemma":[0.0025931664,0.00021617934,0.000534201,0.0008490656,0.0012503469,0.0020222727,0.00095768756,0.0010774594,0.00028536282],"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.00020977558,0.00007759673,0.0005957448,0.00014082706,0.000054175016,0.00021949557,0.00019966306,0.46645176,0.01172504,0.44080544,0.002914207,0.076606296],"study_design_scores_gemma":[0.000011692224,0.000056155495,0.0001028928,0.0000102620215,0.000017013464,0.000054203996,0.000021236652,0.91787475,0.0028624241,0.073657475,0.0053204796,0.000011407854],"about_ca_topic_score_codex":0.0033278451,"about_ca_topic_score_gemma":0.0028311093,"teacher_disagreement_score":0.0033278451,"about_ca_system_score_codex":0.0017900766,"about_ca_system_score_gemma":0.0018473978,"threshold_uncertainty_score":0.012987971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012899433,0.0011333858,0.96598345,0.0022909907,0.00025547587,0.00003285909,0.000099933844,0.00013214031,0.017172372],"genre_scores_gemma":[0.8015112,0.004995859,0.1768141,0.0016190128,0.0013248533,0.0003141669,0.00028442114,0.00034119052,0.012795158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692625,0.0016905537,0.000099810466,0.00027771734,0.00081147626,0.00019417344],"domain_scores_gemma":[0.9939527,0.004546712,0.00032092523,0.0004922461,0.00050534296,0.00018208487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063369516,0.0011545181,0.0012259381,0.0010974518,0.00096261513,0.0022303083,0.0011714447,0.0013099312,0.0037696874],"category_scores_gemma":[0.016520768,0.000381367,0.0017318693,0.0014129855,0.00400645,0.0050454163,0.00267023,0.0048502637,0.00068408],"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.000007295139,0.000010069952,0.000056206027,0.000018058741,0.0000049368064,0.000033106196,0.00005542669,0.018443555,0.00016864872,0.9784388,0.00054155226,0.0022223482],"study_design_scores_gemma":[0.0000072011203,0.00001852498,0.000034735494,0.000013216234,0.0000053785766,0.00002867137,0.000015933445,0.17763996,0.0001419832,0.8202811,0.0018052422,0.000008084124],"about_ca_topic_score_codex":0.0028088053,"about_ca_topic_score_gemma":0.0011322843,"teacher_disagreement_score":0.0063369516,"about_ca_system_score_codex":0.0020895395,"about_ca_system_score_gemma":0.0014612735,"threshold_uncertainty_score":0.033513427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54463226,0.0026024794,0.4264792,0.0007981656,0.00039911727,0.00018949843,0.00007779177,0.010179363,0.014642159],"genre_scores_gemma":[0.9738263,0.0002625489,0.023960749,0.00014176924,0.00014223198,0.000019550924,0.000023242328,0.000091441325,0.0015321714],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00018882574,0.000045409502,0.00008539319,0.0002593261,0.00009776505],"domain_scores_gemma":[0.99782604,0.00084212364,0.0003361893,0.00048208033,0.0003890458,0.00012444225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014045775,0.000612116,0.00040141636,0.0007118006,0.0004178432,0.0011423217,0.0016758506,0.00060047634,0.0014459002],"category_scores_gemma":[0.0033129393,0.00031740498,0.00022520538,0.00035107075,0.0005475461,0.00155623,0.0009863775,0.0010191421,0.0005227353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014393528,0.0011976724,0.0041722325,0.00032652033,0.00016103829,0.00065903965,0.00029429334,0.08728491,0.6481603,0.01662147,0.004433696,0.23524952],"study_design_scores_gemma":[0.0001619076,0.0005301987,0.002821524,0.000041862702,0.000153578,0.0006961518,0.000035518962,0.78485626,0.20042443,0.0043083476,0.0058858795,0.00008431904],"about_ca_topic_score_codex":0.00037313855,"about_ca_topic_score_gemma":0.00030338904,"teacher_disagreement_score":0.0016758506,"about_ca_system_score_codex":0.0003273096,"about_ca_system_score_gemma":0.0002576942,"threshold_uncertainty_score":0.007428229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057805404,0.0030915074,0.9350337,0.00027960903,0.00021905215,0.00009764914,0.000024677163,0.0010734265,0.002375024],"genre_scores_gemma":[0.80613416,0.0016011102,0.19071496,0.00020472231,0.00021906014,0.00016311741,0.000067518245,0.00014043575,0.0007548532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998351,0.0007971841,0.00013314663,0.00015383422,0.00042024843,0.0001446323],"domain_scores_gemma":[0.99762124,0.0011147037,0.00025974674,0.00031037696,0.00062820636,0.00006579858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036824427,0.0007174652,0.0005242332,0.00089143845,0.00054895517,0.001411859,0.0011310709,0.0007320278,0.00062333245],"category_scores_gemma":[0.0053209704,0.0004981051,0.00047947775,0.0006509781,0.00050359016,0.0015135255,0.0010486515,0.000910246,0.00021145427],"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.0006595944,0.0003575362,0.005962302,0.0007623955,0.0003528996,0.00039935464,0.0003937625,0.420915,0.19042742,0.022513852,0.0031064202,0.35414952],"study_design_scores_gemma":[0.000035314857,0.00024267165,0.0004739138,0.00003025824,0.00009929037,0.00015438054,0.000019870124,0.96642435,0.027180199,0.0029201566,0.00239232,0.00002725992],"about_ca_topic_score_codex":0.00036520997,"about_ca_topic_score_gemma":0.00036646624,"teacher_disagreement_score":0.0036824427,"about_ca_system_score_codex":0.00057384354,"about_ca_system_score_gemma":0.00048036934,"threshold_uncertainty_score":0.019474864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039859964,0.000106331565,0.99465126,0.000054709017,0.000038541788,0.0000418726,0.0000076269557,0.00019138056,0.0009223822],"genre_scores_gemma":[0.75205165,0.00037013247,0.24471873,0.00018834336,0.00012643255,0.0004172547,0.000050474366,0.00004575251,0.0020313275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960047,0.00009349271,0.000027383718,0.00008599795,0.00015403041,0.000038628907],"domain_scores_gemma":[0.99948055,0.00019952781,0.00008103724,0.000025854119,0.0001972243,0.00001593525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833754,0.00075519475,0.0005534046,0.00037670537,0.00032766207,0.0007985363,0.0009054495,0.0008389325,0.0011088373],"category_scores_gemma":[0.0017233833,0.00027736695,0.00042023134,0.00022094675,0.0006275298,0.00055162807,0.00047448848,0.0010169598,0.00026074122],"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.0001228125,0.00011765592,0.00044362165,0.00036625811,0.00007216112,0.00013731098,0.00024716472,0.7909947,0.04056149,0.039214343,0.0016053013,0.12611714],"study_design_scores_gemma":[0.000034799636,0.000089583846,0.000090653055,0.000009153468,0.000013198127,0.000018242374,0.000008395571,0.9922879,0.0036618975,0.0026914373,0.0010871751,0.000007635037],"about_ca_topic_score_codex":0.001498038,"about_ca_topic_score_gemma":0.0010686768,"teacher_disagreement_score":0.001498038,"about_ca_system_score_codex":0.00040565673,"about_ca_system_score_gemma":0.0008562992,"threshold_uncertainty_score":0.0052006245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007605776,0.00008046185,0.9890252,0.0001123158,0.000023359908,0.00009273166,0.000025083998,0.0005928086,0.0024421779],"genre_scores_gemma":[0.59618926,0.00041572255,0.39739922,0.000119411765,0.0000619275,0.00055347476,0.0001260547,0.0001734183,0.004961501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.00013516308,0.00004820501,0.0001251981,0.00028795574,0.00007592968],"domain_scores_gemma":[0.9994647,0.00017643557,0.00007629354,0.000057773224,0.00018775933,0.000037120608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085014553,0.00061147986,0.0005144753,0.00053365063,0.00058452954,0.001230326,0.0013566414,0.0008556633,0.0019746537],"category_scores_gemma":[0.0015269628,0.00046514676,0.00046626144,0.00033012347,0.000532502,0.0010843462,0.00074667943,0.0009650439,0.0005831556],"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.00006544289,0.00006733045,0.0007184682,0.00006780976,0.00002436481,0.00009698055,0.00010786015,0.9140409,0.012553459,0.03683989,0.0010526691,0.034364752],"study_design_scores_gemma":[0.0000045963857,0.000010596806,0.00002368325,0.0000028788418,0.000003502406,0.000010368226,0.000003283573,0.99649954,0.0010983254,0.0014059589,0.0009347925,0.0000025149104],"about_ca_topic_score_codex":0.003137804,"about_ca_topic_score_gemma":0.0013404053,"teacher_disagreement_score":0.003137804,"about_ca_system_score_codex":0.0011135797,"about_ca_system_score_gemma":0.0020218273,"threshold_uncertainty_score":0.008079588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24952838,0.0009156745,0.7431285,0.00013597443,0.00014609896,0.00015129543,0.000047125242,0.002021788,0.003925151],"genre_scores_gemma":[0.97091436,0.00010718514,0.028043943,0.000045497152,0.00002765844,0.000027096847,0.00001965012,0.000020818356,0.0007937349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994252,0.00012113219,0.000039855582,0.000100257144,0.00019077098,0.00012277272],"domain_scores_gemma":[0.99899715,0.00033963172,0.00014903961,0.00014103414,0.00030709035,0.00006609172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095451524,0.0005645076,0.00039652793,0.00048751314,0.00040683075,0.0006257771,0.0013925491,0.00038527898,0.0008805538],"category_scores_gemma":[0.0018607449,0.00013915332,0.00015607965,0.00024282596,0.00039036898,0.0010101132,0.00074026297,0.00048048224,0.00008000793],"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.0006889449,0.00060986483,0.0042930306,0.00026995744,0.000111272595,0.0003055867,0.00045960155,0.52103806,0.1560964,0.02175388,0.0034062776,0.2909671],"study_design_scores_gemma":[0.000036918354,0.00024231341,0.000738295,0.000012050874,0.000023324343,0.00006355718,0.000021433156,0.97700536,0.018108375,0.0016866942,0.002038641,0.00002310706],"about_ca_topic_score_codex":0.002707505,"about_ca_topic_score_gemma":0.0023493874,"teacher_disagreement_score":0.002707505,"about_ca_system_score_codex":0.0005642645,"about_ca_system_score_gemma":0.00071183994,"threshold_uncertainty_score":0.005383432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58364034,0.00014238543,0.41422266,0.00010965193,0.000015516425,0.000056087676,0.00016217749,0.00036435307,0.0012869465],"genre_scores_gemma":[0.96913034,0.00006410582,0.03045953,0.0000060504185,0.000012213349,0.00003349876,0.0001725389,0.00001910563,0.000102556165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911624,0.00023686148,0.00005127132,0.00014828889,0.00035572282,0.00009167871],"domain_scores_gemma":[0.99611497,0.0019662143,0.0006265353,0.0007007223,0.00048307134,0.00010852104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886421,0.00048512925,0.00045507247,0.001130751,0.0004407968,0.00077306584,0.0007733459,0.0005618551,0.00029680823],"category_scores_gemma":[0.008399694,0.00032153647,0.00022484537,0.0009953926,0.00068671803,0.0016735754,0.0005549994,0.00091270683,0.000067690424],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015405533,0.0001979944,0.042205628,0.000104277424,0.000050357125,0.00029045608,0.00031531957,0.7650887,0.095822774,0.023694938,0.00050742185,0.07156816],"study_design_scores_gemma":[0.0000013653782,0.000019461771,0.0050116424,0.0000023879113,0.0000035826595,0.00006665125,0.000028547185,0.98600626,0.006161031,0.0025338626,0.00015937335,0.000005831881],"about_ca_topic_score_codex":0.0016530581,"about_ca_topic_score_gemma":0.0011758365,"teacher_disagreement_score":0.0016530581,"about_ca_system_score_codex":0.00086779497,"about_ca_system_score_gemma":0.00048205917,"threshold_uncertainty_score":0.0062963367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31602123,0.00069176353,0.66219145,0.00082275853,0.00019838089,0.00028487135,0.00012339912,0.0010591657,0.018606989],"genre_scores_gemma":[0.9685413,0.00015465145,0.028334886,0.00014714882,0.00004191682,0.000056218145,0.000033556902,0.000047455873,0.0026428201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.00047419104,0.0000370642,0.00010151964,0.00026607903,0.00018591278],"domain_scores_gemma":[0.9978765,0.0012405005,0.0002128281,0.0002343544,0.00030558291,0.00013018509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017139603,0.00045466534,0.00061697245,0.00033360778,0.00055772165,0.0010658421,0.0015790301,0.000865913,0.0015566072],"category_scores_gemma":[0.005659664,0.0002138321,0.00028979647,0.00060047884,0.00067469856,0.0011728148,0.00087545975,0.0008334335,0.0002208107],"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.00030709608,0.00029744374,0.0015991341,0.000109154,0.000043069813,0.00036618716,0.00014650825,0.89874864,0.013918032,0.021550983,0.003008083,0.059905723],"study_design_scores_gemma":[0.000015194835,0.000048846563,0.00023792264,0.000002279783,0.000004529633,0.00006909815,0.000013504828,0.9936631,0.0018616181,0.0031023566,0.00097433175,0.00000732094],"about_ca_topic_score_codex":0.0045527583,"about_ca_topic_score_gemma":0.0028297715,"teacher_disagreement_score":0.0045527583,"about_ca_system_score_codex":0.00144457,"about_ca_system_score_gemma":0.0008576236,"threshold_uncertainty_score":0.01048106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36477768,0.00078289205,0.5573332,0.00097131624,0.0002378019,0.00035612466,0.00014154763,0.0048584878,0.07054097],"genre_scores_gemma":[0.9026354,0.00025231324,0.082477055,0.00016211942,0.000080849684,0.00014929788,0.00015196965,0.000042807733,0.014048102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986637,0.000040187362,0.000005014692,0.000019391166,0.00004088622,0.00002813214],"domain_scores_gemma":[0.9998747,0.000015545273,0.000006945609,0.00001631998,0.00006285774,0.000023624092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000176266,0.00024167434,0.00014315704,0.0002807498,0.0004415306,0.0006048322,0.0005951029,0.00033897866,0.0039249184],"category_scores_gemma":[0.00023541802,0.00009403186,0.00015367182,0.0002121599,0.0002563743,0.0004344346,0.00038724867,0.00033567383,0.0009181922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061484106,0.00053758116,0.004093733,0.00034478388,0.00013702281,0.0012035437,0.0007886555,0.2126812,0.3015294,0.11874591,0.021238431,0.3380848],"study_design_scores_gemma":[0.000100702695,0.0007163539,0.0019993642,0.00003511869,0.00010184059,0.0005439785,0.0001215892,0.8961068,0.044893302,0.008524711,0.046818297,0.000037915725],"about_ca_topic_score_codex":0.0025829156,"about_ca_topic_score_gemma":0.0025217528,"teacher_disagreement_score":0.0039249184,"about_ca_system_score_codex":0.00067966024,"about_ca_system_score_gemma":0.00043698022,"threshold_uncertainty_score":0.013130128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03859606,0.00041873075,0.94707245,0.00033712818,0.00055739976,0.00039287357,0.00015018287,0.00528401,0.0071912957],"genre_scores_gemma":[0.6226376,0.00025985113,0.36762893,0.0003402747,0.0002411931,0.00026357532,0.00023126973,0.00016821973,0.008229003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953413,0.000073399046,0.00003155526,0.00013705608,0.00014956322,0.00007434042],"domain_scores_gemma":[0.99919933,0.00016496964,0.00004383303,0.00016438196,0.00030849525,0.00011895684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008236843,0.0007338148,0.000814213,0.0011908839,0.0012524097,0.0015889754,0.0025909203,0.0010000722,0.0065164804],"category_scores_gemma":[0.0016060118,0.00030223918,0.00033810365,0.00049282034,0.0006215673,0.0014539334,0.0010046829,0.0012120174,0.00093814236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020355643,0.0010100837,0.0021698517,0.0003680323,0.00026611387,0.0004069836,0.00045923164,0.17484836,0.112585135,0.08293511,0.021702427,0.60121304],"study_design_scores_gemma":[0.00012833727,0.00046759046,0.00036881366,0.000022379823,0.00009986342,0.0001541827,0.00004252197,0.95587444,0.020057114,0.010383762,0.012347151,0.000053851985],"about_ca_topic_score_codex":0.0028941694,"about_ca_topic_score_gemma":0.0044021374,"teacher_disagreement_score":0.0065164804,"about_ca_system_score_codex":0.0008280452,"about_ca_system_score_gemma":0.0013658056,"threshold_uncertainty_score":0.021799803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114414595,0.0030849257,0.87561756,0.00060922455,0.00005080135,0.000049203572,0.000051315008,0.0004244946,0.005697806],"genre_scores_gemma":[0.95491856,0.0016514441,0.041942466,0.0000406133,0.00008258536,0.000050706916,0.000052604002,0.00005092208,0.0012102243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883825,0.0004981043,0.000026442707,0.000098412274,0.00039516416,0.00014366227],"domain_scores_gemma":[0.9967235,0.0022394976,0.00029390608,0.00024747604,0.00043623606,0.000059399237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002404026,0.0010034287,0.00053610775,0.0008140943,0.00043367984,0.0010407954,0.0006933949,0.00077782804,0.00095012184],"category_scores_gemma":[0.0075582815,0.00035015476,0.00025179007,0.0010122798,0.0010729561,0.001385317,0.0007218582,0.0008476134,0.00025672602],"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.00008295197,0.000022183787,0.0005045391,0.000042559674,0.00001865511,0.000029071962,0.000040902432,0.949908,0.002999396,0.019154312,0.00038664608,0.026810829],"study_design_scores_gemma":[0.0000030587867,0.00002791829,0.00010801379,0.000004374237,0.0000050794038,0.000025423238,0.0000056645335,0.9948449,0.000850331,0.0039496636,0.00017112223,0.0000044221283],"about_ca_topic_score_codex":0.0022886556,"about_ca_topic_score_gemma":0.0013888375,"teacher_disagreement_score":0.002404026,"about_ca_system_score_codex":0.0016560339,"about_ca_system_score_gemma":0.00078868965,"threshold_uncertainty_score":0.01271385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050079312,0.00025094842,0.9479321,0.00035869703,0.000048947484,0.000025299756,0.00016344326,0.00025453372,0.00088675605],"genre_scores_gemma":[0.6087877,0.0011690506,0.3859215,0.00017256194,0.0002132779,0.00013026033,0.0011169811,0.00008338092,0.0024051992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.000119026416,0.000026372722,0.000050347073,0.00017897587,0.000033156783],"domain_scores_gemma":[0.9980831,0.0012984066,0.00014552106,0.00024921214,0.0001954897,0.00002822938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008229402,0.00040952335,0.00037194366,0.0007222415,0.0001993796,0.00055226224,0.00044007128,0.00059313606,0.0007777954],"category_scores_gemma":[0.00588263,0.00022470135,0.00028115456,0.0010713005,0.00056367915,0.0009789892,0.0005523075,0.0010444496,0.00028597316],"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.0002928643,0.00009589207,0.0014240572,0.00015887254,0.00004380573,0.0002236193,0.00023537145,0.7119221,0.029725073,0.03779238,0.003674361,0.21441162],"study_design_scores_gemma":[0.0000042476254,0.000014427891,0.00022680807,0.00000421093,0.0000021375763,0.00003279371,0.000010539828,0.99312276,0.002344202,0.0037614175,0.00047241006,0.0000040881905],"about_ca_topic_score_codex":0.0015150085,"about_ca_topic_score_gemma":0.0012045446,"teacher_disagreement_score":0.0015150085,"about_ca_system_score_codex":0.0003226376,"about_ca_system_score_gemma":0.00026737648,"threshold_uncertainty_score":0.004352212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053949796,0.0006811761,0.93813574,0.00020042418,0.00011915147,0.00024428763,0.00010297627,0.0010357988,0.005530655],"genre_scores_gemma":[0.84770465,0.0004242696,0.14884746,0.0001323917,0.000096359545,0.00018951506,0.00010181198,0.000069155365,0.002434349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00019649592,0.000030675197,0.0001225567,0.00034731504,0.00017481309],"domain_scores_gemma":[0.998901,0.00036097682,0.00011712966,0.00010145179,0.00044491465,0.000074450225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014724103,0.0007750634,0.00089890364,0.0008032202,0.0007535061,0.0016077858,0.0025942558,0.00057594053,0.0029478592],"category_scores_gemma":[0.001514547,0.0005637562,0.0005392513,0.00074314425,0.0005608115,0.0010551648,0.0005148052,0.0008430106,0.00030953565],"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.00048439854,0.00032328023,0.0019552703,0.00023499319,0.00018727769,0.00011526647,0.00013693965,0.78353375,0.038677394,0.08133144,0.0032098063,0.089810215],"study_design_scores_gemma":[0.000019266135,0.000091051625,0.0002287353,0.000004629366,0.000038117458,0.000030168809,0.0000086321315,0.99110764,0.0043788655,0.0033451938,0.0007383729,0.000009420553],"about_ca_topic_score_codex":0.004790925,"about_ca_topic_score_gemma":0.0062375134,"teacher_disagreement_score":0.004790925,"about_ca_system_score_codex":0.0026041858,"about_ca_system_score_gemma":0.0028425853,"threshold_uncertainty_score":0.018894792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018751405,0.0014775356,0.97589475,0.00021904922,0.00025097164,0.00007542438,0.000043136883,0.00089598866,0.0023917013],"genre_scores_gemma":[0.9099357,0.0014204847,0.082905926,0.0002359743,0.00027594954,0.00016679328,0.00009398062,0.00008934078,0.004875851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988607,0.00019239646,0.00005651948,0.00017788689,0.0006098605,0.00010261662],"domain_scores_gemma":[0.9978623,0.00094938616,0.00032560574,0.0001989014,0.0006073528,0.00005646331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015265776,0.000574136,0.0005802938,0.0004287337,0.0004467996,0.001448803,0.0014905347,0.00091093447,0.0024883377],"category_scores_gemma":[0.005988976,0.00020680328,0.00029804796,0.00056323846,0.00055522216,0.0014614912,0.0005813393,0.0013666227,0.0004857747],"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.00040318505,0.0001187395,0.000988663,0.00040226887,0.000102426944,0.00024720735,0.00013289167,0.66365516,0.040824108,0.11277907,0.004257062,0.17608924],"study_design_scores_gemma":[0.000020898537,0.00008998062,0.00014724271,0.00001123639,0.000013576519,0.00006857506,0.000008402708,0.9807068,0.0039329855,0.012715979,0.0022653348,0.000019009689],"about_ca_topic_score_codex":0.0012336164,"about_ca_topic_score_gemma":0.0006734328,"teacher_disagreement_score":0.0024883377,"about_ca_system_score_codex":0.0008589743,"about_ca_system_score_gemma":0.0007576885,"threshold_uncertainty_score":0.008324325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3496812,0.0021244057,0.6115043,0.006399806,0.00016486022,0.00038794565,0.00020312876,0.0010782194,0.02845609],"genre_scores_gemma":[0.94454753,0.0006921754,0.052911744,0.00024359627,0.00009080713,0.00016590481,0.00011098094,0.00012581606,0.0011115555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99114776,0.0047603315,0.00048195964,0.00079607643,0.0023451445,0.00046868934],"domain_scores_gemma":[0.9701241,0.01849064,0.0032892174,0.0030075116,0.0045637097,0.0005247917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011375407,0.0006637464,0.0006562212,0.0027011954,0.0014000982,0.007438438,0.0030252018,0.0020986511,0.0021251068],"category_scores_gemma":[0.048324775,0.0007706066,0.00032261948,0.0022814178,0.0038267025,0.010221522,0.0021720177,0.002287578,0.00039236835],"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.00022105583,0.0005046794,0.042584796,0.0011468375,0.00011580569,0.0020215516,0.014928258,0.14612438,0.020010559,0.57413286,0.0065538357,0.19165544],"study_design_scores_gemma":[0.00005245322,0.0002686377,0.011592569,0.0005311798,0.0000610797,0.0010529031,0.009508121,0.6066586,0.014715356,0.32725433,0.028206794,0.0000979204],"about_ca_topic_score_codex":0.0024565393,"about_ca_topic_score_gemma":0.0016880198,"teacher_disagreement_score":0.011375407,"about_ca_system_score_codex":0.002911763,"about_ca_system_score_gemma":0.0019410446,"threshold_uncertainty_score":0.060159624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14547518,0.0005429812,0.83514625,0.00041146006,0.0002619108,0.00026901418,0.00009658473,0.0072106402,0.010586015],"genre_scores_gemma":[0.9323398,0.00012670473,0.06226232,0.00016328586,0.00014266408,0.000119195516,0.00010770267,0.00013141175,0.0046068826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00019298177,0.000054989574,0.00013047257,0.00031622412,0.00011376785],"domain_scores_gemma":[0.9990414,0.00019566096,0.00008187497,0.00024336518,0.00029577754,0.0001418673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078270154,0.000462141,0.00047119928,0.0009170548,0.0009581604,0.0010513244,0.0014047702,0.0006155015,0.0033475982],"category_scores_gemma":[0.0017521932,0.00020629517,0.00019800816,0.0006892298,0.0005193863,0.0013233596,0.0013802962,0.0009106945,0.0009046661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017303821,0.0009686589,0.002755559,0.0002015666,0.00010864788,0.00050310907,0.0006260732,0.15739329,0.19967021,0.05458118,0.010738064,0.57072324],"study_design_scores_gemma":[0.00016303484,0.00016588993,0.0008495837,0.000015989479,0.000034192864,0.00016346983,0.000046305762,0.9425068,0.026371539,0.017595794,0.012038833,0.000048513124],"about_ca_topic_score_codex":0.0009103406,"about_ca_topic_score_gemma":0.00071074354,"teacher_disagreement_score":0.0033475982,"about_ca_system_score_codex":0.00066745566,"about_ca_system_score_gemma":0.00041911838,"threshold_uncertainty_score":0.011198878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19391595,0.021838881,0.7054909,0.0013695762,0.0019029803,0.002035877,0.00033073555,0.014059961,0.059055116],"genre_scores_gemma":[0.8504212,0.0027892438,0.14069133,0.0004703499,0.00034657473,0.0003693208,0.00029116438,0.00024453696,0.004376334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976254,0.0003909179,0.0001617256,0.00032614835,0.0012436177,0.00025224098],"domain_scores_gemma":[0.9978138,0.00039695585,0.00016245911,0.0003894594,0.0010828516,0.0001542958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022961283,0.0007574441,0.0006180368,0.0008081202,0.00082677073,0.0020900706,0.0021187016,0.000819052,0.0011066709],"category_scores_gemma":[0.005309555,0.0005348155,0.0003486985,0.0005349936,0.0005376311,0.0023586887,0.0012498992,0.0019731477,0.00035482922],"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.0011519685,0.00082152936,0.014398211,0.0018975108,0.00046906457,0.0010297528,0.00076476246,0.104388095,0.10937023,0.056631777,0.018617252,0.69045985],"study_design_scores_gemma":[0.0002318229,0.0013527755,0.00503058,0.00028913352,0.00083822693,0.0021768748,0.00022038892,0.72946334,0.13726652,0.01502971,0.10781505,0.00028556507],"about_ca_topic_score_codex":0.002513813,"about_ca_topic_score_gemma":0.0026919432,"teacher_disagreement_score":0.002513813,"about_ca_system_score_codex":0.0009954035,"about_ca_system_score_gemma":0.0013031345,"threshold_uncertainty_score":0.012143254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6821129,0.0010970446,0.30858037,0.00038292896,0.000040120147,0.00052900874,0.00017162054,0.0010290621,0.006056931],"genre_scores_gemma":[0.84225273,0.00060378923,0.15529546,0.000058999234,0.000025920019,0.00017644027,0.00016431228,0.00008156357,0.0013407894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587774,0.002107312,0.00022041264,0.00024422945,0.0012890195,0.00026115007],"domain_scores_gemma":[0.9954125,0.0015327287,0.00026591658,0.00048605766,0.0020599565,0.00024279405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006382733,0.00050691346,0.00038941822,0.0005084746,0.00037431394,0.0011616594,0.0018369404,0.00073830714,0.00065524905],"category_scores_gemma":[0.0064892313,0.00022400505,0.00015902135,0.00069249584,0.000612336,0.0008616606,0.0005077592,0.0006991059,0.00023695426],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012877623,0.0031893328,0.021005213,0.00084551226,0.000121371835,0.0006152729,0.0036951334,0.072299585,0.31264403,0.0071528233,0.0021593259,0.5749846],"study_design_scores_gemma":[0.00024654268,0.011510218,0.018904444,0.00020544133,0.0001398508,0.0012926304,0.0016374504,0.2430123,0.6984021,0.0028351217,0.021638587,0.00017533025],"about_ca_topic_score_codex":0.0018860956,"about_ca_topic_score_gemma":0.0010848101,"teacher_disagreement_score":0.006382733,"about_ca_system_score_codex":0.0008125331,"about_ca_system_score_gemma":0.00041801672,"threshold_uncertainty_score":0.03375554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1709359,0.0071845404,0.54880714,0.034394544,0.004699336,0.00038698208,0.0010855116,0.0049035493,0.22760245],"genre_scores_gemma":[0.95532024,0.0012676977,0.025624854,0.00230866,0.0018303326,0.0002446242,0.00020238404,0.00063992204,0.012561308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911062,0.0025229098,0.00027395968,0.0011071687,0.0031968514,0.0017928383],"domain_scores_gemma":[0.9539473,0.028680703,0.0017328208,0.0077889715,0.0055577853,0.0022923592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007708216,0.0018617591,0.0040124515,0.0021240837,0.0044038347,0.01096319,0.0053001773,0.005687333,0.01801483],"category_scores_gemma":[0.057305127,0.0014070421,0.0013952439,0.0029174874,0.004784611,0.016866738,0.006277828,0.007146723,0.0027795976],"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.0012241795,0.0002502291,0.0011364161,0.00033052673,0.00012261419,0.00019053025,0.00018085241,0.059839565,0.003487995,0.8535193,0.02942275,0.05029511],"study_design_scores_gemma":[0.00011327487,0.00014679115,0.00028484172,0.00004471364,0.000076130134,0.00026797986,0.00009071717,0.3346487,0.0010514248,0.65304387,0.010179826,0.000051728734],"about_ca_topic_score_codex":0.0042591747,"about_ca_topic_score_gemma":0.0035046807,"teacher_disagreement_score":0.01801483,"about_ca_system_score_codex":0.004711835,"about_ca_system_score_gemma":0.0058528343,"threshold_uncertainty_score":0.0602656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972601,0.00008682343,0.0014152,0.000058203725,0.000015334179,0.000019058394,0.00003338561,0.000070133545,0.0010418101],"genre_scores_gemma":[0.9988268,0.00005380491,0.00074400124,0.00004156659,0.000006071055,0.0000068081285,0.00003686046,0.000010998199,0.00027299282],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99942774,0.00011996974,0.000022375953,0.00006871016,0.00020579311,0.00015536806],"domain_scores_gemma":[0.99766797,0.0013552484,0.00019296906,0.00020156018,0.0003637084,0.00021853167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047917798,0.0003857728,0.00029253244,0.0004921399,0.00056696514,0.00054836296,0.0003993703,0.00054675236,0.001199437],"category_scores_gemma":[0.0037517692,0.00015908472,0.00015356665,0.0002538302,0.00048438067,0.0007023193,0.00044513887,0.00056739926,0.00014459479],"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.0029173978,0.0009273023,0.01929985,0.00020163265,0.00011076463,0.0010205035,0.0007294622,0.056600478,0.8771962,0.0016118272,0.0009325809,0.038452037],"study_design_scores_gemma":[0.00020945565,0.005212928,0.042161953,0.000089337154,0.00016980153,0.0012640577,0.0012252263,0.3049571,0.640711,0.001395843,0.0025035364,0.00009980527],"about_ca_topic_score_codex":0.0026824547,"about_ca_topic_score_gemma":0.0017840085,"teacher_disagreement_score":0.0026824547,"about_ca_system_score_codex":0.0005107937,"about_ca_system_score_gemma":0.00021217,"threshold_uncertainty_score":0.005333662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08116492,0.0004912397,0.9111772,0.00038580946,0.000097625525,0.000053649892,0.00007554844,0.00032682795,0.006227136],"genre_scores_gemma":[0.9868767,0.000074623036,0.012042865,0.000028046827,0.000017517226,0.000029929328,0.000028374132,0.000014879457,0.0008870474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875855,0.0003377622,0.00006696757,0.00025474458,0.00036208337,0.00021998149],"domain_scores_gemma":[0.9941929,0.003510703,0.0006225906,0.00035038745,0.0011850296,0.0001383996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030392304,0.0008085866,0.0009359479,0.00088755204,0.000715317,0.0022257713,0.0010600433,0.0009879468,0.0020122458],"category_scores_gemma":[0.011533987,0.0004298503,0.00041982255,0.00050120556,0.0011515525,0.0013440147,0.0019254924,0.0011774197,0.00021379886],"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.00043625233,0.000043865468,0.0006805836,0.0001517157,0.00004133418,0.00008213183,0.00013930276,0.9504483,0.0033682592,0.020952312,0.00054922095,0.02310673],"study_design_scores_gemma":[0.000005545162,0.000017703258,0.000092366325,0.0000049879122,0.00000479179,0.0000054292964,0.0000068059812,0.9971661,0.0006015934,0.0019935085,0.00009656442,0.0000046788687],"about_ca_topic_score_codex":0.0053858985,"about_ca_topic_score_gemma":0.002899377,"teacher_disagreement_score":0.0053858985,"about_ca_system_score_codex":0.001379961,"about_ca_system_score_gemma":0.0010699292,"threshold_uncertainty_score":0.016073167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009093555,0.00016312664,0.987316,0.00011565237,0.00008166439,0.00006278886,0.0000133380845,0.0006006479,0.002553261],"genre_scores_gemma":[0.8501611,0.00018782771,0.14675662,0.0002270759,0.00012058173,0.00016639597,0.00003164482,0.000041872874,0.0023068176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996068,0.000058148722,0.000025140977,0.00009908916,0.00017326855,0.00003756419],"domain_scores_gemma":[0.9996451,0.000076897435,0.000059633432,0.000025663212,0.00017339007,0.000019368837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046237148,0.0004845058,0.000369664,0.0002793398,0.00032781268,0.0007602771,0.0009934896,0.00048097875,0.0016285147],"category_scores_gemma":[0.00073226047,0.00018446788,0.0002485268,0.00016208537,0.00031078616,0.00039135024,0.00034281643,0.0007537582,0.00050251867],"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.00047056278,0.00030406806,0.0011674921,0.00043621665,0.0001398863,0.00034104282,0.00029190644,0.4358884,0.20616877,0.027863909,0.003843188,0.32308456],"study_design_scores_gemma":[0.0000669052,0.00029938028,0.00017394268,0.00001033225,0.00003058196,0.00008403885,0.000010663891,0.97016853,0.025042456,0.00135059,0.0027445497,0.00001794843],"about_ca_topic_score_codex":0.00089566683,"about_ca_topic_score_gemma":0.0010311479,"teacher_disagreement_score":0.0016285147,"about_ca_system_score_codex":0.0003913245,"about_ca_system_score_gemma":0.00045599413,"threshold_uncertainty_score":0.005447924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9147745,0.00028057303,0.07933931,0.00005012846,0.000029989702,0.000040804312,0.00029857075,0.0031439313,0.0020423154],"genre_scores_gemma":[0.99292785,0.00009536715,0.006148893,0.000008197506,0.000005413846,0.000018477049,0.00022928456,0.000070567956,0.0004959861],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00007422431,0.00003184299,0.00011985658,0.00018549664,0.000105112296],"domain_scores_gemma":[0.9985453,0.00060431455,0.00020143676,0.00016830831,0.0004144471,0.00006625641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064010953,0.0004933707,0.00039810187,0.0018270435,0.00027765826,0.0005084896,0.0006851393,0.00021016646,0.0016956207],"category_scores_gemma":[0.0023385698,0.000249466,0.00014979669,0.0010658432,0.00024751236,0.0014911281,0.00030907002,0.0003364031,0.00027443634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034001134,0.00058370247,0.09910912,0.00055296265,0.0002459914,0.00073325855,0.0007012513,0.15449761,0.43719575,0.006509222,0.003478865,0.29299206],"study_design_scores_gemma":[0.000019897974,0.00037901412,0.0328115,0.00002093619,0.000061107625,0.00027427444,0.00015911904,0.7694775,0.19326322,0.0015630838,0.0019154655,0.000054893764],"about_ca_topic_score_codex":0.0020372954,"about_ca_topic_score_gemma":0.0012464569,"teacher_disagreement_score":0.0020372954,"about_ca_system_score_codex":0.0008150113,"about_ca_system_score_gemma":0.0003596194,"threshold_uncertainty_score":0.005913317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7780525,0.003286249,0.13720642,0.0007156368,0.0004695009,0.001105866,0.0017175177,0.06160351,0.015842779],"genre_scores_gemma":[0.9776474,0.0003209938,0.018220026,0.00023574839,0.000055099015,0.00019177179,0.00053874287,0.00039701627,0.0023930976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918836,0.000114927454,0.000061052706,0.00014193961,0.00030801943,0.0001856496],"domain_scores_gemma":[0.9981147,0.0005341126,0.00026867667,0.00037831208,0.0004765063,0.00022770891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085120584,0.00091862713,0.0005951945,0.0010515547,0.00054445607,0.0008867143,0.0024032015,0.00070500403,0.0021659422],"category_scores_gemma":[0.0043909373,0.0002833234,0.0002540074,0.00044861634,0.0006067083,0.0017933762,0.0015716659,0.00096725504,0.0004995903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056705396,0.0017384487,0.030782433,0.0017115684,0.000574138,0.002725672,0.0010340948,0.1045585,0.37806946,0.008121922,0.06752425,0.39748892],"study_design_scores_gemma":[0.000675007,0.0025799586,0.020204272,0.00015757928,0.00017434054,0.0017149155,0.00024587693,0.68046093,0.26100144,0.0023987025,0.030046849,0.00034013565],"about_ca_topic_score_codex":0.006226386,"about_ca_topic_score_gemma":0.0049453946,"teacher_disagreement_score":0.006226386,"about_ca_system_score_codex":0.00087678846,"about_ca_system_score_gemma":0.000646637,"threshold_uncertainty_score":0.012380302},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008539731,0.0028538017,0.6676109,0.004122888,0.004123297,0.0009898432,0.0018973596,0.04125361,0.26860854],"genre_scores_gemma":[0.18452324,0.0028932572,0.3660207,0.0024045778,0.0021064465,0.0010330752,0.008972557,0.0051436243,0.42690244],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870527,0.00029673908,0.000100567544,0.00020500463,0.000529208,0.00016319254],"domain_scores_gemma":[0.99874085,0.00011824086,0.00007269417,0.0005467556,0.0003454379,0.00017599869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020277433,0.00047137248,0.0005244623,0.0012105221,0.0011797537,0.003294086,0.0017097506,0.0012792911,0.033344913],"category_scores_gemma":[0.0020500899,0.0003660779,0.00028497484,0.0013337535,0.0010863806,0.0030716443,0.0017896302,0.0012286614,0.024491493],"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.00022301507,0.00020696712,0.00069937896,0.00018081766,0.000016623764,0.00039174382,0.00021162721,0.004228782,0.016621102,0.1292842,0.35135615,0.49657956],"study_design_scores_gemma":[0.00004520627,0.00012466792,0.0014893364,0.0001070381,0.000012259432,0.00044697398,0.000076149045,0.06740932,0.020776818,0.024208197,0.88524544,0.00005856551],"about_ca_topic_score_codex":0.0037089123,"about_ca_topic_score_gemma":0.0038810922,"teacher_disagreement_score":0.033344913,"about_ca_system_score_codex":0.0019262708,"about_ca_system_score_gemma":0.0013671616,"threshold_uncertainty_score":0.111549914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60702,0.012312645,0.35178006,0.0018828395,0.00090677466,0.0001996364,0.00030930966,0.008788078,0.01680071],"genre_scores_gemma":[0.97587943,0.0023296687,0.019204024,0.00010584354,0.0006356572,0.00004982507,0.00017565809,0.00018982738,0.0014299334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982461,0.00037981773,0.00012562024,0.00020150896,0.0007177678,0.00032918545],"domain_scores_gemma":[0.99231976,0.0036385122,0.0008372613,0.0017180936,0.0011555044,0.00033078928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023777536,0.0015173814,0.00091681804,0.0013149375,0.0011298632,0.0019286539,0.0023974355,0.0015340508,0.0014840942],"category_scores_gemma":[0.021457147,0.0005497309,0.00033719977,0.0017735326,0.0011659547,0.0041050785,0.0020028604,0.0019985056,0.00079477014],"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.0018807239,0.0007203119,0.015329929,0.0009726237,0.000259137,0.0011762851,0.0007453113,0.48662302,0.08644208,0.012030729,0.011553542,0.38226625],"study_design_scores_gemma":[0.00023952183,0.0012632294,0.0082590245,0.00009971005,0.00032149773,0.0013920937,0.00023289959,0.9126947,0.0480349,0.018925693,0.008415962,0.00012069855],"about_ca_topic_score_codex":0.0019372358,"about_ca_topic_score_gemma":0.0012195423,"teacher_disagreement_score":0.0023974355,"about_ca_system_score_codex":0.0006329857,"about_ca_system_score_gemma":0.0010627335,"threshold_uncertainty_score":0.012574911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09211369,0.00026882818,0.82671064,0.00029327968,0.00023163081,0.00044011322,0.0003330487,0.058214933,0.021393878],"genre_scores_gemma":[0.7588093,0.0002536959,0.21698765,0.00030603292,0.00021079138,0.00041653274,0.0010991415,0.00079227786,0.021124652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991493,0.00012954004,0.000057196183,0.0002114644,0.00035674224,0.00009571363],"domain_scores_gemma":[0.9987041,0.0002128986,0.00007777587,0.00042019127,0.00039949562,0.00018553095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866271,0.0005171529,0.00066793704,0.0007881742,0.00081931823,0.0010647882,0.001777173,0.0005106941,0.006392829],"category_scores_gemma":[0.0017817366,0.0002770054,0.00023717103,0.00066317664,0.00039989318,0.001094606,0.0015072081,0.0008096818,0.0018063732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001644961,0.0015001657,0.006570206,0.0002187714,0.0000870905,0.00066451717,0.00054153724,0.09902861,0.15775707,0.035148285,0.03760934,0.6592294],"study_design_scores_gemma":[0.00043616895,0.00076421734,0.0021420326,0.000028896104,0.00009917394,0.0006495429,0.00007367915,0.8322305,0.06847023,0.010272812,0.08472669,0.00010598663],"about_ca_topic_score_codex":0.0014545157,"about_ca_topic_score_gemma":0.0008570203,"teacher_disagreement_score":0.006392829,"about_ca_system_score_codex":0.00067705906,"about_ca_system_score_gemma":0.0008628803,"threshold_uncertainty_score":0.021386147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5595273,0.001757081,0.40868473,0.0015267263,0.00031500892,0.00014632815,0.0005022648,0.0043594893,0.02318111],"genre_scores_gemma":[0.98303705,0.00015562752,0.0141899,0.0000988545,0.00008392769,0.000015174133,0.00022266565,0.000058575333,0.0021382142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.00003643955,0.000013659007,0.00003778389,0.00008854807,0.000063342406],"domain_scores_gemma":[0.9990767,0.00025838363,0.00006183991,0.00016069497,0.00034259236,0.000099682286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043205224,0.0003835429,0.0002857415,0.00045888097,0.00059585663,0.000957163,0.0006974818,0.00042475038,0.0020984306],"category_scores_gemma":[0.0020262569,0.00016059818,0.000097966,0.0002970919,0.00024062335,0.0011028575,0.00065167894,0.0010175577,0.00039772122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029958626,0.0010272912,0.006437029,0.00018397004,0.000064346816,0.0009592545,0.0005189344,0.085681744,0.39150512,0.023779603,0.014744593,0.47210222],"study_design_scores_gemma":[0.00007895395,0.00028426145,0.0038576196,0.000022462656,0.000044800494,0.00034055664,0.00019497599,0.9184036,0.05599353,0.011083249,0.009649338,0.000046641955],"about_ca_topic_score_codex":0.0013628204,"about_ca_topic_score_gemma":0.002699929,"teacher_disagreement_score":0.0020984306,"about_ca_system_score_codex":0.00039240374,"about_ca_system_score_gemma":0.0003230294,"threshold_uncertainty_score":0.0070199966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26248723,0.0012349216,0.70215213,0.0005355146,0.0002645379,0.00078529114,0.00026733757,0.023023747,0.009249281],"genre_scores_gemma":[0.9260875,0.00036486858,0.070000045,0.00023007146,0.00013140331,0.00017509659,0.0003004285,0.00059398974,0.0021165756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852246,0.00025610873,0.00011573366,0.00026682726,0.00061307475,0.00022584517],"domain_scores_gemma":[0.99471635,0.001854406,0.00079529,0.0011252626,0.001161205,0.0003474857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018881038,0.0010561494,0.00072437973,0.0011873433,0.0005807179,0.0016812179,0.0028134394,0.00092166936,0.00091741135],"category_scores_gemma":[0.0066582668,0.0005759589,0.00046411945,0.0008599579,0.0009975495,0.0013977368,0.001656011,0.0011816156,0.000518713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014868157,0.000994773,0.019701777,0.0008893381,0.0003897263,0.0012304062,0.0010777778,0.14514825,0.4136738,0.017408015,0.013400416,0.38459882],"study_design_scores_gemma":[0.00021773417,0.0010363215,0.010034918,0.000053491596,0.00022599225,0.0009621011,0.00016608475,0.8435056,0.11648473,0.008085769,0.018977743,0.00024940883],"about_ca_topic_score_codex":0.002291652,"about_ca_topic_score_gemma":0.0013765267,"teacher_disagreement_score":0.0028134394,"about_ca_system_score_codex":0.00051769195,"about_ca_system_score_gemma":0.0011198603,"threshold_uncertainty_score":0.009985387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17648509,0.0004225376,0.8144728,0.0005817655,0.000083501036,0.00019489443,0.00021761109,0.00072028226,0.006821535],"genre_scores_gemma":[0.93741196,0.0003471801,0.059413347,0.00003189751,0.000041970936,0.000181932,0.0001026512,0.000047973055,0.0024209935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00012617972,0.000028293925,0.000075372365,0.00014704568,0.00008189523],"domain_scores_gemma":[0.9983766,0.0009906562,0.00018428107,0.000103778875,0.00028019818,0.00006452584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894331,0.00084015896,0.00051565946,0.0007544093,0.0005968072,0.0011251629,0.0016269579,0.0013293296,0.0010250718],"category_scores_gemma":[0.0028213032,0.0004988432,0.0006326809,0.0006951712,0.00085068727,0.0014261989,0.00058030157,0.0011548443,0.00013686345],"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.00001399205,0.000020036954,0.00031095895,0.000010883135,0.0000048492343,0.000028716751,0.000026990789,0.9925292,0.0006501831,0.0038051084,0.00010534126,0.0024937463],"study_design_scores_gemma":[0.0000017985927,0.000004811485,0.000024896595,9.5232645e-7,0.0000016193255,0.0000036236784,0.0000026879065,0.9992079,0.00013860525,0.00054256833,0.0000688384,0.0000016761752],"about_ca_topic_score_codex":0.022999298,"about_ca_topic_score_gemma":0.01021818,"teacher_disagreement_score":0.022999298,"about_ca_system_score_codex":0.0015266213,"about_ca_system_score_gemma":0.0017453857,"threshold_uncertainty_score":0.04573083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11355037,0.00025058753,0.8802041,0.00019503814,0.00025396293,0.000096646785,0.00002380174,0.0014083128,0.0040171705],"genre_scores_gemma":[0.94087595,0.00003140043,0.058361616,0.00010139692,0.0000462125,0.000040625022,0.000011185345,0.00003381811,0.000497775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997893,0.000039280283,0.000018542947,0.000062438,0.00006337107,0.0000270334],"domain_scores_gemma":[0.99946636,0.00021343734,0.00007796644,0.00005539531,0.00015188892,0.000034961282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060341915,0.00043070756,0.00033118075,0.00054685527,0.0004904666,0.00068023434,0.0007143285,0.00039334022,0.0017445708],"category_scores_gemma":[0.0020416647,0.00019497184,0.00014235581,0.00026280902,0.00029060658,0.00048581758,0.00038640088,0.00072992855,0.0002528013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022221685,0.00070657255,0.0047430475,0.00022438998,0.00013123848,0.0002298666,0.00044288006,0.1038332,0.27959502,0.012363363,0.0030264868,0.59248173],"study_design_scores_gemma":[0.0002252861,0.00037141415,0.0012846978,0.000015987483,0.000057348465,0.00013811579,0.00003103629,0.945073,0.04795696,0.0031424116,0.0016792116,0.000024585046],"about_ca_topic_score_codex":0.0006772204,"about_ca_topic_score_gemma":0.0012763949,"teacher_disagreement_score":0.0017445708,"about_ca_system_score_codex":0.00041011893,"about_ca_system_score_gemma":0.00037968578,"threshold_uncertainty_score":0.005836189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48919192,0.0007451819,0.50539416,0.00017209021,0.00005209668,0.00010135473,0.000032586686,0.00041839285,0.0038922762],"genre_scores_gemma":[0.9841888,0.00006128135,0.015457023,0.000021079957,0.0000057056886,0.000020805715,0.000010240477,0.000012018422,0.00022307965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953616,0.0001648585,0.000018268465,0.000050603318,0.00014089131,0.0000893698],"domain_scores_gemma":[0.99910045,0.0005449284,0.00009878107,0.0000712124,0.0001243175,0.00006039276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010116623,0.00032955053,0.00029401266,0.00055308425,0.0003410916,0.00063489104,0.0006843432,0.00025036978,0.00055544474],"category_scores_gemma":[0.0030696208,0.00016593354,0.00013720017,0.00035201182,0.00064309785,0.0005585353,0.00048119633,0.00033703021,0.00008703672],"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.0009841687,0.00026053187,0.003262297,0.000108058804,0.00004526804,0.0002553875,0.00020058903,0.77204955,0.06065763,0.024697997,0.00082079315,0.13665766],"study_design_scores_gemma":[0.000024296205,0.00009180894,0.0005009413,0.0000039900833,0.000008553972,0.000038981383,0.000021265965,0.9899414,0.006564807,0.0024720957,0.00032288744,0.000009016229],"about_ca_topic_score_codex":0.0021216392,"about_ca_topic_score_gemma":0.0017603398,"teacher_disagreement_score":0.0021216392,"about_ca_system_score_codex":0.0011448043,"about_ca_system_score_gemma":0.00043865084,"threshold_uncertainty_score":0.008306205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39207923,0.011152072,0.57421494,0.0018376653,0.00047893514,0.00031485056,0.00019007939,0.00059724407,0.019135056],"genre_scores_gemma":[0.9921929,0.0011195741,0.005835908,0.000087741166,0.000103572354,0.000042094256,0.000017753884,0.000021791715,0.00057864154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770594,0.0010405467,0.00008149182,0.00032178307,0.00050187536,0.00034837401],"domain_scores_gemma":[0.9870024,0.009617713,0.0010987334,0.00056001375,0.0010940701,0.0006270786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003484146,0.0010611432,0.0012077729,0.0009850702,0.00096697954,0.0022137254,0.0016677886,0.0013342199,0.00074701995],"category_scores_gemma":[0.015047526,0.00060746423,0.00046242063,0.00086685776,0.0019408755,0.0031975505,0.0013813929,0.0013997676,0.0001434864],"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.00054644514,0.00021408919,0.003828104,0.00028550002,0.00008722393,0.0002780674,0.00022053086,0.9208346,0.0062069693,0.04065219,0.0018725682,0.02497365],"study_design_scores_gemma":[0.000037511098,0.00032566735,0.00050130574,0.000033922275,0.000043685817,0.00014695547,0.000056805868,0.9828608,0.0013083598,0.013749735,0.00091412436,0.00002117369],"about_ca_topic_score_codex":0.0020433073,"about_ca_topic_score_gemma":0.00071500655,"teacher_disagreement_score":0.003484146,"about_ca_system_score_codex":0.001794212,"about_ca_system_score_gemma":0.0009639996,"threshold_uncertainty_score":0.01842612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90313864,0.001614291,0.08546684,0.00050527824,0.00004790699,0.00007677852,0.00008318134,0.00012571152,0.008941362],"genre_scores_gemma":[0.99538344,0.00023433026,0.0035116002,0.00001886476,0.000018086383,0.000010248427,0.000025444084,0.000010901865,0.00078713626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991412,0.0003443184,0.000021869822,0.00007589713,0.00027832107,0.00013831514],"domain_scores_gemma":[0.9928803,0.005675328,0.00034661696,0.00015445756,0.00078337453,0.00015996383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021410824,0.0004853873,0.0003872202,0.0006529282,0.00028651598,0.00061582273,0.00041669505,0.00043206214,0.0014816265],"category_scores_gemma":[0.009395558,0.00016690929,0.00016428005,0.0005559084,0.00042386435,0.0009930497,0.00030320254,0.00046257203,0.00010557806],"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.001055516,0.0002599478,0.005726612,0.00019718854,0.0001447509,0.0003458051,0.0002860241,0.84887916,0.050527945,0.027097736,0.0014381482,0.06404119],"study_design_scores_gemma":[0.000014347562,0.0005103754,0.0011879283,0.000007612712,0.00002844344,0.0001550882,0.00009220316,0.9883377,0.006405496,0.0027654436,0.00048244154,0.000013029102],"about_ca_topic_score_codex":0.0020639717,"about_ca_topic_score_gemma":0.0011767027,"teacher_disagreement_score":0.0021410824,"about_ca_system_score_codex":0.0013011787,"about_ca_system_score_gemma":0.00045068294,"threshold_uncertainty_score":0.011323273},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045140027,0.0013434113,0.9590456,0.00078219525,0.0013687952,0.00057993265,0.0008666183,0.0071307872,0.024368599],"genre_scores_gemma":[0.2053959,0.004520975,0.7167994,0.0020203853,0.001445905,0.0012640802,0.0074108746,0.0032744135,0.057868093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972144,0.0006554117,0.0003015694,0.00039181026,0.0011432141,0.00029363585],"domain_scores_gemma":[0.9949373,0.0009925237,0.0004139677,0.002211045,0.0012040847,0.00024106899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021068798,0.0010820538,0.0010337741,0.0017419097,0.0012739422,0.0033172483,0.002390051,0.001727096,0.016540924],"category_scores_gemma":[0.006635205,0.00058419816,0.001116303,0.001962543,0.0013777287,0.0057385173,0.004419406,0.0017551942,0.008926487],"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.0005721199,0.000243358,0.0010963884,0.0015103094,0.00015646192,0.0007878846,0.00074691867,0.027673135,0.019694043,0.5683145,0.07249655,0.30670834],"study_design_scores_gemma":[0.00015901755,0.00040613097,0.00033554542,0.0002958873,0.00013723894,0.0011336701,0.00019255112,0.14476801,0.031504102,0.2246916,0.59625226,0.0001239828],"about_ca_topic_score_codex":0.0007383195,"about_ca_topic_score_gemma":0.0006058805,"teacher_disagreement_score":0.016540924,"about_ca_system_score_codex":0.0011545385,"about_ca_system_score_gemma":0.0016001574,"threshold_uncertainty_score":0.055334866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074884784,0.0002668648,0.9883836,0.00011898644,0.00015102095,0.00012815515,0.000016960588,0.0011886798,0.0022572426],"genre_scores_gemma":[0.7770569,0.00044788912,0.2183513,0.00021807336,0.0002216738,0.00050937134,0.00006997063,0.00007855044,0.0030463007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954224,0.000053137752,0.000035845518,0.000121791505,0.000205717,0.000041319752],"domain_scores_gemma":[0.99941134,0.00010713704,0.00006843156,0.000031738615,0.00035537904,0.000025982934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006548411,0.00073967443,0.0006366361,0.00050721504,0.00046025854,0.0009976889,0.0017000522,0.00081822043,0.0013474053],"category_scores_gemma":[0.0010855638,0.00029864899,0.00038863253,0.0003059454,0.00046452312,0.00058333436,0.0003784508,0.001002352,0.0004990396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060369604,0.00038342804,0.001553359,0.0007185304,0.00018200111,0.0005582304,0.00040159543,0.28618512,0.24682283,0.030325081,0.0056506633,0.42661545],"study_design_scores_gemma":[0.000118747645,0.00033810656,0.0003822678,0.000020060848,0.000057277077,0.00018828169,0.000013557521,0.9663698,0.026717851,0.0014950185,0.0042656227,0.0000333771],"about_ca_topic_score_codex":0.0017792858,"about_ca_topic_score_gemma":0.0012252546,"teacher_disagreement_score":0.0017792858,"about_ca_system_score_codex":0.00051029684,"about_ca_system_score_gemma":0.00079581863,"threshold_uncertainty_score":0.004507482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4351961,0.00079416047,0.5596259,0.0004315439,0.000087236804,0.00009123621,0.000024705969,0.00092275935,0.0028263284],"genre_scores_gemma":[0.96020275,0.0001311678,0.038963296,0.00007511129,0.000027563206,0.000017066435,0.000007847247,0.000019240788,0.000555963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.00047337517,0.000048030568,0.00016605515,0.00019423924,0.00024750945],"domain_scores_gemma":[0.9965958,0.0016538781,0.0004074341,0.00058479904,0.00054856634,0.0002096595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021393695,0.00062945765,0.00066559156,0.0005211741,0.00066954474,0.00097096997,0.0018283885,0.0004454449,0.0004901124],"category_scores_gemma":[0.0059196716,0.00036803875,0.00021142402,0.00031765047,0.000751359,0.0018341955,0.0014096355,0.00063309254,0.00015720121],"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.003682644,0.00040808198,0.009760652,0.0002860286,0.00017594374,0.00066163467,0.0009985346,0.45645785,0.112213455,0.09489564,0.0026843224,0.3177752],"study_design_scores_gemma":[0.0000734732,0.0003205232,0.0007530023,0.000031947264,0.000056593137,0.00015041759,0.000084862186,0.9522506,0.03954043,0.005173066,0.0015324885,0.00003265996],"about_ca_topic_score_codex":0.0013634163,"about_ca_topic_score_gemma":0.0018792786,"teacher_disagreement_score":0.0021393695,"about_ca_system_score_codex":0.0009031215,"about_ca_system_score_gemma":0.0007352518,"threshold_uncertainty_score":0.011314213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035411358,0.0026213545,0.95682204,0.00055124424,0.00040853236,0.00018454027,0.000081299884,0.0014010828,0.0025185144],"genre_scores_gemma":[0.93344826,0.00088347384,0.06377448,0.0001316605,0.00025582663,0.00011122647,0.00006202504,0.000028877488,0.0013041943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994399,0.00014283773,0.000031365016,0.00010728048,0.00022953824,0.000049047074],"domain_scores_gemma":[0.9991819,0.0002908876,0.00008075331,0.00007778118,0.00031175945,0.000056890898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013293788,0.00059882,0.00044958107,0.000543299,0.00087698514,0.0010935585,0.0018982404,0.00074156036,0.0010431649],"category_scores_gemma":[0.0024784813,0.00027279393,0.00032052005,0.00045971785,0.0005076496,0.0010187072,0.00045828603,0.0009895675,0.00015495045],"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.0004675076,0.00047703105,0.003276528,0.0003541182,0.000115187315,0.00025112357,0.00026665637,0.55482423,0.044940136,0.03445007,0.0076394333,0.35293797],"study_design_scores_gemma":[0.000009224824,0.00008094132,0.00014375192,0.0000061278406,0.000013350079,0.000022006445,0.000003909834,0.9961112,0.0019471722,0.0009930696,0.00066096004,0.0000082652705],"about_ca_topic_score_codex":0.005354934,"about_ca_topic_score_gemma":0.0038072944,"teacher_disagreement_score":0.005354934,"about_ca_system_score_codex":0.0011278518,"about_ca_system_score_gemma":0.0013561222,"threshold_uncertainty_score":0.010647535},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008665449,0.0018855558,0.3785542,0.0036132648,0.0038544247,0.00066467933,0.009388579,0.027768802,0.56560504],"genre_scores_gemma":[0.12905967,0.002931515,0.22604427,0.003189024,0.0010085289,0.0009975199,0.02543169,0.007196535,0.60414124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869245,0.00024076621,0.00008149363,0.0002589961,0.0005404958,0.00018580323],"domain_scores_gemma":[0.99779785,0.0004305562,0.00011234728,0.0007080524,0.00076244544,0.00018866557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013517393,0.00083460775,0.0006697477,0.0014642956,0.0011282342,0.0031712714,0.0020152952,0.0017517639,0.21450335],"category_scores_gemma":[0.005094699,0.00045361317,0.0008521699,0.001423073,0.00053328375,0.003000549,0.0027906345,0.0014824633,0.11306737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000353244,0.00018581616,0.0012935443,0.0006070936,0.000054671673,0.0004060729,0.0002802446,0.008103313,0.009183764,0.13528147,0.38008815,0.46416253],"study_design_scores_gemma":[0.000036040015,0.00005860392,0.00041925473,0.00008686062,0.000015612986,0.00039861878,0.00006728803,0.013965759,0.005501631,0.022743762,0.9566743,0.000032275726],"about_ca_topic_score_codex":0.0013857723,"about_ca_topic_score_gemma":0.0016717638,"teacher_disagreement_score":0.21450335,"about_ca_system_score_codex":0.0009895581,"about_ca_system_score_gemma":0.0017073748,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14802358,0.00095170777,0.84725404,0.00035277812,0.000085323634,0.00003155897,0.000025793692,0.00043546993,0.0028397862],"genre_scores_gemma":[0.9838275,0.00019260749,0.015370558,0.000025209609,0.00001876035,0.000021010272,0.000011776909,0.000013899741,0.00051864504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932957,0.00027701576,0.000026471538,0.00011282459,0.00017488819,0.00007925244],"domain_scores_gemma":[0.9989704,0.0005539835,0.00015998795,0.0001019968,0.00016483026,0.00004892273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025225,0.00036178797,0.0004340705,0.00024641393,0.00029760273,0.00090777455,0.00048796434,0.00045328398,0.00036119108],"category_scores_gemma":[0.003672373,0.0002481513,0.0001772048,0.00025804035,0.0012329186,0.0009423273,0.00042139107,0.0006394056,0.00005657217],"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.00007106407,0.000022477245,0.0003508727,0.000026065907,0.000012285674,0.000031726096,0.000043758424,0.9631709,0.004288314,0.022221345,0.00029148435,0.009469685],"study_design_scores_gemma":[0.0000051759403,0.000016451646,0.00005526076,0.0000011931065,0.0000019895929,0.0000042175275,0.0000023798282,0.99554515,0.00035914258,0.003913688,0.00009300319,0.000002357467],"about_ca_topic_score_codex":0.0054490706,"about_ca_topic_score_gemma":0.0026262852,"teacher_disagreement_score":0.0054490706,"about_ca_system_score_codex":0.0011196081,"about_ca_system_score_gemma":0.0012868722,"threshold_uncertainty_score":0.010834694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010277117,0.00028271895,0.98704183,0.00011513973,0.00006425406,0.00004664349,0.000014311446,0.00029282836,0.0018651785],"genre_scores_gemma":[0.3455763,0.00034513537,0.64897597,0.00022211838,0.00009345751,0.00042055742,0.00012777392,0.000099658486,0.004139054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00014690569,0.000018559775,0.000059291393,0.00018704566,0.000061785904],"domain_scores_gemma":[0.9993249,0.00044415976,0.000042938635,0.000044893255,0.000112873255,0.000030329053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537549,0.0006158647,0.00078945403,0.00092150294,0.00061973266,0.00073731993,0.0017754787,0.0013306127,0.0018558432],"category_scores_gemma":[0.0019187771,0.0002954057,0.00052632,0.00088474416,0.0006513477,0.001158414,0.0010993021,0.0008729006,0.00035602532],"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.00015020517,0.000107596665,0.0005720193,0.000099969984,0.000084647756,0.00009207024,0.0001155368,0.67695427,0.00460975,0.03349701,0.0024628395,0.28125405],"study_design_scores_gemma":[0.000022637703,0.000056573022,0.00005177421,0.000005308184,0.000008560274,0.000035366553,0.000010009234,0.99315953,0.00052091555,0.004964085,0.0011592793,0.0000059135587],"about_ca_topic_score_codex":0.0016379497,"about_ca_topic_score_gemma":0.0015971238,"teacher_disagreement_score":0.0018558432,"about_ca_system_score_codex":0.00066739524,"about_ca_system_score_gemma":0.00061604555,"threshold_uncertainty_score":0.00620842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2586461,0.00056166254,0.7211135,0.00043185445,0.00019483006,0.0003952647,0.00016844374,0.01186504,0.006623369],"genre_scores_gemma":[0.7521275,0.00015829272,0.24307084,0.00011990465,0.00004701767,0.00018072114,0.00016773278,0.00016275058,0.0039651836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968004,0.000103577484,0.000022910881,0.00006239047,0.00009778577,0.000033303677],"domain_scores_gemma":[0.99923754,0.0002908755,0.00007251686,0.00020766396,0.000147523,0.000043973174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398143,0.00044318318,0.00036849934,0.00046093113,0.0004799979,0.00057152077,0.0012093488,0.0004765783,0.0022822232],"category_scores_gemma":[0.0016526994,0.00030849007,0.0002559791,0.00033932977,0.00025383674,0.0009225765,0.00047338815,0.00060120644,0.0004244571],"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.0014586954,0.00074389414,0.005679326,0.0002459052,0.00016743151,0.00031418525,0.00021423989,0.5164177,0.13924675,0.019837357,0.009124719,0.3065498],"study_design_scores_gemma":[0.000061363666,0.0001533889,0.00041575552,0.00000407646,0.000017012195,0.00004498616,0.000009187049,0.97986895,0.014340899,0.0018740018,0.0031985308,0.000011793918],"about_ca_topic_score_codex":0.0013818679,"about_ca_topic_score_gemma":0.0017628008,"teacher_disagreement_score":0.0022822232,"about_ca_system_score_codex":0.00074904517,"about_ca_system_score_gemma":0.00043846667,"threshold_uncertainty_score":0.0076348186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027955098,0.00026928133,0.9677752,0.00012474209,0.00014392754,0.000063226944,0.000012256542,0.0012761803,0.0023801476],"genre_scores_gemma":[0.9271263,0.0001531523,0.07065329,0.00015945258,0.00013850759,0.00009523964,0.000028900167,0.000047176363,0.0015980904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999509,0.00008283501,0.00003294088,0.0001024048,0.00022579163,0.000047098056],"domain_scores_gemma":[0.9991578,0.00024090527,0.00015874876,0.00009192512,0.0003124001,0.000038190647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069551903,0.0004017881,0.00037819328,0.0004893638,0.00037029322,0.00062969193,0.0013333916,0.00050576864,0.001256381],"category_scores_gemma":[0.0019488677,0.00016801924,0.00024187281,0.00022447009,0.00040008823,0.0006694439,0.00039788638,0.00088553317,0.0003332788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006863056,0.0006384261,0.0033848383,0.00040133146,0.0001445612,0.0005105643,0.00047835556,0.34820968,0.16658224,0.03362983,0.0049440707,0.44038972],"study_design_scores_gemma":[0.00007156315,0.00019363886,0.00037508062,0.000007879971,0.000021709193,0.0001405965,0.000010959241,0.9816465,0.013392802,0.0020235088,0.0020965806,0.000019155317],"about_ca_topic_score_codex":0.0007638511,"about_ca_topic_score_gemma":0.0005126103,"teacher_disagreement_score":0.0013333916,"about_ca_system_score_codex":0.00032077928,"about_ca_system_score_gemma":0.0003758309,"threshold_uncertainty_score":0.0042030215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023534924,0.00025259852,0.9735144,0.000088006724,0.000080018704,0.00011487385,0.000015949148,0.0011482923,0.0012510063],"genre_scores_gemma":[0.67570096,0.00019581086,0.32101452,0.000099066165,0.00009864071,0.0001689153,0.000053372256,0.00009511205,0.0025734545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.00021528204,0.00006155869,0.00013293837,0.0004162218,0.000086106615],"domain_scores_gemma":[0.9981184,0.0008030583,0.00021890907,0.00046465857,0.0003225033,0.00007252156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015265028,0.00052083516,0.0005444833,0.0005173553,0.000537738,0.0010713908,0.0013295619,0.0006545241,0.0013994958],"category_scores_gemma":[0.004731606,0.0002581565,0.00028501643,0.00031920846,0.00108657,0.0013719127,0.0009736935,0.0010305037,0.0002820615],"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.0005875383,0.0002649642,0.0008730742,0.00023145195,0.00006064458,0.00025681165,0.00031541547,0.36633638,0.12723842,0.1575145,0.0036010244,0.3427197],"study_design_scores_gemma":[0.00007968268,0.00013341602,0.000120918165,0.000012024516,0.000012414559,0.000074158255,0.000007200567,0.97043633,0.016639654,0.009908096,0.0025539598,0.000022182712],"about_ca_topic_score_codex":0.0011194673,"about_ca_topic_score_gemma":0.0009777388,"teacher_disagreement_score":0.0015265028,"about_ca_system_score_codex":0.00066398043,"about_ca_system_score_gemma":0.00093879516,"threshold_uncertainty_score":0.008073032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8208218,0.00035334576,0.16930266,0.00016617781,0.00018478019,0.00028273294,0.00037524963,0.0009947455,0.007518497],"genre_scores_gemma":[0.95949274,0.00013017713,0.037450463,0.00006704128,0.000027904058,0.00008026767,0.0003047662,0.00003142335,0.0024151735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963084,0.00081026397,0.000101255195,0.00034528578,0.0022950508,0.00013958113],"domain_scores_gemma":[0.9939739,0.0013371386,0.00043894525,0.00036196134,0.003631932,0.00025609272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039022702,0.00048807994,0.00075014064,0.0016884843,0.00038313578,0.0009223739,0.00092966395,0.0009800125,0.0013067157],"category_scores_gemma":[0.005027152,0.00022415846,0.00028804896,0.00065888395,0.0003751958,0.0013188381,0.00073536753,0.00052458287,0.000401526],"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.003566448,0.0017426336,0.16335781,0.0006197235,0.00038148576,0.00029116747,0.0008551035,0.08055576,0.4456212,0.0063199834,0.00347919,0.29320943],"study_design_scores_gemma":[0.00023767893,0.013117109,0.081294656,0.00009174523,0.000506226,0.0006567109,0.00073855073,0.45232707,0.426378,0.001970049,0.022376282,0.0003059976],"about_ca_topic_score_codex":0.0012554026,"about_ca_topic_score_gemma":0.0016336045,"teacher_disagreement_score":0.0039022702,"about_ca_system_score_codex":0.00094594073,"about_ca_system_score_gemma":0.0006644745,"threshold_uncertainty_score":0.020637453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049002264,0.00017388299,0.94730616,0.00008604549,0.000048805934,0.000040636874,0.0000074403233,0.0009880597,0.0023466863],"genre_scores_gemma":[0.9753586,0.00006160414,0.023380151,0.000063640335,0.000024208373,0.000038231075,0.00001080218,0.000024051407,0.0010386019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974173,0.000052752206,0.000013947942,0.000041815725,0.000112044996,0.0000377053],"domain_scores_gemma":[0.9995765,0.000114646806,0.000058931208,0.000043258813,0.0001762755,0.000030402087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047533293,0.0002870954,0.0002891625,0.0002926267,0.00026061296,0.00039327348,0.0008932758,0.0003299611,0.00062626554],"category_scores_gemma":[0.0009990861,0.00011587193,0.00016300927,0.00013615364,0.00037516025,0.00041258274,0.00027441882,0.00047661786,0.00015959007],"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.00026068892,0.00040213089,0.0018366008,0.00013530762,0.000062292485,0.00035688016,0.00024759874,0.74618804,0.07477427,0.02157656,0.002658412,0.15150124],"study_design_scores_gemma":[0.000019990803,0.00007381162,0.00019130476,0.0000025946208,0.0000089811865,0.000039104165,0.0000066155258,0.99324703,0.004694136,0.0010100463,0.00069953996,0.0000068927434],"about_ca_topic_score_codex":0.0010633274,"about_ca_topic_score_gemma":0.0008394403,"teacher_disagreement_score":0.0010633274,"about_ca_system_score_codex":0.0003274182,"about_ca_system_score_gemma":0.00030277675,"threshold_uncertainty_score":0.002513826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0255339,0.00091602246,0.9557317,0.0005627819,0.0006367027,0.00020909823,0.00014858667,0.009472383,0.00678886],"genre_scores_gemma":[0.70815355,0.0006580373,0.2711775,0.00073067617,0.00078628055,0.0003424408,0.0002860005,0.00049982604,0.017365603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.00010265655,0.000056489513,0.00016583425,0.0003093604,0.00014302504],"domain_scores_gemma":[0.9976578,0.00058379344,0.00015645383,0.00079094694,0.0006137841,0.00019716073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011109023,0.00086039095,0.00086275,0.0016956555,0.0015544291,0.0022477915,0.0045882766,0.0013868172,0.0077040163],"category_scores_gemma":[0.0038255812,0.00056301756,0.00047834055,0.0012786716,0.0010405087,0.0037184516,0.0022248863,0.001994892,0.0017780504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014007231,0.0011921483,0.0015142561,0.00026321565,0.00016924561,0.00037184625,0.00041529787,0.07464578,0.12507515,0.14626202,0.025634358,0.62305593],"study_design_scores_gemma":[0.00019136124,0.00030921906,0.00058346824,0.00003519237,0.00013612471,0.00031354773,0.000046558198,0.88302594,0.042636707,0.05509923,0.017498612,0.0001240585],"about_ca_topic_score_codex":0.0016584733,"about_ca_topic_score_gemma":0.0022946706,"teacher_disagreement_score":0.0077040163,"about_ca_system_score_codex":0.0010310889,"about_ca_system_score_gemma":0.0009403035,"threshold_uncertainty_score":0.025772512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607476,0.0027740044,0.017214864,0.00033905177,0.000068365465,0.00016965551,0.0006005857,0.0013597931,0.016726045],"genre_scores_gemma":[0.9917997,0.00053529063,0.005994891,0.00004012177,0.000034392502,0.00006924933,0.00056177104,0.00010088958,0.0008636534],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9950171,0.0011954668,0.00040517127,0.00053243345,0.0021129353,0.0007369188],"domain_scores_gemma":[0.9899946,0.0048345826,0.0005731963,0.0012490111,0.002846188,0.00050240674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003148057,0.0009509021,0.0008957654,0.0030731058,0.0007136015,0.0015475956,0.0013435199,0.0010244952,0.001549267],"category_scores_gemma":[0.010711408,0.00029224224,0.00034184163,0.0027527947,0.0005576395,0.0033846356,0.0010112379,0.0006961255,0.0005791208],"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.008385365,0.0029215787,0.049918085,0.0016761143,0.0005188533,0.0008092508,0.0009783682,0.23676409,0.1942454,0.015982982,0.008023837,0.4797761],"study_design_scores_gemma":[0.0005599717,0.011747209,0.07917605,0.00019335558,0.0004956355,0.0018386077,0.0016135793,0.6460279,0.22928087,0.0078040436,0.020953126,0.0003096353],"about_ca_topic_score_codex":0.0018217526,"about_ca_topic_score_gemma":0.0010006069,"teacher_disagreement_score":0.003148057,"about_ca_system_score_codex":0.0013742849,"about_ca_system_score_gemma":0.0006916819,"threshold_uncertainty_score":0.01664877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055892863,0.0002494286,0.9878477,0.00009658663,0.00005680895,0.00012289976,0.00006347979,0.00029302243,0.0056808493],"genre_scores_gemma":[0.5086443,0.0014751017,0.47801447,0.000109115645,0.000111104135,0.0013308481,0.00034448883,0.000120586075,0.009850035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.00009983025,0.000030137227,0.00008660021,0.00029810687,0.0000470685],"domain_scores_gemma":[0.9995851,0.0001227801,0.000087116525,0.000038374852,0.00014564848,0.000021094387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315239,0.0007164089,0.0005606688,0.00048514796,0.00051880296,0.0014900388,0.002139473,0.0012157492,0.0026567236],"category_scores_gemma":[0.0010600943,0.00046698583,0.00050502433,0.00033254246,0.00062218576,0.0011113887,0.0004999888,0.00114579,0.00065762916],"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.00005972641,0.000086607695,0.00039057352,0.0001319142,0.000022394499,0.00017354636,0.00010640825,0.85439837,0.015933746,0.103234194,0.0008629145,0.02459956],"study_design_scores_gemma":[0.000010181222,0.00003308956,0.00003337797,0.000007028142,0.0000089620125,0.00002609148,0.000004431875,0.99286264,0.0012812846,0.00330062,0.0024259326,0.000006355601],"about_ca_topic_score_codex":0.002393905,"about_ca_topic_score_gemma":0.0010892157,"teacher_disagreement_score":0.0026567236,"about_ca_system_score_codex":0.00070677226,"about_ca_system_score_gemma":0.0010785671,"threshold_uncertainty_score":0.008887649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20860724,0.0061018853,0.52886903,0.0014502042,0.0018279314,0.0019222155,0.017818468,0.028577464,0.2048256],"genre_scores_gemma":[0.79802287,0.0039653103,0.124683104,0.0005246449,0.0004288099,0.0011246382,0.020009398,0.000906633,0.050334543],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997335,0.0003542998,0.000100280355,0.0003489751,0.0016609262,0.00020049063],"domain_scores_gemma":[0.99751043,0.00026608442,0.000119279706,0.00036211716,0.0016272443,0.0001148377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861236,0.00087812357,0.0007107743,0.0041207345,0.00089195964,0.001054146,0.001145223,0.0007800151,0.0046354746],"category_scores_gemma":[0.0036151148,0.00027679792,0.00030616135,0.004157622,0.00022043649,0.0015672178,0.00078324956,0.0007603133,0.0032479311],"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.00055174594,0.0011062996,0.038704537,0.00054448645,0.00018511867,0.00029225086,0.00043154616,0.027795106,0.07680156,0.035308618,0.1236961,0.6945826],"study_design_scores_gemma":[0.000109278284,0.0016348405,0.06912577,0.000286164,0.00021522942,0.0021621394,0.0005813639,0.41052082,0.1716826,0.016188221,0.32718274,0.00031085304],"about_ca_topic_score_codex":0.0039558015,"about_ca_topic_score_gemma":0.0025920034,"teacher_disagreement_score":0.0046354746,"about_ca_system_score_codex":0.0011285847,"about_ca_system_score_gemma":0.00064640905,"threshold_uncertainty_score":0.015507221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049848385,0.00054833037,0.9365552,0.00082591514,0.00012977952,0.00012378524,0.0001350365,0.00038068515,0.011452915],"genre_scores_gemma":[0.9516533,0.00038800848,0.041909453,0.00021211714,0.00010599158,0.00018369115,0.000091274655,0.000069924805,0.00538624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00022144806,0.000026471691,0.00011019137,0.0002263826,0.00011262025],"domain_scores_gemma":[0.99893504,0.00049900106,0.00013320205,0.00007267087,0.00028764288,0.0000724015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881061,0.0007441903,0.00062741106,0.0008094238,0.0005528498,0.0013940744,0.0017097684,0.0015020367,0.0019549541],"category_scores_gemma":[0.0021620854,0.0002940718,0.0004529367,0.0004996027,0.0009315521,0.0014650502,0.0009375214,0.0014390723,0.00027742513],"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.00006553088,0.00007972001,0.00038998714,0.000059601538,0.000015577929,0.00015687483,0.00009930498,0.8942792,0.007127448,0.08795686,0.0012858161,0.008484174],"study_design_scores_gemma":[0.0000033585682,0.0000048700654,0.000011120306,0.0000014123679,0.0000016826402,0.0000066864613,0.0000022290278,0.9979371,0.00014455344,0.0017128757,0.00017233744,0.000001907434],"about_ca_topic_score_codex":0.005584113,"about_ca_topic_score_gemma":0.0021855554,"teacher_disagreement_score":0.005584113,"about_ca_system_score_codex":0.0023331305,"about_ca_system_score_gemma":0.0010726302,"threshold_uncertainty_score":0.016928136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217432,0.000047215206,0.96478546,0.00006925356,0.0000037027228,0.000026722197,0.000041799056,0.00024177472,0.00056670414],"genre_scores_gemma":[0.6591192,0.0001051878,0.3393445,0.000027864813,0.000012815596,0.00010392762,0.00028131116,0.00008118738,0.0009240068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.00044217132,0.000024430326,0.000118885604,0.0002009399,0.00005528172],"domain_scores_gemma":[0.9942162,0.004131416,0.0006723963,0.00048360365,0.0003677118,0.00012858113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421174,0.0005661462,0.00069740374,0.0010231053,0.00049621094,0.0009852035,0.0010759558,0.0008729526,0.00085192436],"category_scores_gemma":[0.013780646,0.0005299041,0.000297286,0.00085210823,0.000920428,0.002107657,0.0013607253,0.0010274486,0.00033439873],"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.00028377195,0.00008254117,0.0056198915,0.00009054617,0.000043195654,0.00014611411,0.00020553442,0.88986963,0.009937465,0.026522448,0.0005901014,0.066608734],"study_design_scores_gemma":[0.000006359526,0.000011439542,0.00036415964,0.0000030505341,0.0000022710412,0.000029773251,0.000009900354,0.9913531,0.0016934497,0.0063817697,0.00013777557,0.000006848246],"about_ca_topic_score_codex":0.0012716891,"about_ca_topic_score_gemma":0.0014962686,"teacher_disagreement_score":0.0018421174,"about_ca_system_score_codex":0.0006938451,"about_ca_system_score_gemma":0.00065357913,"threshold_uncertainty_score":0.009742141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1998896,0.00018962762,0.7953646,0.00017813219,0.00015562116,0.00012528959,0.000079336445,0.0007677041,0.0032499898],"genre_scores_gemma":[0.93191355,0.00008458861,0.066900104,0.00003300775,0.000051604133,0.000043502387,0.0000608232,0.000057811634,0.0008548624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.000093570256,0.000021633079,0.000056792538,0.00014243249,0.00011997747],"domain_scores_gemma":[0.9989304,0.00041786948,0.00011165498,0.00016653513,0.00023727203,0.00013612943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072640687,0.0004765043,0.00056235306,0.00045362962,0.00088423473,0.0005920979,0.0013005072,0.00029279053,0.0014745144],"category_scores_gemma":[0.0021554169,0.00021309611,0.00028959123,0.000493781,0.0004254938,0.0007767844,0.00092666823,0.0006273025,0.0001408941],"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.0009948625,0.00027027362,0.0040789535,0.00015562572,0.00008564179,0.0004128631,0.000371124,0.645128,0.065959394,0.036922503,0.0034357521,0.24218498],"study_design_scores_gemma":[0.000033825643,0.000078417725,0.00025295888,0.0000026952866,0.0000098637365,0.000046116285,0.000031255604,0.9882085,0.0062730056,0.003780261,0.001272548,0.00001055936],"about_ca_topic_score_codex":0.0042935945,"about_ca_topic_score_gemma":0.005174926,"teacher_disagreement_score":0.0042935945,"about_ca_system_score_codex":0.001146194,"about_ca_system_score_gemma":0.0014766438,"threshold_uncertainty_score":0.008537173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020339439,0.00020575662,0.9716689,0.00028670652,0.00010027652,0.00007900952,0.0000625915,0.00021865487,0.007038742],"genre_scores_gemma":[0.9170722,0.00040977774,0.07093521,0.00013778072,0.00009924976,0.00024078265,0.00007845172,0.000053748885,0.0109728165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985983,0.0004138916,0.000047766625,0.00024403518,0.00047165508,0.00022447189],"domain_scores_gemma":[0.9992816,0.000326478,0.00008510006,0.00006911596,0.00017042905,0.00006732823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001744404,0.0007534476,0.0011869085,0.00056695216,0.0008027576,0.0016831205,0.003107336,0.0014102478,0.0031914697],"category_scores_gemma":[0.0032746522,0.00038029344,0.00068958034,0.0008657942,0.0016172064,0.0027422756,0.0011306539,0.0014855412,0.0004494088],"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.00007473604,0.00006263349,0.00024293817,0.000039769006,0.000030032965,0.00018603387,0.00014316534,0.7667418,0.0025795137,0.21828514,0.0010230459,0.01059108],"study_design_scores_gemma":[0.000009440325,0.000014525493,0.0000200841,0.0000012795051,0.00000443161,0.000012057984,0.0000066975836,0.9832554,0.00013262828,0.016148353,0.00038951615,0.000005585803],"about_ca_topic_score_codex":0.00817924,"about_ca_topic_score_gemma":0.0038957978,"teacher_disagreement_score":0.00817924,"about_ca_system_score_codex":0.0016801817,"about_ca_system_score_gemma":0.0014724713,"threshold_uncertainty_score":0.016263306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040257372,0.004114084,0.9467679,0.00041082088,0.00047893316,0.000499717,0.00033653204,0.003956559,0.003177999],"genre_scores_gemma":[0.5652497,0.0020603742,0.42750984,0.0001985727,0.00022665206,0.00090407766,0.0009187931,0.0005609885,0.0023710793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963934,0.001304941,0.00034673885,0.00024008645,0.0015601573,0.00015472583],"domain_scores_gemma":[0.9956013,0.001681619,0.0006125533,0.000351518,0.001620906,0.00013210441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003926656,0.0012656552,0.00087647437,0.0016780811,0.0009293522,0.0014231618,0.0017463946,0.0008123376,0.0008932452],"category_scores_gemma":[0.011990753,0.00031269062,0.00039497548,0.0019681547,0.0004738213,0.0025405649,0.0011171359,0.0010540787,0.00024118059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009932665,0.0004610659,0.010019732,0.0013740803,0.0006461213,0.00036880327,0.00030727717,0.3438207,0.046979982,0.025520846,0.021490589,0.54801756],"study_design_scores_gemma":[0.00007260293,0.00059667265,0.0026207706,0.00004897409,0.00012425678,0.00041961911,0.000047954258,0.95765364,0.021359958,0.005291066,0.011672556,0.000091875474],"about_ca_topic_score_codex":0.0015182225,"about_ca_topic_score_gemma":0.0013960326,"teacher_disagreement_score":0.003926656,"about_ca_system_score_codex":0.0010204493,"about_ca_system_score_gemma":0.0013635053,"threshold_uncertainty_score":0.020766377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04722435,0.00040734126,0.94727445,0.00034815387,0.000040812454,0.000058338843,0.000045737084,0.00007619144,0.0045246026],"genre_scores_gemma":[0.85283273,0.0008850174,0.14258873,0.00007198424,0.00007893762,0.00012866402,0.000057182257,0.00005153232,0.0033051784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912447,0.00038544164,0.00003224141,0.00010993784,0.00022251792,0.000125365],"domain_scores_gemma":[0.99852484,0.00085775624,0.00017841024,0.00008404773,0.0002749099,0.00007998435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014405155,0.00072304584,0.0006861113,0.0004410677,0.00045769732,0.00083055545,0.0009351265,0.0008899367,0.001385472],"category_scores_gemma":[0.0053577865,0.00035749696,0.00042415675,0.00064571475,0.00078048796,0.0016732241,0.00081732235,0.0008026307,0.00013963967],"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.00007697473,0.00003151709,0.00045586078,0.00017069821,0.000031416796,0.00018697359,0.00013904454,0.8765451,0.0068896795,0.085303076,0.0008486675,0.029321138],"study_design_scores_gemma":[0.0000151937265,0.000072283634,0.00009613634,0.000010227947,0.000017623013,0.000078167235,0.00004692112,0.9658113,0.002130025,0.028926566,0.0027870815,0.000008497894],"about_ca_topic_score_codex":0.0021378908,"about_ca_topic_score_gemma":0.0017651855,"teacher_disagreement_score":0.0021378908,"about_ca_system_score_codex":0.0010859646,"about_ca_system_score_gemma":0.0010002505,"threshold_uncertainty_score":0.007879257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006275332,0.00011101005,0.99185044,0.00007495752,0.000022039445,0.000020569192,0.000008726122,0.00017932753,0.001457653],"genre_scores_gemma":[0.88792336,0.00037812133,0.10696789,0.00012422501,0.00007843446,0.00018222336,0.00007125089,0.00006360563,0.004210905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999332,0.00011980733,0.00003371997,0.00019396399,0.000250201,0.00007028643],"domain_scores_gemma":[0.9994443,0.0001977209,0.000103630024,0.000055936838,0.00017789834,0.000020545462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989083,0.0007733738,0.00071462675,0.0002811299,0.0002775545,0.0011534155,0.0010681547,0.00085359125,0.001805016],"category_scores_gemma":[0.0014039081,0.00038787472,0.00055526214,0.00024240148,0.0007117996,0.0010462382,0.0011002067,0.0010465347,0.00028291365],"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.000082617924,0.000052099265,0.00020519336,0.00014193742,0.00006188877,0.000089976886,0.00008587522,0.90553665,0.019798994,0.018685449,0.0009055896,0.054353792],"study_design_scores_gemma":[0.000009607853,0.000046630623,0.00006257154,0.0000045663096,0.000007862167,0.000008659748,0.0000041391963,0.9966689,0.0018292896,0.0009959115,0.00035551656,0.0000064163446],"about_ca_topic_score_codex":0.0035260129,"about_ca_topic_score_gemma":0.0024301927,"teacher_disagreement_score":0.0035260129,"about_ca_system_score_codex":0.0006862503,"about_ca_system_score_gemma":0.0011406711,"threshold_uncertainty_score":0.0070109367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074762804,0.000071876915,0.9859929,0.00008116675,0.00006890595,0.000085338695,0.000039742954,0.0010215162,0.005162283],"genre_scores_gemma":[0.706122,0.00017580796,0.28765887,0.00015413047,0.000053801974,0.00029091147,0.00011017193,0.000102719736,0.005331562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.00006719204,0.00001920956,0.00008057196,0.00013040096,0.000027569433],"domain_scores_gemma":[0.9996712,0.000040001276,0.000044556265,0.000053289044,0.00017491245,0.000015943913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003028755,0.0007264394,0.00040353945,0.00032901842,0.00034992915,0.0007279134,0.0009835014,0.000768951,0.004110267],"category_scores_gemma":[0.0006892357,0.00025107976,0.00032271544,0.0002137257,0.0002491451,0.0005022338,0.00035448416,0.0006861234,0.0015559796],"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.0005180809,0.00019551777,0.0007658733,0.00090662885,0.00010515379,0.00088493363,0.00031026537,0.418261,0.25129575,0.043619446,0.008660248,0.2744771],"study_design_scores_gemma":[0.000065075925,0.0004374872,0.0002739373,0.000023769384,0.000038158985,0.00032056708,0.000023690245,0.95685184,0.026997782,0.0031988665,0.011745895,0.000022889835],"about_ca_topic_score_codex":0.0011081621,"about_ca_topic_score_gemma":0.0009387803,"teacher_disagreement_score":0.004110267,"about_ca_system_score_codex":0.00039240895,"about_ca_system_score_gemma":0.0005447195,"threshold_uncertainty_score":0.013750255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1141295,0.0015267788,0.87252855,0.0004306759,0.00043410916,0.00025654992,0.000058911395,0.004791427,0.005843614],"genre_scores_gemma":[0.9480204,0.0002311172,0.05026141,0.00009252339,0.00010515797,0.00006494152,0.000038002425,0.00008246847,0.0011040142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968827,0.0010372326,0.00022363066,0.00032867942,0.0012729417,0.00025484143],"domain_scores_gemma":[0.9933335,0.002860422,0.00096677773,0.0009671184,0.0016740966,0.0001980463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761765,0.0008508506,0.0007589245,0.0012008167,0.0005419855,0.0026847827,0.0022180565,0.0009343637,0.0012197695],"category_scores_gemma":[0.016490703,0.00035263825,0.0003729076,0.0008299011,0.00082043884,0.0019191405,0.0010107476,0.0011515921,0.0003583063],"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.0014666351,0.000793984,0.0075272573,0.00026307433,0.00024232377,0.00031559364,0.00030457904,0.47749987,0.06263848,0.037466373,0.0038194116,0.40766242],"study_design_scores_gemma":[0.00006107877,0.00013615415,0.00039874535,0.0000131654315,0.000049491922,0.00005974125,0.0000072353446,0.9775704,0.015478586,0.0046046586,0.0015915399,0.000029194638],"about_ca_topic_score_codex":0.0026467799,"about_ca_topic_score_gemma":0.0011937955,"teacher_disagreement_score":0.004761765,"about_ca_system_score_codex":0.0012511428,"about_ca_system_score_gemma":0.0008870748,"threshold_uncertainty_score":0.025182962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20971468,0.00063084497,0.5913273,0.00044737122,0.00040829057,0.0007328255,0.0012092602,0.1599409,0.035588566],"genre_scores_gemma":[0.79443145,0.00050029333,0.16707054,0.000665074,0.0002141404,0.00041515246,0.003568777,0.009221292,0.023913335],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976628,0.00014066829,0.00020902164,0.0002976619,0.0012526752,0.0004371403],"domain_scores_gemma":[0.99527234,0.00045586115,0.00025660952,0.0015902318,0.0020823872,0.000342636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017444214,0.0010467272,0.00062248233,0.0012325095,0.0011231524,0.002835435,0.0033461545,0.0009901631,0.0061228364],"category_scores_gemma":[0.0045134826,0.0008520685,0.00079153414,0.00093773624,0.00088782946,0.004521462,0.0024934083,0.0018714962,0.0028494408],"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.0044854064,0.0014810787,0.022483183,0.00086557516,0.00046348863,0.0018759909,0.0019213873,0.03062198,0.39090642,0.06737967,0.10383256,0.37368333],"study_design_scores_gemma":[0.00023667351,0.00088177196,0.0101970555,0.00014080595,0.00047397043,0.0022981623,0.00056636584,0.271111,0.5136231,0.013688651,0.18627529,0.00050710904],"about_ca_topic_score_codex":0.005239075,"about_ca_topic_score_gemma":0.003326114,"teacher_disagreement_score":0.0061228364,"about_ca_system_score_codex":0.001321242,"about_ca_system_score_gemma":0.0025166688,"threshold_uncertainty_score":0.020482898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05080917,0.00021290917,0.944687,0.00026356545,0.000054842483,0.00010836776,0.000073892006,0.0012855566,0.002504722],"genre_scores_gemma":[0.5782884,0.00007190108,0.41908568,0.00007703862,0.000026022923,0.00014532315,0.00018201204,0.000050465373,0.0020732183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995302,0.000113677335,0.000033455744,0.0000994889,0.00015378768,0.000069339025],"domain_scores_gemma":[0.99936146,0.00020432397,0.000098282566,0.00012765774,0.0001664866,0.0000418334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056899444,0.0004101637,0.0005384953,0.0006407721,0.0005351451,0.0006671688,0.001201267,0.00073604507,0.0014864617],"category_scores_gemma":[0.0017510834,0.00019493187,0.00028675018,0.0006046402,0.00031466494,0.00084968674,0.0008803378,0.0005061443,0.00034472632],"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.00068494177,0.00023417504,0.0016690741,0.00016485514,0.000075985714,0.00028161908,0.00018761207,0.52787346,0.030401353,0.03208743,0.006192858,0.40014666],"study_design_scores_gemma":[0.000065838794,0.000051625586,0.00011516464,0.000004956035,0.000009121978,0.00008904429,0.000018488177,0.9870331,0.004973099,0.0057907426,0.001840724,0.000008111553],"about_ca_topic_score_codex":0.0018339971,"about_ca_topic_score_gemma":0.0014348761,"teacher_disagreement_score":0.0018339971,"about_ca_system_score_codex":0.00086405355,"about_ca_system_score_gemma":0.0009889144,"threshold_uncertainty_score":0.0062692165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29879716,0.0020794077,0.69132817,0.00022055424,0.00010504983,0.00005951492,0.000043615943,0.00024152086,0.007124951],"genre_scores_gemma":[0.9929363,0.00015271794,0.0061406298,0.000017836539,0.000009567773,0.0000123296195,0.000009282349,0.000005683415,0.0007156947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997626,0.00006987539,0.000007228523,0.00004114929,0.000041097952,0.0000780033],"domain_scores_gemma":[0.9997198,0.0001338592,0.000039837763,0.000018812178,0.000054621578,0.000033172655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047604964,0.00036575404,0.0005636907,0.00038007324,0.00047209847,0.00079343235,0.0007842731,0.00046845624,0.0006716285],"category_scores_gemma":[0.00096242345,0.0002007812,0.00032590373,0.00040649693,0.0005962524,0.0005962742,0.00074480474,0.00030622937,0.000095121475],"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.00014378867,0.000039447914,0.0014166281,0.00008033984,0.00002422896,0.00057938433,0.00013476737,0.9497601,0.008246008,0.020997427,0.0006199169,0.017957985],"study_design_scores_gemma":[0.000003826919,0.000027340488,0.00013399064,0.0000026799237,0.000004829327,0.00003295129,0.0000526425,0.9968267,0.00037687292,0.0023094888,0.00022341177,0.0000052719543],"about_ca_topic_score_codex":0.003493101,"about_ca_topic_score_gemma":0.0024773239,"teacher_disagreement_score":0.003493101,"about_ca_system_score_codex":0.00052029203,"about_ca_system_score_gemma":0.0004204894,"threshold_uncertainty_score":0.0069455504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19801389,0.0010432876,0.7041659,0.0038288261,0.00024087544,0.0002835217,0.00025098346,0.00027120448,0.091901466],"genre_scores_gemma":[0.97013164,0.00061347184,0.017177101,0.00013374185,0.000060681137,0.00017640527,0.000042124415,0.000029985476,0.011634707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939656,0.00025017228,0.000014720895,0.00006552739,0.00016820474,0.00010472086],"domain_scores_gemma":[0.9993635,0.00034567603,0.00007299347,0.000039724106,0.00009786273,0.00008023587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438126,0.0006088658,0.0006114059,0.00057335536,0.00086801575,0.0018852584,0.0015310482,0.0013285942,0.003149181],"category_scores_gemma":[0.0024532147,0.00040852846,0.0005421444,0.00065598293,0.0011991966,0.002409509,0.0010153382,0.0011606828,0.00032075326],"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.00003236921,0.000032728192,0.00022346024,0.000016033642,0.000012328643,0.0001498311,0.00004664528,0.8814689,0.00061993435,0.113863595,0.0006040549,0.002930177],"study_design_scores_gemma":[0.000009620149,0.000010313791,0.00006798564,0.0000026058005,0.0000042436072,0.000014784844,0.000015493186,0.98525006,0.0000565131,0.013882568,0.0006797906,0.0000059741924],"about_ca_topic_score_codex":0.007866016,"about_ca_topic_score_gemma":0.0053611193,"teacher_disagreement_score":0.007866016,"about_ca_system_score_codex":0.0030775808,"about_ca_system_score_gemma":0.0014101651,"threshold_uncertainty_score":0.02232951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058486972,0.0010501296,0.93267906,0.00011737795,0.00032012336,0.000111095185,0.000034612975,0.0014300591,0.005770574],"genre_scores_gemma":[0.94053394,0.0004078948,0.05545912,0.00007567375,0.00020541812,0.0000704117,0.0000352571,0.0000855347,0.003126691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983883,0.00032170015,0.00007529591,0.0002554672,0.00080580934,0.00015334866],"domain_scores_gemma":[0.998187,0.0007419073,0.00015442478,0.00030309445,0.00052568025,0.00008786013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294163,0.00060449215,0.0004413884,0.0007241078,0.00045492934,0.0013874942,0.0015776496,0.00041704037,0.0019002508],"category_scores_gemma":[0.0060617006,0.00021510338,0.00026092774,0.00066259794,0.0007665086,0.0014172089,0.0010218526,0.0008792103,0.00029161127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009574332,0.00035081434,0.0017923698,0.00026949064,0.00013754737,0.00035465392,0.0003502123,0.2097761,0.15441962,0.069602124,0.0037912906,0.55819833],"study_design_scores_gemma":[0.000047774527,0.00013738536,0.00036704078,0.00001547696,0.000048737005,0.00014658904,0.000019758987,0.9492958,0.029314552,0.015050644,0.005529963,0.000026254409],"about_ca_topic_score_codex":0.001383796,"about_ca_topic_score_gemma":0.0009829154,"teacher_disagreement_score":0.0019002508,"about_ca_system_score_codex":0.00056494767,"about_ca_system_score_gemma":0.00047330649,"threshold_uncertainty_score":0.0070307255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06891165,0.00021481163,0.9271169,0.00008271418,0.00008490275,0.00006859339,0.000040661253,0.002467466,0.001012367],"genre_scores_gemma":[0.5993522,0.00030300123,0.39356208,0.000092390335,0.0001330563,0.00011685672,0.00024255803,0.00041711418,0.005780802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.0000829718,0.000047234807,0.00013386123,0.00025688333,0.00008048731],"domain_scores_gemma":[0.9981415,0.00054678146,0.0001626064,0.00042803714,0.0005734099,0.00014759424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008044342,0.0006863497,0.0012114444,0.0009812878,0.0007481606,0.0012067426,0.0015752952,0.0006409208,0.0019081024],"category_scores_gemma":[0.0034212,0.00040286392,0.00035539016,0.0010377641,0.0004839586,0.0013593606,0.0009274866,0.0011157125,0.00085001596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017325669,0.0004927236,0.0056766765,0.00018886142,0.0001389413,0.00030133408,0.0007450398,0.20342317,0.24259675,0.020478727,0.0045558857,0.5196693],"study_design_scores_gemma":[0.00002793665,0.000079745325,0.0004821944,0.000005973313,0.000018546923,0.00009139674,0.000027595963,0.94110596,0.053182665,0.002594543,0.002362705,0.000020748166],"about_ca_topic_score_codex":0.0017841656,"about_ca_topic_score_gemma":0.0017153975,"teacher_disagreement_score":0.0019081024,"about_ca_system_score_codex":0.0006583632,"about_ca_system_score_gemma":0.00091962726,"threshold_uncertainty_score":0.0063831806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2140331,0.0006352453,0.7564275,0.00029361484,0.0003215302,0.00014308041,0.000116540075,0.02034791,0.007681489],"genre_scores_gemma":[0.849477,0.00024327186,0.1420051,0.00020788153,0.00017647757,0.00016884667,0.00025728368,0.0022111353,0.005252901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978269,0.00039869736,0.00031110307,0.00032179503,0.0007367725,0.00040475235],"domain_scores_gemma":[0.9919288,0.0025151228,0.0008192798,0.0024324006,0.0015462264,0.0007581357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030949588,0.00068326335,0.0006930623,0.00064188393,0.00066506345,0.002943434,0.0019842053,0.00074327743,0.0020967936],"category_scores_gemma":[0.01374435,0.0006972293,0.00040741908,0.00036822786,0.00070495764,0.0028677434,0.002025984,0.0015082088,0.0007696207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060782167,0.00095020013,0.026511822,0.0008818201,0.0002684424,0.0009798997,0.0019171446,0.04579707,0.3536039,0.10545282,0.023016874,0.43454185],"study_design_scores_gemma":[0.0008416193,0.0005998845,0.00423392,0.00008961011,0.0001738221,0.00046574516,0.0001268599,0.7948313,0.11682679,0.041727036,0.039939538,0.00014385575],"about_ca_topic_score_codex":0.0011037897,"about_ca_topic_score_gemma":0.0012326838,"teacher_disagreement_score":0.0030949588,"about_ca_system_score_codex":0.0006584636,"about_ca_system_score_gemma":0.0011023979,"threshold_uncertainty_score":0.016367912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06884215,0.0025953872,0.9133996,0.00063258864,0.0009295817,0.00043971973,0.00014895096,0.006577467,0.006434599],"genre_scores_gemma":[0.8550072,0.00044399014,0.13677582,0.00048241625,0.0006291318,0.00021851368,0.00014733968,0.0001267645,0.00616875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980952,0.00039990753,0.00013424126,0.00033747964,0.0007598246,0.00027332536],"domain_scores_gemma":[0.996405,0.0011641302,0.00034416118,0.00060466223,0.0011211276,0.00036095706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032576788,0.0011742886,0.0008308685,0.0017890758,0.0011103738,0.0027053258,0.0057322355,0.0010271305,0.004313332],"category_scores_gemma":[0.006003476,0.0005244011,0.0005006961,0.001164443,0.00094323134,0.003724866,0.0020192494,0.0017182408,0.0005812545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024277624,0.0016641944,0.0030725987,0.0005178663,0.00020124803,0.00032417412,0.00075105455,0.10551654,0.056501318,0.0748214,0.01636863,0.7378332],"study_design_scores_gemma":[0.0004593449,0.0007296815,0.0006367388,0.000044536755,0.00019738608,0.00026503459,0.000059197188,0.92287165,0.03074384,0.029274095,0.014615741,0.00010276502],"about_ca_topic_score_codex":0.0030617046,"about_ca_topic_score_gemma":0.0019772463,"teacher_disagreement_score":0.0057322355,"about_ca_system_score_codex":0.001507834,"about_ca_system_score_gemma":0.0013654928,"threshold_uncertainty_score":0.017228425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011930289,0.0002460614,0.9847654,0.00011642176,0.00012953782,0.000082917,0.000012418119,0.0005942378,0.0021226683],"genre_scores_gemma":[0.88367665,0.00024179771,0.11390918,0.00016822637,0.00011423133,0.00020496736,0.00003333788,0.000032445023,0.0016192388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997664,0.00004956017,0.00001747696,0.0000491994,0.00009362423,0.000023634782],"domain_scores_gemma":[0.99961627,0.0001147925,0.000046277153,0.000019222247,0.00018640305,0.000017028766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864271,0.0006526047,0.00048089624,0.00043769626,0.0004235124,0.00081855187,0.00090397074,0.00073972344,0.0011773002],"category_scores_gemma":[0.0009156146,0.00027175064,0.0002456593,0.00023026289,0.0005159102,0.00034639228,0.00032033463,0.00068877416,0.00037262277],"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.0004939108,0.00023213166,0.0010640282,0.00082356785,0.00012718867,0.00053347496,0.000655006,0.514756,0.14085694,0.03341619,0.006239867,0.3008017],"study_design_scores_gemma":[0.00012333754,0.00024244956,0.00027245874,0.000014498788,0.000031251893,0.00009091521,0.00002380684,0.9807366,0.0117897205,0.0038176007,0.0028440864,0.000013261184],"about_ca_topic_score_codex":0.0012190308,"about_ca_topic_score_gemma":0.0011395568,"teacher_disagreement_score":0.0012190308,"about_ca_system_score_codex":0.00046128343,"about_ca_system_score_gemma":0.00052782195,"threshold_uncertainty_score":0.003938496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21430013,0.0014351315,0.77088565,0.00071793847,0.00015281943,0.00014933135,0.00011196076,0.00024748757,0.011999593],"genre_scores_gemma":[0.9881563,0.0004541406,0.008459405,0.000053766224,0.00004030016,0.000063738364,0.00003695901,0.000028086542,0.0027073722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.00017445837,0.000022017657,0.00010629518,0.0002419012,0.00015170714],"domain_scores_gemma":[0.9976851,0.0013316141,0.00028529888,0.000050553263,0.0005290699,0.000118386524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017161049,0.00090284616,0.00067680934,0.0010666542,0.0005619001,0.0009281518,0.00095730403,0.0006862862,0.0020163313],"category_scores_gemma":[0.007244531,0.00038824207,0.00075482344,0.0003634797,0.0009205666,0.0013363212,0.0009880518,0.00094126124,0.000086216685],"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.00013104297,0.00004385298,0.0012261637,0.00010986548,0.000037052014,0.00019643927,0.00012665679,0.9368401,0.005819638,0.049344018,0.00046590858,0.005659256],"study_design_scores_gemma":[0.0000037212444,0.000011149546,0.00010173801,0.0000029780374,0.0000062579734,0.000010482232,0.0000068651125,0.9974789,0.00023898964,0.0020286706,0.000106407315,0.0000037980244],"about_ca_topic_score_codex":0.009414395,"about_ca_topic_score_gemma":0.0030695288,"teacher_disagreement_score":0.009414395,"about_ca_system_score_codex":0.002454509,"about_ca_system_score_gemma":0.001574382,"threshold_uncertainty_score":0.018719196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018323781,0.013906238,0.95694065,0.0012383381,0.00060765236,0.000063994376,0.000030856365,0.000100068864,0.008788442],"genre_scores_gemma":[0.7877756,0.021141395,0.18034351,0.0004394797,0.0020733306,0.00016152437,0.000103948085,0.000088723216,0.007872474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724436,0.000819451,0.00012747335,0.0009014408,0.0006079105,0.0002993766],"domain_scores_gemma":[0.99553263,0.0026059255,0.0002632318,0.0004941747,0.00096279033,0.00014117504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005377486,0.0008817128,0.0014597907,0.0015015726,0.0013962328,0.0026200875,0.002389527,0.0014714109,0.0021275715],"category_scores_gemma":[0.009290401,0.0005136198,0.0008047355,0.0025604654,0.0027531555,0.0068469127,0.00081516715,0.0018226391,0.00028472635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013063461,0.00011241748,0.001121115,0.0004975879,0.00011183279,0.00009232002,0.00031283507,0.1457504,0.006032895,0.68261963,0.0025904025,0.1606279],"study_design_scores_gemma":[0.000042354182,0.00019221191,0.00060016155,0.00008937814,0.00009471984,0.00017743853,0.00014814336,0.5816858,0.006047244,0.39387643,0.01698584,0.000060210175],"about_ca_topic_score_codex":0.004177691,"about_ca_topic_score_gemma":0.0011520941,"teacher_disagreement_score":0.005377486,"about_ca_system_score_codex":0.0034129994,"about_ca_system_score_gemma":0.0024918623,"threshold_uncertainty_score":0.028439224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974687,0.00021072372,0.0009576241,0.000032879878,0.000007399592,0.000016083502,0.00021973217,0.00009091569,0.0009959709],"genre_scores_gemma":[0.9987795,0.00013171595,0.00037010227,0.000007630375,0.000010482116,0.000007919881,0.0004707522,0.00001585866,0.00020614956],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992242,0.00016356818,0.0000511056,0.00011033389,0.00034218119,0.00010862777],"domain_scores_gemma":[0.99554765,0.0015945812,0.00075768505,0.00056281005,0.0012577527,0.00027950978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085761334,0.0003057766,0.00038336194,0.0035709077,0.0004369481,0.00076609966,0.00051352754,0.00047194344,0.00054293143],"category_scores_gemma":[0.00580954,0.00021087482,0.0002767198,0.002799569,0.00034717398,0.00096005877,0.00038013794,0.00081275107,0.00022939428],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009067088,0.000535896,0.79645264,0.00027041073,0.0003013484,0.0023086604,0.0025139924,0.042596318,0.045395993,0.0027295623,0.0037132807,0.102275185],"study_design_scores_gemma":[0.0000136443905,0.0004538717,0.83485967,0.000042058713,0.0001310037,0.0017321563,0.0009819049,0.1468297,0.010182579,0.0007733414,0.0039396468,0.000060527305],"about_ca_topic_score_codex":0.0045103556,"about_ca_topic_score_gemma":0.0028457781,"teacher_disagreement_score":0.0045103556,"about_ca_system_score_codex":0.0006717658,"about_ca_system_score_gemma":0.00022890136,"threshold_uncertainty_score":0.008968174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009024255,0.00017701421,0.9863599,0.00021098623,0.00008558305,0.000081283964,0.00006490016,0.0008806051,0.0031155793],"genre_scores_gemma":[0.2756332,0.00022970683,0.716691,0.00011413631,0.000084430074,0.00033196007,0.00021875656,0.0002538049,0.0064430684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.00009698698,0.00001961613,0.00007630112,0.00015411251,0.000096610616],"domain_scores_gemma":[0.999559,0.00018741513,0.000036256384,0.000085121086,0.00009551473,0.000036650858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058003,0.00073434855,0.0010500551,0.00054881367,0.0007757801,0.0012551711,0.0020118016,0.0008792279,0.00796548],"category_scores_gemma":[0.002319836,0.00048294524,0.00043444472,0.0010929852,0.0005211766,0.0015146262,0.0013022107,0.0011779773,0.0010058067],"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.0005555473,0.00019696198,0.0003377152,0.00012952485,0.000058507056,0.00007015211,0.000058811096,0.64046496,0.0054760575,0.057690762,0.008752531,0.28620842],"study_design_scores_gemma":[0.00009287617,0.000028558628,0.00003715902,0.0000035438068,0.000010554589,0.000017191525,0.000006253935,0.9829843,0.00088747265,0.014587039,0.0013374054,0.000007589102],"about_ca_topic_score_codex":0.0042780605,"about_ca_topic_score_gemma":0.004290255,"teacher_disagreement_score":0.00796548,"about_ca_system_score_codex":0.0010523018,"about_ca_system_score_gemma":0.0023833527,"threshold_uncertainty_score":0.02664715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01319421,0.00012183765,0.9046853,0.00015250097,0.000051680996,0.00019467912,0.00058458204,0.07693639,0.0040788245],"genre_scores_gemma":[0.29314741,0.00047826002,0.6808924,0.00028745751,0.00005919594,0.0008487469,0.00326164,0.0087564895,0.012268482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991455,0.00021057871,0.00009622771,0.00015123507,0.0003176389,0.00007871529],"domain_scores_gemma":[0.99814117,0.0012304315,0.00015774752,0.00023537308,0.00015609791,0.00007914317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019917258,0.00088949455,0.0006455449,0.0015557137,0.00058355875,0.0020796838,0.001708291,0.00078699144,0.008765339],"category_scores_gemma":[0.0036847845,0.0007006083,0.00056152395,0.0006525982,0.00069003756,0.0029594584,0.001830906,0.001286148,0.0015730305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010707692,0.00057728303,0.008312532,0.0008999242,0.00018587118,0.0021137474,0.0023919095,0.2071235,0.040568676,0.120387144,0.068836205,0.5475324],"study_design_scores_gemma":[0.00016951948,0.000087674474,0.000912968,0.00015868818,0.00005199076,0.00048338377,0.00014413822,0.8590094,0.022071915,0.026865195,0.08995766,0.000087440254],"about_ca_topic_score_codex":0.0017203711,"about_ca_topic_score_gemma":0.0016040076,"teacher_disagreement_score":0.008765339,"about_ca_system_score_codex":0.00086681073,"about_ca_system_score_gemma":0.000817699,"threshold_uncertainty_score":0.029322982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007017,0.00031788557,0.089321576,0.00023048,0.000075572876,0.00019035111,0.002166411,0.0050645387,0.0019314928],"genre_scores_gemma":[0.9793657,0.00011124367,0.017735152,0.000038932772,0.00001302737,0.0000794233,0.0020147786,0.000060407892,0.000581307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986809,0.0004270396,0.00011342422,0.0001969087,0.0004446794,0.00013703798],"domain_scores_gemma":[0.9877966,0.0064367778,0.000993969,0.0018457274,0.0025645313,0.00036227147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036980726,0.001058456,0.00056019926,0.0016261503,0.0004967386,0.00072401564,0.0016024817,0.0012714269,0.001026394],"category_scores_gemma":[0.01569637,0.00031315812,0.00047256716,0.0011275874,0.00045897064,0.0012767536,0.00049427827,0.0013767193,0.00055315153],"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.0021062104,0.0018915235,0.12318727,0.0003291503,0.00037900184,0.00032758078,0.00022570419,0.7155385,0.040988486,0.0027105252,0.0029401646,0.10937592],"study_design_scores_gemma":[0.000031078624,0.0003186621,0.008130492,0.000011755047,0.000014932721,0.00007080835,0.0000218537,0.97874475,0.011904002,0.0004468931,0.00028472676,0.000020061161],"about_ca_topic_score_codex":0.020645073,"about_ca_topic_score_gemma":0.010280986,"teacher_disagreement_score":0.020645073,"about_ca_system_score_codex":0.0008250201,"about_ca_system_score_gemma":0.0011758975,"threshold_uncertainty_score":0.041049838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95691675,0.00065553474,0.03134092,0.00016868036,0.00007673554,0.00007539357,0.00020068383,0.0012583296,0.009306913],"genre_scores_gemma":[0.99829596,0.00007335435,0.0012251912,0.000018147437,0.0000045189176,0.000012427445,0.00006784097,0.000021629949,0.00028092897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845016,0.00023694479,0.000043286458,0.00021074708,0.00066961616,0.00038911137],"domain_scores_gemma":[0.99519944,0.0026346704,0.00028926658,0.00022667991,0.0014805865,0.00016930523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579465,0.0007515158,0.00064994686,0.0012927196,0.000735996,0.0008753489,0.0008249446,0.00058457215,0.0015386693],"category_scores_gemma":[0.004736497,0.00016872112,0.00024949928,0.0009644139,0.00059008214,0.0006743145,0.00035575556,0.00069337443,0.00019744258],"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.002658886,0.0005360471,0.018312663,0.00030660274,0.0001729478,0.00076431857,0.0003871465,0.7993058,0.10411225,0.009035545,0.004248452,0.060159344],"study_design_scores_gemma":[0.000014558,0.00016641091,0.0020853383,0.00000730059,0.00001803429,0.00006364345,0.000035570545,0.98101497,0.016064914,0.00028162365,0.00023346442,0.000014268269],"about_ca_topic_score_codex":0.0110393,"about_ca_topic_score_gemma":0.0031131818,"teacher_disagreement_score":0.0110393,"about_ca_system_score_codex":0.0019015515,"about_ca_system_score_gemma":0.00094727235,"threshold_uncertainty_score":0.021950066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99417007,0.00009366138,0.0046761944,0.000040125786,0.0000084028925,0.000012847448,0.00004848451,0.0000758213,0.00087437197],"genre_scores_gemma":[0.99911934,0.00003227816,0.0005195499,0.0000046036994,0.0000036279598,0.0000044960852,0.00006331605,0.000010377851,0.0002423951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984577,0.0006166495,0.000075925105,0.00011032361,0.0005437154,0.0001957601],"domain_scores_gemma":[0.99184084,0.005209403,0.0005331183,0.00033803674,0.0017850264,0.00029356033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020229772,0.00040281683,0.00035625804,0.0013157567,0.00042540723,0.0006129029,0.0004871197,0.00042232123,0.0006400489],"category_scores_gemma":[0.0104585,0.00015494795,0.00016119622,0.0009380977,0.0004874427,0.00079822436,0.00028481922,0.00036982735,0.00010900517],"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.0035628013,0.00096634,0.07803035,0.00024659862,0.00013447904,0.0006523252,0.0010961393,0.7765287,0.066731475,0.006605665,0.0016294963,0.06381563],"study_design_scores_gemma":[0.000016071985,0.00037728267,0.019109726,0.000011570233,0.000033270277,0.00015835922,0.00018336631,0.9673035,0.011666181,0.00083613634,0.00028677174,0.000017664352],"about_ca_topic_score_codex":0.006935146,"about_ca_topic_score_gemma":0.003978935,"teacher_disagreement_score":0.006935146,"about_ca_system_score_codex":0.0014764068,"about_ca_system_score_gemma":0.0003941754,"threshold_uncertainty_score":0.013789594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07331382,0.00210954,0.87067014,0.0026640368,0.00046659395,0.00011059096,0.0001409444,0.00022795777,0.05029632],"genre_scores_gemma":[0.9340519,0.0012891345,0.04866744,0.00041826174,0.0007947644,0.00013234241,0.00006413138,0.00009066324,0.014491387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.0013139689,0.000097089476,0.0005057552,0.0009706675,0.0007810251],"domain_scores_gemma":[0.9952531,0.00305012,0.00051798933,0.00027035183,0.0005261974,0.00038227515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040208413,0.0012322705,0.001131628,0.0006564335,0.0016441443,0.003685366,0.0022390254,0.0016996777,0.005235863],"category_scores_gemma":[0.010702827,0.00064491585,0.00066955783,0.0011639827,0.0026903332,0.0056839716,0.0016923711,0.0021119355,0.00066317635],"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.00022234739,0.000074135336,0.00043115087,0.00009630751,0.00003144955,0.00016772732,0.0002676816,0.087519765,0.0013732814,0.897642,0.0020446314,0.010129583],"study_design_scores_gemma":[0.00007585231,0.00009644776,0.00022335326,0.000026847069,0.000033305016,0.00020379045,0.00010270963,0.44181544,0.00080420176,0.5487029,0.007890996,0.000024188705],"about_ca_topic_score_codex":0.0038875183,"about_ca_topic_score_gemma":0.0018649182,"teacher_disagreement_score":0.005235863,"about_ca_system_score_codex":0.0029993912,"about_ca_system_score_gemma":0.0031004718,"threshold_uncertainty_score":0.021762252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10716857,0.0011134552,0.8302135,0.0027548438,0.0003650313,0.0004889342,0.00011886984,0.006923434,0.050853338],"genre_scores_gemma":[0.57131076,0.0012351783,0.39883924,0.00052507746,0.0002574189,0.0005587041,0.0003180352,0.00031632948,0.026639361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995214,0.00014443706,0.000037829195,0.00006726999,0.0001505292,0.00007866774],"domain_scores_gemma":[0.9994844,0.00008975499,0.00003924023,0.00010363654,0.00019137014,0.000091638605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008569081,0.00037526488,0.0003573123,0.00080989365,0.001416394,0.0022864235,0.001160225,0.0013629574,0.0043959743],"category_scores_gemma":[0.001077675,0.0004507324,0.00040761975,0.0008243462,0.0010783364,0.002664371,0.0019815397,0.0011096388,0.001355749],"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.00033910657,0.00025993682,0.0026458844,0.00036556495,0.00011269233,0.0008248714,0.0015376803,0.08456176,0.051348254,0.68643755,0.019545995,0.15202077],"study_design_scores_gemma":[0.000119064935,0.0002477223,0.0009061867,0.00012597369,0.00014044512,0.00044294895,0.00033937403,0.66279364,0.011367987,0.19509771,0.12832819,0.000090782625],"about_ca_topic_score_codex":0.0029427093,"about_ca_topic_score_gemma":0.0038347724,"teacher_disagreement_score":0.0043959743,"about_ca_system_score_codex":0.001568138,"about_ca_system_score_gemma":0.00104489,"threshold_uncertainty_score":0.014705956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010902566,0.00021505596,0.9869889,0.00010036929,0.00003113016,0.000017725913,0.000023363224,0.00035137788,0.0013694783],"genre_scores_gemma":[0.9305304,0.0003799528,0.06614011,0.00008053859,0.000063009975,0.0001036386,0.00009108732,0.00006208998,0.0025492674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996055,0.000107695305,0.000019635976,0.00009621548,0.00010626474,0.000064668995],"domain_scores_gemma":[0.9993679,0.0004045039,0.00006550039,0.00003392235,0.00011545139,0.00001274009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008132419,0.00058462593,0.0008155929,0.00032048032,0.00027662195,0.0006409055,0.0006228274,0.00069265027,0.0013293284],"category_scores_gemma":[0.0021412424,0.0003113051,0.00036558497,0.0004767328,0.00051061745,0.0009686258,0.0004247068,0.00081316475,0.00030002368],"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.00005266658,0.000025321784,0.0002639386,0.000038222795,0.000025255486,0.000025669722,0.000031692798,0.9564367,0.0033613231,0.0040761596,0.00060217374,0.035060883],"study_design_scores_gemma":[0.0000039041724,0.000008193581,0.00009338621,0.0000019332142,0.0000038594676,0.000003628,0.000002161493,0.9981838,0.000641644,0.0008627313,0.00019023007,0.0000044989015],"about_ca_topic_score_codex":0.009612548,"about_ca_topic_score_gemma":0.007467582,"teacher_disagreement_score":0.009612548,"about_ca_system_score_codex":0.000983483,"about_ca_system_score_gemma":0.00094697997,"threshold_uncertainty_score":0.019113243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23820327,0.0007885078,0.75352955,0.0009927549,0.00016445744,0.00013762784,0.00023351701,0.00026801164,0.005682213],"genre_scores_gemma":[0.9728,0.00038668266,0.023380786,0.000103182356,0.000057770314,0.000078809484,0.00010551266,0.00007363597,0.0030136337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.00066593394,0.00003248737,0.0001403806,0.00014195083,0.00024345437],"domain_scores_gemma":[0.9945909,0.004070919,0.00045772817,0.00011552956,0.00041504757,0.00034987862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030146854,0.0012922358,0.0020581873,0.0012212895,0.0008667835,0.0018847622,0.0019081996,0.0016706215,0.0022603334],"category_scores_gemma":[0.007108002,0.0013815127,0.0007278919,0.0015955376,0.0017562372,0.0019750362,0.0014761068,0.0011034643,0.0001531252],"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.000055833276,0.000015600763,0.00012225863,0.00001428072,0.000016295879,0.000015987107,0.000008206916,0.9921715,0.00013019377,0.005741763,0.00026123135,0.001446837],"study_design_scores_gemma":[0.000007013045,0.000012541942,0.000036273046,0.0000016179256,0.000004497359,0.0000036271608,0.0000034888951,0.9959914,0.000030410014,0.0038684001,0.00003834209,0.0000023982736],"about_ca_topic_score_codex":0.007164742,"about_ca_topic_score_gemma":0.005952883,"teacher_disagreement_score":0.007164742,"about_ca_system_score_codex":0.0025146813,"about_ca_system_score_gemma":0.0019947998,"threshold_uncertainty_score":0.01824534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15971783,0.00074740354,0.832945,0.00028364314,0.00030758165,0.00013023429,0.000056254943,0.0014570444,0.004355],"genre_scores_gemma":[0.9446335,0.00019288831,0.05250341,0.00011486854,0.0000847989,0.000037397953,0.00005386492,0.000068906564,0.0023104132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980451,0.00053874846,0.000114756884,0.000280173,0.0008529264,0.00016826122],"domain_scores_gemma":[0.99546826,0.0014596322,0.00046694776,0.00089709734,0.0015210919,0.0001869788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029948044,0.0008299217,0.0005202658,0.0010579046,0.0003992909,0.0014737367,0.0016038754,0.0005361716,0.0010488179],"category_scores_gemma":[0.01129811,0.00026756315,0.0002902292,0.00074063655,0.00086564815,0.0020587398,0.000992493,0.0011560759,0.00036680035],"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.0010500362,0.00041109518,0.00435142,0.00020422495,0.00011233268,0.00043926472,0.00046587895,0.5112339,0.11576364,0.092580944,0.002806261,0.27058104],"study_design_scores_gemma":[0.000024425375,0.00012618664,0.00045418635,0.000010223354,0.000020689256,0.00013570268,0.000020002826,0.96633375,0.015449943,0.015730802,0.0016694407,0.000024718243],"about_ca_topic_score_codex":0.001158292,"about_ca_topic_score_gemma":0.0008568395,"teacher_disagreement_score":0.0029948044,"about_ca_system_score_codex":0.0011885733,"about_ca_system_score_gemma":0.0006381326,"threshold_uncertainty_score":0.015838206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15655747,0.0019779122,0.8353977,0.00032149584,0.00022556292,0.00007165337,0.000024909212,0.002191106,0.0032321725],"genre_scores_gemma":[0.93987626,0.0004027436,0.05838593,0.00007295392,0.00013143719,0.00002528822,0.000024761337,0.0000665787,0.0010139617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986941,0.00031774983,0.00007538105,0.00015748142,0.0005809856,0.00017432802],"domain_scores_gemma":[0.9971738,0.0012895367,0.00034762465,0.0004934687,0.00057796773,0.00011764623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018143428,0.0006301591,0.000680794,0.00047127903,0.00027607157,0.001282182,0.00144126,0.00056778174,0.0009843094],"category_scores_gemma":[0.008028937,0.0002468586,0.00022700006,0.0004193408,0.0006283895,0.0019920925,0.0011208213,0.0013142888,0.00022127773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067551003,0.0006806326,0.004060843,0.00027205408,0.00012439363,0.00027665764,0.0003109469,0.38330626,0.14680095,0.035379373,0.0028325394,0.42527986],"study_design_scores_gemma":[0.00006771264,0.00010574411,0.0005786673,0.0000155812,0.00004400174,0.00007004166,0.000009768206,0.97825694,0.015932009,0.0033321017,0.0015636114,0.000023780209],"about_ca_topic_score_codex":0.0011693275,"about_ca_topic_score_gemma":0.0009633348,"teacher_disagreement_score":0.0018143428,"about_ca_system_score_codex":0.00046879397,"about_ca_system_score_gemma":0.0004850391,"threshold_uncertainty_score":0.009595215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27710077,0.00035903387,0.71803635,0.00021167428,0.00006847911,0.00008824192,0.000055680288,0.00017662215,0.0039032216],"genre_scores_gemma":[0.9875137,0.00013237334,0.011822964,0.00002205179,0.000014234095,0.000023442508,0.000022143271,0.0000131456545,0.00043591813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00043675004,0.000037795133,0.00005579827,0.00014879624,0.000052715106],"domain_scores_gemma":[0.9966067,0.0024525544,0.00030066108,0.0001528495,0.00039929248,0.00008789906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026078643,0.00060160796,0.00056817714,0.0007829764,0.00044277127,0.0007743923,0.0007329492,0.0008130733,0.00042538732],"category_scores_gemma":[0.008769869,0.00032993057,0.00048793267,0.00061013683,0.0006909533,0.0008644761,0.00047257976,0.00063633034,0.000078277684],"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.000036246944,0.000043108314,0.0007819621,0.000016720018,0.000019869454,0.00004819185,0.000028465642,0.97102296,0.0016545387,0.021536963,0.00010329211,0.004707711],"study_design_scores_gemma":[0.000001335757,0.0000070620786,0.000037343827,9.1480644e-7,0.0000022389142,0.0000032552628,0.000001268894,0.9986545,0.00013426371,0.0011380614,0.00001858994,0.0000012482298],"about_ca_topic_score_codex":0.0043264544,"about_ca_topic_score_gemma":0.0022825284,"teacher_disagreement_score":0.0043264544,"about_ca_system_score_codex":0.0010367932,"about_ca_system_score_gemma":0.0005393912,"threshold_uncertainty_score":0.013791859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017908426,0.0001714208,0.97966605,0.0001373961,0.0000642814,0.000042577132,0.000017143331,0.00012363838,0.0018689977],"genre_scores_gemma":[0.9597617,0.00014627498,0.03813844,0.00006535505,0.00005737122,0.00009076489,0.000032061274,0.000019419718,0.0016885997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995815,0.00010530111,0.000016432576,0.00010448145,0.00013018635,0.00006204097],"domain_scores_gemma":[0.9995264,0.00015538708,0.000093866714,0.000030055728,0.00015138583,0.000042816097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071365654,0.0007898539,0.00059600524,0.0003276324,0.00048706582,0.0008950615,0.0011742646,0.0006994868,0.0008813567],"category_scores_gemma":[0.0010192795,0.00019808466,0.00036660963,0.0002879792,0.00067587086,0.00070933776,0.00072790886,0.00082305784,0.00008667023],"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.00007749983,0.000060111248,0.00035188248,0.000110188346,0.00003937048,0.00017868608,0.00012203812,0.9082348,0.01063651,0.039793573,0.0014170008,0.038978267],"study_design_scores_gemma":[0.00000989712,0.000044886114,0.000049040602,0.0000024121669,0.000006655051,0.00001140121,0.0000050317713,0.9973572,0.0004698929,0.0016232971,0.0004164944,0.0000037952473],"about_ca_topic_score_codex":0.0051899003,"about_ca_topic_score_gemma":0.004270513,"teacher_disagreement_score":0.0051899003,"about_ca_system_score_codex":0.0012776672,"about_ca_system_score_gemma":0.0012109465,"threshold_uncertainty_score":0.010319352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60977435,0.0028412493,0.20881633,0.008501849,0.00020279996,0.000536684,0.0009363841,0.000110031324,0.16828029],"genre_scores_gemma":[0.9806748,0.0012901819,0.00625432,0.000119754135,0.00008083675,0.00016822842,0.00013924936,0.000021115295,0.01125161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989436,0.0004937502,0.000021503585,0.000091865455,0.00015270757,0.00029651792],"domain_scores_gemma":[0.9975943,0.0014814435,0.0003558336,0.000074335956,0.00021512325,0.000278948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020409536,0.0006777608,0.0005782163,0.0014243354,0.0014691841,0.003025733,0.0011234676,0.0018311344,0.008864289],"category_scores_gemma":[0.007598872,0.000616025,0.0008621398,0.0014985078,0.0020147804,0.0052931006,0.0013815917,0.0017290538,0.00035904182],"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.0001476419,0.00011856258,0.002462567,0.00007986985,0.00004480891,0.00027186103,0.00012612125,0.36810777,0.0006991694,0.6128392,0.0045185382,0.010583802],"study_design_scores_gemma":[0.00006416072,0.000112769136,0.002662941,0.00005186092,0.000050270024,0.000120290926,0.0004065904,0.77642643,0.00024075732,0.21442251,0.005397738,0.000043677435],"about_ca_topic_score_codex":0.010087211,"about_ca_topic_score_gemma":0.0069857715,"teacher_disagreement_score":0.010087211,"about_ca_system_score_codex":0.007254013,"about_ca_system_score_gemma":0.002384683,"threshold_uncertainty_score":0.052631855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01408493,0.0002130932,0.9830125,0.00015880825,0.000035368972,0.00006693136,0.000012702279,0.00026071203,0.00215491],"genre_scores_gemma":[0.7315619,0.0004274736,0.26393762,0.00014611971,0.00011793838,0.00022380173,0.00004676586,0.00012256308,0.003415902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971853,0.0012321691,0.00014838953,0.00036326709,0.00079565553,0.0002753245],"domain_scores_gemma":[0.9952083,0.0025172008,0.00045676174,0.00066793675,0.0008787092,0.00027097983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034305186,0.00071647303,0.00065305986,0.00071276247,0.00080560514,0.0016554216,0.0025485135,0.0012894984,0.0019693605],"category_scores_gemma":[0.0087279575,0.00075277616,0.00039904285,0.00049987034,0.0013544803,0.0029092818,0.0023398097,0.0016900942,0.00045074013],"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.0008581033,0.00028091224,0.0014406332,0.00046882132,0.000095143616,0.0002626849,0.0005105077,0.50424975,0.020247472,0.28540394,0.0027025363,0.18347941],"study_design_scores_gemma":[0.00009550952,0.00047676082,0.00017881328,0.00004578949,0.00007329257,0.0001676404,0.00008381313,0.89691937,0.008180987,0.088393115,0.005358925,0.00002593445],"about_ca_topic_score_codex":0.0004127096,"about_ca_topic_score_gemma":0.0007088313,"teacher_disagreement_score":0.0034305186,"about_ca_system_score_codex":0.000733762,"about_ca_system_score_gemma":0.0007343891,"threshold_uncertainty_score":0.018142521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014143861,0.00023137999,0.983186,0.0001145769,0.00011335312,0.000044021937,0.000012385002,0.00023981299,0.0019145989],"genre_scores_gemma":[0.9286709,0.00017679852,0.06819407,0.00008282241,0.00007719765,0.00010140561,0.00004041391,0.000022166718,0.0026343847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997278,0.00004287016,0.0000121606045,0.00008261722,0.000105101695,0.000029489645],"domain_scores_gemma":[0.9997887,0.000047762762,0.000029943752,0.000023518032,0.000088208304,0.000021950462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299872,0.0005207545,0.00033843052,0.00026750908,0.00032035782,0.00045849578,0.0009510846,0.00038625207,0.0009154785],"category_scores_gemma":[0.00060387165,0.00012284362,0.00023051376,0.00017860324,0.0003967898,0.00054431806,0.00050452945,0.00055475265,0.000110170324],"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.0002134989,0.00017034922,0.0005150915,0.00018685275,0.00006901424,0.00024817788,0.00023539546,0.6285318,0.062213328,0.08056025,0.00358088,0.22347538],"study_design_scores_gemma":[0.000028250184,0.00010297767,0.00009938168,0.0000041717094,0.000013884058,0.000026951448,0.000008393157,0.99154586,0.003033289,0.0033520677,0.0017767953,0.0000079829115],"about_ca_topic_score_codex":0.0018372411,"about_ca_topic_score_gemma":0.0016889722,"teacher_disagreement_score":0.0018372411,"about_ca_system_score_codex":0.0006332808,"about_ca_system_score_gemma":0.0006090201,"threshold_uncertainty_score":0.004594803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22198738,0.00017829411,0.7754467,0.000053093707,0.000051813855,0.000053083375,0.00013311717,0.00038781203,0.0017086569],"genre_scores_gemma":[0.8934847,0.00017694403,0.10537645,0.000008545368,0.000010076146,0.000045527355,0.00013270036,0.00005844936,0.0007065437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981016,0.00004559022,0.000011731416,0.000037691847,0.00008030198,0.000014525625],"domain_scores_gemma":[0.99926406,0.00048154552,0.00008078699,0.00006090357,0.000093042465,0.000019633673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368835,0.00032188612,0.0002093303,0.00035395924,0.0001764015,0.00037059461,0.00030658895,0.00025566958,0.0005338623],"category_scores_gemma":[0.0023132656,0.00017889333,0.00025207782,0.00022976198,0.00024483923,0.00037926613,0.000228717,0.00032711556,0.00007079208],"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.000232567,0.00008372724,0.0019988888,0.00017389104,0.00002557604,0.00020203402,0.0002447369,0.783494,0.121522546,0.019513896,0.0002834658,0.07222461],"study_design_scores_gemma":[0.0000067957767,0.000049315935,0.00029731618,0.000004573359,0.000005791195,0.000042833435,0.000022639413,0.9752841,0.021737348,0.0017044212,0.0008377787,0.0000069971557],"about_ca_topic_score_codex":0.0010922275,"about_ca_topic_score_gemma":0.0009891551,"teacher_disagreement_score":0.0010922275,"about_ca_system_score_codex":0.0005781179,"about_ca_system_score_gemma":0.00031745824,"threshold_uncertainty_score":0.0041945577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018299907,0.0008419907,0.9721168,0.00044950945,0.00018265539,0.0003239854,0.00019199784,0.0016657496,0.0059273997],"genre_scores_gemma":[0.37714604,0.000982412,0.6160899,0.00017738249,0.00019161886,0.00073551614,0.00092012936,0.00015700237,0.0036001015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927026,0.00019256586,0.00004780123,0.000056469904,0.00037775247,0.000055239376],"domain_scores_gemma":[0.9994313,0.00018236446,0.00008023061,0.00009615194,0.00016151619,0.000048460126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093017967,0.00043968784,0.00046085665,0.0008434794,0.00073021214,0.00059580815,0.0008920208,0.00054058165,0.0018004255],"category_scores_gemma":[0.0020236906,0.00022302772,0.00043809254,0.0008497593,0.0004123527,0.001064196,0.0013728883,0.0006337016,0.00046302026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031343655,0.00014562343,0.00084448163,0.000650932,0.0001519143,0.001374518,0.00050544407,0.25171578,0.08830074,0.24767087,0.029003318,0.3793229],"study_design_scores_gemma":[0.00014894472,0.00024997815,0.00040742624,0.00007759279,0.00008401872,0.00065224915,0.00009446073,0.8153338,0.017646138,0.10947286,0.05577628,0.000056336856],"about_ca_topic_score_codex":0.000541319,"about_ca_topic_score_gemma":0.0006822554,"teacher_disagreement_score":0.0018004255,"about_ca_system_score_codex":0.00043036218,"about_ca_system_score_gemma":0.0006711966,"threshold_uncertainty_score":0.0060229897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6914693,0.0002630649,0.29780605,0.00013775475,0.000091889146,0.00024898504,0.000060861592,0.0022694347,0.0076526874],"genre_scores_gemma":[0.95331377,0.00016588722,0.043768156,0.000051946754,0.000025152242,0.000039869847,0.00008990654,0.00010182501,0.0024435322],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996227,0.00009100643,0.000025260102,0.000060528837,0.00014562979,0.00005480871],"domain_scores_gemma":[0.99854666,0.0005377577,0.000114953036,0.00022463355,0.0005248686,0.000051080395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005663351,0.0005449452,0.0004423985,0.00043927916,0.0002972752,0.0008056505,0.0011468972,0.00033189252,0.0017334356],"category_scores_gemma":[0.0030528044,0.00018180322,0.00014725572,0.00033137656,0.00022023795,0.0010073329,0.00039214102,0.0005920818,0.00027887305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015050306,0.0009496278,0.01116172,0.00029624408,0.00012255828,0.0007085061,0.0007031138,0.19153392,0.45851102,0.005162486,0.0032620633,0.3260838],"study_design_scores_gemma":[0.000078399265,0.00062460743,0.0036078594,0.00001847605,0.00009139529,0.0004290535,0.00009626147,0.7867806,0.20108809,0.001656056,0.0055013625,0.000027846783],"about_ca_topic_score_codex":0.0022120313,"about_ca_topic_score_gemma":0.0017355252,"teacher_disagreement_score":0.0022120313,"about_ca_system_score_codex":0.0005742386,"about_ca_system_score_gemma":0.0003111541,"threshold_uncertainty_score":0.0057988763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96736664,0.001237896,0.02833748,0.0002084152,0.00010546377,0.0000730467,0.000049846974,0.0007958702,0.0018252543],"genre_scores_gemma":[0.9885815,0.0001909027,0.010544329,0.000053535623,0.0000459018,0.000028359598,0.00008107278,0.000030633113,0.00044383033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656457,0.00089877547,0.00041302427,0.0003467468,0.0014824789,0.00029435317],"domain_scores_gemma":[0.9770289,0.0129460655,0.0028678032,0.003953374,0.002705667,0.0004983048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065171034,0.0006824209,0.0005783982,0.0007830025,0.0003901558,0.0013694722,0.0012637922,0.0009992531,0.0005961603],"category_scores_gemma":[0.024735259,0.00033397024,0.0002535675,0.0006248617,0.0008545275,0.002717185,0.00092360243,0.001192049,0.00014133519],"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.010458084,0.002505843,0.025185708,0.00058916863,0.0002832405,0.0006670281,0.000763719,0.44839036,0.18452609,0.015996262,0.0023141964,0.30832028],"study_design_scores_gemma":[0.00018111693,0.0030931646,0.0060981405,0.00004664848,0.00014703668,0.00048994744,0.000087788314,0.9159534,0.06948216,0.0024688544,0.0018848291,0.00006690911],"about_ca_topic_score_codex":0.00065784896,"about_ca_topic_score_gemma":0.00062586274,"teacher_disagreement_score":0.0065171034,"about_ca_system_score_codex":0.000799576,"about_ca_system_score_gemma":0.00072319055,"threshold_uncertainty_score":0.034466088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16246064,0.00020457526,0.8327295,0.00025586714,0.000057528094,0.00014193953,0.00034527294,0.0004099438,0.003394721],"genre_scores_gemma":[0.96116656,0.0003560254,0.034471925,0.000052405085,0.00005354791,0.00017428459,0.0002675152,0.000044959004,0.0034128684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00012621593,0.000027852931,0.00008857943,0.00016165078,0.00007529263],"domain_scores_gemma":[0.998871,0.0004427203,0.00020278309,0.00012195801,0.00031091817,0.00005052906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012318223,0.0005398191,0.00044810367,0.00061607786,0.00038174362,0.0008151943,0.001107674,0.0010009687,0.0013753236],"category_scores_gemma":[0.0035649184,0.00030672958,0.0005867089,0.0006893674,0.0005498881,0.0010357507,0.0004912005,0.0009648849,0.0004727866],"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.000032709744,0.000060835042,0.0035497933,0.000029875897,0.000015394598,0.00012408193,0.000063408464,0.96403354,0.003978237,0.018773133,0.00067897176,0.0086600855],"study_design_scores_gemma":[9.180798e-7,0.0000063633847,0.0002034054,8.428269e-7,0.0000015607417,0.000008262584,0.000002055471,0.9984586,0.00022545585,0.0009816003,0.00010895774,0.0000018923284],"about_ca_topic_score_codex":0.01051603,"about_ca_topic_score_gemma":0.0046257116,"teacher_disagreement_score":0.01051603,"about_ca_system_score_codex":0.0008172838,"about_ca_system_score_gemma":0.0009397862,"threshold_uncertainty_score":0.020909607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06180712,0.00033760676,0.93501586,0.00009458172,0.00004935915,0.00007777335,0.000012647473,0.0006088015,0.0019962674],"genre_scores_gemma":[0.8976976,0.000091479815,0.10126666,0.000044185097,0.00003463098,0.00005192552,0.000017759032,0.000021261836,0.00077441504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.0001856741,0.00003589824,0.00011884004,0.00029789266,0.00009093491],"domain_scores_gemma":[0.9987431,0.0006673145,0.00014382748,0.0001245286,0.00026588733,0.000055388387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011687913,0.00048367892,0.0004356551,0.0006552625,0.00051049143,0.0007364026,0.0011412618,0.0005299099,0.00087700854],"category_scores_gemma":[0.0034225967,0.00012810844,0.00017480417,0.00029298765,0.00048334934,0.0008747761,0.0005494428,0.000692132,0.00013119358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050523016,0.00026227674,0.0014221529,0.00015581348,0.00003103783,0.00014397822,0.00022934574,0.33659288,0.06544362,0.039444752,0.0017827369,0.55398613],"study_design_scores_gemma":[0.00002603317,0.00011737758,0.00025845502,0.00000541379,0.000008640658,0.000063995416,0.000014610878,0.9834277,0.011776441,0.0031713096,0.0011225248,0.0000075107573],"about_ca_topic_score_codex":0.0019419425,"about_ca_topic_score_gemma":0.0015365143,"teacher_disagreement_score":0.0019419425,"about_ca_system_score_codex":0.0005361923,"about_ca_system_score_gemma":0.0003836643,"threshold_uncertainty_score":0.00618124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30718976,0.00013448067,0.6760896,0.00018632496,0.00004764465,0.000361388,0.0008316966,0.013619728,0.0015393529],"genre_scores_gemma":[0.7843344,0.00005667825,0.21352908,0.0000484413,0.000009468996,0.000282498,0.0008998845,0.00050724024,0.0003323406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842286,0.00054725277,0.00013037221,0.00025029777,0.00052650674,0.0001227273],"domain_scores_gemma":[0.990189,0.0054645417,0.0012604155,0.0016550099,0.0012173405,0.00021363879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002201734,0.0010858927,0.00064643024,0.0012173267,0.00035715222,0.0011349418,0.0013899654,0.0006133476,0.0007063867],"category_scores_gemma":[0.012861004,0.00065738894,0.00040823454,0.0006776077,0.00042060128,0.0012637187,0.0008500022,0.00087566837,0.00017474299],"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.0004553196,0.00039493074,0.018521367,0.00021297584,0.00007370644,0.0002721946,0.00038659098,0.80831593,0.04531979,0.006089641,0.0028413166,0.11711623],"study_design_scores_gemma":[0.000011653647,0.000046667523,0.00045167594,0.0000032711073,0.000004107515,0.00001701075,0.000015399268,0.98829556,0.009453784,0.001396496,0.00029746784,0.000006923613],"about_ca_topic_score_codex":0.0028377278,"about_ca_topic_score_gemma":0.003847747,"teacher_disagreement_score":0.0028377278,"about_ca_system_score_codex":0.0012110907,"about_ca_system_score_gemma":0.0012202488,"threshold_uncertainty_score":0.011644006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038636897,0.000109215245,0.9926871,0.00015931147,0.00002059157,0.000007556153,0.000021840757,0.000049825543,0.00308085],"genre_scores_gemma":[0.7368475,0.001611649,0.25003177,0.00030292213,0.0003962099,0.00013693764,0.00012923309,0.00015108561,0.010392667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996611,0.000103864055,0.000013284103,0.000053692984,0.0001310459,0.000037009504],"domain_scores_gemma":[0.99951506,0.00020290552,0.000060391092,0.00008087913,0.000108504595,0.000032176285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000776915,0.0004856664,0.00044442486,0.0005982692,0.00044769765,0.0014855518,0.0008521476,0.00058660883,0.0016312724],"category_scores_gemma":[0.0016387634,0.00020881997,0.000587096,0.0007880567,0.0012621075,0.0028258371,0.0007731609,0.001434667,0.00035913184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014115871,0.000012989002,0.00021670523,0.000022804063,0.000008729906,0.000060324597,0.000087745655,0.16420704,0.0027552492,0.81766593,0.00066575775,0.014282564],"study_design_scores_gemma":[0.0000027427009,0.000010601543,0.00008140258,0.000005690568,0.0000034712505,0.000030276107,0.000025009025,0.6930219,0.00079171086,0.3018439,0.0041758567,0.0000074037457],"about_ca_topic_score_codex":0.0020394216,"about_ca_topic_score_gemma":0.00083603413,"teacher_disagreement_score":0.0020394216,"about_ca_system_score_codex":0.00092856266,"about_ca_system_score_gemma":0.0007633694,"threshold_uncertainty_score":0.006737232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051571008,0.0007802685,0.9391443,0.0012453028,0.00017288797,0.00005924865,0.00008771435,0.00029430026,0.0066449917],"genre_scores_gemma":[0.96237487,0.0004455808,0.031984687,0.00008997134,0.00014329853,0.00006731606,0.00006519271,0.00007408672,0.0047549703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796957,0.00090885424,0.00004871485,0.00022288006,0.0004435986,0.00040641596],"domain_scores_gemma":[0.9976926,0.0014855986,0.0001601829,0.00013766644,0.00034709458,0.00017686856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025357045,0.0009867079,0.0018260325,0.000974274,0.0008259553,0.0028532585,0.0023740297,0.0014356797,0.0026956622],"category_scores_gemma":[0.009101807,0.0009939858,0.0008399716,0.0013690444,0.0015921269,0.0032849074,0.0015995611,0.0018414363,0.000325175],"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.00012161272,0.000050093924,0.00020402204,0.000019878611,0.000025496129,0.000029833194,0.00003662944,0.9118369,0.00036086256,0.07749737,0.00092709257,0.008890224],"study_design_scores_gemma":[0.000008217437,0.000003991735,0.000021867032,0.0000011750384,0.000003559948,0.0000029832402,0.0000030007943,0.9880023,0.00003677627,0.011850295,0.000062663035,0.0000032249752],"about_ca_topic_score_codex":0.014022838,"about_ca_topic_score_gemma":0.007774196,"teacher_disagreement_score":0.014022838,"about_ca_system_score_codex":0.0040396233,"about_ca_system_score_gemma":0.0027826594,"threshold_uncertainty_score":0.02930969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16400479,0.00052974204,0.83258194,0.00020892332,0.0001421308,0.00016466813,0.00004009014,0.0007043568,0.00162328],"genre_scores_gemma":[0.9237022,0.00012872167,0.07507682,0.00005228481,0.000052902487,0.00007741747,0.000034900448,0.000014825702,0.00085991493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997008,0.000081179336,0.000020192127,0.000039093695,0.00010216583,0.000056648154],"domain_scores_gemma":[0.9996362,0.000094367126,0.000050549632,0.000091158094,0.00008808692,0.000039752005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007770231,0.00041432006,0.00046525607,0.00059419754,0.0007731185,0.00046573265,0.0011438717,0.00041149787,0.0005141329],"category_scores_gemma":[0.0015631864,0.00015974474,0.0002482199,0.00030373433,0.0004926261,0.0009046834,0.00075592624,0.00039367838,0.00009576503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006606625,0.00047123173,0.0018217067,0.00017665545,0.00010877964,0.0004926088,0.00030695013,0.25928193,0.16135779,0.05706703,0.0036076552,0.51464695],"study_design_scores_gemma":[0.00005943708,0.0003187729,0.00072607957,0.000011491874,0.000053667438,0.00022657908,0.00003860138,0.9654164,0.02185393,0.00804005,0.0032217957,0.000033301967],"about_ca_topic_score_codex":0.0012129991,"about_ca_topic_score_gemma":0.0020293293,"teacher_disagreement_score":0.0012129991,"about_ca_system_score_codex":0.0006284006,"about_ca_system_score_gemma":0.0005359892,"threshold_uncertainty_score":0.004559338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9240777,0.0010503385,0.07012043,0.00018944535,0.00012512668,0.000068738445,0.000027446791,0.0011657813,0.0031749753],"genre_scores_gemma":[0.99528694,0.000077468525,0.0043019066,0.000023727225,0.000024285084,0.000008562566,0.000014124758,0.000010540306,0.0002523457],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.00018148748,0.000029411038,0.000052328436,0.00014600447,0.00008778429],"domain_scores_gemma":[0.9971559,0.0013763243,0.00034472335,0.0003322027,0.0006222964,0.00016858429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014130265,0.00043130104,0.00034024086,0.0004660086,0.0002868177,0.00062590657,0.0004611034,0.00033876282,0.0009849548],"category_scores_gemma":[0.0040321294,0.00020687665,0.00018145113,0.0002849849,0.0004499532,0.00076275493,0.0008000234,0.0005384103,0.0001419102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033579066,0.00083212554,0.02398798,0.0005519464,0.00038784256,0.001583206,0.0009733824,0.30758175,0.3679345,0.010427148,0.004242183,0.27813995],"study_design_scores_gemma":[0.00010860271,0.0010440865,0.006948953,0.000036127527,0.00015559439,0.00044448656,0.00007591524,0.88620037,0.100831546,0.001505993,0.0026117305,0.000036533245],"about_ca_topic_score_codex":0.0005595608,"about_ca_topic_score_gemma":0.0006650574,"teacher_disagreement_score":0.0014130265,"about_ca_system_score_codex":0.00037368017,"about_ca_system_score_gemma":0.0002147376,"threshold_uncertainty_score":0.0074729323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.880668,0.0017532823,0.113181256,0.00024077187,0.00008362394,0.000116007606,0.00009506665,0.00047115178,0.0033908421],"genre_scores_gemma":[0.9867046,0.00015365354,0.012638835,0.000019460775,0.000015093899,0.000013625957,0.000035133144,0.0000144073965,0.00040520306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844426,0.0007388381,0.00006264176,0.000113505324,0.00036854655,0.00027236954],"domain_scores_gemma":[0.994955,0.003774158,0.00030084,0.00028136495,0.0005522024,0.00013640751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241429,0.0007853815,0.00073519227,0.0007720157,0.000604542,0.0007129578,0.0009013033,0.00074561813,0.0013630398],"category_scores_gemma":[0.005904183,0.00020973786,0.00024205554,0.0008593349,0.000595264,0.00088701525,0.0005732641,0.0005399431,0.00008756994],"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.0023079903,0.0005570469,0.002039222,0.00010588958,0.00010485573,0.00004217069,0.000068604735,0.8742756,0.011247153,0.0026529173,0.0007965928,0.105802],"study_design_scores_gemma":[0.000034184675,0.0002901198,0.00061984576,0.0000026305518,0.000024181896,0.00001516136,0.000017341274,0.9964191,0.0022077004,0.0002914773,0.00007218037,0.0000062095296],"about_ca_topic_score_codex":0.0039287903,"about_ca_topic_score_gemma":0.0044005183,"teacher_disagreement_score":0.0039287903,"about_ca_system_score_codex":0.0015255488,"about_ca_system_score_gemma":0.0009822835,"threshold_uncertainty_score":0.017142534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42206538,0.00014596147,0.565785,0.00068428944,0.000117867865,0.00030229602,0.00008074753,0.00048646587,0.010332042],"genre_scores_gemma":[0.99324363,0.000014370924,0.0062691187,0.00001941214,0.000010018161,0.000036470312,0.000008464166,0.000007139325,0.00039133168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983126,0.00042007118,0.00008715585,0.00021079864,0.0006412992,0.00032811443],"domain_scores_gemma":[0.9927408,0.0047119847,0.0005597749,0.00035458105,0.0014186645,0.0002141179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031867311,0.000597441,0.0009571526,0.00071022176,0.0011550643,0.0013937193,0.0012268061,0.0013746376,0.0019632324],"category_scores_gemma":[0.014217252,0.00022608748,0.0005075354,0.0003302843,0.0016266777,0.0009164329,0.0009158236,0.0009784992,0.00016781909],"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.002063846,0.00039838182,0.009864729,0.00022787477,0.00014765354,0.003649148,0.0005273483,0.85333586,0.021272846,0.06635862,0.00243584,0.03971786],"study_design_scores_gemma":[0.00009271621,0.00024121316,0.00031998949,0.000004626478,0.000020967085,0.00014989682,0.000044700653,0.9932193,0.0029431828,0.0028584583,0.000092774324,0.000012186636],"about_ca_topic_score_codex":0.0061510587,"about_ca_topic_score_gemma":0.003993073,"teacher_disagreement_score":0.0061510587,"about_ca_system_score_codex":0.0009946366,"about_ca_system_score_gemma":0.0013744726,"threshold_uncertainty_score":0.016853273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10245639,0.0006103209,0.89014983,0.0006505122,0.00005836285,0.000087827764,0.000046669447,0.000136607,0.005803525],"genre_scores_gemma":[0.9800367,0.0002532152,0.01674364,0.000053827855,0.000025530935,0.00009143398,0.000016488822,0.0000124600265,0.0027667135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999482,0.00017795766,0.000018537317,0.00010996208,0.00011538465,0.00009619781],"domain_scores_gemma":[0.999253,0.00041986702,0.00014135696,0.00002421977,0.00011579116,0.000045734905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009228051,0.0006837418,0.001000604,0.00047227423,0.00047640188,0.0010619502,0.0008850983,0.0012274863,0.0017598422],"category_scores_gemma":[0.0015534606,0.00038556725,0.00064932124,0.00038745048,0.0011388183,0.00090137334,0.0006364129,0.0007959559,0.00012280063],"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.00006163169,0.0000400665,0.00036469052,0.00006378031,0.000034872486,0.00014654976,0.000073157404,0.95402527,0.004113731,0.035019506,0.000426026,0.005630767],"study_design_scores_gemma":[0.000009362287,0.00002487626,0.000048943144,0.0000019099584,0.0000054236098,0.000007265528,0.000003807262,0.99729556,0.00019309636,0.0023198838,0.0000863596,0.000003407331],"about_ca_topic_score_codex":0.0077710296,"about_ca_topic_score_gemma":0.0040610307,"teacher_disagreement_score":0.0077710296,"about_ca_system_score_codex":0.0014247795,"about_ca_system_score_gemma":0.0009952328,"threshold_uncertainty_score":0.0154515505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07009595,0.008167357,0.8779921,0.009097045,0.000478231,0.00019526604,0.000121559504,0.00019392838,0.03365857],"genre_scores_gemma":[0.903431,0.0034745133,0.08676237,0.001023016,0.0012456625,0.00017307428,0.000056240777,0.00018102983,0.0036531019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992376,0.003515789,0.0002954282,0.0008408669,0.0020353638,0.00093658577],"domain_scores_gemma":[0.9470696,0.04454036,0.0018659666,0.0026737764,0.0027808761,0.0010694304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017773338,0.001503157,0.0016370962,0.0020364919,0.0021179577,0.0043316437,0.00284516,0.0026153056,0.00300401],"category_scores_gemma":[0.05225546,0.000822703,0.00080009655,0.0018910366,0.0054739113,0.012910407,0.0024939456,0.0041755685,0.0005181343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005359265,0.0002305268,0.0015560449,0.0002306172,0.00007169311,0.00015351681,0.00038908675,0.2477584,0.004901024,0.7008714,0.0025378405,0.040763948],"study_design_scores_gemma":[0.00006034069,0.00014001041,0.0005557215,0.000071685936,0.000028664626,0.00008722676,0.00008343032,0.502985,0.0019752458,0.4914934,0.0024769227,0.000042270756],"about_ca_topic_score_codex":0.0021894856,"about_ca_topic_score_gemma":0.0015264053,"teacher_disagreement_score":0.017773338,"about_ca_system_score_codex":0.005452656,"about_ca_system_score_gemma":0.0021443448,"threshold_uncertainty_score":0.09399557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012404292,0.00011623218,0.9854673,0.00006827811,0.000014163988,0.000031669406,0.000013536075,0.00006398836,0.00182051],"genre_scores_gemma":[0.48975566,0.00030594508,0.5063391,0.00006462699,0.00004597159,0.00022532805,0.000082406834,0.000056705056,0.0031243034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994629,0.0002256482,0.000019271898,0.00005959766,0.00016858126,0.00006399581],"domain_scores_gemma":[0.99960166,0.00017603431,0.000035609777,0.00005598541,0.00008069613,0.000049998067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461507,0.00049002876,0.0005676053,0.00043856978,0.0004610735,0.00087997795,0.0013187062,0.0007511886,0.0017292573],"category_scores_gemma":[0.0013423503,0.00025656013,0.0005012316,0.0005238116,0.00076373975,0.001162013,0.0012946997,0.00079411076,0.0002316524],"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.00006400043,0.00006702788,0.00023345329,0.00007708832,0.000025233738,0.0001181992,0.000172831,0.7502131,0.005140322,0.20312905,0.0012073623,0.03955238],"study_design_scores_gemma":[0.000011291894,0.000035164103,0.000029324274,0.0000054028233,0.0000049374594,0.000019368064,0.00001698237,0.97520876,0.00043986915,0.022374496,0.0018501574,0.00000435962],"about_ca_topic_score_codex":0.0018612213,"about_ca_topic_score_gemma":0.001816094,"teacher_disagreement_score":0.0018612213,"about_ca_system_score_codex":0.00068873336,"about_ca_system_score_gemma":0.001145951,"threshold_uncertainty_score":0.0065903664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00478391,0.00041545852,0.9893751,0.00034725244,0.00009586333,0.00004050648,0.00008049316,0.0001366094,0.0047247526],"genre_scores_gemma":[0.59456235,0.0028540078,0.38187277,0.00034054127,0.00043768773,0.0006817275,0.0004406217,0.00013824803,0.018672122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901175,0.00032893568,0.00005493272,0.00018229033,0.00030367804,0.00011836117],"domain_scores_gemma":[0.99929714,0.0003425484,0.00008662706,0.00008435203,0.00014928184,0.000040118008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009545366,0.0009808985,0.0006601363,0.0006731841,0.0006478605,0.0019966767,0.0023957232,0.0018959119,0.004825511],"category_scores_gemma":[0.0020298788,0.00042427468,0.0006877797,0.0008975968,0.001301504,0.003007504,0.0011336387,0.0019679011,0.00080756017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003062365,0.00004734994,0.00029612062,0.000075017466,0.000025380758,0.00009957031,0.000111076486,0.46973917,0.001726237,0.5160023,0.0008761365,0.010970889],"study_design_scores_gemma":[0.000013956462,0.000025147856,0.000046763744,0.000010362209,0.000010085033,0.000028791297,0.000019063418,0.91530174,0.0006276971,0.078175,0.005730882,0.000010448102],"about_ca_topic_score_codex":0.004101857,"about_ca_topic_score_gemma":0.0023815178,"teacher_disagreement_score":0.004825511,"about_ca_system_score_codex":0.0019960694,"about_ca_system_score_gemma":0.0012339031,"threshold_uncertainty_score":0.016142905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98904127,0.000042854586,0.00969761,0.000091168185,0.000005491459,0.000020909652,0.000035510526,0.00019404283,0.0008710711],"genre_scores_gemma":[0.9988154,0.000013336868,0.00091351534,0.000008782765,0.000003523126,0.000008997158,0.000034087916,0.00000738028,0.00019507665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993019,0.00016527002,0.000031753425,0.00012043859,0.00022017464,0.00016045444],"domain_scores_gemma":[0.9953687,0.0025869417,0.00052752346,0.00031305445,0.0009887832,0.000215024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114691,0.00028696787,0.00041669825,0.0009286776,0.0009646192,0.000697442,0.0007174955,0.0006939165,0.0009284366],"category_scores_gemma":[0.006189332,0.00024453943,0.00018271437,0.00083584414,0.0006618993,0.0010359628,0.00036352267,0.0003761246,0.00015105058],"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.0006199388,0.0004226857,0.032176934,0.00006196819,0.00004870191,0.0007394308,0.00058947166,0.9086525,0.028562771,0.00850727,0.0013866675,0.018231574],"study_design_scores_gemma":[0.00001324915,0.00008297707,0.0016359317,0.000001850894,0.0000073108076,0.000103825754,0.000052981995,0.99382013,0.0025993374,0.001471412,0.00020132888,0.000009690088],"about_ca_topic_score_codex":0.0072437967,"about_ca_topic_score_gemma":0.0038375075,"teacher_disagreement_score":0.0072437967,"about_ca_system_score_codex":0.0020238294,"about_ca_system_score_gemma":0.0009689517,"threshold_uncertainty_score":0.014683962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10436559,0.00065477524,0.8666918,0.00010883902,0.00014838812,0.00034780407,0.00033159732,0.025127035,0.0022241846],"genre_scores_gemma":[0.73238647,0.00010482388,0.26401135,0.0000776695,0.0000690438,0.00023164203,0.0005196092,0.0004663454,0.002133022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981292,0.00036921498,0.00017354917,0.00035373349,0.0006815277,0.00029269038],"domain_scores_gemma":[0.99549425,0.001293523,0.00037882093,0.0019001232,0.0006830417,0.0002502421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858943,0.0006793678,0.001006633,0.0010182104,0.00083187333,0.0008804871,0.002163839,0.0006446498,0.0031277314],"category_scores_gemma":[0.006056603,0.000558229,0.0003305896,0.00092042936,0.00064453,0.0021072007,0.0020828033,0.00076607225,0.0014867363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002893923,0.00058099424,0.009522945,0.00040208732,0.00014519856,0.00042664917,0.00094383396,0.06290526,0.14396986,0.013819756,0.01380107,0.75058836],"study_design_scores_gemma":[0.00022389028,0.00053106865,0.0031608015,0.000026617907,0.00006278628,0.0004866129,0.00018408636,0.86087394,0.112765044,0.010421145,0.011141959,0.00012210118],"about_ca_topic_score_codex":0.0013839343,"about_ca_topic_score_gemma":0.0013742043,"teacher_disagreement_score":0.0031277314,"about_ca_system_score_codex":0.0010050696,"about_ca_system_score_gemma":0.0009517967,"threshold_uncertainty_score":0.010463297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14573678,0.0017754933,0.846602,0.000725724,0.00013447582,0.000035293295,0.000036530495,0.0002958585,0.004657756],"genre_scores_gemma":[0.9678142,0.0006266861,0.030342791,0.000045129334,0.0001800806,0.000022834998,0.00002114641,0.000036681915,0.0009104469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814785,0.0007392703,0.00009763133,0.00015863415,0.00060453074,0.00025201036],"domain_scores_gemma":[0.99150324,0.005207838,0.0010008956,0.00069206615,0.0013374579,0.00025849626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033182714,0.0007396247,0.0007242717,0.0013268036,0.00037084345,0.0022834125,0.0013233911,0.001080076,0.0009070522],"category_scores_gemma":[0.015470677,0.00057078316,0.0004207673,0.00110217,0.0017104514,0.0056183203,0.0013086724,0.0012918476,0.00014972329],"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.00040135562,0.00015149711,0.0052972883,0.00012655993,0.00009761735,0.000110420486,0.00025769384,0.68935764,0.0075633423,0.22204237,0.0006068756,0.07398729],"study_design_scores_gemma":[0.000016716267,0.000091576934,0.000701445,0.000015449186,0.000046778583,0.00003908978,0.000044701745,0.88470066,0.0015694356,0.112108074,0.00064489624,0.000021122376],"about_ca_topic_score_codex":0.0028083336,"about_ca_topic_score_gemma":0.0022352778,"teacher_disagreement_score":0.0033182714,"about_ca_system_score_codex":0.0013557315,"about_ca_system_score_gemma":0.0010917042,"threshold_uncertainty_score":0.01754886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47401783,0.0015164956,0.5095318,0.00076913915,0.00021618007,0.00020022753,0.00032990603,0.0019119999,0.011506484],"genre_scores_gemma":[0.9861968,0.00027954348,0.012449757,0.000049048616,0.00001851396,0.000038319766,0.00009322156,0.000027238837,0.00084747485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834955,0.0005683432,0.00008520365,0.0001726163,0.00062069634,0.00020366909],"domain_scores_gemma":[0.99723923,0.0015397536,0.0003363118,0.00014105042,0.00064085465,0.0001027865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357569,0.0009419988,0.0008838232,0.0014258763,0.00059074134,0.0014694248,0.0010420062,0.0009990751,0.0006527254],"category_scores_gemma":[0.0036052933,0.0002938532,0.0009841791,0.0008300055,0.0005339979,0.0011570548,0.00084321224,0.0008359684,0.00015660352],"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.000081051134,0.00006912792,0.0012000444,0.00005104553,0.000028002136,0.00005565481,0.00004976648,0.98477155,0.0028956656,0.004272584,0.00032262848,0.0062028314],"study_design_scores_gemma":[0.0000026158266,0.000030694766,0.00012877252,0.0000027737722,0.0000049422947,0.000008561871,0.000008991241,0.99864596,0.000657733,0.00037764825,0.00012326763,0.000008031238],"about_ca_topic_score_codex":0.010521379,"about_ca_topic_score_gemma":0.0026464902,"teacher_disagreement_score":0.010521379,"about_ca_system_score_codex":0.002136082,"about_ca_system_score_gemma":0.0013517721,"threshold_uncertainty_score":0.020920277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018591879,0.00033503765,0.978922,0.00012883008,0.000090978094,0.000030963183,0.000015371425,0.00016960384,0.001715256],"genre_scores_gemma":[0.96824974,0.00014208558,0.030289121,0.000065381835,0.000052327327,0.000043852197,0.000024869312,0.000013811003,0.0011187595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.00007915877,0.0000137717725,0.00007823378,0.00016052669,0.000058558588],"domain_scores_gemma":[0.99967515,0.00010431481,0.000047137793,0.000029456809,0.00010957335,0.0000343423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047505167,0.00059720105,0.00043768703,0.00027546342,0.00030818378,0.0006152094,0.0011312821,0.00048260193,0.000727114],"category_scores_gemma":[0.0007925784,0.00013642292,0.00027841187,0.00025400257,0.0004887557,0.0006086955,0.00053102884,0.00068221515,0.000083771905],"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.00013741349,0.000115207135,0.00051981164,0.00011388742,0.00004927595,0.0002049475,0.00010766265,0.8188373,0.016445285,0.048081666,0.0025009075,0.112886675],"study_design_scores_gemma":[0.000014681033,0.000057079742,0.00005814069,0.000002341812,0.00000759818,0.000022015121,0.000004650574,0.9961553,0.00077791634,0.002240882,0.0006544762,0.0000048769402],"about_ca_topic_score_codex":0.0039005724,"about_ca_topic_score_gemma":0.003453261,"teacher_disagreement_score":0.0039005724,"about_ca_system_score_codex":0.00095433067,"about_ca_system_score_gemma":0.0008455181,"threshold_uncertainty_score":0.007755697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020857453,0.0008362601,0.9873317,0.0006675397,0.00026017733,0.000032066982,0.000048029382,0.00010119587,0.008637276],"genre_scores_gemma":[0.71277475,0.0051685497,0.2519575,0.0010931853,0.003111869,0.00044780257,0.00017701657,0.00021306261,0.025056252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987801,0.00034447803,0.000055102235,0.00018527312,0.00049553957,0.00013949636],"domain_scores_gemma":[0.99849725,0.00083850103,0.00010050393,0.00012984363,0.00034070865,0.00009333557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612096,0.0013794965,0.0013161685,0.0014234051,0.0009849201,0.00361811,0.003658487,0.0017123383,0.0041303243],"category_scores_gemma":[0.004363233,0.0006843503,0.0010952475,0.0015906852,0.0027901821,0.0040526283,0.0015893793,0.0035296367,0.0005894745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014635843,0.000054767268,0.00007094335,0.00005419088,0.000020652391,0.000034427398,0.000072525516,0.09348889,0.0007363303,0.89254385,0.0018237268,0.011084975],"study_design_scores_gemma":[0.000012532893,0.000028345848,0.000038569473,0.00001471826,0.000018920839,0.000019521227,0.000016851009,0.49301982,0.00025443343,0.50334466,0.0032176916,0.000014001602],"about_ca_topic_score_codex":0.003499246,"about_ca_topic_score_gemma":0.002403134,"teacher_disagreement_score":0.0041303243,"about_ca_system_score_codex":0.002267622,"about_ca_system_score_gemma":0.001767612,"threshold_uncertainty_score":0.016452849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737215,0.0009711751,0.018325236,0.00015614965,0.00005019664,0.00009452457,0.00062901364,0.00050456414,0.0055477056],"genre_scores_gemma":[0.99538064,0.00020366463,0.0035829889,0.00002064303,0.000008284444,0.00003077613,0.00030601016,0.00002797662,0.00043890317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979982,0.0004928284,0.00009886085,0.0001827742,0.00086451316,0.0003627381],"domain_scores_gemma":[0.9852845,0.009669259,0.0017201034,0.00073930516,0.0022261874,0.00036058645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014267972,0.00072591763,0.0003892955,0.0013895299,0.00032547273,0.00086970796,0.00075545744,0.0007935155,0.0014992452],"category_scores_gemma":[0.0068553356,0.00021112066,0.0003566708,0.0012081681,0.0005818972,0.0013262514,0.00034339738,0.00083695276,0.00016800818],"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.0009303618,0.000724938,0.036362123,0.0007281915,0.000206401,0.0006748809,0.00029731638,0.7444645,0.15282448,0.0062673087,0.0019561113,0.05456343],"study_design_scores_gemma":[0.00003702548,0.0016560066,0.031231433,0.00007200385,0.0001329646,0.00052586565,0.00044462044,0.87136155,0.09057516,0.001920568,0.001960127,0.00008271122],"about_ca_topic_score_codex":0.0014344471,"about_ca_topic_score_gemma":0.0011021218,"teacher_disagreement_score":0.0014992452,"about_ca_system_score_codex":0.0008477217,"about_ca_system_score_gemma":0.00045214474,"threshold_uncertainty_score":0.0075457096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021309722,0.00016869964,0.97302455,0.000539664,0.000059314152,0.000079292426,0.00004423612,0.0005036474,0.004270862],"genre_scores_gemma":[0.7155419,0.00038731028,0.27605534,0.00025022923,0.00016840114,0.0005412085,0.00012050363,0.00012371474,0.0068114717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845314,0.00038607116,0.00009568507,0.0002673701,0.0006366263,0.0001610454],"domain_scores_gemma":[0.997985,0.0006117527,0.00023215218,0.00036314467,0.0006233926,0.0001846214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019220356,0.0006004233,0.000653709,0.000646147,0.00061862107,0.0015108053,0.0018751652,0.0012573687,0.0021532418],"category_scores_gemma":[0.004876526,0.00032301125,0.00070167007,0.0006499407,0.0008876294,0.0030480074,0.0013204695,0.0016554956,0.0005681647],"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.00019391102,0.00018978183,0.00093300815,0.00010028485,0.000044313907,0.00021540996,0.00035402912,0.6860555,0.009424136,0.25828135,0.0030182607,0.041190006],"study_design_scores_gemma":[0.000028064402,0.00006790053,0.00012207954,0.000006444817,0.000014631974,0.000045658922,0.0000129529035,0.9698453,0.00064004585,0.027423576,0.0017806186,0.000012803072],"about_ca_topic_score_codex":0.003555383,"about_ca_topic_score_gemma":0.0024884085,"teacher_disagreement_score":0.003555383,"about_ca_system_score_codex":0.001212563,"about_ca_system_score_gemma":0.0021270774,"threshold_uncertainty_score":0.010164857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13754454,0.00052081427,0.8546781,0.00040655237,0.00013433513,0.00004867714,0.000039782313,0.0011174046,0.005509894],"genre_scores_gemma":[0.7607285,0.00027449537,0.23629427,0.0001035156,0.00008977738,0.00006034022,0.00014984467,0.000051570594,0.0022477545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949205,0.00013302539,0.000024164763,0.00010886788,0.00019295845,0.000048890146],"domain_scores_gemma":[0.99923635,0.00021026291,0.00013915621,0.00009638104,0.00028317617,0.000034724282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082990073,0.00029729021,0.00033657122,0.0007043986,0.00056219473,0.0008395015,0.00064373534,0.0006414372,0.0005556849],"category_scores_gemma":[0.0022598235,0.00023498923,0.00022708319,0.0004763088,0.00041086302,0.0008931095,0.00029018076,0.00053711765,0.00018600837],"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.000112253496,0.00009291367,0.004399381,0.000040740677,0.000026349351,0.000111498644,0.000108716325,0.68102217,0.027860964,0.024585912,0.0025917997,0.25904733],"study_design_scores_gemma":[0.0000035911569,0.000017354285,0.00048512136,0.0000025808324,0.0000035188941,0.000041057712,0.0000102846525,0.9933255,0.002249184,0.0023397987,0.0015146475,0.0000073682027],"about_ca_topic_score_codex":0.0031836168,"about_ca_topic_score_gemma":0.0018504092,"teacher_disagreement_score":0.0031836168,"about_ca_system_score_codex":0.0008980484,"about_ca_system_score_gemma":0.0007961554,"threshold_uncertainty_score":0.006515801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10859473,0.000098592296,0.89018685,0.000070666596,0.000017001927,0.00002265461,0.000030537663,0.00037897372,0.00059996475],"genre_scores_gemma":[0.9651352,0.0000829642,0.0343302,0.000010468885,0.0000138285,0.000026187581,0.00006122696,0.00002622592,0.0003136613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.00008385767,0.000017222063,0.000055603043,0.00007575591,0.00003522251],"domain_scores_gemma":[0.9987,0.0007145954,0.00017001308,0.000087446744,0.0002952561,0.000032695476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088960223,0.00039275532,0.00046421724,0.00070276356,0.000267859,0.00047214326,0.0005312534,0.00037275403,0.00037410134],"category_scores_gemma":[0.0051000407,0.00027534814,0.00025352061,0.00059732934,0.0002754663,0.00076914596,0.00040216383,0.0005512208,0.00010086615],"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.00011384659,0.000050386796,0.0032647096,0.00003486326,0.000025515577,0.00005481759,0.00007333333,0.9006059,0.007034554,0.002855882,0.00033959426,0.08554651],"study_design_scores_gemma":[0.0000010478495,0.00000587334,0.0002377697,7.880491e-7,0.0000018597852,0.0000031509912,0.0000033349568,0.998938,0.00044861902,0.0003133419,0.0000441408,0.000002111122],"about_ca_topic_score_codex":0.008260141,"about_ca_topic_score_gemma":0.005587991,"teacher_disagreement_score":0.008260141,"about_ca_system_score_codex":0.00060788327,"about_ca_system_score_gemma":0.0006347029,"threshold_uncertainty_score":0.01642412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04000237,0.00048190603,0.9464937,0.0008152533,0.0001527003,0.00011848987,0.0002503104,0.00025964397,0.011425633],"genre_scores_gemma":[0.92530745,0.0009346912,0.062388934,0.00023982431,0.00020387233,0.00042392814,0.00021665783,0.000078913436,0.010205698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924964,0.00024819604,0.000031504427,0.00012654389,0.00022576017,0.000118375356],"domain_scores_gemma":[0.9990551,0.0005228988,0.00011944402,0.00005474828,0.00017779804,0.00007000236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010129233,0.0007192248,0.00059027056,0.0007456455,0.00080792,0.0013294023,0.0023274878,0.0013561441,0.0023536629],"category_scores_gemma":[0.0023012224,0.0005375681,0.00054152025,0.00085792603,0.0013899569,0.0019070513,0.0008778337,0.0010391794,0.00042567556],"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.000020784582,0.000028876328,0.00028378976,0.00002189028,0.000011012783,0.00009483917,0.000056894027,0.917066,0.001049216,0.078594975,0.00053231086,0.002239317],"study_design_scores_gemma":[0.0000031234647,0.000008131142,0.00003673407,0.000001829049,0.0000025509514,0.000008642531,0.000006893194,0.99452895,0.00007628051,0.0050283843,0.00029508225,0.0000034209152],"about_ca_topic_score_codex":0.010628271,"about_ca_topic_score_gemma":0.004072421,"teacher_disagreement_score":0.010628271,"about_ca_system_score_codex":0.0022220353,"about_ca_system_score_gemma":0.0015971557,"threshold_uncertainty_score":0.021132827},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7751171,0.00037411676,0.20402484,0.00058467255,0.0001054146,0.00014264906,0.0005376352,0.0011955483,0.017918015],"genre_scores_gemma":[0.9871514,0.0001441518,0.009733792,0.000046807894,0.000010350579,0.00009084137,0.00011332444,0.00003182146,0.0026775766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996859,0.00008328251,0.000019822462,0.0000477085,0.00007704989,0.00008623979],"domain_scores_gemma":[0.9993594,0.00029099063,0.000082632476,0.000045055476,0.00011798001,0.000103934755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005729806,0.00063093036,0.00071746274,0.0006449002,0.0007446074,0.0011074587,0.0016327292,0.001513385,0.0024292667],"category_scores_gemma":[0.0013566479,0.00039483054,0.0005247276,0.00059796876,0.0010997577,0.0011228187,0.0009400553,0.00079556124,0.0002625135],"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.00003578727,0.000026706875,0.00056443876,0.000012041246,0.0000072083367,0.00009263922,0.00004364156,0.9936731,0.0013629055,0.003400251,0.00013170231,0.0006495266],"study_design_scores_gemma":[0.000003772676,0.000007708011,0.00003755433,0.0000011943987,0.000001636551,0.000005081607,0.0000072608873,0.9993511,0.00018682284,0.0003372343,0.000058453057,0.0000023187633],"about_ca_topic_score_codex":0.013243419,"about_ca_topic_score_gemma":0.004335413,"teacher_disagreement_score":0.013243419,"about_ca_system_score_codex":0.0013080369,"about_ca_system_score_gemma":0.0014771122,"threshold_uncertainty_score":0.026332617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013651393,0.00018863629,0.9830382,0.00031017576,0.00004092335,0.000019603767,0.00006083203,0.00018496251,0.0025053439],"genre_scores_gemma":[0.93793935,0.0007010939,0.05669818,0.0001196667,0.000092834234,0.00013360253,0.000122999,0.0000664761,0.004125779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942005,0.00018961552,0.000030352137,0.00014958551,0.00014076066,0.00006972752],"domain_scores_gemma":[0.99856037,0.00091597694,0.00022143718,0.00013207167,0.00012766445,0.000042611446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015270291,0.0010948062,0.00058264507,0.00033479495,0.00043661502,0.0017959371,0.001306936,0.0010872331,0.0013451242],"category_scores_gemma":[0.003922945,0.00054908387,0.00048906653,0.00040116388,0.0010541606,0.003227661,0.0012049204,0.001755749,0.00023923571],"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.000026694894,0.000011518509,0.00015263542,0.0000161325,0.00001135922,0.000022235141,0.000028179755,0.9805237,0.000518664,0.014443675,0.00020621184,0.0040388764],"study_design_scores_gemma":[0.000003021968,0.000007888671,0.000031843447,0.0000038110213,0.000005061935,0.0000061037285,0.0000033117137,0.9913707,0.00022403414,0.008127454,0.00021284926,0.000003849995],"about_ca_topic_score_codex":0.0054971753,"about_ca_topic_score_gemma":0.0036398221,"teacher_disagreement_score":0.0054971753,"about_ca_system_score_codex":0.0010538087,"about_ca_system_score_gemma":0.0009811322,"threshold_uncertainty_score":0.010930359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1489592,0.001367984,0.84425676,0.0004507782,0.00008919032,0.000121917314,0.00008142135,0.0015094306,0.003163207],"genre_scores_gemma":[0.8803726,0.00035445477,0.11719432,0.000066215,0.000060499315,0.00007885258,0.000078652425,0.00006789173,0.0017265589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995888,0.00009873939,0.00002409261,0.0000826185,0.00013899557,0.000066818124],"domain_scores_gemma":[0.99845433,0.00094097306,0.00014450237,0.00014986686,0.00020428028,0.00010604149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011383991,0.0006338403,0.0008692005,0.00081112824,0.00093386305,0.0013982174,0.001467899,0.0006023039,0.0010665354],"category_scores_gemma":[0.0040928987,0.00032432977,0.00024917859,0.0008911505,0.00060917286,0.0015652574,0.0009325938,0.0006887652,0.00016308685],"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.000587773,0.00015163998,0.0016303891,0.00016193907,0.000061451836,0.00024537378,0.00031418825,0.7986631,0.032251466,0.040497202,0.0033679267,0.12206757],"study_design_scores_gemma":[0.000015054112,0.00003053411,0.000099924444,0.0000043557548,0.000008843975,0.000026245949,0.0000109179455,0.99119425,0.0030045207,0.004997652,0.0006023641,0.0000053605063],"about_ca_topic_score_codex":0.0055227787,"about_ca_topic_score_gemma":0.004460443,"teacher_disagreement_score":0.0055227787,"about_ca_system_score_codex":0.0016240042,"about_ca_system_score_gemma":0.0014552645,"threshold_uncertainty_score":0.011783004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030621096,0.0005822658,0.96634096,0.00031572641,0.000037484017,0.000054357704,0.000027970384,0.00024890367,0.0017712085],"genre_scores_gemma":[0.82148063,0.00062650006,0.17479108,0.00013010141,0.000071245784,0.00017087358,0.00008682655,0.000052415347,0.0025903247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986841,0.00051542086,0.00004593843,0.00010658963,0.0005138855,0.00013405812],"domain_scores_gemma":[0.9988471,0.00068083266,0.00014588697,0.00009327803,0.00018037447,0.000052451334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480291,0.0005914938,0.0005604615,0.00059073436,0.0007046679,0.0013254213,0.0014230276,0.0009906702,0.0008582261],"category_scores_gemma":[0.0032555815,0.00036556055,0.00036060586,0.00061012985,0.0008496888,0.0013364111,0.0009891108,0.0011106166,0.0001644286],"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.00012366899,0.000089718764,0.00041735318,0.00008685215,0.00003565347,0.000083818944,0.00008294021,0.8730951,0.0068801246,0.03755611,0.0010202089,0.080528356],"study_design_scores_gemma":[0.000004908703,0.000007188396,0.000042554093,0.0000026501714,0.000004235168,0.000009725019,0.00000548901,0.9942222,0.0011111009,0.0042486293,0.00033690452,0.000004365533],"about_ca_topic_score_codex":0.0055060196,"about_ca_topic_score_gemma":0.0041021802,"teacher_disagreement_score":0.0055060196,"about_ca_system_score_codex":0.0015990265,"about_ca_system_score_gemma":0.0018270036,"threshold_uncertainty_score":0.011601806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003985728,0.004887731,0.98626524,0.0008697813,0.0004567708,0.00004567814,0.00025749262,0.00020545571,0.003026143],"genre_scores_gemma":[0.58946735,0.034036502,0.33280304,0.0011818877,0.00434167,0.0010002606,0.001958699,0.00068870204,0.034521975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867564,0.0005388424,0.00010231884,0.00016878117,0.00040768014,0.000106849795],"domain_scores_gemma":[0.99568546,0.0028954754,0.00037761274,0.00032839118,0.000548437,0.000164584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024933442,0.0017518846,0.0026470996,0.0016018776,0.0007705516,0.0021703534,0.002221843,0.0025630167,0.0040132008],"category_scores_gemma":[0.010016596,0.0009923304,0.0014577362,0.0028567894,0.0014666392,0.0028014332,0.0016846082,0.004395524,0.0012354625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020843278,0.000056788216,0.00031842804,0.00015594593,0.000069803886,0.00007383638,0.000048237882,0.37704223,0.0005759925,0.5960801,0.004146784,0.021411046],"study_design_scores_gemma":[0.000008556381,0.000008026838,0.00007393312,0.00001990107,0.000014476099,0.000018348015,0.000007975279,0.7854598,0.00008648663,0.21093208,0.0033608994,0.000009463638],"about_ca_topic_score_codex":0.008699196,"about_ca_topic_score_gemma":0.005599265,"teacher_disagreement_score":0.008699196,"about_ca_system_score_codex":0.0019641155,"about_ca_system_score_gemma":0.0018711123,"threshold_uncertainty_score":0.017297149},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553338,0.00062496855,0.44112614,0.00016852882,0.000031634172,0.000040303905,0.000103959566,0.0011781416,0.0013925133],"genre_scores_gemma":[0.9822665,0.000055441495,0.017268205,0.0000074192703,0.000008667424,0.000009895073,0.00004933237,0.00001866062,0.00031583753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950933,0.00012629367,0.000024280867,0.00010236773,0.00014533899,0.00009228137],"domain_scores_gemma":[0.9954787,0.0031809108,0.0002740888,0.00027854525,0.00064990186,0.00013784533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012649213,0.00039522332,0.0005902042,0.0009826298,0.0005829856,0.000634392,0.00097026443,0.0006144231,0.00061338744],"category_scores_gemma":[0.0076637706,0.00029502405,0.00019406395,0.0010376999,0.00041022725,0.000781493,0.0005694526,0.0006846775,0.00009868939],"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.00077130896,0.00014720143,0.014924526,0.00009177747,0.000042585267,0.000099816265,0.00020856397,0.86677825,0.007181852,0.002574595,0.0008125138,0.106367044],"study_design_scores_gemma":[0.0000016497054,0.0000070742512,0.0004896351,9.875673e-7,0.000001987855,0.000005512507,0.0000072671332,0.9988305,0.00046735615,0.00016443008,0.000021368154,0.0000022606353],"about_ca_topic_score_codex":0.031934872,"about_ca_topic_score_gemma":0.014799778,"teacher_disagreement_score":0.031934872,"about_ca_system_score_codex":0.0010662545,"about_ca_system_score_gemma":0.0010571309,"threshold_uncertainty_score":0.06349796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10861169,0.00063945673,0.8648827,0.0011395266,0.00015779103,0.00015825582,0.0002821812,0.00020651691,0.023921851],"genre_scores_gemma":[0.9599371,0.00027841353,0.03098662,0.00009497762,0.000043960434,0.00009388417,0.0000751218,0.00004811001,0.008441912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999059,0.00044722174,0.00002296142,0.00012046216,0.0001452789,0.00020503637],"domain_scores_gemma":[0.99905175,0.00051967485,0.00007720263,0.00007100394,0.00014044535,0.00013997813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015084386,0.0009463739,0.0016633676,0.00051920686,0.00068862876,0.0030750993,0.0022431754,0.0018196624,0.005288072],"category_scores_gemma":[0.0031828724,0.0008108991,0.00063970155,0.0007813288,0.0013706981,0.0024961648,0.001291644,0.0015405503,0.0003221707],"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.00010786283,0.00004840962,0.000090246875,0.0000378081,0.000018396417,0.00005721426,0.000032686185,0.9187374,0.00060963223,0.076103084,0.0008814189,0.0032759134],"study_design_scores_gemma":[0.000019354771,0.000012703099,0.000024562458,0.0000033001172,0.000005558148,0.000009446554,0.000009126178,0.9848166,0.00005125851,0.014813018,0.00023012489,0.000004869138],"about_ca_topic_score_codex":0.005076132,"about_ca_topic_score_gemma":0.003929714,"teacher_disagreement_score":0.005288072,"about_ca_system_score_codex":0.0026046454,"about_ca_system_score_gemma":0.0019653263,"threshold_uncertainty_score":0.01889813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066524416,0.0010026123,0.92596996,0.0003008187,0.00016467384,0.00007857689,0.000030745898,0.001260003,0.004668133],"genre_scores_gemma":[0.797037,0.0002738815,0.19954334,0.00027688144,0.00010256745,0.000080415346,0.000029214525,0.00010279876,0.0025538548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818003,0.0006255938,0.00007842444,0.00030430066,0.00058638706,0.00022523181],"domain_scores_gemma":[0.9944699,0.0036447325,0.0004248008,0.00074335764,0.0004992538,0.00021800032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034047735,0.0006959003,0.00071656524,0.0007033287,0.00058764213,0.0013820003,0.0019803755,0.0007828955,0.0013951149],"category_scores_gemma":[0.00904548,0.0003709541,0.00033439015,0.0007773575,0.00081862556,0.002230109,0.0012328869,0.001591116,0.00029404458],"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.0013978549,0.00077688124,0.0040279897,0.00025658924,0.00014313847,0.0003434208,0.0005886277,0.38837808,0.097901486,0.2130417,0.0037798001,0.28936446],"study_design_scores_gemma":[0.000092054615,0.00022849298,0.00036709997,0.000015808548,0.000040632887,0.0001590091,0.000027470312,0.948837,0.020411665,0.026414366,0.0033693945,0.000037059166],"about_ca_topic_score_codex":0.0009221262,"about_ca_topic_score_gemma":0.00092922023,"teacher_disagreement_score":0.0034047735,"about_ca_system_score_codex":0.00097492296,"about_ca_system_score_gemma":0.0009803682,"threshold_uncertainty_score":0.018006325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1814306,0.00046169857,0.81644166,0.00008769804,0.00003908649,0.000067745306,0.00002030726,0.000703197,0.0007480155],"genre_scores_gemma":[0.9334778,0.00009005772,0.06599779,0.000025571238,0.000020334392,0.000029498491,0.000017597245,0.000019510055,0.00032186217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979589,0.0006566852,0.000088375964,0.0003702167,0.0007536332,0.00017218893],"domain_scores_gemma":[0.99508876,0.002934038,0.00076822325,0.00034577266,0.00055645156,0.00030681447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023758973,0.0004834466,0.00086373824,0.0014238768,0.00062835234,0.0010088475,0.0014936819,0.0009198122,0.0002977293],"category_scores_gemma":[0.007963717,0.0005877617,0.0003039119,0.00068039546,0.00085327495,0.001726368,0.0011475568,0.001113898,0.00010648957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013739733,0.00061296264,0.020921431,0.00025496853,0.00018487209,0.0009441654,0.00088565116,0.2665035,0.15058969,0.011953829,0.0010303694,0.5447446],"study_design_scores_gemma":[0.000022340519,0.00023991948,0.0055500437,0.000010553578,0.00003531119,0.0004563711,0.000053939144,0.965193,0.025604723,0.0022656901,0.0005025306,0.00006558808],"about_ca_topic_score_codex":0.0021041427,"about_ca_topic_score_gemma":0.002395437,"teacher_disagreement_score":0.0023758973,"about_ca_system_score_codex":0.00063578057,"about_ca_system_score_gemma":0.0005902807,"threshold_uncertainty_score":0.012565136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08838943,0.0014830263,0.86998135,0.0005305738,0.0013809531,0.0006703919,0.00017516843,0.03383053,0.0035586134],"genre_scores_gemma":[0.7230499,0.0003898372,0.26739722,0.0004356545,0.00041195322,0.00024364004,0.00025672125,0.0012108071,0.006604302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839157,0.0003929428,0.00010917206,0.00032907363,0.0006034355,0.00017382936],"domain_scores_gemma":[0.9964768,0.0009541857,0.00027329836,0.0013906517,0.00062186434,0.00028309497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026707635,0.0009410788,0.001301452,0.0011005858,0.0009586758,0.0009930889,0.0036192723,0.0009187852,0.0021988438],"category_scores_gemma":[0.005767849,0.00067469,0.00052936596,0.00042346772,0.0009075142,0.0018818034,0.0018560783,0.0028227726,0.00081896264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005108265,0.0016045597,0.006924869,0.00040248068,0.0005207998,0.0009905066,0.00043269162,0.038347896,0.18213326,0.012354016,0.021158215,0.7300225],"study_design_scores_gemma":[0.0006410864,0.0013371196,0.0043286835,0.0000392389,0.0005104513,0.0017073926,0.00006170644,0.8117986,0.15119848,0.006264973,0.021853449,0.00025877677],"about_ca_topic_score_codex":0.001075216,"about_ca_topic_score_gemma":0.0018293383,"teacher_disagreement_score":0.0036192723,"about_ca_system_score_codex":0.00042135033,"about_ca_system_score_gemma":0.0008269858,"threshold_uncertainty_score":0.014124513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765074,0.00036017224,0.021724802,0.000054484288,0.00001587614,0.000008528044,0.00003397802,0.000121471276,0.0011732982],"genre_scores_gemma":[0.9992073,0.00006511073,0.00059790467,0.000005905104,0.000005091455,0.0000018262341,0.000015634476,0.000004089324,0.000097112745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994079,0.00013878802,0.000024898965,0.00006578698,0.00023248982,0.00013019751],"domain_scores_gemma":[0.9970498,0.0020083615,0.00032363643,0.000104660445,0.00040399385,0.000109531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011152565,0.00036671417,0.00029060713,0.00059994916,0.00038515672,0.00056670234,0.00033897345,0.0004888701,0.0003613657],"category_scores_gemma":[0.005185018,0.00014281046,0.00016872931,0.00056113984,0.00047966675,0.0005280134,0.00020258344,0.000289451,0.00006829706],"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.0013299516,0.0001362247,0.016255748,0.00009056556,0.000069089125,0.0004973554,0.00014269855,0.8793417,0.07572987,0.005039353,0.0002817201,0.02108569],"study_design_scores_gemma":[0.000013923701,0.00023070462,0.0037374827,0.0000066466214,0.000025576217,0.00012540765,0.00003242858,0.9822468,0.0128788985,0.0005842104,0.00010448624,0.000013333892],"about_ca_topic_score_codex":0.0035135264,"about_ca_topic_score_gemma":0.001226372,"teacher_disagreement_score":0.0035135264,"about_ca_system_score_codex":0.0011847318,"about_ca_system_score_gemma":0.0003424702,"threshold_uncertainty_score":0.008595884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024336647,0.00043344358,0.96844494,0.00035644154,0.00018966869,0.00006297278,0.00003673783,0.00044917298,0.00568998],"genre_scores_gemma":[0.8152054,0.0004183624,0.17761955,0.00021858675,0.00021815565,0.00014519595,0.00006369863,0.00007832114,0.0060327323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.00013102854,0.000042702828,0.00015221669,0.00027198595,0.00013655095],"domain_scores_gemma":[0.9987835,0.00037023047,0.00009537586,0.00034339598,0.00029945147,0.0001079796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010340081,0.0005326465,0.00063003233,0.00043595542,0.0007515742,0.0012592167,0.0022707593,0.0006649975,0.0037263525],"category_scores_gemma":[0.0025570297,0.00027745898,0.00030187317,0.0007875132,0.0009962076,0.002078626,0.0011969922,0.0015864068,0.00059573085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005047434,0.0003121403,0.001458959,0.00017884285,0.00006148653,0.00028999688,0.00028471512,0.27921024,0.05071085,0.39825118,0.0089274505,0.2598094],"study_design_scores_gemma":[0.00006827521,0.00010634055,0.00015365878,0.000011124383,0.000027360644,0.00013047644,0.000020662746,0.91387874,0.0124543,0.062039968,0.0110764755,0.00003269996],"about_ca_topic_score_codex":0.001824197,"about_ca_topic_score_gemma":0.0019283217,"teacher_disagreement_score":0.0037263525,"about_ca_system_score_codex":0.0009835426,"about_ca_system_score_gemma":0.0014972157,"threshold_uncertainty_score":0.012465954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011288988,0.0018227298,0.97941226,0.00045230275,0.0002655522,0.00029799234,0.00004808325,0.00063985115,0.0057722554],"genre_scores_gemma":[0.44526413,0.002183832,0.53882617,0.0007220009,0.00035193216,0.0014390019,0.00032351987,0.00012389259,0.0107655795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917513,0.00028625297,0.00005984713,0.00007083826,0.00034776455,0.00006011879],"domain_scores_gemma":[0.99921095,0.00029260805,0.000099045574,0.00013674468,0.00019861238,0.000062018036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014081829,0.00033354608,0.00041930858,0.0005492739,0.0010447844,0.0009799663,0.0013111146,0.0008776769,0.0010415278],"category_scores_gemma":[0.0027619635,0.00018489525,0.0002268698,0.00051892584,0.00071035215,0.0016059726,0.0010430297,0.0012807169,0.00040460608],"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.0007218833,0.00041673172,0.0011495078,0.0008356569,0.00011018717,0.0010739261,0.0012211005,0.034724403,0.07920202,0.35260853,0.018325044,0.50961095],"study_design_scores_gemma":[0.00035367513,0.0009101707,0.001241391,0.00018740138,0.00021607216,0.0023420115,0.00029769514,0.576676,0.062940516,0.13774548,0.21695164,0.00013804478],"about_ca_topic_score_codex":0.00042776455,"about_ca_topic_score_gemma":0.0005961182,"teacher_disagreement_score":0.0014081829,"about_ca_system_score_codex":0.0005758999,"about_ca_system_score_gemma":0.00077467354,"threshold_uncertainty_score":0.0074473023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4378394,0.0017851414,0.5550006,0.00027487005,0.00006409912,0.00005007021,0.00006514027,0.00027440526,0.0046461867],"genre_scores_gemma":[0.99529064,0.00019641551,0.004201085,0.000019735084,0.000022618058,0.000022904847,0.000016560212,0.000010284637,0.00021965965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980083,0.0006916493,0.00009131846,0.00033824603,0.0005219747,0.0003484886],"domain_scores_gemma":[0.99007446,0.0064165136,0.0012365081,0.0007296219,0.0012160081,0.00032683156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029204257,0.0008755937,0.0010109431,0.001059696,0.0009286095,0.0018481737,0.001522323,0.0008734755,0.00039074224],"category_scores_gemma":[0.0150905335,0.00039152897,0.0006055035,0.00066934346,0.0021562264,0.0024149765,0.0018037972,0.00097384525,0.00004578927],"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.00009720681,0.00003247508,0.0023041528,0.00009613637,0.00005420233,0.00064338266,0.00023277267,0.9101056,0.012099252,0.066545,0.00027421777,0.0075156195],"study_design_scores_gemma":[0.0000029174814,0.000013071729,0.0003307602,0.0000046630425,0.000008862413,0.000033673277,0.000017033457,0.9904636,0.00076813524,0.008258115,0.00009196562,0.0000071240083],"about_ca_topic_score_codex":0.0035800543,"about_ca_topic_score_gemma":0.0011381491,"teacher_disagreement_score":0.0035800543,"about_ca_system_score_codex":0.001770653,"about_ca_system_score_gemma":0.0008277099,"threshold_uncertainty_score":0.015444815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20649168,0.0011393636,0.7845563,0.00077776914,0.00051007635,0.00014191406,0.000091017224,0.00083159393,0.0054602944],"genre_scores_gemma":[0.9159385,0.00038201566,0.07582514,0.000206662,0.00015415218,0.000055608532,0.00005071304,0.000060940325,0.007326228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989066,0.00024766073,0.0000811557,0.0001497067,0.0004032867,0.00021142977],"domain_scores_gemma":[0.996064,0.0021239158,0.00030459877,0.00042816665,0.0007897,0.0002896134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038553432,0.00056817394,0.0008604845,0.000863194,0.0012347767,0.0019953097,0.0019132547,0.00083835877,0.0023095368],"category_scores_gemma":[0.0074653695,0.00054124004,0.00030730327,0.0009566999,0.0009947555,0.002041517,0.0010105016,0.0012819335,0.00036624426],"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.0044300426,0.00094684254,0.0063325153,0.00031311458,0.000090915986,0.000606041,0.0011047416,0.38976833,0.047660954,0.3599305,0.006182812,0.18263325],"study_design_scores_gemma":[0.00013728986,0.00017905155,0.00025618688,0.000014919673,0.000047376703,0.000079174686,0.000036418496,0.9696876,0.0049633365,0.023480758,0.0010869066,0.00003110942],"about_ca_topic_score_codex":0.005976697,"about_ca_topic_score_gemma":0.005335269,"teacher_disagreement_score":0.005976697,"about_ca_system_score_codex":0.002095866,"about_ca_system_score_gemma":0.0021961231,"threshold_uncertainty_score":0.020389259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15924941,0.0007096933,0.831035,0.0006509498,0.00006643937,0.00012198366,0.00004912551,0.0003705563,0.007746814],"genre_scores_gemma":[0.96082854,0.00023598367,0.03558644,0.000058070967,0.000022642605,0.00014217332,0.00003513845,0.000023423043,0.003067465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997428,0.00009479529,0.000011587305,0.000044408178,0.00006321397,0.000043211745],"domain_scores_gemma":[0.9994048,0.0003881798,0.00007096877,0.000027078055,0.00008076246,0.000028183264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006270025,0.0005980138,0.00067423936,0.00037232804,0.00043803325,0.0007075436,0.00081101886,0.0009233645,0.0014371962],"category_scores_gemma":[0.0019326628,0.00042842832,0.0005682942,0.0003177665,0.0009472778,0.00082558434,0.0005993567,0.0007566484,0.00010077213],"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.00001935783,0.0000120129835,0.000110846835,0.000010361688,0.000007912001,0.000009160243,0.000011255575,0.9940257,0.00042814136,0.0026993474,0.00006943473,0.002596317],"study_design_scores_gemma":[0.0000029570172,0.0000061313544,0.000023399194,7.6329417e-7,0.0000015146267,0.0000011794203,0.0000010134528,0.99912065,0.00009760661,0.0007089431,0.000034760982,0.00000100898],"about_ca_topic_score_codex":0.011115506,"about_ca_topic_score_gemma":0.0069508087,"teacher_disagreement_score":0.011115506,"about_ca_system_score_codex":0.0016111158,"about_ca_system_score_gemma":0.0008171012,"threshold_uncertainty_score":0.022101581},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16517036,0.0011707965,0.8295631,0.00040625216,0.00048479592,0.00015967111,0.00013171844,0.00073460763,0.0021787751],"genre_scores_gemma":[0.95093095,0.00022980428,0.046243176,0.00011962008,0.00013209268,0.000048985727,0.00007852893,0.000035750243,0.0021812096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987465,0.0002783839,0.000085874264,0.00018527167,0.00038544467,0.00031850982],"domain_scores_gemma":[0.9964455,0.0014044809,0.00025086946,0.0007734018,0.0008646363,0.0002611445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692155,0.000782057,0.0013824834,0.0010722659,0.0023345605,0.0021507915,0.0037422494,0.0010724595,0.0015437934],"category_scores_gemma":[0.0066929525,0.000383631,0.00039678262,0.0009670463,0.0012618852,0.0030609623,0.0017799626,0.0013436736,0.00020238014],"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.0057612793,0.0009567265,0.0051506055,0.00038507095,0.00038073573,0.00097229145,0.0011330025,0.37139204,0.06805489,0.1732231,0.008988825,0.36360148],"study_design_scores_gemma":[0.00013011333,0.00028028488,0.00044627336,0.000020549001,0.00015843271,0.00014532088,0.00007767784,0.9526698,0.008590424,0.035174206,0.0022460285,0.000061034374],"about_ca_topic_score_codex":0.0037398464,"about_ca_topic_score_gemma":0.0065673944,"teacher_disagreement_score":0.004692155,"about_ca_system_score_codex":0.0017272317,"about_ca_system_score_gemma":0.0025312547,"threshold_uncertainty_score":0.024814785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04147886,0.0004725407,0.9547016,0.00015467557,0.0000365116,0.000067446046,0.000016246113,0.00030859106,0.002763544],"genre_scores_gemma":[0.9477703,0.00016101706,0.05146879,0.000039634226,0.000017836168,0.0000952016,0.000013265602,0.000029778346,0.00040412572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962974,0.00012575537,0.000024351533,0.000058364618,0.00013021982,0.000031550637],"domain_scores_gemma":[0.9994161,0.00027263543,0.000095026844,0.00003612878,0.00016764335,0.000012380387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061609,0.0006263204,0.00039375495,0.0004428386,0.0002764701,0.00076195184,0.00054253935,0.00058469083,0.000521072],"category_scores_gemma":[0.0029347453,0.00027221144,0.00016659383,0.0002599784,0.0004563346,0.000589026,0.0003178953,0.0006457988,0.00013817936],"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.00008214355,0.00005300831,0.00062271376,0.00014178386,0.000024491246,0.0000669456,0.00013044725,0.9150495,0.02317529,0.008205795,0.00047911104,0.05196885],"study_design_scores_gemma":[0.000020542375,0.000058933667,0.00019919328,0.000008604201,0.00000943499,0.00002002329,0.00001513686,0.99181646,0.0047803214,0.0023975635,0.00066608575,0.000007762403],"about_ca_topic_score_codex":0.0008878138,"about_ca_topic_score_gemma":0.0008315381,"teacher_disagreement_score":0.0010061609,"about_ca_system_score_codex":0.00044110994,"about_ca_system_score_gemma":0.0005025352,"threshold_uncertainty_score":0.005321145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32066742,0.008972582,0.65496933,0.0028589237,0.00046989458,0.00010396601,0.00020879511,0.0003855442,0.01136358],"genre_scores_gemma":[0.9876588,0.00091229577,0.009729879,0.00007094651,0.00021437644,0.000029414994,0.00005861681,0.000028650386,0.0012970264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978788,0.00073246507,0.000093361945,0.00020279543,0.000775339,0.00031721892],"domain_scores_gemma":[0.9941532,0.003883603,0.0005361287,0.00030830468,0.0008362459,0.0002825496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174958,0.00050140626,0.0012007979,0.0010717125,0.0008358434,0.0030713067,0.0014392616,0.0010756114,0.0013684389],"category_scores_gemma":[0.011528595,0.00046216632,0.00028602825,0.001713062,0.0013369501,0.0029650496,0.001100191,0.0010026237,0.0001517655],"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.0005639715,0.00016719432,0.006439768,0.00018553395,0.00010191846,0.00041259857,0.00032162224,0.6048291,0.0062169596,0.28715098,0.004058272,0.08955207],"study_design_scores_gemma":[0.00002418626,0.000040230112,0.0013418001,0.00001234861,0.000033899385,0.00007568042,0.00008011402,0.9255341,0.000533027,0.071133345,0.0011744265,0.00001681018],"about_ca_topic_score_codex":0.003987738,"about_ca_topic_score_gemma":0.0024347955,"teacher_disagreement_score":0.004174958,"about_ca_system_score_codex":0.0027126858,"about_ca_system_score_gemma":0.0008357041,"threshold_uncertainty_score":0.022079587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47973472,0.004415949,0.50004035,0.0020158736,0.00012705785,0.00011806072,0.00010776197,0.000419096,0.013021156],"genre_scores_gemma":[0.9602504,0.00064969534,0.03841517,0.00006202692,0.000044220036,0.00003366773,0.000027607508,0.000028178394,0.000489076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532866,0.002745962,0.00015917853,0.00027157582,0.0012170144,0.00027750482],"domain_scores_gemma":[0.95459634,0.038856193,0.0020371855,0.0022774083,0.0016513215,0.0005815529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056208973,0.00061064877,0.00057386054,0.0014791369,0.0009668243,0.0018757106,0.0010320895,0.0011109092,0.0017278484],"category_scores_gemma":[0.030388955,0.00035836504,0.0003240343,0.0010626576,0.0023173841,0.0045728306,0.0018264035,0.0010525003,0.00024180919],"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.0016384192,0.00016235751,0.0041249017,0.00031125452,0.00009512891,0.00030119467,0.00081728416,0.57182753,0.015350462,0.18268235,0.001435762,0.22125335],"study_design_scores_gemma":[0.00009343203,0.00034975164,0.0006512006,0.00005861208,0.000053235657,0.00032281684,0.00018044496,0.908772,0.0054724324,0.08076081,0.0032483905,0.000036869777],"about_ca_topic_score_codex":0.0012141983,"about_ca_topic_score_gemma":0.0009404209,"teacher_disagreement_score":0.0056208973,"about_ca_system_score_codex":0.0011258327,"about_ca_system_score_gemma":0.0005972602,"threshold_uncertainty_score":0.029726505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8241431,0.00014098476,0.17017995,0.00017268263,0.00002665347,0.00016577594,0.0009612148,0.0013299795,0.0028797737],"genre_scores_gemma":[0.9854116,0.000055369,0.013798218,0.0000107641545,0.000011265331,0.00005623504,0.0003846706,0.000028249153,0.00024358062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994622,0.00009104059,0.000040026567,0.00008018612,0.00027793934,0.000048607148],"domain_scores_gemma":[0.996869,0.0015221919,0.00034342826,0.00036564932,0.00077119196,0.00012847745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005997079,0.00042297918,0.00032053227,0.0015824618,0.00031665753,0.0006150541,0.0005095245,0.0004804039,0.00048651177],"category_scores_gemma":[0.0050709858,0.0001403829,0.00018872439,0.0009674932,0.00026891477,0.0005581412,0.00029071074,0.00047936462,0.0001660787],"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.00073314394,0.0005087504,0.07524802,0.0002274522,0.00007229325,0.0013201091,0.0003724235,0.63487285,0.1689528,0.009834391,0.0022428953,0.105614945],"study_design_scores_gemma":[0.0000039045663,0.000031836717,0.0058804317,0.0000025020724,0.0000034648601,0.0001712042,0.00002180286,0.9844604,0.008517324,0.0007098917,0.00019170796,0.0000054578563],"about_ca_topic_score_codex":0.002170397,"about_ca_topic_score_gemma":0.0008999239,"teacher_disagreement_score":0.002170397,"about_ca_system_score_codex":0.00054732873,"about_ca_system_score_gemma":0.00041367006,"threshold_uncertainty_score":0.0043154955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075606264,0.001767172,0.6654258,0.009835995,0.0010420465,0.00046934554,0.0049110446,0.0026980573,0.23824441],"genre_scores_gemma":[0.7666003,0.002578739,0.105453536,0.001081347,0.00029399627,0.00067347067,0.002372476,0.0009381164,0.12000799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986688,0.00034473013,0.00006442253,0.00028211824,0.00034416743,0.00029576453],"domain_scores_gemma":[0.9968352,0.0012543952,0.00029626844,0.00061051606,0.0006418241,0.0003619324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022165459,0.00080559676,0.0008685134,0.0018635305,0.0018954201,0.0041156164,0.003106088,0.0021059709,0.049329095],"category_scores_gemma":[0.008817703,0.0007773934,0.0011324859,0.0016640304,0.002243992,0.007850212,0.0035146736,0.0023290939,0.0033699598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044070235,0.00003398249,0.0006069215,0.00004945753,0.0000148294075,0.00011577723,0.00014521688,0.20696416,0.00028838735,0.7803949,0.0050149425,0.006327365],"study_design_scores_gemma":[0.000048562182,0.0000407383,0.00025677294,0.000052726926,0.000023309147,0.00009032535,0.00015654044,0.6262709,0.00045464528,0.32391918,0.048652213,0.00003420392],"about_ca_topic_score_codex":0.020305311,"about_ca_topic_score_gemma":0.013851378,"teacher_disagreement_score":0.049329095,"about_ca_system_score_codex":0.004129732,"about_ca_system_score_gemma":0.004427247,"threshold_uncertainty_score":0.16502231},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3176424,0.0017612701,0.33736295,0.014773264,0.003007542,0.002242944,0.00021512124,0.0017845278,0.32121],"genre_scores_gemma":[0.4952731,0.0014404308,0.19664171,0.0037420467,0.0005999646,0.001547222,0.0005794082,0.000687954,0.29948813],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99572504,0.0025050743,0.00012625058,0.00048713252,0.0005296418,0.000626768],"domain_scores_gemma":[0.9969103,0.0005672976,0.00012187868,0.00035521152,0.0004890803,0.0015562458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063877665,0.00056285824,0.00040437508,0.00032000008,0.0017127676,0.004193117,0.0011906747,0.0017715017,0.017387325],"category_scores_gemma":[0.004129632,0.0002807929,0.00047694074,0.00033702268,0.0013254042,0.00218486,0.003161926,0.0017320169,0.00488382],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009759144,0.0048875897,0.011253464,0.00087546755,0.000046417972,0.0015796506,0.041620266,0.007819237,0.037851673,0.20309056,0.06274802,0.62725174],"study_design_scores_gemma":[0.00010865502,0.0014889891,0.007379344,0.00030490235,0.000020452855,0.0007217936,0.009276259,0.0030182772,0.010760747,0.017300429,0.9495607,0.00005946336],"about_ca_topic_score_codex":0.0006490431,"about_ca_topic_score_gemma":0.0009646032,"teacher_disagreement_score":0.017387325,"about_ca_system_score_codex":0.0021645771,"about_ca_system_score_gemma":0.00246952,"threshold_uncertainty_score":0.058166444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08706404,0.0005289359,0.9075093,0.0004939967,0.00014036059,0.000082750616,0.00007433637,0.0003182048,0.0037880235],"genre_scores_gemma":[0.9910884,0.00010030998,0.007213742,0.00006193903,0.00003228535,0.000034219294,0.0000191315,0.000019672461,0.0014303622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.000226038,0.000035688357,0.00013760118,0.00019851509,0.00024623438],"domain_scores_gemma":[0.9974355,0.0016305528,0.00025660772,0.00011400676,0.00042810736,0.00013526944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001845756,0.0010801989,0.0012001782,0.00056003215,0.0006375466,0.0013018617,0.0016964363,0.00097161176,0.0021855598],"category_scores_gemma":[0.004519631,0.0004700159,0.00047453822,0.0006710162,0.0011878461,0.0011033714,0.001434622,0.0013796089,0.00014984011],"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.00023766469,0.000080016434,0.00022681628,0.000070571245,0.000044881985,0.00006259621,0.00007180868,0.960496,0.0021161472,0.018603133,0.0010524881,0.016937932],"study_design_scores_gemma":[0.000015128985,0.000025979547,0.00004835904,0.0000021506019,0.000008230902,0.0000047086396,0.000004409408,0.9968958,0.00012862065,0.0028015922,0.00006128531,0.0000036502222],"about_ca_topic_score_codex":0.0101546645,"about_ca_topic_score_gemma":0.008194244,"teacher_disagreement_score":0.0101546645,"about_ca_system_score_codex":0.0020000888,"about_ca_system_score_gemma":0.0015833541,"threshold_uncertainty_score":0.020191133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03192658,0.003105287,0.85169345,0.0014133453,0.0021458124,0.00058135076,0.0005633342,0.085501865,0.02306908],"genre_scores_gemma":[0.6392388,0.0019236158,0.3201084,0.0014128834,0.0018236996,0.00060990156,0.0017734232,0.0050600646,0.02804917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986707,0.00032397002,0.00005228925,0.00018358589,0.00057439186,0.0001950389],"domain_scores_gemma":[0.997654,0.00066955487,0.00014788445,0.0006059464,0.0006253774,0.00029730095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027557334,0.0011007142,0.00095194636,0.0014784505,0.0007330487,0.0014907193,0.0022456697,0.00079270604,0.0071269465],"category_scores_gemma":[0.0055771745,0.0005162093,0.00031130927,0.00077006273,0.00092397875,0.0018069398,0.0015960785,0.002624742,0.0018590832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019470691,0.00090521266,0.0021029578,0.0006734743,0.00013768859,0.00063717336,0.00019011808,0.0503214,0.058646258,0.037880402,0.1226117,0.7239465],"study_design_scores_gemma":[0.0006019068,0.00064805197,0.001227233,0.00007370233,0.00014785696,0.0006775253,0.00002869084,0.837157,0.074712016,0.012321345,0.07230308,0.0001015099],"about_ca_topic_score_codex":0.0014183937,"about_ca_topic_score_gemma":0.001650113,"teacher_disagreement_score":0.0071269465,"about_ca_system_score_codex":0.00086376665,"about_ca_system_score_gemma":0.0009551115,"threshold_uncertainty_score":0.023842037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21989658,0.003055559,0.7525573,0.00176102,0.00011225715,0.00020226743,0.00023132689,0.00033338738,0.021850307],"genre_scores_gemma":[0.98246956,0.0015310271,0.013816985,0.00008257819,0.000055881217,0.00008417751,0.000041225885,0.000032338146,0.0018862827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999356,0.0002446689,0.000017790882,0.00008321915,0.00016872663,0.00012971349],"domain_scores_gemma":[0.9984647,0.0009859351,0.0002011742,0.000064664964,0.00022900701,0.0000545101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013447233,0.0011027561,0.0006894463,0.0007867755,0.0005109388,0.0012614405,0.0012885733,0.0011671793,0.0014089213],"category_scores_gemma":[0.0064664856,0.00041055237,0.0006354129,0.0006907152,0.0010743308,0.0018224213,0.0011007892,0.0011428022,0.0001786196],"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.00005313632,0.00006942825,0.001699029,0.00007900801,0.000026289339,0.0003194784,0.00022089308,0.9423595,0.0053614243,0.04270223,0.0006776823,0.0064318753],"study_design_scores_gemma":[0.0000015459515,0.0000075701364,0.000119998775,0.0000056244567,0.00000497262,0.000019603312,0.00002348316,0.99810636,0.00024913193,0.0013624721,0.00009513129,0.0000041330204],"about_ca_topic_score_codex":0.014566869,"about_ca_topic_score_gemma":0.0066212146,"teacher_disagreement_score":0.014566869,"about_ca_system_score_codex":0.002314982,"about_ca_system_score_gemma":0.0014777129,"threshold_uncertainty_score":0.028964162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6515638,0.0021257952,0.33078292,0.00045839953,0.0005313708,0.00015870572,0.00006478072,0.0069359685,0.0073782993],"genre_scores_gemma":[0.98382217,0.00010327341,0.014010895,0.00006452295,0.000055782693,0.000035689893,0.000030902527,0.000038471877,0.0018382738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933237,0.00013811751,0.00005717039,0.00015187392,0.00016956402,0.00015089322],"domain_scores_gemma":[0.99822456,0.00040884965,0.00015538582,0.00058759446,0.00043611962,0.00018741106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011489191,0.00052941486,0.0005829642,0.0006519979,0.00083083916,0.0019549143,0.0032428273,0.00085815456,0.0018306978],"category_scores_gemma":[0.002752258,0.00045389845,0.00028637287,0.0006415546,0.0007469983,0.0023335235,0.0018744568,0.0012375654,0.0003693966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065302695,0.0015665174,0.021104852,0.00051261927,0.0006480053,0.0028127967,0.0015201463,0.29648176,0.16691378,0.0666856,0.016164541,0.4190592],"study_design_scores_gemma":[0.00022400795,0.0003765255,0.0014698671,0.000031602103,0.00024236541,0.000279663,0.000089227,0.93851465,0.041617744,0.011117954,0.005973104,0.00006338785],"about_ca_topic_score_codex":0.0026320997,"about_ca_topic_score_gemma":0.0024448272,"teacher_disagreement_score":0.0032428273,"about_ca_system_score_codex":0.0010077817,"about_ca_system_score_gemma":0.00076324283,"threshold_uncertainty_score":0.007312},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833784,0.0008375639,0.00828982,0.00025874638,0.00011101936,0.000027165139,0.0001813082,0.0012468953,0.005669087],"genre_scores_gemma":[0.9978728,0.00010765433,0.0011753503,0.000029734021,0.00001546962,0.0000058581145,0.00016187683,0.000038132006,0.0005931608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925774,0.000116668714,0.0000325511,0.000064035965,0.0003568456,0.0001721669],"domain_scores_gemma":[0.9982753,0.0007300991,0.00016750151,0.00015304891,0.0005288964,0.00014511081],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009840853,0.00039931605,0.00042880053,0.0005300215,0.0004120299,0.0006278319,0.0004620029,0.00040032913,0.0015896645],"category_scores_gemma":[0.0034965486,0.00010651669,0.00011388953,0.00035631392,0.00033879335,0.00069657015,0.0003499924,0.00051887636,0.0003226702],"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.014610778,0.0013562387,0.018693168,0.00044346496,0.0001857095,0.0010569078,0.0006619681,0.35217604,0.33328056,0.006872789,0.016840905,0.25382152],"study_design_scores_gemma":[0.00016042528,0.0015696975,0.010044982,0.000014899054,0.000035217374,0.00013849718,0.00012129542,0.90174294,0.083913095,0.00094819063,0.0012506339,0.000060174287],"about_ca_topic_score_codex":0.0100689335,"about_ca_topic_score_gemma":0.0045245816,"teacher_disagreement_score":0.99841034,"about_ca_system_score_codex":0.00069696724,"about_ca_system_score_gemma":0.00050093094,"threshold_uncertainty_score":0.020020604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016874868,0.002070416,0.9322247,0.0005739491,0.0010031537,0.00036996944,0.0006867754,0.03703938,0.009156719],"genre_scores_gemma":[0.51966846,0.0017583683,0.45450634,0.0011519532,0.000994518,0.0005893876,0.0018189612,0.0019735817,0.017538445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988632,0.0002140417,0.000084600695,0.00015663689,0.0005476946,0.00013386126],"domain_scores_gemma":[0.9981059,0.0005764183,0.00011225386,0.0004703111,0.00054865226,0.00018657136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016744288,0.0008910546,0.00093835685,0.0014128777,0.0010251357,0.0017453773,0.003211356,0.000978881,0.0040144552],"category_scores_gemma":[0.0053915875,0.00045034155,0.00044486183,0.00085057545,0.000720517,0.0018838277,0.0018657065,0.0025995271,0.0012523445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028436591,0.00046502126,0.0011612113,0.0006665803,0.00024457293,0.0006020572,0.0003362583,0.055941127,0.092093796,0.05392689,0.0815155,0.7102034],"study_design_scores_gemma":[0.0003001908,0.0003646337,0.00072931405,0.00006166235,0.00017088621,0.00084884156,0.000041375966,0.851859,0.07393937,0.020696523,0.050810393,0.0001777827],"about_ca_topic_score_codex":0.0019841488,"about_ca_topic_score_gemma":0.0022746194,"teacher_disagreement_score":0.0040144552,"about_ca_system_score_codex":0.00071985024,"about_ca_system_score_gemma":0.0009775306,"threshold_uncertainty_score":0.013429701},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007916191,0.0012617776,0.0699357,0.003818443,0.003715858,0.0007392682,0.015918292,0.058612313,0.8380823],"genre_scores_gemma":[0.043408673,0.0016210871,0.038938597,0.0027911223,0.0010439354,0.0005736733,0.027444141,0.011922437,0.8722563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989385,0.00015330856,0.00006713292,0.00025904435,0.0004430359,0.00013905492],"domain_scores_gemma":[0.99685884,0.00048745028,0.00019857161,0.0007750482,0.0012003117,0.0004797473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014048376,0.00089389813,0.00051558035,0.0013186095,0.0011444406,0.0038428921,0.002096249,0.0017387667,0.41496152],"category_scores_gemma":[0.004379487,0.00053638755,0.0006609103,0.0016077934,0.00046844257,0.0049208268,0.0027131347,0.0018501001,0.26601037],"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.00058869127,0.00013630063,0.0015571878,0.00043268417,0.000021816564,0.00032372784,0.000399051,0.00068815233,0.005639551,0.02539753,0.71587896,0.24893636],"study_design_scores_gemma":[0.00003705939,0.00006943496,0.0003515908,0.000031457206,0.0000071757177,0.00019675762,0.000052521937,0.0009349686,0.0012679843,0.0014146412,0.99562174,0.000014711911],"about_ca_topic_score_codex":0.0013738452,"about_ca_topic_score_gemma":0.001489948,"teacher_disagreement_score":0.41496152,"about_ca_system_score_codex":0.00084711483,"about_ca_system_score_gemma":0.0014826067,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38537237,0.00059412146,0.60250294,0.00021821405,0.00011898264,0.00030807557,0.00015176632,0.000724248,0.010009303],"genre_scores_gemma":[0.98624957,0.0001331026,0.012572131,0.0000115831535,0.000012120707,0.00005275137,0.000051466915,0.00001152481,0.00090579357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975747,0.00005485296,0.000010509805,0.000031205192,0.00012212178,0.000023821258],"domain_scores_gemma":[0.9995757,0.00016651134,0.00003726104,0.000022187623,0.000175401,0.000022902721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052067457,0.0005790245,0.00039956355,0.00025130488,0.00027090192,0.000482226,0.00084812037,0.00046268073,0.0007447128],"category_scores_gemma":[0.0013142289,0.00016460431,0.00023128033,0.00016911057,0.0002602085,0.00049275055,0.00021652466,0.0004027491,0.00010702454],"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.000039131155,0.000031976077,0.000502632,0.00002587117,0.000009880064,0.000031720065,0.0000115115845,0.9889781,0.0036194944,0.0010223478,0.000089559806,0.0056378325],"study_design_scores_gemma":[0.0000024485234,0.000031458098,0.000058825517,6.4740846e-7,0.0000027681288,0.00000393914,0.0000024572114,0.99910164,0.0006003333,0.000116974,0.00007747201,0.0000011955225],"about_ca_topic_score_codex":0.0077833417,"about_ca_topic_score_gemma":0.0031020022,"teacher_disagreement_score":0.0077833417,"about_ca_system_score_codex":0.0007330411,"about_ca_system_score_gemma":0.00061248714,"threshold_uncertainty_score":0.015476108},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09203971,0.000323001,0.89926875,0.00034760637,0.0001642162,0.00013485002,0.00004184911,0.0012891167,0.0063909516],"genre_scores_gemma":[0.9570031,0.00009723044,0.040798705,0.00009117097,0.000046034573,0.00007388012,0.000013805143,0.000018552666,0.0018573442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996282,0.00008610859,0.000020008258,0.00006613808,0.00015268257,0.000046839334],"domain_scores_gemma":[0.9989987,0.00035795305,0.0001374054,0.0002531392,0.00019997364,0.000052781314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497827,0.00041265803,0.00040294012,0.00047411956,0.0004252752,0.0008623756,0.00168467,0.00091604964,0.0026325502],"category_scores_gemma":[0.0027163208,0.00025922497,0.0002928835,0.00021427906,0.001081313,0.0011952593,0.0014101409,0.0009029296,0.00034466683],"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.00045165184,0.00034038117,0.001643199,0.00033159583,0.00012213414,0.00045893868,0.0003069979,0.48137212,0.1980859,0.21898311,0.0026080762,0.09529585],"study_design_scores_gemma":[0.000059726826,0.000121327306,0.00019289694,0.000010550116,0.000014472375,0.000074878015,0.00001276014,0.9730488,0.011863104,0.012780107,0.0018064034,0.0000150214155],"about_ca_topic_score_codex":0.000619021,"about_ca_topic_score_gemma":0.000469025,"teacher_disagreement_score":0.0026325502,"about_ca_system_score_codex":0.0006080699,"about_ca_system_score_gemma":0.0005377613,"threshold_uncertainty_score":0.008806765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037560037,0.0019214988,0.9753945,0.0037761002,0.00024116157,0.000029388826,0.000077529585,0.000081215134,0.014722608],"genre_scores_gemma":[0.6406193,0.010195948,0.3059889,0.003040768,0.0040731863,0.00039743108,0.00030006823,0.00032010558,0.035064306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971861,0.0012873453,0.0001055406,0.0003860327,0.00083664886,0.00019826021],"domain_scores_gemma":[0.99299955,0.004944593,0.0005041922,0.0004573629,0.0008809543,0.00021340443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041108485,0.0015479444,0.0016411555,0.0015226818,0.0007651012,0.0035752777,0.0034120732,0.0025915857,0.0041932683],"category_scores_gemma":[0.013566354,0.0009200716,0.0012092999,0.0012959908,0.003277425,0.0054674647,0.0016828602,0.0032868455,0.0005599964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024832354,0.000021755237,0.00013966061,0.000077124605,0.000031989995,0.00004134802,0.00003629985,0.07546525,0.00038387172,0.91401726,0.0016755047,0.00808511],"study_design_scores_gemma":[0.000014194559,0.000024334859,0.00007416013,0.000019176869,0.000017329468,0.000030998774,0.000009260611,0.25600955,0.00023512455,0.7412607,0.0022895394,0.000015587444],"about_ca_topic_score_codex":0.0022889278,"about_ca_topic_score_gemma":0.0013637053,"teacher_disagreement_score":0.0041932683,"about_ca_system_score_codex":0.0021798892,"about_ca_system_score_gemma":0.0012819775,"threshold_uncertainty_score":0.021740496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009147059,0.00021180129,0.9876654,0.00010081224,0.000093618764,0.000079931866,0.000009725379,0.00079395913,0.0018976867],"genre_scores_gemma":[0.79535073,0.00040266427,0.20119666,0.00020899215,0.00018730164,0.00028891925,0.000051734314,0.000058557456,0.0022544542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00005936747,0.000027620343,0.000108553904,0.00017989198,0.00004040291],"domain_scores_gemma":[0.99950707,0.00011986603,0.00007013415,0.000034435663,0.00024546828,0.000022950628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012657,0.00054107164,0.00046892153,0.00044491634,0.00042257112,0.0007181677,0.0014833912,0.00066022214,0.0012616058],"category_scores_gemma":[0.0012332897,0.00025001794,0.0003166871,0.00023957652,0.00035090547,0.000628385,0.0003399176,0.0007557145,0.00038545078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005312025,0.00039258527,0.002301788,0.0005305646,0.00015832287,0.00058323995,0.0004564874,0.31052294,0.19286169,0.041629583,0.004843354,0.44518828],"study_design_scores_gemma":[0.00010157638,0.00020198178,0.00030958504,0.000011670989,0.000036936774,0.00013664085,0.00001248637,0.9776084,0.016202692,0.0022554863,0.0031006327,0.000021967327],"about_ca_topic_score_codex":0.0010710035,"about_ca_topic_score_gemma":0.0007415215,"teacher_disagreement_score":0.0014833912,"about_ca_system_score_codex":0.00036373918,"about_ca_system_score_gemma":0.00053671637,"threshold_uncertainty_score":0.004220426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790029,0.0007744959,0.017207392,0.00019927628,0.000076355995,0.000056679513,0.00008103363,0.0007297898,0.0018720803],"genre_scores_gemma":[0.9941351,0.00013803592,0.0054015606,0.000039085862,0.000009901442,0.000024633799,0.000050445444,0.00005008363,0.00015114834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740475,0.0009421356,0.00020924138,0.00038869245,0.0006790732,0.00037609396],"domain_scores_gemma":[0.9415083,0.048411865,0.0038767217,0.0023326753,0.0025011112,0.0013693958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051118447,0.00076093234,0.000526229,0.00088280573,0.000449511,0.000971143,0.0008074055,0.0008287872,0.00055647804],"category_scores_gemma":[0.03949771,0.00030473387,0.00027188566,0.00067790615,0.00069648784,0.0012428322,0.00054681615,0.0010830066,0.00011831037],"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.0059409644,0.0014942086,0.03566836,0.00033665317,0.00024708474,0.0004943439,0.00045883923,0.78222585,0.06733042,0.005294324,0.0012600222,0.099248886],"study_design_scores_gemma":[0.00033969287,0.002570486,0.012916836,0.000049522703,0.00022922357,0.00039061246,0.00024591162,0.915352,0.06566467,0.001274612,0.00089319696,0.00007328424],"about_ca_topic_score_codex":0.0014069866,"about_ca_topic_score_gemma":0.00091236853,"teacher_disagreement_score":0.0051118447,"about_ca_system_score_codex":0.00073565176,"about_ca_system_score_gemma":0.00087552273,"threshold_uncertainty_score":0.027034342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018182399,0.00032993674,0.97600603,0.00015277778,0.00014736404,0.00007707511,0.00003437184,0.00065491046,0.0044151344],"genre_scores_gemma":[0.83884764,0.00048091522,0.15744299,0.00021936123,0.00017111638,0.00016213601,0.00009648696,0.000028429622,0.0025508853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.000065618624,0.000030996696,0.00008539808,0.00020385429,0.00004504572],"domain_scores_gemma":[0.9996062,0.00012722347,0.00006766408,0.000031145293,0.00014436724,0.000023342925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807486,0.0006303901,0.00039726502,0.00063187367,0.0006583127,0.00095112546,0.0010534779,0.00074916723,0.0012154753],"category_scores_gemma":[0.0011378218,0.00014655267,0.0005081299,0.0005352877,0.0005387715,0.0007255061,0.0004062459,0.0008403671,0.00024190095],"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.0003638101,0.0004901388,0.0017477246,0.000483227,0.0001561886,0.00066505553,0.00033161414,0.53391963,0.08750418,0.056326136,0.004833609,0.31317878],"study_design_scores_gemma":[0.000045087658,0.00011992925,0.00029509672,0.00001830265,0.000038028236,0.00007640037,0.00001500581,0.98274773,0.00599803,0.008149159,0.0024759236,0.000021251339],"about_ca_topic_score_codex":0.004194292,"about_ca_topic_score_gemma":0.0035935293,"teacher_disagreement_score":0.004194292,"about_ca_system_score_codex":0.0007612765,"about_ca_system_score_gemma":0.0007420276,"threshold_uncertainty_score":0.008339763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1927924,0.00071409455,0.8018449,0.00047024043,0.0001725688,0.00009139312,0.000047890015,0.00078460196,0.0030819657],"genre_scores_gemma":[0.96088725,0.00008327165,0.037461113,0.000059029408,0.000049044742,0.000022170083,0.000019508818,0.000024329158,0.0013943687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986657,0.00044714333,0.00006744085,0.00017965832,0.0004252247,0.00021484803],"domain_scores_gemma":[0.9980769,0.0009571253,0.00015189967,0.00031457152,0.00039017745,0.00010930462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026593439,0.00045716902,0.0006988528,0.00056258065,0.00093150017,0.0015647955,0.0018457745,0.0006639355,0.0009434561],"category_scores_gemma":[0.004863058,0.00047174396,0.0003034047,0.00058177026,0.0011279876,0.0014467975,0.0015536264,0.0011128909,0.00012540123],"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.0007984778,0.00032054167,0.0019751673,0.0000477261,0.000059909056,0.00014878344,0.00026642033,0.8085677,0.015072066,0.032393403,0.0010291834,0.13932061],"study_design_scores_gemma":[0.0000073635993,0.000025778789,0.0001974135,0.0000014271708,0.0000075639814,0.000011701378,0.000008298524,0.9951552,0.0014990215,0.0029736813,0.00010605904,0.000006522836],"about_ca_topic_score_codex":0.0066552586,"about_ca_topic_score_gemma":0.00942811,"teacher_disagreement_score":0.0066552586,"about_ca_system_score_codex":0.0014610168,"about_ca_system_score_gemma":0.0010954802,"threshold_uncertainty_score":0.014064133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069682123,0.021900875,0.6321357,0.011840725,0.012662549,0.0034652527,0.009818741,0.013855785,0.2873522],"genre_scores_gemma":[0.22078049,0.03531975,0.37933576,0.0102081755,0.004514406,0.013741325,0.034291416,0.0034962143,0.29831252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978314,0.000613514,0.00033511582,0.00022391886,0.00076769374,0.0002283945],"domain_scores_gemma":[0.9974566,0.0005717972,0.00034272968,0.00056616694,0.00096856145,0.00009418777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956679,0.0014448039,0.0010606388,0.0018536098,0.0013927752,0.00326027,0.0021115658,0.002850418,0.034046877],"category_scores_gemma":[0.0051940545,0.0004949593,0.0007250838,0.003117669,0.0011087192,0.004221898,0.002390116,0.003508858,0.023170723],"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.0003037295,0.00017491555,0.0005916434,0.0020535525,0.00008378329,0.0011788934,0.0005272717,0.013059966,0.012252831,0.45222715,0.30745003,0.21009625],"study_design_scores_gemma":[0.00008658252,0.00017028335,0.00026404328,0.0005442095,0.000042556832,0.00061581214,0.00011311385,0.028310992,0.004235088,0.092134945,0.87338793,0.00009449357],"about_ca_topic_score_codex":0.0024284432,"about_ca_topic_score_gemma":0.0017119421,"teacher_disagreement_score":0.034046877,"about_ca_system_score_codex":0.0023890338,"about_ca_system_score_gemma":0.002243838,"threshold_uncertainty_score":0.11389822},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098359376,0.17371367,0.6581332,0.0014452,0.0011019096,0.0002083597,0.000071975264,0.00043154488,0.06653487],"genre_scores_gemma":[0.7845738,0.07434846,0.12930702,0.00029615627,0.0013835942,0.00017629792,0.00009728669,0.0000829991,0.009734429],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985683,0.00019926396,0.00006862593,0.0001364847,0.000944839,0.00008238553],"domain_scores_gemma":[0.9988657,0.00058864534,0.00008287111,0.00006643157,0.0003426615,0.00005369628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015806096,0.00053346425,0.0005362764,0.001781043,0.00040410802,0.0028844776,0.0012950068,0.0009723874,0.0012719483],"category_scores_gemma":[0.002394783,0.00021328007,0.0003151853,0.0013486724,0.00093016314,0.0026233878,0.00072577584,0.0008976925,0.00020062408],"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.00062119256,0.00033119955,0.002148935,0.001189578,0.00010681545,0.00019908688,0.00060259673,0.065209605,0.01799437,0.31077656,0.0027618702,0.59805816],"study_design_scores_gemma":[0.0001761564,0.0012966464,0.005245557,0.00057689764,0.00016793371,0.00085088634,0.00094036537,0.7269621,0.015600849,0.16413778,0.08386922,0.0001756533],"about_ca_topic_score_codex":0.0009279458,"about_ca_topic_score_gemma":0.0007214503,"teacher_disagreement_score":0.0028844776,"about_ca_system_score_codex":0.0015221273,"about_ca_system_score_gemma":0.00054200774,"threshold_uncertainty_score":0.011043847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031796815,0.0022677763,0.9892007,0.00048727362,0.00016408552,0.000026573593,0.000030549458,0.00008267153,0.004560627],"genre_scores_gemma":[0.57515085,0.018445881,0.38828215,0.00071847753,0.0032034346,0.0004532617,0.00028548087,0.00053924136,0.012921261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973578,0.0012709713,0.00011490041,0.0002710228,0.0008677668,0.000117555544],"domain_scores_gemma":[0.99575716,0.002951877,0.00036479588,0.00034215456,0.000487526,0.00009655497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003398582,0.0017264499,0.0011269307,0.0019069948,0.00056347606,0.0015931126,0.0010817508,0.0014778438,0.0015812803],"category_scores_gemma":[0.010131985,0.00049816037,0.001230755,0.0019528628,0.0030094762,0.0027338138,0.0018389865,0.0023200612,0.0004886681],"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.000059707127,0.000032820808,0.00024658383,0.0001643592,0.00007573314,0.00011625838,0.0000801242,0.6036776,0.0025777104,0.3463332,0.0016019745,0.045034006],"study_design_scores_gemma":[0.0000064469295,0.000041935273,0.0000905427,0.00003074485,0.000012675443,0.000050055056,0.000009376229,0.78886276,0.0007686198,0.20676859,0.0033410622,0.000017228347],"about_ca_topic_score_codex":0.0011330702,"about_ca_topic_score_gemma":0.00046689235,"teacher_disagreement_score":0.003398582,"about_ca_system_score_codex":0.0016159544,"about_ca_system_score_gemma":0.00069348415,"threshold_uncertainty_score":0.017973661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076472364,0.0013538661,0.8327627,0.00988698,0.0013919362,0.0003230354,0.00033022702,0.026895225,0.05058366],"genre_scores_gemma":[0.745829,0.00082345033,0.24083228,0.0026935705,0.0003612982,0.0002891327,0.00031776374,0.0013719992,0.0074814167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859077,0.00036599243,0.00006765351,0.00018028656,0.0005109651,0.00028435426],"domain_scores_gemma":[0.996354,0.00080030115,0.00031829183,0.0012985648,0.0010447436,0.00018408216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032771465,0.0006473933,0.00050780835,0.00061901036,0.0006354077,0.0016994398,0.002835586,0.0010820538,0.0041617122],"category_scores_gemma":[0.012727513,0.00030979014,0.00041836812,0.0006421348,0.0011589803,0.0044369996,0.00094441115,0.0017044945,0.0018451413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014970823,0.00041028621,0.0064812545,0.00054381206,0.000104285726,0.00062171783,0.0006273474,0.092988335,0.029908514,0.3958574,0.052667875,0.4182921],"study_design_scores_gemma":[0.0002713691,0.00041562834,0.0021209612,0.00012442526,0.000088770976,0.00048205428,0.00025462956,0.7404966,0.037102524,0.11280793,0.10570705,0.00012806973],"about_ca_topic_score_codex":0.0028781428,"about_ca_topic_score_gemma":0.0014501758,"teacher_disagreement_score":0.0041617122,"about_ca_system_score_codex":0.0007669974,"about_ca_system_score_gemma":0.0010660934,"threshold_uncertainty_score":0.017331421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3925874,0.0005347556,0.5938693,0.0005100761,0.00020185515,0.00011798915,0.00009434937,0.004170096,0.007914217],"genre_scores_gemma":[0.95707333,0.00008018418,0.04103855,0.00003308146,0.000016460986,0.000022335355,0.000043434196,0.000060558286,0.0016320789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00017593255,0.000030249443,0.000079816695,0.000068190995,0.00014366211],"domain_scores_gemma":[0.9987031,0.00030765677,0.00008945846,0.0004672756,0.0003155383,0.00011708178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232266,0.00037407348,0.0007543902,0.00066895125,0.0015355224,0.0013619246,0.0016343256,0.00055599987,0.0030763203],"category_scores_gemma":[0.002464935,0.0003862661,0.00043276884,0.00089609664,0.0006417221,0.0016277907,0.0015437779,0.0005928922,0.0004860457],"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.0015015999,0.00029283075,0.0054859812,0.0001941778,0.00013914966,0.00025969718,0.00041538491,0.7215666,0.060579702,0.03985445,0.0040482236,0.16566223],"study_design_scores_gemma":[0.000018013343,0.00013257384,0.00035325403,0.000007885103,0.000032205862,0.000029647195,0.00007502726,0.983328,0.009438323,0.0048989006,0.0016666675,0.000019401097],"about_ca_topic_score_codex":0.00823738,"about_ca_topic_score_gemma":0.010033529,"teacher_disagreement_score":0.00823738,"about_ca_system_score_codex":0.0014650598,"about_ca_system_score_gemma":0.0010480408,"threshold_uncertainty_score":0.01637888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028944079,0.0005426714,0.9669116,0.00015411951,0.00013732337,0.000036500933,0.00002267367,0.00029222766,0.002958815],"genre_scores_gemma":[0.96259874,0.0003905222,0.034350224,0.000051996187,0.000050521165,0.00005737073,0.000031588545,0.000016248794,0.0024528455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981743,0.000036006502,0.000009731379,0.00004856029,0.00007068655,0.00001756595],"domain_scores_gemma":[0.99981135,0.00006345738,0.000030086067,0.000021440419,0.000062219384,0.000011533987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037816586,0.000431085,0.00031292354,0.00020224608,0.00019490492,0.0005583224,0.0005146089,0.00038547482,0.0010671127],"category_scores_gemma":[0.00072572567,0.00012301686,0.00032858926,0.0001699552,0.00045440925,0.0004879257,0.00030979927,0.0004867653,0.00009986049],"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.00017997493,0.000077294426,0.0005510864,0.00020815828,0.00006923212,0.00018233068,0.00017244885,0.7565153,0.047616288,0.050312296,0.0015418918,0.14257365],"study_design_scores_gemma":[0.000010202065,0.00008805837,0.000105484476,0.0000039702054,0.000008507391,0.000012135083,0.000004518792,0.9952549,0.002232141,0.0015027152,0.0007724751,0.0000049494797],"about_ca_topic_score_codex":0.0022313136,"about_ca_topic_score_gemma":0.0010997908,"teacher_disagreement_score":0.0022313136,"about_ca_system_score_codex":0.00037833047,"about_ca_system_score_gemma":0.00045736562,"threshold_uncertainty_score":0.004436612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016230147,0.0004033664,0.97906464,0.00025449402,0.00011923267,0.00009271611,0.00007023453,0.00086961745,0.0028954935],"genre_scores_gemma":[0.7502608,0.00029959297,0.24438697,0.00016673666,0.00012276114,0.00018607809,0.00010525622,0.00012622484,0.0043454957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801266,0.00041023144,0.00008699832,0.00038404696,0.00069062307,0.0004154584],"domain_scores_gemma":[0.9957553,0.0030172137,0.00022356083,0.00042085553,0.00040754728,0.00017563764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025405043,0.0011470333,0.001804419,0.00061026914,0.0017021706,0.0021052093,0.002999505,0.0013530441,0.0032110524],"category_scores_gemma":[0.00686555,0.00050481205,0.00064569537,0.0009436516,0.0014620437,0.0020955119,0.0016605392,0.0014872879,0.0005764093],"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.0005134708,0.00012896322,0.00056930445,0.00018578712,0.00005776554,0.00017313796,0.00015665896,0.8446945,0.0068728235,0.08891045,0.0030226037,0.05471454],"study_design_scores_gemma":[0.000023917926,0.000020100826,0.000021870785,0.0000026772082,0.000006887528,0.000012906039,0.0000046154546,0.9896326,0.00063059595,0.0091922525,0.00044606804,0.0000054588545],"about_ca_topic_score_codex":0.0064307647,"about_ca_topic_score_gemma":0.00630403,"teacher_disagreement_score":0.0064307647,"about_ca_system_score_codex":0.0027332366,"about_ca_system_score_gemma":0.0033060673,"threshold_uncertainty_score":0.019831061},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14293307,0.0027250168,0.8423085,0.0007036377,0.0005561616,0.00023321732,0.000074133175,0.001679892,0.008786305],"genre_scores_gemma":[0.9309735,0.0012983838,0.06228633,0.00055543653,0.00033050848,0.000059428614,0.000048850154,0.00006509389,0.0043824823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892586,0.00025688036,0.000049909784,0.00011596031,0.00044414628,0.00020717792],"domain_scores_gemma":[0.9977076,0.00096856634,0.0002588547,0.00034411898,0.0005989819,0.00012189405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020286709,0.00048664465,0.0005673122,0.00079974096,0.00069761573,0.0011512515,0.0018201744,0.0005262508,0.0012841393],"category_scores_gemma":[0.003216044,0.00021459167,0.00031426264,0.00063771097,0.0010565957,0.0013393417,0.00076080183,0.0011588996,0.00029700578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010515315,0.0007840132,0.0061580376,0.0005921892,0.00017306008,0.00076454744,0.0011129099,0.21719883,0.18044476,0.16849804,0.0050646667,0.41815737],"study_design_scores_gemma":[0.000118431686,0.0009340665,0.0017261785,0.000059552047,0.00016231084,0.0003967326,0.00017790133,0.88540167,0.072583936,0.022773694,0.015563233,0.00010237919],"about_ca_topic_score_codex":0.0029876898,"about_ca_topic_score_gemma":0.0016807881,"teacher_disagreement_score":0.0029876898,"about_ca_system_score_codex":0.000876689,"about_ca_system_score_gemma":0.0009462788,"threshold_uncertainty_score":0.010728776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91907126,0.0012686307,0.034826275,0.00039818897,0.0004158476,0.000192764,0.0037989137,0.003959705,0.036068406],"genre_scores_gemma":[0.97182626,0.00079485064,0.013342624,0.00015684111,0.00012945372,0.00011619505,0.006165211,0.00026027014,0.0072083604],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99956316,0.000054864588,0.000023111004,0.00006604326,0.00022695305,0.00006575624],"domain_scores_gemma":[0.9984554,0.00038052886,0.00008624083,0.0001615132,0.0008261684,0.000090114685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036144134,0.00031751575,0.0003140054,0.0010571198,0.00035372932,0.0005140993,0.00044281603,0.00035316782,0.0030393112],"category_scores_gemma":[0.0012914581,0.00010649455,0.00011871877,0.0013364207,0.00024214071,0.00050863455,0.0002803828,0.00035496947,0.001539729],"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.0010882353,0.0015761015,0.05062539,0.00052277424,0.000049943657,0.0013877964,0.00038779248,0.047959197,0.37433615,0.0056340937,0.06582761,0.45060486],"study_design_scores_gemma":[0.000053272277,0.001209876,0.11308517,0.0001339478,0.000045007037,0.0018157653,0.0006632217,0.52276,0.3176582,0.0023239988,0.040118724,0.00013285424],"about_ca_topic_score_codex":0.004083795,"about_ca_topic_score_gemma":0.0020328658,"teacher_disagreement_score":0.004083795,"about_ca_system_score_codex":0.0005088411,"about_ca_system_score_gemma":0.0002480496,"threshold_uncertainty_score":0.0101674795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002693,0.0006112292,0.8416122,0.0004767788,0.0004584617,0.00072679715,0.0060983156,0.040922865,0.019066405],"genre_scores_gemma":[0.61564904,0.00084400875,0.35928968,0.00047438496,0.000076329925,0.0018653154,0.0065196957,0.0048473882,0.010434131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993237,0.00029091944,0.00004861488,0.000048258084,0.0001979812,0.00009047572],"domain_scores_gemma":[0.99814975,0.00112957,0.00008720607,0.0001633873,0.0003504274,0.000119682714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015440278,0.0014535858,0.0012130031,0.0006984656,0.0005485603,0.00086878403,0.002657444,0.0010172417,0.007439241],"category_scores_gemma":[0.0034133939,0.0009238145,0.0006395485,0.0006146682,0.00041524097,0.0009656772,0.00069608534,0.0017512669,0.0010989347],"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.00044069806,0.00027299367,0.0013718805,0.0003116681,0.0001087968,0.00013882079,0.00011765142,0.93960434,0.0060741683,0.010983405,0.0152747305,0.025300913],"study_design_scores_gemma":[0.00008196346,0.000044024902,0.00010818516,0.0000114788545,0.000015298243,0.000017440398,0.000005856365,0.991516,0.0032604258,0.001279077,0.0036492131,0.000010927637],"about_ca_topic_score_codex":0.0076273503,"about_ca_topic_score_gemma":0.0060158754,"teacher_disagreement_score":0.0076273503,"about_ca_system_score_codex":0.0009900437,"about_ca_system_score_gemma":0.001462979,"threshold_uncertainty_score":0.024886668},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008468,0.9152658,0.05767677,0.00087894953,0.00057660294,0.00006367235,0.0001248131,0.00021888844,0.01672647],"genre_scores_gemma":[0.088185474,0.87104785,0.030833922,0.00050964416,0.0012450645,0.000105474195,0.00050662295,0.000060478465,0.0075053964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990232,0.00016629207,0.000107930755,0.00016180183,0.0004576507,0.00008317177],"domain_scores_gemma":[0.9987998,0.0006791629,0.00010250307,0.0000838183,0.0002803025,0.000054436845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010176764,0.00068159157,0.0007976415,0.0020657247,0.0005023578,0.0019209645,0.0013718636,0.0011973714,0.0031715883],"category_scores_gemma":[0.0014116996,0.0005224409,0.0004157624,0.005352242,0.0003671565,0.0027666248,0.0006493794,0.0010299815,0.0010711097],"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.00014499086,0.00013648678,0.0014395497,0.0042958884,0.00006461589,0.000247301,0.00017487135,0.013452796,0.002684257,0.018587356,0.0119938515,0.94677806],"study_design_scores_gemma":[0.000045746023,0.00042290264,0.0033699605,0.0027645456,0.0001303848,0.002571109,0.00042394505,0.059602957,0.0064447788,0.023185454,0.90092635,0.00011196148],"about_ca_topic_score_codex":0.0013256498,"about_ca_topic_score_gemma":0.00075947336,"teacher_disagreement_score":0.0031715883,"about_ca_system_score_codex":0.0006495214,"about_ca_system_score_gemma":0.00082823774,"threshold_uncertainty_score":0.010610044},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8920029,0.0011009087,0.097229145,0.0007360932,0.00011263364,0.0002196195,0.00027932072,0.0010600025,0.007259528],"genre_scores_gemma":[0.9959099,0.00009528038,0.003251029,0.000052512245,0.00001588859,0.0000247605,0.000065015425,0.000042501266,0.0005430986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784803,0.00038404885,0.00007488103,0.00027124057,0.0010188468,0.0004029342],"domain_scores_gemma":[0.9862665,0.008272864,0.0023927817,0.00068394997,0.0018660574,0.0005176865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028165383,0.0005410817,0.00051624374,0.0010784088,0.00046960323,0.0015776159,0.0012545896,0.0010433263,0.0010613115],"category_scores_gemma":[0.018945074,0.00056975905,0.0003926421,0.0010331932,0.0011055972,0.0017832613,0.00082768116,0.0011303804,0.00017706901],"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.0020061675,0.0009898797,0.084199734,0.00028293935,0.00028500243,0.0012970999,0.0007393663,0.7733297,0.047867034,0.029729227,0.00404531,0.055228543],"study_design_scores_gemma":[0.000067593646,0.00043059007,0.01617947,0.000017409122,0.000073981675,0.00021532389,0.00008090517,0.9722502,0.0062143854,0.0038899628,0.000526638,0.00005348607],"about_ca_topic_score_codex":0.011344154,"about_ca_topic_score_gemma":0.00616424,"teacher_disagreement_score":0.011344154,"about_ca_system_score_codex":0.0020180668,"about_ca_system_score_gemma":0.0012453324,"threshold_uncertainty_score":0.022556245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076198566,0.00011718288,0.99488175,0.00013784519,0.00003908863,0.000092014576,0.00004097356,0.00061764265,0.0033116152],"genre_scores_gemma":[0.056113776,0.00039830076,0.936287,0.000107527674,0.0000933036,0.0005215549,0.00018701794,0.00024949366,0.0060420125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849415,0.00046655894,0.000108293534,0.00017070695,0.00060748676,0.0001527073],"domain_scores_gemma":[0.9992768,0.00023540953,0.00005733593,0.00017445604,0.00017130899,0.00008471568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026969572,0.0007142523,0.0005318776,0.0011516453,0.0019573616,0.002809238,0.0030644685,0.0018684436,0.00570621],"category_scores_gemma":[0.0028460138,0.00074743474,0.0012576424,0.0008172804,0.0017526636,0.0027129026,0.00264325,0.002528658,0.002127795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038150523,0.000039300743,0.00012612416,0.00009374325,0.000016272665,0.00027291445,0.00033958466,0.052355945,0.004212575,0.89770067,0.003679638,0.041125044],"study_design_scores_gemma":[0.000062979234,0.0001108969,0.00012804926,0.0001451665,0.000030692103,0.0003228423,0.00012511354,0.52776223,0.0052024066,0.33734503,0.12869684,0.000067691195],"about_ca_topic_score_codex":0.0030902135,"about_ca_topic_score_gemma":0.0033301818,"teacher_disagreement_score":0.00570621,"about_ca_system_score_codex":0.0020220447,"about_ca_system_score_gemma":0.0016400957,"threshold_uncertainty_score":0.019089222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1366145,0.0007562844,0.8577991,0.0003141547,0.000056836398,0.000051222687,0.00003101079,0.0007839059,0.0035929778],"genre_scores_gemma":[0.9440513,0.00019054103,0.054967932,0.000040944346,0.00003775803,0.000030273877,0.000032269338,0.000027459782,0.0006214463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925953,0.00020568098,0.000024497293,0.00008636956,0.00028879638,0.0001351343],"domain_scores_gemma":[0.99901223,0.0005223383,0.00011067498,0.00017235224,0.00013774945,0.000044583834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006851834,0.00037830687,0.0004956651,0.00044149402,0.00061399105,0.0008785596,0.00084647775,0.0006387907,0.0012577963],"category_scores_gemma":[0.0031640714,0.00022727012,0.00020274382,0.00057369645,0.00047068618,0.0014016379,0.00071460666,0.0007869603,0.00027435814],"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.00059209584,0.00022080318,0.001955957,0.00020020212,0.00007294354,0.00029538278,0.00017583696,0.6362578,0.0705276,0.060997207,0.0036668144,0.2250373],"study_design_scores_gemma":[0.000019099727,0.000045204328,0.00044980308,0.00000706382,0.000013682425,0.000102663806,0.000021507172,0.9816704,0.005638621,0.010375859,0.0016459224,0.0000100849575],"about_ca_topic_score_codex":0.0009260729,"about_ca_topic_score_gemma":0.001167504,"teacher_disagreement_score":0.0012577963,"about_ca_system_score_codex":0.0005849938,"about_ca_system_score_gemma":0.0006692742,"threshold_uncertainty_score":0.0042444468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3597681,0.0021180427,0.48085353,0.00044947278,0.0009522637,0.0028770524,0.003217273,0.13043724,0.019327052],"genre_scores_gemma":[0.82779354,0.00042649548,0.15678695,0.00018485218,0.00010308925,0.000594859,0.0028027522,0.0027737909,0.008533754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997038,0.00070976367,0.00017600853,0.00025820432,0.0013479433,0.0004701127],"domain_scores_gemma":[0.99599,0.0010342427,0.0003221306,0.00091782404,0.0013118779,0.00042396042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030247548,0.001547556,0.0009903093,0.002379837,0.0010092123,0.0017066215,0.0030252424,0.0008509791,0.004645361],"category_scores_gemma":[0.008086705,0.0005659369,0.0003467458,0.0014273816,0.0005998702,0.002402653,0.0010368124,0.0014097971,0.000974306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009830643,0.0026375013,0.010506485,0.00086569163,0.00073211157,0.0005947667,0.00040563048,0.09684732,0.11404809,0.014336923,0.05019814,0.6989967],"study_design_scores_gemma":[0.0009101835,0.0021262222,0.006360079,0.000051952742,0.0003705894,0.0005991743,0.00008923614,0.8395915,0.12833372,0.0033101777,0.018033711,0.00022351682],"about_ca_topic_score_codex":0.0069722487,"about_ca_topic_score_gemma":0.005934517,"teacher_disagreement_score":0.0069722487,"about_ca_system_score_codex":0.0014109657,"about_ca_system_score_gemma":0.0021640656,"threshold_uncertainty_score":0.015996635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027320783,0.00032486804,0.9899795,0.00010643519,0.00034353504,0.00022560883,0.000076325356,0.002674038,0.0035376363],"genre_scores_gemma":[0.34991434,0.00080826844,0.6183611,0.0004102184,0.0003992532,0.0010007976,0.00030642853,0.00060292904,0.028196655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981267,0.00032779409,0.00012449137,0.00035190556,0.00091559836,0.00015353397],"domain_scores_gemma":[0.99909425,0.00022824237,0.000088626155,0.00023136861,0.0002950846,0.000062382096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013282152,0.0005844115,0.0006166324,0.0013739753,0.0008638366,0.0014968794,0.0020485325,0.0006859266,0.004688086],"category_scores_gemma":[0.0024812093,0.0002535008,0.0005095403,0.0009655737,0.0011018257,0.0016915319,0.0011711004,0.0014348249,0.0014737247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008012605,0.0003132441,0.00082088035,0.00041785877,0.00010056941,0.00042909247,0.0003731164,0.030709632,0.10597869,0.22476304,0.017696816,0.61759573],"study_design_scores_gemma":[0.00038583955,0.0009201683,0.00085754436,0.00008131333,0.00017133975,0.001306372,0.00010225964,0.6276653,0.13649109,0.05892946,0.17282507,0.00026437335],"about_ca_topic_score_codex":0.0015980889,"about_ca_topic_score_gemma":0.0011828307,"teacher_disagreement_score":0.004688086,"about_ca_system_score_codex":0.0011078761,"about_ca_system_score_gemma":0.001660313,"threshold_uncertainty_score":0.015683174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035488132,0.00038656293,0.9595144,0.0001700584,0.00017260388,0.00016995709,0.000046949324,0.0019301933,0.0021212255],"genre_scores_gemma":[0.65495306,0.0002442448,0.34149334,0.00018098425,0.00016559227,0.00011693125,0.00006465562,0.00017656162,0.0026046229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983778,0.00041802844,0.00009170876,0.0002403259,0.00060294115,0.00026914018],"domain_scores_gemma":[0.9979085,0.00074772345,0.00023536108,0.00043869624,0.00041804553,0.00025174936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026259318,0.00067308405,0.00083477685,0.00067848165,0.0010518844,0.001044384,0.0031796002,0.0006947152,0.0017800439],"category_scores_gemma":[0.004238855,0.0003701529,0.0003666974,0.0006748539,0.0010027866,0.0017195728,0.0011971109,0.0009213937,0.0005830514],"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.0022712941,0.0007724638,0.0020139741,0.000290513,0.00018365952,0.0005406916,0.0004537994,0.4526698,0.1002782,0.07890259,0.011136941,0.35048604],"study_design_scores_gemma":[0.00013244814,0.00017324863,0.0001349537,0.0000052008622,0.000024169183,0.00009674462,0.000012496988,0.9799029,0.011143551,0.005215717,0.0031213511,0.00003716093],"about_ca_topic_score_codex":0.0035299321,"about_ca_topic_score_gemma":0.00391088,"teacher_disagreement_score":0.0035299321,"about_ca_system_score_codex":0.0013026759,"about_ca_system_score_gemma":0.0022819312,"threshold_uncertainty_score":0.013887405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057494856,0.0013930558,0.9124469,0.0004737855,0.0003332382,0.0001231537,0.00005923593,0.0008308695,0.026844831],"genre_scores_gemma":[0.8505834,0.0010422105,0.13914673,0.00037890015,0.0004398413,0.00018566825,0.00006426543,0.00011453929,0.008044482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.0002170689,0.00006514402,0.00025052478,0.0005264826,0.00012607235],"domain_scores_gemma":[0.9982754,0.0004011043,0.00017544319,0.00057463074,0.0003954635,0.00017804428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015807209,0.0005489559,0.0006734196,0.00073865097,0.0008543973,0.001524176,0.0018213566,0.00093001605,0.0022744625],"category_scores_gemma":[0.0029477922,0.00030424906,0.00044724252,0.0005946032,0.0019540472,0.0031106758,0.0020932117,0.001870262,0.00038106096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005992604,0.00018263183,0.0010628452,0.00015307576,0.00006660125,0.00044505272,0.0005334051,0.14405237,0.055141516,0.65458184,0.0037763373,0.13940516],"study_design_scores_gemma":[0.00008297944,0.00047071074,0.0005453955,0.00005228848,0.00004815125,0.0005942868,0.00009892007,0.7929698,0.015189776,0.16736944,0.022505147,0.00007319775],"about_ca_topic_score_codex":0.00065594574,"about_ca_topic_score_gemma":0.0005074972,"teacher_disagreement_score":0.0022744625,"about_ca_system_score_codex":0.00084973045,"about_ca_system_score_gemma":0.00076501153,"threshold_uncertainty_score":0.00835973},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50515044,0.0011606974,0.43812326,0.0029683912,0.00023084323,0.00025455857,0.0015189542,0.0006642033,0.049928732],"genre_scores_gemma":[0.9905005,0.00029282135,0.004751734,0.00006989087,0.000038090224,0.00010469014,0.00016009442,0.000023101387,0.0040590167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.00017370003,0.0000123147265,0.00007509883,0.00013472512,0.00008518378],"domain_scores_gemma":[0.99892265,0.0005084949,0.00017145385,0.0000910595,0.0002149078,0.000091373186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007985458,0.00060555723,0.0006313872,0.00062218483,0.00048576828,0.0011377231,0.0010938618,0.000928177,0.0021805407],"category_scores_gemma":[0.003309461,0.0001771423,0.00029022834,0.0007029327,0.0010535964,0.001512257,0.00073293486,0.00092992873,0.00030568475],"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.000035881127,0.000027731836,0.0005475261,0.000022426379,0.000007588855,0.00004859997,0.000035880206,0.942572,0.0008451379,0.05334053,0.000909452,0.0016073086],"study_design_scores_gemma":[0.0000033318258,0.000007371739,0.00009008486,0.0000016347112,0.0000016006397,0.000006449815,0.000004296622,0.993806,0.0000621341,0.005866766,0.00014797767,0.000002366919],"about_ca_topic_score_codex":0.0058172788,"about_ca_topic_score_gemma":0.0014897224,"teacher_disagreement_score":0.0058172788,"about_ca_system_score_codex":0.0016883615,"about_ca_system_score_gemma":0.00066101074,"threshold_uncertainty_score":0.012249947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16074382,0.00010709378,0.83047724,0.00034715264,0.00008546667,0.0001144551,0.00014074997,0.0032772773,0.004706786],"genre_scores_gemma":[0.90356463,0.00007417188,0.094489574,0.00007500677,0.000016137323,0.0000801302,0.000083739804,0.00023663015,0.0013799417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845743,0.00049129577,0.00011683237,0.00023024657,0.00047194827,0.00023224282],"domain_scores_gemma":[0.9962214,0.0023296135,0.00031837635,0.00072266127,0.0003141814,0.00009368526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249156,0.00068506977,0.0008079373,0.000624445,0.001041571,0.0020964015,0.0015736348,0.0011203559,0.002564093],"category_scores_gemma":[0.007987156,0.00091580086,0.0013380698,0.00044677785,0.0023938003,0.0038403796,0.0015392943,0.002014068,0.00022243099],"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.00036164102,0.00014893983,0.002395636,0.00021458504,0.000095457384,0.00030043433,0.00033419198,0.7063442,0.009919527,0.26270404,0.000920934,0.016260345],"study_design_scores_gemma":[0.000056424342,0.000037835656,0.00008642657,0.000009339357,0.00003584511,0.000029731327,0.000028435488,0.94213074,0.0063679875,0.050412297,0.00079047115,0.000014442776],"about_ca_topic_score_codex":0.00656161,"about_ca_topic_score_gemma":0.007956396,"teacher_disagreement_score":0.00656161,"about_ca_system_score_codex":0.0010399796,"about_ca_system_score_gemma":0.0021753346,"threshold_uncertainty_score":0.013176799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084922895,0.015059,0.6237607,0.074202195,0.0037989274,0.0008900128,0.00013955441,0.0025915946,0.19463515],"genre_scores_gemma":[0.8278134,0.0031117767,0.15222478,0.005311707,0.0017804202,0.0005251326,0.00005432018,0.0003630071,0.008815423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98330873,0.0057371585,0.0006941442,0.0016829134,0.006643913,0.0019331184],"domain_scores_gemma":[0.9755011,0.010458334,0.0013814905,0.005215001,0.005835001,0.001609054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018897524,0.0008821339,0.00077538664,0.0012411647,0.0028511686,0.00691756,0.0034457685,0.0063398858,0.0024020132],"category_scores_gemma":[0.040049914,0.000916943,0.00068358734,0.0010099611,0.004524622,0.011893188,0.0032084861,0.009558889,0.00093839987],"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.00032420468,0.00024115028,0.008952898,0.00048224124,0.000059105438,0.004921986,0.0022626272,0.01292034,0.0049449997,0.78796107,0.016733546,0.16019598],"study_design_scores_gemma":[0.00019017501,0.0008240596,0.0033984245,0.001306369,0.00022251773,0.0149966385,0.0027003787,0.14645728,0.017036697,0.42009473,0.39245686,0.0003157883],"about_ca_topic_score_codex":0.002425476,"about_ca_topic_score_gemma":0.0018500938,"teacher_disagreement_score":0.018897524,"about_ca_system_score_codex":0.0017293757,"about_ca_system_score_gemma":0.002343381,"threshold_uncertainty_score":0.09994084},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3112871,0.04969497,0.22379944,0.014563776,0.0041672527,0.0001576312,0.0007578629,0.0019687477,0.39360318],"genre_scores_gemma":[0.8412148,0.020771187,0.043014262,0.0014741948,0.0017213318,0.000047684945,0.00038020997,0.00019830413,0.09117815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992538,0.000107784705,0.000026480917,0.000081925275,0.00041076553,0.000119266966],"domain_scores_gemma":[0.99953294,0.00013915678,0.00006645699,0.00004838936,0.00017674049,0.000036328573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041577607,0.0003002689,0.00019610784,0.0004942599,0.00053430314,0.0019234932,0.0003175636,0.00043641886,0.007873301],"category_scores_gemma":[0.0011729867,0.00008129389,0.00019525964,0.0008941529,0.00037950664,0.002098714,0.00048013197,0.00050852407,0.0014165384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003861067,0.00009488599,0.0059833913,0.0006275742,0.000051548974,0.00047648765,0.00044612476,0.013067729,0.089171566,0.18003339,0.009641949,0.7000193],"study_design_scores_gemma":[0.000047151047,0.00075696217,0.012469639,0.00022831667,0.00017901836,0.004087337,0.0014452139,0.060695086,0.12276825,0.06032109,0.7369229,0.00007901158],"about_ca_topic_score_codex":0.0013299558,"about_ca_topic_score_gemma":0.0016363941,"teacher_disagreement_score":0.007873301,"about_ca_system_score_codex":0.00078491576,"about_ca_system_score_gemma":0.0005195125,"threshold_uncertainty_score":0.026338816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47638804,0.0013857511,0.5005222,0.00046464172,0.00027679454,0.0005529161,0.0010105133,0.0033747102,0.016024463],"genre_scores_gemma":[0.881106,0.0007566453,0.109784655,0.000059998303,0.000020977634,0.0002837428,0.0005491276,0.00023141323,0.0072073126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973756,0.00006257234,0.000008891166,0.00004666766,0.000105054125,0.000039314902],"domain_scores_gemma":[0.9994555,0.00028973504,0.000047040416,0.000045949277,0.00012341733,0.00003830936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947415,0.0005587355,0.00032181095,0.0007244422,0.00022055188,0.0007852745,0.0007225478,0.00069475954,0.0035816021],"category_scores_gemma":[0.0015307429,0.00021796755,0.00046204033,0.00029085134,0.00022383299,0.0005251344,0.00032770736,0.0005148557,0.0005558909],"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.0016115722,0.0008680624,0.011188006,0.00056494004,0.00014503997,0.00071305037,0.00038585335,0.4963311,0.24793924,0.012523258,0.005102747,0.2226271],"study_design_scores_gemma":[0.0000209892,0.00023454938,0.0019048029,0.000024376195,0.000028485943,0.000059306083,0.000053081483,0.9719444,0.02235061,0.00055575545,0.0028039496,0.000019664778],"about_ca_topic_score_codex":0.007148709,"about_ca_topic_score_gemma":0.0046442524,"teacher_disagreement_score":0.007148709,"about_ca_system_score_codex":0.0008503056,"about_ca_system_score_gemma":0.00068804255,"threshold_uncertainty_score":0.014214218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21257532,0.0012973117,0.7383773,0.00665818,0.00047311033,0.0003021704,0.0020326502,0.0010100473,0.037274],"genre_scores_gemma":[0.9387827,0.0010590422,0.025088789,0.0004463367,0.0002895702,0.00030394775,0.00046424885,0.00018055807,0.033384893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737966,0.0011540398,0.00008414483,0.0003867063,0.0004207061,0.0005748369],"domain_scores_gemma":[0.9933269,0.004573752,0.00047082576,0.00029563063,0.0007839814,0.0005488371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027757634,0.001976836,0.0030206651,0.001826041,0.001687455,0.0040885434,0.006646507,0.006037175,0.010132267],"category_scores_gemma":[0.011159862,0.0018277655,0.0017197374,0.002694473,0.0030862938,0.005140033,0.0021509368,0.003556689,0.001700874],"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.00013631315,0.00014075424,0.00081708445,0.00007483148,0.00005387576,0.00031913558,0.00026777026,0.8323238,0.0007027146,0.15961911,0.0019880258,0.0035566383],"study_design_scores_gemma":[0.000028825127,0.000018125005,0.00010594937,0.0000059263743,0.000012284396,0.000035240475,0.00002128044,0.9855285,0.000036240697,0.013922933,0.00027357726,0.000011162638],"about_ca_topic_score_codex":0.027978178,"about_ca_topic_score_gemma":0.012650254,"teacher_disagreement_score":0.027978178,"about_ca_system_score_codex":0.0041473424,"about_ca_system_score_gemma":0.0020096246,"threshold_uncertainty_score":0.055630684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97492796,0.0005497675,0.018222446,0.00022103534,0.0001553851,0.00012051192,0.0006186578,0.0007188238,0.004465418],"genre_scores_gemma":[0.9833129,0.0001917857,0.014607091,0.000079434634,0.00002254835,0.000077101795,0.0004833084,0.00005417525,0.0011716353],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831784,0.0003914697,0.00018405526,0.00036427742,0.00046479751,0.00027752554],"domain_scores_gemma":[0.99248743,0.004082859,0.0008577744,0.0010150952,0.0013040309,0.0002527873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016206423,0.00078800827,0.00046320987,0.0006949609,0.00038935416,0.00071494724,0.0016978267,0.00074121694,0.0035187087],"category_scores_gemma":[0.0067227567,0.000286025,0.00017024552,0.0008188799,0.00064354454,0.0013599965,0.0005633826,0.0007945922,0.0003936028],"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.0034640913,0.0033915513,0.009688553,0.00089873973,0.00016739218,0.0005944367,0.0005011467,0.09155627,0.8048742,0.005996423,0.0034142842,0.07545292],"study_design_scores_gemma":[0.0003108259,0.006403474,0.00462497,0.00006257828,0.00010569442,0.00037352394,0.00034790108,0.1709658,0.8102745,0.0023585255,0.004097131,0.00007515627],"about_ca_topic_score_codex":0.0006919605,"about_ca_topic_score_gemma":0.0005562704,"teacher_disagreement_score":0.0035187087,"about_ca_system_score_codex":0.0006454339,"about_ca_system_score_gemma":0.0002876398,"threshold_uncertainty_score":0.011771202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4340941,0.0008441092,0.53999484,0.0024448228,0.0002407446,0.00015613303,0.00027731876,0.00066099764,0.021286977],"genre_scores_gemma":[0.97963804,0.00021682685,0.018197197,0.00005978175,0.00007475007,0.00002919429,0.00003297082,0.00007723425,0.0016741082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852824,0.00047275182,0.00004131423,0.00013063115,0.00027291896,0.0005541316],"domain_scores_gemma":[0.99593157,0.0027948294,0.00034278558,0.00018771614,0.00036595823,0.0003772593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220587,0.0011649732,0.0019035483,0.00091978855,0.0010804156,0.0030406397,0.0019784763,0.0013915423,0.0032105166],"category_scores_gemma":[0.009922992,0.0010718048,0.0003849506,0.0016792663,0.002018277,0.0029795675,0.0021704496,0.0017361168,0.00036461162],"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.0007551814,0.00020900431,0.0006620231,0.00013779447,0.00004125528,0.0003690504,0.00012888016,0.7354354,0.0054894113,0.22511306,0.0037639958,0.027894937],"study_design_scores_gemma":[0.00006601623,0.000037554917,0.00011853178,0.000007894281,0.00001190709,0.000052353593,0.000037887487,0.90781957,0.0010488572,0.09035199,0.00043538483,0.000012042944],"about_ca_topic_score_codex":0.0031130528,"about_ca_topic_score_gemma":0.0030641435,"teacher_disagreement_score":0.0032105166,"about_ca_system_score_codex":0.0023715838,"about_ca_system_score_gemma":0.002255788,"threshold_uncertainty_score":0.017207086},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6867444,0.00033148078,0.29877996,0.00036620756,0.000022410093,0.000098852885,0.00008451289,0.00027950562,0.01329263],"genre_scores_gemma":[0.9837606,0.000067115034,0.015645055,0.000012177879,0.0000046327486,0.000016435897,0.00001797232,0.000023265407,0.0004526619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985708,0.0005454515,0.000030524876,0.000112653055,0.00021679993,0.0005238866],"domain_scores_gemma":[0.99793303,0.0011896953,0.00031170787,0.00016342476,0.00020539443,0.0001967196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426616,0.00059987226,0.0008761103,0.0007749264,0.0006559479,0.001581299,0.0011650448,0.0006953643,0.0013947324],"category_scores_gemma":[0.005577214,0.00051148917,0.00040918987,0.0010760486,0.0015853213,0.0020595803,0.0013169064,0.0008291526,0.00021507262],"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.00019055215,0.00008389154,0.0007016607,0.000028391796,0.000018239918,0.00013917024,0.000070426686,0.9431093,0.0026269052,0.042571757,0.00038690228,0.0100728525],"study_design_scores_gemma":[0.00004158675,0.000052423482,0.00021577584,0.000004248633,0.0000070652745,0.00004197107,0.000056005345,0.9784168,0.0016316642,0.01912306,0.00039999897,0.000009438328],"about_ca_topic_score_codex":0.0055890926,"about_ca_topic_score_gemma":0.004644713,"teacher_disagreement_score":0.0055890926,"about_ca_system_score_codex":0.0022416157,"about_ca_system_score_gemma":0.0019887686,"threshold_uncertainty_score":0.016264081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036385026,0.0007517308,0.9559238,0.00052294886,0.00032040768,0.0001855359,0.00012431073,0.0034290906,0.002357092],"genre_scores_gemma":[0.695852,0.00039946148,0.29783747,0.00038212625,0.00021185548,0.00010822616,0.00019859795,0.000119408076,0.0048908195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00018993848,0.000091239745,0.00015201353,0.00028225954,0.00011081634],"domain_scores_gemma":[0.9978619,0.0006240908,0.0003053917,0.0004263876,0.00052525604,0.00025694663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021085467,0.0005352793,0.0007106324,0.0009256697,0.00070962036,0.0015295116,0.0032780217,0.00062424655,0.003173776],"category_scores_gemma":[0.003634127,0.0003557605,0.000391381,0.00065187336,0.00059807056,0.0012464485,0.0017848951,0.0014955265,0.0006007659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012259699,0.0005974595,0.004232025,0.00045030296,0.0001137995,0.0005522365,0.00029879072,0.18340865,0.055709124,0.056433655,0.010130683,0.68684727],"study_design_scores_gemma":[0.00027878227,0.00030671342,0.00046425333,0.000022732667,0.00003736848,0.00024606273,0.000027552634,0.9568002,0.022511253,0.010663366,0.008597857,0.000043922377],"about_ca_topic_score_codex":0.0017791146,"about_ca_topic_score_gemma":0.0019569844,"teacher_disagreement_score":0.0032780217,"about_ca_system_score_codex":0.000782455,"about_ca_system_score_gemma":0.0010804645,"threshold_uncertainty_score":0.011151195},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029048707,0.0009569307,0.011624767,0.0007614651,0.0005516716,0.00086672837,0.9076254,0.004629674,0.04393466],"genre_scores_gemma":[0.050142493,0.00087645656,0.0071156947,0.00028491087,0.00016620813,0.0007185915,0.9328138,0.0002576861,0.00762415],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9975013,0.00022262661,0.00032864008,0.00035146496,0.0014197124,0.00017624286],"domain_scores_gemma":[0.9941842,0.0007141797,0.00053490535,0.001282535,0.0029386175,0.00034563514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124999,0.0010686752,0.00096659776,0.0075461087,0.0007418228,0.0016744742,0.0012993749,0.0011995953,0.015261244],"category_scores_gemma":[0.009196822,0.0003167623,0.0005108453,0.010061151,0.00025928477,0.0017469716,0.00096568686,0.0014847047,0.021555344],"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.0006068969,0.0010868649,0.038303852,0.0011575145,0.00020907684,0.0004065074,0.00022632675,0.015511441,0.0057890797,0.022620011,0.72984916,0.18423332],"study_design_scores_gemma":[0.00012779578,0.0002189722,0.06456906,0.00025976848,0.00010104495,0.0009965145,0.0003037124,0.025845714,0.006538113,0.014341531,0.88653445,0.00016325964],"about_ca_topic_score_codex":0.007045238,"about_ca_topic_score_gemma":0.00445344,"teacher_disagreement_score":0.015261244,"about_ca_system_score_codex":0.0009690541,"about_ca_system_score_gemma":0.00088986,"threshold_uncertainty_score":0.05105388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03104921,0.0006247389,0.95797056,0.000633854,0.00033129263,0.00082019996,0.00035785066,0.0023311127,0.0058811014],"genre_scores_gemma":[0.56027174,0.0009623817,0.42254123,0.0003696527,0.00023069598,0.0013707846,0.0011470714,0.00016937821,0.012936936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.00030873978,0.00013984228,0.00023870441,0.0005418288,0.00011756847],"domain_scores_gemma":[0.9980445,0.0005561354,0.0002216565,0.0005153752,0.00052604504,0.00013633767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677626,0.0005339195,0.0007552419,0.001282918,0.0010117616,0.001382272,0.0013240398,0.0010906954,0.0017336616],"category_scores_gemma":[0.003635567,0.0002698167,0.00048262655,0.0013648643,0.00079646194,0.0021299191,0.0021744033,0.0010562349,0.00046528314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010743352,0.00043950518,0.0012267468,0.0010042577,0.0003809065,0.0010556285,0.0011879639,0.05828712,0.21334882,0.17577758,0.020303123,0.5259141],"study_design_scores_gemma":[0.0007795253,0.0026311502,0.0015587362,0.00012214118,0.00043137278,0.0031857386,0.00041117385,0.5798363,0.15805477,0.06923886,0.18338817,0.0003620933],"about_ca_topic_score_codex":0.0012511815,"about_ca_topic_score_gemma":0.0008347466,"teacher_disagreement_score":0.0017336616,"about_ca_system_score_codex":0.000766054,"about_ca_system_score_gemma":0.0013170299,"threshold_uncertainty_score":0.0082912445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056014884,0.0007615866,0.93744284,0.0005693189,0.00035110212,0.00022448525,0.00013400688,0.0017104106,0.0027913444],"genre_scores_gemma":[0.72974,0.00027199884,0.2646561,0.000156984,0.00025736008,0.00022608798,0.0001948636,0.00011089342,0.004385738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971769,0.0008633879,0.00027677647,0.00045475893,0.00086058385,0.00036759322],"domain_scores_gemma":[0.988951,0.0029523338,0.00070769363,0.004850185,0.0020306124,0.00050821604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065524625,0.0006190546,0.0014273735,0.0017038893,0.0023520265,0.0032538334,0.0049562305,0.0017204906,0.0039098957],"category_scores_gemma":[0.010218373,0.0006520504,0.00048565833,0.0018472465,0.001379046,0.0047808434,0.0034389535,0.0018561975,0.0007071135],"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.0026184667,0.00094313174,0.0035215497,0.00022394785,0.00021246413,0.0002625106,0.0008931095,0.38402843,0.02980729,0.15704788,0.012399152,0.4080421],"study_design_scores_gemma":[0.00028097612,0.00025442365,0.00045278645,0.000022048778,0.000072945266,0.0001159009,0.00012758038,0.9443107,0.007071211,0.042605527,0.004625869,0.000060018247],"about_ca_topic_score_codex":0.0026091074,"about_ca_topic_score_gemma":0.0056556836,"teacher_disagreement_score":0.0065524625,"about_ca_system_score_codex":0.0024412284,"about_ca_system_score_gemma":0.0021052314,"threshold_uncertainty_score":0.034653127},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965691,0.00016354267,0.02748545,0.00014124058,0.000047029193,0.00012581189,0.00026871628,0.0003065209,0.005770727],"genre_scores_gemma":[0.9896632,0.00012296943,0.009406789,0.000021675398,0.000004960737,0.00009690321,0.00018098655,0.000018867435,0.00048369085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988954,0.00068551494,0.000049036673,0.000060479255,0.00019652603,0.000112997885],"domain_scores_gemma":[0.99460393,0.004232768,0.0002571248,0.00027500888,0.0005053151,0.00012583441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017497746,0.0008500038,0.00053981086,0.0009124785,0.0004097018,0.00086265994,0.0006621318,0.000813591,0.0008497086],"category_scores_gemma":[0.0061787576,0.00026368996,0.00036673128,0.0007805601,0.00053459627,0.0008394879,0.0004741164,0.0006319977,0.00010119341],"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.0001394521,0.00014458358,0.0036366337,0.000026716569,0.000031365995,0.00003162307,0.00005455848,0.98862225,0.0013490283,0.0015898114,0.00012615087,0.0042478465],"study_design_scores_gemma":[0.000013433078,0.00009795936,0.00036823066,0.0000045942347,0.000009087177,0.0000059634963,0.000026639405,0.9973507,0.0015707354,0.00036433063,0.00018309441,0.0000052509254],"about_ca_topic_score_codex":0.012095052,"about_ca_topic_score_gemma":0.0065728123,"teacher_disagreement_score":0.012095052,"about_ca_system_score_codex":0.0017775622,"about_ca_system_score_gemma":0.0008311044,"threshold_uncertainty_score":0.024049342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009802744,0.00011700519,0.97573835,0.00032983886,0.000068519825,0.0002638873,0.00032862896,0.009602505,0.0037484926],"genre_scores_gemma":[0.14833184,0.00029839436,0.8441005,0.0002597244,0.00003617939,0.0004446622,0.0011544048,0.00065249414,0.004721899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982772,0.00062642933,0.00029044828,0.00018225258,0.00047625424,0.00014738503],"domain_scores_gemma":[0.9984066,0.00075666327,0.00014929111,0.00033900765,0.00026234658,0.00008620988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002703847,0.00051062356,0.00042984498,0.0009653787,0.0008421029,0.0037525496,0.0013484533,0.0013579652,0.0027981475],"category_scores_gemma":[0.004229952,0.0005888284,0.0006367244,0.0008135964,0.00069420855,0.003155791,0.0008464153,0.0019668804,0.0009307318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059836265,0.00046693193,0.002604843,0.0006665463,0.00009730128,0.0010463358,0.0021041816,0.18816574,0.042670984,0.480682,0.017236887,0.2636599],"study_design_scores_gemma":[0.00006923868,0.00012920005,0.00045974672,0.0002018154,0.00007005525,0.0003722585,0.00014786085,0.8211877,0.038426563,0.04064718,0.09822048,0.00006784771],"about_ca_topic_score_codex":0.004738033,"about_ca_topic_score_gemma":0.0041530854,"teacher_disagreement_score":0.004738033,"about_ca_system_score_codex":0.0018644594,"about_ca_system_score_gemma":0.0021338174,"threshold_uncertainty_score":0.014299452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16021544,0.0012262255,0.73720616,0.01094987,0.0005536147,0.0005062116,0.00041368496,0.0015319942,0.08739678],"genre_scores_gemma":[0.92643607,0.00078443147,0.06214678,0.0020166945,0.00051177415,0.00051307207,0.00023801475,0.00032533382,0.0070278174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98434794,0.0044899955,0.00051865843,0.0030664506,0.004841548,0.002735365],"domain_scores_gemma":[0.9224088,0.052161157,0.0045822156,0.0108343605,0.007254099,0.0027593018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010463466,0.0015774402,0.0026613327,0.00204114,0.004368131,0.0076681054,0.0036489381,0.0039214245,0.0057468098],"category_scores_gemma":[0.05090624,0.00093308394,0.0022236016,0.0016808985,0.0065942337,0.010154022,0.0052231424,0.0075801783,0.0013914945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010728905,0.0002688735,0.0022505708,0.00033422062,0.00023536515,0.00036607985,0.0005115353,0.16742083,0.00966173,0.78591543,0.009377746,0.022584796],"study_design_scores_gemma":[0.00011416774,0.00022968289,0.00030521824,0.000060863098,0.00007353803,0.00042530824,0.00014185604,0.6819076,0.00516404,0.30360273,0.0079168575,0.00005819301],"about_ca_topic_score_codex":0.003391504,"about_ca_topic_score_gemma":0.0018370077,"teacher_disagreement_score":0.010463466,"about_ca_system_score_codex":0.0052377703,"about_ca_system_score_gemma":0.006513921,"threshold_uncertainty_score":0.055336714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67995304,0.0010546739,0.31106713,0.00023369484,0.00019516691,0.000040073744,0.00007281804,0.0015169239,0.0058665155],"genre_scores_gemma":[0.95681417,0.00023603899,0.041337173,0.000064152235,0.00008528579,0.00000815066,0.000039517163,0.00004743086,0.0013680087],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997689,0.00004255047,0.000011538118,0.000043602624,0.000077437006,0.000055905508],"domain_scores_gemma":[0.9990644,0.0004358927,0.00009015211,0.0001055822,0.00024030065,0.0000636884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037053457,0.00036225613,0.00029900938,0.0004334038,0.00040394164,0.0006684497,0.00046952136,0.00038992063,0.0031296469],"category_scores_gemma":[0.0015919458,0.00018256008,0.00013854507,0.0004893545,0.00024022198,0.000901023,0.0003240436,0.00041737323,0.00023687386],"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.0023405715,0.00025368202,0.00399468,0.00014319127,0.0000635571,0.00030075794,0.00011478671,0.019805662,0.6113989,0.0052055106,0.0014562699,0.35492244],"study_design_scores_gemma":[0.00019913126,0.0011520382,0.012220742,0.00003264211,0.00029062954,0.0013713208,0.00012479477,0.53744817,0.43927866,0.0037539592,0.0040700156,0.000057824298],"about_ca_topic_score_codex":0.0018527753,"about_ca_topic_score_gemma":0.0030293497,"teacher_disagreement_score":0.0031296469,"about_ca_system_score_codex":0.0003451206,"about_ca_system_score_gemma":0.00031413624,"threshold_uncertainty_score":0.010469735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023380455,0.00026724397,0.974006,0.0002020388,0.000075037715,0.0000357827,0.00003058025,0.00019905638,0.0018038615],"genre_scores_gemma":[0.8442818,0.00025862898,0.15017428,0.0001452617,0.0001746893,0.00007000729,0.000062895044,0.00009061587,0.004741871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.000121832214,0.000019395893,0.000075820695,0.00016962172,0.00006759],"domain_scores_gemma":[0.9993838,0.00025031084,0.00005434223,0.00008090052,0.00018579858,0.000044765413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884892,0.0005849523,0.00064336485,0.0004910642,0.00074136705,0.00092340977,0.0016695824,0.00057174225,0.002388702],"category_scores_gemma":[0.001562458,0.00018726726,0.00025009518,0.000451768,0.00038191382,0.0014253272,0.0007855724,0.00089635147,0.0002709422],"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.0006010157,0.0002935659,0.00086498325,0.0001352219,0.000071003975,0.000106404244,0.00019559948,0.6548853,0.025422301,0.043327786,0.003990249,0.27010658],"study_design_scores_gemma":[0.00000936103,0.00003320831,0.0001155734,0.000002778213,0.000010313083,0.000021557911,0.000014452469,0.9918268,0.0018127373,0.005573579,0.0005749708,0.0000046815167],"about_ca_topic_score_codex":0.0010686987,"about_ca_topic_score_gemma":0.0029106901,"teacher_disagreement_score":0.002388702,"about_ca_system_score_codex":0.001003045,"about_ca_system_score_gemma":0.0005474738,"threshold_uncertainty_score":0.0079910755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20019034,0.0043590283,0.7659412,0.0021040712,0.0002628734,0.00008572963,0.00018305199,0.0006539369,0.026219763],"genre_scores_gemma":[0.93009275,0.0006701285,0.06687844,0.00021104475,0.00009756549,0.000026577853,0.0000734595,0.000115035036,0.001834981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869126,0.0005748874,0.000040985884,0.00013020395,0.0003243477,0.0002383652],"domain_scores_gemma":[0.9930455,0.0054426612,0.00016759646,0.0007189694,0.00045633275,0.00016892109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025557457,0.0008049936,0.00082804007,0.00044574094,0.00078964623,0.0016245975,0.00129504,0.00082295475,0.003095572],"category_scores_gemma":[0.01210822,0.00040251247,0.00019946307,0.00058239215,0.00079117523,0.002878671,0.001375534,0.0013831853,0.00042372316],"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.0026227091,0.00039215886,0.0020636222,0.00012320916,0.00006656887,0.00012147703,0.00024905475,0.64425474,0.016603796,0.12978068,0.0050759898,0.19864602],"study_design_scores_gemma":[0.00006450576,0.00009538707,0.0005355123,0.000018262674,0.000034011045,0.00007396827,0.00008785793,0.9477322,0.0046388106,0.045429815,0.0012701901,0.00001947592],"about_ca_topic_score_codex":0.0024443006,"about_ca_topic_score_gemma":0.00392683,"teacher_disagreement_score":0.003095572,"about_ca_system_score_codex":0.001136183,"about_ca_system_score_gemma":0.00094696204,"threshold_uncertainty_score":0.013516247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057873093,0.000055448803,0.9914834,0.000074674535,0.000022197708,0.0000848177,0.0003774451,0.0010611039,0.0010536383],"genre_scores_gemma":[0.19963264,0.00032302778,0.79133,0.00009460127,0.000101152225,0.00052571076,0.0020962036,0.00069931214,0.005197461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988751,0.00044073624,0.000049106617,0.00015413515,0.00032906164,0.00015193479],"domain_scores_gemma":[0.9968273,0.0021310004,0.00026200278,0.00024496805,0.00039811298,0.000136635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014670534,0.00156609,0.0011450442,0.004897475,0.0011157496,0.0019291947,0.0013182109,0.00080557034,0.006639697],"category_scores_gemma":[0.0054554497,0.0008079377,0.0015985258,0.0031927377,0.0008035452,0.0021648852,0.0012656997,0.0017108627,0.0014250645],"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.00023976533,0.00028077187,0.004763501,0.00021803293,0.00014571768,0.00022631529,0.00031447102,0.72866327,0.0040406366,0.07999572,0.005180211,0.17593172],"study_design_scores_gemma":[0.000005377285,0.000024984089,0.00017872453,0.000006877856,0.0000062454565,0.00002371893,0.0000343067,0.9799661,0.0003522036,0.018087246,0.0013051592,0.000009037167],"about_ca_topic_score_codex":0.011711286,"about_ca_topic_score_gemma":0.013799939,"teacher_disagreement_score":0.011711286,"about_ca_system_score_codex":0.001570825,"about_ca_system_score_gemma":0.002576233,"threshold_uncertainty_score":0.023286283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2663941,0.00060433306,0.7253461,0.00056497275,0.0000935437,0.00005738878,0.000061875086,0.00046434338,0.0064133033],"genre_scores_gemma":[0.99379444,0.00008148599,0.005197735,0.000027599091,0.000008326723,0.000022166174,0.000009450291,0.000008198724,0.0008505583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968016,0.00012987466,0.0000109573,0.000058859634,0.00006519735,0.00005491467],"domain_scores_gemma":[0.99942327,0.00029468027,0.00011657537,0.000026155183,0.0001061687,0.000033292075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006821,0.00061026245,0.00058014784,0.0002731893,0.00034476904,0.00073609495,0.0005467646,0.000547485,0.00091523223],"category_scores_gemma":[0.001971402,0.00030616162,0.00025275265,0.00018385678,0.00091791415,0.0004912475,0.00072047714,0.00054222374,0.00007904618],"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.000073439405,0.000022193799,0.0002080903,0.000033447366,0.000014298189,0.000054170963,0.00005139718,0.984916,0.0032985057,0.0078022853,0.0002130998,0.0033131167],"study_design_scores_gemma":[0.000007924057,0.000022496386,0.000042694588,0.0000011660741,0.0000026779078,0.0000020308337,0.0000020376917,0.99910706,0.0001484862,0.00061870314,0.000042979533,0.0000016696838],"about_ca_topic_score_codex":0.011142286,"about_ca_topic_score_gemma":0.005337134,"teacher_disagreement_score":0.011142286,"about_ca_system_score_codex":0.0012814879,"about_ca_system_score_gemma":0.0008147524,"threshold_uncertainty_score":0.022154868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02227719,0.00056000124,0.9442829,0.00086710986,0.00012699723,0.00013229382,0.0005005832,0.00041225538,0.030840704],"genre_scores_gemma":[0.8123108,0.00094110233,0.16328971,0.00049284194,0.00018476498,0.00062052015,0.00082383014,0.00017006679,0.021166371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930835,0.00019452794,0.000027865675,0.00010264754,0.00026477198,0.00010177648],"domain_scores_gemma":[0.99950147,0.00019556655,0.00007126321,0.00005347986,0.000130467,0.000047760157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079105,0.00061592954,0.0004073296,0.00057577563,0.0005681915,0.0013895518,0.0022241275,0.0011906554,0.0039061904],"category_scores_gemma":[0.0015295992,0.00029621285,0.00046605195,0.00075032795,0.00050834473,0.0019018259,0.0007238552,0.0012896968,0.00055123674],"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.00007746911,0.000042475483,0.00039050714,0.00007427359,0.000023790306,0.00019380866,0.00007393916,0.74818313,0.0023258117,0.22309178,0.004162554,0.021360502],"study_design_scores_gemma":[0.000016309645,0.000019425379,0.00010788054,0.000010051224,0.000008795391,0.00007142774,0.000012202296,0.96475905,0.00065016566,0.02584106,0.008490874,0.0000127706635],"about_ca_topic_score_codex":0.01167982,"about_ca_topic_score_gemma":0.0055281767,"teacher_disagreement_score":0.01167982,"about_ca_system_score_codex":0.0013352036,"about_ca_system_score_gemma":0.0015977237,"threshold_uncertainty_score":0.023223698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26203442,0.0028139856,0.7224192,0.00054610963,0.00017565911,0.00009684217,0.0000597837,0.0017314923,0.01012255],"genre_scores_gemma":[0.9674562,0.0003884081,0.030039525,0.00006183451,0.000063092644,0.00004123897,0.000035203087,0.000019524508,0.0018948213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998227,0.000057142395,0.00000833832,0.000020933527,0.00006491002,0.000026017087],"domain_scores_gemma":[0.99966335,0.0001928335,0.000036716396,0.00004241204,0.000047601086,0.00001709912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038602698,0.00020476973,0.00022932036,0.0002881528,0.0003666371,0.00048390627,0.00058148225,0.0002592287,0.0011805411],"category_scores_gemma":[0.0010653858,0.00013472477,0.00010687584,0.00033205995,0.00031139742,0.00054453337,0.00032919506,0.00041817912,0.00016178505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013593967,0.0002787236,0.0025754094,0.0002099755,0.00007636553,0.0009031059,0.0006271449,0.30676496,0.12340403,0.082764514,0.0069559603,0.47408038],"study_design_scores_gemma":[0.000035492405,0.00011885299,0.00037204399,0.0000095052155,0.000021163794,0.00016788265,0.000043988402,0.9793417,0.009880048,0.006757134,0.0032342784,0.000017913957],"about_ca_topic_score_codex":0.0022415025,"about_ca_topic_score_gemma":0.003240613,"teacher_disagreement_score":0.0022415025,"about_ca_system_score_codex":0.00032884596,"about_ca_system_score_gemma":0.00035643982,"threshold_uncertainty_score":0.0044568777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08208864,0.0011543864,0.9064285,0.0006534922,0.0005384416,0.00007854364,0.00010729646,0.0020444705,0.0069062044],"genre_scores_gemma":[0.99148047,0.0001128986,0.007301785,0.00004995118,0.00003708985,0.00002805098,0.000024244564,0.000019090436,0.0009464124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00008351447,0.000019805973,0.000096389675,0.00016710373,0.000072772345],"domain_scores_gemma":[0.998629,0.0006767898,0.00013248203,0.00009516467,0.0004186088,0.00004802242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088716444,0.0006147534,0.00095462025,0.00057980674,0.00054637075,0.0011142859,0.0013255406,0.000679339,0.0011416434],"category_scores_gemma":[0.0031486512,0.00039521276,0.0002546279,0.0005436127,0.00058544363,0.00080057245,0.0007545872,0.0013487192,0.00020188346],"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.00034789598,0.00016210892,0.000725414,0.00007732297,0.00004376684,0.000047510675,0.00006190158,0.9288719,0.005095737,0.004608816,0.0021134713,0.057844162],"study_design_scores_gemma":[0.000010388213,0.000020288706,0.00009170481,0.0000015932496,0.000006965595,0.000004064457,0.0000020547789,0.99862623,0.0005306635,0.0005975174,0.000105419014,0.0000030319395],"about_ca_topic_score_codex":0.010487988,"about_ca_topic_score_gemma":0.010933388,"teacher_disagreement_score":0.010487988,"about_ca_system_score_codex":0.0009999917,"about_ca_system_score_gemma":0.0010502962,"threshold_uncertainty_score":0.020853877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03347295,0.00032150207,0.96467286,0.00012184922,0.000017330052,0.000044477958,0.000018417035,0.0005988427,0.00073189754],"genre_scores_gemma":[0.70264477,0.00015237993,0.29618254,0.000070616,0.000035050754,0.000093639275,0.000059894624,0.00006677314,0.00069450994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903,0.000264368,0.000051890012,0.0002001879,0.0003485045,0.00010505829],"domain_scores_gemma":[0.99781764,0.0013981044,0.00022918447,0.00018222479,0.00030616255,0.00006668599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011704576,0.00044720116,0.0007707595,0.0008681733,0.0004893867,0.00079368596,0.0012265636,0.00085860596,0.0008679955],"category_scores_gemma":[0.0076967687,0.0004051209,0.0002762619,0.0005836141,0.00069278426,0.001401413,0.00076494814,0.0006838888,0.00025025356],"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.00046378144,0.00017827465,0.0018272742,0.0000656925,0.000028637438,0.0000594638,0.000111230394,0.70529413,0.03304611,0.011714953,0.0011196095,0.24609089],"study_design_scores_gemma":[0.0000145307395,0.00002165871,0.00014556338,0.0000020220227,0.0000035982775,0.000016922766,0.0000060927005,0.9950873,0.0020829695,0.0024449746,0.00016885695,0.000005533],"about_ca_topic_score_codex":0.0038600364,"about_ca_topic_score_gemma":0.0029169132,"teacher_disagreement_score":0.0038600364,"about_ca_system_score_codex":0.0012659475,"about_ca_system_score_gemma":0.00091154303,"threshold_uncertainty_score":0.009185076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11043267,0.00076866825,0.8521535,0.0010439521,0.00016706802,0.00045358526,0.0009164964,0.0015827476,0.032481372],"genre_scores_gemma":[0.5492143,0.0004824331,0.44223946,0.00026408985,0.000068472225,0.00019919858,0.0009392149,0.00030310033,0.006289762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987741,0.0005728084,0.0000423328,0.0001370466,0.00021158204,0.0002621022],"domain_scores_gemma":[0.9989249,0.0004895049,0.00011150603,0.00015929315,0.00024082663,0.000074066964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018327204,0.0006737518,0.00095154333,0.0011366701,0.0010626196,0.0017799684,0.001522834,0.0011300397,0.006644115],"category_scores_gemma":[0.004082969,0.00054762413,0.0005010343,0.001644253,0.0010600388,0.0013515757,0.0010687464,0.0007265249,0.0008054821],"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.00026684903,0.00012326584,0.0009021423,0.0001636646,0.000043931548,0.00009898787,0.000121486446,0.8478907,0.0029557168,0.0479957,0.011044955,0.0883927],"study_design_scores_gemma":[0.000036234916,0.00006104036,0.00018173977,0.000013400822,0.000007159446,0.000056638717,0.000046648376,0.9789039,0.0014779575,0.016113648,0.0030914994,0.00001020986],"about_ca_topic_score_codex":0.0068093757,"about_ca_topic_score_gemma":0.0062026116,"teacher_disagreement_score":0.0068093757,"about_ca_system_score_codex":0.002107316,"about_ca_system_score_gemma":0.0025971816,"threshold_uncertainty_score":0.02222675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21959874,0.0022713807,0.7595049,0.002298474,0.00033319765,0.00011365713,0.00009891952,0.0013040644,0.014476604],"genre_scores_gemma":[0.96605533,0.0006939364,0.031532865,0.00010702581,0.00031710547,0.00004136606,0.00005887281,0.000052913954,0.0011405698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985139,0.0004381201,0.000069332236,0.00008211356,0.0005775513,0.00031901558],"domain_scores_gemma":[0.9925922,0.0040911012,0.00068079145,0.0009885493,0.0012476238,0.0003997194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031504896,0.0005191928,0.000713843,0.0009219878,0.0010671898,0.0022708846,0.0016984621,0.0010939618,0.0017511034],"category_scores_gemma":[0.01576262,0.00045262295,0.00020902613,0.0008985063,0.0011725381,0.0036186394,0.0016407375,0.0014648743,0.0003366789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014457318,0.000513395,0.0046488116,0.00045898973,0.000074300406,0.00039865248,0.0011480091,0.24437276,0.06588796,0.35545036,0.008048331,0.31755272],"study_design_scores_gemma":[0.00008449001,0.00014787224,0.00049974467,0.000036421,0.000047166715,0.00013247802,0.000098040604,0.863025,0.008849438,0.12096189,0.006089228,0.000028274337],"about_ca_topic_score_codex":0.0014260189,"about_ca_topic_score_gemma":0.0012542886,"teacher_disagreement_score":0.0031504896,"about_ca_system_score_codex":0.0010930898,"about_ca_system_score_gemma":0.0010015349,"threshold_uncertainty_score":0.016661584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095686086,0.00022966244,0.9012525,0.00010165933,0.00007460152,0.00006987449,0.000030982323,0.0004913747,0.0020632686],"genre_scores_gemma":[0.9778791,0.000119093056,0.021172237,0.000021744852,0.000017363527,0.000031994852,0.000016928352,0.000008917722,0.0007326046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.00007303341,0.0000123636255,0.000049292285,0.00008456251,0.000037253503],"domain_scores_gemma":[0.99936455,0.00033439018,0.00006757177,0.0000661569,0.00012578546,0.000041578853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069792796,0.00035364975,0.00026421342,0.00031448712,0.0002970412,0.00049667206,0.0006687916,0.00028538486,0.000556372],"category_scores_gemma":[0.0016983099,0.00014315514,0.00025105942,0.00025813558,0.000499432,0.00047295858,0.00039616975,0.0004616963,0.00006112077],"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.0003794427,0.00018199247,0.0020877384,0.00009607924,0.000048424132,0.00028321275,0.00016768473,0.8295514,0.027257483,0.0533732,0.00075505,0.08581822],"study_design_scores_gemma":[0.00001230205,0.000044188,0.00015217837,0.0000031357167,0.00001020584,0.000026368582,0.0000030600354,0.9940587,0.002089292,0.0031635028,0.00043206892,0.00000503138],"about_ca_topic_score_codex":0.003091249,"about_ca_topic_score_gemma":0.0017250583,"teacher_disagreement_score":0.003091249,"about_ca_system_score_codex":0.00066001236,"about_ca_system_score_gemma":0.000729226,"threshold_uncertainty_score":0.0061464906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035283398,0.00023859806,0.9611337,0.00015738397,0.00006294461,0.00014315195,0.00006489619,0.0008172424,0.0020987752],"genre_scores_gemma":[0.40701577,0.00013205016,0.58918786,0.00009929415,0.000029913646,0.00020438485,0.00022625024,0.000060133523,0.0030443193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996841,0.00007970478,0.000024639781,0.00008312264,0.000089977424,0.000038509355],"domain_scores_gemma":[0.99959224,0.00014601639,0.000058455844,0.00007344904,0.00009967239,0.000030184332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038620806,0.00055264455,0.0005915896,0.0006072642,0.0005435997,0.0006347398,0.0013692029,0.00084151054,0.0017141055],"category_scores_gemma":[0.0010105087,0.0002450557,0.00031124012,0.0006803682,0.00034806944,0.00071145134,0.0006713748,0.00040210402,0.00033831227],"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.00040606625,0.00022866378,0.0010342174,0.00016827454,0.00009405486,0.00015535225,0.00012897124,0.68559444,0.02711233,0.015490702,0.0040323753,0.26555455],"study_design_scores_gemma":[0.00003101993,0.00004555461,0.00008875071,0.0000052996556,0.0000089290115,0.000053147673,0.000008874763,0.9943461,0.0026265997,0.0017632499,0.0010147074,0.000007720174],"about_ca_topic_score_codex":0.0027896452,"about_ca_topic_score_gemma":0.0025121528,"teacher_disagreement_score":0.0027896452,"about_ca_system_score_codex":0.000599118,"about_ca_system_score_gemma":0.0011299293,"threshold_uncertainty_score":0.005734265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11036645,0.0037191971,0.8747266,0.00025745362,0.00032848495,0.00047296638,0.00013224903,0.0035527975,0.006443779],"genre_scores_gemma":[0.88679576,0.001390235,0.10927485,0.00012311421,0.00017032183,0.00019273028,0.00024077664,0.00012668222,0.001685618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986382,0.00039605453,0.00010621032,0.00013411001,0.000600958,0.0001244825],"domain_scores_gemma":[0.99814737,0.0005447921,0.00024455343,0.00023735005,0.00074901746,0.00007692515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017948741,0.0005523065,0.0004097926,0.0010743589,0.00038964843,0.00093296927,0.0014764294,0.00044491823,0.0005414475],"category_scores_gemma":[0.004785226,0.00021132911,0.0003511444,0.00066499365,0.00040617524,0.0010772136,0.0004958466,0.0008613692,0.00015602788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011169361,0.0006800485,0.006265857,0.0008742982,0.00027217093,0.0012444819,0.00052688096,0.23974012,0.23586908,0.027438423,0.007436192,0.47853556],"study_design_scores_gemma":[0.0001361824,0.00089118694,0.0027434437,0.000060785573,0.00018632362,0.0010908154,0.000042544096,0.9217833,0.054225672,0.0036095914,0.015107939,0.00012212481],"about_ca_topic_score_codex":0.0023097808,"about_ca_topic_score_gemma":0.001592716,"teacher_disagreement_score":0.0023097808,"about_ca_system_score_codex":0.0005422578,"about_ca_system_score_gemma":0.00081514695,"threshold_uncertainty_score":0.009492338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07888705,0.00076821435,0.9164861,0.00012038779,0.00010041467,0.00008479343,0.000018395738,0.00044895953,0.0030856875],"genre_scores_gemma":[0.9513539,0.00020165797,0.047211528,0.000045113964,0.00003145614,0.000036591937,0.00001779499,0.000012840899,0.0010890564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993974,0.00010460775,0.000036482088,0.00009937006,0.00027043466,0.00009177983],"domain_scores_gemma":[0.9993013,0.00019440212,0.00011799138,0.00008332387,0.00025971464,0.000043303447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009296608,0.00047083476,0.00036500546,0.0003111176,0.00033905005,0.00083719165,0.0010265249,0.0005035275,0.00067047315],"category_scores_gemma":[0.0014991289,0.00019872008,0.0002419863,0.00015390424,0.0005218845,0.0010821554,0.00047205598,0.00069298997,0.00008137052],"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.0003160567,0.00021468734,0.0015907788,0.00017843994,0.00007302725,0.00021290738,0.00018734437,0.7426194,0.07509049,0.043594584,0.0012402274,0.13468207],"study_design_scores_gemma":[0.000020727666,0.00010022533,0.00019217833,0.0000059085055,0.0000103596485,0.000032972035,0.0000084961175,0.9912875,0.00574875,0.0013916435,0.0011868835,0.000014307375],"about_ca_topic_score_codex":0.0029414366,"about_ca_topic_score_gemma":0.0019635716,"teacher_disagreement_score":0.0029414366,"about_ca_system_score_codex":0.00054267433,"about_ca_system_score_gemma":0.0008761127,"threshold_uncertainty_score":0.005848646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003638737,0.00007701262,0.9945175,0.00006483123,0.00002477155,0.000061435894,0.000019573348,0.00028663888,0.0013095519],"genre_scores_gemma":[0.1773633,0.00018509022,0.8182738,0.00008160027,0.000031669042,0.00031492295,0.00020295543,0.00009469292,0.0034519986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996356,0.0000815457,0.000027210703,0.00006816882,0.00014492727,0.000042641874],"domain_scores_gemma":[0.9996106,0.00014478095,0.000039526367,0.0000247149,0.00016157245,0.000018795527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057714974,0.0006225962,0.00047697872,0.00069321523,0.0006252722,0.0009462631,0.0010061316,0.00092591014,0.0026649805],"category_scores_gemma":[0.0014310832,0.00026505484,0.00040564107,0.0004890304,0.000437526,0.000753672,0.0006907597,0.0008686512,0.0007140161],"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.00013236329,0.00009187793,0.0007757175,0.00015384547,0.000030942145,0.000112313195,0.00015104271,0.6216981,0.015487501,0.044895384,0.0027807725,0.31369013],"study_design_scores_gemma":[0.000011973837,0.000033677927,0.000051718565,0.000009071902,0.0000043862074,0.00003839496,0.000008874581,0.9910908,0.0021911608,0.0041420856,0.0024120177,0.0000058126207],"about_ca_topic_score_codex":0.0020122603,"about_ca_topic_score_gemma":0.0014260821,"teacher_disagreement_score":0.0026649805,"about_ca_system_score_codex":0.0010232482,"about_ca_system_score_gemma":0.0009353827,"threshold_uncertainty_score":0.0089152455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14938152,0.00037270834,0.8435868,0.00046256575,0.000060309696,0.000057795907,0.0002436538,0.00028284665,0.0055518076],"genre_scores_gemma":[0.9343508,0.0006078472,0.060595743,0.00017927447,0.00016926715,0.00012489765,0.00029143694,0.00011731738,0.0035634886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815804,0.00036978628,0.000105888976,0.00022832399,0.0008243187,0.0003135637],"domain_scores_gemma":[0.99128985,0.004531894,0.0015334174,0.0007475364,0.0011646149,0.00073275453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024700735,0.00054887804,0.00070686586,0.0009838172,0.00079452177,0.0020208047,0.0011955075,0.000675099,0.001910325],"category_scores_gemma":[0.0105264345,0.00039195153,0.00057885423,0.001187867,0.0024484163,0.0037379959,0.0011953777,0.0017010682,0.00023536461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020683522,0.00008004113,0.0018841445,0.00011752624,0.000025084448,0.00031261847,0.0003694519,0.09437156,0.014060638,0.8715746,0.0008746541,0.01612289],"study_design_scores_gemma":[0.000035133966,0.00013016869,0.0011962409,0.000022515242,0.000022785447,0.0002661626,0.00008789789,0.6129128,0.0056264875,0.3772051,0.0024428528,0.000051847244],"about_ca_topic_score_codex":0.00180509,"about_ca_topic_score_gemma":0.0012039337,"teacher_disagreement_score":0.0024700735,"about_ca_system_score_codex":0.0018231224,"about_ca_system_score_gemma":0.0013866475,"threshold_uncertainty_score":0.013227761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013126083,0.0010272847,0.97720337,0.00028298242,0.00012015081,0.000051761508,0.00009533672,0.00034730474,0.007745799],"genre_scores_gemma":[0.8434328,0.0047897794,0.13347895,0.0003866581,0.0004327554,0.00031345003,0.00025409076,0.0002636651,0.016647883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.00016413805,0.000039552215,0.0001104776,0.000388665,0.00010647034],"domain_scores_gemma":[0.9990395,0.0004899578,0.00011415513,0.000099856676,0.00022004776,0.000036384743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460835,0.00096047414,0.0005777728,0.0011904825,0.000557487,0.0013016248,0.0020171874,0.0011571473,0.0019925495],"category_scores_gemma":[0.006015912,0.00050518056,0.0006283973,0.0014427381,0.00097388326,0.002398072,0.00066810386,0.0013053649,0.00062009244],"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.0000310481,0.000025495085,0.0003176822,0.000050960003,0.000011769929,0.0001387643,0.00010675835,0.83453953,0.0026550242,0.15173173,0.0009639677,0.009427302],"study_design_scores_gemma":[0.0000029395976,0.000013786352,0.00005159177,0.000008939496,0.0000057367556,0.000046296078,0.000009191401,0.9804976,0.0003042491,0.01784465,0.0012095518,0.0000054735074],"about_ca_topic_score_codex":0.0044071143,"about_ca_topic_score_gemma":0.0018206431,"teacher_disagreement_score":0.0044071143,"about_ca_system_score_codex":0.0020853162,"about_ca_system_score_gemma":0.001098932,"threshold_uncertainty_score":0.015130103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08668147,0.00044435167,0.9076778,0.00035585937,0.00015361393,0.000043347933,0.00002780166,0.00066103536,0.0039546397],"genre_scores_gemma":[0.98639953,0.00013789735,0.012391468,0.000031311567,0.000037756065,0.000036942594,0.000014774677,0.0000090837175,0.000941342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998122,0.00004353956,0.000006759001,0.00004351681,0.000059434216,0.000034557193],"domain_scores_gemma":[0.9993643,0.0003529592,0.000114549584,0.000039360162,0.000097990094,0.000030683033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044447233,0.00063042965,0.0003681833,0.00026038644,0.00026436333,0.0005050409,0.0008339909,0.0005245326,0.0009708909],"category_scores_gemma":[0.0014639511,0.00019287209,0.00020658333,0.00025196056,0.00076417945,0.00062041846,0.00048259573,0.0006578019,0.0001080302],"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.00009742053,0.00006407636,0.00029333736,0.0000442327,0.00001734328,0.00008904813,0.00005250965,0.9564284,0.008809328,0.0066627543,0.00058461295,0.026856925],"study_design_scores_gemma":[0.000008611695,0.000041101146,0.000046945966,0.0000016752267,0.0000037303205,0.0000059690733,0.0000018765389,0.99770856,0.0011626782,0.00086764985,0.00014801217,0.0000031757065],"about_ca_topic_score_codex":0.005019401,"about_ca_topic_score_gemma":0.0032614358,"teacher_disagreement_score":0.005019401,"about_ca_system_score_codex":0.00044729005,"about_ca_system_score_gemma":0.00047172038,"threshold_uncertainty_score":0.009980381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40762156,0.0004734961,0.5870395,0.00030640472,0.00010581441,0.00010957281,0.00004283043,0.00024711897,0.0040536746],"genre_scores_gemma":[0.9933468,0.000054191198,0.0060347104,0.000012570011,0.000011809401,0.000016660693,0.000010633718,0.000008692225,0.00050385966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984479,0.000559556,0.0000650275,0.00023912989,0.0003578813,0.00033052743],"domain_scores_gemma":[0.9949477,0.003453712,0.00043127555,0.00016704046,0.0007692539,0.00023105617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042569893,0.0011993805,0.0010811914,0.00063452235,0.0006078861,0.0016765264,0.000999663,0.00093643577,0.0012173135],"category_scores_gemma":[0.009366525,0.00036284697,0.00032872777,0.00049991446,0.0012815875,0.0011350206,0.0010748182,0.0010020378,0.00006644497],"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.00032509942,0.00009110819,0.0003210662,0.00003134931,0.000017223394,0.00003174106,0.000035170688,0.98603106,0.0024026725,0.003366891,0.000104834086,0.0072418004],"study_design_scores_gemma":[0.0000082230645,0.000072678304,0.00007233527,0.0000015445258,0.0000056477606,0.0000024707595,0.000005058952,0.9986534,0.0006868321,0.0004718829,0.000016965232,0.000002967027],"about_ca_topic_score_codex":0.01231486,"about_ca_topic_score_gemma":0.0056047533,"teacher_disagreement_score":0.01231486,"about_ca_system_score_codex":0.0016412367,"about_ca_system_score_gemma":0.0020578238,"threshold_uncertainty_score":0.024486363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64492273,0.0012049045,0.3358668,0.0030351165,0.00013675478,0.00020684063,0.00029320898,0.00049619196,0.013837433],"genre_scores_gemma":[0.97067696,0.0005002867,0.027066378,0.00026836823,0.00013254766,0.00007185287,0.0001211541,0.00011047841,0.0010521109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351805,0.003549604,0.00021029082,0.0004970001,0.0013145334,0.0009104343],"domain_scores_gemma":[0.9527727,0.035934854,0.0051886905,0.0030212444,0.0017475844,0.001335028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053210054,0.0012018965,0.0014522639,0.000722835,0.0015510257,0.002388253,0.0022985514,0.0023064315,0.0019445274],"category_scores_gemma":[0.025505235,0.00052703393,0.00061728567,0.00087958906,0.0017950356,0.007576301,0.0025486678,0.0020067615,0.00044508197],"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.002453573,0.0007173181,0.008115201,0.00036144277,0.00020042855,0.00085842685,0.00040219713,0.8032898,0.021905247,0.07109416,0.0043339375,0.08626835],"study_design_scores_gemma":[0.00016027583,0.0003987886,0.0012896566,0.0000374271,0.00007483197,0.00068391627,0.00024241304,0.8957805,0.011195221,0.08830769,0.0017886892,0.00004052149],"about_ca_topic_score_codex":0.00077435316,"about_ca_topic_score_gemma":0.00041980617,"teacher_disagreement_score":0.0053210054,"about_ca_system_score_codex":0.0017177386,"about_ca_system_score_gemma":0.0008923171,"threshold_uncertainty_score":0.028140545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109387144,0.00033650803,0.88728154,0.00025809975,0.00002259989,0.000051134095,0.000017507633,0.00010801164,0.002537376],"genre_scores_gemma":[0.9235884,0.00017479918,0.07506969,0.000023668592,0.000010847894,0.000040996725,0.000017532431,0.000020330997,0.0010536353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997036,0.00014892669,0.000007706562,0.000036772224,0.00005565583,0.000047306752],"domain_scores_gemma":[0.99964476,0.0002447174,0.000040385516,0.000017491675,0.00003222035,0.000020501331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910866,0.00040049286,0.00044541265,0.00041610657,0.0003714796,0.00064035115,0.00058583944,0.00049901154,0.00081920583],"category_scores_gemma":[0.001821575,0.00020659437,0.00019862838,0.00034660008,0.00061998726,0.000785307,0.0006584941,0.00042562583,0.00006110492],"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.00004436999,0.000028137327,0.00024557346,0.000023861536,0.0000072701782,0.000035871824,0.000042808333,0.9708986,0.0019051337,0.011739776,0.0002781232,0.014750529],"study_design_scores_gemma":[0.0000038314383,0.000009702126,0.000032383534,8.653466e-7,0.0000010838942,0.0000050189064,0.0000073926335,0.997393,0.00018829214,0.002274318,0.00008292241,0.0000011529028],"about_ca_topic_score_codex":0.0038756118,"about_ca_topic_score_gemma":0.0026418602,"teacher_disagreement_score":0.0038756118,"about_ca_system_score_codex":0.00089004054,"about_ca_system_score_gemma":0.0007269138,"threshold_uncertainty_score":0.0077061057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012097802,0.00074521836,0.9540862,0.00079944654,0.00042748483,0.00029413318,0.000059529546,0.00092477066,0.030565534],"genre_scores_gemma":[0.373777,0.001122836,0.5831348,0.0003408153,0.00024512399,0.00060805766,0.00013841188,0.00012896486,0.04050398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951005,0.000121379206,0.000027099662,0.000072519135,0.00021786023,0.00005125114],"domain_scores_gemma":[0.999785,0.000050080067,0.000021370288,0.000034545246,0.00007869051,0.000030395151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032736076,0.00039157618,0.00035146592,0.0004406617,0.00094804214,0.0016415828,0.0013687628,0.0012197248,0.002847267],"category_scores_gemma":[0.0005872037,0.00023022688,0.000418216,0.00027553827,0.00049942604,0.00097419886,0.0010722798,0.0010805911,0.0011666046],"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.00019301666,0.00027098396,0.001024923,0.0003622329,0.0001255447,0.0019522598,0.0009856208,0.07644172,0.056031276,0.5618639,0.016991476,0.28375703],"study_design_scores_gemma":[0.00007894708,0.0002387654,0.00029946293,0.000057168276,0.0000735733,0.0009068561,0.0003015192,0.6797829,0.02407555,0.071930595,0.22218989,0.00006475469],"about_ca_topic_score_codex":0.0015092863,"about_ca_topic_score_gemma":0.0016720536,"teacher_disagreement_score":0.002847267,"about_ca_system_score_codex":0.0004998406,"about_ca_system_score_gemma":0.0006432407,"threshold_uncertainty_score":0.009525001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34053475,0.0012880706,0.6505336,0.0006122803,0.00026411537,0.00014484464,0.00012549087,0.001081193,0.0054156277],"genre_scores_gemma":[0.9570216,0.0002719095,0.041916147,0.00008683872,0.000034740307,0.00005747922,0.00003463062,0.00004727796,0.0005293699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995276,0.00015123708,0.000030176709,0.00006759917,0.00012207705,0.00010134567],"domain_scores_gemma":[0.9968329,0.0017262608,0.00050702534,0.00036740245,0.00028589342,0.00028044262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021778408,0.0004371587,0.00056800526,0.00069363054,0.0006936679,0.0010538563,0.00074307946,0.00041569682,0.0013318489],"category_scores_gemma":[0.010219149,0.0003123876,0.00029340835,0.0006022758,0.0013466317,0.0014184592,0.00095399923,0.000753639,0.00016655984],"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.0003166853,0.000075585864,0.0017147255,0.00011347367,0.000045559667,0.0001209484,0.000116731215,0.9186857,0.012014482,0.046830513,0.0010364809,0.01892906],"study_design_scores_gemma":[0.000023666813,0.000034036264,0.00020889785,0.000009308005,0.000008265947,0.00002132067,0.000020258982,0.98716193,0.001967131,0.0101103345,0.00042456144,0.000010190548],"about_ca_topic_score_codex":0.0037009479,"about_ca_topic_score_gemma":0.0026708662,"teacher_disagreement_score":0.0037009479,"about_ca_system_score_codex":0.0014770967,"about_ca_system_score_gemma":0.001373108,"threshold_uncertainty_score":0.011517644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26837337,0.00068789365,0.5668519,0.0012692993,0.00078691886,0.0012133402,0.019094978,0.023265693,0.11845656],"genre_scores_gemma":[0.8037082,0.0005214882,0.15063351,0.0005297524,0.00007963561,0.00086475833,0.010773974,0.001071439,0.03181725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.000049350503,0.000017304848,0.00003276857,0.00010092535,0.00005371818],"domain_scores_gemma":[0.9992454,0.0002914173,0.000041400242,0.00013174876,0.00023625205,0.000053819193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003732969,0.00052121433,0.00045135818,0.00039655762,0.00038984945,0.0007854982,0.0015555945,0.0009599161,0.009418336],"category_scores_gemma":[0.0019430546,0.00027187142,0.00039384092,0.00035308718,0.00030877843,0.0008182864,0.0007257111,0.0009373816,0.0016924307],"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.00024051311,0.00016102569,0.0030572857,0.00020630882,0.00006107219,0.00022047583,0.00012784792,0.9058379,0.008711352,0.03187559,0.02364012,0.02586052],"study_design_scores_gemma":[0.0000821873,0.00004800334,0.00026440996,0.000011006024,0.000011599406,0.00006237341,0.000019973782,0.97120476,0.0037240232,0.003404731,0.021151755,0.000015331147],"about_ca_topic_score_codex":0.0077435104,"about_ca_topic_score_gemma":0.004551266,"teacher_disagreement_score":0.009418336,"about_ca_system_score_codex":0.0007011984,"about_ca_system_score_gemma":0.001278733,"threshold_uncertainty_score":0.031507492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32796803,0.00067834964,0.66344297,0.000820654,0.0002308762,0.00013885996,0.00010077317,0.0019519214,0.004667699],"genre_scores_gemma":[0.9798114,0.00007566904,0.019324942,0.00003651471,0.00004688304,0.000028225397,0.000034203415,0.000019676523,0.0006225841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00035808518,0.00004938673,0.00011769063,0.00030054242,0.00012551244],"domain_scores_gemma":[0.99817014,0.00079634495,0.00014192093,0.0002668909,0.00048944255,0.00013530209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017643613,0.0004229935,0.00047866258,0.0005962873,0.00066564843,0.0013215271,0.00069464435,0.00037118176,0.00074254425],"category_scores_gemma":[0.005471404,0.00021386064,0.00016955895,0.00037064462,0.0006254736,0.00095174275,0.0006369468,0.0011287186,0.00015264675],"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.002404508,0.0006552228,0.016228894,0.00009561704,0.00013916085,0.00024421205,0.0007778226,0.43746087,0.05854265,0.0870294,0.0057348316,0.3906868],"study_design_scores_gemma":[0.000011961182,0.000039922546,0.0009160293,0.000003914572,0.000013409424,0.000019149,0.000020096364,0.9891515,0.0047288816,0.0047225966,0.0003608926,0.000011773552],"about_ca_topic_score_codex":0.0054553123,"about_ca_topic_score_gemma":0.006417397,"teacher_disagreement_score":0.0054553123,"about_ca_system_score_codex":0.0015318852,"about_ca_system_score_gemma":0.0015063451,"threshold_uncertainty_score":0.011114657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9041664,0.00014006151,0.09177082,0.00012595268,0.0000154051,0.000044821238,0.000027659107,0.00024220892,0.00346664],"genre_scores_gemma":[0.99774206,0.000014029326,0.0020990286,0.000005768902,0.0000010216665,0.0000060239913,0.0000056277795,0.0000046600167,0.00012177359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994665,0.00016411838,0.000013666446,0.00008229559,0.00012866194,0.00014470515],"domain_scores_gemma":[0.9986998,0.0005780967,0.0001648818,0.00011981309,0.00032427497,0.00011303988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011993827,0.00032854071,0.0004258385,0.00038379544,0.00042047037,0.000596941,0.00061040523,0.00033508198,0.0007363675],"category_scores_gemma":[0.0036288367,0.00020177591,0.00019375111,0.00027081126,0.0010541144,0.000572909,0.00040046618,0.00036820615,0.00004484418],"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.00013107689,0.0000398789,0.000914577,0.00001528262,0.000014796103,0.000020060921,0.000023875908,0.99049395,0.0029969155,0.0027701175,0.000116381576,0.002463111],"study_design_scores_gemma":[0.000009123606,0.000046530233,0.00021541148,0.0000011080366,0.000005490526,0.0000034402635,0.00000762753,0.9985337,0.0008767704,0.00026610983,0.000031715368,0.0000028980812],"about_ca_topic_score_codex":0.009145804,"about_ca_topic_score_gemma":0.0026629434,"teacher_disagreement_score":0.009145804,"about_ca_system_score_codex":0.0013914342,"about_ca_system_score_gemma":0.0011830415,"threshold_uncertainty_score":0.018185139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11626222,0.0008265321,0.8787425,0.0002570589,0.00019429116,0.00022774743,0.00008595659,0.0024732454,0.0009304123],"genre_scores_gemma":[0.756778,0.0004020821,0.24094948,0.00019863286,0.000166264,0.000119013705,0.00024314315,0.000092462746,0.0010509224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.00009960629,0.00005137836,0.00015473002,0.0004641606,0.00010165284],"domain_scores_gemma":[0.99773514,0.0004759024,0.000330565,0.00034815838,0.0009394388,0.00017081699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011824465,0.0005706847,0.00084121997,0.0010959802,0.00066451635,0.00093268044,0.0013304233,0.0006191886,0.00042687205],"category_scores_gemma":[0.0021782035,0.00024340847,0.00033044998,0.0006328971,0.0004599289,0.0011216577,0.0003659403,0.00096812355,0.00022402727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001356823,0.0007394779,0.021209342,0.00027381055,0.000117952324,0.0004331709,0.00028440965,0.13872083,0.30308005,0.008387766,0.004989732,0.5204066],"study_design_scores_gemma":[0.00003526995,0.00040141863,0.0026123363,0.000010657914,0.000035453002,0.00030824626,0.00002733481,0.93855834,0.05374231,0.000934076,0.0032915524,0.000043043165],"about_ca_topic_score_codex":0.0025889643,"about_ca_topic_score_gemma":0.0028247489,"teacher_disagreement_score":0.0025889643,"about_ca_system_score_codex":0.0014838334,"about_ca_system_score_gemma":0.0016868118,"threshold_uncertainty_score":0.01076597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3077413,0.00044286335,0.68709713,0.00049494865,0.000074123476,0.000057911806,0.0000393499,0.00034935016,0.0037030422],"genre_scores_gemma":[0.99451506,0.00007185033,0.004878594,0.000022326565,0.0000079075735,0.00002226484,0.0000064815517,0.000005535955,0.00046997855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955004,0.00018504886,0.000016922604,0.00008654079,0.000077515055,0.00008388462],"domain_scores_gemma":[0.998998,0.00048614864,0.00024654935,0.000049744784,0.0001561619,0.000063458814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095054606,0.00057256484,0.000687743,0.00030737158,0.00037817578,0.000807945,0.0007764165,0.00071711553,0.0004736037],"category_scores_gemma":[0.0022576582,0.00030515977,0.00032756088,0.00023434934,0.0010733989,0.00054713886,0.0006661888,0.000525973,0.00005123566],"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.000050852188,0.000021748807,0.0002970002,0.00002338122,0.000015326103,0.000059065056,0.000033307882,0.9884692,0.0026084473,0.0055518355,0.00014574963,0.0027241432],"study_design_scores_gemma":[0.000010021541,0.00002316876,0.00005181666,0.0000011275706,0.0000041707967,0.00000353532,0.0000020899145,0.99896395,0.00017284183,0.0007263531,0.00003831467,0.0000025364968],"about_ca_topic_score_codex":0.0103408415,"about_ca_topic_score_gemma":0.0046217022,"teacher_disagreement_score":0.0103408415,"about_ca_system_score_codex":0.0011890637,"about_ca_system_score_gemma":0.00090580113,"threshold_uncertainty_score":0.020561278},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9129316,0.0009547437,0.07957993,0.0005961748,0.00019662776,0.00005464886,0.00011548131,0.0004393918,0.0051314165],"genre_scores_gemma":[0.99835855,0.000112697664,0.0009970487,0.000022309976,0.000031495525,0.000007821701,0.000021098622,0.000015209237,0.00043367516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923503,0.00020930135,0.000026554619,0.00008593438,0.00024324689,0.00019994237],"domain_scores_gemma":[0.9943283,0.0037791494,0.00072793406,0.00020563325,0.0006693603,0.00028960576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317554,0.0003861871,0.0004466697,0.0009530108,0.00084922946,0.0012498391,0.0008479378,0.0007166055,0.00096904166],"category_scores_gemma":[0.011751487,0.0005969495,0.000200728,0.0010185456,0.0011105277,0.0010285543,0.0006451175,0.0011292568,0.000107857675],"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.0014636117,0.00028681304,0.01813083,0.0001112104,0.00008027789,0.0010287812,0.0005685483,0.86291695,0.036639303,0.03318782,0.0027640697,0.042821903],"study_design_scores_gemma":[0.000018108176,0.000057689653,0.004929162,0.000009328101,0.000034488956,0.00017576247,0.000074267096,0.9872593,0.0030029279,0.004037555,0.00037719,0.000024214369],"about_ca_topic_score_codex":0.007882421,"about_ca_topic_score_gemma":0.006130682,"teacher_disagreement_score":0.007882421,"about_ca_system_score_codex":0.0021905943,"about_ca_system_score_gemma":0.0005647886,"threshold_uncertainty_score":0.015893936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010999535,0.014544651,0.9323993,0.0044654734,0.0007112614,0.000062790474,0.000091464826,0.00044510703,0.036280382],"genre_scores_gemma":[0.5950028,0.042121675,0.3256877,0.0015481709,0.0020113762,0.00021352475,0.00020519027,0.00019581354,0.0330137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993781,0.0002472043,0.000037566486,0.00008838744,0.00019618102,0.00005254016],"domain_scores_gemma":[0.9987845,0.000869016,0.000073898234,0.00006375222,0.00018758737,0.000021165031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010434292,0.0008984246,0.00047859456,0.0011602825,0.000490021,0.0013940226,0.0007454363,0.0018710954,0.0027193788],"category_scores_gemma":[0.004170896,0.00040949293,0.00052265706,0.0017979136,0.00082801096,0.0015992443,0.00065974315,0.001361383,0.0006121717],"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.000044550292,0.0000571905,0.0011585673,0.00022933891,0.000098242024,0.00023910703,0.00009999946,0.66299784,0.0024071273,0.11646559,0.0046929675,0.21150944],"study_design_scores_gemma":[0.0000037895456,0.00003946651,0.00038948338,0.000062365376,0.000017802682,0.000099083205,0.000029049177,0.8993437,0.002325748,0.0888267,0.008843947,0.000018887236],"about_ca_topic_score_codex":0.0047772713,"about_ca_topic_score_gemma":0.005500996,"teacher_disagreement_score":0.0047772713,"about_ca_system_score_codex":0.001311964,"about_ca_system_score_gemma":0.0004537747,"threshold_uncertainty_score":0.009518981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037971132,0.00018022177,0.9942226,0.00006937489,0.000051163395,0.0000517981,0.000009416641,0.00048378346,0.0011345139],"genre_scores_gemma":[0.43486932,0.0003983107,0.56015605,0.00015487951,0.00010008092,0.00041176414,0.00008924331,0.00010239507,0.0037179503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994041,0.00012688783,0.00004121122,0.00011110986,0.0002482524,0.00006841364],"domain_scores_gemma":[0.99928504,0.00026699412,0.000078871766,0.0000509591,0.00028455793,0.000033611926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011840656,0.0006960714,0.00076150073,0.0005726148,0.0006627015,0.0010071967,0.0018193672,0.0007476299,0.0022163023],"category_scores_gemma":[0.002583562,0.0002704562,0.000214789,0.000460402,0.0005186492,0.00084931887,0.00080999243,0.0011855576,0.00054279796],"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.00035808983,0.00016606107,0.0004282222,0.0001260285,0.000035228408,0.000112222464,0.00023416802,0.48599082,0.013830959,0.040003818,0.004068425,0.454646],"study_design_scores_gemma":[0.00003983219,0.000047862624,0.00003832221,0.0000058467476,0.0000051743914,0.000029575911,0.000006704256,0.99464756,0.0014041264,0.0025353157,0.0012311063,0.000008561791],"about_ca_topic_score_codex":0.0024637382,"about_ca_topic_score_gemma":0.0017230667,"teacher_disagreement_score":0.0024637382,"about_ca_system_score_codex":0.00081644044,"about_ca_system_score_gemma":0.0008839163,"threshold_uncertainty_score":0.0074142814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71896434,0.00093339354,0.25896168,0.0012693547,0.00008659768,0.00032021943,0.00006425569,0.0012175362,0.01818258],"genre_scores_gemma":[0.84866095,0.0015255957,0.14557105,0.0001627533,0.00007696857,0.0000857846,0.00011981214,0.00010833233,0.0036887054],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978522,0.001268243,0.00007987248,0.00015524402,0.00048449176,0.00015998576],"domain_scores_gemma":[0.99536407,0.0029999395,0.00011960575,0.00048572588,0.00070246885,0.00032824135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048759407,0.00036464375,0.000387485,0.0003080595,0.0007462363,0.0014656703,0.0013936715,0.0007664838,0.0013354479],"category_scores_gemma":[0.00768484,0.00022134862,0.0002146289,0.0005161719,0.001100059,0.0017821463,0.00077010057,0.00096630724,0.0002686859],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012825567,0.004698915,0.013303769,0.0007477923,0.00014388109,0.0010750601,0.008678349,0.1465487,0.12842484,0.020733021,0.0071183187,0.66724485],"study_design_scores_gemma":[0.00044722346,0.0059386385,0.01619268,0.00022584845,0.00016338461,0.0013127784,0.004300637,0.7005821,0.1518596,0.014299408,0.10447538,0.00020229851],"about_ca_topic_score_codex":0.0037902438,"about_ca_topic_score_gemma":0.0024411576,"teacher_disagreement_score":0.0048759407,"about_ca_system_score_codex":0.0009191516,"about_ca_system_score_gemma":0.0005814401,"threshold_uncertainty_score":0.025786757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4576577,0.00009192829,0.54137504,0.00008787811,0.000011319407,0.000018075447,0.00005974397,0.00031086427,0.00038742993],"genre_scores_gemma":[0.95498496,0.00008033001,0.044426743,0.0000298685,0.000018490955,0.000022588865,0.00019971967,0.000029485576,0.00020792012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.00026129556,0.000037451406,0.00009890779,0.00020328537,0.0000564008],"domain_scores_gemma":[0.99148285,0.005953763,0.0009849089,0.0006914407,0.00074959645,0.00013743335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017946203,0.0005210926,0.00048419973,0.0010114276,0.00027383628,0.00060589786,0.000785682,0.0008265848,0.00025705644],"category_scores_gemma":[0.01479287,0.00045682318,0.00026797366,0.0007371405,0.000647994,0.0013504699,0.00085629744,0.0010591081,0.00013051007],"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.00042200973,0.00026978872,0.06997823,0.00011655524,0.0001453004,0.00037357642,0.0003542865,0.74201864,0.029680852,0.010658418,0.0008113106,0.14517115],"study_design_scores_gemma":[0.000006587879,0.000033508313,0.0054679774,0.0000052152945,0.000005540793,0.000082077495,0.000030863386,0.9854299,0.0035509283,0.005252112,0.000119231765,0.000016065602],"about_ca_topic_score_codex":0.001251489,"about_ca_topic_score_gemma":0.0009524444,"teacher_disagreement_score":0.0017946203,"about_ca_system_score_codex":0.00041408496,"about_ca_system_score_gemma":0.00033542048,"threshold_uncertainty_score":0.009490967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0798489,0.001056216,0.88833934,0.000790222,0.00016229773,0.0001211947,0.00022376441,0.0007040079,0.028754042],"genre_scores_gemma":[0.90782017,0.00053504534,0.08680952,0.00011850676,0.000041813455,0.00013727281,0.0001608857,0.000077461205,0.0042994334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991335,0.00035878885,0.000029104289,0.00015177566,0.00018879313,0.00013813903],"domain_scores_gemma":[0.9988053,0.00062505587,0.00011899149,0.00020753534,0.00015872803,0.00008448534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170387,0.00073580386,0.00084065547,0.00062791415,0.00057157926,0.0012430731,0.0009976889,0.00061501213,0.0047929576],"category_scores_gemma":[0.003710287,0.0003125872,0.00036510502,0.0005738477,0.0009998026,0.002244231,0.0012022245,0.00096824893,0.00028735446],"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.00033372035,0.00007474036,0.0009484001,0.00015412981,0.000038448175,0.000097292854,0.00008476392,0.6663472,0.005974963,0.24467635,0.0039926893,0.07727722],"study_design_scores_gemma":[0.000027095024,0.000042626332,0.0002289646,0.00002174903,0.000013739644,0.000043843545,0.00002319484,0.9211427,0.0020670043,0.072888516,0.0034832766,0.00001733101],"about_ca_topic_score_codex":0.0018304938,"about_ca_topic_score_gemma":0.0020870056,"teacher_disagreement_score":0.0047929576,"about_ca_system_score_codex":0.0015769409,"about_ca_system_score_gemma":0.0007732681,"threshold_uncertainty_score":0.016034067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07774714,0.00020022574,0.9185014,0.0001392524,0.000018173432,0.000040717176,0.00003058135,0.0003482029,0.0029743793],"genre_scores_gemma":[0.8854439,0.000108740096,0.111936115,0.00003178524,0.000036389447,0.000054308606,0.00007101562,0.000056020366,0.002261723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989919,0.0004051558,0.000025032356,0.00012918633,0.00023626871,0.00021245606],"domain_scores_gemma":[0.99876606,0.0007540407,0.000104751045,0.0001002388,0.0001932712,0.00008163561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014825439,0.000544746,0.0007135281,0.00053449895,0.00052754255,0.0010384268,0.0014097019,0.00080029824,0.0015630577],"category_scores_gemma":[0.003981194,0.00045688325,0.00027329402,0.00068205746,0.0009962076,0.0014734196,0.0008688395,0.000700606,0.00016358227],"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.00014528492,0.000045006225,0.0003518923,0.000030349494,0.0000151659,0.00008761397,0.0000974153,0.9307517,0.0024415732,0.027324265,0.0008126056,0.037897103],"study_design_scores_gemma":[0.000005437097,0.000016767524,0.000050421182,0.0000015982961,0.0000031449772,0.000008806697,0.000008196831,0.99395543,0.00047710945,0.0052384655,0.00023137937,0.0000031979966],"about_ca_topic_score_codex":0.012165115,"about_ca_topic_score_gemma":0.009195775,"teacher_disagreement_score":0.012165115,"about_ca_system_score_codex":0.0017905955,"about_ca_system_score_gemma":0.0010269475,"threshold_uncertainty_score":0.024188638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91949487,0.00069740345,0.076379314,0.00017276686,0.00007671742,0.00014095806,0.00006306644,0.00038437845,0.0025905059],"genre_scores_gemma":[0.9931764,0.00007249578,0.0065176655,0.00001660676,0.0000063959824,0.000018262837,0.000023493707,0.00000653259,0.00016222909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957885,0.0017248354,0.0003605074,0.00034251664,0.0013732335,0.00041037117],"domain_scores_gemma":[0.9784494,0.015872478,0.0016474682,0.0014144322,0.0022993712,0.00031691958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006796672,0.0007692061,0.0006670824,0.0009888267,0.00045574512,0.00088651717,0.0011615411,0.000968961,0.0004998299],"category_scores_gemma":[0.024971804,0.00023293831,0.0003917132,0.00035412106,0.0009538184,0.0012779448,0.0008096645,0.00076309225,0.00008313566],"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.0019210499,0.0006701061,0.0060681556,0.00023767556,0.00019910114,0.00010743959,0.00014238131,0.91224915,0.024073638,0.004586759,0.00026688198,0.04947757],"study_design_scores_gemma":[0.000110538174,0.0010627311,0.0012170674,0.00001285051,0.00004070558,0.000067777415,0.00003883409,0.9801364,0.016488936,0.00061151054,0.00017849308,0.000034291366],"about_ca_topic_score_codex":0.003181455,"about_ca_topic_score_gemma":0.0014676773,"teacher_disagreement_score":0.006796672,"about_ca_system_score_codex":0.0009969154,"about_ca_system_score_gemma":0.00072534854,"threshold_uncertainty_score":0.0359447},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07072102,0.004484734,0.6968087,0.0017573411,0.0009268338,0.0005488955,0.0014384806,0.066525884,0.15678816],"genre_scores_gemma":[0.6782954,0.0045082155,0.2206917,0.00091008586,0.0005620308,0.00043550818,0.004593109,0.0040122066,0.08599176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985952,0.0001691685,0.00009054359,0.00013040937,0.0007329231,0.00028174603],"domain_scores_gemma":[0.9986185,0.00015069988,0.00006801229,0.00056653406,0.00042252438,0.00017381235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036851,0.00075380236,0.0006088246,0.001099992,0.0008934389,0.0030413563,0.001448083,0.0007413314,0.010625543],"category_scores_gemma":[0.003919196,0.0005705758,0.00047508997,0.0013494169,0.000800941,0.002951368,0.002957145,0.0016656211,0.0061783744],"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.0011997966,0.00022194865,0.0026392003,0.0003585571,0.00005553594,0.000718124,0.0010003351,0.0261252,0.040131673,0.44800672,0.09620838,0.3833345],"study_design_scores_gemma":[0.00037476292,0.0003063306,0.0038732556,0.00024901133,0.00009197784,0.0008837239,0.00021532834,0.18506601,0.04113705,0.16284937,0.6047607,0.00019242946],"about_ca_topic_score_codex":0.007368309,"about_ca_topic_score_gemma":0.0022640948,"teacher_disagreement_score":0.010625543,"about_ca_system_score_codex":0.001935471,"about_ca_system_score_gemma":0.001295826,"threshold_uncertainty_score":0.035546005},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037186122,0.75423735,0.09546671,0.014619713,0.011047734,0.00015228921,0.00015141118,0.00042667493,0.12017946],"genre_scores_gemma":[0.022460157,0.81687075,0.06327292,0.0053458433,0.017497718,0.00023096343,0.00033025228,0.0002522178,0.07373919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993368,0.0001948898,0.000038335143,0.00007380116,0.00027802004,0.000078097415],"domain_scores_gemma":[0.9994568,0.0003407744,0.000035004952,0.000031866053,0.00009469635,0.00004084804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319978,0.0011565831,0.0007941066,0.0018685991,0.0009822971,0.0032754831,0.001121037,0.0027894555,0.01258105],"category_scores_gemma":[0.0017600516,0.0004825932,0.0006158433,0.0028953694,0.0011960742,0.00686449,0.0013743725,0.0032181006,0.004879079],"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.000053996082,0.00017614699,0.0005473622,0.002079734,0.000049677434,0.0007580855,0.00067759753,0.00560396,0.0026001427,0.2368926,0.2482122,0.5023485],"study_design_scores_gemma":[0.00000470152,0.00006354556,0.00034343172,0.0006811751,0.000016932163,0.0013496712,0.00038857202,0.0030969104,0.0002781635,0.05684086,0.9369099,0.00002618771],"about_ca_topic_score_codex":0.0009785808,"about_ca_topic_score_gemma":0.0013412264,"teacher_disagreement_score":0.01258105,"about_ca_system_score_codex":0.0008128099,"about_ca_system_score_gemma":0.00066537724,"threshold_uncertainty_score":0.042087793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051460315,0.0003737715,0.94617975,0.00034243346,0.000043638407,0.000028698983,0.00019115758,0.00044446148,0.00093568297],"genre_scores_gemma":[0.9418548,0.0003130516,0.055860985,0.00006404314,0.000112120324,0.0000717824,0.00036524227,0.00007290884,0.0012849837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986902,0.0005045715,0.00005575547,0.0003004535,0.00033544155,0.000113625676],"domain_scores_gemma":[0.9863484,0.010940491,0.00074380904,0.00096136506,0.0007978734,0.0002080264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028069147,0.00079534174,0.0018159369,0.0011647596,0.00056006585,0.001471687,0.0019817746,0.0015871434,0.001536588],"category_scores_gemma":[0.021320483,0.0015808279,0.0007680872,0.0016790001,0.0011096521,0.0033712923,0.0016337398,0.0018301804,0.00022869716],"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.00006141402,0.000022548917,0.0008935594,0.000026580014,0.000034976743,0.000032782395,0.00001371896,0.98180354,0.00039618782,0.008105519,0.00043481006,0.0081743095],"study_design_scores_gemma":[0.0000017134137,0.0000018340552,0.00009429039,8.521002e-7,0.000002433928,0.0000039639663,0.0000010980852,0.99629945,0.000058879057,0.0035026264,0.00003112862,0.0000018166924],"about_ca_topic_score_codex":0.006430954,"about_ca_topic_score_gemma":0.0062517016,"teacher_disagreement_score":0.006430954,"about_ca_system_score_codex":0.0012117957,"about_ca_system_score_gemma":0.0010019357,"threshold_uncertainty_score":0.014844596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073979035,0.0091586225,0.8707988,0.0034419198,0.00056618714,0.00009142555,0.00018441191,0.0005152818,0.041264243],"genre_scores_gemma":[0.93541324,0.002271639,0.058054026,0.0003155514,0.0007582958,0.0001074471,0.000058715956,0.00013663579,0.002884514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936806,0.0015590496,0.0002784274,0.00079684297,0.0028624462,0.00082264654],"domain_scores_gemma":[0.9840151,0.0104387645,0.0012312587,0.002068166,0.0017283618,0.0005183506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006456472,0.0009047661,0.0009450921,0.0011575845,0.0015039846,0.0036570898,0.0022051926,0.0018548673,0.00202734],"category_scores_gemma":[0.026519446,0.00057493604,0.00040300912,0.001349609,0.004574696,0.0052941297,0.0028108736,0.0033895788,0.00050414057],"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.000192624,0.00005575278,0.00051610736,0.00007890058,0.000012416552,0.000115035524,0.00028096687,0.054432634,0.0033184888,0.9065672,0.0011610478,0.03326879],"study_design_scores_gemma":[0.000058441212,0.00006976178,0.00047411956,0.00006981595,0.000018121691,0.00008393517,0.000048668786,0.20096786,0.0040070526,0.7888283,0.005335527,0.00003826803],"about_ca_topic_score_codex":0.0017480546,"about_ca_topic_score_gemma":0.00063472433,"teacher_disagreement_score":0.006456472,"about_ca_system_score_codex":0.0037428897,"about_ca_system_score_gemma":0.0019127806,"threshold_uncertainty_score":0.034145534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36121523,0.0012125958,0.62450206,0.0005867817,0.00007973596,0.00015889498,0.00013288789,0.00044891538,0.011662839],"genre_scores_gemma":[0.91693705,0.00026262077,0.08166686,0.000053417163,0.000022221255,0.000055057648,0.000058397552,0.000059960388,0.00088441075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848527,0.00059249724,0.000053802414,0.00019294157,0.00023316006,0.00044237482],"domain_scores_gemma":[0.99858475,0.00088225893,0.00016216637,0.000117782256,0.00014313465,0.00011005055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016026442,0.0006868754,0.0011198097,0.0010672931,0.0007242717,0.0015450338,0.0012067436,0.0009464497,0.0019023011],"category_scores_gemma":[0.0045447997,0.0007242013,0.00046380147,0.0010688235,0.0011689228,0.0021333657,0.0011002859,0.000900965,0.00027974384],"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.00025786032,0.00012270255,0.0007820006,0.00007643694,0.000036185607,0.00008847649,0.000101144455,0.9264745,0.004635923,0.025528135,0.0012269688,0.040669736],"study_design_scores_gemma":[0.000033153236,0.000044588058,0.0001765257,0.000007364945,0.000009725047,0.00003602496,0.00005941404,0.9827611,0.0012407029,0.014949615,0.0006709991,0.000010836624],"about_ca_topic_score_codex":0.004306667,"about_ca_topic_score_gemma":0.0039170277,"teacher_disagreement_score":0.004306667,"about_ca_system_score_codex":0.0017530251,"about_ca_system_score_gemma":0.0013115766,"threshold_uncertainty_score":0.012719214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008220814,0.00018952978,0.98995095,0.000079728496,0.00006652188,0.000029950525,0.000010562495,0.00020515954,0.0012466616],"genre_scores_gemma":[0.8761996,0.00023490794,0.1206189,0.00010742641,0.000075283424,0.00012211388,0.000053365464,0.000031090687,0.002557227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996092,0.00006500883,0.00002068006,0.000095085634,0.00016981104,0.000040272007],"domain_scores_gemma":[0.99974424,0.000063927866,0.000041439205,0.000029609731,0.00009716928,0.000023576358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096247,0.000609062,0.00044730352,0.0002861248,0.00028151157,0.00056476647,0.001134008,0.00049093505,0.0009662562],"category_scores_gemma":[0.000746763,0.00015412408,0.00031788863,0.00017112828,0.00045240123,0.0006285075,0.00056726055,0.0006268797,0.00016893151],"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.00019273777,0.00013450377,0.0004883458,0.00019260659,0.00007533078,0.00021191615,0.00019375952,0.6891377,0.04818131,0.06753754,0.0029033192,0.1907509],"study_design_scores_gemma":[0.000022598315,0.00008226374,0.000070795286,0.0000036563454,0.000010428065,0.000021093354,0.000005127401,0.9943592,0.0021161628,0.0020581349,0.0012434729,0.0000069832936],"about_ca_topic_score_codex":0.0019895232,"about_ca_topic_score_gemma":0.0014405135,"teacher_disagreement_score":0.0019895232,"about_ca_system_score_codex":0.00064479234,"about_ca_system_score_gemma":0.0006304249,"threshold_uncertainty_score":0.004678309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12355691,0.00027577492,0.8696956,0.000519127,0.00024658212,0.00020688257,0.00012008241,0.0013570783,0.0040220506],"genre_scores_gemma":[0.9133939,0.000084657135,0.08466152,0.00013118419,0.00009199625,0.000079474186,0.0000922359,0.00005035117,0.0014145927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890745,0.0003129205,0.00008252046,0.00018935656,0.00038357175,0.00012415796],"domain_scores_gemma":[0.997018,0.0006811821,0.00045821458,0.0009941253,0.0005686156,0.00027990362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023953505,0.0005412447,0.00047988282,0.00041141018,0.00087917806,0.0010890939,0.0016804361,0.00059347815,0.0010698059],"category_scores_gemma":[0.0045066727,0.0002037735,0.0003245695,0.0005325822,0.0009213902,0.0015227274,0.0013687179,0.0012211668,0.00036803208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017539425,0.00078884483,0.006243356,0.00025134048,0.00010914103,0.0002156046,0.0005838226,0.31484666,0.15968204,0.18072845,0.006139395,0.32865736],"study_design_scores_gemma":[0.000109982146,0.00050101866,0.00077907473,0.000011929098,0.00002745898,0.00017399338,0.00004796802,0.9358639,0.038298767,0.01800622,0.006129937,0.000049715956],"about_ca_topic_score_codex":0.00091177854,"about_ca_topic_score_gemma":0.0005982059,"teacher_disagreement_score":0.0023953505,"about_ca_system_score_codex":0.0010441492,"about_ca_system_score_gemma":0.0013205343,"threshold_uncertainty_score":0.012667954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072287982,0.00032643942,0.98943174,0.00006826228,0.000026704192,0.000024111614,0.00003587166,0.00010499449,0.0027531118],"genre_scores_gemma":[0.85102266,0.0027796677,0.1382506,0.00016232998,0.00014532318,0.00022070772,0.000234634,0.00018653105,0.006997537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00010351305,0.000025726265,0.00008452228,0.0002837533,0.00005649438],"domain_scores_gemma":[0.9990004,0.0005805996,0.00007987521,0.000069430745,0.00024859837,0.000021173684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978086,0.00092547433,0.0003836654,0.00111564,0.00035861265,0.0006859553,0.0007457091,0.00049884745,0.0018227092],"category_scores_gemma":[0.003307249,0.00021406545,0.00043150215,0.0006169786,0.0006020548,0.0013987275,0.0006125888,0.0010419035,0.0003927106],"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.000031823398,0.000031804557,0.00042885574,0.00008982817,0.000020829435,0.0000921837,0.00007311536,0.87884,0.007992228,0.085655205,0.000795266,0.025948882],"study_design_scores_gemma":[0.0000010468638,0.0000091598695,0.00009736845,0.0000048888423,0.0000030415265,0.00001657999,0.000010952342,0.986691,0.00082375796,0.01170051,0.0006377101,0.0000039401816],"about_ca_topic_score_codex":0.0028573899,"about_ca_topic_score_gemma":0.0013267417,"teacher_disagreement_score":0.0028573899,"about_ca_system_score_codex":0.0013948879,"about_ca_system_score_gemma":0.00070608046,"threshold_uncertainty_score":0.01012063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104987575,0.00044412032,0.9768506,0.0005448094,0.000110831505,0.00008898736,0.00013183866,0.00032168822,0.011008402],"genre_scores_gemma":[0.78516775,0.0013113649,0.1918474,0.00064098946,0.00033139077,0.0005088024,0.0003350692,0.00020843389,0.01964887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992342,0.0002025568,0.00003643726,0.00013403018,0.0002892938,0.00010342165],"domain_scores_gemma":[0.99932516,0.0002767468,0.000071169554,0.000074139614,0.00020731568,0.000045552548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000962566,0.0006261363,0.000544018,0.0007074458,0.00057895,0.0013732217,0.0022772364,0.0014962758,0.0027498938],"category_scores_gemma":[0.0017063243,0.00026623686,0.0005120219,0.0006332986,0.00081165286,0.0020419096,0.00094535016,0.0015675917,0.00065145787],"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.000090720736,0.0001256888,0.00043150704,0.00012678024,0.000022223003,0.00030019856,0.0001651808,0.6255713,0.010648507,0.32838133,0.0037166178,0.03041999],"study_design_scores_gemma":[0.000008323753,0.000013321377,0.000023599141,0.000004153556,0.000004820636,0.000029721334,0.0000052225505,0.9885953,0.00041546376,0.0094617745,0.0014326783,0.0000056466974],"about_ca_topic_score_codex":0.004002973,"about_ca_topic_score_gemma":0.0022488644,"teacher_disagreement_score":0.004002973,"about_ca_system_score_codex":0.001945828,"about_ca_system_score_gemma":0.0012243126,"threshold_uncertainty_score":0.014118016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354804,0.0002724753,0.96102726,0.0005104385,0.000032310505,0.000022605296,0.000014189581,0.00011559037,0.0025247463],"genre_scores_gemma":[0.6855894,0.0006699034,0.31169924,0.00022584145,0.00011813068,0.00007119991,0.000048277816,0.00011477551,0.0014632369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989728,0.00039283012,0.000035880417,0.0001016746,0.0004010413,0.00009581863],"domain_scores_gemma":[0.99899477,0.00042416615,0.00011970205,0.00023125492,0.00017801329,0.000052100804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020191704,0.0007328106,0.0008011257,0.0006833399,0.00053972675,0.0010906444,0.00081318367,0.0008054717,0.0004847137],"category_scores_gemma":[0.005209541,0.0004007404,0.00036951972,0.0006674407,0.0017240847,0.003311519,0.0015498196,0.0017211991,0.00018284089],"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.00013367055,0.00015429409,0.00065154984,0.000074383825,0.000043880515,0.00010490981,0.0001187243,0.6522914,0.012182427,0.22367255,0.0017801949,0.1087919],"study_design_scores_gemma":[0.000013503753,0.00003862569,0.00009818087,0.000012229549,0.000008516352,0.000038284186,0.000025397916,0.84631,0.0033204074,0.14871074,0.0014133145,0.000010748987],"about_ca_topic_score_codex":0.0006940008,"about_ca_topic_score_gemma":0.00057599845,"teacher_disagreement_score":0.0020191704,"about_ca_system_score_codex":0.0007682487,"about_ca_system_score_gemma":0.0010451289,"threshold_uncertainty_score":0.01067853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074778534,0.00022479535,0.91963774,0.00024000903,0.000034548593,0.000052761006,0.000030329029,0.00027777138,0.0047235033],"genre_scores_gemma":[0.9649839,0.00015660273,0.03223803,0.000037460344,0.000021541206,0.000076823766,0.000025355856,0.000060140115,0.0024000595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.00027895646,0.000026723297,0.0001316922,0.00026652176,0.00013189054],"domain_scores_gemma":[0.99688727,0.0017326274,0.00046049544,0.0002416373,0.0006018794,0.00007601433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215306,0.0004408653,0.0006557644,0.0008544885,0.0007229983,0.0009963799,0.0015042874,0.00086057215,0.001415806],"category_scores_gemma":[0.00884983,0.00039482038,0.0006178842,0.0003697935,0.0012947244,0.0013519555,0.0007296389,0.0007984621,0.00030191],"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.00006261313,0.00002385464,0.0005464382,0.000020506057,0.000015267173,0.00008352523,0.00013219549,0.9378359,0.003666282,0.052112438,0.00022622639,0.005274763],"study_design_scores_gemma":[0.0000014410687,0.000003547834,0.000024333998,9.371724e-7,0.0000010933472,0.000005522306,0.0000022643665,0.9982632,0.0002612474,0.0013736561,0.000060777962,0.0000020556447],"about_ca_topic_score_codex":0.006422218,"about_ca_topic_score_gemma":0.0018095829,"teacher_disagreement_score":0.006422218,"about_ca_system_score_codex":0.0019458465,"about_ca_system_score_gemma":0.0011297114,"threshold_uncertainty_score":0.014118195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67000455,0.0013997323,0.31786257,0.00035247506,0.00003576732,0.000029367573,0.0002290281,0.0010299622,0.009056514],"genre_scores_gemma":[0.9909593,0.00020832883,0.007866621,0.000022522892,0.000019530604,0.0000088943225,0.000077708086,0.00003237913,0.0008047625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.00018198718,0.000022851407,0.00008356841,0.00025217768,0.00009909023],"domain_scores_gemma":[0.9987257,0.0007788589,0.00012827142,0.000105702544,0.00020652177,0.00005487825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508087,0.00048252355,0.00028927007,0.0005355375,0.0003849943,0.00085769227,0.00065827224,0.00058706297,0.0010486711],"category_scores_gemma":[0.0049765096,0.00019303382,0.00015289118,0.0006305871,0.00056802557,0.001244531,0.00049969694,0.00053828774,0.000321314],"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.0002685677,0.000052242183,0.0043296088,0.000042837768,0.00001726618,0.00012523512,0.0000877817,0.94174695,0.011673417,0.008581792,0.0006429935,0.03243143],"study_design_scores_gemma":[0.000004908535,0.000086280466,0.0023290475,0.0000070113183,0.0000082107845,0.00006443198,0.00002036894,0.98569715,0.006287871,0.0051148236,0.00036709066,0.00001281094],"about_ca_topic_score_codex":0.0021910884,"about_ca_topic_score_gemma":0.0010714751,"teacher_disagreement_score":0.0021910884,"about_ca_system_score_codex":0.000815678,"about_ca_system_score_gemma":0.00030509982,"threshold_uncertainty_score":0.005918145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053002577,0.0002461095,0.94312984,0.000083572115,0.000037984842,0.000041166935,0.000033352433,0.0002885297,0.003136828],"genre_scores_gemma":[0.9072795,0.00019829089,0.091259494,0.000042766038,0.000056801113,0.00006766444,0.000036746336,0.00006922059,0.0009896455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997306,0.0009066897,0.000097003875,0.00035104563,0.0009778449,0.0003613585],"domain_scores_gemma":[0.9964258,0.001511484,0.00061996374,0.0006078786,0.0006300247,0.00020486079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337305,0.00057158206,0.0006611159,0.0008263214,0.00043793744,0.0013052194,0.0018530648,0.0004915466,0.00081613014],"category_scores_gemma":[0.007400113,0.00033370577,0.00029755052,0.00068026385,0.001038497,0.002146272,0.0007896812,0.00062508,0.00018352015],"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.00029878927,0.000058817983,0.000954159,0.000066968205,0.000053956817,0.00017753958,0.00014147915,0.6880575,0.017557029,0.24948406,0.0007302018,0.04241955],"study_design_scores_gemma":[0.000013936129,0.0000517405,0.00017563178,0.000004785663,0.000012322189,0.00005652751,0.000017127419,0.9641339,0.0033069642,0.031100431,0.0011103812,0.00001626681],"about_ca_topic_score_codex":0.0015924446,"about_ca_topic_score_gemma":0.00096502004,"teacher_disagreement_score":0.0027337305,"about_ca_system_score_codex":0.0011927469,"about_ca_system_score_gemma":0.0010755642,"threshold_uncertainty_score":0.014457583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110101,0.00036062923,0.8651513,0.00017081037,0.00006404571,0.000048577112,0.000024832303,0.00022268484,0.0028561358],"genre_scores_gemma":[0.9714578,0.00010270358,0.027351387,0.000040074043,0.000035933273,0.000036379075,0.000011330978,0.000017212978,0.00094716996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997459,0.0012096396,0.00008919259,0.00028797484,0.00058009755,0.00037413964],"domain_scores_gemma":[0.9967894,0.0018721373,0.0003916573,0.00047797858,0.00032164538,0.00014714655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044631436,0.0003879664,0.0006475439,0.0006153493,0.0008264923,0.0011477929,0.0015050727,0.00056504004,0.0007364752],"category_scores_gemma":[0.0066555543,0.00037645875,0.00046622258,0.00045817555,0.0013851632,0.0016483951,0.0011909804,0.00070729817,0.00010519659],"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.00043101187,0.000080588456,0.0013951727,0.00005018485,0.00005153644,0.00016382511,0.00029324603,0.75041395,0.0067724874,0.21429363,0.0005990074,0.025455315],"study_design_scores_gemma":[0.00001795783,0.000062574225,0.00016229186,0.0000041016265,0.000010984951,0.00003942854,0.000016460039,0.9721791,0.0015889058,0.025285969,0.00062053493,0.000011705413],"about_ca_topic_score_codex":0.0015979717,"about_ca_topic_score_gemma":0.00095915457,"teacher_disagreement_score":0.0044631436,"about_ca_system_score_codex":0.001537109,"about_ca_system_score_gemma":0.00086408725,"threshold_uncertainty_score":0.023603678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061487995,0.00035204945,0.93668145,0.000069248315,0.00008549468,0.00005323461,0.00001815829,0.0007059974,0.00054641993],"genre_scores_gemma":[0.5557642,0.00028597002,0.44172406,0.00008946507,0.00006634665,0.00009909021,0.000115332405,0.00008429349,0.0017712261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999627,0.00006328675,0.000052259322,0.000067807225,0.00014642713,0.000043173746],"domain_scores_gemma":[0.99908185,0.00030749352,0.00019887272,0.0001284135,0.00023557627,0.000047770984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069909764,0.00046827988,0.0005003237,0.0005272934,0.00043508984,0.0006736542,0.0010265558,0.0003880526,0.00028766584],"category_scores_gemma":[0.002181893,0.00023251162,0.00020863528,0.000239696,0.00035369865,0.00080661767,0.00049949216,0.00078576175,0.000091844966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012507997,0.00022442889,0.0063039595,0.0001758984,0.0001244913,0.00020908244,0.00037970746,0.11570469,0.18199229,0.011452747,0.0019478787,0.68023396],"study_design_scores_gemma":[0.000090498535,0.0004213167,0.0019195473,0.000022231767,0.00006454754,0.00028720932,0.000049050795,0.91432077,0.07538245,0.0017620907,0.005631714,0.000048637525],"about_ca_topic_score_codex":0.0014257283,"about_ca_topic_score_gemma":0.0019733713,"teacher_disagreement_score":0.0014257283,"about_ca_system_score_codex":0.00043684256,"about_ca_system_score_gemma":0.00059983024,"threshold_uncertainty_score":0.003697276},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015735218,0.0007499153,0.9559963,0.00044985564,0.00018037109,0.00052715174,0.00092453137,0.008051596,0.017385086],"genre_scores_gemma":[0.18667358,0.001097306,0.7939851,0.00028424492,0.00010753164,0.0006423733,0.0032240404,0.0007257101,0.013260025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993493,0.00011826484,0.000032707932,0.00010408546,0.00031023013,0.00008534218],"domain_scores_gemma":[0.99862075,0.00029603613,0.00009263296,0.00051521295,0.0004231982,0.00005213109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011926714,0.0009965872,0.00061369146,0.0011730789,0.0008145067,0.0012089618,0.0021218623,0.0009706939,0.008691083],"category_scores_gemma":[0.0037789878,0.0004043718,0.00038531885,0.0015155929,0.0003746263,0.0013207518,0.0015952635,0.0011856441,0.0036116522],"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.00034957041,0.0002355576,0.0015539547,0.0002099319,0.000083774175,0.000065761626,0.000113879316,0.21757732,0.0062109716,0.040190965,0.044188187,0.68922013],"study_design_scores_gemma":[0.00019136902,0.000085625856,0.00048026186,0.000028791925,0.000045280074,0.00011951209,0.000057325306,0.9245438,0.010876751,0.025107885,0.03843953,0.000023928145],"about_ca_topic_score_codex":0.002223903,"about_ca_topic_score_gemma":0.0027172097,"teacher_disagreement_score":0.008691083,"about_ca_system_score_codex":0.0006220983,"about_ca_system_score_gemma":0.0009867953,"threshold_uncertainty_score":0.02907455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008555203,0.0025447812,0.9659948,0.0010781727,0.00049551425,0.0001603143,0.00020973633,0.00082347065,0.020138122],"genre_scores_gemma":[0.3558903,0.004329461,0.62451214,0.0008571769,0.00053723133,0.0003888437,0.00085794117,0.000169336,0.012457581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999073,0.00019042751,0.00004793192,0.00015146311,0.00042661247,0.00011051727],"domain_scores_gemma":[0.9992681,0.000172401,0.00007085796,0.0001690239,0.00025070878,0.000068867506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086264557,0.0007936247,0.0005926368,0.0005645399,0.00067748537,0.00182134,0.0025082487,0.0009792546,0.0032528255],"category_scores_gemma":[0.0021662114,0.00033611062,0.00049846625,0.0007881472,0.0005505854,0.0019578666,0.0016986277,0.001370591,0.00089838647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021970653,0.00019914786,0.0010325805,0.00077979104,0.00017371925,0.000505434,0.00018783618,0.1647393,0.036112517,0.40347284,0.027930731,0.3646464],"study_design_scores_gemma":[0.000051665036,0.00021249676,0.00037124986,0.00008572399,0.00008767657,0.00067223737,0.000059340608,0.8037182,0.011197104,0.09362736,0.0898629,0.00005405024],"about_ca_topic_score_codex":0.0010840724,"about_ca_topic_score_gemma":0.0011945423,"teacher_disagreement_score":0.0032528255,"about_ca_system_score_codex":0.0006800231,"about_ca_system_score_gemma":0.0010702927,"threshold_uncertainty_score":0.010881841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016266659,0.00032177655,0.9814596,0.0001142801,0.00008241215,0.000028751132,0.0000068636164,0.00028094958,0.0014386463],"genre_scores_gemma":[0.64495534,0.00074243767,0.351191,0.00017369159,0.00015975404,0.00010658855,0.000058554004,0.00011301185,0.0024995469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00021165225,0.000032493852,0.00010561213,0.00018347641,0.000042885586],"domain_scores_gemma":[0.9990834,0.00040486435,0.00007897492,0.0001575855,0.00023927593,0.00003585025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086220435,0.0005401289,0.00045682446,0.0005648722,0.00035014137,0.00067911955,0.001236614,0.0006831781,0.0005463473],"category_scores_gemma":[0.0029226895,0.00020261954,0.00029072518,0.0006049728,0.00057569495,0.001704983,0.00065248064,0.00090613734,0.00022786226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017071213,0.00017484381,0.0016868635,0.0001350211,0.000081388585,0.00023044908,0.00013422024,0.28856593,0.049889393,0.07652061,0.0019106049,0.58049995],"study_design_scores_gemma":[0.000013842986,0.00011437805,0.00026494084,0.000006709408,0.0000135298715,0.00019994512,0.000011921638,0.9780197,0.006623619,0.010479098,0.0042337705,0.000018522656],"about_ca_topic_score_codex":0.0008550004,"about_ca_topic_score_gemma":0.0005269927,"teacher_disagreement_score":0.001236614,"about_ca_system_score_codex":0.00031695078,"about_ca_system_score_gemma":0.00046025674,"threshold_uncertainty_score":0.0045598745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033324316,0.0018454803,0.92541015,0.00081524235,0.0005194256,0.0009170142,0.00094806124,0.006375663,0.02984461],"genre_scores_gemma":[0.732788,0.0023092856,0.23507714,0.0008831703,0.00026277304,0.00081724196,0.0027659624,0.00022658391,0.024869803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944276,0.0000806927,0.000056422155,0.000069284644,0.00026516063,0.000085584245],"domain_scores_gemma":[0.99927443,0.000081961814,0.000060354618,0.00014036523,0.00038398302,0.000058962745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045998985,0.00036914242,0.0005019043,0.00068526797,0.00076166686,0.0010752354,0.0013013695,0.00074121973,0.0018626606],"category_scores_gemma":[0.0011288082,0.00020520833,0.00029092925,0.00068273843,0.0002825996,0.0014308011,0.0013636026,0.0009562406,0.0012943821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009714714,0.0003225496,0.0019701107,0.00094712107,0.00013341111,0.0019269652,0.0010466786,0.035499707,0.1451191,0.15104212,0.056500133,0.6045206],"study_design_scores_gemma":[0.00016051561,0.00052969804,0.0019538456,0.00017773424,0.00016603379,0.004271032,0.0004566391,0.5044187,0.11992486,0.056179706,0.31147972,0.00028152554],"about_ca_topic_score_codex":0.0015801499,"about_ca_topic_score_gemma":0.0012637809,"teacher_disagreement_score":0.0018626606,"about_ca_system_score_codex":0.0005493977,"about_ca_system_score_gemma":0.00084382424,"threshold_uncertainty_score":0.0062312484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044923755,0.00007903037,0.9945176,0.00008122544,0.000018418139,0.000017385473,0.000036030677,0.00016374957,0.00059413444],"genre_scores_gemma":[0.6213583,0.0007451795,0.3716193,0.00030344413,0.00031554178,0.00030657675,0.0005144536,0.00020015208,0.0046369894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834883,0.00052891125,0.000057674504,0.00044666202,0.0004698257,0.00014798334],"domain_scores_gemma":[0.99104065,0.0060717533,0.00083113514,0.00071705884,0.001110934,0.00022857853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036811645,0.00093861134,0.0014932646,0.00095605885,0.00047793105,0.0014808711,0.0013894724,0.0015973944,0.0017035763],"category_scores_gemma":[0.02168851,0.00072552235,0.00044527277,0.00067808223,0.0014519977,0.0025200574,0.0014275644,0.0023317735,0.00070496975],"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.00012400818,0.00009392696,0.0029138147,0.00009782892,0.00006979739,0.00010525803,0.00007923168,0.8192144,0.008660004,0.103130475,0.0015686549,0.06394261],"study_design_scores_gemma":[0.000010308753,0.000018283814,0.00022409543,0.000010465461,0.0000050280823,0.00002516212,0.0000041031867,0.98986465,0.0007013853,0.008528072,0.00059283845,0.000015563748],"about_ca_topic_score_codex":0.0019003032,"about_ca_topic_score_gemma":0.0013738183,"teacher_disagreement_score":0.0036811645,"about_ca_system_score_codex":0.00096628047,"about_ca_system_score_gemma":0.0015349612,"threshold_uncertainty_score":0.019468129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9724514,0.00032143187,0.025771892,0.00002649859,0.000013986686,0.0000120189325,0.000082770086,0.00021116619,0.001108755],"genre_scores_gemma":[0.9976648,0.000057172183,0.0018900372,0.0000036764718,0.0000040839186,0.0000060829557,0.000048649006,0.000008204151,0.00031725134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993575,0.00015697812,0.000025132382,0.000103798855,0.00020202633,0.00015446379],"domain_scores_gemma":[0.9984425,0.00094048725,0.00014393784,0.00009525649,0.00030886542,0.00006899012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348675,0.0004384157,0.0003215674,0.0006291797,0.00042394293,0.0006960535,0.00047141765,0.00042219987,0.0005913955],"category_scores_gemma":[0.0022801233,0.00018121375,0.00020148771,0.00063757,0.0004807074,0.000669747,0.000318461,0.00032293488,0.00009925792],"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.0019394322,0.00023843584,0.016211027,0.0001464254,0.00009897666,0.00035796722,0.00027788672,0.8428513,0.09757166,0.0054422556,0.0005441376,0.034320507],"study_design_scores_gemma":[0.000006086948,0.00018582176,0.0024699455,0.0000023195114,0.000016727867,0.000040157847,0.00002528686,0.98760486,0.009157281,0.00036147374,0.0001182803,0.00001164518],"about_ca_topic_score_codex":0.005255276,"about_ca_topic_score_gemma":0.0023964788,"teacher_disagreement_score":0.005255276,"about_ca_system_score_codex":0.0013007828,"about_ca_system_score_gemma":0.00037926127,"threshold_uncertainty_score":0.0104494095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010531676,0.002497209,0.9783611,0.0005117005,0.0004775953,0.000045825127,0.00009182843,0.00080893177,0.006674105],"genre_scores_gemma":[0.831645,0.004638343,0.14785843,0.00039820644,0.0008911668,0.00017986858,0.00021260281,0.00018601926,0.013990271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992316,0.00019007633,0.000041321648,0.00011935784,0.00034096575,0.000076725155],"domain_scores_gemma":[0.9983675,0.00102584,0.00010116358,0.00010161881,0.00033746593,0.00006650401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867201,0.0005247206,0.0006939648,0.0012026402,0.0006733718,0.0015479715,0.0010171003,0.00089839724,0.0029964007],"category_scores_gemma":[0.0057543046,0.0004093791,0.00039314208,0.0010331209,0.0011254901,0.002225924,0.000778162,0.0011328285,0.0003887135],"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.00024127802,0.000081351805,0.00061706617,0.00016990458,0.00004227973,0.00016679481,0.00012469655,0.60181844,0.0035433422,0.22668372,0.010370141,0.15614094],"study_design_scores_gemma":[0.000020699697,0.00003376483,0.00016730506,0.000014795989,0.000011437555,0.000050490853,0.000008376245,0.93689936,0.001155156,0.05793572,0.003686165,0.00001674785],"about_ca_topic_score_codex":0.0040058293,"about_ca_topic_score_gemma":0.0019517387,"teacher_disagreement_score":0.0040058293,"about_ca_system_score_codex":0.0017163042,"about_ca_system_score_gemma":0.0008590082,"threshold_uncertainty_score":0.012452722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17420359,0.00034241276,0.8109886,0.00077322166,0.000102894664,0.0006622394,0.0003906296,0.002166369,0.010370005],"genre_scores_gemma":[0.8290685,0.00029044878,0.16675203,0.00017693994,0.000035530993,0.00064760464,0.00036541157,0.0002109671,0.002452552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920872,0.0032680167,0.00034268465,0.000503316,0.003186019,0.00061279227],"domain_scores_gemma":[0.9782225,0.01191212,0.0012250838,0.0030649432,0.005204891,0.00037045256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011334355,0.0007021149,0.00068187225,0.0008075024,0.0007181102,0.0022656745,0.004702765,0.0025921836,0.0021736978],"category_scores_gemma":[0.027650971,0.000629096,0.0007617021,0.00067399646,0.0023543201,0.00271434,0.0015368433,0.002660451,0.00038372664],"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.00038171178,0.0005235976,0.0027803166,0.00016155042,0.00005379817,0.0001090871,0.00037730948,0.90828985,0.0051790876,0.06353564,0.001474661,0.017133439],"study_design_scores_gemma":[0.000018635437,0.00003129629,0.00011075232,0.000012077721,0.0000051526936,0.000007945594,0.000015440086,0.9951958,0.0016764819,0.0024589633,0.00046009917,0.0000073108245],"about_ca_topic_score_codex":0.019513505,"about_ca_topic_score_gemma":0.0072462973,"teacher_disagreement_score":0.019513505,"about_ca_system_score_codex":0.003791409,"about_ca_system_score_gemma":0.0036674752,"threshold_uncertainty_score":0.059942544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07902058,0.0006874747,0.90453124,0.0008682438,0.00013633948,0.00021821777,0.00082893175,0.001572784,0.012136357],"genre_scores_gemma":[0.9595684,0.0007540994,0.031785496,0.00015430793,0.00010079232,0.00060890964,0.0005075096,0.00015190736,0.0063685942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987495,0.00023097446,0.00006031716,0.0003162911,0.00035347938,0.0002893816],"domain_scores_gemma":[0.997306,0.0012754756,0.0003227301,0.00025216187,0.0007544971,0.00008910774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013886932,0.00093360327,0.0010260381,0.0012991825,0.00096819724,0.001546044,0.0026969367,0.0015132639,0.0032007042],"category_scores_gemma":[0.0055309697,0.0005871217,0.0010466136,0.00141402,0.0012012533,0.0026945523,0.0007777935,0.0020139145,0.00076618727],"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.00016020943,0.00010438406,0.0013884825,0.00011792447,0.000040832114,0.00023416211,0.00032140815,0.8843161,0.0058092335,0.09638482,0.0025324773,0.0085900435],"study_design_scores_gemma":[0.0000073954166,0.000021600243,0.00012670625,0.0000063336934,0.000009996213,0.000038651924,0.0000110548945,0.9917842,0.0003847622,0.00719704,0.0004023285,0.000009822202],"about_ca_topic_score_codex":0.009640524,"about_ca_topic_score_gemma":0.0037698848,"teacher_disagreement_score":0.009640524,"about_ca_system_score_codex":0.002731076,"about_ca_system_score_gemma":0.0019821017,"threshold_uncertainty_score":0.019815385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014894717,0.006388107,0.92619914,0.00052269094,0.00039444456,0.00008303613,0.00016936946,0.00056785933,0.050780628],"genre_scores_gemma":[0.38295153,0.005157722,0.56540745,0.0003417141,0.00044410324,0.00017544936,0.00043586106,0.00046164411,0.044624444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.000078693694,0.000033559005,0.00011940054,0.00025259866,0.000065889326],"domain_scores_gemma":[0.99974984,0.00009825178,0.000017313168,0.000046214926,0.00006707394,0.000021310354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066694827,0.0006053454,0.00045227061,0.0008664052,0.00045553272,0.0018401414,0.0013966497,0.00066803664,0.006287488],"category_scores_gemma":[0.001483562,0.00041020612,0.00025513239,0.0006345042,0.00045434598,0.002112403,0.0007606685,0.0006906606,0.00114941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019571654,0.00007655552,0.00034747028,0.00014277107,0.000015929323,0.00006836929,0.00010638873,0.0577883,0.016680118,0.44481438,0.007747756,0.47201622],"study_design_scores_gemma":[0.000072394185,0.00009671831,0.00084451574,0.00009334641,0.000051000614,0.0003686782,0.00007020883,0.5999636,0.023093142,0.2701378,0.105151944,0.000056667915],"about_ca_topic_score_codex":0.0013955334,"about_ca_topic_score_gemma":0.001655022,"teacher_disagreement_score":0.006287488,"about_ca_system_score_codex":0.0014235366,"about_ca_system_score_gemma":0.0009104711,"threshold_uncertainty_score":0.021033704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060590487,0.0004862522,0.9369438,0.00018544355,0.00012590723,0.000080385216,0.000037395646,0.00065793813,0.00089233124],"genre_scores_gemma":[0.89807135,0.00017369761,0.100921266,0.00009948082,0.00010793794,0.00007324197,0.000040512718,0.000027776541,0.00048473393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859935,0.00035120966,0.00011077376,0.0002403414,0.0005835177,0.00011477331],"domain_scores_gemma":[0.9976661,0.00088588096,0.00031961012,0.00038619016,0.00062703807,0.00011521171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020721052,0.00048504095,0.0005665575,0.00084559096,0.0006563991,0.0009596751,0.0015884746,0.00050430757,0.00030552832],"category_scores_gemma":[0.0059442692,0.00031963817,0.00033772676,0.0005719793,0.0008429949,0.0015102985,0.0011210003,0.0010487175,0.000073490286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007920037,0.00035474394,0.0094617205,0.00035779775,0.00018607907,0.00053764594,0.0008468373,0.25519875,0.16124639,0.11363324,0.0032731043,0.45411173],"study_design_scores_gemma":[0.00003010358,0.00023261945,0.0006304375,0.000011715088,0.00004672616,0.00019351263,0.000021187503,0.97816193,0.012379259,0.0056446586,0.0026088518,0.00003905871],"about_ca_topic_score_codex":0.0008221682,"about_ca_topic_score_gemma":0.0008075963,"teacher_disagreement_score":0.0020721052,"about_ca_system_score_codex":0.0007484644,"about_ca_system_score_gemma":0.0008098053,"threshold_uncertainty_score":0.010958493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052322936,0.00008985264,0.99245304,0.00008449911,0.00003340706,0.000080381695,0.00006702335,0.0005869444,0.0013725117],"genre_scores_gemma":[0.13984399,0.00012824882,0.8569875,0.00008173298,0.000029939065,0.0003131132,0.00039121538,0.00012680316,0.0020974956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.000121197714,0.000030134566,0.000106990476,0.00015689146,0.00006131063],"domain_scores_gemma":[0.99938273,0.00025958475,0.000055747645,0.00011700892,0.00014166832,0.000043230426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000869848,0.00065595104,0.00068754767,0.0009827801,0.0006677114,0.00089911476,0.0013845684,0.0011167789,0.0042842925],"category_scores_gemma":[0.002472602,0.00040921956,0.00054940034,0.0010646537,0.00058348174,0.0014058985,0.0014337453,0.00087213446,0.00088720035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017948532,0.00007832643,0.00060220045,0.00011558764,0.00004990563,0.000110567795,0.00010156552,0.4425845,0.0058457097,0.03897097,0.007466448,0.50389475],"study_design_scores_gemma":[0.00006846948,0.00006589256,0.00007779242,0.000009897075,0.0000129626105,0.00008478898,0.000017044553,0.97690433,0.0014319287,0.017422443,0.003893327,0.000011213294],"about_ca_topic_score_codex":0.0009437011,"about_ca_topic_score_gemma":0.001113454,"teacher_disagreement_score":0.0042842925,"about_ca_system_score_codex":0.00047923304,"about_ca_system_score_gemma":0.0007546598,"threshold_uncertainty_score":0.014332414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017417843,0.015808636,0.8426445,0.0025784066,0.0014257312,0.00041786485,0.0007843556,0.004907144,0.11401549],"genre_scores_gemma":[0.5080543,0.01451116,0.37430876,0.0014525441,0.0009396678,0.00041216196,0.0033651842,0.0004931249,0.09646305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996606,0.00005921058,0.000018487202,0.0000360638,0.00018213721,0.000043592117],"domain_scores_gemma":[0.9997094,0.00004123423,0.000018746114,0.000069236936,0.00013174684,0.000029714492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046441884,0.0003676835,0.0003753647,0.00048445893,0.00038119414,0.00079806993,0.0009920199,0.00070866715,0.005518892],"category_scores_gemma":[0.00089978974,0.00013369815,0.00019300473,0.00076586904,0.000273658,0.0008109203,0.00081381045,0.00069630594,0.0038818095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002736114,0.00018143482,0.0007427651,0.0004532852,0.000037319165,0.0004399896,0.00020687828,0.012322969,0.0632855,0.19506706,0.0900316,0.6369576],"study_design_scores_gemma":[0.000085580854,0.0002570031,0.0013437853,0.00011369108,0.000052358548,0.001120166,0.00007960325,0.13431394,0.03800663,0.07055905,0.75400066,0.00006752729],"about_ca_topic_score_codex":0.00074516,"about_ca_topic_score_gemma":0.0008920035,"teacher_disagreement_score":0.005518892,"about_ca_system_score_codex":0.0008130024,"about_ca_system_score_gemma":0.00065284886,"threshold_uncertainty_score":0.01846248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2505455,0.00034931398,0.7461487,0.00022941058,0.00006851564,0.000047359885,0.000025637144,0.0014103247,0.0011752965],"genre_scores_gemma":[0.89936507,0.00008220766,0.09973669,0.00007095149,0.00003949068,0.000023912982,0.000038660844,0.000046788995,0.00059632846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994497,0.00015540674,0.00003908831,0.000116408584,0.00015686822,0.00008248679],"domain_scores_gemma":[0.99790406,0.0011598686,0.0002848066,0.0002967975,0.00023610778,0.00011833665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015832876,0.00046127467,0.0005101825,0.00061471853,0.0004206057,0.00076217187,0.00082493323,0.00047315267,0.0004013708],"category_scores_gemma":[0.005303575,0.00020984327,0.00014330386,0.00043658674,0.00045990528,0.0013339098,0.00058634946,0.0007518449,0.0001628811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001381312,0.000741005,0.007220763,0.00007785509,0.000046945708,0.00029484744,0.00019643312,0.3693197,0.18492495,0.0130014615,0.0018395308,0.42095518],"study_design_scores_gemma":[0.000016073074,0.000092260176,0.0011553405,0.0000033296483,0.000009778283,0.000060806786,0.000009331677,0.97418404,0.021772122,0.0022941711,0.00039003752,0.000012672274],"about_ca_topic_score_codex":0.0006673167,"about_ca_topic_score_gemma":0.0006770468,"teacher_disagreement_score":0.0015832876,"about_ca_system_score_codex":0.000645044,"about_ca_system_score_gemma":0.0004954214,"threshold_uncertainty_score":0.00837338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012777273,0.0031785527,0.9778437,0.0003224323,0.00037754292,0.00010326845,0.00011620066,0.00064039347,0.004640672],"genre_scores_gemma":[0.41594765,0.0044040587,0.5670669,0.0002350366,0.00055761467,0.0003284356,0.00033784416,0.00011861651,0.01100388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997737,0.00006010933,0.000016375265,0.00004123578,0.000075958,0.00003277479],"domain_scores_gemma":[0.9997861,0.00006427006,0.00002955274,0.000045114535,0.00005740209,0.000017590644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044828528,0.0005550375,0.00030501434,0.0005060112,0.00052243914,0.0009233852,0.00084739015,0.0006026157,0.003532187],"category_scores_gemma":[0.00096348766,0.00024401215,0.00028950127,0.0005748207,0.000489344,0.0012675432,0.00041121276,0.00073492015,0.0006622526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031120237,0.00011569436,0.00040653427,0.00036338405,0.00003424465,0.00031242662,0.00017358674,0.061199706,0.053793285,0.48517013,0.01114449,0.38697532],"study_design_scores_gemma":[0.00014328516,0.000584418,0.00046122103,0.000118494856,0.00010869656,0.00045239812,0.00005315524,0.6846861,0.031686053,0.177416,0.10420123,0.00008896192],"about_ca_topic_score_codex":0.0011540018,"about_ca_topic_score_gemma":0.001706538,"teacher_disagreement_score":0.003532187,"about_ca_system_score_codex":0.00075767626,"about_ca_system_score_gemma":0.0006011033,"threshold_uncertainty_score":0.011816382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040097944,0.0005260415,0.9571099,0.00026035157,0.00022073764,0.00008601957,0.000031385876,0.0007448109,0.00092278665],"genre_scores_gemma":[0.84182453,0.00018976396,0.1565751,0.00024468562,0.00022666612,0.00009446345,0.000041680243,0.000048223887,0.00075481914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979734,0.00062041165,0.00013195451,0.00030119313,0.0007793031,0.00019365875],"domain_scores_gemma":[0.9957456,0.0018251999,0.00045572573,0.0008011916,0.0009643859,0.00020800314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030469948,0.0007385172,0.000915084,0.00081071287,0.00096189865,0.0013598527,0.002660337,0.0008388594,0.0005812878],"category_scores_gemma":[0.008095449,0.00037128793,0.00040309518,0.0004962537,0.0012270778,0.002101628,0.001884598,0.0020060043,0.00012661394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013760065,0.0005558495,0.006251355,0.00049319025,0.0002670612,0.000665149,0.0008732899,0.16943954,0.19828033,0.12248902,0.0070616705,0.4922475],"study_design_scores_gemma":[0.000086877575,0.0004717139,0.00053963665,0.00001736985,0.000088101995,0.00038475863,0.000033385513,0.96060425,0.024901684,0.008241748,0.0045636045,0.00006691966],"about_ca_topic_score_codex":0.0005520607,"about_ca_topic_score_gemma":0.00065224007,"teacher_disagreement_score":0.0030469948,"about_ca_system_score_codex":0.00077741453,"about_ca_system_score_gemma":0.0009251209,"threshold_uncertainty_score":0.016114235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03314057,0.0015890658,0.9513596,0.0002578232,0.00032224398,0.00013002502,0.00007811248,0.0037532183,0.009369361],"genre_scores_gemma":[0.76636505,0.0010902816,0.2140486,0.00025638923,0.0002634079,0.00012533092,0.00016724858,0.00015521768,0.017528575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000025659578,0.000011633622,0.000044550747,0.00011285575,0.000029013898],"domain_scores_gemma":[0.9996941,0.00011049131,0.000037750026,0.00004814705,0.00009354294,0.000015976852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039936803,0.00050826214,0.0005408842,0.00039492297,0.0004330061,0.0009422187,0.0012723312,0.00064486,0.003537397],"category_scores_gemma":[0.00085553946,0.00032370642,0.00018893665,0.00023588535,0.0003938561,0.0007611985,0.00038952476,0.00093090616,0.000646936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007774527,0.00024496167,0.0004943035,0.0002087846,0.000033899574,0.00021035952,0.00032379094,0.10513145,0.17310584,0.060538482,0.013397012,0.64553374],"study_design_scores_gemma":[0.0001099847,0.00043986161,0.00062942255,0.000046246616,0.000081078375,0.0002439752,0.00003716119,0.8827144,0.06242373,0.022858417,0.03036555,0.000050109487],"about_ca_topic_score_codex":0.00087790017,"about_ca_topic_score_gemma":0.0016725775,"teacher_disagreement_score":0.003537397,"about_ca_system_score_codex":0.0006105996,"about_ca_system_score_gemma":0.00028597398,"threshold_uncertainty_score":0.011833727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004497979,0.00010992029,0.9931003,0.00005559567,0.000025531104,0.000029784906,0.000009788953,0.000107718806,0.0020633095],"genre_scores_gemma":[0.14134665,0.00026072017,0.8551472,0.00012407373,0.00003638241,0.00021375199,0.00008346639,0.000052804502,0.0027350043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997495,0.000080349884,0.000009538122,0.00003776724,0.00010166907,0.000021178694],"domain_scores_gemma":[0.99987423,0.0000574485,0.000013866467,0.000013756118,0.00003160115,0.000009088771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002883611,0.00048515652,0.00049866963,0.00061635766,0.00040608927,0.00043773794,0.0009496237,0.0008269567,0.001162473],"category_scores_gemma":[0.00079100527,0.0001941652,0.00044553066,0.00063146185,0.0003789508,0.00045908027,0.0005133188,0.0005657608,0.00022902623],"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.000050638202,0.00011883597,0.0007064855,0.000117508076,0.0000959663,0.00019303043,0.00013732506,0.63323855,0.02083063,0.071640514,0.0024156906,0.27045482],"study_design_scores_gemma":[0.000019160914,0.000049525515,0.00012238351,0.000010756544,0.00001484008,0.000106966545,0.000013571479,0.9852747,0.0016443338,0.0075350604,0.0051978133,0.000010803237],"about_ca_topic_score_codex":0.0019940329,"about_ca_topic_score_gemma":0.0016582427,"teacher_disagreement_score":0.0019940329,"about_ca_system_score_codex":0.00040917273,"about_ca_system_score_gemma":0.0005756705,"threshold_uncertainty_score":0.0039648414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14698209,0.0002726598,0.8475204,0.00033385667,0.000034185745,0.00008692303,0.000075568445,0.0003684491,0.0043258583],"genre_scores_gemma":[0.9599862,0.00011106018,0.03807742,0.000049712595,0.000021521437,0.000057955247,0.000051327926,0.000053202864,0.0015916451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928504,0.00025913594,0.00002346797,0.00010479069,0.00018326784,0.00014438969],"domain_scores_gemma":[0.9980908,0.0010207954,0.00031240986,0.00014491586,0.0003300373,0.00010092714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012749017,0.0009053055,0.0012702527,0.00057437323,0.0003145855,0.0011289599,0.0014846984,0.0010749451,0.0010574381],"category_scores_gemma":[0.0038299959,0.0005146592,0.00041720422,0.0006130946,0.0008779119,0.0011510759,0.0010775154,0.00073990674,0.0002323018],"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.00010723225,0.0000621571,0.0002374611,0.000038459893,0.000014198008,0.000044245036,0.00003634482,0.9739672,0.00371522,0.010787081,0.00029763507,0.010692732],"study_design_scores_gemma":[0.0000069378802,0.00001605311,0.000030902007,0.0000017857432,0.0000031159273,0.0000051240745,0.0000045590377,0.9963142,0.0005653449,0.002986748,0.00006231005,0.0000028944203],"about_ca_topic_score_codex":0.0015354793,"about_ca_topic_score_gemma":0.00095021015,"teacher_disagreement_score":0.0017552152,"about_ca_system_score_codex":0.0017552152,"about_ca_system_score_gemma":0.00080410164,"threshold_uncertainty_score":0.012735069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052748226,0.00018606281,0.9361362,0.0006870122,0.00008686657,0.00006419584,0.00018628528,0.00022638845,0.00967878],"genre_scores_gemma":[0.93988764,0.00071269495,0.039009023,0.00023183195,0.00015715734,0.00017444209,0.0003000403,0.000115480085,0.019411637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00017825759,0.000021262966,0.00011112507,0.00018388346,0.0000895873],"domain_scores_gemma":[0.99849594,0.0006881983,0.00023081123,0.00019222441,0.00029317348,0.00009968592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579898,0.0006257554,0.00080325844,0.00084997097,0.0005169915,0.0011391867,0.0019282161,0.0013240031,0.0028753933],"category_scores_gemma":[0.004004129,0.00033277745,0.00081669725,0.0011200001,0.0014362357,0.0027076027,0.0009254286,0.0029436832,0.00077780616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050570456,0.000089256246,0.0009221478,0.00003964221,0.00002241798,0.00045701963,0.00021558783,0.29116225,0.0037538474,0.6935353,0.0017837202,0.007968189],"study_design_scores_gemma":[0.0000065052777,0.000013587986,0.00012570401,0.000002805104,0.0000051326197,0.000072724986,0.000014433195,0.9485064,0.00023636082,0.050333157,0.00067297084,0.00001017831],"about_ca_topic_score_codex":0.0032507495,"about_ca_topic_score_gemma":0.0021947913,"teacher_disagreement_score":0.0032507495,"about_ca_system_score_codex":0.0012058774,"about_ca_system_score_gemma":0.0008167132,"threshold_uncertainty_score":0.009619117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006594477,0.000084438165,0.9920541,0.00005549792,0.00002320033,0.000020262358,0.000033977198,0.000453326,0.0006806963],"genre_scores_gemma":[0.3705947,0.00025523492,0.6254056,0.000063127794,0.000058069814,0.00030018348,0.00026638934,0.00017490286,0.0028817393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997224,0.00009068038,0.000013918759,0.000032134285,0.000112606176,0.00002813979],"domain_scores_gemma":[0.9993236,0.0004619408,0.00003407792,0.000047820835,0.00011071971,0.000021942218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054232345,0.0005370877,0.00076208904,0.0005663591,0.0005233258,0.0006392767,0.00081626506,0.000669612,0.0026561462],"category_scores_gemma":[0.0021883014,0.0003747538,0.00067895034,0.00058537617,0.000586658,0.0007650564,0.00070682913,0.0012270064,0.0005683622],"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.00006002597,0.000041467658,0.00035980804,0.00004826581,0.000020567013,0.000039170583,0.000048228314,0.8936359,0.0024368432,0.015870882,0.0008983247,0.08654048],"study_design_scores_gemma":[0.0000034158886,0.000005548041,0.000024230629,0.0000013188275,0.0000015524256,0.0000035193664,0.0000016869108,0.9976144,0.0002587876,0.0018521863,0.00023134207,0.0000019852816],"about_ca_topic_score_codex":0.0086573865,"about_ca_topic_score_gemma":0.0059021623,"teacher_disagreement_score":0.0086573865,"about_ca_system_score_codex":0.0006398372,"about_ca_system_score_gemma":0.0010927957,"threshold_uncertainty_score":0.017214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99801755,0.000035605262,0.0011799015,0.000018303583,0.000012520682,0.000047080637,0.000084422565,0.00004270167,0.00056189985],"genre_scores_gemma":[0.9974837,0.000083818806,0.0015127229,0.000015621714,0.000017468514,0.00004791668,0.0002753602,0.000014863162,0.0005486518],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9983577,0.00064330245,0.000107000924,0.00021369645,0.00041549187,0.0002627882],"domain_scores_gemma":[0.9866519,0.009877433,0.0006858946,0.0006635412,0.0017407202,0.00038044562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578286,0.00053905405,0.00039709118,0.00085254153,0.00076231535,0.00045883676,0.0007765131,0.00062674884,0.0015893347],"category_scores_gemma":[0.0072570797,0.0002250944,0.0002465949,0.00075289205,0.000569334,0.0010626935,0.0003370611,0.0007993722,0.00022613187],"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.0113851,0.030636268,0.07513574,0.0010137442,0.00031940045,0.0020109476,0.0032672654,0.076772384,0.705393,0.0055320924,0.003512258,0.08502182],"study_design_scores_gemma":[0.00061702414,0.04311394,0.087465964,0.00012863436,0.00025835118,0.0017504846,0.0028983532,0.43676463,0.42123908,0.0023345284,0.003266405,0.0001625579],"about_ca_topic_score_codex":0.0023534803,"about_ca_topic_score_gemma":0.001578749,"teacher_disagreement_score":0.0023534803,"about_ca_system_score_codex":0.00063351745,"about_ca_system_score_gemma":0.00027434088,"threshold_uncertainty_score":0.009296417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7973013,0.008575224,0.15534022,0.010377894,0.0005611009,0.0000681774,0.00045403466,0.0003551914,0.026966829],"genre_scores_gemma":[0.9902726,0.001690762,0.0056743426,0.0004552039,0.00020534777,0.0000146752145,0.000060001334,0.00010197766,0.0015249087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.0002903462,0.00003151538,0.0002006175,0.00018478825,0.00025121475],"domain_scores_gemma":[0.97659874,0.015802503,0.003324716,0.0020806869,0.001154941,0.0010385478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003087105,0.00057544914,0.0006570597,0.0005613364,0.0008949703,0.0023184635,0.0009731278,0.00132025,0.005081859],"category_scores_gemma":[0.022903996,0.00028138436,0.00031239566,0.0011265004,0.0014895678,0.0068817046,0.0009651584,0.0014463195,0.0006861404],"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.0014260703,0.0006023289,0.062718615,0.00087703974,0.00044734916,0.0005100485,0.00068409665,0.34577355,0.033491485,0.24129575,0.008164853,0.3040088],"study_design_scores_gemma":[0.00012769164,0.0011323112,0.06325783,0.00023331048,0.0003717097,0.000903063,0.0021611291,0.37335128,0.024083259,0.5174579,0.016787237,0.0001332962],"about_ca_topic_score_codex":0.0012841155,"about_ca_topic_score_gemma":0.0017543773,"teacher_disagreement_score":0.005081859,"about_ca_system_score_codex":0.0009937661,"about_ca_system_score_gemma":0.0009213708,"threshold_uncertainty_score":0.017000496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052241664,0.0020505055,0.934633,0.0016242753,0.00017986918,0.000116481446,0.00003558967,0.00023066122,0.008888022],"genre_scores_gemma":[0.82533723,0.0013310411,0.1695204,0.00044948416,0.00043383322,0.0001131018,0.000033639437,0.00016961146,0.0026117358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513537,0.0019948634,0.00023853799,0.00057121285,0.0014562344,0.00060383504],"domain_scores_gemma":[0.98332477,0.013162373,0.0007047185,0.0012023009,0.0012103551,0.0003954994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009854983,0.0011505756,0.0012532127,0.0013276017,0.0014786075,0.0028088933,0.0019273161,0.0014561975,0.0013570951],"category_scores_gemma":[0.02287111,0.00055219437,0.00045996095,0.0013126602,0.0026316103,0.0054603443,0.0015033867,0.0020840575,0.00034767744],"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.00075181096,0.00019383874,0.0018055728,0.00017136578,0.00009020419,0.00015924833,0.00028156705,0.5899235,0.013995149,0.31368673,0.0018958573,0.07704524],"study_design_scores_gemma":[0.000051999217,0.00011359222,0.0003529458,0.000026156127,0.000025060863,0.00007153726,0.00002887763,0.9141393,0.0037383013,0.07959002,0.0018355922,0.000026705658],"about_ca_topic_score_codex":0.0022987865,"about_ca_topic_score_gemma":0.0019069684,"teacher_disagreement_score":0.009854983,"about_ca_system_score_codex":0.0033096485,"about_ca_system_score_gemma":0.0025394207,"threshold_uncertainty_score":0.05211878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.554518,0.0005101022,0.42174074,0.00025611857,0.00008134306,0.00026136465,0.0006946585,0.013628285,0.0083094435],"genre_scores_gemma":[0.945361,0.00018054068,0.05223473,0.000046926212,0.000059067497,0.000069150956,0.0005699733,0.00021595591,0.0012625979],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9966556,0.00045998354,0.00019914002,0.00049341004,0.0020120735,0.00017986771],"domain_scores_gemma":[0.99473464,0.0021975948,0.0007681359,0.0006347664,0.0013423519,0.00032247626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730376,0.0007337679,0.00086592283,0.002985461,0.0006089842,0.0018756408,0.0009480322,0.00079338846,0.0009172274],"category_scores_gemma":[0.008648212,0.00028863203,0.00023041728,0.0014761686,0.0004915047,0.0020057142,0.00063019653,0.0010338249,0.0007661427],"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.0012845598,0.0010901241,0.10995557,0.00052583765,0.00034221902,0.0006986602,0.0010208469,0.1193305,0.27358848,0.009992539,0.004864122,0.47730654],"study_design_scores_gemma":[0.00004274587,0.000750311,0.033167057,0.00005725127,0.00014748317,0.0005540837,0.00015250997,0.8133804,0.13896462,0.0052301916,0.0074126846,0.0001406202],"about_ca_topic_score_codex":0.0032708193,"about_ca_topic_score_gemma":0.0017019024,"teacher_disagreement_score":0.0032708193,"about_ca_system_score_codex":0.0006554561,"about_ca_system_score_gemma":0.0007101633,"threshold_uncertainty_score":0.00915122},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09166915,0.00034447238,0.90370256,0.00021206742,0.00005587346,0.000120649274,0.000038458442,0.001786768,0.0020699727],"genre_scores_gemma":[0.63911444,0.00017912374,0.3577948,0.00005023982,0.000059487014,0.00013362298,0.000116212286,0.00026126043,0.0022907741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994281,0.00017235396,0.000048261514,0.00008449296,0.00016413744,0.00010258056],"domain_scores_gemma":[0.9966294,0.0016055586,0.0004323326,0.0007746349,0.00036638667,0.00019157621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007781035,0.00084960624,0.0006512959,0.0005955356,0.0007700103,0.00072306965,0.0012700763,0.00049234304,0.002567416],"category_scores_gemma":[0.0038768672,0.00035410706,0.00031809355,0.00065402716,0.00044366845,0.0014759346,0.0008905983,0.0009919098,0.00054474105],"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.000885717,0.00042305718,0.0022854642,0.00019800427,0.000058098398,0.00021115952,0.0004195696,0.51218593,0.124701485,0.008232043,0.003912518,0.3464869],"study_design_scores_gemma":[0.000033251887,0.00013408948,0.0006839532,0.000008923988,0.000022521206,0.00010910156,0.00006845069,0.97402066,0.021520205,0.0014465301,0.0019343048,0.000018007018],"about_ca_topic_score_codex":0.0031695717,"about_ca_topic_score_gemma":0.0051464573,"teacher_disagreement_score":0.0031695717,"about_ca_system_score_codex":0.00053398,"about_ca_system_score_gemma":0.0018800702,"threshold_uncertainty_score":0.0085888505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04485626,0.00034365227,0.9385028,0.00086430676,0.00009223642,0.0002366047,0.000230543,0.00087624555,0.013997358],"genre_scores_gemma":[0.6627898,0.00034347546,0.3272132,0.00038109298,0.00016027897,0.00034363815,0.0004186893,0.00031865298,0.008031041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979109,0.00086530694,0.00006060536,0.00032477494,0.00051755324,0.00032084886],"domain_scores_gemma":[0.9983076,0.00079109316,0.00018525118,0.0002483682,0.00036503057,0.000102637496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034027,0.0008770725,0.0013519543,0.0004600701,0.00047266134,0.0019878726,0.0018530629,0.0016306458,0.0031376819],"category_scores_gemma":[0.006420703,0.00034569472,0.00033905846,0.00093496876,0.0010776992,0.0015610141,0.0014489037,0.0011793352,0.00086470746],"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.00032610394,0.00010229819,0.0009261702,0.00014278738,0.00004007935,0.00016100366,0.00012357159,0.8077558,0.0062584435,0.06950631,0.008791185,0.105866194],"study_design_scores_gemma":[0.000036394762,0.000064520085,0.00018690081,0.0000095107425,0.000004911648,0.00006375824,0.000016113769,0.9820133,0.0017090073,0.014008201,0.0018811151,0.0000063234056],"about_ca_topic_score_codex":0.0030513564,"about_ca_topic_score_gemma":0.0026533082,"teacher_disagreement_score":0.0034027,"about_ca_system_score_codex":0.0017143226,"about_ca_system_score_gemma":0.0019875993,"threshold_uncertainty_score":0.017995358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018690046,0.000086299915,0.9964837,0.00006672418,0.000027109594,0.000037602644,0.000032201242,0.00020518045,0.0011921967],"genre_scores_gemma":[0.05854798,0.00016061499,0.9389907,0.00009246126,0.000026782469,0.00014355194,0.0001298983,0.00005837758,0.001849631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995359,0.00007371984,0.000023346784,0.00008222349,0.00025597753,0.000028840539],"domain_scores_gemma":[0.9995958,0.00015735088,0.00003166133,0.000041160085,0.00015398681,0.000020038526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051121257,0.0006545771,0.000552117,0.00061333505,0.0005769262,0.0007540801,0.0015089256,0.0009908207,0.0032319499],"category_scores_gemma":[0.0017109083,0.00022386265,0.00046648775,0.0008468074,0.0004799432,0.0009150626,0.00060590304,0.0010520081,0.00086918316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013005645,0.00011145406,0.00037655805,0.0001976721,0.00006419855,0.00011743505,0.00008817356,0.44602278,0.021280317,0.065131016,0.0067712967,0.4597091],"study_design_scores_gemma":[0.00002688328,0.000031535725,0.000066399894,0.000007492799,0.000010394708,0.000057055862,0.0000051993743,0.98522055,0.0028438075,0.0065005915,0.0052157487,0.000014369081],"about_ca_topic_score_codex":0.0057828394,"about_ca_topic_score_gemma":0.0052129026,"teacher_disagreement_score":0.0057828394,"about_ca_system_score_codex":0.00083867804,"about_ca_system_score_gemma":0.00111698,"threshold_uncertainty_score":0.011498392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980248,0.000059622056,0.00024396623,0.00015323058,0.0000048287716,0.000018052451,0.00025088922,0.000004009818,0.001240505],"genre_scores_gemma":[0.9976052,0.00013900592,0.00065110705,0.00014045266,0.000015005582,0.00005379171,0.0007081558,0.000004412975,0.0006828197],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973701,0.0013757203,0.00017674715,0.00025007632,0.00066042284,0.00016684081],"domain_scores_gemma":[0.95074815,0.035616707,0.0048623225,0.0019767717,0.00551651,0.0012795047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038469143,0.00017202907,0.00016347718,0.0009984319,0.00074203993,0.0007573239,0.0003928214,0.0007587904,0.0017847219],"category_scores_gemma":[0.023717267,0.00017410169,0.0001870326,0.0019112043,0.0007627538,0.001669805,0.0004983955,0.0011368055,0.00076388934],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017902932,0.0022373318,0.96731,0.00006874146,0.000040536463,0.00018367312,0.0058898446,0.00028368144,0.000948504,0.0016379813,0.0031664236,0.018054204],"study_design_scores_gemma":[0.000020065267,0.00096726173,0.978026,0.000058135913,0.000016954615,0.00044840891,0.011891177,0.0020221302,0.000631563,0.00041225183,0.0054876404,0.000018415261],"about_ca_topic_score_codex":0.001842769,"about_ca_topic_score_gemma":0.0026624128,"teacher_disagreement_score":0.0038469143,"about_ca_system_score_codex":0.0005229653,"about_ca_system_score_gemma":0.00042374377,"threshold_uncertainty_score":0.020344675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013303885,0.00047410457,0.9798615,0.00040741908,0.000085658,0.0001412236,0.00011929546,0.002498986,0.0031079196],"genre_scores_gemma":[0.678422,0.00080300606,0.3148666,0.00032769924,0.000106923384,0.00068491325,0.00040576016,0.0003028186,0.004080253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.00020458126,0.000038780905,0.00006859793,0.0002825853,0.00009013829],"domain_scores_gemma":[0.99914324,0.00030975766,0.0001244437,0.00015127756,0.00019820669,0.00007300355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013396875,0.0007059836,0.0005849723,0.0009307039,0.0006913468,0.0010798748,0.0018556471,0.00086569105,0.0015378351],"category_scores_gemma":[0.0036210096,0.00024084258,0.00041823596,0.000985065,0.0008861008,0.0016420361,0.0022868032,0.0019295877,0.00051300944],"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.00050238066,0.00025510933,0.0012874565,0.0002956683,0.000100689256,0.000499538,0.00030465724,0.48914114,0.046837274,0.16617826,0.016708087,0.27788976],"study_design_scores_gemma":[0.000042191226,0.00014077,0.0001737815,0.000017033797,0.00001966096,0.00016529266,0.0000303932,0.9580778,0.008412238,0.022328679,0.01054735,0.000044868833],"about_ca_topic_score_codex":0.0014739542,"about_ca_topic_score_gemma":0.0014673698,"teacher_disagreement_score":0.0018556471,"about_ca_system_score_codex":0.0010422574,"about_ca_system_score_gemma":0.0013742417,"threshold_uncertainty_score":0.0075621605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050300054,0.00080874393,0.9448051,0.0003786942,0.00011429763,0.0000714005,0.000027529552,0.00030998138,0.0031842436],"genre_scores_gemma":[0.9567167,0.0005570166,0.04034655,0.00005985609,0.00007608292,0.00010597868,0.000030012034,0.000028724851,0.0020789837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.00037554398,0.000047358328,0.00012710349,0.00037182245,0.00010606058],"domain_scores_gemma":[0.99818194,0.0011568355,0.00021143521,0.00013518824,0.00025035528,0.00006427289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021340705,0.0005484037,0.00042799846,0.00059786567,0.00077019853,0.0013675934,0.0012895187,0.0006955164,0.0011192561],"category_scores_gemma":[0.005632628,0.00029178814,0.00028320024,0.0005522946,0.0017976244,0.0022251732,0.0007656501,0.0009942671,0.000100725905],"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.00011976403,0.00007560111,0.00067245984,0.00011077735,0.000037952606,0.00012980477,0.00017285573,0.68303436,0.0081536565,0.27187416,0.0014487172,0.034169883],"study_design_scores_gemma":[0.000018281693,0.000029842497,0.00010726953,0.0000053728963,0.000010273199,0.000025423551,0.000010166856,0.9497159,0.0012422118,0.047749188,0.0010779926,0.000008043496],"about_ca_topic_score_codex":0.0039792694,"about_ca_topic_score_gemma":0.0025629385,"teacher_disagreement_score":0.0039792694,"about_ca_system_score_codex":0.0018864251,"about_ca_system_score_gemma":0.00118122,"threshold_uncertainty_score":0.013687074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44545707,0.001841402,0.5468243,0.0004409549,0.00026258864,0.000115495925,0.00008836289,0.0012733003,0.003696453],"genre_scores_gemma":[0.91378886,0.00041254965,0.08352686,0.00009668095,0.00009379312,0.00003240436,0.000072287934,0.000035261422,0.0019412964],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974555,0.00003228792,0.00002591944,0.000048751488,0.000092250644,0.000055358913],"domain_scores_gemma":[0.9995383,0.00009002524,0.00006276982,0.000115014096,0.00014765876,0.000046282283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045595245,0.00033212488,0.00039444867,0.00041822437,0.00068793836,0.00070934213,0.0010397804,0.00040242402,0.00070026086],"category_scores_gemma":[0.00072957773,0.00020395077,0.00017393113,0.00032881583,0.00031424378,0.0015291804,0.00060741964,0.00078218256,0.00019765599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000710875,0.00022163033,0.0031534962,0.00028443788,0.000063878455,0.00047010666,0.00043509758,0.05954252,0.61289304,0.029283244,0.001932765,0.2910089],"study_design_scores_gemma":[0.000084746374,0.0006209914,0.002951907,0.000037891234,0.00012267094,0.00064208993,0.00028294922,0.6339256,0.3276538,0.013549712,0.020046677,0.000080902966],"about_ca_topic_score_codex":0.00069414073,"about_ca_topic_score_gemma":0.00082322763,"teacher_disagreement_score":0.0010397804,"about_ca_system_score_codex":0.0004904841,"about_ca_system_score_gemma":0.0004056718,"threshold_uncertainty_score":0.003558755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38760647,0.0026535953,0.5732439,0.00032228042,0.0002324164,0.00049046805,0.00024830987,0.018031998,0.017170602],"genre_scores_gemma":[0.969906,0.00045575795,0.027604189,0.00007191812,0.00006988262,0.00006361137,0.0001613407,0.00019309198,0.0014743312],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987766,0.00023547083,0.00006802014,0.00014572719,0.00059290923,0.00018129834],"domain_scores_gemma":[0.99649495,0.0012790762,0.00025536554,0.0006684776,0.0010872255,0.00021497639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009336963,0.00076934794,0.0005862511,0.00080303114,0.0007312789,0.0011652246,0.0015614391,0.00055146037,0.0016045781],"category_scores_gemma":[0.0054187262,0.00020665918,0.00018140167,0.001123184,0.00046592226,0.0014008264,0.0009415102,0.0010690428,0.000296798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023717233,0.0006625509,0.008964682,0.00056745554,0.00015934998,0.001033722,0.00043620254,0.276263,0.36631387,0.016825873,0.008094637,0.31830695],"study_design_scores_gemma":[0.00007296782,0.00029418152,0.0016165694,0.00001734467,0.000060052836,0.0002846564,0.000052911804,0.9402697,0.04861944,0.0047160774,0.0039467835,0.00004928142],"about_ca_topic_score_codex":0.0038215416,"about_ca_topic_score_gemma":0.002004719,"teacher_disagreement_score":0.0038215416,"about_ca_system_score_codex":0.00089447625,"about_ca_system_score_gemma":0.0007907599,"threshold_uncertainty_score":0.0075986385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008899455,0.068483315,0.818419,0.016208338,0.005016116,0.00016080105,0.00044077833,0.00067239424,0.081699796],"genre_scores_gemma":[0.49048895,0.05494223,0.3972572,0.0049924008,0.010304003,0.00085392187,0.0004905286,0.0004677656,0.040202975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889106,0.00032045785,0.00008702225,0.00016982375,0.0004142606,0.000117418276],"domain_scores_gemma":[0.9991665,0.00036287835,0.000119666685,0.000063589905,0.00019704428,0.00009037232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015296253,0.0013828218,0.00094427174,0.0024835486,0.0017845248,0.0034346126,0.0020666244,0.0022696122,0.006998919],"category_scores_gemma":[0.004315989,0.00060658134,0.0008303433,0.004122878,0.0043571205,0.006852823,0.0027883733,0.0038525262,0.0010766874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014764237,0.000014105812,0.000091558904,0.00011352367,0.000008240089,0.000093349525,0.0002153976,0.0038063168,0.00044262165,0.96445316,0.008580002,0.022166898],"study_design_scores_gemma":[0.000014769967,0.000030255322,0.00019449419,0.00018208087,0.00001778176,0.00038991412,0.0001544225,0.025262285,0.00039634304,0.8186713,0.15464965,0.00003671845],"about_ca_topic_score_codex":0.0025569422,"about_ca_topic_score_gemma":0.0013422717,"teacher_disagreement_score":0.006998919,"about_ca_system_score_codex":0.002482872,"about_ca_system_score_gemma":0.0012979462,"threshold_uncertainty_score":0.023413718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01885284,0.0009653415,0.9740108,0.0002434011,0.00008891774,0.00006903865,0.000039953953,0.0006540536,0.0050756196],"genre_scores_gemma":[0.5988497,0.0010161669,0.3967846,0.000191447,0.00015859364,0.00015456934,0.00018518591,0.00011808889,0.0025417488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999265,0.00018078013,0.000041400705,0.00009308018,0.00033321982,0.0000864959],"domain_scores_gemma":[0.9990797,0.0003512543,0.00010375021,0.0001765012,0.000225924,0.00006283042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659792,0.000529455,0.0004215353,0.000584979,0.0006374457,0.0013331764,0.0017183028,0.00067705644,0.0012852834],"category_scores_gemma":[0.0028117185,0.0002475652,0.00026779744,0.00050663354,0.00052794546,0.0016549117,0.00083415303,0.0009100114,0.00041610163],"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.000274662,0.00020493689,0.0012719417,0.00042983438,0.000051918014,0.0002987547,0.00035722647,0.17214085,0.07516893,0.36421254,0.0054410803,0.3801473],"study_design_scores_gemma":[0.0000418122,0.000098029406,0.00029079523,0.00005720001,0.000037170106,0.0002083886,0.00004568322,0.8972074,0.017570175,0.04896987,0.035442222,0.000031277923],"about_ca_topic_score_codex":0.0017380145,"about_ca_topic_score_gemma":0.0012020303,"teacher_disagreement_score":0.0017380145,"about_ca_system_score_codex":0.0008580809,"about_ca_system_score_gemma":0.0009819205,"threshold_uncertainty_score":0.006225884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17400828,0.0030665987,0.814073,0.00045960193,0.00020030116,0.00018967134,0.0000462389,0.0030685163,0.0048878132],"genre_scores_gemma":[0.9517626,0.0005304497,0.045868553,0.00007369563,0.000065618864,0.00006858557,0.000036255944,0.000058973652,0.0015352817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962234,0.00012586362,0.000022278351,0.000042068626,0.00015267104,0.00003477114],"domain_scores_gemma":[0.99937975,0.00026037937,0.00006484186,0.000036831374,0.00021352877,0.00004471113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007682329,0.00040259247,0.00030341337,0.0006164053,0.00049675326,0.0007605216,0.00087325205,0.00030545288,0.00081672875],"category_scores_gemma":[0.002490714,0.00019321687,0.00016750365,0.00029291367,0.000308493,0.0007437649,0.0004008938,0.00053846574,0.00013964034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081601215,0.00037446557,0.005871114,0.00033403604,0.00009714283,0.0005674692,0.00040551444,0.25477695,0.15976773,0.034821596,0.0071242666,0.53504366],"study_design_scores_gemma":[0.00003028542,0.00008571508,0.00081855484,0.000009291643,0.00002950508,0.000116765426,0.000027193642,0.97948074,0.013535226,0.0031477683,0.0027026315,0.000016318947],"about_ca_topic_score_codex":0.0027368353,"about_ca_topic_score_gemma":0.0027668418,"teacher_disagreement_score":0.0027368353,"about_ca_system_score_codex":0.000834706,"about_ca_system_score_gemma":0.00047961276,"threshold_uncertainty_score":0.006056249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13857166,0.00032333256,0.859046,0.0004822086,0.000023812654,0.00007115827,0.000102365244,0.00035930038,0.0010201072],"genre_scores_gemma":[0.85295624,0.00019224467,0.14506495,0.00013605926,0.000050033406,0.00009253965,0.00033472903,0.000084936815,0.0010882862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981997,0.00052990596,0.00009418156,0.00040342793,0.00041169624,0.00036105033],"domain_scores_gemma":[0.9936085,0.0043723835,0.0007912592,0.00039659612,0.00061474385,0.00021659619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014445,0.00093616685,0.0018757997,0.001094679,0.000607395,0.0018044276,0.0016978703,0.0013866052,0.0010556395],"category_scores_gemma":[0.010208475,0.0005686247,0.000629957,0.0013296437,0.001223971,0.0028565123,0.0011159052,0.0017749107,0.00022540365],"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.00015740441,0.000089804016,0.00085789716,0.000032437594,0.000014942689,0.000019518924,0.000042074964,0.9620225,0.0017538719,0.0048975297,0.00048311742,0.02962892],"study_design_scores_gemma":[0.0000044389158,0.000007967533,0.00006606555,0.0000013170755,0.0000014829845,0.0000027737683,0.0000053080475,0.9973272,0.0002741555,0.0022805922,0.000026400638,0.0000022068755],"about_ca_topic_score_codex":0.0070935,"about_ca_topic_score_gemma":0.004467729,"teacher_disagreement_score":0.0070935,"about_ca_system_score_codex":0.0038736258,"about_ca_system_score_gemma":0.0015204491,"threshold_uncertainty_score":0.028105319},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72623295,0.0037139524,0.24858862,0.0027297086,0.00017593658,0.00006008424,0.000063717576,0.0005894174,0.017845655],"genre_scores_gemma":[0.99248415,0.00034507355,0.0062820846,0.00006227335,0.000051246992,0.000013985159,0.000012850662,0.00006153242,0.0006868523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974171,0.0015899469,0.000055215445,0.0002461383,0.00039795216,0.00029363926],"domain_scores_gemma":[0.9595088,0.035584655,0.0017130157,0.0013962386,0.0010620352,0.000735281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068802843,0.0008155276,0.0012881358,0.0008974509,0.0009791958,0.0021749774,0.0013874447,0.0011110901,0.0028429085],"category_scores_gemma":[0.04361336,0.0003701063,0.0003672638,0.0011644047,0.002557014,0.0040402566,0.0017717227,0.0013498039,0.00019715927],"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.00043060846,0.00008763071,0.0018442178,0.00013461815,0.000052058847,0.000112143076,0.00010887674,0.93585205,0.00541698,0.036695335,0.0005199898,0.018745454],"study_design_scores_gemma":[0.000017910677,0.0001615963,0.0005037578,0.0000147723285,0.00003236059,0.00005399939,0.00009631354,0.98029673,0.0020539588,0.016544659,0.00020732403,0.000016615993],"about_ca_topic_score_codex":0.0012940291,"about_ca_topic_score_gemma":0.0011056872,"teacher_disagreement_score":0.0068802843,"about_ca_system_score_codex":0.0019587202,"about_ca_system_score_gemma":0.00085730257,"threshold_uncertainty_score":0.036386847},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022610279,0.004613323,0.9392132,0.0012469771,0.0014673938,0.0018279697,0.00050288736,0.0053776945,0.023140278],"genre_scores_gemma":[0.42539805,0.005314608,0.52782065,0.0009840778,0.0009194917,0.002287889,0.0018460482,0.0004685907,0.034960542],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989171,0.0002590262,0.00009440452,0.00013395648,0.0004397312,0.00015570804],"domain_scores_gemma":[0.99910045,0.00015121093,0.000108746885,0.00017286825,0.00035966563,0.00010707542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357111,0.00055998575,0.0007027153,0.00092432485,0.0010861512,0.0018149327,0.0019482593,0.00091325736,0.0046575186],"category_scores_gemma":[0.0016469031,0.000263082,0.0004128676,0.0011957164,0.0010903203,0.002956393,0.0013013466,0.0013777909,0.00178188],"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.0010943849,0.00042831578,0.0014165614,0.0012801429,0.00017891309,0.0012104831,0.0005482259,0.012047669,0.10912929,0.4008425,0.05329635,0.41852722],"study_design_scores_gemma":[0.00066080247,0.0016400204,0.0012532171,0.00020595422,0.00049843465,0.004105002,0.00026892254,0.1574534,0.1530661,0.05251343,0.6279729,0.00036180718],"about_ca_topic_score_codex":0.0009417475,"about_ca_topic_score_gemma":0.000975983,"teacher_disagreement_score":0.0046575186,"about_ca_system_score_codex":0.00097336853,"about_ca_system_score_gemma":0.0017724878,"threshold_uncertainty_score":0.015580893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87642866,0.004405999,0.022694474,0.004001624,0.00017867686,0.00026889495,0.001019982,0.00075341214,0.09024837],"genre_scores_gemma":[0.95186025,0.005804634,0.019083051,0.0012754635,0.00009140114,0.000120581295,0.0017410557,0.0004835765,0.01954003],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.990444,0.004484282,0.0005314587,0.0006162407,0.0032273713,0.00069671444],"domain_scores_gemma":[0.9712725,0.011115937,0.0015510997,0.0032171623,0.011000774,0.0018425386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00907688,0.00044394154,0.00029050742,0.0009393391,0.0017375147,0.0025613653,0.0014582278,0.0009923985,0.005262984],"category_scores_gemma":[0.035673376,0.00031604918,0.00025874694,0.0023906776,0.0013347416,0.0024836229,0.0014730948,0.00134239,0.0017319361],"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.00088851445,0.0026548728,0.09523879,0.0012711115,0.00016474178,0.0010158467,0.04272335,0.0066898824,0.012501588,0.008503318,0.028406065,0.7999419],"study_design_scores_gemma":[0.0001268872,0.008088234,0.12918608,0.0013969571,0.00031584027,0.0032929508,0.06344509,0.009035089,0.0366945,0.0030997195,0.7450599,0.00025879435],"about_ca_topic_score_codex":0.0073104664,"about_ca_topic_score_gemma":0.008372607,"teacher_disagreement_score":0.00907688,"about_ca_system_score_codex":0.0014881081,"about_ca_system_score_gemma":0.0022199189,"threshold_uncertainty_score":0.048003674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159915,0.00054039486,0.17065072,0.00038366907,0.000099079334,0.0007487105,0.00034949344,0.0011304921,0.010105958],"genre_scores_gemma":[0.9813803,0.00010539521,0.01765727,0.000021680282,0.0000061856063,0.00022472457,0.000085902364,0.00002778525,0.00049071864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990257,0.00033774012,0.000053326698,0.000078525314,0.0003649331,0.00013979292],"domain_scores_gemma":[0.99613625,0.0022650468,0.0002896311,0.0002519401,0.0009060481,0.00015102496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023247313,0.00065039145,0.0006681278,0.00061264564,0.0003703742,0.00055927684,0.000980869,0.00076939154,0.0013637033],"category_scores_gemma":[0.0052482137,0.00024369873,0.00031095717,0.00053712045,0.0006850694,0.0010252784,0.00040752435,0.0005671859,0.0001499948],"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.00013430162,0.00012921143,0.0011554911,0.000072259914,0.000024973857,0.000060663242,0.000032270837,0.9882235,0.0026819422,0.0010382099,0.00025762938,0.0061895926],"study_design_scores_gemma":[0.000039005878,0.00015142566,0.00016610946,0.0000037694101,0.000009254968,0.000010969771,0.0000116120955,0.997537,0.0017056448,0.00020742565,0.00015307887,0.000004732871],"about_ca_topic_score_codex":0.00730518,"about_ca_topic_score_gemma":0.0034442327,"teacher_disagreement_score":0.00730518,"about_ca_system_score_codex":0.0012830892,"about_ca_system_score_gemma":0.0013169898,"threshold_uncertainty_score":0.014525294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030958721,0.00068658433,0.9562569,0.0005649665,0.00037042066,0.0004195509,0.00013720102,0.0028693024,0.0077363267],"genre_scores_gemma":[0.8788767,0.00029009138,0.11443738,0.0003149765,0.00016913959,0.0003255851,0.00013408401,0.000111327376,0.0053408635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799675,0.0006036705,0.00011452763,0.00026355518,0.0006838304,0.00033760487],"domain_scores_gemma":[0.99807334,0.00058997865,0.00029016277,0.00029173132,0.0005794361,0.00017536167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00304189,0.0008036233,0.00089992094,0.0012307229,0.0009454893,0.0014281063,0.0045568617,0.0013452511,0.0022385675],"category_scores_gemma":[0.00559291,0.00034948625,0.00050612673,0.00073448924,0.0008609249,0.0015839399,0.0018839334,0.0011834512,0.00040626296],"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.0009828175,0.00073213124,0.0025488858,0.0006471655,0.00020862804,0.0005815611,0.0003460717,0.41181666,0.040794495,0.19668502,0.029407063,0.31524947],"study_design_scores_gemma":[0.00009061394,0.00019806992,0.00028246827,0.000018689047,0.00004518544,0.00016791357,0.000023087885,0.97487825,0.005104122,0.010805627,0.008342213,0.000043804],"about_ca_topic_score_codex":0.00261515,"about_ca_topic_score_gemma":0.0018990339,"teacher_disagreement_score":0.0045568617,"about_ca_system_score_codex":0.0015155807,"about_ca_system_score_gemma":0.0016445834,"threshold_uncertainty_score":0.016087234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46605283,0.00812367,0.5086542,0.0008168456,0.00019876359,0.00018352289,0.00022689321,0.0012499079,0.014493378],"genre_scores_gemma":[0.9469294,0.00114536,0.05076891,0.00006761785,0.000113374525,0.000059382673,0.00017983136,0.00009926137,0.0006368468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652725,0.0016369935,0.00013163945,0.00023791178,0.001225086,0.00024109022],"domain_scores_gemma":[0.98441386,0.012502002,0.0007609045,0.0008496101,0.0013373025,0.00013633123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004366628,0.00072640687,0.0005913501,0.0010913018,0.00056326744,0.001144554,0.0009914398,0.0009674942,0.0015678604],"category_scores_gemma":[0.024470665,0.00025444443,0.00039262915,0.0012881885,0.00081680575,0.0026110054,0.00048534895,0.0007462899,0.00021216576],"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.0009966993,0.00034995365,0.0064466093,0.00057538884,0.00020942863,0.00013269404,0.00022173846,0.70652425,0.031178495,0.08115033,0.002456531,0.16975781],"study_design_scores_gemma":[0.000028587832,0.00028378417,0.0009483395,0.0000231633,0.000026581103,0.00013969697,0.00003173012,0.97691876,0.008825106,0.011106267,0.0016540762,0.000013831095],"about_ca_topic_score_codex":0.00090176455,"about_ca_topic_score_gemma":0.00033652762,"teacher_disagreement_score":0.004366628,"about_ca_system_score_codex":0.0013816891,"about_ca_system_score_gemma":0.00055315153,"threshold_uncertainty_score":0.023093164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560346,0.00052787265,0.033996217,0.0028506187,0.00013863388,0.00029132457,0.00046250096,0.0006555897,0.005042608],"genre_scores_gemma":[0.9793646,0.00024777412,0.01870153,0.0003158826,0.00010767431,0.00006343969,0.00021055447,0.000083691375,0.0009049313],"study_design_codex":"case_report","study_design_gemma":"observational","domain_scores_codex":[0.99533266,0.0016122895,0.0003482067,0.0006950695,0.0014487706,0.0005629566],"domain_scores_gemma":[0.9713041,0.020803442,0.0021509393,0.0016803439,0.0023278038,0.0017334176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029111125,0.0015089852,0.0006422642,0.0017579435,0.003335122,0.001995057,0.002769327,0.006619289,0.0014146657],"category_scores_gemma":[0.025671598,0.0007230579,0.00081989536,0.0017672704,0.0021075536,0.002238788,0.001355605,0.002977097,0.00033943687],"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.0024763853,0.006286133,0.17522608,0.001260015,0.000474473,0.50391376,0.010484235,0.14645249,0.023659548,0.014386536,0.016882688,0.09849774],"study_design_scores_gemma":[0.00084576604,0.003078274,0.04772185,0.0005000376,0.00048359876,0.27495712,0.014851465,0.5613693,0.058084555,0.01436346,0.023334472,0.00041006814],"about_ca_topic_score_codex":0.007352947,"about_ca_topic_score_gemma":0.0075995373,"teacher_disagreement_score":0.007352947,"about_ca_system_score_codex":0.0017965304,"about_ca_system_score_gemma":0.0011863173,"threshold_uncertainty_score":0.015395582},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55992407,0.006022305,0.40807456,0.001374482,0.00037494325,0.00037271422,0.00017784846,0.0011854359,0.022493599],"genre_scores_gemma":[0.98349875,0.00045448117,0.015195392,0.000055966113,0.000046377943,0.000039306695,0.000022578848,0.000021803966,0.0006653551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949957,0.0017125257,0.00022583867,0.0004622144,0.0017587957,0.00084496016],"domain_scores_gemma":[0.9838742,0.010286328,0.0018113453,0.0011971669,0.0022213797,0.00060947007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004987977,0.0010525455,0.0011897541,0.0017801668,0.0010139555,0.002282078,0.0019082996,0.0015933188,0.0021346798],"category_scores_gemma":[0.018707227,0.0003482669,0.0004622346,0.0009284436,0.0014978816,0.0037093863,0.0015995831,0.00088956405,0.00021363686],"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.001814048,0.0005233524,0.0057734787,0.0005949277,0.00022480059,0.0004112089,0.00037571014,0.6546703,0.016295005,0.07128552,0.0029907485,0.24504091],"study_design_scores_gemma":[0.000076997145,0.0007443865,0.0006965144,0.00005168451,0.000096353695,0.00024928976,0.00015691305,0.9691542,0.013978222,0.01326397,0.0014746222,0.000056926372],"about_ca_topic_score_codex":0.0017124596,"about_ca_topic_score_gemma":0.00058653334,"teacher_disagreement_score":0.004987977,"about_ca_system_score_codex":0.0017425192,"about_ca_system_score_gemma":0.0018025682,"threshold_uncertainty_score":0.026379228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006313568,0.003957601,0.97996473,0.0005229289,0.0007784158,0.0001642826,0.00013364694,0.0010191238,0.007145652],"genre_scores_gemma":[0.42171183,0.004621819,0.5557676,0.0006233324,0.0009011285,0.0005065407,0.00053907145,0.00017427356,0.015154394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871564,0.0002729088,0.00010644682,0.00024827878,0.0005170352,0.00013967665],"domain_scores_gemma":[0.99878126,0.00039533724,0.00015484774,0.00019344545,0.00034167088,0.00013338224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017664303,0.0008660937,0.0010305945,0.0009233169,0.0009814682,0.0021645608,0.0028452317,0.0008714811,0.002428451],"category_scores_gemma":[0.0026564416,0.00031243527,0.0003207325,0.0010205538,0.0004874218,0.0024594269,0.0014306695,0.0013162555,0.00076641294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042797212,0.00035544622,0.00089197647,0.00079857337,0.00016211336,0.00045406408,0.00022227508,0.14663254,0.03437537,0.22645803,0.02511588,0.5641058],"study_design_scores_gemma":[0.000106528656,0.00027007805,0.00036496835,0.00005471934,0.000078892845,0.00050932897,0.00006780032,0.8465357,0.014864,0.058634587,0.07844714,0.000066404915],"about_ca_topic_score_codex":0.0008074324,"about_ca_topic_score_gemma":0.0014141378,"teacher_disagreement_score":0.0028452317,"about_ca_system_score_codex":0.0011571021,"about_ca_system_score_gemma":0.0012850313,"threshold_uncertainty_score":0.009341896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7960294,0.0004008745,0.2022862,0.00008672302,0.000017590073,0.000035454734,0.000015404998,0.00019069015,0.00093773386],"genre_scores_gemma":[0.9910796,0.000079446436,0.0086885085,0.000006065894,0.000008724647,0.0000057671455,0.000008447312,0.000007717935,0.000115704504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992343,0.00034102617,0.000028839648,0.00007381155,0.0002003576,0.00012162064],"domain_scores_gemma":[0.9980135,0.0012958661,0.00022189031,0.00012094679,0.00028529536,0.000062546635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013158676,0.00029785535,0.00029718535,0.0007071071,0.00040169427,0.00045444953,0.00043336785,0.00043902776,0.00024165129],"category_scores_gemma":[0.005107614,0.00018619842,0.00016548196,0.0007399353,0.00058039423,0.000761126,0.00021324428,0.00030623228,0.0000548775],"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.0007440688,0.00012333259,0.009680311,0.00009556944,0.000045370572,0.00029334915,0.0003389564,0.7842564,0.09113045,0.011805884,0.0003226964,0.10116363],"study_design_scores_gemma":[0.00000719111,0.00007422095,0.0020858673,0.0000036529138,0.000013866887,0.000049587725,0.00003660448,0.98791224,0.007854804,0.0017706224,0.00018104234,0.000010219966],"about_ca_topic_score_codex":0.0032072468,"about_ca_topic_score_gemma":0.0020156049,"teacher_disagreement_score":0.0032072468,"about_ca_system_score_codex":0.0007995585,"about_ca_system_score_gemma":0.00042289754,"threshold_uncertainty_score":0.006959021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059687212,0.002117995,0.92796123,0.0007427672,0.0002466712,0.00017102716,0.000049667993,0.0020173702,0.007005987],"genre_scores_gemma":[0.797969,0.0009464351,0.19767076,0.00021259616,0.00021258864,0.00017526216,0.0000897747,0.00012847963,0.0025951534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984042,0.0004144826,0.00007087513,0.00010731219,0.000899222,0.000103955506],"domain_scores_gemma":[0.9966466,0.0012504128,0.00044787218,0.0007558352,0.0008226459,0.0000765964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019277658,0.00042829316,0.0003573818,0.00046212843,0.0005313129,0.00085081335,0.0010472124,0.00056332326,0.0019547718],"category_scores_gemma":[0.0077126566,0.00020749694,0.0001984633,0.00039826962,0.00050678616,0.00164321,0.00074879575,0.0010885213,0.00046616347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006545114,0.00028772178,0.0019099092,0.0006431176,0.000077848665,0.00025684832,0.00031907696,0.15844223,0.18275686,0.10293063,0.009065473,0.5426557],"study_design_scores_gemma":[0.00009129911,0.00060031994,0.00090046966,0.00009127578,0.00007905771,0.0004747047,0.00005386848,0.8796075,0.062226173,0.030557932,0.025257234,0.000060201553],"about_ca_topic_score_codex":0.0004054132,"about_ca_topic_score_gemma":0.00037673573,"teacher_disagreement_score":0.0019547718,"about_ca_system_score_codex":0.0006105097,"about_ca_system_score_gemma":0.0005396501,"threshold_uncertainty_score":0.010195136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026401294,0.000079725076,0.97211367,0.000107982894,0.000012317594,0.000048101585,0.000044174736,0.00032977172,0.0008628887],"genre_scores_gemma":[0.725358,0.00010612484,0.2733152,0.00006060152,0.000020022302,0.00013473917,0.000078382625,0.000040534662,0.00088635954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835473,0.0007643022,0.000052966712,0.00025183026,0.0004994713,0.00007660609],"domain_scores_gemma":[0.9958204,0.0025986356,0.0005771607,0.0006665367,0.00025966586,0.000077633435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019505668,0.00056691054,0.00079289376,0.00076310395,0.00046255594,0.0009775199,0.0010123213,0.00097487005,0.00063989084],"category_scores_gemma":[0.010967576,0.0003266646,0.0004610867,0.0009501111,0.0011719218,0.0019772113,0.0014894372,0.0009230442,0.00016103889],"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.00034898205,0.000112544694,0.0056189904,0.00013031792,0.00007837354,0.00042660948,0.0002444174,0.8299327,0.020043468,0.056343507,0.00084857614,0.08587149],"study_design_scores_gemma":[0.000021671669,0.000059045655,0.0005579481,0.000005635677,0.000008732455,0.00015527583,0.000027052773,0.97233677,0.0070377914,0.019219827,0.00055685855,0.000013317638],"about_ca_topic_score_codex":0.00067064445,"about_ca_topic_score_gemma":0.000800421,"teacher_disagreement_score":0.0019505668,"about_ca_system_score_codex":0.00066277356,"about_ca_system_score_gemma":0.0007666956,"threshold_uncertainty_score":0.010315657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05576533,0.0053753913,0.89896613,0.0025563661,0.00044856654,0.000115369316,0.000080118494,0.00013206775,0.036560617],"genre_scores_gemma":[0.912104,0.005729443,0.07223254,0.00073027937,0.0014175187,0.00024403415,0.000055959918,0.00012082271,0.007365368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962842,0.0018793417,0.00010139845,0.00027116382,0.001061203,0.00040271846],"domain_scores_gemma":[0.98331773,0.012733773,0.00081570237,0.0009818946,0.0017591268,0.00039167685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005137595,0.0006544268,0.0009152871,0.00082777935,0.0014670995,0.0022664496,0.0015163948,0.0012311091,0.0030919958],"category_scores_gemma":[0.02262367,0.00032329684,0.00055146567,0.0012834937,0.0030537418,0.0053025964,0.0019851536,0.0018432663,0.00041181137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083922314,0.00003133024,0.000537021,0.000067465124,0.000020457519,0.00015745056,0.00030600931,0.1195146,0.0010125632,0.8634585,0.000956561,0.013854176],"study_design_scores_gemma":[0.0000309058,0.000083672865,0.0003565063,0.000069857044,0.000025812325,0.00010157115,0.000076502525,0.44941384,0.0011278926,0.5399314,0.008752712,0.000029374683],"about_ca_topic_score_codex":0.0034568547,"about_ca_topic_score_gemma":0.0011230685,"teacher_disagreement_score":0.005137595,"about_ca_system_score_codex":0.002249969,"about_ca_system_score_gemma":0.0015702836,"threshold_uncertainty_score":0.027170539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12975472,0.0049078637,0.84185636,0.0012401023,0.0002932829,0.00012426282,0.00027681777,0.0005370478,0.021009592],"genre_scores_gemma":[0.9509796,0.0016273374,0.044034187,0.00019182576,0.00017858176,0.00011804131,0.00010216374,0.0001301286,0.0026382033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757355,0.0003255025,0.00012334633,0.00041873925,0.0008759173,0.0006829351],"domain_scores_gemma":[0.9804135,0.013852922,0.0013823849,0.0013245416,0.0021477896,0.0008788523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047487,0.001056314,0.001240692,0.0017407252,0.0011792926,0.0033946503,0.0026625798,0.0014154346,0.004547661],"category_scores_gemma":[0.021502241,0.00070228014,0.00058896566,0.0013770951,0.0019837155,0.003407446,0.0024223432,0.0021306877,0.00045857797],"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.0007558272,0.00011135137,0.001004432,0.00044367238,0.00009252515,0.00026508697,0.00041743746,0.53424436,0.017340135,0.4028017,0.0027483,0.03977516],"study_design_scores_gemma":[0.000059214595,0.00019241068,0.00026944748,0.00007269017,0.00004551933,0.00014657849,0.000059503072,0.9143706,0.003959141,0.07886263,0.0019210778,0.00004107782],"about_ca_topic_score_codex":0.0027659815,"about_ca_topic_score_gemma":0.0012433348,"teacher_disagreement_score":0.005047487,"about_ca_system_score_codex":0.0046879104,"about_ca_system_score_gemma":0.0023376867,"threshold_uncertainty_score":0.03401327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95668817,0.0011924703,0.037036885,0.00034148525,0.00011789704,0.000035989982,0.000043527038,0.00058428675,0.003959323],"genre_scores_gemma":[0.99696845,0.00015761044,0.0024707639,0.000033018452,0.00001609128,0.0000038481753,0.000010724655,0.000016427564,0.00032306826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897194,0.0003608885,0.000045428224,0.000107574,0.0003038644,0.00021038858],"domain_scores_gemma":[0.99167246,0.005978109,0.0007305361,0.0007209184,0.0007677317,0.00013021966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010514491,0.00058170565,0.0003463003,0.00041974112,0.00050308835,0.00061979704,0.00049820077,0.0005920053,0.00078724424],"category_scores_gemma":[0.008358955,0.0001750405,0.00022443135,0.0005061011,0.0007087931,0.0008631924,0.0005860592,0.0007397848,0.00008005746],"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.0028551286,0.0003120294,0.017873593,0.00028980925,0.00017963092,0.001545474,0.00042907093,0.78170425,0.087469056,0.0067318124,0.0010111788,0.099599004],"study_design_scores_gemma":[0.00004737141,0.0006784354,0.005947617,0.00002765309,0.000119621924,0.00042524672,0.000124098,0.9249241,0.065136366,0.0012883426,0.0012428088,0.00003838669],"about_ca_topic_score_codex":0.0045601293,"about_ca_topic_score_gemma":0.0031206727,"teacher_disagreement_score":0.0045601293,"about_ca_system_score_codex":0.00069659133,"about_ca_system_score_gemma":0.0006177385,"threshold_uncertainty_score":0.009067178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060749985,0.0012486259,0.9646551,0.0014558375,0.0001780323,0.00010329515,0.00036879067,0.00024424685,0.025671024],"genre_scores_gemma":[0.6312318,0.007932187,0.30739138,0.00094190985,0.0010451357,0.0012544763,0.0011141339,0.00033733324,0.04875174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.0002002305,0.000037855814,0.000097880664,0.00038060578,0.00006845409],"domain_scores_gemma":[0.99889565,0.00054224825,0.00015168556,0.00009360247,0.00028104038,0.000035697914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008521333,0.00091206003,0.00051893893,0.0010079074,0.0006628686,0.0017869642,0.0017472284,0.0016169694,0.004564664],"category_scores_gemma":[0.003944361,0.0003674694,0.0006028624,0.0011722444,0.0010670633,0.0029026056,0.00088306225,0.0022808143,0.0016808873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021152455,0.000042741773,0.00021131175,0.00008664636,0.000011097324,0.0002411029,0.00017555052,0.24719042,0.0024888853,0.7350869,0.0044394047,0.010004801],"study_design_scores_gemma":[0.000008377052,0.000021722844,0.000053508033,0.000019166175,0.000006773703,0.000098726836,0.000019393525,0.9007882,0.0002878538,0.09153204,0.0071519637,0.000012322737],"about_ca_topic_score_codex":0.0042127385,"about_ca_topic_score_gemma":0.0016175583,"teacher_disagreement_score":0.004564664,"about_ca_system_score_codex":0.0014511164,"about_ca_system_score_gemma":0.0012759264,"threshold_uncertainty_score":0.015270352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15609545,0.00019819266,0.82541203,0.00017636735,0.00011205673,0.00025992945,0.00050272385,0.0025570593,0.014686295],"genre_scores_gemma":[0.8258915,0.00018776156,0.16448514,0.00008675546,0.000030312918,0.00044551436,0.00044726869,0.00009782462,0.008327953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996344,0.000088015055,0.000016375465,0.000045977275,0.00016547723,0.000049818645],"domain_scores_gemma":[0.999508,0.00026221754,0.00003001559,0.00006949519,0.0000982326,0.000032058866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048063774,0.0004362011,0.00056530343,0.00049337756,0.00032606474,0.0008499488,0.0010832207,0.0008172765,0.003076797],"category_scores_gemma":[0.0010005845,0.00024940082,0.00048280697,0.00041756072,0.0003965283,0.0008175638,0.00078892417,0.00052224897,0.00037594093],"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.00009964667,0.00007294228,0.0006928377,0.000030709158,0.00002146318,0.00004503282,0.000029181936,0.9740301,0.0038064579,0.0062942337,0.0004922114,0.014385128],"study_design_scores_gemma":[0.000010923202,0.000019096586,0.000069223206,0.0000010398078,0.0000026016212,0.000007000222,0.0000025654447,0.9971937,0.0011030039,0.0010457652,0.0005416559,0.0000033412932],"about_ca_topic_score_codex":0.006257217,"about_ca_topic_score_gemma":0.0026618608,"teacher_disagreement_score":0.006257217,"about_ca_system_score_codex":0.0005659075,"about_ca_system_score_gemma":0.00070620433,"threshold_uncertainty_score":0.0124415755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896662,0.00016320663,0.0064761247,0.00005170943,0.000028252536,0.000022695967,0.00009026889,0.00010870123,0.0033928922],"genre_scores_gemma":[0.99828833,0.00007989428,0.0011581378,0.000013439938,0.000008423197,0.000010307254,0.00008416849,0.000026241196,0.00033106512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931633,0.00023405485,0.000032202606,0.000085724205,0.00019551333,0.00013621294],"domain_scores_gemma":[0.9842753,0.012426738,0.0010539669,0.0010223667,0.0008903517,0.00033131742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092088856,0.00046465354,0.0002852967,0.000700626,0.0004470665,0.00079395185,0.00050038024,0.00046418936,0.0017412058],"category_scores_gemma":[0.012201671,0.00024023962,0.00023184817,0.00080759247,0.0008242355,0.0009576118,0.00055457954,0.0006460733,0.00019963413],"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.004140625,0.001412895,0.08296224,0.00025882066,0.00012383149,0.0017300969,0.0006104187,0.45161346,0.32760912,0.010105318,0.00097584305,0.11845726],"study_design_scores_gemma":[0.00017227797,0.003589748,0.13046208,0.00009806055,0.00026684947,0.0015877441,0.0012874576,0.41758886,0.43325084,0.007651026,0.0038932208,0.0001518047],"about_ca_topic_score_codex":0.0011855373,"about_ca_topic_score_gemma":0.00082892744,"teacher_disagreement_score":0.0017412058,"about_ca_system_score_codex":0.00042816642,"about_ca_system_score_gemma":0.0003087331,"threshold_uncertainty_score":0.0058249235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014707667,0.0035957564,0.972463,0.00069293263,0.0003935313,0.000073813484,0.000052225518,0.00045660837,0.0075644567],"genre_scores_gemma":[0.7440038,0.0059023593,0.24082075,0.00042419977,0.0015258709,0.00027118687,0.00012372543,0.000056820496,0.0068713254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999298,0.00019046896,0.000037218586,0.00012437435,0.0002555269,0.00009447537],"domain_scores_gemma":[0.99956053,0.0002057767,0.000053119165,0.00005189074,0.000097642696,0.000031068404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010855751,0.0004877158,0.0003936865,0.00046948486,0.0007426143,0.0015828491,0.0010784196,0.0009837764,0.0015163587],"category_scores_gemma":[0.0021016463,0.00020559867,0.00030628336,0.00059120636,0.0014219169,0.0018377142,0.0006385515,0.0010627867,0.0002801741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095885174,0.00008401081,0.0003504452,0.00015766922,0.000018861618,0.0001244334,0.00015959534,0.18706961,0.0114288265,0.6539283,0.003466003,0.14311633],"study_design_scores_gemma":[0.000053764852,0.000115190756,0.0002438185,0.00004048083,0.000026609314,0.000057271536,0.00002367519,0.64931464,0.005925225,0.32898164,0.0151882805,0.000029522726],"about_ca_topic_score_codex":0.002215307,"about_ca_topic_score_gemma":0.0010688758,"teacher_disagreement_score":0.002215307,"about_ca_system_score_codex":0.0007498072,"about_ca_system_score_gemma":0.00090470485,"threshold_uncertainty_score":0.005741179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059983495,0.00022032544,0.99714655,0.00019881163,0.0000362842,0.000010450048,0.000027434213,0.000050195264,0.0017100822],"genre_scores_gemma":[0.48515356,0.0037100571,0.49695727,0.00074539275,0.001418829,0.000419808,0.000382855,0.0002486009,0.010963672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978568,0.00073686556,0.00012525167,0.00044834206,0.0006732758,0.00015950082],"domain_scores_gemma":[0.9971884,0.0019246464,0.00022074103,0.0002572448,0.00035548193,0.00005359415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024815518,0.0014009578,0.0013165872,0.0015494225,0.0007915281,0.0030515783,0.0019843914,0.0014301083,0.0041047996],"category_scores_gemma":[0.0070615783,0.0007021697,0.0014624741,0.0014258233,0.0023720304,0.004700663,0.0022259133,0.0035129252,0.0008329168],"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.000021834892,0.00003133448,0.00038238394,0.00013546381,0.00006383023,0.000104622435,0.00016145837,0.36561513,0.0010595093,0.6093246,0.0013083168,0.021791635],"study_design_scores_gemma":[0.0000059934814,0.000029277624,0.0001053178,0.00002779343,0.00002096318,0.000053243435,0.000038545168,0.7122641,0.0006020222,0.28149265,0.005333141,0.000026916101],"about_ca_topic_score_codex":0.0036011075,"about_ca_topic_score_gemma":0.0017853999,"teacher_disagreement_score":0.0041047996,"about_ca_system_score_codex":0.001937043,"about_ca_system_score_gemma":0.0015997476,"threshold_uncertainty_score":0.014054298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127440775,0.0005642609,0.9789819,0.00021797701,0.0001166501,0.00005051935,0.000031821553,0.00023901652,0.007053726],"genre_scores_gemma":[0.9030592,0.0010088759,0.08656029,0.00014717472,0.0001939265,0.0001846599,0.000078667406,0.00005590967,0.00871134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990588,0.00026845545,0.000036101053,0.00012919497,0.00039640235,0.00011113071],"domain_scores_gemma":[0.9985965,0.00061478536,0.00017252847,0.0002311098,0.00031258215,0.000072492665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012322693,0.0005082437,0.00042278165,0.0004863785,0.0004877771,0.0012559869,0.0009274619,0.0007733967,0.005527369],"category_scores_gemma":[0.0043602763,0.00019871345,0.0003698977,0.00050395844,0.0012986177,0.002682099,0.0013022746,0.0015945642,0.0004465043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116953284,0.000065369524,0.0002616744,0.00009072994,0.0000211903,0.000050731094,0.00013688202,0.26411217,0.0046982486,0.6615006,0.002503435,0.066442005],"study_design_scores_gemma":[0.00003069623,0.000090598965,0.00009207021,0.000016560922,0.000009907026,0.000029582896,0.00002390513,0.7691332,0.0014766088,0.22385089,0.0052292193,0.000016840724],"about_ca_topic_score_codex":0.0010388601,"about_ca_topic_score_gemma":0.0005573462,"teacher_disagreement_score":0.005527369,"about_ca_system_score_codex":0.0009978295,"about_ca_system_score_gemma":0.00065046246,"threshold_uncertainty_score":0.01849091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35930508,0.0017548255,0.6275517,0.0003715876,0.00023469096,0.0002840725,0.00009327806,0.0070074103,0.0033974429],"genre_scores_gemma":[0.92812383,0.0003115225,0.07012222,0.00010782925,0.000117236115,0.00010063855,0.000063615684,0.000105866544,0.0009470387],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990075,0.00025184403,0.00013141926,0.00018704326,0.00029515522,0.00012705503],"domain_scores_gemma":[0.9950982,0.0020336919,0.00086083286,0.0006117518,0.0012270787,0.00016845249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017873072,0.0011055666,0.00060433144,0.0012136127,0.00045135512,0.0006762381,0.0012450092,0.0005856524,0.0009705792],"category_scores_gemma":[0.007484505,0.0002540641,0.0002076636,0.0002834374,0.0003260445,0.0010314913,0.0004968989,0.00066530623,0.0004946836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015460184,0.0007656189,0.009445904,0.00046815543,0.0001299324,0.00046362838,0.0007530974,0.08775189,0.5913524,0.005428821,0.003558773,0.29833573],"study_design_scores_gemma":[0.00016855047,0.00091006013,0.0044208243,0.00004990812,0.00020973464,0.0007033882,0.00012838979,0.6519884,0.33423665,0.0016562169,0.005410768,0.00011711314],"about_ca_topic_score_codex":0.000531778,"about_ca_topic_score_gemma":0.0006184764,"teacher_disagreement_score":0.0017873072,"about_ca_system_score_codex":0.00034604935,"about_ca_system_score_gemma":0.0006163242,"threshold_uncertainty_score":0.009452283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20458272,0.0018201716,0.78977174,0.00026135377,0.00010619069,0.00019053844,0.000051787272,0.0011757695,0.00203974],"genre_scores_gemma":[0.9573218,0.00042186558,0.041277546,0.000023659784,0.000053310927,0.00006131183,0.000040031176,0.000042410862,0.000757945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.00013342113,0.000034248813,0.000035051875,0.0001895729,0.00005591736],"domain_scores_gemma":[0.9991333,0.0003992163,0.00013972762,0.00008068387,0.00020115673,0.00004598324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011346105,0.00040944526,0.00034091278,0.0006366104,0.00050209207,0.00055450446,0.0007850062,0.0002265592,0.0005031746],"category_scores_gemma":[0.0035508738,0.0002020329,0.00013843414,0.00035179476,0.00045987914,0.0008368005,0.0004102319,0.00043459443,0.00008130055],"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.0008274671,0.00016542306,0.0038199602,0.00028795813,0.00010803981,0.00043946385,0.00040046067,0.565026,0.14817278,0.020018443,0.002777011,0.257957],"study_design_scores_gemma":[0.000027533766,0.00013913219,0.00074229843,0.000007656197,0.00002819674,0.000059728773,0.000018732202,0.983512,0.010872035,0.00341083,0.0011681218,0.000013682885],"about_ca_topic_score_codex":0.0025044468,"about_ca_topic_score_gemma":0.002410136,"teacher_disagreement_score":0.0025044468,"about_ca_system_score_codex":0.0006768178,"about_ca_system_score_gemma":0.00042546034,"threshold_uncertainty_score":0.006000459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036227807,0.068151675,0.7230405,0.015850307,0.0034063354,0.00024624352,0.0002764498,0.0023372872,0.15046334],"genre_scores_gemma":[0.71229243,0.052458696,0.190435,0.0018635249,0.004772009,0.00043346477,0.00039710672,0.00032971008,0.037018042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851507,0.00039258273,0.000098161974,0.00014144844,0.0006780207,0.00017463486],"domain_scores_gemma":[0.99859077,0.0005962911,0.000119773395,0.00020001078,0.00036975506,0.00012343748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019028055,0.000637683,0.0005648545,0.00075412384,0.0013630742,0.004739409,0.0012264999,0.0015795594,0.0022626875],"category_scores_gemma":[0.0053145643,0.00044735317,0.00021990243,0.0012229885,0.0017122111,0.0038841667,0.0016050893,0.0014342716,0.0011021942],"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.000082851795,0.000057297446,0.0007703581,0.0005396845,0.00002730771,0.00055749,0.00080744625,0.017212627,0.0071155797,0.73559046,0.015928809,0.22131006],"study_design_scores_gemma":[0.000039782524,0.00009711475,0.0006038955,0.00042314263,0.00004820227,0.0009434347,0.00043314826,0.11438698,0.0048946477,0.49031866,0.38773498,0.00007599919],"about_ca_topic_score_codex":0.0011769857,"about_ca_topic_score_gemma":0.0007430458,"teacher_disagreement_score":0.004739409,"about_ca_system_score_codex":0.0013015877,"about_ca_system_score_gemma":0.0010253505,"threshold_uncertainty_score":0.010063112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037077177,0.00016036743,0.9560229,0.00037666946,0.000028806586,0.000078469995,0.00006996707,0.00021043204,0.0059751766],"genre_scores_gemma":[0.7703347,0.00030677306,0.22193038,0.0001365868,0.000038971622,0.00021141487,0.00011342368,0.000093943876,0.0068337745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994128,0.0002163754,0.000017698985,0.00009202157,0.00013585802,0.00012530231],"domain_scores_gemma":[0.99963903,0.00018803816,0.0000349243,0.00004177986,0.000054159842,0.000042095337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084101915,0.00049656414,0.0009261024,0.00041993865,0.00048020243,0.00094161957,0.0008222265,0.00076284073,0.0039676256],"category_scores_gemma":[0.0014195781,0.00034722267,0.00047907614,0.0005327724,0.0006345426,0.001727559,0.0011793037,0.00077274215,0.00029623517],"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.000046975885,0.00004303003,0.00018208502,0.000036683974,0.000018918061,0.00004558629,0.00004241223,0.9484941,0.0014682333,0.029354488,0.0010428937,0.019224558],"study_design_scores_gemma":[0.000007343123,0.000014883906,0.00002930031,0.000001605559,0.0000028314607,0.000010858179,0.000012985453,0.9935859,0.0002395936,0.005560702,0.00053168635,0.000002362318],"about_ca_topic_score_codex":0.0024670053,"about_ca_topic_score_gemma":0.0027797576,"teacher_disagreement_score":0.0039676256,"about_ca_system_score_codex":0.00089169625,"about_ca_system_score_gemma":0.0010706256,"threshold_uncertainty_score":0.013273001},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5255615,0.0023667188,0.46503857,0.00041170785,0.00007249006,0.00008896317,0.00013370806,0.0008400098,0.0054862485],"genre_scores_gemma":[0.99269146,0.00046274826,0.0058572306,0.0000266295,0.000024013507,0.00003809679,0.00003991215,0.000042250616,0.00081773417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.00011919815,0.000030113648,0.00007683925,0.0002884773,0.00025171373],"domain_scores_gemma":[0.99567944,0.002354417,0.0006118559,0.00029557353,0.00091498106,0.0001436814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016210852,0.0006655542,0.00044755216,0.0011087777,0.0005195071,0.0009085139,0.0008197024,0.00046704995,0.0007880639],"category_scores_gemma":[0.007670272,0.0003235074,0.00032399106,0.00063097064,0.0007519843,0.0019076992,0.0007264467,0.00076400983,0.00016287906],"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.00033697023,0.0000814679,0.0074292566,0.00018542797,0.00005466159,0.000704642,0.00039583058,0.8232281,0.051556665,0.0860145,0.0012379962,0.028774448],"study_design_scores_gemma":[0.000003503855,0.00005013135,0.0006983329,0.000010153351,0.000008355313,0.00010325628,0.000046039848,0.9884842,0.0036297236,0.0066084024,0.00034390713,0.0000140610855],"about_ca_topic_score_codex":0.0038784642,"about_ca_topic_score_gemma":0.0016975073,"teacher_disagreement_score":0.0038784642,"about_ca_system_score_codex":0.0015413786,"about_ca_system_score_gemma":0.001300901,"threshold_uncertainty_score":0.0111835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11298814,0.0033014973,0.87688637,0.00029065617,0.00015861618,0.00021325157,0.000069175956,0.0012306693,0.0048616603],"genre_scores_gemma":[0.9159815,0.00095868856,0.08186582,0.00010333422,0.00009329844,0.00010579138,0.00008731207,0.00007727487,0.00072702696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972771,0.0009040756,0.00016625093,0.00020672749,0.0011795474,0.00026632423],"domain_scores_gemma":[0.9917203,0.0049924776,0.0005687162,0.0007501365,0.0017726654,0.00019564522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040366855,0.0010832058,0.0008034207,0.0016225453,0.0007128841,0.0017407708,0.0013266262,0.0008868301,0.001439104],"category_scores_gemma":[0.017640322,0.0003971635,0.00056654785,0.00080016174,0.0006506742,0.0017181155,0.0012998193,0.001121241,0.0003568524],"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.0018774843,0.00040925728,0.0076410193,0.00069177727,0.0002893852,0.00044109355,0.00035583586,0.62704813,0.04784829,0.036263354,0.0025580996,0.27457625],"study_design_scores_gemma":[0.000018720613,0.00016263999,0.0005060998,0.000010518371,0.000031768337,0.00013226258,0.000018929368,0.9895946,0.0067879795,0.0021862718,0.000534344,0.000015935475],"about_ca_topic_score_codex":0.0008431543,"about_ca_topic_score_gemma":0.00061522936,"teacher_disagreement_score":0.0040366855,"about_ca_system_score_codex":0.0011093895,"about_ca_system_score_gemma":0.0009393069,"threshold_uncertainty_score":0.021348238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21127062,0.0016895769,0.7716523,0.0010567643,0.00018368899,0.0001435153,0.000059888298,0.0008066552,0.013136985],"genre_scores_gemma":[0.98472494,0.000323677,0.013441614,0.000054832653,0.000074929056,0.000053574968,0.000015261034,0.000012004127,0.001299105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889344,0.00033886905,0.000048490754,0.0001318201,0.00043624785,0.00015118306],"domain_scores_gemma":[0.9987117,0.00071643316,0.00017975093,0.00007920314,0.00022688585,0.00008593173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010903006,0.0003890353,0.0004049759,0.0005761272,0.0009878841,0.0016152421,0.0009393601,0.0009122729,0.00088959583],"category_scores_gemma":[0.003907586,0.0002610698,0.0002475218,0.00062093104,0.0013495621,0.0011768154,0.000748074,0.00079923513,0.00012435834],"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.00025567785,0.00017498014,0.0020064032,0.00008195525,0.0000536671,0.0003571011,0.00028440435,0.69599587,0.022038378,0.19340156,0.0024899465,0.082860015],"study_design_scores_gemma":[0.000013095876,0.000022257978,0.00017167063,0.000003192006,0.000009595659,0.000031799118,0.000008272141,0.9868809,0.0009008281,0.011360922,0.0005887561,0.000008631717],"about_ca_topic_score_codex":0.007234469,"about_ca_topic_score_gemma":0.003110797,"teacher_disagreement_score":0.007234469,"about_ca_system_score_codex":0.0015261787,"about_ca_system_score_gemma":0.0013113037,"threshold_uncertainty_score":0.014384687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017393015,0.0012864126,0.9734837,0.0006084507,0.00017131945,0.00006287338,0.0001500036,0.0003784353,0.0064658155],"genre_scores_gemma":[0.84279567,0.0044952994,0.14199322,0.00027635045,0.00030256438,0.0004152798,0.00029926593,0.000109217595,0.009313087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951065,0.00014422438,0.000021520817,0.00006348017,0.00020144448,0.000058601938],"domain_scores_gemma":[0.9990715,0.00052007375,0.00012904477,0.00005249124,0.00019073111,0.000036094287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007073945,0.00083945633,0.00081010704,0.0008558142,0.0004579904,0.0012688973,0.0014286974,0.000896747,0.0016488048],"category_scores_gemma":[0.0027091485,0.00036431992,0.0006495756,0.0007275327,0.0006748089,0.0011625648,0.000587676,0.0011497007,0.0003345483],"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.00003306466,0.000040241208,0.00025759544,0.000064142165,0.000016946471,0.00006778595,0.00007860429,0.93169004,0.0017602781,0.05913654,0.0008761139,0.0059787016],"study_design_scores_gemma":[0.0000021637247,0.0000042648203,0.000022596989,0.0000018898459,0.0000027325032,0.0000054200814,0.0000028786633,0.9954413,0.00007390812,0.004056325,0.00038432484,0.000002316994],"about_ca_topic_score_codex":0.0073422845,"about_ca_topic_score_gemma":0.0040313615,"teacher_disagreement_score":0.0073422845,"about_ca_system_score_codex":0.0016670234,"about_ca_system_score_gemma":0.0011096764,"threshold_uncertainty_score":0.014599085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917263,0.00008142777,0.0064286254,0.000063360996,0.000011920869,0.00006592052,0.00056485593,0.00034441403,0.00071317947],"genre_scores_gemma":[0.9970367,0.000028373239,0.0015252053,0.00001717725,0.000016372649,0.000036466685,0.0011109564,0.00004714646,0.00018161167],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99634176,0.00097387173,0.00038896236,0.0005872176,0.0012761042,0.0004320092],"domain_scores_gemma":[0.986937,0.005618122,0.0012937814,0.0012119258,0.0040011657,0.00093804195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017289105,0.0006673224,0.0006375937,0.002344883,0.00071338087,0.0013812437,0.0009314367,0.0005640954,0.0006008536],"category_scores_gemma":[0.00926323,0.00025588344,0.00027575405,0.0023566575,0.00040208353,0.0013300532,0.00046883372,0.0006389335,0.00033648685],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034662334,0.0027985708,0.5552301,0.0005763002,0.0003664948,0.001750309,0.003179219,0.10767627,0.17443594,0.0018919489,0.008135758,0.14049292],"study_design_scores_gemma":[0.00004191402,0.0010306807,0.26244557,0.000027991458,0.00006732082,0.000851712,0.0013076016,0.67631006,0.05507464,0.0007781091,0.0019724264,0.00009192158],"about_ca_topic_score_codex":0.00419516,"about_ca_topic_score_gemma":0.0026758155,"teacher_disagreement_score":0.00419516,"about_ca_system_score_codex":0.000989345,"about_ca_system_score_gemma":0.00066450494,"threshold_uncertainty_score":0.009143472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817083,0.00037732619,0.015325168,0.000055821092,0.000020072379,0.000038169008,0.00010202504,0.00040272414,0.00197026],"genre_scores_gemma":[0.996678,0.00009946761,0.0028168813,0.000009329207,0.0000030466533,0.000008971195,0.00011334798,0.000019027842,0.00025204712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981061,0.0005781573,0.00011335808,0.00013639798,0.00088655064,0.00017941506],"domain_scores_gemma":[0.9941292,0.002970584,0.00044134702,0.00061898556,0.0016174616,0.00022253199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022454294,0.0005892074,0.0005005381,0.0010210596,0.00028783237,0.00048738834,0.00067343854,0.00056738814,0.00045410744],"category_scores_gemma":[0.008676868,0.00017612269,0.0001630615,0.00080084556,0.000397515,0.0009387718,0.00033092257,0.00040906275,0.00013097808],"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.0024901193,0.001008618,0.034803055,0.00043712935,0.00026896337,0.00086705154,0.00056940527,0.62142336,0.21458025,0.0060192593,0.0014959942,0.11603677],"study_design_scores_gemma":[0.000033872577,0.0011856921,0.009954704,0.000015139843,0.00005067874,0.00035247108,0.00008878175,0.91524214,0.07196295,0.0006153285,0.00045559826,0.000042532025],"about_ca_topic_score_codex":0.0016965986,"about_ca_topic_score_gemma":0.00085666846,"teacher_disagreement_score":0.0022454294,"about_ca_system_score_codex":0.00087442895,"about_ca_system_score_gemma":0.00032804464,"threshold_uncertainty_score":0.011875093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857054,0.0009846289,0.009886967,0.00008740413,0.000033007287,0.000022434993,0.0001105036,0.00035271866,0.0028169618],"genre_scores_gemma":[0.9982356,0.00012684501,0.0012588203,0.0000131305,0.000009372122,0.0000067138453,0.00008202588,0.00001549184,0.00025196138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00031494486,0.00006537853,0.00013501065,0.00050825864,0.00026266917],"domain_scores_gemma":[0.9957151,0.0025931536,0.00030535748,0.00029351385,0.0008648764,0.00022797988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022423654,0.0005284509,0.00045692027,0.0007403804,0.00070019346,0.0008730594,0.00066532876,0.000809278,0.00068250776],"category_scores_gemma":[0.0065907333,0.00018148038,0.00018742052,0.0007632123,0.0006593465,0.0011901611,0.00051276427,0.0007014818,0.00014825999],"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.0071559194,0.0013125757,0.0468005,0.00037620252,0.0002452758,0.0014182673,0.0007071212,0.6779278,0.17196643,0.008181066,0.0031048437,0.08080398],"study_design_scores_gemma":[0.000054722077,0.0009870789,0.021282217,0.000030750245,0.00007599886,0.00034771944,0.00014710202,0.9080292,0.06680565,0.0016481301,0.0005312358,0.00006018637],"about_ca_topic_score_codex":0.0027255153,"about_ca_topic_score_gemma":0.0015444615,"teacher_disagreement_score":0.0027255153,"about_ca_system_score_codex":0.00073003536,"about_ca_system_score_gemma":0.00033167965,"threshold_uncertainty_score":0.01185894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9669028,0.0012206079,0.015902126,0.00024282536,0.00022501856,0.00014013956,0.0004945207,0.00537893,0.00949309],"genre_scores_gemma":[0.98361003,0.0005004438,0.011835133,0.000077745564,0.000066486165,0.00009238326,0.0012525074,0.00050692697,0.002058394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955422,0.000835346,0.00039857166,0.0005028458,0.0019556182,0.00076549186],"domain_scores_gemma":[0.9912273,0.0031520594,0.00034669062,0.0014566489,0.0032114135,0.00060590124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027316604,0.0015141554,0.0012041321,0.0025841224,0.00095862604,0.002052742,0.002350722,0.001345688,0.0030001781],"category_scores_gemma":[0.011069315,0.00060841243,0.0006085366,0.0029358661,0.000665285,0.003477368,0.001315783,0.0013975764,0.0012294878],"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.007948758,0.0028913738,0.04294986,0.0014455201,0.0010279685,0.0006241381,0.0005871247,0.55816793,0.108827986,0.009467557,0.013943766,0.25211796],"study_design_scores_gemma":[0.00039261134,0.004143013,0.03755502,0.000078810575,0.00032382854,0.0004368029,0.00068815495,0.81705636,0.12610725,0.004703684,0.008334466,0.00018012174],"about_ca_topic_score_codex":0.0037580836,"about_ca_topic_score_gemma":0.0021281524,"teacher_disagreement_score":0.0037580836,"about_ca_system_score_codex":0.0013563172,"about_ca_system_score_gemma":0.001010659,"threshold_uncertainty_score":0.014446616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88994807,0.008918707,0.090012886,0.00033546684,0.00022757365,0.00021647471,0.00012282605,0.0014415114,0.008776475],"genre_scores_gemma":[0.98299706,0.0008179693,0.015455865,0.00002887121,0.000078661345,0.000032843913,0.000065976914,0.00003031991,0.00049243536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939883,0.0022949344,0.00020583108,0.0002955508,0.002874153,0.00034126447],"domain_scores_gemma":[0.98622376,0.009905823,0.00085893914,0.0006926685,0.0019806959,0.0003382348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003946668,0.0009469489,0.0007292576,0.001755494,0.0008273208,0.0010509668,0.0011292886,0.0010736483,0.00076849107],"category_scores_gemma":[0.01878234,0.00019095495,0.00025276348,0.0023456048,0.00073723536,0.0012398992,0.0006688722,0.00091215427,0.0001271486],"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.003355328,0.0011525409,0.0070602796,0.00037550542,0.00021959402,0.00012803005,0.00028815938,0.57112217,0.028869867,0.005767537,0.0016344269,0.38002655],"study_design_scores_gemma":[0.00007483501,0.0010300353,0.0031674688,0.000019681276,0.00005024697,0.000088116576,0.000046129357,0.98518145,0.0087373005,0.0009371542,0.0006375727,0.000030062036],"about_ca_topic_score_codex":0.0049977032,"about_ca_topic_score_gemma":0.0026348499,"teacher_disagreement_score":0.0049977032,"about_ca_system_score_codex":0.0015722024,"about_ca_system_score_gemma":0.0008488335,"threshold_uncertainty_score":0.020872176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04408411,0.0013340334,0.9509804,0.00013622527,0.0002210366,0.00014928951,0.000040188617,0.00057181873,0.0024828159],"genre_scores_gemma":[0.8788739,0.0006007175,0.11697286,0.00007612353,0.00022432831,0.00018886718,0.000053898642,0.00006021161,0.0029490525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.00012692978,0.0000264312,0.000076679724,0.00032401498,0.000074414296],"domain_scores_gemma":[0.99934477,0.00022020802,0.000075217824,0.000084831554,0.0002266861,0.000048313257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011008196,0.0005079977,0.0004336954,0.0007128345,0.0005128539,0.000977389,0.0010602676,0.00047755468,0.001471888],"category_scores_gemma":[0.0018514708,0.00024128408,0.00040937014,0.0004121519,0.000704548,0.0012810646,0.0005792025,0.00074409065,0.00016217364],"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.00042136083,0.00018402537,0.0012336002,0.00027125012,0.00014324328,0.00030752204,0.00020226208,0.5992171,0.07276045,0.13150372,0.004005324,0.18975002],"study_design_scores_gemma":[0.000024597928,0.00008095488,0.00015952117,0.000007966692,0.000030838386,0.00006512573,0.0000065283525,0.9894776,0.002135575,0.0055556903,0.0024361126,0.000019431636],"about_ca_topic_score_codex":0.0015664175,"about_ca_topic_score_gemma":0.0012973222,"teacher_disagreement_score":0.0015664175,"about_ca_system_score_codex":0.0011908783,"about_ca_system_score_gemma":0.00065929093,"threshold_uncertainty_score":0.0086404085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005576041,0.0068426374,0.968483,0.0037246156,0.0014260662,0.00047529532,0.00004859338,0.0025848248,0.010838986],"genre_scores_gemma":[0.066677764,0.008348956,0.9103924,0.0014571375,0.0016776748,0.00079480105,0.00021546034,0.0007850486,0.009650747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965258,0.0009560777,0.00024324113,0.00027934954,0.0018344047,0.00016095789],"domain_scores_gemma":[0.99543947,0.0006833641,0.00025654153,0.0006801166,0.002426888,0.0005137156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008672701,0.001013125,0.0009521676,0.0015645884,0.001056999,0.0035244133,0.003937473,0.003633348,0.0019499952],"category_scores_gemma":[0.010134037,0.0011786647,0.0007482333,0.0012544385,0.0022506958,0.0062745777,0.0023312313,0.0063604508,0.0029410184],"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.0004998563,0.0005365758,0.0013871121,0.0010606839,0.00012954498,0.001378659,0.00092271704,0.028366175,0.075987235,0.51185954,0.03654253,0.34132943],"study_design_scores_gemma":[0.0003318619,0.0009069495,0.0011916521,0.00079510896,0.0002629541,0.0021006048,0.00022189185,0.3801434,0.039973766,0.19680409,0.37688375,0.000383885],"about_ca_topic_score_codex":0.0012467146,"about_ca_topic_score_gemma":0.0008401705,"teacher_disagreement_score":0.008672701,"about_ca_system_score_codex":0.001226181,"about_ca_system_score_gemma":0.0022829508,"threshold_uncertainty_score":0.04586619},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03857413,0.00018032682,0.9538822,0.0003593295,0.000041040315,0.00014750531,0.00008529368,0.0011964265,0.0055337604],"genre_scores_gemma":[0.42639855,0.00015115376,0.5688629,0.00010670237,0.00002830318,0.00018641978,0.00026828787,0.000118734984,0.0038789746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948514,0.000113775575,0.000027010232,0.00009574096,0.00016694987,0.00011139623],"domain_scores_gemma":[0.99943286,0.00021476633,0.000063346306,0.00010655579,0.00011837222,0.00006396746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070789934,0.00039559064,0.0007395497,0.0006794034,0.0010773405,0.0009678634,0.0010369098,0.00080662186,0.004205282],"category_scores_gemma":[0.0017679511,0.0004348278,0.0005037001,0.0006428258,0.0005360924,0.0019070756,0.0016328753,0.0007594737,0.00063119835],"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.00021183999,0.00013393136,0.0009429465,0.00013034315,0.000045637524,0.00015621888,0.00037614204,0.6911893,0.0068763555,0.07042752,0.008497606,0.22101212],"study_design_scores_gemma":[0.000021818452,0.000014226651,0.00008544909,0.0000035338778,0.000004482484,0.00002722473,0.00003103394,0.9895656,0.00066340587,0.008270535,0.0013061442,0.0000066486377],"about_ca_topic_score_codex":0.004618483,"about_ca_topic_score_gemma":0.005027591,"teacher_disagreement_score":0.004618483,"about_ca_system_score_codex":0.0011932747,"about_ca_system_score_gemma":0.0017194959,"threshold_uncertainty_score":0.014068067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029884063,0.0008650292,0.9638037,0.00032420192,0.00019236008,0.00018793563,0.000104329345,0.0018158135,0.0028225463],"genre_scores_gemma":[0.5660228,0.0015621108,0.42482406,0.0003891213,0.00023881008,0.00044732614,0.00043611662,0.00031022806,0.0057694656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00011965134,0.00003262552,0.00007011671,0.00024192374,0.00006288116],"domain_scores_gemma":[0.9992508,0.00025347853,0.00008295115,0.0001646518,0.00018555198,0.000062563115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012716902,0.0006336041,0.0004574729,0.0009302212,0.0008605649,0.00086022704,0.0017483027,0.00071878766,0.0009419884],"category_scores_gemma":[0.0014671303,0.00026382174,0.00033122368,0.00089367764,0.0008491336,0.0018941334,0.0011074841,0.0011603422,0.00029025436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077409396,0.0004532043,0.0034961398,0.0007552828,0.00018717423,0.0007901084,0.00053531816,0.086078554,0.25225896,0.07767026,0.014290705,0.5627102],"study_design_scores_gemma":[0.00014270793,0.0012794123,0.0022532777,0.00010290891,0.0001142696,0.002731781,0.0002465144,0.7565492,0.14208455,0.04938382,0.044930328,0.00018125611],"about_ca_topic_score_codex":0.0012216759,"about_ca_topic_score_gemma":0.0015205417,"teacher_disagreement_score":0.0017483027,"about_ca_system_score_codex":0.0006147244,"about_ca_system_score_gemma":0.0008738468,"threshold_uncertainty_score":0.0067254305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7569466,0.0017133399,0.23429205,0.0010110943,0.00007951265,0.000072064584,0.00033696683,0.00060239696,0.0049459217],"genre_scores_gemma":[0.99546695,0.00030980987,0.0032414766,0.00003509285,0.00004741067,0.000027925891,0.00009848493,0.000036812922,0.0007359727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832326,0.00045566788,0.000072314724,0.00016258654,0.0007035353,0.00028251592],"domain_scores_gemma":[0.96094996,0.032791115,0.00233967,0.0014518857,0.0019946476,0.00047274074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007135252,0.0005253159,0.0009734427,0.0015927131,0.0007168921,0.0012836152,0.0013550351,0.00092230004,0.0013628957],"category_scores_gemma":[0.028504314,0.0005729257,0.00028823383,0.001048231,0.0016430465,0.0019015897,0.00088275864,0.0010000394,0.00015571977],"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.0029434075,0.00027724885,0.017628033,0.0002537476,0.00010331932,0.00063333387,0.0005653913,0.84750056,0.012532233,0.065995686,0.0035525202,0.04801457],"study_design_scores_gemma":[0.00003073693,0.00010831427,0.0034053114,0.000012710922,0.000048715727,0.00016978764,0.000076077245,0.9825882,0.0029532888,0.010345553,0.00023499953,0.000026345706],"about_ca_topic_score_codex":0.002035954,"about_ca_topic_score_gemma":0.0013466662,"teacher_disagreement_score":0.007135252,"about_ca_system_score_codex":0.0023085899,"about_ca_system_score_gemma":0.0006614383,"threshold_uncertainty_score":0.037735283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24861704,0.004525815,0.5786492,0.0013647781,0.00039548695,0.00026212985,0.0003335906,0.0058468,0.16000518],"genre_scores_gemma":[0.84490985,0.0024337182,0.11717169,0.0003804268,0.0003134984,0.00009744876,0.00057093357,0.00011208552,0.034010276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998772,0.000023384442,0.000003774655,0.000014035075,0.00006088157,0.000020632173],"domain_scores_gemma":[0.9998679,0.000025662128,0.000011034281,0.000021271568,0.00005648412,0.000017528815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011379041,0.0002824614,0.00014071258,0.00025095578,0.00034795015,0.000515274,0.00048242626,0.0003460373,0.0070451214],"category_scores_gemma":[0.00034444363,0.00007797395,0.0001292217,0.00030750668,0.0002040058,0.00064711605,0.00041296953,0.00030363587,0.0024367187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003487127,0.00023184568,0.0028797528,0.0003296886,0.00006252244,0.00061598135,0.0003288699,0.022405775,0.30317363,0.063423045,0.019376103,0.586824],"study_design_scores_gemma":[0.0001414115,0.0011843193,0.008272227,0.000092016984,0.00025492354,0.0029441377,0.0002555384,0.33711216,0.21395352,0.021324182,0.41439414,0.00007138494],"about_ca_topic_score_codex":0.0011183982,"about_ca_topic_score_gemma":0.0016463897,"teacher_disagreement_score":0.0070451214,"about_ca_system_score_codex":0.00032546933,"about_ca_system_score_gemma":0.00023464915,"threshold_uncertainty_score":0.023568273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03368284,0.00060667255,0.9562217,0.00029324097,0.00023611904,0.00019474963,0.00012229233,0.002224532,0.006417827],"genre_scores_gemma":[0.67692155,0.0007457005,0.30696067,0.0002541933,0.00019160271,0.00032788925,0.00019097862,0.00029174745,0.01411572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971494,0.00068693113,0.00029525513,0.00049852545,0.0007683406,0.00060147495],"domain_scores_gemma":[0.9965313,0.0007211685,0.0003884797,0.0017527512,0.00035914296,0.0002472229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025175128,0.0006184726,0.0011355106,0.0011250821,0.0016448542,0.0037605676,0.0031143497,0.0012275956,0.006359631],"category_scores_gemma":[0.0067128516,0.0006549949,0.0005243022,0.0021095583,0.0023451485,0.010083382,0.0057054227,0.001809994,0.0018948473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001942627,0.00027173388,0.0012473549,0.00039289345,0.00011470209,0.00033731377,0.0008959205,0.105848335,0.02556445,0.59126365,0.0070206923,0.26510033],"study_design_scores_gemma":[0.00036736164,0.00041815333,0.00029493464,0.0001001012,0.00015502234,0.0005229437,0.00019081851,0.52805203,0.044596266,0.3664502,0.05861327,0.00023888293],"about_ca_topic_score_codex":0.0013498642,"about_ca_topic_score_gemma":0.000798459,"teacher_disagreement_score":0.006359631,"about_ca_system_score_codex":0.0015482258,"about_ca_system_score_gemma":0.00167446,"threshold_uncertainty_score":0.021275103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042714514,0.017179143,0.9490758,0.0034647528,0.0006032212,0.000056368695,0.000066583125,0.00024187884,0.02504065],"genre_scores_gemma":[0.34207872,0.03889236,0.6059095,0.0014721366,0.0026320582,0.0007097746,0.00015181107,0.0001531337,0.00800048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987826,0.00050416164,0.00009448456,0.00012756043,0.00042135088,0.00006976023],"domain_scores_gemma":[0.9969658,0.002434069,0.00016612156,0.00022048244,0.00015167965,0.00006188393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015846753,0.0013295816,0.0012859832,0.0020802033,0.000663134,0.0029140122,0.0012504493,0.0014598568,0.0019243247],"category_scores_gemma":[0.0063956375,0.0004533084,0.0011370281,0.0024589251,0.005275783,0.0030957283,0.002246637,0.004003131,0.0005346304],"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.000016368771,0.00001989498,0.00016446138,0.00024566118,0.000037641188,0.000096627664,0.00014224819,0.056927778,0.0005123375,0.8950844,0.0015193339,0.045233313],"study_design_scores_gemma":[0.00001176734,0.000017732013,0.000112368994,0.00008229202,0.000011651094,0.00005212061,0.000035450106,0.12612925,0.0003189144,0.8591787,0.014030448,0.000019255112],"about_ca_topic_score_codex":0.0012231452,"about_ca_topic_score_gemma":0.00077796844,"teacher_disagreement_score":0.0029140122,"about_ca_system_score_codex":0.00096560415,"about_ca_system_score_gemma":0.0009396452,"threshold_uncertainty_score":0.008380711},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66852427,0.0004963444,0.32176527,0.00012705187,0.000104972794,0.00010665719,0.00032413166,0.0062859138,0.002265397],"genre_scores_gemma":[0.98497784,0.000025334559,0.014485202,0.00002283371,0.0000106428715,0.000025287103,0.0000714172,0.0000522631,0.00032914538],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.0001782765,0.00003189367,0.00014710834,0.00017784977,0.000097175296],"domain_scores_gemma":[0.998355,0.0007628893,0.00017950378,0.00031011365,0.00029211436,0.00010045455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567805,0.0009700296,0.00069478306,0.0008814722,0.00038464557,0.000617208,0.0012369491,0.00038479723,0.002349632],"category_scores_gemma":[0.0013814153,0.00026465763,0.00031614443,0.00042284472,0.00046630236,0.00096097245,0.00055876747,0.00041378225,0.00022926349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029051478,0.0005234323,0.020798516,0.00034157615,0.00023509565,0.0005423694,0.00035515896,0.19009398,0.41204098,0.0036310782,0.00376545,0.36476722],"study_design_scores_gemma":[0.000056348254,0.0007304225,0.00815711,0.000016063725,0.00007274967,0.00024976637,0.000058456226,0.91902155,0.066684075,0.0042624394,0.0006550213,0.000036066012],"about_ca_topic_score_codex":0.0014869311,"about_ca_topic_score_gemma":0.00237075,"teacher_disagreement_score":0.002349632,"about_ca_system_score_codex":0.00064823084,"about_ca_system_score_gemma":0.00047195607,"threshold_uncertainty_score":0.0078603625},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052806074,0.008197721,0.038652122,0.0072485995,0.0077920803,0.0002046357,0.0007044621,0.0029865336,0.9289333],"genre_scores_gemma":[0.051505882,0.013155206,0.03390992,0.0030385985,0.0029617539,0.000245038,0.002786793,0.0005642903,0.89183253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940014,0.00009838024,0.000024541101,0.00007703786,0.00029444732,0.0001054834],"domain_scores_gemma":[0.9990958,0.000054955686,0.00004041222,0.0002111782,0.0003358414,0.0002618845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076795474,0.00039253788,0.00024614317,0.0009396171,0.0013478062,0.0035358495,0.00084549194,0.0008634684,0.07057255],"category_scores_gemma":[0.0015177275,0.00016918975,0.0002017232,0.0011783481,0.00039234315,0.0030235543,0.002714096,0.0010649535,0.03137446],"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.00003677679,0.00004267818,0.00062045926,0.00014729626,0.000009548006,0.00018726547,0.00015057287,0.00046769914,0.0021309168,0.081366,0.48872212,0.42611876],"study_design_scores_gemma":[0.0000015806869,0.0000074292366,0.00018679371,0.000025141413,0.0000020534417,0.00013358306,0.00003801388,0.0006049877,0.0003819758,0.0040459204,0.9945673,0.000005288323],"about_ca_topic_score_codex":0.0011169976,"about_ca_topic_score_gemma":0.0025697532,"teacher_disagreement_score":0.07057255,"about_ca_system_score_codex":0.0012334207,"about_ca_system_score_gemma":0.0011962029,"threshold_uncertainty_score":0.2360887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55031776,0.007686308,0.4213417,0.0036539568,0.00022022259,0.00008487602,0.0003459208,0.0004226119,0.015926601],"genre_scores_gemma":[0.9767363,0.001957241,0.019756163,0.00022098333,0.00017343377,0.000047942278,0.000075890035,0.0001631696,0.0008687714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967961,0.0014845297,0.00012077137,0.00032522526,0.0007208463,0.00055268046],"domain_scores_gemma":[0.8871059,0.10497672,0.0032574458,0.0022187608,0.0015949784,0.0008461928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00733174,0.0012599347,0.0010062419,0.001053336,0.0011643093,0.0020210298,0.001124323,0.0011729331,0.0016759392],"category_scores_gemma":[0.061157227,0.0005996019,0.00038392772,0.0013270089,0.0017150416,0.004637521,0.0012618707,0.0017451829,0.0002584646],"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.00038189918,0.000097367156,0.0039396207,0.00012514823,0.00006155281,0.00008910601,0.0000781406,0.94161946,0.007348758,0.020306839,0.00051137805,0.025440786],"study_design_scores_gemma":[0.000017216395,0.00019520948,0.0030379193,0.000028960065,0.000051359508,0.000087731496,0.00007370773,0.9703939,0.00641248,0.018996486,0.0006785329,0.000026419311],"about_ca_topic_score_codex":0.002922473,"about_ca_topic_score_gemma":0.003105307,"teacher_disagreement_score":0.00733174,"about_ca_system_score_codex":0.002196163,"about_ca_system_score_gemma":0.0011633963,"threshold_uncertainty_score":0.03877443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020978319,0.00064619025,0.9645675,0.0010394225,0.00009308267,0.00009236878,0.0002109577,0.00020783274,0.012164348],"genre_scores_gemma":[0.7795831,0.0021339103,0.19630004,0.0002531948,0.00017837327,0.0006623971,0.00046006363,0.00014786451,0.020281034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989435,0.00048482252,0.00005212238,0.00015937362,0.00023632779,0.00012379073],"domain_scores_gemma":[0.9993512,0.0003506597,0.000076338365,0.000059577647,0.00011735345,0.00004484565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011026537,0.0008320026,0.000681211,0.0004985271,0.0005792729,0.0016591841,0.0017642035,0.0014267953,0.004220014],"category_scores_gemma":[0.002620688,0.0005004744,0.00058383273,0.00095842057,0.00080095395,0.0025614214,0.0007529997,0.0013387906,0.0007125455],"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.000018750668,0.00003448259,0.0002656315,0.000038415244,0.000014445433,0.0000462503,0.000038895105,0.8994444,0.00041981743,0.0907199,0.00088707724,0.008071922],"study_design_scores_gemma":[0.0000043217206,0.000008005622,0.00007868096,0.000006168379,0.000004400273,0.000012215546,0.00001851178,0.9659466,0.00012483669,0.032053906,0.0017375682,0.000004682829],"about_ca_topic_score_codex":0.010291972,"about_ca_topic_score_gemma":0.007321084,"teacher_disagreement_score":0.010291972,"about_ca_system_score_codex":0.0017270395,"about_ca_system_score_gemma":0.0019268647,"threshold_uncertainty_score":0.020464122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68304294,0.0008134838,0.30665123,0.00097402354,0.00011799829,0.00010857508,0.00030142293,0.00071352854,0.0072768843],"genre_scores_gemma":[0.9969536,0.00005929329,0.0024186792,0.000019318328,0.000018356051,0.000023525936,0.00002900348,0.000017106719,0.0004612874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982692,0.00065097614,0.00007839435,0.00026489096,0.0004399217,0.0002965507],"domain_scores_gemma":[0.97577083,0.017743409,0.0023534573,0.0008629544,0.0027392446,0.000530141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036021343,0.00072338665,0.00095725973,0.0012875526,0.0011052081,0.001654276,0.0010758297,0.0010328237,0.0023949188],"category_scores_gemma":[0.022065978,0.00046132365,0.0004119828,0.0005676581,0.0011605362,0.0014037732,0.0013059115,0.0010885306,0.00026686257],"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.0018450153,0.00017100753,0.0038970625,0.00024281624,0.00013924722,0.00033783013,0.00047538552,0.9058079,0.016680408,0.043339357,0.0019234202,0.025140615],"study_design_scores_gemma":[0.000029030249,0.00008452583,0.00051617547,0.000007730101,0.000020663378,0.000039398048,0.000026873977,0.99188495,0.0016717047,0.005595487,0.00011264551,0.000010793469],"about_ca_topic_score_codex":0.0027125515,"about_ca_topic_score_gemma":0.0017091858,"teacher_disagreement_score":0.0036021343,"about_ca_system_score_codex":0.0015746527,"about_ca_system_score_gemma":0.0007742078,"threshold_uncertainty_score":0.019050121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048605762,0.00024268114,0.9916636,0.000069694426,0.000021925827,0.000040641426,0.000033766428,0.000388551,0.0026785445],"genre_scores_gemma":[0.5090272,0.001927928,0.48396724,0.00011516943,0.00015285755,0.00036874044,0.00021987077,0.00021979361,0.004001281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989127,0.00039189594,0.000039069357,0.000075081414,0.0004787967,0.000102516315],"domain_scores_gemma":[0.99797255,0.001187033,0.00019588345,0.00015213198,0.00044918028,0.00004312585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002196029,0.00086967397,0.0006022264,0.001861,0.0005470442,0.0010429114,0.00095767435,0.0006039652,0.0019272428],"category_scores_gemma":[0.010648933,0.00039752337,0.00045986185,0.0011126985,0.0006580474,0.0013497497,0.0006801621,0.0008086925,0.0004588733],"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.00002709466,0.00003603965,0.00055901316,0.000087767774,0.000031412015,0.00009070335,0.00008200744,0.8471724,0.0042988155,0.08154284,0.001809785,0.06426217],"study_design_scores_gemma":[0.0000022164336,0.00002399245,0.000076884135,0.000014220955,0.000008457283,0.00003489829,0.00001493415,0.9850321,0.0012267897,0.011846948,0.0017136309,0.0000049450814],"about_ca_topic_score_codex":0.0025707532,"about_ca_topic_score_gemma":0.0013908645,"teacher_disagreement_score":0.0025707532,"about_ca_system_score_codex":0.0012823371,"about_ca_system_score_gemma":0.0012155859,"threshold_uncertainty_score":0.011613846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087025445,0.00014006557,0.9892238,0.000087230015,0.00005098919,0.000072037656,0.000013865237,0.0011294374,0.00058002246],"genre_scores_gemma":[0.3850817,0.00030314506,0.6114453,0.00010079546,0.00011640942,0.0002450005,0.000099377576,0.00015085429,0.0024574301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993499,0.0001216977,0.00005973351,0.00013863275,0.0002756077,0.000054534234],"domain_scores_gemma":[0.998762,0.00047578444,0.00014807482,0.000147485,0.00039043374,0.000076179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014421159,0.0008099712,0.0007808711,0.00086741464,0.00057448656,0.0009648707,0.001634945,0.0006631716,0.0009809788],"category_scores_gemma":[0.004552011,0.00030340816,0.0002916683,0.0004874325,0.00058666524,0.0012545718,0.000569978,0.0011874145,0.00027495727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006093964,0.00023480863,0.0012155386,0.00009750975,0.000070460796,0.00021803967,0.000316649,0.30674002,0.07117204,0.02150825,0.0042140284,0.59360325],"study_design_scores_gemma":[0.000036015033,0.00005781095,0.0001458239,0.0000046278915,0.000010896647,0.000051109,0.000011010174,0.9898117,0.007085396,0.0015583918,0.0012080374,0.000019255463],"about_ca_topic_score_codex":0.004207541,"about_ca_topic_score_gemma":0.003685651,"teacher_disagreement_score":0.004207541,"about_ca_system_score_codex":0.0009940194,"about_ca_system_score_gemma":0.000747987,"threshold_uncertainty_score":0.008366108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21516119,0.0007230384,0.76572835,0.0006345244,0.0001190911,0.00007493968,0.00008575144,0.00021682239,0.017256364],"genre_scores_gemma":[0.9894371,0.00022448902,0.0073760585,0.000033502256,0.000022039918,0.000046945235,0.000023243809,0.000011114998,0.0028254862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998698,0.00003937038,0.0000050622457,0.000022109503,0.000038548555,0.000025221761],"domain_scores_gemma":[0.9998431,0.00006515539,0.00003060355,0.0000073908054,0.000037349215,0.000016318032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357105,0.00043692294,0.0004555334,0.00036142135,0.00040227312,0.0005634159,0.0005331643,0.0005434435,0.001310328],"category_scores_gemma":[0.0007919635,0.00013435466,0.00038862348,0.00020145698,0.00061615184,0.0006179299,0.00067393645,0.00045690828,0.00008772139],"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.000068339345,0.00003617208,0.00045967606,0.00006776841,0.0000343837,0.0002240342,0.00015360597,0.87356454,0.011649486,0.102858625,0.0010245213,0.009858803],"study_design_scores_gemma":[0.000010541936,0.00001641825,0.00006527126,0.0000023947455,0.0000052183277,0.0000073497918,0.000007806678,0.9917766,0.0002989019,0.0075500794,0.0002558426,0.0000035585156],"about_ca_topic_score_codex":0.006492857,"about_ca_topic_score_gemma":0.0030323537,"teacher_disagreement_score":0.006492857,"about_ca_system_score_codex":0.0009766401,"about_ca_system_score_gemma":0.0005559736,"threshold_uncertainty_score":0.012910128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006987915,0.0005141033,0.98961955,0.00021255254,0.00009874379,0.000030681895,0.000019597574,0.00012381644,0.0023931083],"genre_scores_gemma":[0.5589479,0.0016670596,0.43133274,0.0003969217,0.00069790793,0.00035392327,0.000089044464,0.00008262691,0.0064318185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999655,0.000079863166,0.000015552667,0.00007235418,0.00014630477,0.00003077989],"domain_scores_gemma":[0.9997397,0.00010913396,0.000029825978,0.000024029103,0.00007801766,0.000019233825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046667564,0.0004328922,0.00045461074,0.00054908806,0.0005287122,0.00072779827,0.0014091777,0.00081434567,0.0009878182],"category_scores_gemma":[0.0011166007,0.0002507403,0.00053854764,0.0004949796,0.0007302215,0.0012760971,0.0006033041,0.00091543276,0.00014533321],"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.000046473015,0.00009678421,0.0005359446,0.00011705084,0.000077733304,0.00011962784,0.00013605745,0.75082636,0.006325247,0.1257471,0.0021953608,0.11377634],"study_design_scores_gemma":[0.0000062467598,0.000019468762,0.00005911468,0.0000044179674,0.0000070445512,0.00001841696,0.0000054187144,0.9826377,0.0004381825,0.015268381,0.0015292527,0.000006311708],"about_ca_topic_score_codex":0.0019784586,"about_ca_topic_score_gemma":0.0017840797,"teacher_disagreement_score":0.0019784586,"about_ca_system_score_codex":0.00067978003,"about_ca_system_score_gemma":0.00057300326,"threshold_uncertainty_score":0.004932165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382864,0.000282185,0.9847691,0.00014823493,0.000046248817,0.00018675534,0.00004706956,0.0002595003,0.00287804],"genre_scores_gemma":[0.16571197,0.0002751103,0.83159244,0.0001402201,0.00004527804,0.0005806834,0.00020390659,0.00007940249,0.0013710038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918574,0.0003608019,0.000034160737,0.00011279405,0.00016706038,0.00013931021],"domain_scores_gemma":[0.9984285,0.0011812248,0.00010255266,0.00008260716,0.00013131942,0.00007367961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015620139,0.0014662609,0.0014084204,0.001241934,0.00086387695,0.0011925634,0.0019675237,0.0021611422,0.0030525257],"category_scores_gemma":[0.003396078,0.0008102784,0.00091574725,0.0012611931,0.0011718951,0.001471783,0.0013827151,0.00138088,0.0005059193],"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.00010970326,0.00012956663,0.00030963434,0.0001152685,0.00004605939,0.00010209157,0.00010756356,0.91539973,0.0010426716,0.014847722,0.002099571,0.06569029],"study_design_scores_gemma":[0.000119967415,0.000096021075,0.000055311804,0.00001880081,0.000020216892,0.00004995809,0.000042698997,0.9857135,0.0004758511,0.011754184,0.0016395107,0.000014018758],"about_ca_topic_score_codex":0.0033809333,"about_ca_topic_score_gemma":0.0029028514,"teacher_disagreement_score":0.0033809333,"about_ca_system_score_codex":0.0010713531,"about_ca_system_score_gemma":0.0019326259,"threshold_uncertainty_score":0.010211766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97628355,0.000038211794,0.022400528,0.000085622974,0.000016800486,0.00002037937,0.00016691514,0.00028428418,0.00070379535],"genre_scores_gemma":[0.99604815,0.000016089862,0.0037207066,0.0000037800792,0.0000013105356,0.000007947865,0.00008591745,0.000007209088,0.0001088369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997342,0.00007297954,0.000015947231,0.00003500619,0.00009351297,0.000048234786],"domain_scores_gemma":[0.9981451,0.0012144723,0.00015304836,0.00012066686,0.0002744515,0.000092204915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006919005,0.00046924793,0.00034079482,0.00058142183,0.00031281734,0.00036336225,0.00056246755,0.00061023864,0.00049639825],"category_scores_gemma":[0.0032906467,0.00018284438,0.00022607003,0.00048926513,0.0004795678,0.00044149297,0.0003133394,0.0005816386,0.000048739166],"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.000104899154,0.00008257455,0.0050905393,0.00002143291,0.0000143634625,0.000106935164,0.00007277956,0.9857298,0.003948934,0.0010131323,0.00016999943,0.003644561],"study_design_scores_gemma":[0.000002966333,0.000018627788,0.0005741573,7.796171e-7,0.0000015636189,0.000005583239,0.000010742491,0.99802196,0.0012347477,0.00009308168,0.000033359956,0.0000024786862],"about_ca_topic_score_codex":0.014222627,"about_ca_topic_score_gemma":0.0073630405,"teacher_disagreement_score":0.014222627,"about_ca_system_score_codex":0.00088170654,"about_ca_system_score_gemma":0.0005076496,"threshold_uncertainty_score":0.028279662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34721717,0.0014991876,0.64072675,0.00055950147,0.00025926597,0.00021077269,0.0006917479,0.00047250665,0.008363069],"genre_scores_gemma":[0.94618994,0.0011497495,0.04917168,0.00009662494,0.00007608505,0.0002194894,0.0005257695,0.00007669028,0.0024939254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.00012640237,0.0000175344,0.0000367652,0.0001394297,0.000046308418],"domain_scores_gemma":[0.99928844,0.00042425242,0.00006243947,0.000070544054,0.000121125326,0.00003314557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065208896,0.0006811756,0.00039648786,0.00033895712,0.00028934178,0.00062753604,0.000963911,0.00095311715,0.0007911748],"category_scores_gemma":[0.0028518795,0.00028874268,0.00030645836,0.00040539677,0.00027553827,0.0011162141,0.00039547222,0.0008458558,0.00020628692],"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.00005114798,0.00003995031,0.00049138296,0.000032562428,0.000010124678,0.00004465578,0.000039227474,0.9836728,0.0038000876,0.007973009,0.0003715439,0.0034735198],"study_design_scores_gemma":[0.0000033014521,0.000008813088,0.00006921204,0.00000241181,0.0000018749121,0.000005592411,0.0000034434431,0.998522,0.0002422661,0.00092597044,0.00021311043,0.0000020627042],"about_ca_topic_score_codex":0.005479844,"about_ca_topic_score_gemma":0.0023612,"teacher_disagreement_score":0.005479844,"about_ca_system_score_codex":0.0011541096,"about_ca_system_score_gemma":0.00057410426,"threshold_uncertainty_score":0.010895908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006974106,0.026310606,0.9383538,0.002800422,0.0042102085,0.00046035516,0.00016364365,0.004006808,0.01672006],"genre_scores_gemma":[0.5963298,0.03398695,0.33675736,0.0022032072,0.006240144,0.001575548,0.0008507716,0.0006886848,0.021367662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987062,0.00032914817,0.000093861985,0.00014324507,0.0006224591,0.00010508887],"domain_scores_gemma":[0.99852127,0.00046649773,0.00012193648,0.00028452242,0.0005354772,0.000070317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018399338,0.0008446094,0.0006317346,0.0010458187,0.0009024187,0.0020261412,0.0016348338,0.0011821324,0.0026362664],"category_scores_gemma":[0.005082641,0.0002691659,0.00032443,0.0011879377,0.0010867158,0.0017010901,0.0008216743,0.0019498412,0.000996893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038141588,0.00015704149,0.0011972917,0.0013302023,0.00016006237,0.00056903274,0.00026267717,0.057194866,0.018468872,0.20914994,0.052381817,0.6587467],"study_design_scores_gemma":[0.00024049012,0.00043636202,0.0009311058,0.0004463436,0.0002405782,0.0007183588,0.00008551892,0.61388505,0.021730341,0.15644038,0.20471723,0.00012827288],"about_ca_topic_score_codex":0.001659413,"about_ca_topic_score_gemma":0.00069874665,"teacher_disagreement_score":0.0026362664,"about_ca_system_score_codex":0.0009773523,"about_ca_system_score_gemma":0.0008967693,"threshold_uncertainty_score":0.009730637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032772865,0.0008867844,0.9600007,0.0008042809,0.00006991903,0.000052536605,0.00003174786,0.000079519465,0.005301692],"genre_scores_gemma":[0.90382826,0.0013067024,0.086674646,0.0001932218,0.00018564211,0.00016457209,0.000055417713,0.00010347124,0.007488059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841976,0.0008616549,0.00004236696,0.00021449664,0.00026605738,0.00019574672],"domain_scores_gemma":[0.99738044,0.0019589863,0.00024812072,0.00010636779,0.00019510557,0.00011094369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030757324,0.0011325523,0.0012230829,0.0006629185,0.00062146096,0.0019966017,0.0013500577,0.0012366282,0.002097073],"category_scores_gemma":[0.007421045,0.00052103697,0.0006123226,0.001027757,0.0017523093,0.0024340635,0.0010596804,0.001621086,0.00029106575],"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.00007007458,0.00005018121,0.00026426133,0.00005291651,0.000019432193,0.00009107099,0.000059639868,0.9076252,0.0009733142,0.07603087,0.0007643093,0.013998708],"study_design_scores_gemma":[0.000008038001,0.000009376114,0.000055157278,0.0000027411972,0.000002344458,0.000010453878,0.00000853036,0.9850091,0.00015469978,0.014506986,0.00022924342,0.0000033853435],"about_ca_topic_score_codex":0.004518956,"about_ca_topic_score_gemma":0.0023981426,"teacher_disagreement_score":0.004518956,"about_ca_system_score_codex":0.0022320896,"about_ca_system_score_gemma":0.0010797314,"threshold_uncertainty_score":0.016266227},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14253335,0.106030345,0.5589514,0.0914266,0.0062740203,0.00028701365,0.0005909792,0.0026606417,0.0912457],"genre_scores_gemma":[0.88343227,0.017111914,0.08363059,0.0058485596,0.003040835,0.00010995265,0.00009261079,0.00034666425,0.006386779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963599,0.0013988332,0.00029773024,0.000849218,0.0008602343,0.00023396853],"domain_scores_gemma":[0.9869878,0.0087899435,0.0011288637,0.0011901604,0.0016105064,0.0002928006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006534016,0.0009136003,0.0012247768,0.0013872795,0.0007348312,0.0036488376,0.0035170806,0.0029433512,0.0033719395],"category_scores_gemma":[0.01737538,0.00053248426,0.00048855424,0.0014359355,0.0020483434,0.0072590513,0.0013279744,0.0030730548,0.0006311126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040743029,0.00014398232,0.0031194093,0.00096568087,0.00017144434,0.0004274907,0.00047505085,0.07586637,0.016741859,0.5167728,0.018218853,0.3666897],"study_design_scores_gemma":[0.00031463447,0.0005875901,0.0038104642,0.0010278362,0.0004803666,0.0017824754,0.00085496006,0.24763522,0.041279905,0.5900165,0.11191449,0.0002956275],"about_ca_topic_score_codex":0.0010844184,"about_ca_topic_score_gemma":0.0012145471,"teacher_disagreement_score":0.006534016,"about_ca_system_score_codex":0.0020928085,"about_ca_system_score_gemma":0.0012451332,"threshold_uncertainty_score":0.034555554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054052003,0.0006044793,0.9423411,0.00012693965,0.0001831246,0.00009150386,0.000053525273,0.0014723734,0.001075068],"genre_scores_gemma":[0.88039356,0.00031668495,0.11648414,0.000115594376,0.00010902223,0.00015817728,0.00007620318,0.00009623003,0.002250331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992889,0.00010910338,0.00005745255,0.00016729544,0.00025853983,0.00011874613],"domain_scores_gemma":[0.9990716,0.00027640548,0.0001342979,0.00021871123,0.00019464716,0.00010432452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006992972,0.00039682156,0.00082692195,0.000711728,0.0005353216,0.001024684,0.0022018168,0.0004434103,0.0010568651],"category_scores_gemma":[0.0016019165,0.00029127116,0.0002178857,0.0006369678,0.0008739267,0.0015498106,0.0013537935,0.0009945617,0.00023232085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001985839,0.00035506798,0.0020444104,0.00034912143,0.0001659961,0.00045604765,0.00044371185,0.21570857,0.22461538,0.0652571,0.006009591,0.48260915],"study_design_scores_gemma":[0.00019416079,0.0002199897,0.0003867407,0.000015019594,0.00005329303,0.00026523045,0.000027758231,0.9451117,0.03632964,0.0106818685,0.006647005,0.00006755219],"about_ca_topic_score_codex":0.00099287,"about_ca_topic_score_gemma":0.00062448846,"teacher_disagreement_score":0.0022018168,"about_ca_system_score_codex":0.0007273909,"about_ca_system_score_gemma":0.000700632,"threshold_uncertainty_score":0.005277574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04009657,0.0023482996,0.91962767,0.0006327748,0.000496574,0.000101442274,0.00006203574,0.0029589515,0.03367561],"genre_scores_gemma":[0.66781884,0.004467598,0.31061247,0.00040419764,0.000515915,0.00017429792,0.00023470237,0.00021163591,0.015560368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999678,0.000059119473,0.000017246308,0.000038578666,0.0001262651,0.00008072647],"domain_scores_gemma":[0.99967694,0.000076487886,0.000038728103,0.00007939462,0.00007838012,0.00005000975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004725663,0.0005745471,0.00024121878,0.00024981707,0.00039445827,0.0011784869,0.0011392935,0.0005036948,0.0020544797],"category_scores_gemma":[0.00086537184,0.0002555733,0.00025082397,0.00023793364,0.0004675038,0.0028889189,0.0015863192,0.0008984644,0.00094744883],"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.00019953102,0.00018388567,0.0015920422,0.00071660074,0.000046425877,0.0008016017,0.0005663129,0.03236895,0.13877924,0.44249052,0.009845981,0.3724089],"study_design_scores_gemma":[0.00009263132,0.0005848322,0.0014409068,0.00015608514,0.00017591468,0.0018369335,0.0001986713,0.36244187,0.10159189,0.15767218,0.37371483,0.00009330195],"about_ca_topic_score_codex":0.00040147416,"about_ca_topic_score_gemma":0.0005710035,"teacher_disagreement_score":0.0020544797,"about_ca_system_score_codex":0.00022643976,"about_ca_system_score_gemma":0.00031789712,"threshold_uncertainty_score":0.006872952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8229593,0.001490554,0.122793004,0.0014913686,0.00025335222,0.0004981549,0.008213863,0.0026498218,0.03965065],"genre_scores_gemma":[0.9764613,0.00066830456,0.017918186,0.00008945125,0.000036616766,0.0003357128,0.0021754769,0.000120348464,0.0021945322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.0002190345,0.000036536574,0.00005100834,0.00013134633,0.000101021375],"domain_scores_gemma":[0.99684346,0.0020525719,0.00015000711,0.00017108883,0.00067566475,0.00010727827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010843927,0.0008338336,0.0008291771,0.00082956825,0.00072562404,0.00085829967,0.0014656619,0.0016532084,0.0031413573],"category_scores_gemma":[0.004604562,0.0003814546,0.00061624637,0.0014957729,0.0004874172,0.0009998122,0.00050805963,0.0011437949,0.00042604902],"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.00005876272,0.00007722269,0.0011241799,0.000027319149,0.000016956506,0.000036023812,0.000017458678,0.9939877,0.00035203973,0.001925566,0.0007038227,0.0016730508],"study_design_scores_gemma":[0.000016495425,0.000019929928,0.00017955335,0.00000427071,0.0000073038536,0.000008513343,0.000009464626,0.99869436,0.00036109888,0.00042456423,0.00026963226,0.0000048851475],"about_ca_topic_score_codex":0.027974425,"about_ca_topic_score_gemma":0.008572649,"teacher_disagreement_score":0.027974425,"about_ca_system_score_codex":0.001458527,"about_ca_system_score_gemma":0.0011341344,"threshold_uncertainty_score":0.055623174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063737325,0.0002732852,0.92569834,0.00061484374,0.00013478697,0.00033561324,0.0009785545,0.00075630745,0.0074709533],"genre_scores_gemma":[0.91167015,0.00069790194,0.07478947,0.00021724895,0.00012351433,0.00075837097,0.0010595147,0.000100123056,0.010583644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929595,0.00013838631,0.00003874256,0.00015116454,0.0002456464,0.00013007656],"domain_scores_gemma":[0.9993316,0.00023533602,0.0001068208,0.00007438862,0.00020949812,0.00004231149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063368713,0.0007965736,0.0008467908,0.0007703842,0.0006321574,0.0010930441,0.002564547,0.0017667372,0.0023255597],"category_scores_gemma":[0.0020973093,0.000469279,0.000897397,0.0011420735,0.000652103,0.0018673802,0.0006652701,0.0015542123,0.00051572535],"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.00007916453,0.00009467563,0.0012487695,0.00006297892,0.000020859969,0.0002013602,0.00008057669,0.94108176,0.005010424,0.043048378,0.001384306,0.0076867617],"study_design_scores_gemma":[0.00000924879,0.000016132191,0.0001482575,0.000002631876,0.000005252346,0.00002432137,0.0000052326177,0.9964862,0.00033875435,0.0025132562,0.00044135316,0.00000931406],"about_ca_topic_score_codex":0.017077079,"about_ca_topic_score_gemma":0.008957732,"teacher_disagreement_score":0.017077079,"about_ca_system_score_codex":0.0019751368,"about_ca_system_score_gemma":0.0020714663,"threshold_uncertainty_score":0.033955395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024199108,0.0011233477,0.9670939,0.0002769197,0.000117567346,0.00047472,0.000044282606,0.00067957165,0.005990696],"genre_scores_gemma":[0.57886297,0.0017396377,0.41182175,0.00016186037,0.00010736195,0.0012193121,0.00013862857,0.00014581032,0.0058026095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991283,0.00033787722,0.000064814856,0.000101621015,0.00029239693,0.00007498318],"domain_scores_gemma":[0.999225,0.00019010299,0.00013514199,0.00011015598,0.00029611617,0.000043395346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022055178,0.0005468318,0.00036897004,0.00049747253,0.0004829731,0.0013838176,0.001565581,0.000632029,0.0015662101],"category_scores_gemma":[0.0023867143,0.0005889777,0.0003024297,0.0002876011,0.0005438873,0.0010360329,0.00067453634,0.00082208595,0.0005241672],"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.00023358058,0.00024048358,0.0013247213,0.0005044881,0.00012208334,0.00034798923,0.00033339125,0.66149086,0.06638233,0.1388427,0.004039149,0.12613815],"study_design_scores_gemma":[0.000040930998,0.0001746017,0.00019304467,0.000043560474,0.000041396463,0.000060055638,0.000037573187,0.9710694,0.012145614,0.008050692,0.008127059,0.000016158852],"about_ca_topic_score_codex":0.0010464375,"about_ca_topic_score_gemma":0.0015187401,"teacher_disagreement_score":0.0022055178,"about_ca_system_score_codex":0.0011424115,"about_ca_system_score_gemma":0.0013466829,"threshold_uncertainty_score":0.011664033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98910844,0.0004976511,0.007877921,0.00009152049,0.000026447085,0.00002353545,0.00007996899,0.00022597231,0.0020684677],"genre_scores_gemma":[0.99886024,0.00017388277,0.00070240826,0.000009993387,0.000011877927,0.000005180404,0.000044663862,0.000011026356,0.00018075688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988953,0.00038023005,0.00005095798,0.00011645968,0.0004119022,0.0001451457],"domain_scores_gemma":[0.9957742,0.002731738,0.00043386532,0.0002663803,0.0006486862,0.0001450521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013740145,0.00055541453,0.00036626574,0.0005744343,0.0007164345,0.0009690127,0.0006197565,0.0005833324,0.0006112937],"category_scores_gemma":[0.008225168,0.00017339263,0.00019743318,0.00082310406,0.00088985654,0.0016137979,0.00044235296,0.00044130237,0.00012206944],"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.0017152273,0.00020663394,0.02625406,0.00024266225,0.00015213189,0.00070059363,0.00042371568,0.8806601,0.04292898,0.0044916486,0.0011652778,0.041058946],"study_design_scores_gemma":[0.000029582514,0.00041662747,0.0050378004,0.000017907416,0.00005166909,0.00017686684,0.000086061,0.9763084,0.016179556,0.0011335807,0.0005369391,0.000025028037],"about_ca_topic_score_codex":0.0035280038,"about_ca_topic_score_gemma":0.0012443922,"teacher_disagreement_score":0.0035280038,"about_ca_system_score_codex":0.0010245558,"about_ca_system_score_gemma":0.00044296737,"threshold_uncertainty_score":0.0074337125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18828163,0.0016497282,0.7988841,0.00069708575,0.00012464159,0.00006240266,0.000037707894,0.00046385376,0.009798905],"genre_scores_gemma":[0.9388929,0.00082204235,0.05784621,0.00014125317,0.00010199985,0.00004585635,0.000046197856,0.00006192884,0.0020416456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997652,0.000063257845,0.000009349042,0.000033618806,0.00008180609,0.00004688102],"domain_scores_gemma":[0.9996753,0.00013717143,0.00003328999,0.00003786624,0.00008693673,0.000029474739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051089865,0.00030768206,0.00028436148,0.00037625694,0.0005005997,0.00075011165,0.00070459937,0.00030392667,0.0008322888],"category_scores_gemma":[0.001675278,0.00014107909,0.00011045656,0.0005170134,0.00054547965,0.00096823694,0.00046559502,0.0004695191,0.0002082636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047438176,0.00019704107,0.0016552348,0.00020619636,0.00003943344,0.0003173518,0.00037695697,0.34390652,0.11806051,0.1639904,0.0074246363,0.3633514],"study_design_scores_gemma":[0.000028974006,0.000090307265,0.00037088423,0.000011020968,0.000015727359,0.000116319,0.00006676085,0.95373863,0.009331243,0.032361574,0.0038554126,0.000013063655],"about_ca_topic_score_codex":0.0010424425,"about_ca_topic_score_gemma":0.001724024,"teacher_disagreement_score":0.0010424425,"about_ca_system_score_codex":0.0006597715,"about_ca_system_score_gemma":0.0005717496,"threshold_uncertainty_score":0.004787028},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50129193,0.0017529465,0.48942345,0.0005838153,0.00034066068,0.00007360373,0.00004739342,0.0005965345,0.0058896123],"genre_scores_gemma":[0.9903556,0.00009175875,0.008955759,0.00003679464,0.000091592025,0.00001015934,0.0000064145383,0.000025127181,0.00042681044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976792,0.0010035817,0.00009230455,0.0002568783,0.0005301441,0.0004379246],"domain_scores_gemma":[0.98421013,0.011707646,0.0007667934,0.0012641846,0.0014577378,0.0005933785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054677213,0.0008889727,0.001249557,0.00086680247,0.0014885765,0.0020502526,0.0015676602,0.0009778081,0.0010100867],"category_scores_gemma":[0.01899982,0.0005257324,0.00036026293,0.0007748182,0.0014499576,0.0028289333,0.0019163687,0.0015425092,0.00016300616],"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.003379495,0.00084151176,0.009319791,0.0001810324,0.00017777,0.0004584777,0.0006330746,0.687536,0.091004744,0.06867808,0.0015040349,0.136286],"study_design_scores_gemma":[0.000052908625,0.00019215843,0.0009097149,0.0000065306112,0.000071410606,0.000081886865,0.00003647951,0.9741053,0.010636415,0.013483524,0.0003994162,0.000024254237],"about_ca_topic_score_codex":0.0020759325,"about_ca_topic_score_gemma":0.0020877963,"teacher_disagreement_score":0.0054677213,"about_ca_system_score_codex":0.0016624517,"about_ca_system_score_gemma":0.0012238602,"threshold_uncertainty_score":0.028916478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18887018,0.0017300256,0.80381286,0.00028971236,0.000120460885,0.000057402525,0.00013725887,0.00022160268,0.004760476],"genre_scores_gemma":[0.97074765,0.00086801616,0.026050385,0.00008516539,0.00009017022,0.000051834748,0.00008659521,0.000051333267,0.001968895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00008517929,0.00002198142,0.00007868268,0.00018281995,0.0000602963],"domain_scores_gemma":[0.99875486,0.0007172138,0.00014266741,0.0000746581,0.00025526213,0.000055318138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014567078,0.0004704637,0.00024054539,0.0012458231,0.0003659244,0.00066081295,0.00063317636,0.00025198245,0.0008146371],"category_scores_gemma":[0.0042826976,0.000260568,0.00026383583,0.0005754703,0.0006808525,0.0008997374,0.00063657336,0.00061770796,0.00015745548],"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.00022012158,0.000075887205,0.0052086757,0.00016462493,0.000054427506,0.000238168,0.00024763783,0.77072865,0.026219616,0.15957218,0.0011676134,0.03610244],"study_design_scores_gemma":[0.0000027167791,0.000017642655,0.00040417942,0.00000445844,0.000005646336,0.00004238041,0.00001557553,0.9882719,0.0012381026,0.009440252,0.00055100897,0.0000061896],"about_ca_topic_score_codex":0.0021746773,"about_ca_topic_score_gemma":0.0009243168,"teacher_disagreement_score":0.0021746773,"about_ca_system_score_codex":0.0014965022,"about_ca_system_score_gemma":0.00054879533,"threshold_uncertainty_score":0.010857999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062574215,0.122057855,0.49037626,0.08994315,0.0031082698,0.0002474756,0.0002529479,0.00045174838,0.23098813],"genre_scores_gemma":[0.7791107,0.08263697,0.1048735,0.0054385755,0.0031809758,0.00030759722,0.000093383926,0.00015079071,0.024207499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995371,0.00016816022,0.00001246249,0.00005022049,0.00018776346,0.00004422114],"domain_scores_gemma":[0.999403,0.0003131815,0.00007473426,0.00004632839,0.00009323048,0.000069457805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012433378,0.00035493678,0.00029877256,0.00059808104,0.00073120784,0.0031285104,0.0006739567,0.0019710914,0.001442383],"category_scores_gemma":[0.0021810387,0.00026484745,0.0002000806,0.0010488305,0.0030869143,0.004642287,0.0009332605,0.00177685,0.00034395617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013065945,0.00000960778,0.00015534117,0.00007899659,0.0000037567133,0.000060327766,0.00006643412,0.003750274,0.0005002855,0.96685624,0.0032001864,0.025305552],"study_design_scores_gemma":[0.0000093654435,0.00005182846,0.00034461563,0.00010140439,0.000006433989,0.00017390362,0.00010453714,0.019703275,0.0005835425,0.8932656,0.0856361,0.000019417424],"about_ca_topic_score_codex":0.0010640434,"about_ca_topic_score_gemma":0.0011506885,"teacher_disagreement_score":0.0031285104,"about_ca_system_score_codex":0.0018430708,"about_ca_system_score_gemma":0.0009617859,"threshold_uncertainty_score":0.013372421},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62431014,0.00039844253,0.36882076,0.00046819414,0.000050195198,0.00004742584,0.0000688819,0.00024080729,0.005595134],"genre_scores_gemma":[0.991178,0.00013304026,0.008026482,0.00003214086,0.000016620259,0.000021251451,0.000023944107,0.000016547001,0.0005518785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00021695725,0.000019826666,0.00008713299,0.00017187382,0.00013354856],"domain_scores_gemma":[0.99782723,0.0010755834,0.00040164447,0.00021462997,0.00026432588,0.0002165569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008478311,0.00037766004,0.0004140737,0.00058903755,0.0006607097,0.0011911489,0.0009952381,0.0011861179,0.0005639754],"category_scores_gemma":[0.0063768476,0.0004097069,0.00038497316,0.0007035074,0.001940106,0.0012653845,0.0006932955,0.00075204775,0.00011170293],"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.00015527786,0.0000622557,0.003518168,0.000048699247,0.00002612758,0.00038842225,0.00022598873,0.6268316,0.009184179,0.35025933,0.0005640499,0.008735847],"study_design_scores_gemma":[0.000017439866,0.000032558444,0.0007847349,0.000007582084,0.0000074295713,0.00012423772,0.00005518249,0.9258885,0.0014310881,0.071264215,0.00036928296,0.000017801942],"about_ca_topic_score_codex":0.0016129153,"about_ca_topic_score_gemma":0.0014752622,"teacher_disagreement_score":0.0016129153,"about_ca_system_score_codex":0.0013289839,"about_ca_system_score_gemma":0.00069942744,"threshold_uncertainty_score":0.009642541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033258097,0.00014327194,0.9936329,0.00009816183,0.000022934575,0.000079846424,0.000056280216,0.0006779862,0.0019627584],"genre_scores_gemma":[0.36402085,0.0009084136,0.6308125,0.00020232174,0.00014476475,0.0011276316,0.0003824471,0.0005403887,0.0018606882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99334747,0.004284398,0.0002790168,0.00026825262,0.0015371426,0.00028376307],"domain_scores_gemma":[0.9931967,0.004753991,0.0006071992,0.0006308874,0.00063983223,0.00017139243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008002397,0.0015590606,0.0013896173,0.0014947818,0.0010143892,0.0025122054,0.0029758448,0.0020023508,0.002837663],"category_scores_gemma":[0.017061511,0.00076154206,0.0013417208,0.0009485639,0.0018058247,0.003083258,0.0017900484,0.0024330227,0.0007767699],"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.00009310128,0.00006611825,0.0003865501,0.00006392627,0.00004662935,0.000055022036,0.00008977917,0.884254,0.0025556223,0.09283196,0.0012083107,0.018349007],"study_design_scores_gemma":[0.000020066824,0.00005732797,0.00006013503,0.000027714805,0.000010972802,0.00002516526,0.000010792273,0.979785,0.0015447637,0.015768645,0.0026691034,0.000020320527],"about_ca_topic_score_codex":0.0047892155,"about_ca_topic_score_gemma":0.0016363583,"teacher_disagreement_score":0.008002397,"about_ca_system_score_codex":0.0018683197,"about_ca_system_score_gemma":0.0022806495,"threshold_uncertainty_score":0.042321265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1919027,0.0006172642,0.8036173,0.00023901826,0.000031829615,0.00006449484,0.000063825886,0.00021514278,0.0032485703],"genre_scores_gemma":[0.93921995,0.00032702243,0.059199702,0.0000456179,0.000018127354,0.000042562675,0.000045752095,0.00006494937,0.0010363346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00022080881,0.000014421163,0.00007752361,0.000083015926,0.00014991712],"domain_scores_gemma":[0.9982323,0.0013274325,0.0001792445,0.00007752088,0.0001151167,0.00006851458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015566027,0.0007851944,0.0009424588,0.00046533303,0.00036178107,0.0010399142,0.00090337405,0.0008421066,0.0013477806],"category_scores_gemma":[0.0053726397,0.00033461722,0.00021971045,0.001000503,0.0008219841,0.0022334643,0.00085676764,0.0006417505,0.00015629204],"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.000076770506,0.0000123696345,0.00015952201,0.000020869393,0.000005146532,0.0000149079,0.000014812452,0.9864057,0.0009660609,0.0035988616,0.00014620007,0.008578822],"study_design_scores_gemma":[0.00000974269,0.000021657504,0.00005578291,0.0000026791708,0.0000038377275,0.0000049349683,0.000016950946,0.99583226,0.0006818396,0.0032398363,0.00012680552,0.0000037335278],"about_ca_topic_score_codex":0.002808613,"about_ca_topic_score_gemma":0.0020391624,"teacher_disagreement_score":0.002808613,"about_ca_system_score_codex":0.0011868649,"about_ca_system_score_gemma":0.0011944347,"threshold_uncertainty_score":0.008611321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01833719,0.00017684967,0.97805595,0.00035111493,0.000042094787,0.00004349647,0.000020537442,0.00022305167,0.002749776],"genre_scores_gemma":[0.870674,0.0002215715,0.12405563,0.0002115214,0.000042794905,0.00023392394,0.000047711626,0.000041049036,0.0044718073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995846,0.00013247179,0.000021058739,0.00009540157,0.000099054465,0.000067347944],"domain_scores_gemma":[0.9985927,0.0009338006,0.00012592778,0.00008014983,0.0001825083,0.00008493845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010913699,0.00052698015,0.00082569406,0.0004072715,0.00043781247,0.0009015013,0.0013076351,0.0011611278,0.0015861101],"category_scores_gemma":[0.0031357643,0.0003143148,0.0005811274,0.00032128274,0.0011036178,0.0007691834,0.0012843313,0.0014152277,0.00019816682],"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.000030946674,0.00003084928,0.00048124202,0.000035890687,0.000019963856,0.00003801173,0.00005285768,0.96448505,0.00081501325,0.020318557,0.00035568635,0.013335874],"study_design_scores_gemma":[0.0000043553914,0.000011494643,0.000018345156,0.0000019804702,0.0000020419016,0.0000045503643,0.0000028659786,0.9971481,0.00008678735,0.0026158136,0.000101444864,0.000002229669],"about_ca_topic_score_codex":0.005114462,"about_ca_topic_score_gemma":0.004016202,"teacher_disagreement_score":0.005114462,"about_ca_system_score_codex":0.0011581773,"about_ca_system_score_gemma":0.0013951382,"threshold_uncertainty_score":0.010169387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012123715,0.00016834149,0.98547167,0.00008217637,0.00007937228,0.000084147585,0.000008235332,0.00028428048,0.0016980458],"genre_scores_gemma":[0.8545601,0.00025381424,0.14219172,0.000102786675,0.00007467791,0.00028661746,0.000026442829,0.000037669208,0.0024660677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992945,0.00014491596,0.000030085715,0.00016204902,0.0003037779,0.000064584296],"domain_scores_gemma":[0.9993649,0.00018482238,0.00007834893,0.0000484938,0.00028072897,0.00004268525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444019,0.0007303686,0.00044098086,0.00039122472,0.00062322343,0.00088983064,0.001728533,0.00056034373,0.0012060624],"category_scores_gemma":[0.0021851978,0.00033994432,0.0002851151,0.0002674438,0.000782155,0.0009461445,0.00058573054,0.00072670914,0.00017144316],"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.0002807496,0.00027206863,0.00088606885,0.00037513702,0.000116570234,0.00025317696,0.0003413721,0.6749182,0.05264335,0.064789385,0.0022534835,0.20287046],"study_design_scores_gemma":[0.0000695442,0.00012704468,0.00011295666,0.000006304057,0.000024751174,0.000041399926,0.0000132236455,0.98606515,0.0056607616,0.006384831,0.0014837504,0.000010253291],"about_ca_topic_score_codex":0.0017816816,"about_ca_topic_score_gemma":0.0019600787,"teacher_disagreement_score":0.0017816816,"about_ca_system_score_codex":0.00093835074,"about_ca_system_score_gemma":0.0012706255,"threshold_uncertainty_score":0.00710994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023258038,0.00038782568,0.9747354,0.00026576905,0.000025033318,0.00003432362,0.000014637776,0.00036111823,0.00091784634],"genre_scores_gemma":[0.5515595,0.0012431415,0.44469696,0.00027031053,0.00018167375,0.00011619482,0.00009918785,0.00020898678,0.0016239975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976445,0.0007222557,0.00014736241,0.00022746884,0.0010747272,0.00018361091],"domain_scores_gemma":[0.9909101,0.004300691,0.0010222833,0.0012283063,0.0021186648,0.00041988128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006865429,0.0010299457,0.00077347923,0.0009572274,0.0008675312,0.0025388643,0.0027932925,0.0014251065,0.00080518203],"category_scores_gemma":[0.015035319,0.00059277663,0.0003299768,0.0006982444,0.0013234101,0.0041452846,0.001922041,0.0028668179,0.00047701807],"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.0010747499,0.00031825568,0.0033615783,0.00037078746,0.000090303205,0.00025786174,0.00076824287,0.5958487,0.10023822,0.081759974,0.0034951752,0.21241611],"study_design_scores_gemma":[0.00003791559,0.00019851612,0.0003546115,0.000027397615,0.000021047186,0.00008001562,0.00006929075,0.9588534,0.017580474,0.020576593,0.002181367,0.000019381958],"about_ca_topic_score_codex":0.0010561203,"about_ca_topic_score_gemma":0.0010093657,"teacher_disagreement_score":0.006865429,"about_ca_system_score_codex":0.0010818554,"about_ca_system_score_gemma":0.0012550964,"threshold_uncertainty_score":0.03630829},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40784517,0.0010286856,0.58636814,0.00030664855,0.000087640205,0.00013155915,0.00008320573,0.0006359119,0.00351306],"genre_scores_gemma":[0.96241206,0.00014529533,0.036909755,0.000016868244,0.000016403113,0.000026862941,0.000030533145,0.000027216867,0.0004150225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996443,0.0001560156,0.000014425927,0.000041527986,0.00007025424,0.00007343633],"domain_scores_gemma":[0.9995571,0.00022081025,0.00009224003,0.00002627655,0.000067651075,0.000035887166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010219193,0.00046130698,0.00040384516,0.00041165986,0.00035296383,0.00032330607,0.00064643985,0.00023744933,0.00064932526],"category_scores_gemma":[0.0014704325,0.00022836315,0.00017587784,0.00027383494,0.0002470041,0.0005028726,0.00030929758,0.00025858663,0.000095863616],"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.00030517695,0.0000635261,0.0006083458,0.000047432968,0.000022670292,0.00006612817,0.000042163218,0.9534562,0.014603823,0.003392658,0.0007209284,0.026670935],"study_design_scores_gemma":[0.000012934257,0.00006835739,0.0000971596,9.87579e-7,0.000005111401,0.000010755464,0.000008783505,0.99783117,0.001452735,0.0003662531,0.00014238237,0.000003430523],"about_ca_topic_score_codex":0.002532082,"about_ca_topic_score_gemma":0.0026784763,"teacher_disagreement_score":0.002532082,"about_ca_system_score_codex":0.0009791398,"about_ca_system_score_gemma":0.0008171752,"threshold_uncertainty_score":0.007104218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948803,0.00038276988,0.0022391274,0.00017378325,0.000029461768,0.000019052248,0.00017057302,0.0003381468,0.0017667135],"genre_scores_gemma":[0.99928266,0.000047517024,0.00023656929,0.00001702555,0.000010491678,0.000006748763,0.00010232022,0.000038526287,0.00025811128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978229,0.0005311734,0.000119288736,0.0003164959,0.00061991415,0.000590238],"domain_scores_gemma":[0.9660935,0.022769518,0.0023775506,0.0031738726,0.00411974,0.0014658816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031814869,0.0005781697,0.0005761769,0.0011102187,0.00094490167,0.0012233579,0.0008975925,0.0011828543,0.0016886861],"category_scores_gemma":[0.029820347,0.00040946848,0.00041547418,0.0011846799,0.0013161058,0.0017607554,0.0007901347,0.0021009662,0.00037691425],"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.00971381,0.0024842499,0.127739,0.0004932539,0.0006406995,0.0019527257,0.0017726319,0.64395696,0.12853009,0.0073471935,0.0067281583,0.06864125],"study_design_scores_gemma":[0.00013358735,0.001231017,0.068777524,0.00007427644,0.00031240372,0.0012041945,0.0005718761,0.8739145,0.049703464,0.003165114,0.0007678497,0.00014417648],"about_ca_topic_score_codex":0.0038291623,"about_ca_topic_score_gemma":0.0025810872,"teacher_disagreement_score":0.0038291623,"about_ca_system_score_codex":0.0013088401,"about_ca_system_score_gemma":0.00074799056,"threshold_uncertainty_score":0.016825497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088132784,0.011841345,0.8816235,0.00078557775,0.0002900449,0.00012322348,0.000075737305,0.0010522122,0.016075557],"genre_scores_gemma":[0.8434929,0.006583886,0.14324263,0.00018352274,0.00036221874,0.00009415093,0.000090736394,0.000088489556,0.005861459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994276,0.00018815586,0.000019554136,0.000055493096,0.00027250836,0.00003672651],"domain_scores_gemma":[0.99905473,0.00038711145,0.000101310674,0.00010182899,0.00030320263,0.000051794388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063747034,0.000443634,0.00034668663,0.0004429169,0.00032614556,0.00078404223,0.00073489983,0.0004953253,0.0011080628],"category_scores_gemma":[0.0020433287,0.00020361948,0.00015387284,0.0006413528,0.0005034553,0.0012836496,0.00056982425,0.00057876075,0.0003525717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005111004,0.00010638039,0.002106141,0.00072207843,0.00007730604,0.0009364122,0.0005736562,0.14994708,0.084963515,0.1972977,0.010101174,0.5526575],"study_design_scores_gemma":[0.000040618997,0.00047224294,0.0011564156,0.00010487668,0.00006235191,0.001145474,0.00018013171,0.88000774,0.018342417,0.0683546,0.030080212,0.00005286492],"about_ca_topic_score_codex":0.0011002441,"about_ca_topic_score_gemma":0.0009283659,"teacher_disagreement_score":0.0011080628,"about_ca_system_score_codex":0.0004625478,"about_ca_system_score_gemma":0.00033438727,"threshold_uncertainty_score":0.0037068129},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7935805,0.0006543343,0.19759351,0.00026014468,0.00014085173,0.00007210116,0.00011399364,0.0031365005,0.0044482043],"genre_scores_gemma":[0.97649527,0.00011640763,0.022703439,0.00003253837,0.000051411367,0.000018628276,0.00009809529,0.000048891176,0.00043524895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848664,0.00046155456,0.00008328103,0.00018374507,0.00054208003,0.00024263834],"domain_scores_gemma":[0.9914097,0.0036020859,0.000502937,0.0021050188,0.0020754454,0.0003048591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029207517,0.00065903773,0.0008809957,0.00072250236,0.00086133805,0.0009125372,0.0010852339,0.0008319122,0.00082776276],"category_scores_gemma":[0.011523597,0.00024526913,0.00026865723,0.0007300072,0.00034389552,0.0029613925,0.0012008963,0.0013893937,0.00029421903],"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.0015560935,0.0007085213,0.02212513,0.00014782257,0.00023181281,0.00040059272,0.00040027255,0.5659893,0.06501605,0.0074986108,0.0057917843,0.33013397],"study_design_scores_gemma":[0.000024103289,0.00017001004,0.0014727926,0.0000055653786,0.000030215893,0.00012264813,0.00002435285,0.9795051,0.01652619,0.0011919221,0.0009074249,0.00001967861],"about_ca_topic_score_codex":0.0017782054,"about_ca_topic_score_gemma":0.0018951631,"teacher_disagreement_score":0.0029207517,"about_ca_system_score_codex":0.0005054291,"about_ca_system_score_gemma":0.0006495143,"threshold_uncertainty_score":0.015446544},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016957296,0.241852,0.7103496,0.0016856838,0.0009774178,0.0006831726,0.00019487787,0.0012729483,0.02602697],"genre_scores_gemma":[0.32129595,0.31864357,0.333741,0.0011073177,0.0027475331,0.0011458023,0.0007143012,0.00042409528,0.020180462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982823,0.00038151385,0.00015381146,0.0001864037,0.0008606981,0.00013539035],"domain_scores_gemma":[0.9981651,0.0009200522,0.00010934463,0.0001906864,0.00055314775,0.00006162725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237498,0.0010872314,0.0013426706,0.0022900172,0.00096738775,0.0016480733,0.00204449,0.0013801181,0.0031798133],"category_scores_gemma":[0.0046382165,0.00066344347,0.00070632476,0.0024981045,0.00053174986,0.0027140845,0.0008382913,0.0015934091,0.0008084656],"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.00023460413,0.000255104,0.00096731813,0.002265882,0.000093324146,0.0001441075,0.00025149746,0.040057085,0.009974551,0.07338193,0.018316405,0.8540581],"study_design_scores_gemma":[0.00020358282,0.0012017444,0.0026496823,0.0014656861,0.0003275233,0.0017221796,0.00031964088,0.5169016,0.019685144,0.058746092,0.39647934,0.000297732],"about_ca_topic_score_codex":0.0014046683,"about_ca_topic_score_gemma":0.0010410973,"teacher_disagreement_score":0.0031798133,"about_ca_system_score_codex":0.0012619182,"about_ca_system_score_gemma":0.00073936087,"threshold_uncertainty_score":0.012560248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15109253,0.0013894269,0.8388417,0.0003737795,0.00051675236,0.00033836262,0.00016769991,0.0031658513,0.004113965],"genre_scores_gemma":[0.8104941,0.0007478282,0.18462245,0.00024318403,0.00016927414,0.00017463199,0.0002158631,0.00010609881,0.0032264309],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997336,0.00002654477,0.000017932132,0.000048961883,0.00014991798,0.000023084016],"domain_scores_gemma":[0.9993511,0.00020670274,0.00009638438,0.00010428934,0.00021735682,0.000024128818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034030882,0.00054195325,0.0003161206,0.0006304209,0.00022603617,0.00035347298,0.0007481677,0.00046531658,0.0009762546],"category_scores_gemma":[0.0013900157,0.00012921961,0.00023323968,0.00046648952,0.00033035548,0.0006508649,0.00027421353,0.00053129264,0.0002764134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070340873,0.00026361117,0.0017364835,0.00029648692,0.00005681143,0.00045572472,0.0002522494,0.034235954,0.6276758,0.0035394612,0.0023925374,0.32839146],"study_design_scores_gemma":[0.000103423146,0.0009718763,0.0038094507,0.000052898995,0.0001102209,0.0014604349,0.00006676927,0.47862807,0.50149536,0.0013829342,0.011816889,0.00010166767],"about_ca_topic_score_codex":0.0007981064,"about_ca_topic_score_gemma":0.0007406076,"teacher_disagreement_score":0.0009762546,"about_ca_system_score_codex":0.0002630908,"about_ca_system_score_gemma":0.00027481653,"threshold_uncertainty_score":0.0032659173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22685026,0.020919247,0.7245699,0.0019316638,0.00062665786,0.0001027857,0.000063950254,0.00094314583,0.023992458],"genre_scores_gemma":[0.974325,0.0036907492,0.019695144,0.00007447744,0.00014133968,0.000014887761,0.000027206663,0.000023213372,0.0020080328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962974,0.000119977165,0.0000140436505,0.000034523546,0.00013934234,0.000062346226],"domain_scores_gemma":[0.9995159,0.00022639608,0.00003428749,0.00003426431,0.00016393347,0.000025175183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958145,0.00037728978,0.00028088584,0.00043261293,0.00034746388,0.0008759262,0.00041946713,0.00041181254,0.0006950536],"category_scores_gemma":[0.0019188063,0.00013703595,0.0001525526,0.0005239572,0.00037995444,0.00074334146,0.00039120327,0.0003963664,0.00017538868],"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.00019959296,0.00009905457,0.0031092293,0.00030784437,0.00004447676,0.00034806528,0.0002383406,0.61065465,0.039207004,0.04990593,0.003676812,0.29220897],"study_design_scores_gemma":[0.000019773699,0.00016822331,0.00072192424,0.000030716077,0.000027819138,0.00019547588,0.00012808683,0.9566266,0.010307155,0.019694798,0.012052359,0.000027136173],"about_ca_topic_score_codex":0.0030508894,"about_ca_topic_score_gemma":0.0013869836,"teacher_disagreement_score":0.0030508894,"about_ca_system_score_codex":0.00059237675,"about_ca_system_score_gemma":0.00046030787,"threshold_uncertainty_score":0.0060662627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03587968,0.00080323155,0.91627854,0.0120969,0.00031792186,0.00036561536,0.00008969164,0.0014404239,0.03272807],"genre_scores_gemma":[0.8338074,0.0008127536,0.15552692,0.0010022903,0.0003931635,0.00053626247,0.00010083537,0.00035381241,0.0074665914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561924,0.001240168,0.0003007114,0.0006924662,0.00167263,0.00047466945],"domain_scores_gemma":[0.9863876,0.0067027756,0.0012063276,0.0028252604,0.0018652945,0.0010128069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007727241,0.0006489352,0.0006644825,0.00076107227,0.0017160263,0.0065633445,0.0017117751,0.002887168,0.0027768407],"category_scores_gemma":[0.021266926,0.00061512383,0.0005709684,0.0006085873,0.0048551657,0.011807884,0.0020655813,0.004915625,0.0012047356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010778285,0.0001919386,0.0015509701,0.0001953824,0.000039408016,0.00019025066,0.0010128571,0.05771033,0.0068979943,0.8889845,0.0030273816,0.0400913],"study_design_scores_gemma":[0.00009923974,0.00020355177,0.00072222576,0.00024418085,0.00005156381,0.0002811673,0.00034580493,0.31394187,0.008904391,0.6329238,0.04218496,0.00009725476],"about_ca_topic_score_codex":0.0019399186,"about_ca_topic_score_gemma":0.0010242567,"teacher_disagreement_score":0.007727241,"about_ca_system_score_codex":0.0024111979,"about_ca_system_score_gemma":0.004001038,"threshold_uncertainty_score":0.040866017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25911772,0.002358942,0.7274017,0.00029370835,0.00027932643,0.000121004356,0.00009052701,0.0015215687,0.008815466],"genre_scores_gemma":[0.9770319,0.00038625993,0.021524,0.00003216628,0.00010078797,0.000028110777,0.00003765543,0.000037356906,0.00082177354],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994838,0.000113405484,0.000026536416,0.00007402145,0.00024352335,0.000058573998],"domain_scores_gemma":[0.99927706,0.000294965,0.00012365231,0.00006257359,0.00019229189,0.000049454156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157751,0.00037873085,0.00022137628,0.00055748195,0.00034046813,0.0006932308,0.001011672,0.0002752975,0.0006492],"category_scores_gemma":[0.0028146345,0.00015075042,0.00014672283,0.00027377752,0.00037736926,0.0005902619,0.0003250588,0.0005211142,0.00014041878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081438804,0.00020488338,0.0030284384,0.0002589696,0.00005559743,0.00042978223,0.00039120478,0.22401884,0.37700063,0.046061385,0.0022813748,0.3454545],"study_design_scores_gemma":[0.00007361745,0.00029383553,0.0015350593,0.000021635256,0.000053292737,0.00035056,0.000040527593,0.9321379,0.053781416,0.0050268713,0.0066468194,0.00003844225],"about_ca_topic_score_codex":0.0012125352,"about_ca_topic_score_gemma":0.00076829037,"teacher_disagreement_score":0.0012125352,"about_ca_system_score_codex":0.0005161348,"about_ca_system_score_gemma":0.00027244902,"threshold_uncertainty_score":0.0043143034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08072933,0.0020127378,0.9030339,0.0011875669,0.0001554477,0.00008324676,0.00016371068,0.00030551947,0.0123285325],"genre_scores_gemma":[0.9190636,0.0029856467,0.07190788,0.00025370735,0.00013826294,0.00020556097,0.00016257631,0.00008900344,0.005193749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.0001239429,0.000021070338,0.00004430701,0.00015693944,0.000053521013],"domain_scores_gemma":[0.99857056,0.000946942,0.0001433918,0.00008352491,0.00021464999,0.000040842304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093029573,0.0007985774,0.00044425562,0.00091689365,0.00048065814,0.0012474807,0.0011364223,0.001438462,0.0009021187],"category_scores_gemma":[0.004852621,0.00043756107,0.00051559735,0.000582762,0.0007417568,0.0027881279,0.00063603907,0.0012677455,0.00021453439],"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.0000214361,0.00003194433,0.0006573753,0.000041952004,0.000018359466,0.00010719983,0.00013134824,0.9080424,0.0014543597,0.08343148,0.00036480854,0.005697335],"study_design_scores_gemma":[0.000004098273,0.0000107429105,0.00009563707,0.000013467575,0.000007407862,0.000023131131,0.000012288671,0.97889847,0.00039099733,0.019695012,0.0008427102,0.000005991419],"about_ca_topic_score_codex":0.0070287776,"about_ca_topic_score_gemma":0.002982358,"teacher_disagreement_score":0.0070287776,"about_ca_system_score_codex":0.0015735106,"about_ca_system_score_gemma":0.0009237098,"threshold_uncertainty_score":0.0139757395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01742829,0.00036342003,0.9707737,0.00034865056,0.00013756637,0.000110129215,0.000104095176,0.00047682907,0.010257305],"genre_scores_gemma":[0.9672815,0.0004704342,0.02335924,0.00012388057,0.00007000634,0.00046705088,0.00010898444,0.000035950292,0.008082967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.000101766534,0.000026314729,0.00012770739,0.00019104441,0.000083430874],"domain_scores_gemma":[0.9994435,0.0002385063,0.00009703283,0.000030700685,0.00016256186,0.000027763916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077891274,0.0010137922,0.0008360919,0.0004049603,0.0006962781,0.0016375319,0.0014261758,0.00159666,0.003939804],"category_scores_gemma":[0.0014484918,0.00034812433,0.00067795976,0.0003787543,0.0010099597,0.0010472859,0.00073600514,0.0013264252,0.0005220581],"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.00006392693,0.000046868532,0.00024156712,0.00009982908,0.000022256467,0.00019191207,0.00014606013,0.95073533,0.0040482497,0.034886915,0.00081875495,0.008698262],"study_design_scores_gemma":[0.0000166057,0.000043763164,0.000067730725,0.000005714113,0.0000069093576,0.000015352574,0.000009226101,0.9959241,0.00028056372,0.003054136,0.00056896434,0.0000068756763],"about_ca_topic_score_codex":0.011807823,"about_ca_topic_score_gemma":0.0054034116,"teacher_disagreement_score":0.011807823,"about_ca_system_score_codex":0.00109544,"about_ca_system_score_gemma":0.0009199673,"threshold_uncertainty_score":0.02347821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257629,0.00026634888,0.56684417,0.00015446305,0.000044961937,0.00021046554,0.00031423612,0.0017226201,0.0046797968],"genre_scores_gemma":[0.9510021,0.00014105896,0.047663502,0.000020191288,0.00002337337,0.00012944521,0.00039073342,0.00008907277,0.0005404948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990152,0.0004310032,0.000059235645,0.000098639444,0.00031910607,0.00007688534],"domain_scores_gemma":[0.99734014,0.0012276438,0.000314801,0.0002697807,0.00076654274,0.00008111286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011062919,0.0006188738,0.00047327203,0.0033436427,0.0005897895,0.00102661,0.0006598947,0.0005939218,0.0006175484],"category_scores_gemma":[0.003905654,0.0002242816,0.00034148933,0.0017453914,0.0003693531,0.001228312,0.00040875011,0.00055315974,0.0002274698],"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.0008468054,0.0008679018,0.09890768,0.000338024,0.00012855107,0.0005207577,0.00076625455,0.36757746,0.15854599,0.022725554,0.0028306926,0.34594434],"study_design_scores_gemma":[0.0000065021304,0.00008195531,0.011484629,0.0000120223585,0.000014980286,0.00014399237,0.00014096001,0.96519375,0.019663457,0.002189329,0.0010280637,0.000040480885],"about_ca_topic_score_codex":0.0043361112,"about_ca_topic_score_gemma":0.0022883585,"teacher_disagreement_score":0.0043361112,"about_ca_system_score_codex":0.0010551518,"about_ca_system_score_gemma":0.0005556333,"threshold_uncertainty_score":0.008621752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5546185,0.00030719518,0.44313326,0.00016874824,0.00003131416,0.000039402436,0.000021077896,0.00019638153,0.0014841537],"genre_scores_gemma":[0.9944132,0.000040586052,0.005333385,0.000007748393,0.0000041304666,0.000006965727,0.0000030754911,0.0000017808544,0.00018912097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000096175645,0.000015200764,0.000046605986,0.00010426326,0.000049412127],"domain_scores_gemma":[0.9995721,0.00020589567,0.00009091932,0.000030023182,0.00007030493,0.000030731175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078833505,0.00021038699,0.0003179759,0.00028703903,0.00039406176,0.0005746563,0.00078655325,0.00047555755,0.0003137522],"category_scores_gemma":[0.0015224273,0.00018582755,0.00021217365,0.00030668016,0.0008168638,0.0008912333,0.0004603693,0.0003305499,0.000027072789],"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.00022415281,0.000061681065,0.000769512,0.000050882692,0.000023314684,0.00012132151,0.000081560065,0.9470921,0.014024142,0.013228447,0.00018126654,0.02414156],"study_design_scores_gemma":[0.000011059309,0.000029963056,0.00013083457,0.0000012127737,0.000004604178,0.000009191216,0.00000713611,0.99666023,0.001312854,0.001762095,0.000065166496,0.0000056026934],"about_ca_topic_score_codex":0.00515497,"about_ca_topic_score_gemma":0.0031644595,"teacher_disagreement_score":0.00515497,"about_ca_system_score_codex":0.000846137,"about_ca_system_score_gemma":0.0005312017,"threshold_uncertainty_score":0.010249913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019316388,0.00021394467,0.9787876,0.00008823821,0.00003841839,0.0000634656,0.000010334886,0.0004945101,0.0009870777],"genre_scores_gemma":[0.30770743,0.00019191466,0.69062215,0.000067361245,0.000048595593,0.00010288451,0.000048082275,0.000055611603,0.0011560261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943346,0.00018682612,0.00004880678,0.00008057323,0.0001943442,0.000055985704],"domain_scores_gemma":[0.9989807,0.000461683,0.00014327637,0.00017035483,0.0001785581,0.000065488006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382616,0.00062433846,0.0004729286,0.0005441041,0.00060973427,0.00088617334,0.0011727164,0.00064810325,0.00066924974],"category_scores_gemma":[0.0032010938,0.00026502958,0.00019585072,0.00045445474,0.00056225446,0.0012733326,0.00052796706,0.0009641048,0.00023685263],"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.0004388216,0.0003321348,0.0018516779,0.000197983,0.00003870462,0.00017036988,0.00022983673,0.30207288,0.051547736,0.08452728,0.00273317,0.5558593],"study_design_scores_gemma":[0.000027946024,0.000059008693,0.00012281953,0.000008264359,0.0000104767105,0.00007276268,0.000009777857,0.97378856,0.014332243,0.008907563,0.002651612,0.0000089967425],"about_ca_topic_score_codex":0.0015634358,"about_ca_topic_score_gemma":0.0017806996,"teacher_disagreement_score":0.0015634358,"about_ca_system_score_codex":0.0007045134,"about_ca_system_score_gemma":0.0009650863,"threshold_uncertainty_score":0.0054909587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020741016,0.00014662382,0.97742236,0.00006653304,0.00006536556,0.00006576737,0.00001349731,0.0009786967,0.00050021464],"genre_scores_gemma":[0.49227718,0.00014616434,0.50458264,0.00013666645,0.00009914206,0.00019107983,0.0000926884,0.00009122643,0.0023832393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962926,0.000068308305,0.000027874145,0.00006637029,0.00017467325,0.000033514334],"domain_scores_gemma":[0.99909294,0.00036856148,0.000060908358,0.00008850475,0.0003264444,0.00006265975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080912764,0.0005742392,0.00048049501,0.0006340309,0.00041643117,0.00048887776,0.0012791766,0.000572638,0.0011440002],"category_scores_gemma":[0.0029264078,0.0002070195,0.00023582912,0.00038696578,0.0003922919,0.0007773471,0.0005093461,0.0008534534,0.0003292305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011753675,0.00035451737,0.0022701372,0.000086201064,0.00007699788,0.00016828474,0.00018369769,0.093253925,0.07763184,0.0065993983,0.0021989206,0.81600076],"study_design_scores_gemma":[0.00006563705,0.00021060115,0.000600213,0.000004212764,0.00002119383,0.00012598292,0.000013957512,0.98314005,0.01316455,0.0011682448,0.0014617133,0.00002371139],"about_ca_topic_score_codex":0.0024450074,"about_ca_topic_score_gemma":0.0031389212,"teacher_disagreement_score":0.0024450074,"about_ca_system_score_codex":0.00046586563,"about_ca_system_score_gemma":0.0007681495,"threshold_uncertainty_score":0.004861474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23939535,0.00036033517,0.7551748,0.0001969539,0.0000683456,0.0001449318,0.0000365769,0.0024314544,0.0021912544],"genre_scores_gemma":[0.98357946,0.000057797,0.015947137,0.000027656217,0.000010957157,0.000035851976,0.000018559891,0.000016085885,0.00030648735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992575,0.00013723524,0.000030643347,0.00010133742,0.0004308913,0.00004239984],"domain_scores_gemma":[0.9991997,0.00027047013,0.00017887626,0.00011089153,0.00020841973,0.00003164045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851007,0.00036629595,0.00030100296,0.00031451232,0.00032955178,0.00060147495,0.0009610563,0.00032308116,0.00042409493],"category_scores_gemma":[0.0023914624,0.00021001682,0.0001473282,0.00018582544,0.00039222775,0.00051411573,0.00038194493,0.00057847926,0.00011794349],"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.0009579424,0.00038821428,0.007006214,0.00023496094,0.000043832584,0.00026075135,0.00040484525,0.29295328,0.40606233,0.0049195383,0.0018080323,0.28495997],"study_design_scores_gemma":[0.000043243846,0.00033146376,0.0025444475,0.000007475762,0.000015069861,0.00007397575,0.00001603409,0.9367712,0.058611058,0.00059060985,0.0009739619,0.000021520247],"about_ca_topic_score_codex":0.0023042501,"about_ca_topic_score_gemma":0.0013541946,"teacher_disagreement_score":0.0023042501,"about_ca_system_score_codex":0.0008042568,"about_ca_system_score_gemma":0.00035645222,"threshold_uncertainty_score":0.0058353543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03881787,0.0012297103,0.9393815,0.0015746756,0.00011051835,0.00020363212,0.00023272801,0.000099015866,0.018350372],"genre_scores_gemma":[0.7321273,0.002613459,0.24568374,0.00058789237,0.00032063533,0.0006678155,0.0004177162,0.00017365522,0.01740778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832314,0.000969512,0.000035232326,0.00020348546,0.00023603624,0.00023263427],"domain_scores_gemma":[0.995439,0.003901177,0.00020461224,0.0000916396,0.00019539995,0.00016823049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024686581,0.0017610297,0.0020590953,0.0007839611,0.0010742382,0.0017542721,0.001547808,0.0028438724,0.0054680193],"category_scores_gemma":[0.0065616504,0.0006619605,0.0008970355,0.0013144747,0.0027342376,0.003111223,0.0017238,0.0025287312,0.0005515174],"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.000055367167,0.000055907683,0.0001443746,0.000065138,0.0000177851,0.00005876798,0.000026756888,0.9609219,0.0001672599,0.033264242,0.0010569171,0.0041655973],"study_design_scores_gemma":[0.000028096876,0.00005532189,0.000089964466,0.00001454446,0.000009595596,0.000026012884,0.000027955539,0.95538,0.00012089139,0.043198064,0.00104057,0.00000901691],"about_ca_topic_score_codex":0.006034429,"about_ca_topic_score_gemma":0.003775609,"teacher_disagreement_score":0.006034429,"about_ca_system_score_codex":0.001758916,"about_ca_system_score_gemma":0.0013958439,"threshold_uncertainty_score":0.018292308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090309925,0.001463762,0.8959236,0.0005755882,0.0006172393,0.00026989297,0.000100936006,0.0024627678,0.008276272],"genre_scores_gemma":[0.76751935,0.00081023027,0.22446238,0.0002650815,0.0004154079,0.0003517079,0.00027658755,0.00035582838,0.0055433908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852836,0.0005032144,0.0001827116,0.00013666366,0.0005362148,0.000112768656],"domain_scores_gemma":[0.99351066,0.0022001534,0.0007503464,0.0019929544,0.0013170143,0.00022891561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022529252,0.0006159076,0.00044498759,0.00040019772,0.0008145665,0.0013257319,0.0014845564,0.0007604866,0.0015019709],"category_scores_gemma":[0.009609952,0.00035618013,0.00026510766,0.00029403396,0.00077995856,0.002035867,0.00128117,0.0016396325,0.0004683821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002991058,0.00064830773,0.014159648,0.0011690425,0.0002039166,0.002863761,0.0019689568,0.06807579,0.20530082,0.15188937,0.019944742,0.5307846],"study_design_scores_gemma":[0.0005074191,0.0018053298,0.005517604,0.00036706807,0.00047071517,0.003447373,0.00033667646,0.7211957,0.107270174,0.06294569,0.0958367,0.00029964093],"about_ca_topic_score_codex":0.00029672278,"about_ca_topic_score_gemma":0.0006174945,"teacher_disagreement_score":0.0022529252,"about_ca_system_score_codex":0.00042729016,"about_ca_system_score_gemma":0.00059035444,"threshold_uncertainty_score":0.01191473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083154775,0.00045451563,0.820569,0.0006522901,0.00052365044,0.00088667416,0.0006791608,0.013158326,0.07992161],"genre_scores_gemma":[0.70015216,0.00029597245,0.27077147,0.00033529729,0.00016957024,0.00044816587,0.0006077329,0.00019038185,0.027029185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00007049158,0.000031781317,0.00011330104,0.00027063707,0.000087255765],"domain_scores_gemma":[0.99959964,0.000044200333,0.000029198955,0.0000935565,0.00018593283,0.000047550322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032229943,0.0002932624,0.00021086095,0.00037238165,0.0007126236,0.0015883521,0.0017640943,0.00076931197,0.011224846],"category_scores_gemma":[0.0007581692,0.0002741819,0.00022989414,0.00046825263,0.00038214633,0.0007223189,0.0006493218,0.0008098898,0.0022504197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011721812,0.00086403126,0.0042790007,0.0003886578,0.00015138595,0.00078085664,0.0006357402,0.051366474,0.1844849,0.31458288,0.036214095,0.4050798],"study_design_scores_gemma":[0.00039027922,0.0011444478,0.004653348,0.00006320497,0.0001399637,0.0016778506,0.00013352094,0.5884132,0.09176037,0.042526904,0.26892075,0.0001761186],"about_ca_topic_score_codex":0.0027889488,"about_ca_topic_score_gemma":0.0040286495,"teacher_disagreement_score":0.011224846,"about_ca_system_score_codex":0.00079529063,"about_ca_system_score_gemma":0.0013380641,"threshold_uncertainty_score":0.037550807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0906741,0.0003193919,0.90212184,0.000099028985,0.00008440507,0.00028755266,0.000030195743,0.0010512624,0.005332209],"genre_scores_gemma":[0.84875566,0.000120820834,0.14944011,0.00005447598,0.000024456118,0.000107953936,0.000054261527,0.000035404344,0.0014069405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992861,0.00012090345,0.00004544355,0.00011181848,0.00037556115,0.000060224174],"domain_scores_gemma":[0.9990019,0.00025024434,0.00012629795,0.00012944007,0.00043073096,0.000061284074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014144867,0.00039476657,0.00047429805,0.0003462612,0.00029306143,0.0006886681,0.0011893207,0.00045944494,0.00085339166],"category_scores_gemma":[0.0023429885,0.00016479542,0.00021690548,0.00011931813,0.00026518528,0.0006784154,0.00037453076,0.00041539417,0.0001658815],"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.0006708377,0.00055064796,0.0031005084,0.00024576386,0.000108481036,0.00033322116,0.00015504923,0.514193,0.15998237,0.019182201,0.0012900386,0.3001879],"study_design_scores_gemma":[0.000049223687,0.00045116057,0.0004684805,0.00000586948,0.000033292155,0.00007589065,0.00001261743,0.9719106,0.02448849,0.0005617848,0.001928794,0.000013871235],"about_ca_topic_score_codex":0.0013002272,"about_ca_topic_score_gemma":0.000784136,"teacher_disagreement_score":0.0014144867,"about_ca_system_score_codex":0.0005425114,"about_ca_system_score_gemma":0.00058743183,"threshold_uncertainty_score":0.0074806213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009780078,0.00016566484,0.9877643,0.00008312233,0.000047708698,0.000029121858,0.000016357599,0.00048184217,0.0016318421],"genre_scores_gemma":[0.9485826,0.00028912877,0.048343,0.000059497812,0.0000613103,0.00011288957,0.000047250945,0.000040299026,0.0024640013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971443,0.00006531429,0.000014464106,0.00006291892,0.000109917615,0.000033067776],"domain_scores_gemma":[0.99981004,0.00007407485,0.000042781998,0.000015193571,0.00004845547,0.000009476645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366678,0.0006103701,0.00063389644,0.00033865677,0.00026192024,0.0006472147,0.00095718267,0.00046262983,0.00089486496],"category_scores_gemma":[0.00065207377,0.00020392647,0.00056924694,0.0001955555,0.00065671135,0.0006275689,0.00054620224,0.0005870076,0.0001641108],"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.00007282575,0.00003898256,0.00017018346,0.0001392914,0.000040033407,0.00009608884,0.00010840156,0.917924,0.024300575,0.020348674,0.0007595677,0.036001395],"study_design_scores_gemma":[0.000007869404,0.0000641193,0.000046299952,0.0000033378913,0.000007997723,0.0000095241785,0.000003894334,0.99587256,0.002166107,0.0011826605,0.0006282787,0.0000073479036],"about_ca_topic_score_codex":0.004000717,"about_ca_topic_score_gemma":0.001732651,"teacher_disagreement_score":0.004000717,"about_ca_system_score_codex":0.00048488632,"about_ca_system_score_gemma":0.0005821713,"threshold_uncertainty_score":0.0079548955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97227997,0.00016282902,0.010034901,0.0002794866,0.000035330566,0.00029524535,0.0007795084,0.00051051617,0.015622174],"genre_scores_gemma":[0.9878421,0.00013636508,0.007470021,0.000049767306,0.0000098202145,0.00016548666,0.0015225237,0.000045190132,0.002758815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993932,0.00014509693,0.000019432035,0.000070712566,0.00025650888,0.00011502746],"domain_scores_gemma":[0.9985145,0.0002451754,0.00008200092,0.00021947389,0.00062909926,0.0003098167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012028917,0.0003370161,0.00019541943,0.00025393622,0.00061091455,0.00044281877,0.00046821756,0.00039505004,0.002161532],"category_scores_gemma":[0.0016256789,0.00012068531,0.00016392485,0.00033230442,0.00051817234,0.0007672076,0.0007750756,0.0008422322,0.00030917494],"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.00472521,0.007974621,0.09163182,0.0007911962,0.0002572245,0.0019794973,0.00093409687,0.27445236,0.24071386,0.015950939,0.03109112,0.32949808],"study_design_scores_gemma":[0.0013389054,0.02050163,0.1266255,0.00007784903,0.00015716447,0.0020364786,0.0014853626,0.4143824,0.37354037,0.00509882,0.05461788,0.00013766873],"about_ca_topic_score_codex":0.0064792754,"about_ca_topic_score_gemma":0.0052899006,"teacher_disagreement_score":0.0064792754,"about_ca_system_score_codex":0.00076511764,"about_ca_system_score_gemma":0.0004639496,"threshold_uncertainty_score":0.012883127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002987584,0.00039334208,0.99391985,0.00017844768,0.00018155799,0.00011969583,0.00002091078,0.0007059254,0.0014927099],"genre_scores_gemma":[0.2818002,0.0008744571,0.71090096,0.00022945795,0.00035579005,0.0005989449,0.0001689769,0.00021271379,0.004858445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988945,0.0002482477,0.000076251396,0.00015330064,0.0005666445,0.00006107755],"domain_scores_gemma":[0.9988938,0.0003555841,0.00007737601,0.00012045866,0.00050785166,0.000044888096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611388,0.0006930233,0.0005724846,0.0008299221,0.0010147315,0.0010788959,0.0014852654,0.0009520122,0.0017882378],"category_scores_gemma":[0.005067962,0.00032473356,0.00031787952,0.0007030891,0.00071304134,0.001776652,0.0008348341,0.0015874812,0.0004385936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024297906,0.0001374173,0.0007756695,0.00018220257,0.000096051925,0.0001931212,0.00022113032,0.40119156,0.014388748,0.11264122,0.013682042,0.4562478],"study_design_scores_gemma":[0.000041826617,0.00003936486,0.00009565109,0.000015370024,0.000016379663,0.00006101782,0.0000072321177,0.97833633,0.002548505,0.009758724,0.00906352,0.000015966541],"about_ca_topic_score_codex":0.0030997058,"about_ca_topic_score_gemma":0.0019840403,"teacher_disagreement_score":0.0030997058,"about_ca_system_score_codex":0.0010672889,"about_ca_system_score_gemma":0.0012521525,"threshold_uncertainty_score":0.0077438354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05771515,0.00047338082,0.93784773,0.0004244664,0.000054548083,0.000052259646,0.000022387087,0.0005610945,0.0028490096],"genre_scores_gemma":[0.8085436,0.0004946071,0.18722749,0.000069167094,0.00007343683,0.000072328905,0.000038224116,0.000059219947,0.003421896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.0001313783,0.000012831223,0.000047545556,0.00017704918,0.000051631232],"domain_scores_gemma":[0.9991259,0.00046977948,0.00010497022,0.00018153997,0.00009258873,0.000025333748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723537,0.00039932784,0.00034509934,0.0004292901,0.00066401873,0.00074908976,0.00082967465,0.0007530521,0.0015056861],"category_scores_gemma":[0.0024730654,0.00036764966,0.00021959841,0.0003967847,0.00089791795,0.001410728,0.0005655125,0.0010907457,0.00025777626],"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.00024695607,0.00010293473,0.00063004735,0.00014468441,0.000021764812,0.00020046756,0.00018482174,0.7186319,0.026266519,0.14454754,0.002507689,0.10651452],"study_design_scores_gemma":[0.000015985222,0.00007627163,0.00012922933,0.000011458483,0.0000098634455,0.00014035204,0.00002706875,0.92261595,0.00657244,0.06778478,0.0026035737,0.000013083053],"about_ca_topic_score_codex":0.0010785738,"about_ca_topic_score_gemma":0.0010410239,"teacher_disagreement_score":0.0015056861,"about_ca_system_score_codex":0.00085533527,"about_ca_system_score_gemma":0.0009982954,"threshold_uncertainty_score":0.006205976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185949,0.000858854,0.4602434,0.00042699618,0.00011152722,0.00047333632,0.00047545953,0.004106521,0.014708939],"genre_scores_gemma":[0.9073418,0.00033996752,0.08726752,0.00007579431,0.00002271781,0.00013360468,0.000232574,0.00009951959,0.004486476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995497,0.00013314768,0.000020755526,0.000033896315,0.00020763336,0.00005488075],"domain_scores_gemma":[0.99943775,0.00020777353,0.00006953988,0.00008087103,0.00018283093,0.00002116458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064752536,0.00039244918,0.00031146483,0.00046083622,0.00044262945,0.0006204199,0.00081009936,0.00042793545,0.001439596],"category_scores_gemma":[0.001730886,0.00016959953,0.00025480494,0.00029420332,0.00024479395,0.0006421972,0.00026085635,0.0005920291,0.00033972305],"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.00037143903,0.00026544335,0.0034674616,0.00014902893,0.00003888572,0.0003011902,0.00014758011,0.8595115,0.044412613,0.017038789,0.002519564,0.071776524],"study_design_scores_gemma":[0.000017081446,0.000105306965,0.0005380019,0.000009212508,0.000012615468,0.00006185313,0.0000060873544,0.9901114,0.0061683008,0.00093702116,0.0020236385,0.000009402742],"about_ca_topic_score_codex":0.0048957183,"about_ca_topic_score_gemma":0.0038188542,"teacher_disagreement_score":0.0048957183,"about_ca_system_score_codex":0.0008199016,"about_ca_system_score_gemma":0.0006621845,"threshold_uncertainty_score":0.009734452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12611039,0.000595628,0.871422,0.00014212831,0.00005843345,0.000031076957,0.000014180899,0.00021365937,0.0014124407],"genre_scores_gemma":[0.9560349,0.00020744679,0.042524286,0.00002941896,0.000046446825,0.000035836056,0.000018039756,0.000025535659,0.0010780622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.00015305099,0.00001712037,0.00006430909,0.00009070307,0.00003984977],"domain_scores_gemma":[0.99937916,0.00031461928,0.00011359384,0.000039424387,0.00012259603,0.000030672545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011715501,0.00036209385,0.00042096272,0.0003507357,0.00029012404,0.00057914894,0.00045004673,0.00039547222,0.00045340043],"category_scores_gemma":[0.0017518706,0.00021182233,0.00016533324,0.00029727095,0.00055472704,0.0008142755,0.00037182806,0.0003729131,0.000060004368],"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.0001318746,0.000042386313,0.0006141348,0.0000428745,0.000027032409,0.000047367404,0.00007206904,0.9258572,0.010401488,0.013364445,0.00056980725,0.048829332],"study_design_scores_gemma":[0.0000056357785,0.000024095652,0.000087439665,0.0000012746672,0.0000026458633,0.000004871902,0.0000034046084,0.9974732,0.0010100584,0.0012702568,0.00011486407,0.0000023180905],"about_ca_topic_score_codex":0.0015887045,"about_ca_topic_score_gemma":0.0008085535,"teacher_disagreement_score":0.0015887045,"about_ca_system_score_codex":0.00046772,"about_ca_system_score_gemma":0.00036454957,"threshold_uncertainty_score":0.0061957836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023233844,0.001158265,0.9808106,0.00019562936,0.00034093027,0.000028306044,0.000027324942,0.00039503974,0.014720577],"genre_scores_gemma":[0.49086487,0.0033140532,0.45547637,0.0004669385,0.0011547398,0.00031159175,0.00020271234,0.0006554227,0.04755332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991629,0.00021433576,0.000032084557,0.00008841056,0.00043573682,0.00006655287],"domain_scores_gemma":[0.99901557,0.0004949269,0.000038022128,0.00013988033,0.0002787642,0.000032838572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013062211,0.0007543054,0.0010311288,0.0007577842,0.00046078948,0.0016084748,0.0015141697,0.00085077685,0.004112044],"category_scores_gemma":[0.0030869495,0.0005127166,0.0005464887,0.0008178089,0.0009498576,0.0016189897,0.0013637461,0.0028501847,0.0012653015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002177297,0.00017882018,0.0002371806,0.00017881968,0.00005285103,0.000075570635,0.000118320364,0.16616665,0.008493987,0.5869911,0.014719718,0.22256929],"study_design_scores_gemma":[0.000015373975,0.000042915017,0.00006342138,0.000023622997,0.000016302907,0.00007531281,0.0000074472487,0.86685276,0.0035308928,0.11945836,0.0098963175,0.000017234317],"about_ca_topic_score_codex":0.00060731283,"about_ca_topic_score_gemma":0.00051189255,"teacher_disagreement_score":0.004112044,"about_ca_system_score_codex":0.0010291198,"about_ca_system_score_gemma":0.00076474884,"threshold_uncertainty_score":0.013756156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030567914,0.00028945686,0.99421716,0.00007721953,0.000057078596,0.00003606362,0.00003406791,0.00015144073,0.0020807679],"genre_scores_gemma":[0.26923883,0.0022253878,0.7209804,0.00019631795,0.00021571307,0.0006338077,0.00019607718,0.0002835354,0.0060299304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911565,0.00023977409,0.00003958214,0.00009973629,0.00044562668,0.000059697868],"domain_scores_gemma":[0.9991893,0.00038169554,0.000099966,0.0001674719,0.00014104202,0.000020551919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011710246,0.0010592287,0.000656942,0.0005471175,0.00047725957,0.0010859448,0.0015737405,0.00082457095,0.001864603],"category_scores_gemma":[0.00336363,0.00035641788,0.000757686,0.0007354508,0.0006765811,0.0023071594,0.00085384754,0.0016886893,0.0007221596],"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.000022787874,0.00006464232,0.00043136222,0.0001442985,0.000048243357,0.000115048635,0.00008528849,0.6109209,0.016551835,0.34407768,0.0012895556,0.026248354],"study_design_scores_gemma":[0.0000036228953,0.00001741104,0.00005705703,0.000009951933,0.000015536156,0.000037643902,0.000006296552,0.96503055,0.0018211687,0.027869562,0.0051223594,0.000008939941],"about_ca_topic_score_codex":0.0033125738,"about_ca_topic_score_gemma":0.002643401,"teacher_disagreement_score":0.0033125738,"about_ca_system_score_codex":0.0010259183,"about_ca_system_score_gemma":0.0014330598,"threshold_uncertainty_score":0.0074435472},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6360007,0.008491253,0.3294724,0.00083799177,0.00085125765,0.00033948137,0.00037427555,0.0047979034,0.018834751],"genre_scores_gemma":[0.98897856,0.0006580961,0.009384097,0.00003867318,0.00005347016,0.00005356356,0.00013431249,0.000055885004,0.00064339046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969133,0.00070152606,0.00016325962,0.00037558275,0.0015071491,0.00033918084],"domain_scores_gemma":[0.994665,0.0020942562,0.0006696853,0.00053101353,0.0018405154,0.00019951195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027993598,0.00083220954,0.00074570096,0.0008715014,0.0011561123,0.0016886436,0.0012775888,0.0011859377,0.0009082595],"category_scores_gemma":[0.011721495,0.00022662488,0.00028784116,0.0012640089,0.00078102364,0.001881096,0.00055831653,0.0008662979,0.00027715598],"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.0018163879,0.00064815226,0.016677346,0.0005496004,0.00029547227,0.00057271833,0.00046232843,0.687703,0.050833996,0.013421769,0.005855271,0.22116393],"study_design_scores_gemma":[0.000055510573,0.0004376972,0.004049788,0.000023114357,0.000069800175,0.00019255288,0.000044211156,0.97221035,0.018259045,0.0030051148,0.0016008564,0.000052005817],"about_ca_topic_score_codex":0.0068764696,"about_ca_topic_score_gemma":0.0018645525,"teacher_disagreement_score":0.0068764696,"about_ca_system_score_codex":0.0012633144,"about_ca_system_score_gemma":0.0016058581,"threshold_uncertainty_score":0.014804602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53779507,0.0006231356,0.4218839,0.0001963918,0.00011943365,0.00011397765,0.00022880863,0.0009575549,0.03808171],"genre_scores_gemma":[0.9468554,0.00030343205,0.04776295,0.000045957015,0.000033442957,0.000056233977,0.00016376034,0.00006281651,0.004716028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956304,0.00012246105,0.0000163644,0.000053155534,0.00018227007,0.0000626716],"domain_scores_gemma":[0.9993917,0.00024342591,0.00006210289,0.00012627253,0.00013661366,0.000039836843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042292938,0.00031610703,0.00021169434,0.00037542338,0.0003897259,0.00078119553,0.00053929375,0.0003563445,0.004175398],"category_scores_gemma":[0.0024237793,0.00018616309,0.00015648454,0.00068687706,0.00033031518,0.0016187956,0.00069560786,0.00045704507,0.0005164155],"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.00055810367,0.0002563757,0.0030261267,0.000114036244,0.000038143226,0.0007912166,0.00041567933,0.31613585,0.049977265,0.44917274,0.0039442694,0.17557012],"study_design_scores_gemma":[0.000051911455,0.00016917926,0.0014430945,0.000022509419,0.000027561447,0.00046292008,0.00016341153,0.8014697,0.020150987,0.16301414,0.013004812,0.000019681918],"about_ca_topic_score_codex":0.00080372585,"about_ca_topic_score_gemma":0.00063262956,"teacher_disagreement_score":0.004175398,"about_ca_system_score_codex":0.000498882,"about_ca_system_score_gemma":0.00029678672,"threshold_uncertainty_score":0.01396811},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07226713,0.0019976078,0.921942,0.0001824204,0.00020717911,0.00010484148,0.00003021658,0.0019291814,0.0013394124],"genre_scores_gemma":[0.8078314,0.0010728907,0.18919103,0.00012362817,0.00033117257,0.00009841366,0.000087826505,0.00007933964,0.001184234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989673,0.00017495907,0.00011639968,0.00020578092,0.00044328452,0.00009239156],"domain_scores_gemma":[0.9975394,0.0008416047,0.0005407488,0.00047631297,0.00050650403,0.00009555621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686875,0.00074341346,0.00074736314,0.0011493448,0.00061726244,0.0010919096,0.0020953016,0.0007438999,0.0005272429],"category_scores_gemma":[0.0048955255,0.00044291036,0.00049226184,0.00072953565,0.0006159636,0.0031588075,0.0012613577,0.0014604235,0.00024788172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007522651,0.0007120788,0.0064677265,0.0005118491,0.00037086394,0.00044356816,0.00028545264,0.10960944,0.28385907,0.01933748,0.0022313125,0.57541895],"study_design_scores_gemma":[0.00010177263,0.0007441184,0.0027017957,0.000046893405,0.00027080704,0.0010561099,0.00004130699,0.870125,0.11049881,0.005491403,0.0087891305,0.00013283089],"about_ca_topic_score_codex":0.00053479197,"about_ca_topic_score_gemma":0.00040688095,"teacher_disagreement_score":0.0020953016,"about_ca_system_score_codex":0.0004097235,"about_ca_system_score_gemma":0.00047343285,"threshold_uncertainty_score":0.009353876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020442728,0.00017253004,0.99654394,0.000060312148,0.00011068723,0.000041770152,0.000009579313,0.0002287117,0.0007881746],"genre_scores_gemma":[0.28413647,0.000404291,0.709518,0.00015565816,0.00026176975,0.00034158782,0.00007375398,0.000102756574,0.005005662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992945,0.00012556139,0.000040378993,0.00014068675,0.0003294068,0.0000694443],"domain_scores_gemma":[0.99948704,0.00020843814,0.000033065044,0.00006214803,0.00017810677,0.00003111872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925811,0.000647364,0.0006829772,0.00067868864,0.0009085554,0.0011179588,0.0014521609,0.00095016084,0.0021053096],"category_scores_gemma":[0.0038404637,0.00026775379,0.0003587055,0.00058224535,0.00068373856,0.001655156,0.0008709216,0.0011746224,0.00044924585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020572245,0.00014413553,0.0004785319,0.00012491473,0.00006901981,0.00012374269,0.00018238572,0.28833193,0.01542729,0.115129046,0.0058082473,0.573975],"study_design_scores_gemma":[0.00004105297,0.000041103893,0.00007243188,0.000008188518,0.0000124667595,0.000054739092,0.0000054770608,0.97506535,0.0022757028,0.017884513,0.0045256284,0.000013444823],"about_ca_topic_score_codex":0.0025858767,"about_ca_topic_score_gemma":0.0020070146,"teacher_disagreement_score":0.0025858767,"about_ca_system_score_codex":0.0008539757,"about_ca_system_score_gemma":0.0013270664,"threshold_uncertainty_score":0.0070429444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97561634,0.0012717344,0.016899357,0.00009454526,0.000047630878,0.00002775607,0.000103632374,0.00029844628,0.0056405403],"genre_scores_gemma":[0.9983266,0.00022291644,0.001023733,0.000005924855,0.000016433152,0.0000037202963,0.00004718423,0.000013202683,0.00034024866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983701,0.00053539,0.00006244804,0.00011941017,0.00060094905,0.0003116999],"domain_scores_gemma":[0.9957098,0.002594802,0.00035764393,0.00023958836,0.0009473938,0.00015078274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016321214,0.000521042,0.0003764356,0.00094688387,0.00037103368,0.0007934187,0.00055869797,0.00032400622,0.001483808],"category_scores_gemma":[0.0068025207,0.00012816367,0.00015586728,0.0011871594,0.00043348953,0.001246983,0.0004398358,0.00040795695,0.00015243236],"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.003986918,0.0004239046,0.018072428,0.00045977478,0.00018818655,0.00049100316,0.00044727197,0.7224377,0.09987534,0.013249779,0.0021564576,0.13821122],"study_design_scores_gemma":[0.000041500625,0.0019505817,0.007011986,0.000022886277,0.000091211434,0.0002803651,0.00014293152,0.9418277,0.045596167,0.0014291292,0.001567296,0.00003826726],"about_ca_topic_score_codex":0.0022189314,"about_ca_topic_score_gemma":0.0010385658,"teacher_disagreement_score":0.0022189314,"about_ca_system_score_codex":0.00079358043,"about_ca_system_score_gemma":0.00028076183,"threshold_uncertainty_score":0.008631587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059478346,0.00033255032,0.9373585,0.00014791083,0.00006233062,0.00009881083,0.00003874953,0.0006691157,0.001813629],"genre_scores_gemma":[0.7313535,0.00017810886,0.2656045,0.00006760933,0.00006288351,0.00013285552,0.00006834148,0.000044981894,0.002487237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.000119670105,0.00003476171,0.00007958272,0.00013441725,0.00007144179],"domain_scores_gemma":[0.9994205,0.0002310459,0.000075966076,0.00009984924,0.00013184802,0.00004066749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011051,0.000364552,0.0006251998,0.0004026378,0.0005340155,0.0007842686,0.0015020452,0.0006645493,0.001379685],"category_scores_gemma":[0.0016765753,0.00024614437,0.0002536069,0.00059980503,0.0005129361,0.0012657836,0.00068362517,0.0006875569,0.00029709216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043512922,0.00032381172,0.0020056358,0.00013167091,0.000047457936,0.000109038745,0.00014554543,0.42757162,0.022323651,0.03274318,0.002694429,0.5114689],"study_design_scores_gemma":[0.000014952791,0.00004833596,0.0001321266,0.0000038976714,0.0000066711864,0.00003119748,0.000007672369,0.99226755,0.0031216557,0.0037600389,0.0005972689,0.000008624681],"about_ca_topic_score_codex":0.0023692888,"about_ca_topic_score_gemma":0.0022595257,"teacher_disagreement_score":0.0023692888,"about_ca_system_score_codex":0.00097050157,"about_ca_system_score_gemma":0.0010275083,"threshold_uncertainty_score":0.007041514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7888537,0.00028901137,0.19684245,0.00019045405,0.00012627356,0.00014274025,0.0000590753,0.0039524767,0.009543828],"genre_scores_gemma":[0.98260695,0.000049867656,0.016315999,0.000044056345,0.000015011804,0.000013848435,0.00003166198,0.000030804895,0.000891794],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949086,0.00014647214,0.000027890546,0.0000763998,0.00019203557,0.00006634654],"domain_scores_gemma":[0.99844235,0.00060118,0.00017907869,0.00026402812,0.00038606295,0.00012720845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089734234,0.00030851449,0.00022002344,0.00058894296,0.00032551528,0.0005731513,0.00046137776,0.00024051052,0.0005884778],"category_scores_gemma":[0.0033485484,0.00014299905,0.000114898525,0.0003569519,0.0004195801,0.0005202313,0.0004523965,0.00040544002,0.00012360372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019725629,0.0005237329,0.019181397,0.00017533172,0.000061858955,0.000643147,0.0012813647,0.08283919,0.43933067,0.013916609,0.0025459283,0.43752825],"study_design_scores_gemma":[0.00014261398,0.0013464603,0.024004398,0.000049141945,0.0001377953,0.00068856427,0.00015573595,0.6461664,0.31224048,0.003920294,0.01100266,0.00014552307],"about_ca_topic_score_codex":0.0019704162,"about_ca_topic_score_gemma":0.0021412056,"teacher_disagreement_score":0.0019704162,"about_ca_system_score_codex":0.00044317605,"about_ca_system_score_gemma":0.00047047017,"threshold_uncertainty_score":0.004745662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00845312,0.000678136,0.9767675,0.0007992098,0.00050710206,0.00034965592,0.00016774329,0.0028744717,0.009403061],"genre_scores_gemma":[0.3129863,0.0008663004,0.6690129,0.00069030054,0.00043144773,0.0007038108,0.0006783064,0.0002844682,0.014346134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986583,0.00030585672,0.0001017259,0.00020833443,0.0005823338,0.00014344543],"domain_scores_gemma":[0.9984458,0.00029275563,0.00015221487,0.00061590195,0.00032549893,0.00016778642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015160165,0.00071323337,0.0007005789,0.0013279173,0.0018021024,0.0015634751,0.0028710507,0.0015604872,0.0032194145],"category_scores_gemma":[0.003475901,0.00037709074,0.0006081814,0.0011545236,0.0011755314,0.0022175151,0.003421372,0.0018941071,0.0015575227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047653296,0.0002684964,0.0006318518,0.00034453778,0.00009880148,0.00052809983,0.00072032335,0.031955473,0.07168107,0.34832695,0.024054393,0.52091354],"study_design_scores_gemma":[0.00033844038,0.00059404934,0.0007454172,0.00011168277,0.00015983697,0.0021539843,0.00017607337,0.50057936,0.037293676,0.22102007,0.23660597,0.00022144191],"about_ca_topic_score_codex":0.0008659666,"about_ca_topic_score_gemma":0.0011158468,"teacher_disagreement_score":0.0032194145,"about_ca_system_score_codex":0.0013015344,"about_ca_system_score_gemma":0.0009368432,"threshold_uncertainty_score":0.010770023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10816722,0.000101990874,0.88943195,0.00011883142,0.000026343456,0.000028938586,0.00006743069,0.0007486199,0.0013087223],"genre_scores_gemma":[0.91832936,0.000109050445,0.080502324,0.000022736094,0.000027749511,0.000056590212,0.000115922296,0.000050153896,0.00078613346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996573,0.00010689852,0.000018959585,0.00006731135,0.000102852435,0.000046741232],"domain_scores_gemma":[0.99918157,0.0003568606,0.00010585048,0.00018935776,0.00013680263,0.000029450239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066497474,0.00037962713,0.0005186981,0.00063270767,0.00037186564,0.0006518851,0.00068417296,0.00047318763,0.00072363386],"category_scores_gemma":[0.0025246523,0.00022727858,0.00031653256,0.0006584727,0.00045198787,0.0010176081,0.00026120627,0.0004841861,0.0001866033],"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.00016620081,0.00008847718,0.0023459373,0.000025488256,0.000022457962,0.000081369435,0.00006201333,0.90742934,0.007573497,0.011244348,0.0006859113,0.07027494],"study_design_scores_gemma":[0.0000015521275,0.000005044971,0.00013141143,6.848344e-7,0.0000016735415,0.000007901442,0.000002056423,0.9976712,0.0009187059,0.0011769476,0.00008072084,0.000002067518],"about_ca_topic_score_codex":0.0034352967,"about_ca_topic_score_gemma":0.0021940374,"teacher_disagreement_score":0.0034352967,"about_ca_system_score_codex":0.00060011353,"about_ca_system_score_gemma":0.000559784,"threshold_uncertainty_score":0.006830573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14234863,0.0009249684,0.8491944,0.0003836475,0.00020754457,0.0003387662,0.00021742626,0.0013289157,0.005055686],"genre_scores_gemma":[0.91960585,0.0003489752,0.07538577,0.0001872969,0.00008137307,0.00027425334,0.00036958567,0.00006714787,0.003679807],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962986,0.000082909915,0.000031106585,0.000061247614,0.00012481185,0.00007012169],"domain_scores_gemma":[0.998226,0.0006469357,0.00012639171,0.0002745659,0.000642469,0.000083693325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010464515,0.00040206127,0.00071102503,0.0006589313,0.00074731046,0.00081552874,0.0010482696,0.00046055496,0.0020305223],"category_scores_gemma":[0.0019741266,0.0002491819,0.00019691653,0.00056187465,0.0004846072,0.000993271,0.0011471262,0.00090646424,0.0003726599],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004288099,0.00069034914,0.0022071989,0.0007487797,0.0002855352,0.0010465019,0.0007471551,0.10950318,0.26124734,0.091973215,0.019470071,0.5077926],"study_design_scores_gemma":[0.00020874628,0.0005768052,0.0009477511,0.00005744373,0.00013876514,0.0006932107,0.00017197516,0.9195562,0.04894866,0.020309627,0.008332475,0.000058432473],"about_ca_topic_score_codex":0.00081520126,"about_ca_topic_score_gemma":0.0017813033,"teacher_disagreement_score":0.0020305223,"about_ca_system_score_codex":0.00060906576,"about_ca_system_score_gemma":0.0007486331,"threshold_uncertainty_score":0.0067927837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42307967,0.0017735062,0.5273424,0.0006863516,0.0010642667,0.0017235578,0.00081346807,0.02973482,0.013781998],"genre_scores_gemma":[0.9678674,0.00016015825,0.029297957,0.00017108563,0.000111163536,0.00026190522,0.00026070978,0.00016208942,0.0017076257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.00020689341,0.00014843183,0.0001604597,0.00036935552,0.00024034343],"domain_scores_gemma":[0.9949314,0.0011961763,0.0009794815,0.0013568421,0.0010944552,0.0004416669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024706915,0.0009993312,0.0006113045,0.0021469195,0.00088910694,0.0015281927,0.003357564,0.00092856534,0.0026624508],"category_scores_gemma":[0.00531813,0.00038508436,0.0002729144,0.0008578426,0.00084898836,0.0016542822,0.0013276404,0.0014109806,0.0005078043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057765413,0.0022158206,0.030500377,0.0014164516,0.00038170864,0.0025138531,0.00096346036,0.05324112,0.33058968,0.04760096,0.030372452,0.49442753],"study_design_scores_gemma":[0.0012179597,0.0036279364,0.01195186,0.00013317067,0.00036407026,0.004366911,0.0002587711,0.4961744,0.41338912,0.009061321,0.05889021,0.0005643528],"about_ca_topic_score_codex":0.0011033524,"about_ca_topic_score_gemma":0.0010342095,"teacher_disagreement_score":0.003357564,"about_ca_system_score_codex":0.0010339554,"about_ca_system_score_gemma":0.00090378127,"threshold_uncertainty_score":0.013066411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710105,0.00054378837,0.12596911,0.00009851521,0.000033176682,0.00009008352,0.000040938874,0.00033184103,0.0018820696],"genre_scores_gemma":[0.99176145,0.00008226907,0.007704283,0.000011122255,0.00000789245,0.00001683525,0.000024396672,0.000008659792,0.0003830497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989825,0.00041242875,0.00003919603,0.00012488982,0.00022972899,0.00021126786],"domain_scores_gemma":[0.99443626,0.0042571984,0.00040649634,0.00017133895,0.0005874152,0.00014130631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025014482,0.0007531727,0.0006140548,0.0006530129,0.00040624474,0.00070126157,0.000719314,0.00066676934,0.00086767843],"category_scores_gemma":[0.005825436,0.0001880411,0.00023551231,0.0003913394,0.00069808064,0.0012003856,0.00042976506,0.00037452683,0.000085061474],"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.0005075445,0.00012697665,0.0017744937,0.000024229092,0.000034049313,0.000042948504,0.00003079104,0.98080504,0.0036254723,0.000942006,0.00015231433,0.0119340895],"study_design_scores_gemma":[0.000016953913,0.00019640221,0.00022334594,0.00000150383,0.000008222321,0.000007738149,0.0000086186765,0.99773115,0.0015006282,0.00025807082,0.000044488672,0.0000029015125],"about_ca_topic_score_codex":0.004337019,"about_ca_topic_score_gemma":0.0024432973,"teacher_disagreement_score":0.004337019,"about_ca_system_score_codex":0.0010103466,"about_ca_system_score_gemma":0.00034795864,"threshold_uncertainty_score":0.013229072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3982206,0.0018187938,0.5973218,0.00037633374,0.00006175871,0.000053580243,0.00010777506,0.00044521797,0.0015941092],"genre_scores_gemma":[0.938932,0.0009175861,0.05925348,0.000036700712,0.00004807115,0.000044145643,0.00008748344,0.000032924705,0.0006476801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987765,0.00057959487,0.000046334328,0.00013745215,0.00029334007,0.0001667119],"domain_scores_gemma":[0.9911383,0.0067509864,0.000953355,0.0006953336,0.0003873456,0.00007470309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029528404,0.00085747655,0.001234197,0.000816493,0.00097641314,0.0010593499,0.0010928665,0.0008637629,0.0004657342],"category_scores_gemma":[0.010838214,0.00053798076,0.00036216257,0.0017871701,0.0010431336,0.0040479274,0.0007295235,0.0006806708,0.00013422674],"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.0000934198,0.00002442504,0.0007990852,0.000062947875,0.000036026162,0.000108586224,0.00006436798,0.9749467,0.003290407,0.0049289986,0.0002092286,0.015435784],"study_design_scores_gemma":[0.00000806079,0.000052201674,0.0002552823,0.0000054953607,0.000013307446,0.00007689991,0.000018030269,0.9915553,0.0017182401,0.006016782,0.0002715145,0.000009064666],"about_ca_topic_score_codex":0.002111598,"about_ca_topic_score_gemma":0.0021399485,"teacher_disagreement_score":0.0029528404,"about_ca_system_score_codex":0.0008912074,"about_ca_system_score_gemma":0.00058762165,"threshold_uncertainty_score":0.015616298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081534185,0.00065106625,0.90588886,0.00050842843,0.00013464173,0.000100660676,0.000053900898,0.0022410904,0.008887151],"genre_scores_gemma":[0.81063503,0.00045168158,0.18378794,0.00017992474,0.0001476803,0.00014784407,0.00014342458,0.00011907949,0.004387411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999491,0.00010592507,0.000022164511,0.00007594383,0.00021316878,0.00009179131],"domain_scores_gemma":[0.9990988,0.00032955903,0.00011939026,0.00026010562,0.00013549268,0.000056744906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074179,0.0005070877,0.0005116613,0.00043995364,0.00064571324,0.00072766887,0.0013141418,0.0006085044,0.0030134262],"category_scores_gemma":[0.0017151682,0.0002760305,0.00031974394,0.00043913594,0.000591385,0.0018678629,0.0020806645,0.0011882727,0.0006409385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009480021,0.00029082087,0.0013971016,0.00050264096,0.00011696182,0.0010541673,0.000620818,0.1485968,0.27111098,0.087922424,0.012778674,0.4746607],"study_design_scores_gemma":[0.00017765336,0.00047803833,0.00071819156,0.00003649542,0.00004232223,0.00059624034,0.00018421408,0.9190714,0.03332657,0.033304173,0.011995428,0.000069300535],"about_ca_topic_score_codex":0.0006831396,"about_ca_topic_score_gemma":0.0009090868,"teacher_disagreement_score":0.0030134262,"about_ca_system_score_codex":0.0003976833,"about_ca_system_score_gemma":0.000559021,"threshold_uncertainty_score":0.010080934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12581782,0.004209227,0.85941887,0.0011534173,0.0001978165,0.00009759306,0.000034310866,0.00023055587,0.00884034],"genre_scores_gemma":[0.9702389,0.0009345429,0.025085721,0.00009421245,0.00016145258,0.00006268868,0.000013812411,0.000020349493,0.0033883413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.0005014724,0.000030291707,0.000097778546,0.0004063993,0.00017466137],"domain_scores_gemma":[0.99823666,0.0012772937,0.00022093262,0.00004651129,0.00013729141,0.00008124533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019262184,0.0006468481,0.00042500958,0.00059173827,0.00074452226,0.0016254142,0.00113057,0.0014735451,0.0013458964],"category_scores_gemma":[0.0044104336,0.00026083845,0.00040384923,0.00053357304,0.001316922,0.0013674893,0.0006691438,0.00084485085,0.00016484666],"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.00017435494,0.000095747855,0.0015331043,0.00013029484,0.00005163397,0.00022418125,0.00025213213,0.7915704,0.008623577,0.12714419,0.0012703834,0.06893011],"study_design_scores_gemma":[0.000014320057,0.0000678291,0.00033619354,0.0000071227983,0.000014594614,0.00006228024,0.000034884048,0.97926784,0.0009999019,0.018458549,0.0007234435,0.000013026988],"about_ca_topic_score_codex":0.003112976,"about_ca_topic_score_gemma":0.0024110326,"teacher_disagreement_score":0.003112976,"about_ca_system_score_codex":0.0012901704,"about_ca_system_score_gemma":0.0008292991,"threshold_uncertainty_score":0.010186911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47389096,0.001347436,0.5159781,0.0008125657,0.0006194681,0.00008540962,0.00009991673,0.0005022,0.006663937],"genre_scores_gemma":[0.9906561,0.00023158877,0.006601388,0.00005805815,0.00012177793,0.0000150066735,0.000048216752,0.000029982433,0.0022379665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00024696367,0.00005172509,0.00015810665,0.00044241868,0.00034518354],"domain_scores_gemma":[0.99144906,0.0050259377,0.0005414382,0.0004936978,0.0016983234,0.0007915665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024619706,0.00048963,0.0007652708,0.00076016947,0.0012555914,0.0021196827,0.0019608708,0.00074390986,0.0026909565],"category_scores_gemma":[0.011526618,0.0005277125,0.0002654924,0.00095783535,0.0008037523,0.0019341359,0.0007834115,0.0013999376,0.0002843021],"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.002294774,0.00059541827,0.00940385,0.00035103658,0.00013965507,0.0011169598,0.0014477326,0.51567096,0.052090243,0.30008894,0.007010241,0.10979021],"study_design_scores_gemma":[0.000039336548,0.00010881086,0.00091277284,0.000007129076,0.000029330935,0.00007850938,0.00008523485,0.9700646,0.0021031848,0.025834946,0.000713677,0.00002247243],"about_ca_topic_score_codex":0.0049597668,"about_ca_topic_score_gemma":0.00790581,"teacher_disagreement_score":0.0049597668,"about_ca_system_score_codex":0.0018406826,"about_ca_system_score_gemma":0.0014098188,"threshold_uncertainty_score":0.013355136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420489,0.00038791908,0.3539271,0.00015957025,0.00011093311,0.00008129736,0.00033748936,0.0009413815,0.0020053869],"genre_scores_gemma":[0.9364857,0.00015148302,0.062525235,0.000030336443,0.000048574497,0.000032571406,0.0003620716,0.00003568597,0.0003283402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992144,0.00014205625,0.00007219466,0.00021734783,0.0002748881,0.00007908174],"domain_scores_gemma":[0.99486697,0.003081983,0.00079846603,0.0004898693,0.0006214284,0.00014119653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012614075,0.00037854223,0.0005560075,0.0020474554,0.00027293988,0.00072632317,0.00036375615,0.00066871,0.0006477436],"category_scores_gemma":[0.010613965,0.0001986822,0.00029882585,0.0010151616,0.00041301598,0.00082191,0.0005675623,0.00073172513,0.00025440732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000982317,0.0003817195,0.11485885,0.00035572023,0.00032139252,0.00073691626,0.00063318573,0.09640064,0.22934195,0.005545452,0.0030635584,0.54737836],"study_design_scores_gemma":[0.00004458471,0.0005006433,0.11490796,0.00003444875,0.000077469995,0.00087413384,0.00020469142,0.7962713,0.08072513,0.0037799657,0.0024774375,0.00010218787],"about_ca_topic_score_codex":0.0007229559,"about_ca_topic_score_gemma":0.0006251083,"teacher_disagreement_score":0.0020474554,"about_ca_system_score_codex":0.00023157026,"about_ca_system_score_gemma":0.0003034394,"threshold_uncertainty_score":0.006671071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19496422,0.00023405276,0.80288875,0.00008305939,0.000030399295,0.00010470652,0.000041125106,0.00078108563,0.00087261474],"genre_scores_gemma":[0.9281027,0.000071077746,0.07152245,0.000028555565,0.000016898457,0.00006821895,0.000033528675,0.000013967703,0.00014259302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989705,0.00045328517,0.000043623015,0.00012198808,0.0003484776,0.000062198604],"domain_scores_gemma":[0.99785346,0.0012989145,0.00025377233,0.0002732576,0.00026179073,0.000058755948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011404728,0.00029316425,0.00030855654,0.0006246462,0.00030949933,0.00031947668,0.00053730584,0.00034660072,0.00028343254],"category_scores_gemma":[0.0060471836,0.00018859649,0.00017059848,0.000517999,0.00043488893,0.0005245369,0.00040872206,0.00036201207,0.00008627928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015744034,0.0003716297,0.022497451,0.00018149428,0.000112356465,0.00034171678,0.00059167255,0.35396922,0.17943381,0.011561911,0.0009889724,0.4283754],"study_design_scores_gemma":[0.000020486745,0.00025269698,0.0033480406,0.00000910343,0.000016760227,0.00011595998,0.00003320893,0.9703024,0.023013672,0.0023506992,0.0005127028,0.00002421417],"about_ca_topic_score_codex":0.001641154,"about_ca_topic_score_gemma":0.0014762087,"teacher_disagreement_score":0.001641154,"about_ca_system_score_codex":0.00052859326,"about_ca_system_score_gemma":0.0003506493,"threshold_uncertainty_score":0.0060314536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92399246,0.00068597175,0.07070817,0.00025230725,0.00002936602,0.000025384259,0.00012871817,0.00019268418,0.003984808],"genre_scores_gemma":[0.99623364,0.00010409954,0.0032640293,0.000007935119,0.0000038394355,0.000009187273,0.000025112597,0.0000071068057,0.00034504296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998398,0.000053490665,0.000004902182,0.00002019222,0.000031371706,0.000050327715],"domain_scores_gemma":[0.99842465,0.0009443707,0.00023772525,0.00014810769,0.00015377178,0.000091380956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470544,0.00019206536,0.00024095053,0.00035584223,0.00038331863,0.00032702982,0.00047494416,0.0003290275,0.0011043219],"category_scores_gemma":[0.004057314,0.00012703358,0.00021821042,0.00026867155,0.00040060896,0.0011534567,0.00041292387,0.00033248728,0.000087360844],"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.00018064967,0.000030144824,0.0033491058,0.000040163308,0.000017208416,0.00014013173,0.000075740805,0.97033757,0.006146797,0.006790871,0.0005410729,0.012350594],"study_design_scores_gemma":[0.0000056986537,0.000066219916,0.00091101637,0.000004645534,0.000008685492,0.00006739821,0.000053163192,0.9939964,0.002124366,0.002428124,0.00032820008,0.0000061563164],"about_ca_topic_score_codex":0.0015542442,"about_ca_topic_score_gemma":0.0018684169,"teacher_disagreement_score":0.0015542442,"about_ca_system_score_codex":0.00063419825,"about_ca_system_score_gemma":0.00025207133,"threshold_uncertainty_score":0.0055374503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684854,0.0015823632,0.95738924,0.00023826651,0.00010566067,0.000059740938,0.000025933594,0.00031735573,0.0034330047],"genre_scores_gemma":[0.854667,0.0009191716,0.14278783,0.00012985762,0.00008375671,0.00007874258,0.00006596133,0.00003958267,0.0012280254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987925,0.0003533293,0.00006731049,0.0001615411,0.00045624003,0.00016899213],"domain_scores_gemma":[0.9992052,0.00027217786,0.00010336245,0.00019031091,0.00016115028,0.00006784677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755141,0.00050599355,0.0005959314,0.0005943276,0.00071966945,0.0011740469,0.0018286896,0.0005524102,0.0005881125],"category_scores_gemma":[0.0019394655,0.00034298038,0.00038773127,0.00076220743,0.0008813088,0.00172754,0.0012043793,0.0009942851,0.00017902267],"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.00029340546,0.00016369604,0.0014626752,0.0002468593,0.00008383283,0.00041005644,0.00063694845,0.5077136,0.03416755,0.18885663,0.0019561972,0.26400843],"study_design_scores_gemma":[0.000028197539,0.000101409394,0.00024802066,0.000020259646,0.000030859526,0.00010578439,0.000051586234,0.9580214,0.0055390494,0.028702915,0.0071217725,0.000028765067],"about_ca_topic_score_codex":0.0021091658,"about_ca_topic_score_gemma":0.0015817733,"teacher_disagreement_score":0.0021091658,"about_ca_system_score_codex":0.0014874098,"about_ca_system_score_gemma":0.0012145841,"threshold_uncertainty_score":0.010791898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027270275,0.00063932146,0.99182105,0.0002150484,0.00012130321,0.000028683457,0.000035935347,0.00025495118,0.0041566486],"genre_scores_gemma":[0.50437886,0.0047755307,0.4791733,0.0003108966,0.00041198556,0.0005367602,0.00030774024,0.0001768877,0.00992811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946564,0.0002137476,0.00003349489,0.000054922053,0.0001993181,0.000032873017],"domain_scores_gemma":[0.99938023,0.00040478638,0.00003913337,0.00006624235,0.000090118374,0.000019554587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005879531,0.00066765194,0.00076857564,0.0009248556,0.00060452236,0.0010520307,0.0009895877,0.0007784498,0.0028801141],"category_scores_gemma":[0.0021640882,0.0003213201,0.001026876,0.0010217251,0.0011892351,0.0011992154,0.0008348814,0.0014250978,0.0005965917],"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.000022878217,0.000029130239,0.00049586315,0.00010579296,0.00006119044,0.000104846615,0.00008958449,0.55453527,0.0022726315,0.40406156,0.0018035583,0.03641768],"study_design_scores_gemma":[0.00000983856,0.000022516198,0.00007340499,0.000012430653,0.0000117361205,0.0000438552,0.000008749319,0.8726992,0.0004994496,0.122604,0.0040043,0.000010601993],"about_ca_topic_score_codex":0.003923705,"about_ca_topic_score_gemma":0.0029741882,"teacher_disagreement_score":0.003923705,"about_ca_system_score_codex":0.0011893372,"about_ca_system_score_gemma":0.001128137,"threshold_uncertainty_score":0.009634972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14649463,0.0011242657,0.8253002,0.00043915602,0.00027341951,0.00023654185,0.00027448862,0.0020432451,0.023813976],"genre_scores_gemma":[0.769781,0.00047444025,0.22297117,0.00018104407,0.00006671943,0.0001290048,0.00033063465,0.00006373144,0.0060023596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995277,0.0001656397,0.000022435312,0.00003747463,0.00021478813,0.000031975593],"domain_scores_gemma":[0.99967587,0.00010997051,0.000031472213,0.00008849248,0.000080016085,0.000014281689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099952,0.00031846858,0.00022939076,0.00040292807,0.00037464828,0.0005115411,0.00048672815,0.00041178017,0.001029442],"category_scores_gemma":[0.0010165655,0.00012528876,0.00025427976,0.00035186537,0.00024146083,0.00056391634,0.00030654628,0.00045499636,0.00051499833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004829169,0.000374663,0.004176028,0.0006255873,0.000091384805,0.0010791153,0.00034723937,0.043399327,0.3684827,0.07531684,0.007161314,0.4984629],"study_design_scores_gemma":[0.000045636658,0.0006547473,0.0038916238,0.00006569636,0.00009781973,0.0018312074,0.00017416215,0.48235086,0.40572563,0.033591576,0.071508445,0.00006256541],"about_ca_topic_score_codex":0.00024749347,"about_ca_topic_score_gemma":0.00017399465,"teacher_disagreement_score":0.001029442,"about_ca_system_score_codex":0.0003079758,"about_ca_system_score_gemma":0.0002828767,"threshold_uncertainty_score":0.0034437776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00798354,0.0002327006,0.98779756,0.00010075095,0.00007531863,0.00006348269,0.000021524374,0.0002357015,0.0034895004],"genre_scores_gemma":[0.66988546,0.0003816784,0.32433224,0.0002588361,0.00019541764,0.00026746854,0.00007326618,0.00015868823,0.0044469517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965585,0.0012731227,0.00016824999,0.0006051731,0.0010086551,0.00038631144],"domain_scores_gemma":[0.9970988,0.0016318314,0.0002485221,0.0005364213,0.0003633969,0.00012102323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041072173,0.00094363367,0.0011663823,0.00085352093,0.0011374528,0.0016191709,0.002899421,0.00071500073,0.0025292316],"category_scores_gemma":[0.0065071294,0.00047260363,0.0005682928,0.0011159244,0.0014601792,0.0030437417,0.0015196357,0.0013059126,0.00047597545],"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.00060148776,0.00022557491,0.00095321384,0.00018778039,0.00014619123,0.00016204364,0.00035446006,0.5602419,0.010513802,0.23806065,0.0030958883,0.18545702],"study_design_scores_gemma":[0.000053672513,0.000109889115,0.00018281897,0.000018684828,0.000029920182,0.0001259181,0.000025071973,0.9054773,0.0046631065,0.08244698,0.0068282513,0.000038325394],"about_ca_topic_score_codex":0.0015957557,"about_ca_topic_score_gemma":0.0017443051,"teacher_disagreement_score":0.0041072173,"about_ca_system_score_codex":0.0016685734,"about_ca_system_score_gemma":0.0016562192,"threshold_uncertainty_score":0.021721303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92718714,0.00051339593,0.06270051,0.00095250015,0.000046935642,0.00006913088,0.0021636442,0.0010236354,0.005343103],"genre_scores_gemma":[0.9813949,0.00021137262,0.016180387,0.00009065128,0.00003978856,0.000036896694,0.0014941281,0.00006165395,0.00049028196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997844,0.00006729155,0.000011805017,0.00004247547,0.00006362571,0.000030436611],"domain_scores_gemma":[0.9977452,0.00077087147,0.00060421374,0.00035433535,0.00041327742,0.00011201656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088298524,0.00046976414,0.0004412601,0.001243754,0.00040266002,0.0010695813,0.0006412786,0.000977573,0.0011377014],"category_scores_gemma":[0.0054545878,0.00019312956,0.0001800232,0.0016338145,0.00050104817,0.0019002461,0.00039182452,0.0007597078,0.00024038306],"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.00037081446,0.00046158073,0.35909796,0.00032040218,0.00018395272,0.0006078733,0.0011077034,0.47498176,0.028255137,0.029636465,0.015160001,0.08981635],"study_design_scores_gemma":[0.000015631438,0.00009819417,0.08709058,0.00001993454,0.000017276374,0.00011183421,0.00019856112,0.8980102,0.0039373003,0.007932571,0.0025483344,0.000019593319],"about_ca_topic_score_codex":0.019088987,"about_ca_topic_score_gemma":0.019839076,"teacher_disagreement_score":0.019088987,"about_ca_system_score_codex":0.0008396715,"about_ca_system_score_gemma":0.000489275,"threshold_uncertainty_score":0.03795576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22288497,0.0017128782,0.7427913,0.00045602387,0.001227391,0.0003950203,0.0005749104,0.010721409,0.019236013],"genre_scores_gemma":[0.8510831,0.00029532588,0.14142303,0.00017557589,0.000350306,0.00009673638,0.00041265824,0.00016166219,0.0060015805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.00006875109,0.00004601472,0.00006446543,0.0001470062,0.00008343147],"domain_scores_gemma":[0.99900085,0.00015614537,0.00009002233,0.00023287567,0.00038430205,0.00013578442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010006574,0.0003628897,0.0003980385,0.00035760997,0.0007631352,0.0011618414,0.001396564,0.00043920128,0.0033621758],"category_scores_gemma":[0.0021234853,0.00025454417,0.00024957827,0.00034309697,0.00027750633,0.0010559814,0.0005806396,0.0008396359,0.0010874873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003931842,0.0006421641,0.0080095595,0.0004338086,0.00017757922,0.0011063289,0.00043547575,0.062429324,0.21194288,0.1134232,0.02399802,0.5734699],"study_design_scores_gemma":[0.0004216058,0.00042497067,0.0027375296,0.000030151044,0.00015901528,0.0008155426,0.00008290885,0.8096018,0.08879922,0.0215958,0.07521239,0.00011911602],"about_ca_topic_score_codex":0.0015659969,"about_ca_topic_score_gemma":0.0019203257,"teacher_disagreement_score":0.0033621758,"about_ca_system_score_codex":0.00057225145,"about_ca_system_score_gemma":0.001293541,"threshold_uncertainty_score":0.011247635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878622,0.0006658883,0.006355884,0.00025636805,0.000036125377,0.00002207121,0.00010760173,0.00019514523,0.004498662],"genre_scores_gemma":[0.99871266,0.00010382679,0.0008636997,0.000019988922,0.000010202091,0.0000058253186,0.00006403254,0.00001195898,0.00020788393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990338,0.000167671,0.000032889944,0.0000879761,0.00046316374,0.00021455837],"domain_scores_gemma":[0.99600714,0.0022888016,0.0003739205,0.00025694593,0.0008643219,0.00020885516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015901241,0.00048290912,0.0003595784,0.000881442,0.0005084785,0.0007713902,0.00041687005,0.00044270395,0.0009930624],"category_scores_gemma":[0.004957395,0.00019277466,0.00020595595,0.0010820229,0.00059531257,0.0011442809,0.00032033125,0.0007455706,0.000098521545],"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.0024559337,0.00047960255,0.042908017,0.00035896906,0.00017844666,0.0006030394,0.00038394704,0.69115883,0.1330769,0.030012405,0.0044761677,0.09390776],"study_design_scores_gemma":[0.000036119858,0.00061273575,0.035640903,0.000024573135,0.000059952523,0.00022325169,0.0002021066,0.94134176,0.015876455,0.0041575925,0.0017853272,0.000039262814],"about_ca_topic_score_codex":0.0032633566,"about_ca_topic_score_gemma":0.0030931528,"teacher_disagreement_score":0.0032633566,"about_ca_system_score_codex":0.0015025825,"about_ca_system_score_gemma":0.0004421586,"threshold_uncertainty_score":0.010902107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024860794,0.0012125139,0.96787995,0.0003073716,0.00007804162,0.00015868922,0.00017713985,0.00073583936,0.0045895847],"genre_scores_gemma":[0.41005194,0.0011480206,0.58410215,0.00013990489,0.00009103507,0.00048755613,0.00053816545,0.0001681262,0.003273149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.0003734119,0.000033679746,0.000099461526,0.00014305493,0.00014087264],"domain_scores_gemma":[0.9978411,0.001667154,0.00016168038,0.00010797817,0.00014628575,0.000075808566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465013,0.0010995326,0.0011384913,0.0014056481,0.0009806224,0.0013264018,0.001652399,0.0014377678,0.00368082],"category_scores_gemma":[0.0037487315,0.0007534957,0.0006023432,0.0020120228,0.0012053669,0.0016361964,0.0009956306,0.0009957848,0.00046760697],"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.0000813095,0.000042898202,0.0002153112,0.00007050938,0.000032553355,0.00004881248,0.000056691977,0.9280013,0.00036010143,0.016434725,0.0018356398,0.052820183],"study_design_scores_gemma":[0.000057466637,0.000023150411,0.00005376286,0.000011647354,0.00001093936,0.00002266461,0.000024931502,0.9752863,0.00020535543,0.023326222,0.00097070634,0.000006872811],"about_ca_topic_score_codex":0.0055458862,"about_ca_topic_score_gemma":0.00532005,"teacher_disagreement_score":0.0055458862,"about_ca_system_score_codex":0.0016517241,"about_ca_system_score_gemma":0.0016231965,"threshold_uncertainty_score":0.012313604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03000491,0.00940323,0.92335874,0.0044357893,0.0011761655,0.000110948626,0.00007476416,0.00017640572,0.031259075],"genre_scores_gemma":[0.8929711,0.008581699,0.07789348,0.001392297,0.0037116113,0.00030724445,0.00008189182,0.0001252808,0.014935372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.00036926148,0.0000493411,0.0002256936,0.0004273059,0.00015726723],"domain_scores_gemma":[0.9962269,0.002462469,0.00031593244,0.00023303951,0.0005948163,0.00016682163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026928089,0.0008329751,0.00079946854,0.0006163565,0.0011269323,0.0025175295,0.002673835,0.0017897127,0.0053551905],"category_scores_gemma":[0.010515811,0.00045048195,0.0006415487,0.00080827536,0.0025569557,0.0060937717,0.0010363138,0.0026907646,0.00047088682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003130411,0.00005122114,0.00015685841,0.00013982177,0.000018594534,0.000041584786,0.00014987001,0.027171953,0.0019023458,0.9562857,0.0016246532,0.012426101],"study_design_scores_gemma":[0.000058992344,0.00016140127,0.00026343952,0.000098101635,0.000050627343,0.000062036896,0.00007182638,0.4326139,0.0014136793,0.55161405,0.01356183,0.000030086638],"about_ca_topic_score_codex":0.0017299948,"about_ca_topic_score_gemma":0.0007172751,"teacher_disagreement_score":0.0053551905,"about_ca_system_score_codex":0.001917772,"about_ca_system_score_gemma":0.0011867734,"threshold_uncertainty_score":0.017914832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52106273,0.00062496576,0.4715706,0.00015112283,0.00005751999,0.00005613949,0.0002476733,0.0004162056,0.005813032],"genre_scores_gemma":[0.98958755,0.00016118214,0.009558428,0.000039935538,0.00003401947,0.000026973381,0.00009466602,0.000036112553,0.00046115796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.00012465265,0.00003387972,0.00008214323,0.00033300166,0.00012583139],"domain_scores_gemma":[0.9954758,0.002719514,0.0005261543,0.0003173611,0.000821591,0.00013957347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121566,0.00063730264,0.00037104555,0.0013309898,0.00043774652,0.0011079768,0.0007584257,0.00045397456,0.00097409217],"category_scores_gemma":[0.007421759,0.00020130989,0.00014853847,0.0006751646,0.000982166,0.0012832211,0.00050608284,0.00054304453,0.00015492726],"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.002612614,0.00033281252,0.017518967,0.0003848617,0.000052905794,0.0007371421,0.0008763443,0.52426946,0.23863778,0.1408779,0.0013946306,0.07230455],"study_design_scores_gemma":[0.000014054407,0.00012420637,0.001480924,0.000021262342,0.000010771408,0.00018557133,0.000041011837,0.96764517,0.019092241,0.010735879,0.00062612357,0.000022801027],"about_ca_topic_score_codex":0.0011161545,"about_ca_topic_score_gemma":0.00036843718,"teacher_disagreement_score":0.0013309898,"about_ca_system_score_codex":0.00085328834,"about_ca_system_score_gemma":0.00026286163,"threshold_uncertainty_score":0.006429136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002372574,0.00038367417,0.68828046,0.0005399425,0.00018933983,0.0003769518,0.0027641288,0.29746512,0.0076277945],"genre_scores_gemma":[0.07845451,0.0008120656,0.8504567,0.0006807699,0.0003830949,0.0013975913,0.008585396,0.03881481,0.020415094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541146,0.00082212413,0.00058807136,0.0004947689,0.0023566834,0.00032691014],"domain_scores_gemma":[0.98919123,0.004316787,0.0010875058,0.003161946,0.0014551729,0.0007874032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071979268,0.0018431742,0.0020063433,0.008144754,0.0015422419,0.0062984643,0.004785181,0.0023441513,0.026652742],"category_scores_gemma":[0.022160202,0.0024541751,0.0013881914,0.0040972163,0.0012326497,0.009971135,0.0050519626,0.0045505157,0.016820032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008335443,0.00038279078,0.005000479,0.0007460358,0.00022630139,0.0006836829,0.000886089,0.012860186,0.009806863,0.098576955,0.23793504,0.632062],"study_design_scores_gemma":[0.00036176734,0.00016135866,0.0031156952,0.0004483459,0.00013247128,0.001439963,0.00014684771,0.31908354,0.022011746,0.08068742,0.57202834,0.00038247998],"about_ca_topic_score_codex":0.0033540013,"about_ca_topic_score_gemma":0.0026283832,"teacher_disagreement_score":0.026652742,"about_ca_system_score_codex":0.0019129061,"about_ca_system_score_gemma":0.0023319998,"threshold_uncertainty_score":0.08916235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789529,0.00091023016,0.012822165,0.00021972433,0.00004613497,0.00008050073,0.00010461224,0.00042532242,0.0064384313],"genre_scores_gemma":[0.99427164,0.0005489216,0.003950018,0.000029425384,0.00003593715,0.000035483637,0.00013713082,0.00003698663,0.00095451967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982332,0.0006718845,0.0001004555,0.00015991656,0.0005369384,0.00029763306],"domain_scores_gemma":[0.9940058,0.0035048628,0.000465752,0.0005405642,0.0011603445,0.00032267268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021919622,0.0007049059,0.000535366,0.00094271975,0.0006839396,0.0011206255,0.0009480832,0.00062750914,0.0025353138],"category_scores_gemma":[0.0062152487,0.00016353096,0.00023786783,0.0014141451,0.00047710878,0.001862775,0.000750117,0.0006693505,0.00023215498],"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.0034839485,0.0010194066,0.014003639,0.0008033787,0.0002785935,0.0010945067,0.00042748108,0.82223713,0.04217738,0.012159468,0.004311977,0.09800313],"study_design_scores_gemma":[0.000078006844,0.0019427112,0.0042312513,0.000035371413,0.000089110836,0.00042100268,0.00027524825,0.9750896,0.014626573,0.0012460747,0.0019312416,0.000033835175],"about_ca_topic_score_codex":0.0041255,"about_ca_topic_score_gemma":0.0024522766,"teacher_disagreement_score":0.0041255,"about_ca_system_score_codex":0.001125117,"about_ca_system_score_gemma":0.0005776332,"threshold_uncertainty_score":0.011592329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130514195,0.00038567637,0.98488325,0.000138697,0.000033213077,0.000022905366,0.000023882727,0.000085309824,0.0013757533],"genre_scores_gemma":[0.7895933,0.0022713947,0.2010138,0.00028522062,0.00045085937,0.00020543947,0.000119584154,0.00015440652,0.005906128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963725,0.00009052801,0.00002034053,0.000057059486,0.00015783128,0.000037044007],"domain_scores_gemma":[0.9988955,0.00072604086,0.00012365947,0.000079730075,0.00013094615,0.000044084612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009310898,0.00061655155,0.0004783383,0.001092422,0.00040260438,0.00092324533,0.0010281604,0.0009176067,0.0009669956],"category_scores_gemma":[0.0033365898,0.0002841948,0.00076970144,0.000784049,0.00095882284,0.0015620303,0.00094084657,0.0013730727,0.00016025506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001425395,0.00011251462,0.0017362564,0.00021302242,0.00011889989,0.00042545993,0.0003645736,0.44058445,0.061815564,0.44084483,0.0009618504,0.052679904],"study_design_scores_gemma":[0.0000075794333,0.00004490955,0.000350198,0.000015191696,0.000017446157,0.00012148577,0.000018052908,0.9378585,0.0026387684,0.057426784,0.0014848021,0.000016238346],"about_ca_topic_score_codex":0.0006818193,"about_ca_topic_score_gemma":0.00032094997,"teacher_disagreement_score":0.001092422,"about_ca_system_score_codex":0.0006358136,"about_ca_system_score_gemma":0.00042438085,"threshold_uncertainty_score":0.0049241185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048476737,0.00040358154,0.94717854,0.00043174071,0.00005175064,0.000086738444,0.000032262837,0.00019628592,0.0031422887],"genre_scores_gemma":[0.9491175,0.0002139489,0.049121927,0.00006582663,0.000044935212,0.00011067875,0.00003212548,0.000023395312,0.0012696439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998809,0.00051554426,0.00004451928,0.0001361982,0.00029898484,0.00019582115],"domain_scores_gemma":[0.99895465,0.0006831509,0.00012735072,0.000060716033,0.00010549482,0.00006868968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022717349,0.0008100006,0.00082391396,0.00056995545,0.00084272906,0.001244433,0.0011159313,0.0009261404,0.0010998306],"category_scores_gemma":[0.0033897301,0.00048114706,0.00042614713,0.000664175,0.0013919862,0.0012057378,0.0010671965,0.0011869724,0.000118318254],"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.00008863034,0.000040156156,0.00031050533,0.0000340966,0.000013580397,0.000054160402,0.000096288466,0.94704944,0.0015278225,0.027131101,0.00042305552,0.023231046],"study_design_scores_gemma":[0.000010501736,0.000016740963,0.000042289434,0.0000027080691,0.0000042258207,0.000007737632,0.000009806531,0.9936073,0.00029825003,0.005784726,0.0002117725,0.0000038744233],"about_ca_topic_score_codex":0.006202071,"about_ca_topic_score_gemma":0.00403947,"teacher_disagreement_score":0.006202071,"about_ca_system_score_codex":0.0019500036,"about_ca_system_score_gemma":0.0027522002,"threshold_uncertainty_score":0.0141483545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052631833,0.004025383,0.90904725,0.00085641333,0.00052035996,0.00026282508,0.000081168066,0.011192619,0.02138216],"genre_scores_gemma":[0.8245504,0.0021800722,0.16724348,0.00032129552,0.0006573552,0.00016407619,0.00012694797,0.00061677385,0.004139598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807703,0.00040963746,0.00011272682,0.00022313611,0.00093416794,0.00024338522],"domain_scores_gemma":[0.99519014,0.001818026,0.00040775593,0.0008736905,0.0015701386,0.00014021719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002649674,0.0014109731,0.00090452045,0.001176186,0.00058413914,0.0025954305,0.0020138456,0.0011066615,0.0016723108],"category_scores_gemma":[0.013861016,0.00034822646,0.0004034681,0.0011366177,0.00083664106,0.0031461318,0.0016709284,0.0014491989,0.0012027703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074526336,0.000609922,0.0028160822,0.00050955085,0.000111681344,0.00037643602,0.00040624215,0.2790765,0.11751989,0.04245484,0.01095655,0.54441714],"study_design_scores_gemma":[0.000106588086,0.0004374089,0.0010434143,0.00006571638,0.00013770627,0.00031530898,0.000040374867,0.9180393,0.043534297,0.016730977,0.019432828,0.0001160103],"about_ca_topic_score_codex":0.0013977628,"about_ca_topic_score_gemma":0.00087325036,"teacher_disagreement_score":0.002649674,"about_ca_system_score_codex":0.0008812756,"about_ca_system_score_gemma":0.0007849707,"threshold_uncertainty_score":0.014012992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18841816,0.00097506103,0.7450462,0.00074312265,0.00010182425,0.000130508,0.0005926855,0.001176082,0.062816374],"genre_scores_gemma":[0.95873994,0.0007327018,0.021398101,0.000066356966,0.000038011232,0.00014042051,0.0003747975,0.000113637725,0.018395985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975556,0.00007053558,0.000005415879,0.000037710357,0.00008362906,0.000047114932],"domain_scores_gemma":[0.99963486,0.00016434949,0.00005206344,0.000025159337,0.000103060345,0.000020443455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042609614,0.00063446094,0.00037902143,0.00059516024,0.00039347858,0.00095805805,0.00090185995,0.0008644093,0.004511876],"category_scores_gemma":[0.001648067,0.00022712845,0.00032344882,0.0005856647,0.00039171003,0.00092849723,0.00037075806,0.0005926831,0.0008913645],"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.000017449454,0.000010976911,0.00035331963,0.000011868802,0.0000040778473,0.000029444285,0.000019839821,0.9847607,0.00084232155,0.009455956,0.0004329543,0.004061153],"study_design_scores_gemma":[6.495089e-7,0.0000070786386,0.000055095305,0.0000015197755,9.302809e-7,0.0000065706454,0.0000023300258,0.9985858,0.00013495628,0.000895801,0.0003077979,0.0000015146882],"about_ca_topic_score_codex":0.0054000528,"about_ca_topic_score_gemma":0.0024762035,"teacher_disagreement_score":0.0054000528,"about_ca_system_score_codex":0.0012512387,"about_ca_system_score_gemma":0.0006067997,"threshold_uncertainty_score":0.015093684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021954417,0.002652292,0.9707948,0.0006226918,0.00025341494,0.00012578552,0.000025390636,0.00025174758,0.0033194826],"genre_scores_gemma":[0.6485781,0.007998484,0.33731613,0.0005507737,0.001120489,0.00022803289,0.00013631096,0.00023884016,0.0038328725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879324,0.00048919354,0.00007858757,0.00009950063,0.00043100788,0.00010847794],"domain_scores_gemma":[0.9974529,0.0017354923,0.00015909846,0.00021565946,0.00034924658,0.00008758075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023963465,0.00072085793,0.0006668682,0.0007306638,0.00080307823,0.0012120127,0.0014043889,0.00059165334,0.0007121731],"category_scores_gemma":[0.0056555895,0.00037766996,0.0003198875,0.0009513453,0.0010598934,0.00209813,0.0008502816,0.0012657052,0.00027403553],"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.0006010862,0.00015644787,0.0010281234,0.0002472977,0.000054310858,0.00022159137,0.0002892641,0.7204799,0.013938147,0.06796888,0.0047938903,0.19022101],"study_design_scores_gemma":[0.000025203282,0.00011743389,0.00017170278,0.000018202163,0.0000179133,0.000056671488,0.00003326116,0.9800832,0.0026848488,0.013938493,0.0028388542,0.000014156109],"about_ca_topic_score_codex":0.0027131347,"about_ca_topic_score_gemma":0.0024110787,"teacher_disagreement_score":0.0027131347,"about_ca_system_score_codex":0.0014495227,"about_ca_system_score_gemma":0.0010778086,"threshold_uncertainty_score":0.012673259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010940203,0.00040399487,0.9760105,0.00020135743,0.00012430591,0.00012473128,0.002873074,0.011233452,0.007934691],"genre_scores_gemma":[0.04486,0.0026586168,0.9063766,0.0005488674,0.00021160924,0.001269555,0.020985449,0.0042293286,0.018860001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998606,0.00040719786,0.00020927035,0.00017520612,0.00050467375,0.00009771137],"domain_scores_gemma":[0.9986312,0.00056038186,0.000115710616,0.00032896467,0.00028851794,0.000075197815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015804117,0.0018143747,0.00092546735,0.0021687886,0.00072402734,0.0033024978,0.00252622,0.0013246634,0.02694256],"category_scores_gemma":[0.0048985532,0.00080162816,0.001418868,0.0020755294,0.0009640225,0.0040427786,0.0022090308,0.002168023,0.010700061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002735889,0.00008199781,0.0010998003,0.0014077396,0.00010041103,0.00075008307,0.00072179997,0.094292745,0.0054317215,0.49822208,0.112121634,0.28549644],"study_design_scores_gemma":[0.0000661167,0.000054022923,0.00016473664,0.0002325411,0.00003220541,0.0006842475,0.00009599111,0.14572266,0.005510698,0.14003038,0.70735765,0.000048750284],"about_ca_topic_score_codex":0.002169097,"about_ca_topic_score_gemma":0.0023799683,"teacher_disagreement_score":0.02694256,"about_ca_system_score_codex":0.0010799248,"about_ca_system_score_gemma":0.0011618647,"threshold_uncertainty_score":0.09013182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12206605,0.0040100776,0.86251366,0.00047757468,0.00038372978,0.0005012088,0.00017624763,0.0029317867,0.006939671],"genre_scores_gemma":[0.91911286,0.0009392614,0.07698962,0.0001738747,0.00010832417,0.00015276579,0.00015186041,0.0000483993,0.0023229967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929476,0.00013546034,0.00005219474,0.00007155871,0.0003627853,0.00008325057],"domain_scores_gemma":[0.99875283,0.00043042176,0.00019301998,0.00023520556,0.00033205634,0.000056496403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015045045,0.0005575011,0.00046677972,0.0007051102,0.00055088167,0.0007248596,0.0017660687,0.0004334891,0.0014750508],"category_scores_gemma":[0.004003671,0.00011745975,0.00028048895,0.0005573547,0.00047729755,0.0010736928,0.0007374405,0.00082484086,0.00024875868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001857171,0.00048773974,0.002197777,0.0005644673,0.000137216,0.00030093658,0.0002811411,0.2219199,0.1063428,0.050880186,0.007059773,0.607971],"study_design_scores_gemma":[0.00015108431,0.00064025825,0.0014884755,0.000039964805,0.000091144044,0.0003155845,0.000044370227,0.94325966,0.03556666,0.011160347,0.007197399,0.00004509669],"about_ca_topic_score_codex":0.0015619159,"about_ca_topic_score_gemma":0.0016356885,"teacher_disagreement_score":0.0017660687,"about_ca_system_score_codex":0.0011206911,"about_ca_system_score_gemma":0.00038251685,"threshold_uncertainty_score":0.008131206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14465412,0.00091466744,0.8474283,0.00029331405,0.00009286599,0.00017155586,0.00003910056,0.0018654962,0.0045406157],"genre_scores_gemma":[0.83585066,0.000531094,0.1614826,0.0001368914,0.00014799868,0.00011611675,0.000049181937,0.000074350166,0.0016111563],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997801,0.000044407716,0.000013461614,0.000025856343,0.000097692646,0.0000384072],"domain_scores_gemma":[0.999337,0.00028870808,0.00011786188,0.00012414479,0.0001012093,0.000030988907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039648786,0.00046919176,0.0002310522,0.00083127705,0.00028195395,0.0004304352,0.0007680477,0.00036897248,0.0017887886],"category_scores_gemma":[0.0018970077,0.0001754765,0.00028030557,0.00031275145,0.00047750643,0.00067144516,0.00061816466,0.0007215199,0.000263341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004278992,0.00037670578,0.0009658744,0.00027173135,0.000068856025,0.00038903768,0.00033534635,0.11228796,0.48160028,0.03976959,0.0018632531,0.36164364],"study_design_scores_gemma":[0.00020384528,0.0010268354,0.0019598843,0.00010769741,0.00014644708,0.00080584927,0.00011965299,0.75534636,0.2109361,0.020841945,0.0084339045,0.00007150471],"about_ca_topic_score_codex":0.0003336504,"about_ca_topic_score_gemma":0.00032184744,"teacher_disagreement_score":0.0017887886,"about_ca_system_score_codex":0.00018399359,"about_ca_system_score_gemma":0.00019460781,"threshold_uncertainty_score":0.0059841275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131628,0.00061943626,0.9818392,0.00038716852,0.0001287726,0.000029888763,0.000022129321,0.00037129704,0.003439329],"genre_scores_gemma":[0.89146405,0.0009199322,0.10167429,0.00025914406,0.00022511199,0.00010864588,0.000042140706,0.000077577984,0.0052291183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991505,0.00017601177,0.000025418107,0.000116671225,0.00042812855,0.00010334793],"domain_scores_gemma":[0.99814856,0.0009614715,0.00021600488,0.00015912777,0.00043308907,0.00008175867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010776714,0.00074158784,0.00035104665,0.00044871902,0.0004553452,0.0011188143,0.0012185978,0.0007371039,0.0019832917],"category_scores_gemma":[0.0044977735,0.0002952424,0.00045715465,0.00028782716,0.0010193057,0.0016656163,0.00084733,0.00129257,0.0002744162],"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.0000657109,0.00007396613,0.0004939408,0.00009862004,0.000031747633,0.00014046322,0.00013838644,0.67472684,0.0091758985,0.2576268,0.0025566912,0.054870903],"study_design_scores_gemma":[0.000010268739,0.00003237308,0.000094288815,0.000008534129,0.000013925226,0.00003525561,0.000008150827,0.96324,0.002185227,0.032424293,0.0019363763,0.000011224954],"about_ca_topic_score_codex":0.002932349,"about_ca_topic_score_gemma":0.002422976,"teacher_disagreement_score":0.002932349,"about_ca_system_score_codex":0.0011641696,"about_ca_system_score_gemma":0.0011998843,"threshold_uncertainty_score":0.008446693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034146883,0.00014949105,0.9604225,0.00015587603,0.000112454494,0.00007426099,0.000020856933,0.0019191043,0.0029985076],"genre_scores_gemma":[0.88306046,0.000059461963,0.114900805,0.00014326363,0.00008393049,0.000114926785,0.000024760098,0.000039097766,0.0015733239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.000060984992,0.000028316525,0.000112058224,0.00018156524,0.000041346957],"domain_scores_gemma":[0.99947506,0.00010927898,0.00011283165,0.000065235225,0.00020138278,0.000036273395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005155671,0.00036549903,0.00035988053,0.00030408695,0.000368509,0.00065174105,0.0011623384,0.00037357904,0.0017087319],"category_scores_gemma":[0.0012067558,0.00016238469,0.00021548665,0.00016182238,0.00031081136,0.00040678747,0.00039381333,0.00073565036,0.0004951096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007294468,0.0006434706,0.0031795974,0.00029928784,0.00013030405,0.00034600263,0.00033284686,0.22593172,0.23580182,0.02027475,0.0042034034,0.50812733],"study_design_scores_gemma":[0.00010337203,0.00034111817,0.0004279898,0.000009213466,0.00003444123,0.00016472649,0.000016973881,0.95100385,0.042771637,0.0017145857,0.003386035,0.000025988978],"about_ca_topic_score_codex":0.0007288835,"about_ca_topic_score_gemma":0.0007875008,"teacher_disagreement_score":0.0017087319,"about_ca_system_score_codex":0.00032205062,"about_ca_system_score_gemma":0.00042296952,"threshold_uncertainty_score":0.005716324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009050518,0.00015492525,0.988938,0.00005420069,0.000040076375,0.000070981514,0.000019807581,0.0011518251,0.0005197513],"genre_scores_gemma":[0.18258506,0.0002320116,0.8136061,0.00019209269,0.00004571286,0.00022045935,0.00019080404,0.00021392651,0.0027139643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.0001201456,0.000050321465,0.00009272789,0.00021303864,0.00008461679],"domain_scores_gemma":[0.9992017,0.00023507778,0.000087880435,0.00018600386,0.00022009274,0.00006920072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632268,0.00048343115,0.00073518394,0.00079234503,0.00050866127,0.0010257815,0.0014565061,0.00077102793,0.0027143413],"category_scores_gemma":[0.0026495506,0.00030891772,0.00027161854,0.00075893215,0.00067136355,0.0017163759,0.0010032414,0.0009559077,0.001551426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009042455,0.0002271716,0.0012537115,0.00029577463,0.00004928628,0.00013278618,0.00031337678,0.125467,0.050609402,0.016976645,0.0052181096,0.79855245],"study_design_scores_gemma":[0.00013701145,0.00015105103,0.000253828,0.000022079423,0.000019184177,0.00013305403,0.000057378125,0.9670661,0.018351644,0.0064219832,0.007361148,0.000025564503],"about_ca_topic_score_codex":0.002731459,"about_ca_topic_score_gemma":0.0016953255,"teacher_disagreement_score":0.002731459,"about_ca_system_score_codex":0.00074897095,"about_ca_system_score_gemma":0.0015243124,"threshold_uncertainty_score":0.00908035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26583764,0.0011345969,0.72264135,0.00061048585,0.00016170248,0.00018108367,0.00014038147,0.00037356885,0.008919114],"genre_scores_gemma":[0.8769809,0.00058684836,0.115571246,0.0000873326,0.000056205874,0.000122000805,0.0001229199,0.000022494049,0.0064500766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981433,0.00006852729,0.000004951551,0.000035172034,0.0000474044,0.000029564628],"domain_scores_gemma":[0.9997856,0.00009016714,0.000015341038,0.000017543609,0.00006952297,0.000021785681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041544682,0.00031578442,0.0002773418,0.00034463202,0.00055658014,0.00067880604,0.00069206406,0.00040342155,0.0020469285],"category_scores_gemma":[0.00060853193,0.00012565967,0.00025707873,0.00041943672,0.00030722478,0.0009666963,0.00034081287,0.00040886275,0.00017575915],"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.00076634705,0.00047653413,0.0041383076,0.00031355704,0.00013591068,0.00064588274,0.0002895006,0.5878638,0.05067613,0.22855988,0.009904669,0.116229475],"study_design_scores_gemma":[0.000048729427,0.00023309003,0.0003769124,0.000006996966,0.000028641361,0.00010306186,0.000053429765,0.98387927,0.0032247312,0.0076009436,0.0044331555,0.0000110557585],"about_ca_topic_score_codex":0.0028280672,"about_ca_topic_score_gemma":0.004420594,"teacher_disagreement_score":0.0028280672,"about_ca_system_score_codex":0.0009863897,"about_ca_system_score_gemma":0.00052123715,"threshold_uncertainty_score":0.0071567297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039701216,0.0008124256,0.9552506,0.00019292173,0.00014446289,0.00007740023,0.000020641959,0.00070415635,0.0030961568],"genre_scores_gemma":[0.71754146,0.00086039165,0.27825835,0.00016368579,0.00023086763,0.00011385327,0.000084176536,0.000057763827,0.0026893986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913836,0.00032224346,0.00005773212,0.00008667956,0.00029273497,0.00010220315],"domain_scores_gemma":[0.998914,0.00034346362,0.00011838661,0.00018954027,0.00034183727,0.0000927614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014671352,0.00064953475,0.0005684356,0.0006688917,0.00072642526,0.00094674644,0.0016528049,0.0007993018,0.0006597105],"category_scores_gemma":[0.0020685843,0.0003224313,0.0005934895,0.0003814175,0.0005361358,0.0019883127,0.0014106802,0.0010996677,0.0002793803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009722927,0.00040275918,0.0026019032,0.00057216437,0.00025485537,0.0009457294,0.0010224028,0.16443951,0.18821871,0.25545114,0.0029606135,0.38215792],"study_design_scores_gemma":[0.00006248168,0.0004251669,0.00024895478,0.000045406614,0.00013720243,0.00027973496,0.000044883087,0.9244224,0.036907453,0.025790518,0.011558089,0.00007765922],"about_ca_topic_score_codex":0.00066131697,"about_ca_topic_score_gemma":0.0005953574,"teacher_disagreement_score":0.0016528049,"about_ca_system_score_codex":0.0006086421,"about_ca_system_score_gemma":0.00042001868,"threshold_uncertainty_score":0.0077590346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44241762,0.004249029,0.5305005,0.00042809843,0.0007635902,0.00025929304,0.00015211046,0.0016096556,0.019620113],"genre_scores_gemma":[0.9909287,0.00023977624,0.008057072,0.00003146905,0.00002143908,0.0000458817,0.00003596316,0.000018267616,0.0006214685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950886,0.00014880895,0.000032671378,0.000070091206,0.00016415508,0.00007542291],"domain_scores_gemma":[0.99800533,0.0010597986,0.00011723609,0.00012387229,0.0006364968,0.000057333356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017956867,0.0007008404,0.00072165765,0.00069624296,0.0005289082,0.00096928875,0.0009375102,0.0008208651,0.0016718562],"category_scores_gemma":[0.00395031,0.00021257519,0.00033267814,0.00034516206,0.00034029258,0.0005098257,0.00034896372,0.0007544003,0.00020662036],"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.0023890636,0.00047203214,0.003296411,0.0007737747,0.0002709053,0.00015389842,0.0002312189,0.7897574,0.0163944,0.00868357,0.0018861778,0.17569113],"study_design_scores_gemma":[0.00009873872,0.00040797426,0.0010565922,0.000020530231,0.000089338784,0.000031330674,0.000044565506,0.99144286,0.0052865874,0.0007920633,0.000716151,0.000013303882],"about_ca_topic_score_codex":0.004600213,"about_ca_topic_score_gemma":0.0027147194,"teacher_disagreement_score":0.004600213,"about_ca_system_score_codex":0.0008605497,"about_ca_system_score_gemma":0.00089551107,"threshold_uncertainty_score":0.00949657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88988805,0.0018812348,0.1030751,0.0004604823,0.00012073124,0.00009283555,0.0013164685,0.0013876911,0.0017774603],"genre_scores_gemma":[0.98636484,0.00029224213,0.011636556,0.000028225613,0.000026805355,0.00004572918,0.0011937044,0.00004388862,0.00036788118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753916,0.0009573776,0.00023984961,0.0005154467,0.0005765024,0.0001716454],"domain_scores_gemma":[0.9647892,0.025972717,0.002102753,0.003752447,0.0029171682,0.00046566557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009762533,0.0010579429,0.00077046826,0.0012244368,0.0004626986,0.0008403487,0.0009353297,0.0013167314,0.0010672763],"category_scores_gemma":[0.028841373,0.00028320888,0.00058197486,0.0010109373,0.00048570853,0.0021876644,0.000747449,0.0013417815,0.0003746188],"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.0011042627,0.00065770943,0.099133596,0.00030726282,0.00044834422,0.00017062336,0.00024125859,0.78053343,0.0050955955,0.0018458624,0.0022291346,0.108233035],"study_design_scores_gemma":[0.000011464852,0.00043981933,0.01578041,0.00002332348,0.0000360915,0.000079428304,0.00007175099,0.9799795,0.0026231897,0.00058099936,0.00034788327,0.000026129079],"about_ca_topic_score_codex":0.006620007,"about_ca_topic_score_gemma":0.0033381856,"teacher_disagreement_score":0.009762533,"about_ca_system_score_codex":0.0006639783,"about_ca_system_score_gemma":0.0006103305,"threshold_uncertainty_score":0.05162984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3986821,0.00515743,0.5313174,0.0012041158,0.00036498642,0.00020644421,0.00051772007,0.0022985216,0.060251247],"genre_scores_gemma":[0.9920141,0.00034129745,0.005918848,0.000060192328,0.00007536242,0.000022521957,0.0001097495,0.000061467144,0.0013964592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958859,0.00095677766,0.00008921282,0.00037949617,0.0017337707,0.00095492805],"domain_scores_gemma":[0.9884135,0.0065308018,0.00069123396,0.0011769955,0.00283287,0.00035472153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003913156,0.0010955407,0.00096950575,0.001592017,0.0007155113,0.0019472056,0.0016849259,0.00084562285,0.004288925],"category_scores_gemma":[0.016456138,0.000304462,0.00040468317,0.0015587602,0.00077371515,0.0016852234,0.0009062388,0.0009708548,0.00065408205],"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.0006270381,0.0001571783,0.003177705,0.00011404949,0.0000763332,0.0001522762,0.000117615615,0.88860744,0.008567947,0.056634735,0.0024381615,0.039329465],"study_design_scores_gemma":[0.000004936031,0.0000553424,0.00035272285,0.0000050761387,0.000008825992,0.00004502778,0.000013615748,0.9952661,0.0012090399,0.00276436,0.00026623168,0.000008774528],"about_ca_topic_score_codex":0.0060862764,"about_ca_topic_score_gemma":0.002408504,"teacher_disagreement_score":0.0060862764,"about_ca_system_score_codex":0.0037250342,"about_ca_system_score_gemma":0.0019004507,"threshold_uncertainty_score":0.02702719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17140692,0.0023770703,0.7826314,0.00088132883,0.0001956025,0.00013298832,0.00058573537,0.0054214285,0.036367543],"genre_scores_gemma":[0.89736056,0.0011683797,0.09302925,0.00022853902,0.000103241524,0.00005621207,0.0005795076,0.0001433189,0.007330999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930716,0.00010365148,0.000053835305,0.00005087899,0.00039127303,0.00009314183],"domain_scores_gemma":[0.9989422,0.00040744842,0.00008440607,0.00019280487,0.00031611597,0.000056937217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008371262,0.0004043502,0.0003519219,0.00037153487,0.00044022652,0.0010669281,0.00074641657,0.0005165824,0.0024923554],"category_scores_gemma":[0.002915237,0.0001637491,0.000100134646,0.0003140353,0.00027104578,0.0011901605,0.00060146005,0.00050908374,0.00080086617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015267801,0.00050855137,0.003701687,0.0004232552,0.0000464997,0.000879749,0.00043852537,0.12877175,0.26762596,0.1520191,0.018284451,0.42577365],"study_design_scores_gemma":[0.00011198195,0.00017866238,0.0015366237,0.00004105854,0.000028436325,0.00032658156,0.00008445879,0.7602703,0.15075032,0.049119562,0.037499037,0.00005301713],"about_ca_topic_score_codex":0.00087787677,"about_ca_topic_score_gemma":0.0007735434,"teacher_disagreement_score":0.0024923554,"about_ca_system_score_codex":0.00051893626,"about_ca_system_score_gemma":0.00040020954,"threshold_uncertainty_score":0.008337796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16553558,0.0008977411,0.8295259,0.00018382432,0.00021570706,0.00020259761,0.00010858313,0.00064626883,0.002683792],"genre_scores_gemma":[0.9121209,0.0002471582,0.08677013,0.000048916398,0.00012321824,0.00008266345,0.00009989981,0.000030599513,0.0004764967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.00010143846,0.000026158952,0.000058860795,0.00012436789,0.00007032176],"domain_scores_gemma":[0.99916685,0.00025157523,0.00014630111,0.000099174664,0.00021900512,0.000117115254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008130927,0.00037147483,0.00043481367,0.0004831156,0.0008929937,0.00082315353,0.0010438379,0.00033188684,0.0008783198],"category_scores_gemma":[0.0017283191,0.0002006593,0.00025852327,0.0006338219,0.00036737585,0.0005058993,0.00046649552,0.0004942955,0.00016982561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012070208,0.0004026967,0.004903953,0.0005577252,0.00009464844,0.00049616036,0.000498452,0.24284436,0.24642678,0.03890701,0.0052595963,0.45840165],"study_design_scores_gemma":[0.00009015337,0.00033159595,0.0011806292,0.000012198152,0.000037442678,0.00026456566,0.00007230865,0.9747952,0.016832398,0.0034991114,0.0028556176,0.000028742374],"about_ca_topic_score_codex":0.0019485821,"about_ca_topic_score_gemma":0.0032762948,"teacher_disagreement_score":0.0019485821,"about_ca_system_score_codex":0.0010539623,"about_ca_system_score_gemma":0.0013995643,"threshold_uncertainty_score":0.0076470375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8670868,0.00033818334,0.12332125,0.00064835814,0.000055551995,0.000117859134,0.00027237463,0.00021418238,0.0079454],"genre_scores_gemma":[0.994487,0.00030703098,0.0042473944,0.00003105786,0.000017973915,0.00004996399,0.000057718633,0.000015893558,0.0007859505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930334,0.00034113368,0.000019833933,0.00006209911,0.00017324039,0.00010047578],"domain_scores_gemma":[0.9976701,0.0014477626,0.0003825886,0.00014624617,0.00023329322,0.000119953984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010345659,0.00072912005,0.00060122105,0.0006264437,0.0004983836,0.0009269464,0.0010270919,0.00093741424,0.0008734147],"category_scores_gemma":[0.005426673,0.00026786383,0.0004164006,0.0006553661,0.0011176133,0.0013377399,0.00051853847,0.00071651465,0.00012188078],"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.000053321317,0.000040776726,0.0008618565,0.000023646619,0.000011324756,0.00006917171,0.000031945456,0.97886425,0.0033324126,0.015548446,0.00008714263,0.0010758499],"study_design_scores_gemma":[0.000009154139,0.000045178385,0.00028048834,0.0000026897058,0.000011811151,0.00001714922,0.000008298312,0.9954449,0.00047258014,0.0036276972,0.000074761345,0.000005263492],"about_ca_topic_score_codex":0.0031326073,"about_ca_topic_score_gemma":0.0015894672,"teacher_disagreement_score":0.0031326073,"about_ca_system_score_codex":0.0010803106,"about_ca_system_score_gemma":0.0005597995,"threshold_uncertainty_score":0.00783819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025980946,0.0011002802,0.9602066,0.000562702,0.00018960773,0.00009473106,0.00006145895,0.0003109817,0.011492671],"genre_scores_gemma":[0.88184017,0.0007950393,0.10696756,0.00028767655,0.0005585793,0.0002189682,0.00007212884,0.00011633619,0.009143497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983144,0.00051801687,0.00007557939,0.00027214925,0.00045844124,0.0003614494],"domain_scores_gemma":[0.99662787,0.0016212263,0.000445243,0.00036301068,0.000657641,0.0002849506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033122574,0.0011715948,0.0007795581,0.0007265869,0.0009300683,0.0023669177,0.0016947566,0.0010580341,0.0032234981],"category_scores_gemma":[0.00569827,0.00027604733,0.0004653916,0.0008673288,0.0013042749,0.0038818242,0.0016624279,0.0013532909,0.00035171193],"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.00047603625,0.00031538832,0.0019025176,0.000378212,0.00010196956,0.00020060269,0.00036954798,0.27649677,0.01454004,0.53163457,0.0050250683,0.16855936],"study_design_scores_gemma":[0.00010527531,0.0006150885,0.0008356508,0.000054420776,0.00012564252,0.00026143555,0.00013152877,0.73109615,0.011149111,0.24094824,0.014635729,0.000041674157],"about_ca_topic_score_codex":0.00076622784,"about_ca_topic_score_gemma":0.00081277004,"teacher_disagreement_score":0.0033122574,"about_ca_system_score_codex":0.0009856739,"about_ca_system_score_gemma":0.0015979267,"threshold_uncertainty_score":0.01751709},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040981255,0.005731272,0.94705534,0.00065767503,0.00019357861,0.00009840877,0.00019930162,0.0019165114,0.0031666972],"genre_scores_gemma":[0.30742565,0.0046966653,0.68466425,0.00012949963,0.00030799618,0.00013624511,0.0005407373,0.00030163772,0.001797303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99365693,0.0029410112,0.00033300873,0.00062937377,0.0022550481,0.00018467644],"domain_scores_gemma":[0.97061104,0.019334784,0.0012092944,0.0025348624,0.006068346,0.00024174992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008723445,0.0016436959,0.0011985855,0.0035694407,0.00048161368,0.0011902932,0.0019548414,0.0013813489,0.0018279812],"category_scores_gemma":[0.035190888,0.0007158366,0.0009310348,0.003192553,0.00056777656,0.0041874545,0.0014506604,0.0015612347,0.0005641225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044725795,0.00023035846,0.007060326,0.00051521516,0.00035145038,0.0000652653,0.0002532037,0.23243953,0.005127163,0.0077508613,0.0034493026,0.7423101],"study_design_scores_gemma":[0.000029495795,0.00012226938,0.0038917523,0.00004880052,0.00006528668,0.00012969118,0.000062235646,0.98473233,0.0060239234,0.0026285292,0.0022107023,0.000054925284],"about_ca_topic_score_codex":0.008398614,"about_ca_topic_score_gemma":0.0048814802,"teacher_disagreement_score":0.008723445,"about_ca_system_score_codex":0.00091598375,"about_ca_system_score_gemma":0.00087526167,"threshold_uncertainty_score":0.04613459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067023635,0.00025578123,0.98612195,0.0004276297,0.000091592716,0.000059429673,0.00011492443,0.000070871516,0.006155464],"genre_scores_gemma":[0.70944905,0.0020542184,0.24785419,0.0005293223,0.0005193135,0.0007501858,0.0005196038,0.00027757115,0.038046528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881256,0.00031249088,0.000048497328,0.00018620452,0.00045136956,0.00018896714],"domain_scores_gemma":[0.9983891,0.0008854191,0.00015391156,0.00015254771,0.00031427553,0.00010471651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015308872,0.0012614081,0.00074155116,0.00081723987,0.0006631226,0.0020692134,0.0038397212,0.0020185912,0.0054820688],"category_scores_gemma":[0.004274657,0.00058208307,0.0009066362,0.0009021732,0.0009828438,0.0067703635,0.0011720741,0.0021892658,0.0008260498],"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.000037603215,0.00005560613,0.0002493795,0.000072114046,0.000015846957,0.00010040317,0.000044295037,0.5051971,0.0014394448,0.474852,0.0028309368,0.01510526],"study_design_scores_gemma":[0.0000058866226,0.00002004394,0.000053999192,0.0000075627618,0.000008170591,0.000050643004,0.0000101074775,0.93636256,0.00025328723,0.05966234,0.0035565924,0.0000088680445],"about_ca_topic_score_codex":0.00284046,"about_ca_topic_score_gemma":0.0021507628,"teacher_disagreement_score":0.0054820688,"about_ca_system_score_codex":0.0020917433,"about_ca_system_score_gemma":0.0010970958,"threshold_uncertainty_score":0.018339396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019664785,0.0014853618,0.97518754,0.00035650263,0.000088585446,0.000049478942,0.00010761715,0.000388486,0.0026716709],"genre_scores_gemma":[0.9225493,0.0010625258,0.07410523,0.00017632911,0.0001852439,0.00021527885,0.00013290119,0.00016376663,0.0014094803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99119264,0.001989679,0.00040020133,0.0011904824,0.0042404886,0.0009864727],"domain_scores_gemma":[0.9370881,0.048002522,0.0046748505,0.004492738,0.0049926406,0.00074917247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015163427,0.0021800606,0.0014531831,0.0023514088,0.0011357361,0.0040153456,0.0026953188,0.0018360828,0.0022616242],"category_scores_gemma":[0.065796584,0.000939378,0.001480033,0.00149753,0.005234033,0.0051881624,0.0030487333,0.0038231213,0.00035995257],"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.00024364726,0.000045740642,0.0004897203,0.00013655385,0.000079953374,0.000061316765,0.00011224528,0.85857016,0.008097233,0.11957291,0.00032820262,0.0122624235],"study_design_scores_gemma":[0.000014410792,0.000059991507,0.00018212631,0.000022761871,0.000018451752,0.000018144612,0.000007624039,0.9607284,0.0027996222,0.03579338,0.0003261724,0.000028858702],"about_ca_topic_score_codex":0.004181821,"about_ca_topic_score_gemma":0.002170774,"teacher_disagreement_score":0.015163427,"about_ca_system_score_codex":0.0058064284,"about_ca_system_score_gemma":0.0026239443,"threshold_uncertainty_score":0.080192804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08489235,0.00016683518,0.9138599,0.00020105345,0.000017024557,0.000024242854,0.00002044814,0.00027721544,0.0005409168],"genre_scores_gemma":[0.9246105,0.00016292761,0.07432475,0.00003741143,0.000019829613,0.00006120715,0.000033133154,0.000021906364,0.0007283962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.00019131812,0.000022073385,0.000103891056,0.00015119361,0.00007672825],"domain_scores_gemma":[0.9979868,0.0012194283,0.00029516284,0.00019489382,0.00018671606,0.00011704601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011220783,0.0005844123,0.00070963893,0.0005949538,0.0005927834,0.00085863756,0.0014675271,0.0010717078,0.00055715314],"category_scores_gemma":[0.0055611394,0.00038062423,0.00036361555,0.00053328375,0.0013490964,0.0021236795,0.0013539921,0.0008626358,0.000081518396],"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.000053794436,0.000024548524,0.000753456,0.000019246909,0.00001552224,0.000034633103,0.000072974515,0.96630746,0.0025426124,0.01376401,0.00017010828,0.016241709],"study_design_scores_gemma":[0.0000043748887,0.000013157822,0.00003653271,8.426689e-7,0.0000017230361,0.000005246358,0.0000055452233,0.99405044,0.00047100516,0.005283038,0.0001254027,0.0000026409696],"about_ca_topic_score_codex":0.0048568067,"about_ca_topic_score_gemma":0.0024647755,"teacher_disagreement_score":0.0048568067,"about_ca_system_score_codex":0.0011539486,"about_ca_system_score_gemma":0.0008422004,"threshold_uncertainty_score":0.009657025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064288884,0.000110645145,0.93446124,0.00008539955,0.000018007167,0.000021303656,0.000040431747,0.00024083213,0.00073330983],"genre_scores_gemma":[0.78798616,0.00043138457,0.20997266,0.000032855536,0.00003719379,0.000051884297,0.00016714484,0.00006226115,0.001258497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997552,0.00006208229,0.000013915021,0.000033890836,0.000112548674,0.000022357663],"domain_scores_gemma":[0.999433,0.00025267605,0.00009276836,0.00008775153,0.000115232964,0.000018502358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006927899,0.00044483767,0.00036737093,0.0007400044,0.00021351915,0.0006221223,0.0004587078,0.00045944625,0.0004427873],"category_scores_gemma":[0.0022050438,0.00022699356,0.0005018316,0.0006680848,0.00022945987,0.0013518204,0.0003747715,0.00067694776,0.00017333642],"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.00008389027,0.00008344464,0.0031961028,0.000052966683,0.00005377735,0.00015281,0.00016716126,0.8478095,0.02520646,0.023481265,0.00077394303,0.09893858],"study_design_scores_gemma":[0.0000011782338,0.000006127547,0.00012640507,0.000001178989,0.0000022063184,0.000010353927,0.0000034969423,0.9980374,0.00082046096,0.0008536384,0.0001351599,0.0000025465486],"about_ca_topic_score_codex":0.0023591847,"about_ca_topic_score_gemma":0.0015356848,"teacher_disagreement_score":0.0023591847,"about_ca_system_score_codex":0.00057600724,"about_ca_system_score_gemma":0.00033384227,"threshold_uncertainty_score":0.004690945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13297372,0.00036074597,0.8323058,0.0007479522,0.0006398724,0.000715276,0.00038277224,0.013825543,0.018048247],"genre_scores_gemma":[0.54401284,0.0003441197,0.44482586,0.0005545306,0.0001729136,0.0003648376,0.0009097389,0.00038878614,0.008426486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992878,0.00017158016,0.00009092233,0.00010049146,0.00018733034,0.0001619197],"domain_scores_gemma":[0.99829274,0.00038371008,0.00016254437,0.00053205725,0.0005157153,0.000113145536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670313,0.000725642,0.0005279809,0.0009819607,0.00091101776,0.0020199989,0.0016442217,0.0013101401,0.0034164297],"category_scores_gemma":[0.0028895151,0.00040287545,0.0003706782,0.00077979325,0.00067127077,0.0019467005,0.0011328063,0.0014233135,0.0018164417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00212925,0.0023784577,0.01826082,0.0006644965,0.00021434903,0.0008109639,0.001581929,0.08608306,0.19845164,0.1219321,0.020429004,0.5470639],"study_design_scores_gemma":[0.00043681462,0.000854311,0.0023773639,0.00010315832,0.00013655808,0.0006551851,0.00014933832,0.588524,0.2405831,0.036282204,0.12971999,0.00017802347],"about_ca_topic_score_codex":0.0014114301,"about_ca_topic_score_gemma":0.00076960237,"teacher_disagreement_score":0.0034164297,"about_ca_system_score_codex":0.0007425259,"about_ca_system_score_gemma":0.0008076717,"threshold_uncertainty_score":0.011429071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050809097,0.0011589428,0.94268185,0.0003526495,0.00012303436,0.000033384058,0.000103593964,0.0010911947,0.003646341],"genre_scores_gemma":[0.90683633,0.0005941749,0.088199325,0.0001187192,0.000105034735,0.00006680675,0.00017055847,0.000032712574,0.0038763103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981767,0.000046258145,0.000012126201,0.000039680734,0.000057836583,0.00002648381],"domain_scores_gemma":[0.99954766,0.00019918682,0.000037775895,0.00001891265,0.00018405367,0.00001237045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044914676,0.0003880208,0.00038674191,0.00046111923,0.00021029756,0.00048386244,0.00056311605,0.00059412903,0.001395507],"category_scores_gemma":[0.0017882107,0.00020005657,0.00020691866,0.00051062694,0.00018924335,0.0007016229,0.00034140926,0.0006351492,0.00026752386],"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.00018369107,0.000076961194,0.0011701843,0.00006210696,0.000037697235,0.00004095369,0.000024116245,0.71808016,0.0067073065,0.0033794648,0.001788191,0.26844922],"study_design_scores_gemma":[0.0000018263288,0.000005415973,0.00010525449,0.0000011972161,0.0000021281933,0.000002625866,0.0000010794503,0.9989342,0.00053495046,0.00033027964,0.000079236575,0.000001827972],"about_ca_topic_score_codex":0.0073910896,"about_ca_topic_score_gemma":0.0052779354,"teacher_disagreement_score":0.0073910896,"about_ca_system_score_codex":0.0005831384,"about_ca_system_score_gemma":0.0004076545,"threshold_uncertainty_score":0.014696121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49232128,0.00028975678,0.49773347,0.00011083602,0.000034901223,0.00008294429,0.000056597622,0.0008495055,0.008520718],"genre_scores_gemma":[0.9959407,0.000027844619,0.0035183714,0.0000060752063,0.0000027376573,0.000010647707,0.000016722273,0.000010605124,0.0004663292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.00008963588,0.000023133343,0.000058279085,0.00026893214,0.0000703037],"domain_scores_gemma":[0.998667,0.0005101022,0.00013807479,0.00011694408,0.0005317059,0.000036240028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011680869,0.0004247702,0.00041609723,0.00050874485,0.00034374816,0.000548214,0.00050919096,0.0003263757,0.0013625947],"category_scores_gemma":[0.003423122,0.00012727268,0.00028823438,0.00016286944,0.00043853628,0.0004651552,0.00034686417,0.00031903991,0.00013676703],"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.0003876833,0.00008792895,0.0026706026,0.000080274214,0.000038686394,0.00016050533,0.00009572199,0.8992774,0.0479115,0.008297621,0.00041458494,0.040577494],"study_design_scores_gemma":[0.0000073015017,0.000106540465,0.00050788245,0.000002597459,0.0000065821932,0.000017908611,0.000008239229,0.9913727,0.007447639,0.0003990574,0.00011773266,0.00000584304],"about_ca_topic_score_codex":0.0029853983,"about_ca_topic_score_gemma":0.0017278155,"teacher_disagreement_score":0.0029853983,"about_ca_system_score_codex":0.00077671773,"about_ca_system_score_gemma":0.00048678755,"threshold_uncertainty_score":0.006177485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040917,0.0009621068,0.8553898,0.00046729308,0.00013401378,0.00005848959,0.00007830102,0.00022983486,0.0022710206],"genre_scores_gemma":[0.96793973,0.00061427633,0.02927402,0.000102977094,0.000118740645,0.00007831956,0.00007956451,0.00007870381,0.0017136583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991708,0.0002739238,0.00003808349,0.00008657448,0.00027630164,0.00015431906],"domain_scores_gemma":[0.99594104,0.0027010343,0.0003897409,0.00021192766,0.0005531055,0.00020313452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003662215,0.0006214562,0.0007716807,0.0014310784,0.00072451844,0.0013956113,0.0019214903,0.0008225078,0.001229349],"category_scores_gemma":[0.011317818,0.00044747558,0.00052517944,0.0008648109,0.0015348821,0.0023346427,0.0007648479,0.0011164364,0.00013194935],"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.00013815612,0.00008148195,0.0016690807,0.000058825244,0.00003526845,0.00013829491,0.0001592322,0.8310887,0.0028087709,0.15533292,0.0008770936,0.0076121176],"study_design_scores_gemma":[0.000003475854,0.000006297273,0.00008506996,0.0000019454167,0.0000028533034,0.000005409271,0.000007768415,0.9922402,0.00011297476,0.0074665,0.00006398604,0.0000035997348],"about_ca_topic_score_codex":0.008403794,"about_ca_topic_score_gemma":0.004803001,"teacher_disagreement_score":0.008403794,"about_ca_system_score_codex":0.0029900318,"about_ca_system_score_gemma":0.0021160678,"threshold_uncertainty_score":0.021694362},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032747492,0.04775486,0.26723215,0.5426242,0.01778056,0.00010878391,0.00019741108,0.0024610322,0.0890936],"genre_scores_gemma":[0.71942365,0.049516525,0.106359184,0.04608104,0.012358251,0.000214789,0.00016898934,0.00054100057,0.06533662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987826,0.0002995014,0.000038362952,0.0001834988,0.00043548245,0.0002605784],"domain_scores_gemma":[0.9982431,0.00057249394,0.00018409695,0.00022852558,0.00046869923,0.00030302044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024794363,0.0008540941,0.0006144547,0.0006682972,0.00101906,0.0041638096,0.0017440411,0.0034677975,0.00653056],"category_scores_gemma":[0.011560591,0.0005206622,0.00040656724,0.0006815812,0.0025609487,0.01979317,0.0017511126,0.0029095127,0.0028330565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034886278,0.00012720245,0.002655185,0.0004168915,0.00014070241,0.0005662558,0.00057676545,0.006378902,0.0048720986,0.4883436,0.07640879,0.41916472],"study_design_scores_gemma":[0.00006320697,0.00016057222,0.00081878505,0.00051662914,0.00010122093,0.001063608,0.0015747923,0.02424382,0.0057102223,0.6716623,0.29392397,0.00016083046],"about_ca_topic_score_codex":0.002458883,"about_ca_topic_score_gemma":0.0025618076,"teacher_disagreement_score":0.00653056,"about_ca_system_score_codex":0.0013504288,"about_ca_system_score_gemma":0.0011665662,"threshold_uncertainty_score":0.02184689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3304713,0.0032768962,0.65582794,0.0015872852,0.00029959812,0.00015404203,0.000089563786,0.0011257704,0.007167618],"genre_scores_gemma":[0.969749,0.001616763,0.026718562,0.00027714449,0.000093450886,0.00013527027,0.000035535977,0.00005699761,0.0013172914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983411,0.0005753087,0.00010299353,0.00020074646,0.00049478683,0.00028520968],"domain_scores_gemma":[0.9912049,0.0058667683,0.0013882607,0.0008495864,0.0004377097,0.00025274296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017338,0.00080078875,0.00095027493,0.0010844986,0.000936215,0.0018531996,0.0012286619,0.0011811706,0.0012931623],"category_scores_gemma":[0.010565019,0.0005607821,0.00065325,0.0007554085,0.0023376134,0.0050646793,0.0022971,0.001308577,0.00016787702],"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.0014074568,0.00021175602,0.0052243145,0.00049064157,0.00028052056,0.001468129,0.0010611105,0.48635453,0.056183793,0.38781893,0.0037808248,0.055717982],"study_design_scores_gemma":[0.00010810792,0.00021825489,0.0007343252,0.000076589255,0.00008612936,0.0006233676,0.00023123939,0.8453262,0.01814097,0.1295762,0.0048166905,0.000061932136],"about_ca_topic_score_codex":0.000900065,"about_ca_topic_score_gemma":0.0003864386,"teacher_disagreement_score":0.002017338,"about_ca_system_score_codex":0.0013048247,"about_ca_system_score_gemma":0.00047862518,"threshold_uncertainty_score":0.010668814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873439,0.00029009517,0.010665747,0.0001413962,0.00003014331,0.00006630203,0.000052372106,0.00009836013,0.0013116266],"genre_scores_gemma":[0.9935349,0.00010555737,0.005861302,0.000017732873,0.000014464719,0.000015362762,0.000033085704,0.0000107799,0.00040688834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99859446,0.0005758917,0.00006073844,0.00014694253,0.00042150982,0.00020043849],"domain_scores_gemma":[0.99419254,0.0040946444,0.00033572395,0.00025074976,0.00077522313,0.00035107185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015948399,0.00080498174,0.0005613864,0.00063913414,0.00077096734,0.0010036248,0.0010145521,0.0016977678,0.000983999],"category_scores_gemma":[0.0052713836,0.00024952975,0.00041979656,0.00054065045,0.0007053723,0.0009931225,0.00048450605,0.00065835693,0.00013112754],"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.0032944994,0.003279828,0.03438095,0.00095966784,0.0003073244,0.009175161,0.000978442,0.71848226,0.13561435,0.0050235186,0.0018933681,0.08661061],"study_design_scores_gemma":[0.00021975936,0.00554107,0.011912423,0.000042301366,0.00017925291,0.0025588523,0.0008971701,0.88114804,0.0945025,0.0011814767,0.0017448899,0.00007222649],"about_ca_topic_score_codex":0.003248845,"about_ca_topic_score_gemma":0.0024477618,"teacher_disagreement_score":0.003248845,"about_ca_system_score_codex":0.0009991708,"about_ca_system_score_gemma":0.00033811462,"threshold_uncertainty_score":0.008434415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25135505,0.00090105226,0.7340176,0.0010362096,0.00021851568,0.00026129142,0.0006355443,0.00075904577,0.01081568],"genre_scores_gemma":[0.95659345,0.0006141415,0.032275245,0.00016485425,0.00015141805,0.00022966087,0.0002323603,0.000063020045,0.009675911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941134,0.00013363246,0.000032425836,0.00009936008,0.00018701468,0.00013616886],"domain_scores_gemma":[0.99883777,0.00043736055,0.00017863353,0.00007702198,0.00035423788,0.0001150359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011174355,0.00069112907,0.0009960126,0.0008471742,0.00072349695,0.0013694513,0.0024452098,0.0015964076,0.0024359596],"category_scores_gemma":[0.0020934797,0.00043305976,0.0006553471,0.0008425949,0.0011921528,0.0016950341,0.00069147657,0.0010046537,0.0005282759],"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.00013354594,0.000117498676,0.0010865137,0.000088899455,0.000049113205,0.00035574994,0.0002675384,0.88898796,0.007476557,0.0962306,0.001266221,0.0039397613],"study_design_scores_gemma":[0.000013833005,0.000020790254,0.00006304019,0.0000025312593,0.0000065402146,0.000020144435,0.0000064337114,0.995761,0.00015845551,0.0037905565,0.00015002667,0.000006645566],"about_ca_topic_score_codex":0.0086818775,"about_ca_topic_score_gemma":0.003202328,"teacher_disagreement_score":0.0086818775,"about_ca_system_score_codex":0.0020521688,"about_ca_system_score_gemma":0.0017883929,"threshold_uncertainty_score":0.017262638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013452481,0.00047952394,0.99351865,0.00029719423,0.00009218509,0.000023295306,0.000013096164,0.000057506797,0.0041732723],"genre_scores_gemma":[0.12365512,0.0019305862,0.8659586,0.00035665729,0.0003058794,0.00036362495,0.00007782392,0.00006734758,0.0072844103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.0001114218,0.00001890874,0.000053672873,0.0001851505,0.000032522745],"domain_scores_gemma":[0.9996872,0.00019604381,0.000026160194,0.000027901186,0.00004753082,0.000015119062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047092585,0.00068169355,0.0006932585,0.0006252916,0.0005086838,0.0011026374,0.0013417106,0.0011128024,0.0023022417],"category_scores_gemma":[0.0013399624,0.00023315962,0.00070100295,0.000982292,0.00092992303,0.001595635,0.0010767181,0.0016940839,0.00043772376],"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.000018640674,0.00004849699,0.00021774883,0.00020451067,0.000056004184,0.00016688554,0.000073309326,0.48439685,0.0034924077,0.38717926,0.0036043755,0.12054155],"study_design_scores_gemma":[0.00000900051,0.000030579515,0.00005202723,0.000020393927,0.000010320867,0.00008806182,0.000013811202,0.89382184,0.0006207548,0.095312566,0.010011207,0.00000955886],"about_ca_topic_score_codex":0.0007619311,"about_ca_topic_score_gemma":0.00097295915,"teacher_disagreement_score":0.0023022417,"about_ca_system_score_codex":0.00053978845,"about_ca_system_score_gemma":0.0006617605,"threshold_uncertainty_score":0.007701695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048261113,0.0005825414,0.9452241,0.00028937892,0.00011044466,0.0001726674,0.00003892406,0.00045968714,0.0048611388],"genre_scores_gemma":[0.9725073,0.00017094339,0.025657423,0.00006136978,0.000033688913,0.00010198476,0.00001679607,0.0000144612595,0.0014360112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.00007479212,0.000019472734,0.00007576148,0.00018378053,0.00005590128],"domain_scores_gemma":[0.9994862,0.00017554613,0.00007231299,0.000026381173,0.00020363262,0.000035909885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510817,0.00053407374,0.00051954924,0.00032499712,0.00053564215,0.0011368688,0.001096294,0.00075942266,0.002011282],"category_scores_gemma":[0.0013828725,0.00029517937,0.00025878442,0.00022870589,0.0006245283,0.0004772009,0.0004923881,0.0007123761,0.00016871275],"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.00016917558,0.000100693374,0.0010542985,0.00013008068,0.000049212707,0.00017139208,0.00007575211,0.90901345,0.025651027,0.017264334,0.0013234557,0.044997044],"study_design_scores_gemma":[0.00000919817,0.00003359607,0.000053469255,0.0000025713214,0.000004898692,0.000007645912,0.0000025985391,0.9983565,0.0008290782,0.00047488266,0.00022276967,0.0000026934163],"about_ca_topic_score_codex":0.006861435,"about_ca_topic_score_gemma":0.0038692658,"teacher_disagreement_score":0.006861435,"about_ca_system_score_codex":0.0012243423,"about_ca_system_score_gemma":0.0014429278,"threshold_uncertainty_score":0.013643026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366834,0.0005102905,0.05314791,0.00018083473,0.000052025105,0.000079686244,0.00017130104,0.00015248392,0.009022047],"genre_scores_gemma":[0.9965707,0.00009685317,0.002638473,0.000025310877,0.00003418838,0.000013998003,0.000120909186,0.000017878143,0.0004816764],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983986,0.0004111901,0.000107115375,0.00020738634,0.00073530735,0.00014040842],"domain_scores_gemma":[0.9905595,0.005213627,0.0015509917,0.0007870623,0.0016540289,0.00023472635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010869157,0.00015423332,0.00025461309,0.0013713385,0.00028538567,0.0010306062,0.00038029923,0.00046743365,0.0012670845],"category_scores_gemma":[0.010598778,0.00016785621,0.00029087602,0.0014203842,0.0005451368,0.0014593814,0.0005236387,0.00050758646,0.00023340074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016789108,0.0005760704,0.43446547,0.00060553895,0.00029208683,0.001924824,0.003377593,0.112114966,0.06891107,0.054058466,0.0022056766,0.31978935],"study_design_scores_gemma":[0.00003123412,0.00058631686,0.5365203,0.00008380515,0.0001312645,0.0034578561,0.001928263,0.38721853,0.021489358,0.039537806,0.008894355,0.00012089366],"about_ca_topic_score_codex":0.001313453,"about_ca_topic_score_gemma":0.0010607349,"teacher_disagreement_score":0.0013713385,"about_ca_system_score_codex":0.0006712369,"about_ca_system_score_gemma":0.00030114473,"threshold_uncertainty_score":0.005748272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72396624,0.00036511116,0.26522955,0.0003752097,0.000082443075,0.0002095203,0.00005708928,0.00084975903,0.008865017],"genre_scores_gemma":[0.9941577,0.000036859503,0.0046841227,0.00001667973,0.000022117503,0.000027036514,0.000016270893,0.0000069708008,0.0010322165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.00015231312,0.000025567182,0.00008795347,0.00015622759,0.0001588686],"domain_scores_gemma":[0.99871206,0.0006441577,0.00014724337,0.00010894477,0.00018016511,0.00020747402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942846,0.0004307634,0.0004174039,0.00055538065,0.00079018786,0.00083647325,0.0011411568,0.00048815462,0.0014733325],"category_scores_gemma":[0.0034026855,0.00015224789,0.00023368333,0.000418568,0.0006665616,0.0007351538,0.0008979889,0.0005564924,0.000109188055],"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.0010468207,0.00053445617,0.012369082,0.00010182091,0.00013893649,0.0006168566,0.0006587479,0.7659147,0.048737872,0.042787578,0.0019511022,0.12514202],"study_design_scores_gemma":[0.000024979985,0.000057785062,0.0007617489,0.0000030316328,0.000014318283,0.00003586557,0.000036791072,0.99077725,0.003642537,0.0040150816,0.000622924,0.000007718854],"about_ca_topic_score_codex":0.0064552487,"about_ca_topic_score_gemma":0.0044537233,"teacher_disagreement_score":0.0064552487,"about_ca_system_score_codex":0.0013681848,"about_ca_system_score_gemma":0.0008380609,"threshold_uncertainty_score":0.012835324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097079,0.00063129945,0.89800453,0.000474584,0.000058229536,0.00032536514,0.000077764875,0.0014819999,0.0018672383],"genre_scores_gemma":[0.7059013,0.0003062401,0.29155275,0.00014099463,0.00012487262,0.0002280477,0.00014723698,0.00006612755,0.0015323434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970515,0.00091580255,0.00024074316,0.00025540803,0.0012950617,0.00024149672],"domain_scores_gemma":[0.9930823,0.0024309477,0.000849525,0.0023282242,0.0011179603,0.00019113117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034314215,0.00064971804,0.0011701849,0.0013341855,0.0012046369,0.0010358248,0.0019329351,0.0014386231,0.0006756696],"category_scores_gemma":[0.0100869825,0.00042871345,0.00034235022,0.0009898216,0.0006952285,0.002590728,0.0017991789,0.0010716022,0.00017699001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012614811,0.0006191683,0.0040535047,0.00031905257,0.00019951031,0.00044865962,0.00073829945,0.15277302,0.20763145,0.07733871,0.005803723,0.54881334],"study_design_scores_gemma":[0.00025267602,0.000539612,0.0013715326,0.00002655025,0.000120380646,0.0005962636,0.00007699307,0.9109247,0.054818355,0.021302499,0.009873797,0.00009663488],"about_ca_topic_score_codex":0.00083128584,"about_ca_topic_score_gemma":0.00069753773,"teacher_disagreement_score":0.0034314215,"about_ca_system_score_codex":0.0008464819,"about_ca_system_score_gemma":0.0009714771,"threshold_uncertainty_score":0.01814735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803371,0.0008204597,0.014861595,0.00008604131,0.00010449464,0.000058786256,0.000017041582,0.0001297193,0.0035848583],"genre_scores_gemma":[0.9960602,0.00010617514,0.0034124574,0.000019707182,0.000016859532,0.000015288293,0.000016443824,0.0000045994443,0.00034831534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972379,0.0014025742,0.00011192171,0.00013520036,0.0007036365,0.00040871772],"domain_scores_gemma":[0.9947218,0.0030957013,0.00071596226,0.0003356241,0.0008921335,0.00023890455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042956783,0.00062416267,0.00038658638,0.00077513687,0.00037357406,0.0013190686,0.0011128809,0.0007996339,0.0015076603],"category_scores_gemma":[0.008033682,0.00025998484,0.00027438637,0.00053615245,0.0007084217,0.0014862487,0.0009263283,0.0008580082,0.000101468315],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008368012,0.0027998923,0.054210085,0.0006270923,0.00058168464,0.0011801361,0.0005988721,0.6124125,0.092589475,0.03209801,0.001727167,0.19280708],"study_design_scores_gemma":[0.0003142419,0.004367425,0.0077327313,0.00009491518,0.00028820196,0.00029680424,0.00022935253,0.93244725,0.046196748,0.004674267,0.0033077847,0.000050205414],"about_ca_topic_score_codex":0.0013799105,"about_ca_topic_score_gemma":0.0006921982,"teacher_disagreement_score":0.0042956783,"about_ca_system_score_codex":0.0007334823,"about_ca_system_score_gemma":0.00062210363,"threshold_uncertainty_score":0.022718012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40808144,0.0020108263,0.56838316,0.005098052,0.00019368927,0.00009114693,0.00013357493,0.00024799473,0.015760224],"genre_scores_gemma":[0.98202765,0.00069072226,0.016083661,0.00016123896,0.00009527118,0.00002839265,0.000030369903,0.000011785088,0.0008708442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995579,0.00018810683,0.000018609793,0.00004182622,0.00015752806,0.00003604858],"domain_scores_gemma":[0.99721223,0.0016202497,0.0003416774,0.00022381492,0.00047972475,0.00012243245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010680133,0.0002059475,0.00026591343,0.00047057067,0.0004956488,0.00072295836,0.0006337506,0.0011247848,0.0007549328],"category_scores_gemma":[0.0070441337,0.00022560102,0.00021905093,0.0004018203,0.0011738708,0.0014808443,0.0004394773,0.0006468866,0.00009223131],"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.00006641068,0.00009949554,0.0051954673,0.000074271244,0.000026996819,0.0003849272,0.00019925817,0.6034918,0.004204283,0.3520535,0.0022052766,0.031998314],"study_design_scores_gemma":[0.0000089772675,0.000040230487,0.00086354587,0.00001041008,0.000006283745,0.00012034533,0.000043113083,0.87028986,0.00066963007,0.12690228,0.0010330187,0.000012360848],"about_ca_topic_score_codex":0.0010904814,"about_ca_topic_score_gemma":0.00082197424,"teacher_disagreement_score":0.0011247848,"about_ca_system_score_codex":0.0008478202,"about_ca_system_score_gemma":0.00044495516,"threshold_uncertainty_score":0.006151378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018506304,0.00010561945,0.9976457,0.00019520399,0.000053013817,0.00008382858,0.000069362985,0.0005974361,0.0010647906],"genre_scores_gemma":[0.03049281,0.0010298775,0.963247,0.00026682703,0.0003598002,0.001763535,0.0004681652,0.0008395457,0.0015324801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.987941,0.0074722623,0.0007677339,0.00080634956,0.0026548451,0.00035784306],"domain_scores_gemma":[0.9754327,0.017640505,0.0012127992,0.003177481,0.0018631998,0.0006733508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017510984,0.0026964147,0.0024913123,0.0035308495,0.0015222853,0.005404313,0.0067276587,0.0030961891,0.0061097457],"category_scores_gemma":[0.032358617,0.0017120106,0.004039829,0.0023651135,0.0058803717,0.0039212736,0.006512906,0.0071872114,0.0024200433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046027657,0.00007509521,0.00049139827,0.00028826483,0.00013875231,0.00018358132,0.00019886174,0.2364635,0.0010445704,0.73500884,0.003933147,0.022127964],"study_design_scores_gemma":[0.000048829384,0.000055657263,0.00008511579,0.000100605976,0.000029924391,0.00006361111,0.000036127458,0.58706915,0.0005896149,0.39266098,0.019223418,0.000037073045],"about_ca_topic_score_codex":0.0034598787,"about_ca_topic_score_gemma":0.0025691066,"teacher_disagreement_score":0.017510984,"about_ca_system_score_codex":0.0021890076,"about_ca_system_score_gemma":0.0062474697,"threshold_uncertainty_score":0.092608035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45694727,0.0014463871,0.5334553,0.0008422267,0.00005544433,0.000049129998,0.000032253472,0.00018551813,0.006986454],"genre_scores_gemma":[0.9925322,0.0002744431,0.006549222,0.00005216502,0.000026102258,0.0000212716,0.00000870469,0.000019383884,0.00051647716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990453,0.00046424457,0.000031835894,0.000077616576,0.00019832642,0.0001826675],"domain_scores_gemma":[0.9909603,0.0072967913,0.0006274434,0.0003007601,0.0006265707,0.00018819865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019079616,0.00042598185,0.00060485234,0.0004786692,0.0006743682,0.0012376744,0.0012204115,0.00087138644,0.0014376692],"category_scores_gemma":[0.0148740765,0.00034992132,0.00023298252,0.0005871139,0.0015422256,0.0021935732,0.000970651,0.00097014516,0.00014130851],"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.00028409314,0.00012479784,0.003860442,0.00013212024,0.000047355676,0.00049547903,0.00046429926,0.77581555,0.019894129,0.157519,0.00096549164,0.040397204],"study_design_scores_gemma":[0.0000093427525,0.0000430986,0.0005046848,0.000008701048,0.000012610545,0.00010588478,0.00007888991,0.96499723,0.0022443905,0.03167438,0.0003094001,0.000011366177],"about_ca_topic_score_codex":0.001596758,"about_ca_topic_score_gemma":0.0010311729,"teacher_disagreement_score":0.0019079616,"about_ca_system_score_codex":0.0013573671,"about_ca_system_score_gemma":0.00054415024,"threshold_uncertainty_score":0.010090351},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82366115,0.00021672036,0.16804545,0.00047501767,0.00015707684,0.00023522618,0.00010679335,0.0009552835,0.006147271],"genre_scores_gemma":[0.9450463,0.0001275988,0.053206183,0.00009225416,0.000020171126,0.0000954131,0.00013208132,0.000034310542,0.001245698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986129,0.0004837136,0.00008001918,0.00018544467,0.00045999442,0.00017792216],"domain_scores_gemma":[0.99792296,0.0006739931,0.00015083957,0.00053028675,0.0005542548,0.00016774143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020169732,0.00047701393,0.00037285642,0.00036683882,0.00037536057,0.0010146511,0.0014239427,0.00092005765,0.00070503796],"category_scores_gemma":[0.0027905912,0.00020430908,0.00034232886,0.0002485792,0.00055401423,0.0021612921,0.0006045835,0.0009959622,0.00015894175],"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.003782398,0.004113012,0.036876768,0.00057655456,0.00036003318,0.0007568963,0.0013513142,0.58492386,0.17682451,0.05318493,0.0032359324,0.13401386],"study_design_scores_gemma":[0.00012959789,0.0012880303,0.0017400287,0.00002407389,0.00006510497,0.00015920759,0.0001386262,0.96076256,0.030530974,0.0026923222,0.002438635,0.00003089793],"about_ca_topic_score_codex":0.0020739115,"about_ca_topic_score_gemma":0.0008996118,"teacher_disagreement_score":0.0020739115,"about_ca_system_score_codex":0.00070496,"about_ca_system_score_gemma":0.0009385635,"threshold_uncertainty_score":0.010666907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32474732,0.008971637,0.65283877,0.0005239586,0.0001422995,0.0002624303,0.0004343173,0.0016199192,0.010459335],"genre_scores_gemma":[0.82231563,0.0048316293,0.17011741,0.000030353222,0.00014076702,0.00009718321,0.00028684238,0.00012869122,0.0020515465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970414,0.0013015034,0.000113745635,0.00017978177,0.0012016083,0.00016189303],"domain_scores_gemma":[0.99214995,0.0051691793,0.0004719552,0.00085111446,0.0012422,0.000115622635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029185612,0.0010126482,0.00058399467,0.0020600392,0.0005351395,0.00087004656,0.0017300773,0.0009140827,0.0022854896],"category_scores_gemma":[0.010967985,0.00031200662,0.00038843864,0.003065169,0.00063440535,0.0030358746,0.00093128235,0.00091605535,0.00029167024],"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.0013985715,0.00050306576,0.0031056313,0.0005835873,0.0001439473,0.00008768059,0.0002719147,0.53883964,0.023508327,0.01845898,0.002222369,0.4108763],"study_design_scores_gemma":[0.000049735245,0.0006150418,0.00091317605,0.000024161567,0.00006194245,0.00014364878,0.0000691833,0.98199993,0.010226278,0.0045245867,0.0013508518,0.00002139976],"about_ca_topic_score_codex":0.0027751958,"about_ca_topic_score_gemma":0.0026980734,"teacher_disagreement_score":0.0029185612,"about_ca_system_score_codex":0.0017081284,"about_ca_system_score_gemma":0.00070961803,"threshold_uncertainty_score":0.01543498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047521904,0.0024696114,0.94356585,0.00033644223,0.000105321,0.00009911057,0.00007163688,0.0008622902,0.0049677887],"genre_scores_gemma":[0.85279095,0.0011365243,0.1426747,0.00018762659,0.00014847213,0.00013724882,0.000096163894,0.000096659474,0.0027317673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988783,0.0003764894,0.0000803928,0.00015127569,0.0003600884,0.00015346329],"domain_scores_gemma":[0.99646556,0.0018180831,0.0004321259,0.0005527455,0.00058123836,0.0001502586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003015695,0.00052292115,0.00061556074,0.00079795136,0.0007885428,0.0016455577,0.0019388018,0.0007685203,0.0020520457],"category_scores_gemma":[0.006842867,0.00030722594,0.0002996849,0.000947657,0.0009587014,0.001963351,0.0009792312,0.0010166013,0.00040634527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075690483,0.00018648573,0.0009367587,0.00025887377,0.000051957373,0.00012494643,0.0004194611,0.30942765,0.02176505,0.35801682,0.0043680766,0.30368704],"study_design_scores_gemma":[0.00006663229,0.0002450689,0.00016747505,0.000024946323,0.000022716073,0.000073217205,0.00003594186,0.93264705,0.005452292,0.056835685,0.004400261,0.000028772662],"about_ca_topic_score_codex":0.0018989198,"about_ca_topic_score_gemma":0.0017954662,"teacher_disagreement_score":0.003015695,"about_ca_system_score_codex":0.0015762383,"about_ca_system_score_gemma":0.0012586364,"threshold_uncertainty_score":0.015948713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03043888,0.00083851453,0.96528417,0.00010794987,0.000268214,0.00009079824,0.000015028712,0.00050553365,0.0024509064],"genre_scores_gemma":[0.4469619,0.0007793962,0.5472174,0.00011272782,0.00032981043,0.0001547913,0.000053128082,0.00011998121,0.004270798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984627,0.00040789493,0.000100091645,0.00027838445,0.0005717811,0.00017913648],"domain_scores_gemma":[0.99606484,0.0020236706,0.0002820774,0.00064295717,0.000837286,0.00014912925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031341845,0.00077369483,0.0008858053,0.0011612125,0.0005400533,0.0011304908,0.001618411,0.0011128617,0.0017354072],"category_scores_gemma":[0.00932752,0.0002870322,0.00048214442,0.00067575753,0.000884788,0.0025573971,0.0008919015,0.0015449874,0.00048021966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001042411,0.000688113,0.002763881,0.00035052968,0.00013822832,0.00018580035,0.0004857866,0.17516692,0.035640903,0.10994204,0.003851729,0.6697437],"study_design_scores_gemma":[0.00009841126,0.0002631641,0.0005896123,0.00001919934,0.000026777996,0.0003436345,0.000024773628,0.9673359,0.019174645,0.007988032,0.0040925485,0.000043434975],"about_ca_topic_score_codex":0.0007209957,"about_ca_topic_score_gemma":0.0008367112,"teacher_disagreement_score":0.0031341845,"about_ca_system_score_codex":0.00061618973,"about_ca_system_score_gemma":0.0012275734,"threshold_uncertainty_score":0.016575396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033085406,0.00018170587,0.8952493,0.0002838353,0.00027849016,0.00056173484,0.004841003,0.059890565,0.005627915],"genre_scores_gemma":[0.38391373,0.00052166777,0.58591783,0.00016534806,0.0000859103,0.0015602934,0.018266767,0.0056763915,0.0038920587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.00011471985,0.000031858588,0.00007101026,0.00015369728,0.000030396952],"domain_scores_gemma":[0.99831474,0.0006573139,0.00014914047,0.00054858596,0.0002467395,0.00008360184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520895,0.00085431634,0.0006092181,0.001307467,0.00032872998,0.0008484582,0.002561658,0.00075748784,0.005826701],"category_scores_gemma":[0.004908544,0.00067247555,0.0006161207,0.0010340426,0.0005309891,0.0020262753,0.0010058715,0.0009041745,0.0013354638],"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.00044948497,0.00023745645,0.0036512655,0.00043694364,0.00018880455,0.00051530736,0.00022195645,0.8302717,0.0086011775,0.023678303,0.040141683,0.09160588],"study_design_scores_gemma":[0.000077709396,0.00003942968,0.00023632441,0.00001159695,0.000011717792,0.000118346754,0.000010766057,0.98360544,0.0026970597,0.005611083,0.0075621684,0.000018452125],"about_ca_topic_score_codex":0.0014282287,"about_ca_topic_score_gemma":0.0015863343,"teacher_disagreement_score":0.005826701,"about_ca_system_score_codex":0.0005498139,"about_ca_system_score_gemma":0.0006461562,"threshold_uncertainty_score":0.019492269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13083039,0.0026200449,0.85888606,0.0011634448,0.00011693007,0.000055781955,0.00019091669,0.00036306406,0.005773281],"genre_scores_gemma":[0.9646645,0.001489193,0.03212115,0.00022856708,0.00022838623,0.00011749209,0.000109471446,0.00020594701,0.000835191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949626,0.001765262,0.00017376049,0.00072321127,0.0015665567,0.00080858596],"domain_scores_gemma":[0.9045466,0.08031439,0.0063618217,0.0049162693,0.0029168252,0.0009441298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009714947,0.0011623639,0.0013820147,0.001799663,0.0011412922,0.0026453326,0.0016371413,0.0013563192,0.0016839692],"category_scores_gemma":[0.07148519,0.001095785,0.00076751213,0.0019466053,0.0033589802,0.0055334666,0.0021768203,0.002741316,0.00018877818],"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.00006989313,0.0000651526,0.0020944707,0.000077409815,0.000066791916,0.000081496764,0.000057935045,0.9061474,0.002642604,0.07825328,0.00056567404,0.009877832],"study_design_scores_gemma":[0.000006573046,0.000040896255,0.0008878917,0.00001499952,0.00002567627,0.000038904534,0.000024109584,0.9492285,0.0012422565,0.04824018,0.00022856046,0.000021322989],"about_ca_topic_score_codex":0.0028939957,"about_ca_topic_score_gemma":0.0026401847,"teacher_disagreement_score":0.009714947,"about_ca_system_score_codex":0.003147095,"about_ca_system_score_gemma":0.002606601,"threshold_uncertainty_score":0.05137813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19058198,0.0002502744,0.8035677,0.00036443508,0.0001274644,0.00008425461,0.000050206472,0.002237313,0.002736431],"genre_scores_gemma":[0.992757,0.000036798025,0.00672402,0.00002643054,0.0000122449055,0.000019978977,0.000012680556,0.00001156288,0.00039927635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992593,0.00018633914,0.00004598992,0.00017895126,0.00020913822,0.00012024135],"domain_scores_gemma":[0.99869835,0.0005970852,0.00018921187,0.00012279242,0.00029017508,0.000102405706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012043254,0.0005185839,0.0005094757,0.0003033578,0.00044473185,0.0009992018,0.0011447578,0.0004592026,0.0007139549],"category_scores_gemma":[0.0026418427,0.00021432237,0.00029380698,0.00021072547,0.0006722769,0.00065469096,0.0007596166,0.00078084617,0.00009222656],"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.00014875263,0.00014825484,0.00080398854,0.000028477552,0.000022571792,0.00006687922,0.00007355676,0.95916,0.012755831,0.00560574,0.00047402494,0.020711865],"study_design_scores_gemma":[0.0000046526434,0.0000123901755,0.000075559736,4.4014544e-7,0.000001889805,0.000002002564,0.0000019756071,0.9988908,0.0005076531,0.00045935734,0.000041058945,0.0000022038207],"about_ca_topic_score_codex":0.013953178,"about_ca_topic_score_gemma":0.0075846417,"teacher_disagreement_score":0.013953178,"about_ca_system_score_codex":0.0013450057,"about_ca_system_score_gemma":0.0012429997,"threshold_uncertainty_score":0.027743936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28434107,0.0018167578,0.7091387,0.0005206495,0.000109405744,0.00009309981,0.000044392586,0.0011800089,0.002755873],"genre_scores_gemma":[0.9348075,0.0006605049,0.06322724,0.00018855625,0.00009457733,0.00003651943,0.00004170391,0.000041822957,0.0009015389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994475,0.00014487017,0.00003143575,0.00006825187,0.00018348129,0.00012439545],"domain_scores_gemma":[0.9984413,0.00072611985,0.00027748442,0.00020233661,0.00028777006,0.000065001834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017029397,0.000749724,0.00041978376,0.00041920447,0.00045360232,0.0009790078,0.0010649257,0.0006079221,0.00052553124],"category_scores_gemma":[0.003399902,0.00017924883,0.0002670285,0.00036387492,0.00057324144,0.0013163409,0.0006246298,0.0008764526,0.00014655896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007394045,0.0006819585,0.011804028,0.0002849744,0.00010010465,0.00028867144,0.0005345094,0.288017,0.24193619,0.025337188,0.0019402112,0.42833576],"study_design_scores_gemma":[0.000096364754,0.0008132898,0.0051886667,0.000028539724,0.00010943868,0.00032582929,0.000095704236,0.91178054,0.06579175,0.010169507,0.005532319,0.00006807877],"about_ca_topic_score_codex":0.0017378143,"about_ca_topic_score_gemma":0.0023336923,"teacher_disagreement_score":0.0017378143,"about_ca_system_score_codex":0.00053543266,"about_ca_system_score_gemma":0.00060207315,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02393713,0.0009517816,0.9648162,0.0005858737,0.00018313967,0.00012639271,0.000026059908,0.00095046463,0.008422891],"genre_scores_gemma":[0.62837785,0.00092388585,0.36085725,0.0007618813,0.00033055394,0.00019184306,0.000058434103,0.00012874871,0.008369538],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991572,0.00033507566,0.00003881232,0.00013379892,0.00028106655,0.000053994165],"domain_scores_gemma":[0.9989925,0.00033855246,0.00008165225,0.00015491256,0.00032428373,0.0001080771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014080274,0.00067442574,0.0004321865,0.00039468246,0.00056937203,0.0012740107,0.001534164,0.00080367,0.0019046131],"category_scores_gemma":[0.0025145377,0.00021354461,0.00036176416,0.00030122572,0.00056823244,0.002091992,0.00094922207,0.0010462935,0.0005041521],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006732567,0.0009134333,0.0023237227,0.0004759324,0.0001246402,0.0007114159,0.0015871557,0.05020966,0.28847945,0.26504323,0.0076513086,0.38180682],"study_design_scores_gemma":[0.00010880669,0.00097493565,0.0012332455,0.000088792396,0.0001581414,0.0011962148,0.00023759405,0.79333985,0.10137568,0.06203221,0.039097346,0.00015723548],"about_ca_topic_score_codex":0.0007679793,"about_ca_topic_score_gemma":0.0012337093,"teacher_disagreement_score":0.0019046131,"about_ca_system_score_codex":0.00056237046,"about_ca_system_score_gemma":0.00082960585,"threshold_uncertainty_score":0.007446468},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015746018,0.0023916066,0.90183365,0.002662781,0.0018952213,0.0010487569,0.0025172036,0.03360296,0.03830186],"genre_scores_gemma":[0.4327894,0.0044432236,0.47296253,0.0030914187,0.0007010253,0.0049641444,0.014896334,0.0046685617,0.061483372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987429,0.00034069692,0.00013027154,0.0001146113,0.00044182356,0.00022975211],"domain_scores_gemma":[0.99909306,0.0001313517,0.00008720993,0.00026911116,0.00031036008,0.00010898445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012557236,0.00093068794,0.00084464764,0.0012685028,0.0018545355,0.0024223756,0.001505527,0.0018423139,0.0067634797],"category_scores_gemma":[0.0026870512,0.0003932718,0.0005117179,0.0016065302,0.0014434576,0.0031079843,0.0025133062,0.0027140884,0.005059441],"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.0013922872,0.00017518965,0.0007175319,0.0008649381,0.00008178424,0.0016082012,0.0014666812,0.02399714,0.04726536,0.51676893,0.19960089,0.20606105],"study_design_scores_gemma":[0.00022886551,0.00040612888,0.00037249608,0.00020300972,0.00008224878,0.0012306841,0.00032297763,0.09018156,0.032640982,0.1520952,0.7220018,0.00023402808],"about_ca_topic_score_codex":0.002498542,"about_ca_topic_score_gemma":0.0014677367,"teacher_disagreement_score":0.0067634797,"about_ca_system_score_codex":0.0010566596,"about_ca_system_score_gemma":0.0019644848,"threshold_uncertainty_score":0.022626102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777964,0.00025317518,0.019931506,0.000069808,0.000023708524,0.000029173387,0.000030394274,0.00036683117,0.001499148],"genre_scores_gemma":[0.99743503,0.000025565872,0.0023247288,0.000006892803,0.0000048552783,0.000006300256,0.000021064056,0.0000075632556,0.00016790998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976774,0.0009220444,0.00010829663,0.00023856237,0.0006387914,0.0004148715],"domain_scores_gemma":[0.991939,0.0044102315,0.0007904365,0.0005926389,0.0016230372,0.00064450456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045544207,0.0008193198,0.00087320333,0.0005265285,0.0005919498,0.00078916707,0.00080882735,0.00059859175,0.00091160036],"category_scores_gemma":[0.007482178,0.00023627475,0.00022370498,0.00062694657,0.0009227484,0.0012392146,0.0005923276,0.0005398441,0.00010246856],"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.0029198434,0.000554341,0.010754947,0.00009185969,0.0001244624,0.00012204554,0.00009659772,0.9143999,0.018531851,0.0016190287,0.00042248605,0.050362606],"study_design_scores_gemma":[0.000047500387,0.00063495873,0.0015717709,0.000003228991,0.000021514837,0.000026634987,0.00002696556,0.9892279,0.0081438115,0.00021691844,0.000070865804,0.000007877275],"about_ca_topic_score_codex":0.0068294904,"about_ca_topic_score_gemma":0.003047968,"teacher_disagreement_score":0.0068294904,"about_ca_system_score_codex":0.0013137176,"about_ca_system_score_gemma":0.0012695803,"threshold_uncertainty_score":0.024086356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12161885,0.00043084886,0.8740127,0.0001753158,0.00006070944,0.00006138103,0.000060742444,0.0006158822,0.0029635837],"genre_scores_gemma":[0.9654128,0.00023315698,0.032812748,0.000038974584,0.000038778307,0.000037248414,0.000038249524,0.000050943872,0.0013371011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994011,0.00016647828,0.000030479481,0.000086838976,0.00020845955,0.00010661308],"domain_scores_gemma":[0.9977678,0.0012931118,0.00020340951,0.00018482924,0.00040281,0.00014804059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701347,0.00031897207,0.0007211826,0.00060750823,0.00045716797,0.0012135289,0.0010446217,0.00049898634,0.001777036],"category_scores_gemma":[0.0055272463,0.00035333922,0.00035593283,0.0005116896,0.0007485189,0.0011756103,0.00087726803,0.0010824584,0.00023889494],"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.00066984864,0.00015520971,0.0028986472,0.00017128258,0.00007894368,0.00053375255,0.00036568465,0.623463,0.0412143,0.23918825,0.0024900099,0.088771194],"study_design_scores_gemma":[0.000013800922,0.000038578066,0.0001371559,0.0000051958095,0.000009270954,0.000049751477,0.000009194484,0.97968036,0.0021366004,0.01764449,0.00026580636,0.000009809137],"about_ca_topic_score_codex":0.0013478076,"about_ca_topic_score_gemma":0.0008778316,"teacher_disagreement_score":0.001777036,"about_ca_system_score_codex":0.0012854198,"about_ca_system_score_gemma":0.00074735854,"threshold_uncertainty_score":0.009326398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06072247,0.0027667435,0.8829566,0.0016361122,0.001236232,0.00067099853,0.0005564747,0.005603206,0.0438512],"genre_scores_gemma":[0.50604004,0.0014027881,0.45579112,0.00068982283,0.0006956839,0.0004910017,0.0014822083,0.00026135484,0.03314604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987733,0.00031997732,0.00011807961,0.00018252895,0.00045204427,0.0001540658],"domain_scores_gemma":[0.9989473,0.00025493684,0.000079812795,0.0002625903,0.0003891277,0.00006627063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012737778,0.0004829929,0.00061869185,0.0007466186,0.0007207824,0.000995239,0.001761047,0.00090229016,0.0060264547],"category_scores_gemma":[0.0016418534,0.00022589916,0.000473233,0.00082576135,0.000519705,0.002174728,0.001481824,0.0015190438,0.001966726],"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.0021433884,0.0009071092,0.0017403238,0.0010776134,0.00016091153,0.0014670265,0.0008363279,0.06461101,0.13422526,0.20384574,0.068593785,0.52039146],"study_design_scores_gemma":[0.0006544149,0.0006843558,0.0014111103,0.00010734296,0.0003736632,0.0019809941,0.00015055058,0.6508465,0.04447335,0.027441574,0.27168083,0.00019529497],"about_ca_topic_score_codex":0.0012447876,"about_ca_topic_score_gemma":0.0012792374,"teacher_disagreement_score":0.0060264547,"about_ca_system_score_codex":0.0005735445,"about_ca_system_score_gemma":0.0010266824,"threshold_uncertainty_score":0.020160496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39591745,0.0032753672,0.5952162,0.00026688,0.00009666739,0.000120149605,0.000051231083,0.0003038768,0.00475217],"genre_scores_gemma":[0.9588513,0.0009909733,0.039595615,0.000024207142,0.000072079754,0.000025311303,0.000022434326,0.00004250131,0.00037547626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994923,0.00021790333,0.000022553251,0.00003941317,0.00017099513,0.00005692827],"domain_scores_gemma":[0.9978143,0.0015809492,0.0002423968,0.0001175995,0.00019273435,0.000051964456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198363,0.00051565067,0.0003684479,0.00052312633,0.00022525004,0.0006635781,0.00048675298,0.000340679,0.0005779064],"category_scores_gemma":[0.005091768,0.00016059664,0.00019654531,0.000408517,0.0005813878,0.0008725251,0.00026304138,0.00033694832,0.00008940875],"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.0012413404,0.00022793499,0.0023759368,0.00027467046,0.000081068385,0.0005246896,0.00022515972,0.55038816,0.23873371,0.057449166,0.001025795,0.14745232],"study_design_scores_gemma":[0.00002215286,0.00040309707,0.0006817873,0.000014556562,0.000033665812,0.0001316482,0.000026933369,0.9764222,0.018462783,0.0031100886,0.0006724624,0.000018720057],"about_ca_topic_score_codex":0.001148983,"about_ca_topic_score_gemma":0.0006842701,"teacher_disagreement_score":0.001198363,"about_ca_system_score_codex":0.0004657968,"about_ca_system_score_gemma":0.00029856613,"threshold_uncertainty_score":0.0063376427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0510741,0.0022085877,0.9124165,0.0013103401,0.0019717563,0.0003857525,0.0003174745,0.008769871,0.021545563],"genre_scores_gemma":[0.6970749,0.0016530346,0.28339258,0.0009461434,0.0011667479,0.00044257686,0.00067744905,0.0010433386,0.013603305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00013115842,0.0000377468,0.00012038195,0.0003006561,0.00009017903],"domain_scores_gemma":[0.99808526,0.00038586213,0.00018395553,0.0005421402,0.0005726666,0.00023013353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666052,0.0006195909,0.00048591066,0.00062830356,0.000828209,0.0014587431,0.0020690046,0.000664434,0.001946055],"category_scores_gemma":[0.004064691,0.00021115226,0.00043245667,0.0008437547,0.00095260324,0.0023969908,0.0014369601,0.001566002,0.000661717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013275011,0.00030528623,0.003194284,0.0005274868,0.0001415658,0.0013284775,0.000802595,0.10263355,0.070932865,0.30499285,0.04942289,0.4643906],"study_design_scores_gemma":[0.00018701926,0.0011832698,0.0018186753,0.00010070928,0.00020771625,0.0030443082,0.00020663334,0.64699733,0.027620751,0.082936406,0.23542412,0.0002730548],"about_ca_topic_score_codex":0.00091542356,"about_ca_topic_score_gemma":0.0011766808,"teacher_disagreement_score":0.0020690046,"about_ca_system_score_codex":0.0005476912,"about_ca_system_score_gemma":0.00085722125,"threshold_uncertainty_score":0.008813977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876602,0.0005030222,0.009346275,0.000056368415,0.000023299142,0.000043112093,0.000066944005,0.00045791137,0.0018428792],"genre_scores_gemma":[0.99804604,0.0000812093,0.0016102083,0.0000064154688,0.0000071281934,0.00001333623,0.0000508014,0.000014519645,0.00017029286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837625,0.00065559545,0.00010950218,0.00013479895,0.0005082405,0.00021567062],"domain_scores_gemma":[0.9925695,0.004690869,0.0005297852,0.00044940293,0.001562005,0.0001984882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023766523,0.00052054157,0.0004915703,0.0011250821,0.00071088545,0.00072554,0.0005730185,0.0005743916,0.0008927257],"category_scores_gemma":[0.009330058,0.0001761966,0.0002613774,0.0009074948,0.0005386914,0.0008323701,0.0003664814,0.0004693956,0.000126856],"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.0055332095,0.0010449067,0.03865613,0.000566371,0.0003706809,0.0008940433,0.0009809901,0.65254694,0.15336224,0.0063710087,0.0020312413,0.13764216],"study_design_scores_gemma":[0.00006749025,0.002084308,0.007975847,0.000019992416,0.00006927184,0.00033562217,0.00017347359,0.94207287,0.046107333,0.00044644615,0.0005996273,0.00004773136],"about_ca_topic_score_codex":0.004101668,"about_ca_topic_score_gemma":0.002081666,"teacher_disagreement_score":0.004101668,"about_ca_system_score_codex":0.0010877242,"about_ca_system_score_gemma":0.00035335068,"threshold_uncertainty_score":0.01256907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007881333,0.00035791114,0.98696196,0.0004096445,0.000043849534,0.000081465085,0.00007363647,0.0005362941,0.0036539536],"genre_scores_gemma":[0.40611368,0.0021538895,0.58833194,0.00025341488,0.0001448186,0.000506251,0.00047049852,0.00045857427,0.0015668992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970715,0.0013181145,0.0001362449,0.00033914973,0.0010049628,0.00013002774],"domain_scores_gemma":[0.9890884,0.0075002704,0.00044599688,0.0016676832,0.0011263095,0.00017134022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004930877,0.0010848715,0.000819966,0.0019254897,0.00070883834,0.0028696738,0.002569841,0.0020452829,0.0020914655],"category_scores_gemma":[0.025397878,0.0010658305,0.0006579916,0.0015190496,0.002011278,0.0033803873,0.0013904837,0.0023840726,0.0006332455],"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.000056605677,0.0001679772,0.0023088686,0.0002914216,0.000038454924,0.00013508511,0.00030301913,0.73946255,0.0029734576,0.16554764,0.003331102,0.08538383],"study_design_scores_gemma":[0.00000969716,0.000023873139,0.00016132476,0.00006499736,0.000006808647,0.00008356968,0.000038057813,0.94432,0.0016664056,0.050057374,0.0035505581,0.0000173645],"about_ca_topic_score_codex":0.003071244,"about_ca_topic_score_gemma":0.0017040547,"teacher_disagreement_score":0.004930877,"about_ca_system_score_codex":0.0020535698,"about_ca_system_score_gemma":0.0011784609,"threshold_uncertainty_score":0.02607733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6285556,0.0036571752,0.35679078,0.00045724565,0.0001260331,0.00016451572,0.00018502149,0.00094285526,0.009120779],"genre_scores_gemma":[0.9948232,0.00032929107,0.0043285093,0.000010672419,0.000020479547,0.000020886835,0.000031022442,0.000022071734,0.00041378997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987293,0.00036861078,0.000047824582,0.00012455061,0.00042989617,0.0002997092],"domain_scores_gemma":[0.9944495,0.0038077047,0.00043036952,0.00029048644,0.00088079507,0.00014123612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022841622,0.0007529423,0.0006165275,0.0009110885,0.00059323636,0.0010275005,0.00071855483,0.00067961717,0.001420704],"category_scores_gemma":[0.008898986,0.00020973025,0.00033429931,0.0008467174,0.0008602697,0.0015909903,0.00073912664,0.0008347641,0.0001831665],"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.00058801624,0.00007015978,0.0024530406,0.00015185935,0.000048729038,0.0001810588,0.00011874512,0.95323175,0.009414687,0.014384065,0.0005668542,0.01879102],"study_design_scores_gemma":[0.0000040632,0.000049067974,0.00034529428,0.0000042725887,0.000008405443,0.000018557103,0.0000122950905,0.9977597,0.0009651315,0.0007468605,0.0000809136,0.0000053604886],"about_ca_topic_score_codex":0.005926831,"about_ca_topic_score_gemma":0.0016622001,"teacher_disagreement_score":0.005926831,"about_ca_system_score_codex":0.0016616613,"about_ca_system_score_gemma":0.0010153387,"threshold_uncertainty_score":0.012080014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029818684,0.0024014418,0.94404453,0.00041010388,0.0010002301,0.00042914113,0.00034596657,0.002687221,0.01886267],"genre_scores_gemma":[0.6528187,0.0016593204,0.32787964,0.0003094073,0.00045347709,0.00033249272,0.0006008586,0.0002748301,0.015671277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845695,0.00036533526,0.000071728056,0.00020284232,0.0005882998,0.00031476512],"domain_scores_gemma":[0.9952254,0.0019436947,0.00039515714,0.00081390096,0.0012209761,0.00040089147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014865679,0.00067001133,0.0008174937,0.0012812109,0.0013654617,0.0018366877,0.0017717708,0.00071695383,0.0055326773],"category_scores_gemma":[0.006515949,0.00033399859,0.00035167942,0.0013551267,0.00052848796,0.001460564,0.0012750463,0.00092281296,0.0015173366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010897996,0.00064632285,0.0022322831,0.0005606585,0.000099286444,0.00033283336,0.00021284113,0.29104406,0.031118229,0.10038251,0.023804966,0.54847616],"study_design_scores_gemma":[0.00020376276,0.00034151724,0.00048931775,0.00003389196,0.000040821167,0.00043909287,0.00007714346,0.92502534,0.02031149,0.019140994,0.033824958,0.000071705035],"about_ca_topic_score_codex":0.002067536,"about_ca_topic_score_gemma":0.002378626,"teacher_disagreement_score":0.0055326773,"about_ca_system_score_codex":0.0012465697,"about_ca_system_score_gemma":0.0023501685,"threshold_uncertainty_score":0.018508673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11889976,0.0031831814,0.8583132,0.0007696378,0.0003696545,0.00013360463,0.00025788601,0.0012755288,0.016797634],"genre_scores_gemma":[0.8061234,0.0017397944,0.18244888,0.00016840706,0.00039294036,0.00017085756,0.000523309,0.00010611103,0.008326298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993358,0.00024317518,0.000049312715,0.00007572789,0.00020504546,0.000090959395],"domain_scores_gemma":[0.9992649,0.00031596998,0.00008117876,0.00009015275,0.00019525694,0.000052652525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044083,0.00025616464,0.00034618314,0.00118741,0.00082174403,0.0012550708,0.0006826896,0.00059522776,0.0012059141],"category_scores_gemma":[0.003092528,0.00024775887,0.00014685244,0.0016139676,0.0005538415,0.0012897508,0.00035607096,0.00043930826,0.00047811403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004955613,0.00021957069,0.006858657,0.00013863955,0.00002304671,0.00021752027,0.00022741189,0.16516209,0.01941083,0.18676397,0.010718309,0.60976434],"study_design_scores_gemma":[0.000024530653,0.000052711024,0.0022770816,0.000030200394,0.000017524013,0.00018556528,0.00007099439,0.9077448,0.0054115793,0.071629815,0.012525133,0.000030097577],"about_ca_topic_score_codex":0.0041497913,"about_ca_topic_score_gemma":0.003052472,"teacher_disagreement_score":0.0041497913,"about_ca_system_score_codex":0.00091746077,"about_ca_system_score_gemma":0.00082689285,"threshold_uncertainty_score":0.008251309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1465652,0.0016378917,0.8370809,0.0007138131,0.00015984873,0.00022314873,0.00021010057,0.0016335215,0.011775687],"genre_scores_gemma":[0.81391513,0.0011279939,0.181569,0.00011227495,0.000067045636,0.0001773588,0.00030885215,0.00008731966,0.0026350822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963915,0.0001282161,0.000019220046,0.00003662619,0.00014181959,0.00003498357],"domain_scores_gemma":[0.9995702,0.00022849377,0.000055302346,0.00006817086,0.000053419662,0.000024444385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156261,0.0003279405,0.00026036412,0.0004107111,0.0005362074,0.00070647825,0.0007343139,0.000403652,0.0016150791],"category_scores_gemma":[0.001793074,0.00021986259,0.00024338039,0.00066171447,0.00045290156,0.0009074355,0.00044643856,0.0005372679,0.00016158955],"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.00014651017,0.00007319137,0.00087375706,0.000117164665,0.000036795842,0.00013382922,0.000077534525,0.85348207,0.02713303,0.037888203,0.002720231,0.077317744],"study_design_scores_gemma":[0.000030352881,0.00006993947,0.00036304127,0.00000998194,0.000014703879,0.000086930166,0.000016145603,0.97789234,0.0036396324,0.013318041,0.0045474255,0.00001145302],"about_ca_topic_score_codex":0.0028137567,"about_ca_topic_score_gemma":0.0032697935,"teacher_disagreement_score":0.0028137567,"about_ca_system_score_codex":0.0008826972,"about_ca_system_score_gemma":0.0003968475,"threshold_uncertainty_score":0.0064044595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97408324,0.00032984055,0.023837078,0.000068313304,0.000020747932,0.00008592548,0.000056117056,0.00037904436,0.0011396713],"genre_scores_gemma":[0.99646086,0.000067014844,0.0032921296,0.0000089791165,0.0000041092303,0.000020261554,0.00004028047,0.000008958734,0.00009732291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997835,0.0006781388,0.00017839755,0.00018161035,0.00082697027,0.0002999547],"domain_scores_gemma":[0.98758274,0.006426791,0.0019265697,0.00090672524,0.0028186608,0.00033857848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034865572,0.000625024,0.0005002922,0.0012835659,0.0002987925,0.0006873882,0.00072238396,0.000558349,0.00028562002],"category_scores_gemma":[0.01577689,0.00020262304,0.00020102659,0.0006290756,0.0004158181,0.00076635997,0.0003176272,0.0004861553,0.00006832389],"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.0027927882,0.0011730032,0.05245959,0.0005329149,0.0003633273,0.0004018918,0.0006107921,0.6598453,0.09553161,0.0056555583,0.0015510845,0.17908217],"study_design_scores_gemma":[0.00006477727,0.0015449293,0.007649811,0.000030253468,0.000109903965,0.00017991714,0.00012269831,0.9232867,0.065741286,0.000725138,0.00050263107,0.00004193846],"about_ca_topic_score_codex":0.0015772989,"about_ca_topic_score_gemma":0.0005884167,"teacher_disagreement_score":0.0034865572,"about_ca_system_score_codex":0.0010524677,"about_ca_system_score_gemma":0.0006213049,"threshold_uncertainty_score":0.018438935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22776994,0.0003509741,0.7654989,0.0008262192,0.0001018267,0.00017792964,0.00024722764,0.0013757772,0.0036512848],"genre_scores_gemma":[0.8301729,0.00021839248,0.16626823,0.00011600839,0.000114346076,0.00020894637,0.0003055783,0.0001893952,0.0024063473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600804,0.0009932849,0.00028389698,0.0006741059,0.0010020135,0.0010386329],"domain_scores_gemma":[0.98237854,0.01358405,0.0011127676,0.0015247323,0.0008561624,0.00054375024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044522183,0.00089838007,0.0016057878,0.0010190251,0.0018046843,0.004829632,0.0028166345,0.0012423262,0.0040274365],"category_scores_gemma":[0.021457756,0.0008758632,0.0010382893,0.0014940341,0.002220787,0.010018085,0.0027539257,0.0017616969,0.00045126717],"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.00085727754,0.0001139718,0.0027086583,0.00016359557,0.000075648386,0.00016853034,0.00035861056,0.84441644,0.003872331,0.10180771,0.0017308033,0.043726433],"study_design_scores_gemma":[0.000026846705,0.0000160527,0.00013153582,0.0000037930772,0.000010379319,0.0000148355075,0.00002470217,0.9499876,0.00077109935,0.048771344,0.0002324017,0.000009407522],"about_ca_topic_score_codex":0.011507824,"about_ca_topic_score_gemma":0.008699751,"teacher_disagreement_score":0.011507824,"about_ca_system_score_codex":0.004366333,"about_ca_system_score_gemma":0.0039756293,"threshold_uncertainty_score":0.031680167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031941163,0.00009707441,0.99589854,0.000031393596,0.000051743646,0.000021446338,0.000012718476,0.00051692675,0.00017605821],"genre_scores_gemma":[0.095241,0.0002528436,0.90223515,0.00007937979,0.00016878906,0.00013826058,0.00013030252,0.00009614734,0.0016581867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992663,0.00009685533,0.000053848613,0.00020374649,0.00033925334,0.000039965784],"domain_scores_gemma":[0.99867755,0.00034351955,0.00020814124,0.0001510861,0.00056426803,0.00005544124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590332,0.00067200273,0.0008918033,0.0013022567,0.00033071442,0.00078282156,0.0014367105,0.0008823234,0.0011536272],"category_scores_gemma":[0.0036507328,0.00043941755,0.00041923387,0.00079506176,0.00038942153,0.0022883182,0.0006043297,0.001223028,0.00056906656],"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.00020358963,0.00014719665,0.0022357495,0.00014228553,0.0000853112,0.00007443716,0.00009531504,0.04800289,0.06197172,0.008242748,0.002602561,0.8761963],"study_design_scores_gemma":[0.000035977144,0.00009427464,0.0008283551,0.0000106917105,0.000034393273,0.00020643383,0.000010457672,0.9727719,0.019523835,0.0015047966,0.0049432907,0.000035523968],"about_ca_topic_score_codex":0.0012273431,"about_ca_topic_score_gemma":0.0011104896,"teacher_disagreement_score":0.0014367105,"about_ca_system_score_codex":0.0005544334,"about_ca_system_score_gemma":0.0006512909,"threshold_uncertainty_score":0.0061296225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07837828,0.0028140184,0.9011028,0.0004334695,0.0002755962,0.00020791985,0.00005669346,0.005645696,0.011085554],"genre_scores_gemma":[0.75193805,0.0011848232,0.24051404,0.00021574006,0.00020654948,0.00009497484,0.00010651844,0.0001700041,0.0055693025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00017399604,0.000046231657,0.00007601129,0.00030436573,0.000085675594],"domain_scores_gemma":[0.9983217,0.0006237698,0.00018631901,0.00019275292,0.0006031643,0.00007223384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013507971,0.00064734917,0.0004581039,0.0008797051,0.00047852413,0.0011399665,0.0010392274,0.00054464705,0.0015459395],"category_scores_gemma":[0.0036064563,0.00016114672,0.0002603599,0.00037490999,0.00030865188,0.0011996072,0.0005511524,0.0008133871,0.00036555622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078498083,0.0004440311,0.0021857882,0.0003503773,0.00010439404,0.0004906401,0.0004462077,0.13960393,0.13223252,0.053872675,0.009646206,0.6598383],"study_design_scores_gemma":[0.00010593614,0.0005328819,0.0011204907,0.00003604904,0.0000700471,0.00084096333,0.00007194845,0.9372464,0.036628976,0.008268795,0.015020399,0.00005712707],"about_ca_topic_score_codex":0.0020037738,"about_ca_topic_score_gemma":0.0018174864,"teacher_disagreement_score":0.0020037738,"about_ca_system_score_codex":0.0004442459,"about_ca_system_score_gemma":0.00055221125,"threshold_uncertainty_score":0.007143736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049965657,0.00042975944,0.94649583,0.00016369612,0.000039364888,0.000041331354,0.00003502709,0.0001903049,0.0026390713],"genre_scores_gemma":[0.90147054,0.00036844463,0.09496632,0.00006696764,0.00005586547,0.00009592643,0.00007377316,0.00007280472,0.0028292916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.00036800804,0.000041449046,0.00013097047,0.0005154452,0.00015480205],"domain_scores_gemma":[0.99675304,0.0019977223,0.00019317896,0.00018098882,0.00079247344,0.00008260251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020959068,0.00050479476,0.0007738976,0.00047192682,0.0005292456,0.0012031845,0.0011797559,0.00069274864,0.00177663],"category_scores_gemma":[0.008705831,0.0004095944,0.0003952915,0.00040954578,0.00078323495,0.0012996522,0.0007522975,0.0009087615,0.00021917692],"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.00007236792,0.000022402015,0.00029461147,0.00002712674,0.000014484713,0.000030289959,0.00005146082,0.96096385,0.0020661326,0.027268725,0.0003012789,0.008887257],"study_design_scores_gemma":[0.000002225866,0.000005277765,0.00002628201,6.935192e-7,0.0000013111112,0.0000031658424,0.0000016914612,0.9987527,0.0000649928,0.0010915684,0.000048968734,0.0000011375141],"about_ca_topic_score_codex":0.007396223,"about_ca_topic_score_gemma":0.0028257915,"teacher_disagreement_score":0.007396223,"about_ca_system_score_codex":0.002169352,"about_ca_system_score_gemma":0.0017176919,"threshold_uncertainty_score":0.015739858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95180017,0.0011361117,0.044033017,0.00031602223,0.000045457207,0.000067246205,0.00004153208,0.00014418371,0.0024161534],"genre_scores_gemma":[0.9955396,0.00021066566,0.0039872155,0.000026343245,0.000013887421,0.000013421132,0.000016847107,0.000011035532,0.00018101811],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963407,0.0013940027,0.00022628871,0.00021457199,0.0015413223,0.00028316426],"domain_scores_gemma":[0.9734471,0.01853601,0.0034682453,0.0020363673,0.0020498117,0.00046252308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005068061,0.00042146278,0.00039168634,0.0006550754,0.00095617725,0.0015170722,0.00063371344,0.00072158925,0.00064523093],"category_scores_gemma":[0.025989207,0.00037271107,0.00023506542,0.00056332943,0.0012773662,0.0021678745,0.0007701769,0.0011891859,0.0001288403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004732977,0.00066472555,0.022335159,0.0005460754,0.00009958449,0.0016030333,0.0039050935,0.072007775,0.7721745,0.04514628,0.00092289323,0.07586192],"study_design_scores_gemma":[0.00027959773,0.002750575,0.023269435,0.00016883366,0.0003485442,0.0021508182,0.0009847383,0.3776642,0.5517431,0.035446826,0.005012732,0.00018066853],"about_ca_topic_score_codex":0.0010911651,"about_ca_topic_score_gemma":0.00047088682,"teacher_disagreement_score":0.005068061,"about_ca_system_score_codex":0.0012651562,"about_ca_system_score_gemma":0.0005327549,"threshold_uncertainty_score":0.026802778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048401408,0.00015281171,0.94272345,0.00023017243,0.00019422839,0.00014258434,0.000044183536,0.0018918822,0.0062193074],"genre_scores_gemma":[0.7335668,0.00017214759,0.26155242,0.00013616943,0.00011745571,0.000105234816,0.00015749765,0.00010246018,0.0040898076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.00028192412,0.00009465014,0.0001907616,0.0004129199,0.00013430961],"domain_scores_gemma":[0.9974722,0.00059469347,0.00031891355,0.0009263056,0.0005254366,0.00016241045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362171,0.00054746337,0.0005162607,0.0011993245,0.00059808395,0.0013969489,0.001597123,0.0005477658,0.0010012124],"category_scores_gemma":[0.0034781017,0.00030279523,0.0003784425,0.0007051599,0.00086779497,0.0021962684,0.0021779465,0.0014779825,0.0003249906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009344879,0.0005517129,0.004828922,0.00022588184,0.000059509915,0.0004771045,0.0005070437,0.05315934,0.17617114,0.14651218,0.0037247995,0.61284786],"study_design_scores_gemma":[0.0001688619,0.00066802104,0.001873305,0.00007012865,0.00011406878,0.0009156751,0.00011594236,0.75188154,0.18185475,0.039675705,0.022498984,0.00016302647],"about_ca_topic_score_codex":0.000664232,"about_ca_topic_score_gemma":0.00080682983,"teacher_disagreement_score":0.001597123,"about_ca_system_score_codex":0.00075940276,"about_ca_system_score_gemma":0.0010887323,"threshold_uncertainty_score":0.0072039366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26617983,0.0028901615,0.72684336,0.00046854312,0.000113314265,0.000072815725,0.000027725959,0.00017432754,0.0032299415],"genre_scores_gemma":[0.914979,0.0014111488,0.08229151,0.000037517293,0.000079539175,0.000034083183,0.0000239035,0.00002879339,0.0011145077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.00010247243,0.0000075913536,0.000029602403,0.000087458604,0.000030948762],"domain_scores_gemma":[0.9984487,0.0011478057,0.000082936036,0.00006952807,0.00020690246,0.000044122044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072398945,0.00034600892,0.000362952,0.00031382072,0.0004183071,0.00044113368,0.0006539882,0.00038006654,0.0009868954],"category_scores_gemma":[0.0035876348,0.000174813,0.00025355592,0.0003434861,0.00045201974,0.001037734,0.00021038619,0.00051751756,0.000055504748],"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.00019646321,0.00006366468,0.0013702401,0.00027051926,0.000044346794,0.0002696579,0.00024268185,0.8589747,0.013795804,0.04735504,0.001103857,0.07631298],"study_design_scores_gemma":[0.000012181369,0.000099451645,0.00020455194,0.000010947827,0.00000781839,0.00009332056,0.00003626482,0.99237263,0.0016019081,0.005015764,0.00054137356,0.0000038940416],"about_ca_topic_score_codex":0.0016683468,"about_ca_topic_score_gemma":0.0009027899,"teacher_disagreement_score":0.0016683468,"about_ca_system_score_codex":0.00043924397,"about_ca_system_score_gemma":0.00060180953,"threshold_uncertainty_score":0.0038288832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33831558,0.003114762,0.6310171,0.0015349427,0.00025150954,0.00013226387,0.00009000004,0.0019034421,0.023640476],"genre_scores_gemma":[0.9304845,0.00083850196,0.06550894,0.00009360631,0.00007693701,0.000046856276,0.00011188932,0.00003461495,0.002804139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.00009704492,0.000013642232,0.000016555723,0.000110442816,0.000034131466],"domain_scores_gemma":[0.99975294,0.000083823106,0.000027738206,0.000044967765,0.00007334387,0.00001724178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047145764,0.00014513683,0.00021105887,0.00040735252,0.00050046394,0.00035578,0.00041474626,0.00044265814,0.0005038636],"category_scores_gemma":[0.0009833256,0.00014064724,0.00015351833,0.00031374264,0.000279384,0.0008146826,0.0004574829,0.000266178,0.00014042226],"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.00029443568,0.000096239484,0.002364984,0.00021359515,0.000059384573,0.0012405552,0.00040610312,0.53552073,0.092822455,0.10458351,0.010721158,0.25167692],"study_design_scores_gemma":[0.000026149435,0.00008077964,0.0010785399,0.000019524377,0.000025541762,0.00026141046,0.00011610621,0.948571,0.009647504,0.028861849,0.0112910755,0.000020612239],"about_ca_topic_score_codex":0.0019926566,"about_ca_topic_score_gemma":0.0022381363,"teacher_disagreement_score":0.0019926566,"about_ca_system_score_codex":0.00048526286,"about_ca_system_score_gemma":0.000275102,"threshold_uncertainty_score":0.0039620996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024228377,0.00021744984,0.9723078,0.00016798687,0.00014874412,0.00015040362,0.000032007087,0.0012615992,0.0014857413],"genre_scores_gemma":[0.43930373,0.000117069714,0.5568526,0.00019616456,0.00021835926,0.00019479863,0.00010823411,0.000101320424,0.0029077956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980501,0.0004893081,0.00015410512,0.00034863097,0.0006604396,0.00029743346],"domain_scores_gemma":[0.99725693,0.0007805221,0.00020320379,0.0004829778,0.0011422068,0.00013425495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003269046,0.00051457144,0.0011779576,0.0010574874,0.0012079385,0.0007874074,0.0027814184,0.001106164,0.001417784],"category_scores_gemma":[0.0051395623,0.00030618,0.00046489877,0.00066465035,0.00069549325,0.0013294487,0.0010539849,0.00118991,0.00045831443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015457517,0.0005991578,0.0031797995,0.00015193282,0.00014027792,0.00031951335,0.00054398837,0.326646,0.056007717,0.04069136,0.007767715,0.5624069],"study_design_scores_gemma":[0.00015296058,0.00019803482,0.00039327022,0.000008177646,0.000036573903,0.00015960647,0.00001984071,0.97947824,0.011613412,0.0043405695,0.0035593852,0.0000398945],"about_ca_topic_score_codex":0.0025752394,"about_ca_topic_score_gemma":0.0017009369,"teacher_disagreement_score":0.003269046,"about_ca_system_score_codex":0.0009838514,"about_ca_system_score_gemma":0.0016749902,"threshold_uncertainty_score":0.017288566},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912544,0.0002967004,0.8536502,0.00020771817,0.00029157448,0.0005325969,0.0010355378,0.07139312,0.013467123],"genre_scores_gemma":[0.66920793,0.0003600262,0.3126892,0.00040033518,0.00009257138,0.00073884946,0.0025820592,0.004373693,0.009555283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00014286842,0.000060195493,0.00015222919,0.0006670508,0.00011024023],"domain_scores_gemma":[0.99843127,0.0005839505,0.00015412076,0.00038748982,0.0003365427,0.00010659507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255012,0.00084100233,0.00054543803,0.0010180193,0.00032693875,0.00097132806,0.0031392467,0.00086009176,0.0045113773],"category_scores_gemma":[0.004178177,0.0004508183,0.00036191955,0.0005582987,0.000559359,0.0014059453,0.0012017683,0.0013377705,0.0012346908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011751296,0.000548987,0.0058686757,0.0006273115,0.000100507954,0.0009955643,0.00072020665,0.31619793,0.19277798,0.04537758,0.047634386,0.38797572],"study_design_scores_gemma":[0.00012555263,0.0003401998,0.0008664669,0.000034338947,0.00002531447,0.00041119097,0.000039070346,0.868245,0.09151974,0.005357134,0.03294899,0.00008699107],"about_ca_topic_score_codex":0.0010225323,"about_ca_topic_score_gemma":0.0007328451,"teacher_disagreement_score":0.0045113773,"about_ca_system_score_codex":0.00068891887,"about_ca_system_score_gemma":0.00077923277,"threshold_uncertainty_score":0.015092075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966575,0.001167813,0.026352078,0.00021648276,0.000050568524,0.000024676785,0.000083856714,0.0011022326,0.004427316],"genre_scores_gemma":[0.9974172,0.00011902937,0.0020207008,0.000027243741,0.000013013329,0.000005935218,0.000064632746,0.000033705113,0.00029856423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739695,0.0007126642,0.000119809,0.00023867165,0.0006925303,0.00083926495],"domain_scores_gemma":[0.9855049,0.009155304,0.001132364,0.0017523476,0.0020336276,0.00042147585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032798704,0.00069837907,0.0009010221,0.0014373029,0.0005208731,0.0010596663,0.0009281956,0.00065034744,0.0013488367],"category_scores_gemma":[0.01904688,0.0002610133,0.00027980012,0.0010447665,0.0006699028,0.0015124513,0.0009161579,0.0005210323,0.0004176399],"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.004711424,0.0009726923,0.02808231,0.00038852906,0.0002613792,0.0005628217,0.00035252774,0.6549717,0.07552191,0.004713505,0.002215338,0.22724581],"study_design_scores_gemma":[0.00008036349,0.0013510633,0.009582223,0.000036119724,0.00014611911,0.00035555963,0.00017265182,0.9437203,0.042220682,0.0013581609,0.00093516725,0.000041637828],"about_ca_topic_score_codex":0.0034895309,"about_ca_topic_score_gemma":0.001691928,"teacher_disagreement_score":0.0034895309,"about_ca_system_score_codex":0.0009267958,"about_ca_system_score_gemma":0.00064323976,"threshold_uncertainty_score":0.017345786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74666226,0.0027381491,0.24454178,0.0002517412,0.00012318586,0.00029234454,0.0001015689,0.0017241627,0.0035648397],"genre_scores_gemma":[0.9468868,0.00047005762,0.051916204,0.000038489732,0.000018022423,0.00006360067,0.00010850436,0.00003943922,0.0004590087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974717,0.0009487087,0.00023702387,0.00021933609,0.0008778038,0.00024551712],"domain_scores_gemma":[0.98705775,0.008773963,0.0009525699,0.0007041462,0.0022168662,0.0002947124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054854443,0.00081275107,0.0006661707,0.0014228676,0.0004987481,0.00087592076,0.0010939826,0.0006724012,0.00040783643],"category_scores_gemma":[0.01884571,0.0002070266,0.0002071834,0.0011494664,0.0005172042,0.0013049627,0.00059845735,0.00063535804,0.00012847666],"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.0024633748,0.0006970528,0.011417622,0.00028084547,0.00015043287,0.00009374519,0.00018500241,0.72541475,0.01401198,0.004448467,0.0010013519,0.23983537],"study_design_scores_gemma":[0.000056688943,0.00046832673,0.0010345946,0.000009192774,0.000019068353,0.00005619374,0.000032098975,0.9887559,0.008958769,0.00038350763,0.00021491808,0.000010780558],"about_ca_topic_score_codex":0.0024802869,"about_ca_topic_score_gemma":0.0011929509,"teacher_disagreement_score":0.0054854443,"about_ca_system_score_codex":0.0016918709,"about_ca_system_score_gemma":0.0008237518,"threshold_uncertainty_score":0.029010177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9745145,0.0008710288,0.018903812,0.0002254319,0.000079959485,0.00017165336,0.00052503834,0.0007211743,0.003987463],"genre_scores_gemma":[0.99715436,0.0003041817,0.0018908508,0.000030956806,0.000050022663,0.000051632018,0.0002909395,0.000022986067,0.00020409313],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966704,0.00086608937,0.0002680789,0.00044069823,0.0014105585,0.0003442497],"domain_scores_gemma":[0.9921376,0.0028512473,0.0010419076,0.0009633791,0.0026831958,0.00032262728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406565,0.00068065745,0.0006106194,0.0015846429,0.0009361481,0.0009289985,0.0015120022,0.0011181957,0.00036919964],"category_scores_gemma":[0.009639783,0.00028830502,0.00020417549,0.002505835,0.0005210606,0.0017621497,0.00059776334,0.0011248763,0.00018549369],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029206825,0.0056216945,0.31620196,0.0016805179,0.00084111246,0.003072016,0.003520856,0.09019023,0.28544855,0.009748975,0.010561375,0.27019206],"study_design_scores_gemma":[0.00023579091,0.008532971,0.25432822,0.0002900236,0.00062781316,0.0071853353,0.0018318096,0.4945894,0.2068074,0.003709574,0.021586621,0.0002750849],"about_ca_topic_score_codex":0.002375799,"about_ca_topic_score_gemma":0.0012429086,"teacher_disagreement_score":0.002406565,"about_ca_system_score_codex":0.0009304167,"about_ca_system_score_gemma":0.00036845086,"threshold_uncertainty_score":0.01272732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034457643,0.0011577461,0.96032137,0.00041242145,0.00018914689,0.00010553464,0.00007196864,0.00038061375,0.0029035704],"genre_scores_gemma":[0.9632107,0.00090606534,0.03363813,0.00008341013,0.00019375412,0.00017096508,0.00008441298,0.000037126396,0.0016754036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.00012804552,0.0000267347,0.000070684466,0.00017459404,0.00006277759],"domain_scores_gemma":[0.99918133,0.0003691719,0.000119958924,0.00003640789,0.0002484744,0.00004465164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010597303,0.0005662277,0.00047013868,0.000439731,0.0008316348,0.0013804152,0.0010510264,0.0004558683,0.0013215842],"category_scores_gemma":[0.0029843184,0.00021694913,0.00035447895,0.000493482,0.0005237165,0.0008566432,0.00075024355,0.00073953945,0.00017463023],"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.00016914905,0.00010410083,0.000884009,0.00024306042,0.000043368625,0.00018238825,0.00022192868,0.8348625,0.01455762,0.08041828,0.0035072821,0.06480628],"study_design_scores_gemma":[0.000007497365,0.00001775272,0.000035746478,0.000002372779,0.0000041547682,0.000004148165,0.0000049059972,0.996104,0.00029011877,0.003247728,0.00027854193,0.0000030898448],"about_ca_topic_score_codex":0.00737096,"about_ca_topic_score_gemma":0.00550923,"teacher_disagreement_score":0.00737096,"about_ca_system_score_codex":0.0012210208,"about_ca_system_score_gemma":0.0017380003,"threshold_uncertainty_score":0.014656067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011647014,0.000082885424,0.98777956,0.000032509142,0.000032583073,0.000024578114,0.000029246412,0.00019684396,0.00017490757],"genre_scores_gemma":[0.32976788,0.00023000642,0.6674326,0.000123206,0.00016511898,0.00020603451,0.00028807935,0.00012441188,0.0016625976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.00019232575,0.000022089285,0.00008889851,0.00016965873,0.000038819257],"domain_scores_gemma":[0.9979907,0.0011522574,0.00011423275,0.0002725308,0.00036560616,0.000104681814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015426904,0.00054512825,0.0011303497,0.0006973323,0.0005309023,0.0006954571,0.00195493,0.0010035033,0.0009664568],"category_scores_gemma":[0.004824824,0.00054124213,0.00077388255,0.00073299493,0.0007121124,0.0012928939,0.0009025515,0.0012224021,0.00025833084],"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.00031442835,0.00024501665,0.003637054,0.00010470415,0.00013912884,0.000095964526,0.00010611705,0.73796564,0.014922849,0.020117698,0.001665781,0.22068566],"study_design_scores_gemma":[0.0000038057544,0.000011587612,0.00006169481,8.045461e-7,0.000002848506,0.000005907659,9.961229e-7,0.99882203,0.00039431095,0.0006030288,0.00009036805,0.0000026139237],"about_ca_topic_score_codex":0.0046875277,"about_ca_topic_score_gemma":0.004368859,"teacher_disagreement_score":0.0046875277,"about_ca_system_score_codex":0.0005280602,"about_ca_system_score_gemma":0.0009896038,"threshold_uncertainty_score":0.009320438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046069007,0.00003305784,0.9944067,0.00003854742,0.000010547487,0.000020068865,0.000014939666,0.0003953049,0.00047393495],"genre_scores_gemma":[0.44804865,0.000113858085,0.5498819,0.00007067574,0.00005470593,0.00012442673,0.0001610088,0.000121165016,0.0014236504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920315,0.00019344744,0.000042293424,0.00020006073,0.0003125818,0.00004854281],"domain_scores_gemma":[0.99837935,0.00076259515,0.00018959174,0.0003510697,0.00028001997,0.000037304144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376309,0.0006887147,0.00054112816,0.00040913763,0.0006229467,0.00052016956,0.001655684,0.00075134396,0.0009284751],"category_scores_gemma":[0.0066436613,0.00040452063,0.000414021,0.0003211293,0.0005270098,0.0012810682,0.0008895065,0.001979338,0.00026899556],"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.00012153113,0.00012474487,0.0017049873,0.00007443729,0.00008141018,0.00014140473,0.00020212591,0.7662937,0.017764425,0.014914658,0.001397023,0.19717956],"study_design_scores_gemma":[0.000004165359,0.000024167613,0.00020490563,0.0000044295416,0.0000091599395,0.00003607653,0.000008076028,0.9899816,0.005517901,0.0036082948,0.00059427216,0.0000070460933],"about_ca_topic_score_codex":0.0017620046,"about_ca_topic_score_gemma":0.0017766148,"teacher_disagreement_score":0.0017620046,"about_ca_system_score_codex":0.0005782187,"about_ca_system_score_gemma":0.0005291828,"threshold_uncertainty_score":0.008131921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14918986,0.00096295954,0.809906,0.0003372967,0.00075831235,0.00041650143,0.00034339813,0.015916258,0.022169422],"genre_scores_gemma":[0.49478754,0.00027579267,0.48876452,0.0002804552,0.0001127451,0.00012191862,0.00036490176,0.00020621435,0.015085932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999602,0.000069656715,0.000029962212,0.000075926924,0.00014781472,0.0000746967],"domain_scores_gemma":[0.9995896,0.00009981795,0.000041172396,0.000098929304,0.00014145664,0.000028980861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031069492,0.0005654231,0.00038866312,0.0005635698,0.00024121048,0.00061290764,0.0010030374,0.00053879304,0.0060591754],"category_scores_gemma":[0.0006338285,0.00029198156,0.00026658282,0.00031393982,0.00017622147,0.0004783073,0.000163945,0.00047179326,0.0014769392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030714248,0.0003899516,0.0021817612,0.00049282983,0.0002319009,0.00092996325,0.00016008831,0.06682395,0.3216273,0.012052499,0.015541662,0.5764967],"study_design_scores_gemma":[0.0006898137,0.0019378859,0.0062438576,0.00007422613,0.00024888795,0.00253656,0.000050338036,0.5847095,0.34655768,0.0017227599,0.055058356,0.00017006807],"about_ca_topic_score_codex":0.001324087,"about_ca_topic_score_gemma":0.0018077785,"teacher_disagreement_score":0.0060591754,"about_ca_system_score_codex":0.00043228274,"about_ca_system_score_gemma":0.0003746854,"threshold_uncertainty_score":0.02026993},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005631118,0.33654252,0.5804,0.0014736865,0.001790806,0.0005559246,0.00034049526,0.0016783645,0.07158705],"genre_scores_gemma":[0.15016903,0.5382357,0.26903403,0.001861411,0.0041527934,0.0010267828,0.0017012379,0.0006287157,0.033190347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958586,0.0006790054,0.00041421235,0.00063497626,0.0021325252,0.00028078214],"domain_scores_gemma":[0.99793756,0.0008200136,0.00014583768,0.00025803733,0.0007558369,0.00008264075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028802499,0.0016431098,0.0017473924,0.0032159828,0.0010941743,0.003723553,0.0030547061,0.002014531,0.004240214],"category_scores_gemma":[0.004697505,0.0009897782,0.00090390095,0.0067037083,0.00122243,0.004382763,0.0015459129,0.002674606,0.0021887284],"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.00020018256,0.00019309307,0.001170505,0.0022382492,0.00006939587,0.00014194014,0.00024025253,0.021425763,0.0027784554,0.08567438,0.01756264,0.8683052],"study_design_scores_gemma":[0.0000701819,0.00043742213,0.0019366972,0.0021445157,0.00019632517,0.0013627576,0.00023100746,0.18524618,0.009341667,0.06488782,0.73391247,0.00023299363],"about_ca_topic_score_codex":0.006215853,"about_ca_topic_score_gemma":0.0024686556,"teacher_disagreement_score":0.006215853,"about_ca_system_score_codex":0.00291267,"about_ca_system_score_gemma":0.0028502808,"threshold_uncertainty_score":0.021133006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581918,0.0051408745,0.02106732,0.00030622448,0.00040355764,0.000086179985,0.00021543691,0.0007870944,0.013801539],"genre_scores_gemma":[0.9935933,0.0005517154,0.0045775617,0.00005432947,0.00006941744,0.000024562776,0.00019831356,0.00004238869,0.0008884963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727565,0.00085450045,0.0001714664,0.00020826476,0.0011135204,0.00037670124],"domain_scores_gemma":[0.9909383,0.0050077885,0.00043920788,0.00064969674,0.0023448416,0.0006201549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003293474,0.0007816386,0.0010677441,0.0017484232,0.0005923155,0.0011734829,0.0010455113,0.00087512494,0.0010894539],"category_scores_gemma":[0.00833133,0.00033700807,0.00031242572,0.00104978,0.000409693,0.0023088478,0.0007513733,0.00082959316,0.00018601688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.051841117,0.0027830345,0.03538965,0.0022353376,0.001803907,0.00144618,0.0006914825,0.26743877,0.21543571,0.013448145,0.008749214,0.3987375],"study_design_scores_gemma":[0.0013416067,0.01440632,0.054875053,0.0001673401,0.0016287398,0.0016897318,0.0007456986,0.78517705,0.12270281,0.0053499164,0.011523817,0.00039185266],"about_ca_topic_score_codex":0.0012756718,"about_ca_topic_score_gemma":0.0014848942,"teacher_disagreement_score":0.003293474,"about_ca_system_score_codex":0.00053942075,"about_ca_system_score_gemma":0.00040873728,"threshold_uncertainty_score":0.017417729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003687858,0.00005914068,0.99550253,0.000028771756,0.000034049393,0.000047480236,0.0000068229374,0.00018093319,0.00045240292],"genre_scores_gemma":[0.13721538,0.0001155751,0.8604785,0.00009420469,0.000069823756,0.00014014042,0.000053404423,0.000076808916,0.0017560739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877304,0.00032687502,0.00007770755,0.00019532078,0.00051386614,0.00011311612],"domain_scores_gemma":[0.9980566,0.00091654214,0.00010511651,0.00032138082,0.00054067065,0.00005981657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029963297,0.000599437,0.00074310496,0.0008896857,0.00062874024,0.0010619492,0.001512015,0.00106065,0.0023223755],"category_scores_gemma":[0.007907209,0.0003130969,0.00043880666,0.00067116716,0.0009559965,0.0014884823,0.0013859833,0.0015816988,0.0006793697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005556786,0.00016269024,0.0011059792,0.00011782696,0.00005553705,0.00011983905,0.00024334376,0.3676862,0.029454574,0.116514064,0.0019864158,0.48199788],"study_design_scores_gemma":[0.000036356876,0.0000586817,0.00009884888,0.0000088357665,0.000008854577,0.00004475706,0.0000048472325,0.97938615,0.0067010797,0.01107129,0.0025678163,0.00001254164],"about_ca_topic_score_codex":0.0011562487,"about_ca_topic_score_gemma":0.0010036358,"teacher_disagreement_score":0.0029963297,"about_ca_system_score_codex":0.0010590587,"about_ca_system_score_gemma":0.0011870351,"threshold_uncertainty_score":0.015846252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009881824,0.0012243425,0.99243575,0.00053673587,0.0001901701,0.000057711422,0.00004090417,0.00015732567,0.004368858],"genre_scores_gemma":[0.18891709,0.00507986,0.79492515,0.0006639608,0.0017268475,0.0007307342,0.00021243127,0.00011019634,0.007633737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979387,0.0006585565,0.000095575684,0.0003945512,0.0007593878,0.00015324877],"domain_scores_gemma":[0.9989749,0.0004089596,0.000090790076,0.00018784119,0.00024456906,0.00009292307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002975437,0.0013662272,0.00090748916,0.0008898642,0.0017363805,0.0032678063,0.0031275798,0.0024039187,0.003109215],"category_scores_gemma":[0.0027893533,0.00048020683,0.0013460547,0.0012181051,0.003964738,0.00452424,0.0016896172,0.0039452887,0.0010671696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001764893,0.000036535515,0.000075256976,0.00008025355,0.000015451724,0.00007240575,0.00010726308,0.043366544,0.0015521842,0.93339443,0.0016490784,0.019632932],"study_design_scores_gemma":[0.0000419343,0.00010739318,0.00012920544,0.00008748699,0.000030817442,0.00008707314,0.00004075995,0.38082653,0.0014089514,0.5840254,0.033176366,0.000038077473],"about_ca_topic_score_codex":0.003562807,"about_ca_topic_score_gemma":0.0019265393,"teacher_disagreement_score":0.003562807,"about_ca_system_score_codex":0.0020326735,"about_ca_system_score_gemma":0.0025638214,"threshold_uncertainty_score":0.015735805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860482,0.0012408412,0.00894679,0.00021687834,0.00015010936,0.00007406367,0.0001184181,0.0005525102,0.002652212],"genre_scores_gemma":[0.9974552,0.00036533782,0.0017220135,0.000049784954,0.000018527482,0.0000094515835,0.000048149206,0.000042498334,0.00028906608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983558,0.00056917773,0.00010301607,0.00013455255,0.0006195518,0.00021784849],"domain_scores_gemma":[0.9793457,0.015400136,0.0020824147,0.0010700865,0.001654284,0.00044734962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014638278,0.0007905196,0.0005503102,0.00091586856,0.0007390273,0.00078415463,0.00066896365,0.0008212963,0.0006591229],"category_scores_gemma":[0.0086266,0.00037017357,0.0006184216,0.00060569606,0.0008754072,0.0010257805,0.00032833626,0.0011087555,0.0001412328],"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.0030543173,0.0008847679,0.030444292,0.00083704456,0.0003976405,0.003719806,0.00069136906,0.6107555,0.29244572,0.0025763235,0.0019646431,0.052228674],"study_design_scores_gemma":[0.00012705912,0.0025383534,0.024987826,0.00007581376,0.00055030163,0.0014981313,0.00022964361,0.75725764,0.20980984,0.0011065265,0.0016867637,0.0001320872],"about_ca_topic_score_codex":0.0040957006,"about_ca_topic_score_gemma":0.0029750536,"teacher_disagreement_score":0.0040957006,"about_ca_system_score_codex":0.0009585352,"about_ca_system_score_gemma":0.00056463,"threshold_uncertainty_score":0.008143723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5083792,0.0032145677,0.47273535,0.0010457599,0.00017421777,0.000088389264,0.00031600572,0.0011973898,0.012849129],"genre_scores_gemma":[0.9893154,0.00026093682,0.009036367,0.00010209491,0.00003488261,0.000028918064,0.00007896586,0.000055634602,0.0010867777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534875,0.0011756466,0.0001799379,0.0006889333,0.0010716334,0.0015351634],"domain_scores_gemma":[0.983533,0.011661677,0.0012220406,0.0008306069,0.0020110074,0.00074169727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005346742,0.0016257162,0.0010992404,0.0010582892,0.0010718931,0.004029643,0.0013735703,0.0023325125,0.0019868757],"category_scores_gemma":[0.016730491,0.0005977318,0.0004257328,0.0008883511,0.0020498468,0.00254972,0.0016220895,0.0009824899,0.00048369917],"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.0017099305,0.00010389873,0.0017416406,0.0001084594,0.00010124425,0.00026821054,0.00010751391,0.9571191,0.013961583,0.017283393,0.0007054274,0.0067895018],"study_design_scores_gemma":[0.000023530829,0.00016183774,0.00025113727,0.000015837251,0.000034895907,0.00008626942,0.000037617436,0.9897125,0.0054602926,0.0039639175,0.00021998893,0.000032214648],"about_ca_topic_score_codex":0.0040044943,"about_ca_topic_score_gemma":0.0014749321,"teacher_disagreement_score":0.005346742,"about_ca_system_score_codex":0.0023834626,"about_ca_system_score_gemma":0.001617576,"threshold_uncertainty_score":0.028276622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87391883,0.0010069886,0.11709799,0.00077899056,0.000077972196,0.0003450936,0.0012146827,0.0010664964,0.0044929273],"genre_scores_gemma":[0.9846234,0.00052379415,0.013409124,0.000064632004,0.000035411394,0.00019019695,0.00053673843,0.00005901429,0.0005578068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981817,0.0006854022,0.00011201855,0.00029200185,0.0005393087,0.00018967228],"domain_scores_gemma":[0.98571914,0.00918125,0.00149171,0.0017978766,0.0016209161,0.00018908583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046869824,0.0014167217,0.0011074792,0.0014769933,0.00064498873,0.001190339,0.0027774202,0.002570181,0.0007166117],"category_scores_gemma":[0.026017942,0.00057749613,0.0006435365,0.00193519,0.0011150382,0.0031767148,0.0009052787,0.001941389,0.0003491905],"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.00018224312,0.00045631008,0.013864864,0.00014372854,0.00006318356,0.00010445549,0.00023742161,0.9602542,0.0027616874,0.007249598,0.0011627155,0.013519551],"study_design_scores_gemma":[0.000011522823,0.00006139147,0.0018544579,0.000011430492,0.000008653634,0.000025224557,0.000017440509,0.9956956,0.0005045546,0.0015857156,0.00020878087,0.000015274754],"about_ca_topic_score_codex":0.018347545,"about_ca_topic_score_gemma":0.0074615963,"teacher_disagreement_score":0.018347545,"about_ca_system_score_codex":0.0022475487,"about_ca_system_score_gemma":0.0010529873,"threshold_uncertainty_score":0.0364815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12674779,0.0008174608,0.85663414,0.00021633819,0.000073015784,0.00015879303,0.00007594497,0.0006971033,0.014579417],"genre_scores_gemma":[0.986048,0.00021620339,0.012224042,0.000036631034,0.000036963113,0.000055715416,0.00004571628,0.000025590882,0.0013111419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909985,0.0001175422,0.00004694114,0.00012561992,0.0005047375,0.000105365456],"domain_scores_gemma":[0.9976768,0.0008864575,0.00044873552,0.000269784,0.0006303766,0.0000879359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629704,0.00061322114,0.0005107336,0.00069737417,0.00039305177,0.0014951477,0.0010088461,0.00068213517,0.0020882962],"category_scores_gemma":[0.00530361,0.0002455017,0.00040372662,0.0002685983,0.0008257449,0.0011949992,0.00040024178,0.0008620059,0.00024331846],"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.0003121452,0.00019963748,0.0023802018,0.00021147926,0.00004684891,0.000224816,0.0001240818,0.8256745,0.044103377,0.06546363,0.0010029672,0.060256477],"study_design_scores_gemma":[0.000007412516,0.00010478411,0.00045665994,0.0000088939,0.0000065522054,0.000077747914,0.0000064211986,0.99369824,0.0029963744,0.0021365266,0.0004911015,0.000009240056],"about_ca_topic_score_codex":0.0019007102,"about_ca_topic_score_gemma":0.0013761327,"teacher_disagreement_score":0.0020882962,"about_ca_system_score_codex":0.00090213807,"about_ca_system_score_gemma":0.0012561255,"threshold_uncertainty_score":0.007208109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331029,0.00046133535,0.05475668,0.0006487959,0.000057888614,0.00016667797,0.00026063286,0.00012439335,0.010420802],"genre_scores_gemma":[0.9933882,0.00018392582,0.0054627955,0.000037260936,0.000008740675,0.000058798392,0.00008556861,0.00000995601,0.00076472556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865204,0.00078996253,0.000044795135,0.000071378454,0.00022465938,0.00021720768],"domain_scores_gemma":[0.9898413,0.008085514,0.0005766346,0.00037068967,0.0007226286,0.000403278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023785864,0.00070036,0.000728673,0.00066846306,0.000594742,0.0009752598,0.0011818993,0.0012023144,0.0014084432],"category_scores_gemma":[0.0090685375,0.00031859463,0.0005743111,0.0009020727,0.00094136846,0.0018486916,0.0006224693,0.0011851025,0.0000932196],"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.00011897399,0.00012985617,0.0017282843,0.000024093108,0.000031086758,0.000055915778,0.000058265552,0.98708016,0.00061398617,0.0075859088,0.00022636197,0.002347083],"study_design_scores_gemma":[0.000024709658,0.00009457232,0.00027085285,0.000003976422,0.000010129834,0.000015825344,0.000025635116,0.9977168,0.00027529034,0.0013504204,0.00020466252,0.00000719853],"about_ca_topic_score_codex":0.009832186,"about_ca_topic_score_gemma":0.005750481,"teacher_disagreement_score":0.009832186,"about_ca_system_score_codex":0.0019182538,"about_ca_system_score_gemma":0.00094569067,"threshold_uncertainty_score":0.019549906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015435216,0.00029394036,0.9812176,0.000065400585,0.000059171005,0.000047765934,0.000007523531,0.00068360136,0.0021897054],"genre_scores_gemma":[0.78404623,0.00058434025,0.21253945,0.0002110516,0.000112451526,0.00014318392,0.00003660326,0.00006238704,0.0022642664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000042313095,0.000015190138,0.000049131868,0.00008911161,0.000021899199],"domain_scores_gemma":[0.9995609,0.00016930545,0.000054233133,0.000040689072,0.00016108961,0.0000137232855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042405108,0.0005207731,0.00035684629,0.00035539508,0.00031878785,0.00044693396,0.0007039634,0.00048806713,0.0009890189],"category_scores_gemma":[0.0010470907,0.000211079,0.0002864895,0.00020202674,0.0005148128,0.00061449915,0.00041279517,0.00047634786,0.00033864548],"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.00026075475,0.00015462586,0.0014161228,0.00048508408,0.000072826864,0.00031172417,0.0005012542,0.40965393,0.17110239,0.03255897,0.0027110938,0.38077116],"study_design_scores_gemma":[0.000039413797,0.0002740819,0.00042127672,0.000021236736,0.000029858085,0.00012349457,0.000030222489,0.96396327,0.023566388,0.005585195,0.0059217783,0.00002381938],"about_ca_topic_score_codex":0.0008204604,"about_ca_topic_score_gemma":0.0006417142,"teacher_disagreement_score":0.0009890189,"about_ca_system_score_codex":0.00026808307,"about_ca_system_score_gemma":0.0003051365,"threshold_uncertainty_score":0.0033085942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41791397,0.00039619996,0.57841134,0.0002017536,0.000076407385,0.00008279355,0.00012351036,0.000707146,0.0020869493],"genre_scores_gemma":[0.9864842,0.000057436493,0.012981169,0.000022249456,0.000013417468,0.000026103451,0.000032355452,0.00001779914,0.0003652061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979329,0.000625822,0.00010526658,0.0003335168,0.0006362364,0.0003662529],"domain_scores_gemma":[0.9933869,0.0043245736,0.0006858481,0.00039514026,0.0010143799,0.00019309127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004607245,0.0010466764,0.0008652424,0.0011190568,0.0010546715,0.0015800347,0.0017187397,0.00091752544,0.0010981471],"category_scores_gemma":[0.013740259,0.0004040647,0.00047155068,0.0009769412,0.0011992096,0.002187401,0.0010702886,0.00074783055,0.00014797541],"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.00024912163,0.00007916348,0.0027394444,0.000038094753,0.00005183841,0.000070258066,0.000116469695,0.97163403,0.005615229,0.0075322445,0.00019649306,0.011677606],"study_design_scores_gemma":[0.0000044083927,0.000032058728,0.00020156144,0.0000018062835,0.000005101934,0.0000067960195,0.000011289617,0.9978911,0.0005662248,0.0012397896,0.000033062566,0.00000677243],"about_ca_topic_score_codex":0.013317364,"about_ca_topic_score_gemma":0.0062290593,"teacher_disagreement_score":0.013317364,"about_ca_system_score_codex":0.002774978,"about_ca_system_score_gemma":0.0019148636,"threshold_uncertainty_score":0.026479721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18912724,0.00026028184,0.80596286,0.00039903296,0.000054765565,0.0000332042,0.000048297086,0.0013630982,0.0027512342],"genre_scores_gemma":[0.9218155,0.00022690618,0.07593647,0.000033190954,0.000033894037,0.000041842133,0.00006740197,0.000030167263,0.0018146861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997938,0.00006642351,0.000010366995,0.000026454376,0.00008210615,0.000020850894],"domain_scores_gemma":[0.99913436,0.0005491226,0.00008015286,0.000040810104,0.00017105116,0.000024508898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000497377,0.0004893067,0.00031732357,0.000375284,0.0002739974,0.00044276385,0.00038425857,0.00071865483,0.0005247789],"category_scores_gemma":[0.003026328,0.00022997985,0.00015662801,0.00026206535,0.00040467875,0.0006937396,0.00029689338,0.0005440553,0.00022579407],"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.0003052316,0.00008952388,0.0035710842,0.00004601391,0.000029962075,0.00008807964,0.00009726032,0.83760864,0.026334997,0.0037336675,0.00090213213,0.12719342],"study_design_scores_gemma":[0.0000075131006,0.000016975413,0.00042885976,0.0000022396107,0.00000310333,0.000007684692,0.000004532637,0.9965938,0.0023568773,0.0004792046,0.00009546845,0.000003850873],"about_ca_topic_score_codex":0.007977241,"about_ca_topic_score_gemma":0.005462201,"teacher_disagreement_score":0.007977241,"about_ca_system_score_codex":0.000542933,"about_ca_system_score_gemma":0.0004500171,"threshold_uncertainty_score":0.01586163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092332475,0.00072680647,0.98201925,0.0002809648,0.00007748551,0.00010227941,0.0000889583,0.00037802247,0.007093044],"genre_scores_gemma":[0.3985769,0.00084697397,0.5923536,0.0003814279,0.00017369539,0.0005755301,0.00041679636,0.00019253115,0.006482651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.00033404634,0.000043101707,0.00018908732,0.00029335506,0.00013678454],"domain_scores_gemma":[0.9986815,0.0007548816,0.000098518605,0.00021423433,0.00017559459,0.000075265816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012820782,0.0010304782,0.0011872839,0.0007309243,0.0010263782,0.0012496975,0.0023981838,0.0016204788,0.0050107073],"category_scores_gemma":[0.004242475,0.0005660977,0.00047356822,0.0013850492,0.00072225695,0.0019214482,0.0023749324,0.0011764993,0.0008043952],"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.00033797225,0.00013278775,0.00046155433,0.00018125026,0.00006977612,0.00007292508,0.00011016906,0.7390634,0.0021222562,0.08579439,0.0072232927,0.1644303],"study_design_scores_gemma":[0.000074573334,0.000030678828,0.00005346789,0.000010830595,0.000009863155,0.000030379328,0.0000156519,0.9517152,0.0004822958,0.045042574,0.0025283508,0.0000060486923],"about_ca_topic_score_codex":0.0011682631,"about_ca_topic_score_gemma":0.00154252,"teacher_disagreement_score":0.0050107073,"about_ca_system_score_codex":0.0010710882,"about_ca_system_score_gemma":0.0012138954,"threshold_uncertainty_score":0.016762435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016299482,0.00060227566,0.9732983,0.0004987225,0.00021005223,0.00011650608,0.000029302351,0.00097172,0.0079736225],"genre_scores_gemma":[0.6605899,0.00048361337,0.33359337,0.00038694975,0.00023268885,0.00013841438,0.00010578233,0.000121382334,0.0043479614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826604,0.00052170304,0.0001004981,0.00017117096,0.0006954429,0.00024505367],"domain_scores_gemma":[0.99821645,0.0006091211,0.00018330666,0.0004797533,0.00038389378,0.00012747914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229167,0.00044778598,0.0005368796,0.0004603779,0.0008440575,0.0014993558,0.0013569923,0.00072133937,0.003582656],"category_scores_gemma":[0.0038203383,0.00026378754,0.0003709762,0.00055162515,0.000730761,0.0015561716,0.0014746597,0.002377478,0.0012918249],"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.00035243388,0.00032827354,0.001002198,0.00031434142,0.00006140325,0.00039885181,0.0005971812,0.13673565,0.10926892,0.41881454,0.009649506,0.3224767],"study_design_scores_gemma":[0.00006347291,0.00015395517,0.0004305945,0.00004988298,0.00003277376,0.000311388,0.00008277725,0.8792657,0.017518165,0.063044906,0.038992763,0.000053589858],"about_ca_topic_score_codex":0.0011019827,"about_ca_topic_score_gemma":0.0011979674,"teacher_disagreement_score":0.003582656,"about_ca_system_score_codex":0.0010500626,"about_ca_system_score_gemma":0.0013796083,"threshold_uncertainty_score":0.011985183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028719487,0.00027236235,0.9691877,0.00008716413,0.00017165528,0.00012363441,0.00002095833,0.0007358954,0.0006812914],"genre_scores_gemma":[0.6389478,0.0002471071,0.35843667,0.00016361443,0.0003293005,0.00023330793,0.00006973981,0.000062130064,0.0015103265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919313,0.00017061968,0.000081803504,0.00018632306,0.00026169283,0.000106416184],"domain_scores_gemma":[0.99820507,0.0006398226,0.0002170413,0.00026058225,0.00051786413,0.00015959986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028352395,0.00071075704,0.00079650944,0.0009783035,0.0011237528,0.00094668276,0.0019521744,0.00072005123,0.0007093898],"category_scores_gemma":[0.0040526,0.00029723297,0.00043203493,0.00078847207,0.00091708713,0.0022984124,0.0009392997,0.0011056662,0.00014293157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008634544,0.0007736568,0.0034816999,0.00029913726,0.00015469124,0.0004702106,0.000531793,0.15860933,0.1508551,0.062248796,0.004278433,0.6174337],"study_design_scores_gemma":[0.00015356981,0.00037284792,0.000848284,0.000016835642,0.000090673966,0.0003312243,0.00001854149,0.9611567,0.023643503,0.0076161395,0.0056976792,0.000053901753],"about_ca_topic_score_codex":0.0016158511,"about_ca_topic_score_gemma":0.0017453241,"teacher_disagreement_score":0.0028352395,"about_ca_system_score_codex":0.0009866849,"about_ca_system_score_gemma":0.0012002776,"threshold_uncertainty_score":0.014994383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7250893,0.001107114,0.2600004,0.0006769434,0.00003868743,0.00007480489,0.0001642491,0.0005874343,0.012261048],"genre_scores_gemma":[0.9937005,0.00016595513,0.0050462657,0.000025243202,0.000016527276,0.000015316824,0.0000535919,0.000026781629,0.0009498549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.00014256091,0.00001495881,0.000081918406,0.00032347706,0.00013074579],"domain_scores_gemma":[0.99727637,0.0016556841,0.00035422997,0.000134972,0.00052472105,0.00005392769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090054446,0.00043126216,0.00041233617,0.0008346734,0.00041067664,0.0005198145,0.0004947954,0.0004470691,0.0014669012],"category_scores_gemma":[0.0061914376,0.00021395831,0.0003007981,0.00056474603,0.0006689353,0.0009201961,0.00035708412,0.00062123383,0.00012930972],"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.00015926381,0.00007330087,0.0049561043,0.00009480484,0.000060207905,0.00052342674,0.00012148016,0.8962617,0.031795133,0.045509502,0.00097461045,0.019470429],"study_design_scores_gemma":[0.0000017165365,0.000029900137,0.0008539489,0.0000022361908,0.000004633844,0.00006634071,0.000009541131,0.99558085,0.0016282607,0.0016348899,0.00018495356,0.000002768283],"about_ca_topic_score_codex":0.0059415675,"about_ca_topic_score_gemma":0.0024995094,"teacher_disagreement_score":0.0059415675,"about_ca_system_score_codex":0.0011465838,"about_ca_system_score_gemma":0.00058686046,"threshold_uncertainty_score":0.011813998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016532578,0.00031094276,0.9799714,0.00018980596,0.00006753736,0.00007363932,0.000020771438,0.0013093357,0.00152394],"genre_scores_gemma":[0.54999095,0.0003196582,0.4451308,0.00015351937,0.00011308879,0.00020174622,0.000109797824,0.00011224928,0.0038682523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872357,0.00030681715,0.000077555924,0.00019875893,0.00050941814,0.00018393682],"domain_scores_gemma":[0.9985814,0.0007062007,0.0001503697,0.00014071619,0.0003326779,0.000088592154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404619,0.000672069,0.000839926,0.00067154557,0.0013786816,0.0016824732,0.002254731,0.0015707249,0.0016574819],"category_scores_gemma":[0.0036590274,0.00036832478,0.0003729154,0.0007606612,0.0012407394,0.0016192432,0.0010558245,0.0015621879,0.0003391616],"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.0003894302,0.00019830819,0.0007725731,0.00011778911,0.000055576213,0.00014672436,0.0003119832,0.5652609,0.0144254025,0.07597858,0.0038767124,0.33846608],"study_design_scores_gemma":[0.000032263484,0.00003509447,0.00007443577,0.0000052779565,0.000007213148,0.000031838194,0.000013085262,0.9889628,0.0024535663,0.0069498657,0.001421137,0.000013481821],"about_ca_topic_score_codex":0.006060902,"about_ca_topic_score_gemma":0.003754021,"teacher_disagreement_score":0.006060902,"about_ca_system_score_codex":0.0015988088,"about_ca_system_score_gemma":0.0017546079,"threshold_uncertainty_score":0.012051225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023451593,0.00023723643,0.9742054,0.00011837609,0.000029210774,0.000019061237,0.000010714003,0.00012429725,0.0018041903],"genre_scores_gemma":[0.76454264,0.0003825805,0.2307701,0.00006405988,0.00006845307,0.00004569665,0.00006368915,0.000064102176,0.003998695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995018,0.00015097408,0.000017044882,0.000063930594,0.00019447524,0.00007178983],"domain_scores_gemma":[0.9993082,0.00032821216,0.000085697684,0.000067443325,0.00016266176,0.000047840444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664107,0.00033991225,0.00031881218,0.00030253697,0.00034213424,0.00090744253,0.00086286594,0.00039512667,0.0008477875],"category_scores_gemma":[0.0021481959,0.00021781091,0.00015862712,0.00042113246,0.00035122642,0.0010988305,0.00041638393,0.00057205046,0.00019802027],"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.00015610518,0.00008332345,0.0010926573,0.00006878189,0.00001669953,0.000081689315,0.000098003526,0.7588555,0.0109770205,0.047644135,0.0015710037,0.17935503],"study_design_scores_gemma":[0.000006989552,0.000018540148,0.00012249984,0.0000017659887,0.0000027520516,0.000021457348,0.000011327216,0.99119437,0.0018418136,0.006012521,0.00076291704,0.000003049592],"about_ca_topic_score_codex":0.0027220803,"about_ca_topic_score_gemma":0.0031815881,"teacher_disagreement_score":0.0027220803,"about_ca_system_score_codex":0.00077979395,"about_ca_system_score_gemma":0.0006781995,"threshold_uncertainty_score":0.005657792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41644356,0.0015360869,0.5784784,0.0006031991,0.00028361607,0.000050214367,0.00012725679,0.00027692725,0.0022007397],"genre_scores_gemma":[0.9866288,0.0003479649,0.0113282865,0.000069030335,0.00014364344,0.000015428506,0.000047953465,0.00003841512,0.0013805429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992015,0.00022852888,0.000038324288,0.000085160784,0.00025644916,0.0001900155],"domain_scores_gemma":[0.9950879,0.003147918,0.00035127075,0.00026981116,0.000868535,0.00027452622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031043564,0.0006124454,0.00071208726,0.0014917275,0.00080073456,0.0015022325,0.0014048651,0.000702224,0.0009879571],"category_scores_gemma":[0.011752595,0.00055349513,0.00044744572,0.0010159512,0.0011026558,0.0027334017,0.00096136116,0.0011178976,0.00011058165],"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.00071246584,0.00033952604,0.007970676,0.000117206655,0.00011508676,0.00028618608,0.0003789974,0.7290199,0.020492237,0.20321333,0.0027583947,0.034596078],"study_design_scores_gemma":[0.0000031454342,0.00001122901,0.0002651471,0.0000016058997,0.0000059033114,0.000013329085,0.000013593,0.991623,0.00037465035,0.007618416,0.000063317195,0.000006555373],"about_ca_topic_score_codex":0.004800085,"about_ca_topic_score_gemma":0.0037224088,"teacher_disagreement_score":0.004800085,"about_ca_system_score_codex":0.0016202581,"about_ca_system_score_gemma":0.0012481106,"threshold_uncertainty_score":0.016417623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01333833,0.011261968,0.96192914,0.0011909617,0.0019640415,0.00046034926,0.00009165276,0.0011614675,0.008602154],"genre_scores_gemma":[0.5092765,0.009148954,0.45864147,0.0011593768,0.002301137,0.0010535248,0.00028379352,0.00015227417,0.017982917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861443,0.00021445195,0.000114640825,0.0001897073,0.0006940343,0.00017270443],"domain_scores_gemma":[0.9972445,0.0009444835,0.0002355369,0.00057004666,0.0008776005,0.00012790639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063794,0.0008409366,0.000577669,0.0011208554,0.0010886095,0.0020863574,0.0036409632,0.0011632213,0.0048416196],"category_scores_gemma":[0.0042414605,0.00046917124,0.00043586775,0.0011437219,0.0009361173,0.003767881,0.0010289444,0.0023311968,0.00072112284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045547643,0.00052858616,0.0011784357,0.00084964576,0.00023142506,0.00054881035,0.0004978149,0.039391927,0.059360903,0.42348093,0.015703877,0.4577721],"study_design_scores_gemma":[0.0005496086,0.00065805955,0.0009314978,0.00017806666,0.0003260963,0.0012372305,0.00013630129,0.67448056,0.03261833,0.12885831,0.15980497,0.00022105261],"about_ca_topic_score_codex":0.0009587589,"about_ca_topic_score_gemma":0.0011079726,"teacher_disagreement_score":0.0048416196,"about_ca_system_score_codex":0.0014558093,"about_ca_system_score_gemma":0.000955472,"threshold_uncertainty_score":0.016196847},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722878,0.00037958374,0.21853118,0.00019653689,0.000111818794,0.00011168897,0.00012990208,0.0027898664,0.005461574],"genre_scores_gemma":[0.96771115,0.00013965796,0.031095378,0.000035232755,0.000023722783,0.000016489214,0.00009389633,0.000027041058,0.00085752475],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971634,0.00007579669,0.00001990513,0.0000205667,0.00012513936,0.000042217518],"domain_scores_gemma":[0.99944216,0.00013385214,0.000086751905,0.00009760171,0.00020429859,0.0000352847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132217,0.00025793165,0.00018370205,0.00040383422,0.00021611936,0.00039742215,0.00052116835,0.00029136258,0.00088960136],"category_scores_gemma":[0.0014361029,0.0000992815,0.00017312402,0.00015289613,0.00018172868,0.00042158033,0.0002800945,0.00031466768,0.00022925781],"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.0017738423,0.0004093782,0.0047810595,0.00034656114,0.00008920132,0.0012717869,0.00028059492,0.0511525,0.72073877,0.009866735,0.002233266,0.2070563],"study_design_scores_gemma":[0.0001386179,0.0018682169,0.004688471,0.000024116705,0.00009619186,0.0014319955,0.00014871602,0.63145214,0.35020128,0.0034008403,0.0064845975,0.000064886124],"about_ca_topic_score_codex":0.0008774687,"about_ca_topic_score_gemma":0.0006518392,"teacher_disagreement_score":0.00088960136,"about_ca_system_score_codex":0.00025009853,"about_ca_system_score_gemma":0.0002239677,"threshold_uncertainty_score":0.0032430887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06751018,0.00024026884,0.9190579,0.0012597753,0.00019068124,0.00029761545,0.00021324352,0.0012546292,0.009975787],"genre_scores_gemma":[0.7765334,0.00032947614,0.21918342,0.00019393448,0.000049306105,0.00051081536,0.00031624446,0.0001016858,0.002781606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905676,0.00043660763,0.000040547566,0.000071272676,0.00030244255,0.00009247062],"domain_scores_gemma":[0.99715805,0.0020568538,0.0000805292,0.00018290164,0.0003663411,0.0001553522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019311245,0.0004996508,0.00062927656,0.0002928807,0.00081611186,0.0013441163,0.0014171778,0.0013526994,0.0035180387],"category_scores_gemma":[0.008118287,0.00043488495,0.0006588425,0.00032089642,0.00092021533,0.001556367,0.0009119396,0.0012654817,0.00043039152],"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.00010467781,0.00006767066,0.000652679,0.000039345665,0.000022249285,0.0000675758,0.000045861594,0.9531671,0.0020260147,0.0346742,0.00045355374,0.008679072],"study_design_scores_gemma":[0.000017649194,0.000016419417,0.000024132702,0.0000036767299,0.0000030931185,0.0000053165563,0.0000044836675,0.99482745,0.00044634647,0.0033959036,0.0012514545,0.0000041070743],"about_ca_topic_score_codex":0.006735087,"about_ca_topic_score_gemma":0.0026330887,"teacher_disagreement_score":0.006735087,"about_ca_system_score_codex":0.0009919915,"about_ca_system_score_gemma":0.0021977548,"threshold_uncertainty_score":0.013391793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036445376,0.0013653853,0.963247,0.0017412613,0.0011081792,0.00017983708,0.00006364487,0.000887776,0.027762476],"genre_scores_gemma":[0.15074667,0.006372322,0.76433235,0.0023243043,0.0025998165,0.0011904081,0.00029673963,0.0004680544,0.07166931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981464,0.00035750546,0.00013420207,0.0002958885,0.00091178325,0.00015421365],"domain_scores_gemma":[0.9987783,0.0002502864,0.00010201998,0.0003924539,0.00031042716,0.00016650342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392963,0.0006980431,0.0006093563,0.000838565,0.0015993173,0.0036118994,0.0029138557,0.001995699,0.0061314665],"category_scores_gemma":[0.0019721931,0.00053788716,0.0009100955,0.0010436097,0.0018300794,0.008346136,0.0036188613,0.0039655007,0.0028319976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009794755,0.000098163844,0.0003377259,0.00034454136,0.000036292717,0.00072054786,0.0006819564,0.004687586,0.019394806,0.8157255,0.021176126,0.13669892],"study_design_scores_gemma":[0.000087399894,0.00037657557,0.00039123176,0.00018421111,0.000080833845,0.0037479957,0.00030574968,0.0735609,0.012842212,0.32214713,0.5861388,0.00013694838],"about_ca_topic_score_codex":0.0007236914,"about_ca_topic_score_gemma":0.0006560598,"teacher_disagreement_score":0.0061314665,"about_ca_system_score_codex":0.0007069508,"about_ca_system_score_gemma":0.0013535648,"threshold_uncertainty_score":0.020511806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008988143,0.00016209451,0.9886148,0.00008720782,0.000022970364,0.000024841907,0.0000050954277,0.00008168615,0.0020132773],"genre_scores_gemma":[0.90953,0.00038702541,0.08677467,0.00007279188,0.000065334774,0.00018330863,0.00002504575,0.000027564647,0.002934211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954283,0.00010724959,0.000016759019,0.000075672535,0.00020761175,0.000049901046],"domain_scores_gemma":[0.99922884,0.000471557,0.00008220904,0.00002946062,0.00016408483,0.000023839788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012717169,0.00055682263,0.0005403658,0.00040083838,0.0004781997,0.0007527916,0.0010197307,0.00084263954,0.0012216257],"category_scores_gemma":[0.0031661687,0.0003638725,0.0003149552,0.0003150585,0.00083448295,0.00074690825,0.00067144196,0.0008912656,0.00013283316],"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.00004359294,0.000027298762,0.0003240802,0.00004459238,0.0000134457205,0.00004433389,0.00004602115,0.9447252,0.0019303153,0.02148151,0.00030324698,0.031016413],"study_design_scores_gemma":[0.0000019624852,0.000009973395,0.000016775342,0.000001259291,0.000001511622,0.0000031431234,0.0000013337474,0.9987966,0.00015363772,0.000935257,0.000077681216,8.958875e-7],"about_ca_topic_score_codex":0.003510254,"about_ca_topic_score_gemma":0.0017698616,"teacher_disagreement_score":0.003510254,"about_ca_system_score_codex":0.0010147956,"about_ca_system_score_gemma":0.0010347136,"threshold_uncertainty_score":0.007362902},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5648547,0.00043255882,0.42734778,0.00020574532,0.000058550413,0.00008892666,0.000063653955,0.0013994646,0.00554867],"genre_scores_gemma":[0.9251538,0.0001512136,0.07310856,0.000054864107,0.000030483374,0.00003345952,0.00007234014,0.000032369702,0.0013630012],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998216,0.0000488358,0.000011235351,0.000024217517,0.00005950794,0.00003467742],"domain_scores_gemma":[0.999716,0.000075919575,0.000045820983,0.00005569273,0.00007889397,0.000027678756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042676242,0.000335373,0.00019832182,0.00044349485,0.00034776216,0.0003679,0.00065497996,0.00035657865,0.0005362818],"category_scores_gemma":[0.0008988317,0.00014866586,0.00021202845,0.00020994153,0.00022939556,0.0007672398,0.0004977149,0.00039104742,0.00012660585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010231073,0.00033926943,0.010782022,0.00015585741,0.00012618233,0.0011387857,0.00063717546,0.22995068,0.39850563,0.030225199,0.0022745684,0.32484153],"study_design_scores_gemma":[0.000026102116,0.00027577468,0.0015355499,0.000012236313,0.00005064208,0.00017459583,0.00006205229,0.9444006,0.04377941,0.006333367,0.0033297562,0.000019966841],"about_ca_topic_score_codex":0.0016244078,"about_ca_topic_score_gemma":0.0016765705,"teacher_disagreement_score":0.0016244078,"about_ca_system_score_codex":0.00045769295,"about_ca_system_score_gemma":0.00024882273,"threshold_uncertainty_score":0.0033207536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83666396,0.013830532,0.097257845,0.0036510723,0.000659318,0.000093761606,0.00021543373,0.0005310658,0.047097083],"genre_scores_gemma":[0.99618596,0.0008609118,0.0020070858,0.00007282991,0.00012428855,0.000015776459,0.00001937906,0.000019956879,0.00069379533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985863,0.00045433518,0.000053588064,0.00013762862,0.00048162337,0.0002865299],"domain_scores_gemma":[0.9921354,0.004935381,0.00083405216,0.0007909418,0.00095208606,0.0003521797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021170154,0.00043275667,0.00046394582,0.0012715292,0.00066033134,0.0014920379,0.0006825071,0.0006719333,0.0012211488],"category_scores_gemma":[0.014886316,0.0002673556,0.00033980355,0.0006188101,0.0020490931,0.0025669315,0.0012505042,0.0009282823,0.00017337826],"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.001747938,0.00014077078,0.01640395,0.0003299092,0.00018948985,0.001080536,0.0010548881,0.55387014,0.02173341,0.3240664,0.004437659,0.074944966],"study_design_scores_gemma":[0.00005051088,0.00029061185,0.006742599,0.000090549656,0.00010502021,0.00077330595,0.00051399064,0.8917815,0.0068567167,0.08810895,0.0046298243,0.000056420962],"about_ca_topic_score_codex":0.0017329637,"about_ca_topic_score_gemma":0.0011663052,"teacher_disagreement_score":0.0021170154,"about_ca_system_score_codex":0.0012758255,"about_ca_system_score_gemma":0.00059962156,"threshold_uncertainty_score":0.011196017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09415419,0.0012122183,0.89101434,0.00035842418,0.0008422331,0.0003437422,0.000097492484,0.005549771,0.006427495],"genre_scores_gemma":[0.8229861,0.00045521586,0.16810487,0.0004497992,0.00044171893,0.00020543502,0.00016492221,0.00019345457,0.006998453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.0002530436,0.0001048443,0.0001813035,0.00041695134,0.000113098926],"domain_scores_gemma":[0.9977507,0.00047937263,0.0002588844,0.0005910588,0.0006453432,0.00027457156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014999155,0.00045708995,0.00053605053,0.00070006336,0.00043595917,0.0010021309,0.0020922648,0.0006309689,0.001454959],"category_scores_gemma":[0.0023993452,0.00031445475,0.00030231124,0.0003282073,0.00052039477,0.0012601112,0.0012080934,0.0015077256,0.0006425734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016617364,0.0012128173,0.0061122393,0.0004809414,0.00018937046,0.0008318989,0.0004736368,0.043621574,0.37779886,0.04926188,0.0096244905,0.50873053],"study_design_scores_gemma":[0.0003106271,0.001287532,0.0030248163,0.000081489925,0.00028349482,0.0017820548,0.000056470646,0.8008086,0.13453148,0.008467101,0.049103677,0.0002626997],"about_ca_topic_score_codex":0.00033474996,"about_ca_topic_score_gemma":0.00028004352,"teacher_disagreement_score":0.0020922648,"about_ca_system_score_codex":0.00031667895,"about_ca_system_score_gemma":0.0005029373,"threshold_uncertainty_score":0.007932425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0663194,0.0067292536,0.9124082,0.0018002433,0.00084660953,0.00014306729,0.00007857126,0.00034226643,0.011332367],"genre_scores_gemma":[0.9475696,0.0017507356,0.046479996,0.00022925877,0.0007066114,0.00015454541,0.00003141533,0.00007896999,0.0029990058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995823,0.0016717388,0.00015703739,0.00041839952,0.0014985877,0.0004312201],"domain_scores_gemma":[0.9907901,0.006374397,0.0006960439,0.0006665273,0.0012023315,0.00027047234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006686599,0.0005656133,0.0008361389,0.0010061244,0.0014169357,0.0020881302,0.0014864171,0.0011737065,0.0009230513],"category_scores_gemma":[0.020575838,0.00044900842,0.00044819212,0.0010237776,0.0024432973,0.0037005714,0.0012572855,0.0013903494,0.00014702661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035165699,0.00012343327,0.0029861452,0.00020354587,0.0001009312,0.000481427,0.0006346457,0.43412244,0.004219097,0.4761819,0.0034160155,0.0771787],"study_design_scores_gemma":[0.000060539078,0.0000766645,0.0010784516,0.0000409458,0.000050261035,0.00013138354,0.00007844926,0.78653634,0.0022755987,0.20322694,0.006395558,0.000048954185],"about_ca_topic_score_codex":0.006111826,"about_ca_topic_score_gemma":0.0026648892,"teacher_disagreement_score":0.006686599,"about_ca_system_score_codex":0.0028598744,"about_ca_system_score_gemma":0.0023388192,"threshold_uncertainty_score":0.03536254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22055085,0.00077696494,0.7711889,0.00039216786,0.00019825391,0.00016819254,0.00012235496,0.0030665477,0.0035357429],"genre_scores_gemma":[0.89624894,0.00021333981,0.101339735,0.00009539499,0.00009800653,0.0000551968,0.00012361736,0.000087016066,0.0017387089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983424,0.00027401457,0.000118908894,0.00024496843,0.0007875124,0.00023226612],"domain_scores_gemma":[0.99689424,0.00058073254,0.00052039797,0.0011710775,0.00067310536,0.00016041398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013600672,0.0010127217,0.0009005878,0.00089558156,0.00076188135,0.0011954381,0.002135387,0.00081980904,0.0011951062],"category_scores_gemma":[0.004615667,0.00051502505,0.000462418,0.0008353453,0.00080462283,0.0015069613,0.0019280114,0.0010761967,0.00047737153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026543858,0.00039595462,0.00818835,0.0005553398,0.0002569834,0.000985358,0.0007400651,0.418345,0.10324373,0.024575232,0.0078740055,0.43218562],"study_design_scores_gemma":[0.00030225265,0.0007499096,0.0020771648,0.000049662405,0.00009715946,0.00075284607,0.00013572862,0.93724555,0.03270172,0.019156117,0.0066596107,0.000072210634],"about_ca_topic_score_codex":0.0022209773,"about_ca_topic_score_gemma":0.0029153316,"teacher_disagreement_score":0.0022209773,"about_ca_system_score_codex":0.00058023824,"about_ca_system_score_gemma":0.0011933031,"threshold_uncertainty_score":0.00719285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3949587,0.0027695368,0.57937974,0.0005242987,0.00023434404,0.00038701025,0.00028042428,0.0043631494,0.017102813],"genre_scores_gemma":[0.91370505,0.00066947826,0.0812076,0.000118762946,0.000127091,0.00007402676,0.00019847233,0.00034721076,0.0035522624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999597,0.000101586986,0.00003202792,0.00006256271,0.00013256657,0.00007426913],"domain_scores_gemma":[0.9976144,0.0013232775,0.00013241725,0.00024775323,0.00047766577,0.0002044632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009754253,0.00073470693,0.0009319445,0.0012005103,0.00044918718,0.0014872716,0.00068287406,0.00069707015,0.0019549895],"category_scores_gemma":[0.0052785343,0.00043057205,0.00026988078,0.00063232577,0.00019446683,0.0012185583,0.00044268204,0.0009240456,0.0010696154],"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.002118932,0.00030799612,0.020592455,0.0002619052,0.00010420383,0.00073279114,0.00045979428,0.020534722,0.3552939,0.0062140054,0.0077060116,0.5856734],"study_design_scores_gemma":[0.00016357293,0.0006061424,0.03120684,0.00014854122,0.00026324688,0.004202804,0.00061226235,0.64513993,0.28057566,0.019477645,0.017351603,0.00025174723],"about_ca_topic_score_codex":0.00044764107,"about_ca_topic_score_gemma":0.0007534483,"teacher_disagreement_score":0.0019549895,"about_ca_system_score_codex":0.0003414021,"about_ca_system_score_gemma":0.00022696328,"threshold_uncertainty_score":0.0065401196},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014089673,0.005542176,0.86495733,0.006188891,0.001143554,0.00026947795,0.00017139142,0.003142509,0.104494974],"genre_scores_gemma":[0.35624102,0.011264513,0.58714044,0.0018724909,0.0012041266,0.0008623074,0.0006669403,0.0006254358,0.040122643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797446,0.00046895625,0.00014307814,0.00028714933,0.0008324852,0.00029374953],"domain_scores_gemma":[0.9983254,0.00043705554,0.00012693836,0.00056585256,0.00038098093,0.00016376271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002537827,0.00093276304,0.00046285367,0.0008141164,0.0015738604,0.0045372145,0.0017835449,0.0018396248,0.005198203],"category_scores_gemma":[0.00405321,0.00070474844,0.00073045323,0.000783649,0.0020278369,0.005620223,0.0047650584,0.0036275906,0.0022380766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036704423,0.00004170508,0.00023684069,0.0001378098,0.000017328239,0.000121120494,0.00035110058,0.0073611536,0.0047446564,0.9353732,0.0060778414,0.045500606],"study_design_scores_gemma":[0.00005562727,0.0000763237,0.00024455303,0.00017939432,0.000047826597,0.0002143836,0.00018198631,0.08133461,0.0062764385,0.5833543,0.32798573,0.00004867065],"about_ca_topic_score_codex":0.001524379,"about_ca_topic_score_gemma":0.001590851,"teacher_disagreement_score":0.005198203,"about_ca_system_score_codex":0.0016799257,"about_ca_system_score_gemma":0.0017843372,"threshold_uncertainty_score":0.017389774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14399168,0.00029030262,0.8494566,0.00092894275,0.0000670906,0.000096628515,0.00005039337,0.0003466635,0.0047716764],"genre_scores_gemma":[0.8663887,0.00033584784,0.13109083,0.00020312528,0.000085189226,0.00014555357,0.00008351881,0.00008595085,0.0015813599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970272,0.0013660047,0.0001289046,0.0004985202,0.00059365993,0.00038562497],"domain_scores_gemma":[0.98939544,0.007373149,0.0013413973,0.0011859961,0.00047543494,0.00022864978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043386314,0.00059765315,0.0009396296,0.0005457035,0.0010392977,0.0018802366,0.0021057012,0.0017735265,0.0010824301],"category_scores_gemma":[0.016880583,0.0006189921,0.0008670998,0.0009387477,0.0032238953,0.0046336884,0.002376657,0.0026679642,0.00015500262],"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.00027035293,0.0001558364,0.002698258,0.00014478789,0.00007457223,0.00057020964,0.0005579003,0.6726153,0.005891871,0.2930482,0.0015746141,0.022398157],"study_design_scores_gemma":[0.000058778947,0.00010422252,0.00022456035,0.000013350575,0.000031724776,0.0001618398,0.00012222928,0.8563846,0.0028320933,0.13888203,0.0011666877,0.000017939567],"about_ca_topic_score_codex":0.0014621915,"about_ca_topic_score_gemma":0.0009239264,"teacher_disagreement_score":0.0043386314,"about_ca_system_score_codex":0.0012719096,"about_ca_system_score_gemma":0.0009972308,"threshold_uncertainty_score":0.022945166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041798487,0.00095787353,0.9375841,0.0016481723,0.0003735187,0.00035735036,0.00019518408,0.0015166613,0.015568737],"genre_scores_gemma":[0.53170425,0.0009549473,0.45201033,0.0009610539,0.00045145937,0.0005257507,0.00029477055,0.0005466142,0.012550802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638665,0.0008788985,0.0002688079,0.00047405576,0.0014873821,0.00050422637],"domain_scores_gemma":[0.9949262,0.0011923177,0.0008693973,0.001657244,0.00091562397,0.00043916618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004982714,0.0007639163,0.0008996959,0.0006901957,0.0011610321,0.0026099973,0.003508728,0.0010228739,0.00208114],"category_scores_gemma":[0.009754243,0.00051591144,0.0006025628,0.0011354543,0.0028000881,0.004875679,0.005335762,0.002956587,0.00067838375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003570065,0.000116651994,0.001368333,0.00018111872,0.000025367572,0.0003320784,0.0004879258,0.060341943,0.010631937,0.79231167,0.006866858,0.12697907],"study_design_scores_gemma":[0.00017246918,0.00030146158,0.00054950075,0.000102358994,0.000053553493,0.00079473725,0.00020131574,0.50423276,0.0151298195,0.38206673,0.0962818,0.00011356515],"about_ca_topic_score_codex":0.0029129789,"about_ca_topic_score_gemma":0.0022810043,"teacher_disagreement_score":0.004982714,"about_ca_system_score_codex":0.0021299985,"about_ca_system_score_gemma":0.0036266719,"threshold_uncertainty_score":0.026351392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008593988,0.00035691867,0.9877698,0.00012701744,0.0001359946,0.00004079184,0.000028510447,0.0008778905,0.0020691562],"genre_scores_gemma":[0.841969,0.00027082913,0.15354216,0.00018345377,0.00021811368,0.00019344343,0.00008584703,0.00008117702,0.0034559767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00013219415,0.000029660223,0.00019137474,0.00030694174,0.00005536014],"domain_scores_gemma":[0.9995691,0.00011143406,0.0000643184,0.000070553906,0.00015880082,0.000025675237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075306353,0.0005294916,0.00056271796,0.0003293495,0.0003232161,0.00077796105,0.0012748969,0.00071397156,0.0018381455],"category_scores_gemma":[0.0012702389,0.00018319322,0.0003696985,0.00026562813,0.00062547304,0.00055740436,0.00058155734,0.0009844182,0.00048456702],"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.00021372663,0.00012240022,0.00031659583,0.00015248389,0.00009354316,0.00018374571,0.00006267829,0.6986738,0.061163753,0.06454036,0.0036028335,0.17087412],"study_design_scores_gemma":[0.000045264325,0.000071479124,0.000051330935,0.0000042558754,0.000012476641,0.00003170591,0.0000023208606,0.9872177,0.004663288,0.0057348427,0.0021578686,0.000007540745],"about_ca_topic_score_codex":0.00082752743,"about_ca_topic_score_gemma":0.0005793748,"teacher_disagreement_score":0.0018381455,"about_ca_system_score_codex":0.0005850959,"about_ca_system_score_gemma":0.0006223269,"threshold_uncertainty_score":0.0061492324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97924054,0.0008359572,0.015874296,0.00028376363,0.000090107285,0.000069653826,0.00041620474,0.0012718034,0.0019175914],"genre_scores_gemma":[0.9947476,0.00010242404,0.004152021,0.000055853616,0.000018358434,0.0000108110535,0.00037234928,0.00005173197,0.0004888531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99328655,0.0011239077,0.0005886133,0.0009751196,0.0031673429,0.0008584499],"domain_scores_gemma":[0.9039212,0.06423763,0.008468124,0.011120232,0.010827064,0.0014257997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065432843,0.00089511235,0.0013380725,0.0026627027,0.00075435534,0.0014463499,0.0015036121,0.0015724817,0.0007199689],"category_scores_gemma":[0.06748041,0.00038365333,0.00045124744,0.0014800436,0.0010669677,0.0024058712,0.0014220427,0.001470782,0.00028554216],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006260093,0.0007142912,0.29926074,0.00048471795,0.0009182362,0.0006006889,0.00067380554,0.48331782,0.029746357,0.003527685,0.0040754667,0.17042004],"study_design_scores_gemma":[0.00008918313,0.0009485952,0.06994321,0.000038843435,0.00014622316,0.0006069122,0.0002738768,0.89511204,0.030449567,0.0014163362,0.00084965664,0.00012549186],"about_ca_topic_score_codex":0.006942615,"about_ca_topic_score_gemma":0.008621998,"teacher_disagreement_score":0.006942615,"about_ca_system_score_codex":0.0012991064,"about_ca_system_score_gemma":0.0011453343,"threshold_uncertainty_score":0.03460455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019988585,0.0007494161,0.97314733,0.0002864549,0.00011008856,0.000108036285,0.000031058567,0.00080805126,0.0047709644],"genre_scores_gemma":[0.8071736,0.00047193113,0.18781357,0.0002377665,0.00014093205,0.00013766435,0.00009416954,0.000070668626,0.0038596333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992781,0.0002097846,0.000034693625,0.000097182805,0.00029666614,0.0000836972],"domain_scores_gemma":[0.9995314,0.00017229732,0.00006585174,0.000074853146,0.00010592511,0.00004968361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680279,0.00059788616,0.0005024799,0.0008881421,0.0006528772,0.0012343392,0.0014846263,0.00079483684,0.0011848361],"category_scores_gemma":[0.0019865495,0.0001696094,0.00028698976,0.0006281261,0.001060751,0.0011916227,0.0006079256,0.0007120954,0.00026101133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022336114,0.00017918275,0.0013062821,0.00012202095,0.00008215007,0.00021445837,0.00020103279,0.38800046,0.027980931,0.13549452,0.005907964,0.44028756],"study_design_scores_gemma":[0.00003377799,0.000089007415,0.00024419764,0.000012531215,0.000026571677,0.00016691374,0.000026050877,0.9618621,0.0067472123,0.025117915,0.0056473436,0.00002629356],"about_ca_topic_score_codex":0.0026221392,"about_ca_topic_score_gemma":0.0022898777,"teacher_disagreement_score":0.0026221392,"about_ca_system_score_codex":0.00087583106,"about_ca_system_score_gemma":0.0008109948,"threshold_uncertainty_score":0.00635463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9646641,0.00029008763,0.02934913,0.00015976618,0.000030407431,0.000074754455,0.00041770688,0.00026515345,0.0047489577],"genre_scores_gemma":[0.99515694,0.000090040834,0.0040663113,0.00002348235,0.000004697621,0.00003427703,0.00019500042,0.000013012176,0.00041611714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991677,0.00039761708,0.000037884354,0.00008083345,0.00017036626,0.00014567905],"domain_scores_gemma":[0.9945229,0.004043717,0.0003619222,0.00024283398,0.0006274049,0.00020111169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666751,0.0005460435,0.0004017655,0.0005849297,0.0003620345,0.00052950194,0.00078926637,0.00078421703,0.00096066354],"category_scores_gemma":[0.0062337513,0.00026525432,0.00039870688,0.0008039821,0.00048605315,0.0007136158,0.00034256355,0.0007896864,0.00012958127],"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.00012811061,0.00009694322,0.006532847,0.000029236891,0.00003539095,0.00011102138,0.00005910398,0.98664653,0.0015012964,0.0013831652,0.00029158883,0.003184724],"study_design_scores_gemma":[0.000012743681,0.00010830114,0.001000837,0.000006095551,0.000013938065,0.000055434895,0.000028430317,0.9968335,0.0012367947,0.00039475938,0.00030226723,0.000006882913],"about_ca_topic_score_codex":0.006811669,"about_ca_topic_score_gemma":0.00514961,"teacher_disagreement_score":0.006811669,"about_ca_system_score_codex":0.0013755994,"about_ca_system_score_gemma":0.0005691905,"threshold_uncertainty_score":0.013544083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5254178,0.0017227742,0.4655071,0.0012158684,0.000091718146,0.00009577948,0.00006288966,0.00046973594,0.005416402],"genre_scores_gemma":[0.991113,0.00029701402,0.00806564,0.000042068055,0.000060004746,0.00003800199,0.000020118729,0.000033327033,0.0003307956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716836,0.0012425882,0.00007094974,0.00017835284,0.0010571708,0.0002825753],"domain_scores_gemma":[0.98270744,0.012473138,0.0015384066,0.0011996008,0.0017444071,0.00033696857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045489613,0.00054779166,0.0006531566,0.0008582592,0.00067720644,0.0009761122,0.0011343381,0.00087901426,0.0007827474],"category_scores_gemma":[0.017179783,0.000356226,0.0004286469,0.0005772037,0.0013337249,0.0037755338,0.0012939478,0.001344112,0.000121795274],"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.00046444937,0.00017254816,0.004636579,0.00016654245,0.00013141854,0.0004245266,0.00050286786,0.8546449,0.023208413,0.07683724,0.0012407898,0.037569683],"study_design_scores_gemma":[0.000010481419,0.000069272704,0.00034368972,0.000008462878,0.000018547877,0.000073014875,0.00006076709,0.9880554,0.0017053594,0.009440028,0.00020555539,0.000009401955],"about_ca_topic_score_codex":0.0010023931,"about_ca_topic_score_gemma":0.0005146384,"teacher_disagreement_score":0.0045489613,"about_ca_system_score_codex":0.00096966047,"about_ca_system_score_gemma":0.00068672263,"threshold_uncertainty_score":0.024057508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89394414,0.00050212065,0.10333637,0.0002578442,0.000031475873,0.00006123776,0.00012426176,0.00026321725,0.001479384],"genre_scores_gemma":[0.9958341,0.000060396287,0.003956929,0.000015378444,0.000005579469,0.0000113686965,0.000023553861,0.000009476588,0.000083253144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970074,0.0014167863,0.00013542044,0.00036003662,0.00065923267,0.00042110693],"domain_scores_gemma":[0.9695709,0.023745187,0.0036830073,0.0013727065,0.0011498042,0.00047845565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003796832,0.0005474417,0.000801141,0.0008463302,0.00076908665,0.0014481904,0.00070083904,0.00057138514,0.00084652094],"category_scores_gemma":[0.029058546,0.0003882513,0.0002745264,0.00090479705,0.001618582,0.0036966284,0.0013654649,0.0011779958,0.00008399459],"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.0021957983,0.00012401884,0.018698849,0.000115118935,0.0000472158,0.00024178742,0.0002440403,0.9109951,0.028332893,0.0071916757,0.0002338559,0.031579606],"study_design_scores_gemma":[0.000019177578,0.0001875497,0.0030335223,0.000019820884,0.000020847303,0.000107203115,0.0001282734,0.9733349,0.021035211,0.0018213113,0.00026113127,0.000031068936],"about_ca_topic_score_codex":0.002741728,"about_ca_topic_score_gemma":0.0010945195,"teacher_disagreement_score":0.003796832,"about_ca_system_score_codex":0.001814165,"about_ca_system_score_gemma":0.00068390963,"threshold_uncertainty_score":0.020079792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5213038,0.00062598696,0.45290834,0.0013038572,0.00015369282,0.00007641001,0.00011175504,0.0008046379,0.022711504],"genre_scores_gemma":[0.9916875,0.00018148357,0.006484356,0.000053972046,0.000030426983,0.000026339194,0.000026496453,0.000024151032,0.0014853465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997516,0.000056301,0.000010090711,0.00005237521,0.00009732878,0.00003219427],"domain_scores_gemma":[0.99931574,0.00026046176,0.00013652434,0.00006978848,0.0001535658,0.00006388834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031537347,0.00025505238,0.000259266,0.0003951764,0.00040545085,0.0007342047,0.0005161254,0.00052182924,0.0010702421],"category_scores_gemma":[0.0020149748,0.00022901423,0.00015894494,0.0002261778,0.0007544075,0.0011414052,0.00058090175,0.00048580553,0.00018697536],"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.00029431292,0.00013423023,0.0065542487,0.00009294062,0.00006581947,0.00081947056,0.0006904419,0.59823567,0.09997761,0.2372109,0.0032857521,0.05263863],"study_design_scores_gemma":[0.000011488936,0.000035349287,0.0010164022,0.000004456514,0.000007192871,0.00010461898,0.000062325475,0.97106564,0.0025005839,0.02357572,0.0016005827,0.000015631884],"about_ca_topic_score_codex":0.0011534458,"about_ca_topic_score_gemma":0.0005530777,"teacher_disagreement_score":0.0011534458,"about_ca_system_score_codex":0.00057531975,"about_ca_system_score_gemma":0.00027577218,"threshold_uncertainty_score":0.0041742325},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83273816,0.0008609871,0.14269115,0.0006921351,0.00019754049,0.0001811522,0.00024570295,0.012448758,0.009944429],"genre_scores_gemma":[0.97275835,0.00021497258,0.02510535,0.00004946973,0.000042275344,0.000054200213,0.00032955437,0.00022832226,0.0012174097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988696,0.00023401517,0.00006813614,0.00014292814,0.0004048536,0.00028040927],"domain_scores_gemma":[0.9957035,0.0015068648,0.00021383764,0.0012773231,0.0010384495,0.00025995547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970218,0.0009110686,0.00067063747,0.0008749615,0.000878283,0.0014248474,0.0013583694,0.0007749061,0.0025402266],"category_scores_gemma":[0.007892679,0.00034736271,0.00027753226,0.0012177791,0.0007263934,0.0029284633,0.0014201108,0.0011312766,0.0008728831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049172253,0.0014812391,0.026376855,0.00051604386,0.00026486636,0.0015236832,0.001081937,0.3104166,0.16664165,0.0084717795,0.02110512,0.45720294],"study_design_scores_gemma":[0.00036237724,0.0009684428,0.0067563276,0.000038648926,0.000087756365,0.00061046897,0.0002899008,0.8614262,0.11538295,0.006670553,0.007315054,0.000091300935],"about_ca_topic_score_codex":0.0027290247,"about_ca_topic_score_gemma":0.0017341726,"teacher_disagreement_score":0.0027290247,"about_ca_system_score_codex":0.00061928097,"about_ca_system_score_gemma":0.00063782156,"threshold_uncertainty_score":0.008497894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045415245,0.049195163,0.68419284,0.010620694,0.0030239027,0.0019398071,0.0027166684,0.0039719823,0.1989237],"genre_scores_gemma":[0.3104053,0.070819154,0.53760076,0.0035654248,0.003719771,0.003334176,0.0064469767,0.0007583109,0.063350186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966191,0.000445471,0.00037387718,0.00028788444,0.001858882,0.00041480828],"domain_scores_gemma":[0.9964663,0.0008346261,0.0005562731,0.000500847,0.0014021628,0.00023972672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018010408,0.0011979498,0.0006294838,0.0050647845,0.0019158333,0.0035165811,0.0024462314,0.002369094,0.003508998],"category_scores_gemma":[0.0054634474,0.00047326324,0.00088014326,0.0047082095,0.00091243815,0.003986028,0.0015250957,0.0026606356,0.0024310942],"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.00014378545,0.00022306763,0.0020269277,0.0008548733,0.000040216997,0.00067497307,0.00073987275,0.007950567,0.0055970126,0.5976878,0.052293103,0.3317679],"study_design_scores_gemma":[0.00006412074,0.00028277212,0.0027146589,0.00083672337,0.0000765674,0.0043188566,0.00054004585,0.05713415,0.0036204925,0.29420596,0.6360951,0.00011053721],"about_ca_topic_score_codex":0.0013713783,"about_ca_topic_score_gemma":0.0007179692,"teacher_disagreement_score":0.0050647845,"about_ca_system_score_codex":0.0009370923,"about_ca_system_score_gemma":0.0012460314,"threshold_uncertainty_score":0.011738718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11544456,0.00045644038,0.88245606,0.0001067905,0.00004293194,0.000052289866,0.000045671575,0.0004948616,0.0009004106],"genre_scores_gemma":[0.8061773,0.00027199177,0.19204724,0.00003703486,0.000024581528,0.00007670238,0.00009442917,0.00006568804,0.001205085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961495,0.00011079119,0.000017177495,0.00006381909,0.00012339064,0.0000698662],"domain_scores_gemma":[0.9980952,0.0014587519,0.00016204297,0.000057668432,0.000148604,0.00007765703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015123276,0.00062549155,0.0007011213,0.00083230465,0.00048467924,0.0012631274,0.0011317434,0.00057717314,0.00068973214],"category_scores_gemma":[0.0037560954,0.00043497246,0.00022886689,0.000698233,0.00072117365,0.0013536401,0.00041721773,0.00057287875,0.000075165444],"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.00015114644,0.00003790879,0.00061512506,0.00002743477,0.000012364405,0.000030400874,0.000033754357,0.9607913,0.0019249653,0.009627513,0.00028716467,0.026460938],"study_design_scores_gemma":[0.000007978883,0.0000139277145,0.000056114022,0.0000015403251,0.0000028041575,0.0000045555316,0.0000027289473,0.99733835,0.00060800463,0.0018872388,0.00007459075,0.0000021736612],"about_ca_topic_score_codex":0.010012223,"about_ca_topic_score_gemma":0.0069023836,"teacher_disagreement_score":0.010012223,"about_ca_system_score_codex":0.0022028845,"about_ca_system_score_gemma":0.0015707914,"threshold_uncertainty_score":0.019907892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064299114,0.00052951794,0.9181457,0.00047232542,0.000059305657,0.00012998281,0.00017623174,0.00029727866,0.015890501],"genre_scores_gemma":[0.9261211,0.0006413165,0.06619765,0.000068011854,0.00003161159,0.0004082607,0.00017464932,0.00007379301,0.0062836083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00016056054,0.000018896448,0.00009671462,0.0001723084,0.00009214107],"domain_scores_gemma":[0.99939907,0.00034070676,0.00008848139,0.000033657718,0.00011153481,0.000026518026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063674565,0.0007853927,0.0005732455,0.00049333944,0.0004173838,0.0012930403,0.0008973329,0.0012208272,0.0015697291],"category_scores_gemma":[0.0021914868,0.00043390028,0.00044061028,0.0005784886,0.0011204953,0.0008263872,0.0005510818,0.0008277699,0.00021873202],"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.000004162549,0.0000043392897,0.000046160174,0.000005417806,0.0000020524153,0.0000063083094,0.000004483862,0.9933708,0.00027927017,0.0056276885,0.000049122307,0.00060031586],"study_design_scores_gemma":[0.0000027293192,0.0000032958724,0.000020047148,0.0000010203448,9.60773e-7,0.0000019162362,0.0000018055084,0.99768174,0.00010627337,0.0019891236,0.00018978857,0.0000012203035],"about_ca_topic_score_codex":0.011822632,"about_ca_topic_score_gemma":0.0051654247,"teacher_disagreement_score":0.011822632,"about_ca_system_score_codex":0.0017509992,"about_ca_system_score_gemma":0.001947923,"threshold_uncertainty_score":0.023507655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6047192,0.0011032,0.387805,0.0003585392,0.00009059496,0.00010045876,0.00016032213,0.00055256434,0.0051101362],"genre_scores_gemma":[0.9911144,0.00030144668,0.007361094,0.000032211552,0.000014612356,0.000036539863,0.000048256174,0.000037771268,0.0010536887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00007458221,0.000015692702,0.00006772743,0.00014908855,0.00010267864],"domain_scores_gemma":[0.99794954,0.0012649095,0.00026873036,0.00014528999,0.000322753,0.0000487757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033877,0.00050065,0.0003111618,0.0008718685,0.00036927426,0.0005943108,0.00060292793,0.0004191747,0.0009175359],"category_scores_gemma":[0.0049763587,0.00023598972,0.00029922096,0.00042177126,0.00062757015,0.0011335906,0.00047090024,0.0006643166,0.00017436418],"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.00018087903,0.00005445022,0.0026931511,0.00006713127,0.000028030765,0.00030296476,0.00018802274,0.9237597,0.022267565,0.03673435,0.00078967126,0.012934179],"study_design_scores_gemma":[0.0000025438503,0.000020435005,0.00024145636,0.0000040057043,0.0000035468406,0.000037034362,0.000015382167,0.99553585,0.0020296948,0.0019249178,0.0001791291,0.0000060197517],"about_ca_topic_score_codex":0.005058263,"about_ca_topic_score_gemma":0.0015823969,"teacher_disagreement_score":0.005058263,"about_ca_system_score_codex":0.0017449247,"about_ca_system_score_gemma":0.0009591157,"threshold_uncertainty_score":0.012660384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048896994,0.000406966,0.9418481,0.00034036927,0.00009741783,0.00016709299,0.000048394268,0.0018988311,0.0062958957],"genre_scores_gemma":[0.42983347,0.0003964748,0.5631136,0.00020457471,0.000091376016,0.00015426123,0.0001730688,0.00008013889,0.0059530777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975103,0.00005245265,0.00001538317,0.000031898355,0.00011359656,0.000035672718],"domain_scores_gemma":[0.9997478,0.00003402365,0.000022545551,0.000050382583,0.00011023727,0.00003499251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063387986,0.00023696016,0.00019261004,0.00044779302,0.00061099016,0.000644323,0.0012778754,0.00076128775,0.0011884499],"category_scores_gemma":[0.00078277575,0.00018934622,0.00036230517,0.0002493207,0.0002898125,0.0008947431,0.00065176404,0.0008262537,0.00037695828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053249404,0.00040990228,0.0035852664,0.00028749087,0.00011265199,0.00082927715,0.0009567833,0.11538162,0.232436,0.21885964,0.010652083,0.41595674],"study_design_scores_gemma":[0.00007487477,0.00044279394,0.0015888243,0.00005198179,0.00010324414,0.0008720423,0.00008910512,0.8799349,0.0389022,0.024389049,0.05348452,0.000066393855],"about_ca_topic_score_codex":0.0020910634,"about_ca_topic_score_gemma":0.002635786,"teacher_disagreement_score":0.0020910634,"about_ca_system_score_codex":0.0008754289,"about_ca_system_score_gemma":0.0007800667,"threshold_uncertainty_score":0.0063517094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99198145,0.00044280686,0.0047616693,0.000039504524,0.000056269306,0.000060219576,0.00026068787,0.00014246708,0.0022548975],"genre_scores_gemma":[0.9938114,0.00028475653,0.004049826,0.000017767607,0.000015338399,0.000036373167,0.0003612136,0.00002756258,0.0013957983],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926335,0.00016875185,0.00006835132,0.00009145893,0.00028361843,0.00012440658],"domain_scores_gemma":[0.9969824,0.0014093311,0.0002682094,0.0001784715,0.0009906412,0.00017096783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012713174,0.0005727829,0.00040044406,0.0006938709,0.00037026356,0.00042849814,0.0005865428,0.00070820673,0.0015588157],"category_scores_gemma":[0.002677739,0.00017902984,0.00017156778,0.00058756926,0.0003395856,0.00062248646,0.00033567176,0.00040160638,0.00025999575],"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.007757151,0.003392816,0.00413866,0.0005930065,0.00013116891,0.0005627069,0.0003331681,0.041803714,0.8931706,0.0011883571,0.0007463946,0.04618229],"study_design_scores_gemma":[0.00034336865,0.031045103,0.01362909,0.00005354675,0.00017117645,0.0006265466,0.0002574672,0.16101807,0.79028827,0.0005282448,0.0019650133,0.000074103606],"about_ca_topic_score_codex":0.0014068433,"about_ca_topic_score_gemma":0.0009330204,"teacher_disagreement_score":0.0015588157,"about_ca_system_score_codex":0.00037981468,"about_ca_system_score_gemma":0.00015471084,"threshold_uncertainty_score":0.0067234635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97532153,0.0039104866,0.014145887,0.00012650806,0.00009198542,0.00011202213,0.0004006954,0.001000507,0.0048903855],"genre_scores_gemma":[0.99274135,0.00047449776,0.005852815,0.000020224037,0.00003717961,0.000036800742,0.0003533527,0.000072615396,0.0004110748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972717,0.00055867195,0.00021897758,0.0003676061,0.0011859104,0.0003971943],"domain_scores_gemma":[0.98930514,0.0051689288,0.0011626357,0.0014160717,0.002513126,0.00043408741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037687833,0.00077904045,0.0013089641,0.0017844748,0.0006496453,0.0011143289,0.0014647112,0.00063506415,0.00072468456],"category_scores_gemma":[0.009655314,0.00025261773,0.000527355,0.0017481411,0.0007626852,0.0015972195,0.00073879247,0.0009988595,0.00014659138],"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.015719853,0.0013861704,0.088056825,0.001855322,0.0012298035,0.00069495,0.0012508252,0.50257546,0.07736547,0.016130244,0.0070895175,0.28664562],"study_design_scores_gemma":[0.00025173934,0.004649625,0.045760393,0.000076794546,0.0003500896,0.0010163354,0.00036731907,0.9143572,0.024898324,0.002815592,0.0052703517,0.00018625933],"about_ca_topic_score_codex":0.0039010954,"about_ca_topic_score_gemma":0.0028846737,"teacher_disagreement_score":0.0039010954,"about_ca_system_score_codex":0.0011486291,"about_ca_system_score_gemma":0.0008610631,"threshold_uncertainty_score":0.019931495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068792016,0.01279477,0.9753905,0.00070127245,0.00040766335,0.00012280425,0.00013334649,0.0013549001,0.002215492],"genre_scores_gemma":[0.28913012,0.011000212,0.6934246,0.00033490395,0.0011943294,0.00043028963,0.0002980181,0.0004974686,0.0036902118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973224,0.00055830245,0.0003119485,0.00044736025,0.0012262331,0.0001338082],"domain_scores_gemma":[0.99522984,0.0014680864,0.0008569591,0.0007014978,0.0014753166,0.00026841642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004218345,0.0017413012,0.0014449946,0.003176955,0.00077104557,0.0041915067,0.003312514,0.0011549096,0.0012178035],"category_scores_gemma":[0.010957169,0.0006995628,0.00044663541,0.0026343951,0.0010367023,0.009542926,0.0024300516,0.002358803,0.00044634772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043627087,0.00021173597,0.0042835423,0.00081089634,0.00016923732,0.00012190032,0.0006876611,0.053065162,0.037093885,0.14944747,0.008892566,0.74477965],"study_design_scores_gemma":[0.00008264125,0.00045019956,0.0022363076,0.0004378043,0.00021735064,0.000766687,0.00026868584,0.79690427,0.04902096,0.09333933,0.056025088,0.0002507165],"about_ca_topic_score_codex":0.0014301738,"about_ca_topic_score_gemma":0.0013492749,"teacher_disagreement_score":0.004218345,"about_ca_system_score_codex":0.0016137079,"about_ca_system_score_gemma":0.0012171593,"threshold_uncertainty_score":0.022309005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010998353,0.00014280036,0.98653793,0.00010322551,0.0000350796,0.00007005748,0.000027173057,0.00091443624,0.0011709305],"genre_scores_gemma":[0.24381718,0.00018883341,0.75223434,0.00007590572,0.000034821172,0.00026408207,0.00022559182,0.00013452396,0.003024696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.00010224951,0.000021829386,0.00010741738,0.00015465255,0.000051790856],"domain_scores_gemma":[0.9995608,0.00017236649,0.00005364711,0.00004808992,0.00014065152,0.00002452511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001508,0.00068160845,0.0007481096,0.00086884486,0.00092107506,0.0009067873,0.0015149364,0.00090781954,0.0025407318],"category_scores_gemma":[0.0018520365,0.00029824465,0.0003068384,0.0006359696,0.0005281795,0.0013479539,0.0008991799,0.00065801817,0.0005190602],"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.0003585864,0.000117283606,0.0007394727,0.00007460874,0.000051873725,0.00008698713,0.00013257768,0.5907816,0.00847536,0.025629116,0.005210721,0.36834174],"study_design_scores_gemma":[0.0000465887,0.000041404295,0.00006504871,0.0000040786704,0.0000059676995,0.000032688713,0.000013382656,0.99264294,0.0012707468,0.0042055477,0.0016637935,0.000007817164],"about_ca_topic_score_codex":0.0037752108,"about_ca_topic_score_gemma":0.0037368648,"teacher_disagreement_score":0.0037752108,"about_ca_system_score_codex":0.0013006582,"about_ca_system_score_gemma":0.0013825268,"threshold_uncertainty_score":0.009437025},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077209463,0.21988153,0.070280544,0.14696616,0.0063579255,0.000096720985,0.00031573084,0.0003228328,0.5480577],"genre_scores_gemma":[0.25458658,0.38419813,0.052631438,0.03654243,0.01085942,0.00036855726,0.0006584552,0.00021919105,0.25993586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770254,0.000782602,0.00007217954,0.00020776241,0.0009532994,0.0002815965],"domain_scores_gemma":[0.99748516,0.0013861611,0.000087285414,0.000110543326,0.00068625377,0.00024455204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056138705,0.0006402239,0.00035897573,0.0012083345,0.0015134723,0.006497645,0.0015422484,0.004363708,0.019186862],"category_scores_gemma":[0.0030456926,0.00041070837,0.00040910134,0.0016609163,0.0020456042,0.008810335,0.00177135,0.0030180414,0.0036743886],"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.00007869582,0.00008462337,0.00042485044,0.0005126212,0.000007182224,0.00033497228,0.00053983106,0.0014231753,0.0017122265,0.8043239,0.058714148,0.1318436],"study_design_scores_gemma":[0.00001137245,0.00008312811,0.00023002058,0.0003098674,0.000007190677,0.0003378597,0.00081846036,0.0019047605,0.0012369591,0.10069456,0.89434546,0.00002028097],"about_ca_topic_score_codex":0.002150147,"about_ca_topic_score_gemma":0.0020434638,"teacher_disagreement_score":0.019186862,"about_ca_system_score_codex":0.002739846,"about_ca_system_score_gemma":0.0018873069,"threshold_uncertainty_score":0.064186394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029262693,0.012473456,0.9318777,0.0015282367,0.0054710642,0.0007180565,0.00035511784,0.008546966,0.036103167],"genre_scores_gemma":[0.13593678,0.023064522,0.7729326,0.0037839361,0.0066283504,0.002217902,0.0017869787,0.004373118,0.049275827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708253,0.0006616689,0.0002683878,0.00033671848,0.0014104528,0.00024023416],"domain_scores_gemma":[0.99767274,0.0006427614,0.00028361476,0.00052611844,0.0007175608,0.00015725527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020955738,0.0010483778,0.00071210996,0.0010940634,0.0012217672,0.0024518638,0.0024125825,0.002260926,0.012761398],"category_scores_gemma":[0.007264397,0.0006943627,0.0007996392,0.001568374,0.001111097,0.0028411262,0.0019774719,0.004301932,0.007933485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030227337,0.00017883845,0.00095485576,0.0017086486,0.00015430429,0.001503509,0.00066446036,0.0143591035,0.038351517,0.3781169,0.14388771,0.4198178],"study_design_scores_gemma":[0.000065964734,0.00020648462,0.0004556787,0.00038493442,0.00009933247,0.0014744417,0.000057918904,0.06932169,0.011296279,0.033887535,0.8826259,0.00012382679],"about_ca_topic_score_codex":0.0011661263,"about_ca_topic_score_gemma":0.00093343115,"teacher_disagreement_score":0.012761398,"about_ca_system_score_codex":0.0011522312,"about_ca_system_score_gemma":0.001726165,"threshold_uncertainty_score":0.04269111},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45018342,0.03022149,0.47737384,0.00354818,0.0006634701,0.0003077739,0.00009573135,0.00059239607,0.037013706],"genre_scores_gemma":[0.963195,0.010099968,0.023117961,0.00021366253,0.00038851675,0.000064470514,0.000061081504,0.000034171335,0.0028250213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790275,0.0006589681,0.000112796384,0.00033584933,0.0007362028,0.00025337713],"domain_scores_gemma":[0.99379313,0.0032146457,0.00069922063,0.00076233567,0.0013302598,0.00020036647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018464448,0.00055060245,0.00069683866,0.002122738,0.00076680235,0.0015836903,0.0010111973,0.00079963234,0.0012016841],"category_scores_gemma":[0.0077042887,0.00030776186,0.0004829204,0.0017130516,0.0014384333,0.0048435293,0.0006316391,0.0015144589,0.00028301994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007317538,0.00061721215,0.010034948,0.0013452148,0.00022108732,0.0008505068,0.0011649699,0.1576184,0.07427948,0.42893472,0.003945115,0.3202565],"study_design_scores_gemma":[0.00010775282,0.001171476,0.005075116,0.00026293748,0.00015463874,0.00232649,0.00047223698,0.8115225,0.06721462,0.07560463,0.035964806,0.00012275844],"about_ca_topic_score_codex":0.0010806688,"about_ca_topic_score_gemma":0.0002855985,"teacher_disagreement_score":0.002122738,"about_ca_system_score_codex":0.0014826406,"about_ca_system_score_gemma":0.00062811107,"threshold_uncertainty_score":0.010757327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85532224,0.0009996606,0.13939613,0.00017480848,0.000050830753,0.0000556618,0.000078466765,0.00034014593,0.0035819062],"genre_scores_gemma":[0.997024,0.00010804792,0.0026737703,0.000010756628,0.0000074253335,0.000009898278,0.0000215462,0.0000074792188,0.00013718245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998847,0.0004086509,0.00005401231,0.0001501387,0.0003463363,0.00019369244],"domain_scores_gemma":[0.99722147,0.0015210486,0.00026496622,0.000335852,0.0005286586,0.00012798641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024810585,0.00070047344,0.0007497658,0.00068708527,0.0006761318,0.0015382511,0.0008142976,0.0006516802,0.00028573198],"category_scores_gemma":[0.009247138,0.00026991885,0.00031706927,0.0008173831,0.000854989,0.0016115692,0.0010017696,0.0005997614,0.00009180443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042582004,0.0000906611,0.004880501,0.000057521735,0.00006929823,0.0003623758,0.00011699782,0.947566,0.014926222,0.010087835,0.00043190084,0.020984968],"study_design_scores_gemma":[0.000005762895,0.000057527173,0.0006348765,0.0000042890047,0.000013239985,0.00005409917,0.000019000196,0.99560297,0.0022294968,0.0012641046,0.00010520877,0.000009510301],"about_ca_topic_score_codex":0.0034330217,"about_ca_topic_score_gemma":0.0012414757,"teacher_disagreement_score":0.0034330217,"about_ca_system_score_codex":0.0013597272,"about_ca_system_score_gemma":0.00059019186,"threshold_uncertainty_score":0.013121247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11191639,0.0010926687,0.87777114,0.00043705126,0.000065004104,0.00005789652,0.00001752464,0.000092616705,0.008549642],"genre_scores_gemma":[0.91229093,0.0007382466,0.08511335,0.00008105366,0.000043668035,0.00006124912,0.00002464845,0.000021687618,0.0016251395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.00015682081,0.000013602983,0.000054840733,0.00014354022,0.000051740208],"domain_scores_gemma":[0.9995535,0.000282439,0.000050115144,0.000016571941,0.00007604316,0.00002124854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059255806,0.00033790147,0.00048705417,0.00034545636,0.00044622284,0.0007699332,0.0006418062,0.0005022206,0.0006038777],"category_scores_gemma":[0.0014001856,0.00023686753,0.0003542767,0.00039543607,0.00046615128,0.0009182566,0.00037980633,0.00042525274,0.00004166419],"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.00009556625,0.00006279719,0.0011563379,0.000109345114,0.000048753944,0.00016956987,0.00010447335,0.8745659,0.006843733,0.08244958,0.00068840984,0.033705506],"study_design_scores_gemma":[0.0000039353563,0.000017030849,0.00007891246,0.0000024498252,0.0000045204188,0.000019425446,0.000008518052,0.99659157,0.0004156547,0.0025662533,0.00028830947,0.0000033424712],"about_ca_topic_score_codex":0.002236313,"about_ca_topic_score_gemma":0.00086388807,"teacher_disagreement_score":0.002236313,"about_ca_system_score_codex":0.00080187153,"about_ca_system_score_gemma":0.00048099703,"threshold_uncertainty_score":0.005818069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96105194,0.0002953914,0.03718926,0.00016082666,0.000026765028,0.000025458972,0.00007192826,0.00023672338,0.0009416301],"genre_scores_gemma":[0.996962,0.00006551749,0.0027074192,0.000011199883,0.0000062331032,0.0000095857995,0.000047971345,0.00000689689,0.0001832473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00019125751,0.000045623707,0.0000794161,0.00017455197,0.000073645395],"domain_scores_gemma":[0.99545175,0.0031466149,0.00043522308,0.00015786219,0.0006988054,0.00010973311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016444174,0.0007156661,0.00043825377,0.0006037413,0.00023519839,0.0006129272,0.0005528877,0.00076779636,0.00047232065],"category_scores_gemma":[0.008314206,0.00017343975,0.00017641968,0.0004886518,0.00040275216,0.0008572,0.0003808311,0.00042866994,0.00007391642],"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.00065454503,0.0001887466,0.009979674,0.00007632135,0.00007925469,0.000069701644,0.000057385227,0.9455634,0.007190304,0.00072832697,0.00021814683,0.03519426],"study_design_scores_gemma":[0.0000036151969,0.000083609775,0.00073307264,0.0000023841726,0.000004862358,0.0000056474687,0.000005353243,0.99700505,0.0019937882,0.00014352406,0.000015458658,0.0000035365836],"about_ca_topic_score_codex":0.007170847,"about_ca_topic_score_gemma":0.0034294429,"teacher_disagreement_score":0.007170847,"about_ca_system_score_codex":0.0010504624,"about_ca_system_score_gemma":0.0002943439,"threshold_uncertainty_score":0.014258206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029470826,0.0004922729,0.96727175,0.00028164848,0.00011656233,0.00008554477,0.000028665965,0.0008792145,0.0013734812],"genre_scores_gemma":[0.8419216,0.00037177122,0.15553996,0.00013825977,0.0001734937,0.00011677602,0.000047819685,0.00004081607,0.0016494709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900156,0.0002255234,0.00006538516,0.00015950634,0.0003788346,0.00016919007],"domain_scores_gemma":[0.99908316,0.00027200737,0.0001422933,0.00017357113,0.00023298683,0.00009592668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053495,0.0005151493,0.000620937,0.00062294194,0.0009560351,0.0011590834,0.0021078687,0.0009647134,0.00094389886],"category_scores_gemma":[0.0025672098,0.00026236862,0.000486718,0.0006010228,0.0011614774,0.0010268462,0.0009823804,0.0012757587,0.00026748815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040704795,0.0003076777,0.0015510421,0.00020306275,0.00010838273,0.0002870868,0.00051729736,0.41893482,0.06327737,0.07803921,0.004377693,0.4319893],"study_design_scores_gemma":[0.000034153312,0.00006471358,0.0002665786,0.000008205836,0.00003118098,0.00014171687,0.000020305824,0.9802729,0.01014921,0.0063165864,0.00264898,0.000045484863],"about_ca_topic_score_codex":0.0049581593,"about_ca_topic_score_gemma":0.0034190253,"teacher_disagreement_score":0.0049581593,"about_ca_system_score_codex":0.0015120202,"about_ca_system_score_gemma":0.0015915228,"threshold_uncertainty_score":0.010970533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018122002,0.000052546475,0.98045236,0.000055792018,0.000026541966,0.000030513716,0.000022536318,0.0008192723,0.0004183821],"genre_scores_gemma":[0.6485762,0.0000749096,0.35021976,0.00006586596,0.00002838371,0.00007990901,0.00009601151,0.00007296763,0.00078600773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985796,0.00039963826,0.00008291187,0.00021006883,0.0006195184,0.00010825964],"domain_scores_gemma":[0.9933739,0.0034990439,0.00090139726,0.0013056251,0.0008131277,0.000106936284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021546143,0.00048496737,0.00051992125,0.00090920844,0.00044784017,0.00081269373,0.0016130889,0.0007012031,0.0008847181],"category_scores_gemma":[0.013007751,0.00037159136,0.00026101182,0.00087850227,0.0007294853,0.0015661913,0.0009227532,0.00096281007,0.00025289366],"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.0003185138,0.00012222132,0.0031787853,0.000057718342,0.000048264174,0.00009316597,0.00010258572,0.7216735,0.017075762,0.0264926,0.0013282488,0.2295087],"study_design_scores_gemma":[0.00001112375,0.00002559181,0.0002880842,0.00000237321,0.000005431317,0.000032748005,0.0000033426604,0.99197596,0.00458809,0.0027097678,0.00034529873,0.000012322606],"about_ca_topic_score_codex":0.002365793,"about_ca_topic_score_gemma":0.0020591258,"teacher_disagreement_score":0.002365793,"about_ca_system_score_codex":0.0010521084,"about_ca_system_score_gemma":0.0010566914,"threshold_uncertainty_score":0.011394858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24707587,0.0009275279,0.73637545,0.00033926734,0.00007925683,0.0001567489,0.0001560254,0.00317292,0.011716987],"genre_scores_gemma":[0.8693238,0.00050914957,0.12583925,0.00007742683,0.00005558039,0.00005681369,0.00024708814,0.00012698029,0.003763861],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960154,0.000054886947,0.000016470403,0.00003727949,0.00021537096,0.00007459913],"domain_scores_gemma":[0.99966884,0.00009263101,0.000053447868,0.00006796045,0.00010218079,0.00001493051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003226259,0.00029620947,0.00025546685,0.00056170597,0.0003380442,0.0006329719,0.0004659593,0.00041528427,0.0010324632],"category_scores_gemma":[0.00088507,0.0001669284,0.00011323632,0.0003344322,0.00028055394,0.0009792966,0.00052702206,0.00037018713,0.0004704274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003318391,0.00014882901,0.0008904595,0.00018554387,0.00005285404,0.0003875776,0.00018077865,0.09683,0.5878609,0.032959543,0.0035307372,0.27664092],"study_design_scores_gemma":[0.000061036866,0.00027135274,0.0009053971,0.00001383266,0.000041717074,0.0003848444,0.00010982488,0.6873932,0.28847477,0.010191184,0.012126297,0.000026651509],"about_ca_topic_score_codex":0.00050965225,"about_ca_topic_score_gemma":0.00054532214,"teacher_disagreement_score":0.0010324632,"about_ca_system_score_codex":0.00045253237,"about_ca_system_score_gemma":0.000286163,"threshold_uncertainty_score":0.00345397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03871553,0.0005781371,0.9341711,0.0011300532,0.00044520223,0.0003395783,0.000160014,0.001408864,0.02305148],"genre_scores_gemma":[0.7547389,0.00066278665,0.22403815,0.0008331354,0.00052072655,0.00044322683,0.00024990787,0.0002366908,0.018276336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625933,0.00092090503,0.00023712577,0.00077070924,0.0012525114,0.00055947993],"domain_scores_gemma":[0.9948119,0.0014127487,0.00048468015,0.0017369144,0.0010563284,0.00049746776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039800256,0.0007945918,0.0009398673,0.001443908,0.0012635117,0.004198638,0.0058925212,0.002286552,0.007931481],"category_scores_gemma":[0.0120654935,0.0005514864,0.0007906702,0.0010495061,0.0025847417,0.0072057485,0.0051860334,0.0031662544,0.0015688468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024211979,0.00020353058,0.00034179844,0.000075936274,0.0000442847,0.00024111469,0.00019291512,0.008855623,0.0056002843,0.9270146,0.0041460567,0.053041674],"study_design_scores_gemma":[0.0005639031,0.0005097226,0.00078337546,0.000088287845,0.00013069954,0.001449553,0.00012877242,0.447213,0.0179423,0.45574602,0.075263485,0.000180947],"about_ca_topic_score_codex":0.00086493994,"about_ca_topic_score_gemma":0.00072057534,"teacher_disagreement_score":0.007931481,"about_ca_system_score_codex":0.0019513338,"about_ca_system_score_gemma":0.0013216359,"threshold_uncertainty_score":0.026533425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9125009,0.0039287847,0.06823747,0.0003288697,0.00018483754,0.00030424842,0.00019024679,0.0011508225,0.0131739015],"genre_scores_gemma":[0.99053836,0.00038464845,0.007651797,0.000033137447,0.00003021397,0.00005646479,0.00010777938,0.000030516263,0.0011670552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971397,0.0011036007,0.00013677157,0.00020718451,0.0011028291,0.00030986557],"domain_scores_gemma":[0.993543,0.0037186013,0.00039451325,0.0005696849,0.0016199587,0.00015408924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040903143,0.00075483066,0.0006413577,0.0012523703,0.0005909013,0.0010438234,0.0009078364,0.00054022524,0.0017243993],"category_scores_gemma":[0.009662807,0.00020576241,0.00022500107,0.00057731697,0.0005586391,0.0012159513,0.00055280206,0.00055544364,0.00027094295],"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.0071631963,0.0012109615,0.017770154,0.0008908988,0.0004321429,0.000881015,0.00089259795,0.5162039,0.14846511,0.023885299,0.0059145703,0.27629015],"study_design_scores_gemma":[0.000099216326,0.002555895,0.00251929,0.000020673517,0.00008891845,0.00036140665,0.00013440967,0.95818293,0.03323319,0.0009630258,0.0018053643,0.000035658926],"about_ca_topic_score_codex":0.00268937,"about_ca_topic_score_gemma":0.0016426031,"teacher_disagreement_score":0.0040903143,"about_ca_system_score_codex":0.0010145085,"about_ca_system_score_gemma":0.0006610993,"threshold_uncertainty_score":0.021631896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8817832,0.00019873068,0.1119828,0.00024933257,0.00005537552,0.000067457295,0.00025183367,0.0007378229,0.0046734507],"genre_scores_gemma":[0.9847557,0.000082675986,0.014471546,0.0000234866,0.000005715741,0.000057451347,0.0001296359,0.00002444247,0.0004492515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.00012022006,0.000014761767,0.000026510232,0.000102792015,0.000059530892],"domain_scores_gemma":[0.99727863,0.0019150183,0.00014753164,0.000230942,0.0003216164,0.00010628352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042733,0.0003063678,0.0005219775,0.0006202207,0.00055472995,0.00050870975,0.000784216,0.0008306266,0.0011695536],"category_scores_gemma":[0.0046228454,0.00029136922,0.00036464553,0.00059895613,0.0006467976,0.0008397043,0.00052455236,0.0007361072,0.000102457416],"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.00006275412,0.000052743177,0.0012118258,0.000018571167,0.000014789403,0.000046122423,0.000060182974,0.9888603,0.0010505236,0.0061860867,0.00020604426,0.00223004],"study_design_scores_gemma":[0.00000537875,0.000006728608,0.00007900074,9.400529e-7,0.0000010629008,0.0000027468927,0.0000035781095,0.9990308,0.00019694802,0.0006186412,0.000052877225,0.0000013808121],"about_ca_topic_score_codex":0.005612934,"about_ca_topic_score_gemma":0.0029869243,"teacher_disagreement_score":0.005612934,"about_ca_system_score_codex":0.0008254204,"about_ca_system_score_gemma":0.0006168681,"threshold_uncertainty_score":0.0111605525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030690815,0.00021092854,0.9633889,0.00015793585,0.00009719072,0.00012538479,0.00006253204,0.0007293052,0.004537046],"genre_scores_gemma":[0.8844087,0.00014555201,0.11254784,0.00008788543,0.000036716618,0.0001763292,0.000066312394,0.000019316236,0.002511353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997408,0.000035969213,0.000015145359,0.00006423014,0.00011220689,0.00003158919],"domain_scores_gemma":[0.9997061,0.00008834775,0.000029539613,0.00002305931,0.00013040661,0.000022514576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058175996,0.0004644374,0.00040904325,0.0002690009,0.00079402264,0.0010174176,0.0013422646,0.001076452,0.001883895],"category_scores_gemma":[0.0011497505,0.00022306496,0.00040197928,0.00022375595,0.00049296813,0.000678472,0.00038319954,0.00097395375,0.0003171146],"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.00018922628,0.00014171151,0.00043139534,0.00012151784,0.000053901513,0.00016949505,0.00012764895,0.86798364,0.02005022,0.024590198,0.0015915794,0.08454945],"study_design_scores_gemma":[0.000013465274,0.000028088218,0.000064116575,0.0000052480227,0.000008419645,0.000014729311,0.000003889006,0.99694,0.0011161651,0.0012087726,0.0005916438,0.0000055098917],"about_ca_topic_score_codex":0.007972439,"about_ca_topic_score_gemma":0.0078020087,"teacher_disagreement_score":0.007972439,"about_ca_system_score_codex":0.0010731949,"about_ca_system_score_gemma":0.0012389212,"threshold_uncertainty_score":0.015852094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10268975,0.003063156,0.88819283,0.00036142484,0.00017146439,0.00005285166,0.000042247226,0.00024438056,0.0051819584],"genre_scores_gemma":[0.9790547,0.00062360225,0.018979812,0.00005477154,0.00015010944,0.00003097087,0.00003334644,0.000038466238,0.0010343022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775237,0.0004577654,0.0001226539,0.00018763207,0.001149252,0.00033040272],"domain_scores_gemma":[0.99481034,0.003276521,0.0006640127,0.0003167832,0.00064610277,0.00028623614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026996213,0.0008715882,0.00067399844,0.0014085806,0.0006999219,0.00206936,0.0013290416,0.0010112822,0.0008736223],"category_scores_gemma":[0.011604192,0.00030039175,0.0003750283,0.0010791097,0.0014941549,0.0026055735,0.0010251021,0.0014138335,0.00011664184],"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.00041721854,0.00009988504,0.003254215,0.00014231933,0.00005488464,0.00032410148,0.00026404753,0.5172272,0.02555125,0.40024954,0.0004987362,0.05191659],"study_design_scores_gemma":[0.000005733881,0.000034139593,0.00041407265,0.000010671432,0.000009369329,0.000065437,0.000015942082,0.9627851,0.0031277477,0.03307615,0.0004392039,0.000016398519],"about_ca_topic_score_codex":0.0017653728,"about_ca_topic_score_gemma":0.0007649966,"teacher_disagreement_score":0.0026996213,"about_ca_system_score_codex":0.0019026181,"about_ca_system_score_gemma":0.0009959717,"threshold_uncertainty_score":0.01427716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95210266,0.0008942704,0.027108975,0.00050933636,0.00033266997,0.0001849122,0.00068958005,0.0039247177,0.014252923],"genre_scores_gemma":[0.98280185,0.00036785202,0.011933841,0.00005294597,0.000109733795,0.00003445894,0.00050958665,0.00008440683,0.0041052867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998271,0.000021990401,0.000008305326,0.000029997238,0.000078223486,0.00003447594],"domain_scores_gemma":[0.99931455,0.00030417682,0.00005715596,0.00007617891,0.00016133368,0.00008661633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032796554,0.00025903966,0.00018177739,0.0004987305,0.00032764208,0.00043446856,0.00048086254,0.0003384755,0.0024203726],"category_scores_gemma":[0.0020318832,0.00011817427,0.000059419694,0.00038948166,0.00020584876,0.0006285108,0.00040459735,0.00030949787,0.0004390577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052002245,0.0010884935,0.01678765,0.0005484408,0.00010659844,0.0019650715,0.0018611168,0.034816798,0.29864064,0.0056957835,0.036772642,0.59651643],"study_design_scores_gemma":[0.00057779765,0.0022249217,0.042977367,0.00009337809,0.00013690132,0.0016247911,0.0009676319,0.7085267,0.18439046,0.006058973,0.052266996,0.00015406562],"about_ca_topic_score_codex":0.0017791857,"about_ca_topic_score_gemma":0.0020404283,"teacher_disagreement_score":0.0024203726,"about_ca_system_score_codex":0.00032232646,"about_ca_system_score_gemma":0.00015077271,"threshold_uncertainty_score":0.008096933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25601825,0.0054171896,0.71315545,0.0010972744,0.00022714035,0.000105749205,0.00017465101,0.0014498484,0.022354515],"genre_scores_gemma":[0.9622625,0.0011126593,0.031207718,0.0001803688,0.00016052816,0.00008168109,0.0000939553,0.00020136566,0.004699235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976931,0.0008082138,0.00006368547,0.00022562315,0.0008717956,0.00033755123],"domain_scores_gemma":[0.9776912,0.01703553,0.0010055173,0.0014799089,0.0023031023,0.0004847546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070458516,0.0010852964,0.0009947972,0.0024822517,0.00074419664,0.002292968,0.0022376508,0.0011887855,0.003879332],"category_scores_gemma":[0.05089786,0.00047597275,0.0004781181,0.0017023351,0.0020181215,0.003652381,0.0019739508,0.0018871228,0.00038400828],"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.0007742778,0.00030933032,0.0041181766,0.0003596431,0.00014677545,0.00030312754,0.0006497267,0.5564247,0.015360613,0.34970543,0.0061658057,0.06568247],"study_design_scores_gemma":[0.000011496763,0.0000332004,0.00038430913,0.000026247726,0.000029408902,0.00005769686,0.000027256016,0.9762116,0.0015647665,0.021280572,0.00035884208,0.000014473215],"about_ca_topic_score_codex":0.00428232,"about_ca_topic_score_gemma":0.0028926313,"teacher_disagreement_score":0.0070458516,"about_ca_system_score_codex":0.003848974,"about_ca_system_score_gemma":0.0019023943,"threshold_uncertainty_score":0.03726244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23332956,0.0027969526,0.6550403,0.005461991,0.0006972637,0.00014435734,0.0001720078,0.0010242801,0.10133323],"genre_scores_gemma":[0.9522956,0.0019042722,0.032903947,0.00010952598,0.00010661094,0.000044817105,0.000067425026,0.00005763572,0.012510127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977356,0.00008111722,0.000010266413,0.000027448366,0.000062999796,0.000044624576],"domain_scores_gemma":[0.9996319,0.0001545305,0.000032815115,0.000042393076,0.00009400006,0.000044357457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532665,0.00016062146,0.00015097915,0.00029008367,0.00040620816,0.001036936,0.00032697432,0.00026288995,0.0017719007],"category_scores_gemma":[0.0014909833,0.00013272098,0.0001127506,0.00039074852,0.000357126,0.00086627854,0.00029665968,0.00056755287,0.00030345385],"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.00025766893,0.00033152784,0.002105977,0.00013882513,0.000026057278,0.00013554083,0.00048018488,0.3282251,0.019842219,0.32824126,0.010222572,0.30999306],"study_design_scores_gemma":[0.000018469887,0.00006525315,0.001117219,0.0000376119,0.000014786383,0.00005410517,0.0002342687,0.8442986,0.00803524,0.11897405,0.027134418,0.00001589752],"about_ca_topic_score_codex":0.0034572936,"about_ca_topic_score_gemma":0.0037881683,"teacher_disagreement_score":0.0034572936,"about_ca_system_score_codex":0.0010026605,"about_ca_system_score_gemma":0.0012120549,"threshold_uncertainty_score":0.0072748065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35629335,0.00029351562,0.63885885,0.00014680157,0.000029706855,0.000079490645,0.000117610376,0.00023844205,0.0039422885],"genre_scores_gemma":[0.9768844,0.00031009217,0.020908866,0.00001689556,0.000019740142,0.000071826646,0.00006553976,0.000026917889,0.001695632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997805,0.000086442364,0.000010697314,0.000028493952,0.00006383211,0.000030034596],"domain_scores_gemma":[0.99925226,0.0005231427,0.00009578512,0.000022325326,0.00008692041,0.000019547386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041990262,0.00044113013,0.00025120354,0.0005155705,0.00019179963,0.00048730243,0.0004954108,0.00064058707,0.0006160288],"category_scores_gemma":[0.0019703778,0.00022628631,0.00033241566,0.00036218224,0.0003811282,0.0006825422,0.00018493898,0.00034890132,0.00010781027],"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.000025238278,0.000016930884,0.0004579431,0.0000120695095,0.0000065259997,0.000038609098,0.000022921822,0.9891502,0.0018983142,0.005668041,0.00004880433,0.0026543404],"study_design_scores_gemma":[0.000001299589,0.0000075021635,0.00007486179,9.4612324e-7,0.0000016930417,0.000006387572,0.0000032273633,0.9992065,0.00026061715,0.00038524397,0.000050051374,0.0000016525061],"about_ca_topic_score_codex":0.010962493,"about_ca_topic_score_gemma":0.0059704594,"teacher_disagreement_score":0.010962493,"about_ca_system_score_codex":0.0007325477,"about_ca_system_score_gemma":0.00045731812,"threshold_uncertainty_score":0.021797359},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14352387,0.45516035,0.29335505,0.028072672,0.0021488585,0.0003039999,0.00441329,0.0008737944,0.072148174],"genre_scores_gemma":[0.52402306,0.34277925,0.11310633,0.0029408524,0.005157649,0.00026911267,0.0042959386,0.00032568324,0.0071020834],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979444,0.0004162231,0.00020651457,0.0005867465,0.000777414,0.00006871753],"domain_scores_gemma":[0.99263245,0.0031980327,0.00074479595,0.0009303062,0.0021956945,0.00029871336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032655941,0.0010230445,0.0007203031,0.007737694,0.0010642447,0.004597496,0.0012328065,0.001410511,0.0014711855],"category_scores_gemma":[0.011783605,0.00090707716,0.00057371863,0.0075687976,0.003916585,0.0086191,0.0017689535,0.003075551,0.0005932763],"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.00018196358,0.0002497263,0.03268944,0.0027416516,0.00027123204,0.0004563736,0.0019737058,0.042442814,0.005360156,0.20868593,0.020584073,0.68436307],"study_design_scores_gemma":[0.000021161031,0.00031821523,0.051514063,0.003036331,0.00020241212,0.0037291883,0.0028552404,0.06828429,0.0071913735,0.24021523,0.6223408,0.00029178048],"about_ca_topic_score_codex":0.0027376995,"about_ca_topic_score_gemma":0.001915219,"teacher_disagreement_score":0.007737694,"about_ca_system_score_codex":0.0024812957,"about_ca_system_score_gemma":0.00087521004,"threshold_uncertainty_score":0.018003166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28857532,0.0014919693,0.6800111,0.00050774915,0.000124603,0.00008931809,0.00007982033,0.0014970746,0.02762304],"genre_scores_gemma":[0.96392506,0.00021252234,0.033521853,0.0000636144,0.000022558113,0.000044705976,0.000022392556,0.000032628242,0.0021546392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997353,0.0000843093,0.000012610957,0.00003052511,0.00009650257,0.000040662107],"domain_scores_gemma":[0.99984205,0.000057404097,0.00001787687,0.000034590998,0.00003336923,0.000014630556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044016654,0.00020097273,0.00025749725,0.00040270283,0.0004042733,0.00063017197,0.0005040894,0.00042376437,0.00067739526],"category_scores_gemma":[0.00073259516,0.0002577758,0.00015808732,0.0002795167,0.0005308998,0.0005940404,0.00035935585,0.0002727562,0.0002208227],"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.0002654627,0.00015313161,0.0009163981,0.00008985537,0.00004124741,0.00035797653,0.00023753954,0.66129464,0.10072644,0.12521102,0.0021950628,0.10851115],"study_design_scores_gemma":[0.000014708277,0.000035390487,0.00027956758,0.000006825622,0.000011520946,0.00009732454,0.000033714685,0.96537346,0.009755664,0.021096803,0.0032786992,0.000016273778],"about_ca_topic_score_codex":0.0010500296,"about_ca_topic_score_gemma":0.0011497452,"teacher_disagreement_score":0.0010500296,"about_ca_system_score_codex":0.00055383495,"about_ca_system_score_gemma":0.00033686226,"threshold_uncertainty_score":0.0040183663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19024177,0.00082647026,0.7996553,0.0005549495,0.0002305335,0.000209979,0.00003889181,0.0008669432,0.0073751756],"genre_scores_gemma":[0.9289784,0.00014978592,0.06942081,0.00014737612,0.00010150121,0.00007910179,0.000018931021,0.00004381575,0.0010602239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973578,0.0010754925,0.00013969577,0.0003462065,0.0008264885,0.00025436498],"domain_scores_gemma":[0.99329364,0.0034976334,0.0006040208,0.0011316976,0.0011733434,0.00029967274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065541104,0.00058589946,0.00070887076,0.0005802825,0.0010487549,0.0015291446,0.0021712182,0.00072127127,0.0006182398],"category_scores_gemma":[0.016345324,0.00035950917,0.00037200112,0.00037452826,0.0010794047,0.0019519746,0.0015532189,0.0010704196,0.000109225126],"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.002647055,0.00074607675,0.01488428,0.00032992352,0.00036034346,0.0009398929,0.0016344413,0.47025678,0.10649157,0.15608095,0.0035505963,0.24207799],"study_design_scores_gemma":[0.00019676088,0.0003117965,0.0012627289,0.000026500451,0.00009535664,0.00035436894,0.00012799312,0.9493455,0.01888279,0.023134356,0.0061944635,0.00006735726],"about_ca_topic_score_codex":0.0030375896,"about_ca_topic_score_gemma":0.002759796,"teacher_disagreement_score":0.0065541104,"about_ca_system_score_codex":0.0010074294,"about_ca_system_score_gemma":0.0019749533,"threshold_uncertainty_score":0.03466189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08919931,0.00279289,0.8874653,0.00088355644,0.0004016175,0.00021000841,0.0000873877,0.0045767804,0.014383176],"genre_scores_gemma":[0.85341495,0.0018108924,0.13041508,0.00030486737,0.0002560397,0.00021459509,0.00015532658,0.00024175114,0.013186496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976646,0.0007175064,0.00017577717,0.00023300064,0.00093713537,0.0002719856],"domain_scores_gemma":[0.99461854,0.00283844,0.0005339818,0.001016849,0.00088949496,0.00010266411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032183253,0.0006419607,0.00041507813,0.0007204706,0.0007569867,0.0020049652,0.0014565324,0.0010417849,0.0026273122],"category_scores_gemma":[0.008693277,0.00037043003,0.00027382115,0.00062611455,0.0012944438,0.0034382723,0.0014366534,0.0015820874,0.0007494158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016892455,0.00029945944,0.009684829,0.0006212543,0.000099260964,0.0014971824,0.0010256632,0.15967646,0.057232585,0.26279408,0.010990364,0.4943896],"study_design_scores_gemma":[0.00020120476,0.0007572049,0.0014616025,0.00015845682,0.0001537604,0.0016929284,0.00015790379,0.76066506,0.09280496,0.08997419,0.051859673,0.00011303994],"about_ca_topic_score_codex":0.0009061054,"about_ca_topic_score_gemma":0.0004668234,"teacher_disagreement_score":0.0032183253,"about_ca_system_score_codex":0.0006365266,"about_ca_system_score_gemma":0.00056883605,"threshold_uncertainty_score":0.017020345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097519765,0.0009031019,0.9657281,0.00040244995,0.00041950107,0.00017062854,0.00010575861,0.0059718676,0.016546573],"genre_scores_gemma":[0.27721262,0.0012791009,0.6944481,0.00069622125,0.00027520198,0.00030236787,0.000626384,0.0009898399,0.024170168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905807,0.00019970938,0.00005373147,0.00018855504,0.00036997785,0.00012989351],"domain_scores_gemma":[0.9990645,0.00018704643,0.000054331344,0.00040873286,0.0002140928,0.000071303824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643422,0.000860979,0.00080946466,0.0010846944,0.0008170935,0.001959689,0.0031371673,0.0010985537,0.004295026],"category_scores_gemma":[0.0014334305,0.0003588844,0.0005080103,0.00092153414,0.0008104317,0.0028307068,0.002291788,0.000911026,0.0012580868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037764432,0.0002731874,0.0010877983,0.0005300213,0.00016495046,0.00049477065,0.000412635,0.07100083,0.033978608,0.19665456,0.018236173,0.6767889],"study_design_scores_gemma":[0.000147335,0.00034826912,0.0005775466,0.00011330466,0.0001547305,0.0009824553,0.0001739778,0.7042303,0.02974708,0.10819273,0.1552026,0.0001297102],"about_ca_topic_score_codex":0.0016545753,"about_ca_topic_score_gemma":0.0017320045,"teacher_disagreement_score":0.004295026,"about_ca_system_score_codex":0.0006703301,"about_ca_system_score_gemma":0.0009966177,"threshold_uncertainty_score":0.014368296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046126937,0.0032769782,0.97962236,0.0022314638,0.00059327827,0.00022741345,0.00011437302,0.0007621444,0.012710786],"genre_scores_gemma":[0.052607346,0.009298828,0.91874456,0.0012440236,0.0017842225,0.0022870775,0.00050128344,0.00043719562,0.013095473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925759,0.00313328,0.00071505806,0.00072024926,0.0024002357,0.0004553846],"domain_scores_gemma":[0.996885,0.0013992228,0.000239589,0.000671299,0.0005087723,0.00029616096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010216424,0.0022071523,0.0016841288,0.0029174434,0.0022375335,0.008519254,0.006046373,0.005518371,0.007063277],"category_scores_gemma":[0.0092424955,0.0010597046,0.0025120692,0.0035188308,0.00721783,0.011087877,0.004816344,0.008613976,0.0037534288],"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.000007828433,0.000012551086,0.000044216325,0.00008590225,0.00001232738,0.00009067533,0.00014444457,0.0043783044,0.00025425263,0.9807896,0.0025279154,0.011651984],"study_design_scores_gemma":[0.000031931297,0.000059467046,0.00008338523,0.00024441158,0.000030224075,0.00025130564,0.00011400683,0.052246746,0.00043716663,0.7260718,0.22039123,0.000038465103],"about_ca_topic_score_codex":0.0051925695,"about_ca_topic_score_gemma":0.0032378954,"teacher_disagreement_score":0.010216424,"about_ca_system_score_codex":0.0033243613,"about_ca_system_score_gemma":0.0032857223,"threshold_uncertainty_score":0.0540303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7732358,0.0022651933,0.21054843,0.0004671734,0.00009130687,0.00019791756,0.000107213986,0.0010251253,0.01206181],"genre_scores_gemma":[0.9727586,0.00018545343,0.02596659,0.000046940397,0.000031488515,0.000056861452,0.00008348565,0.000042503394,0.0008281009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681646,0.001265246,0.00014238292,0.00023778436,0.0008909616,0.00064723956],"domain_scores_gemma":[0.98301435,0.013320314,0.0009300279,0.00061097334,0.0017466052,0.0003777902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039349175,0.0011038155,0.0009632082,0.0014747363,0.00085062085,0.0013313574,0.0010911557,0.0013980097,0.0015983239],"category_scores_gemma":[0.014162662,0.00026537725,0.00044688414,0.0009949366,0.0007123805,0.0010339346,0.0007544671,0.00066188886,0.00019312181],"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.0026599106,0.0005125586,0.007596587,0.00017106932,0.00016248392,0.000064305896,0.00014444315,0.84128994,0.012350678,0.009741116,0.001050675,0.12425625],"study_design_scores_gemma":[0.000049872422,0.00016987236,0.0007399694,0.0000042769125,0.000025372548,0.000028004028,0.000015106304,0.99537945,0.0027680832,0.00069714856,0.00011327417,0.000009594444],"about_ca_topic_score_codex":0.0040323455,"about_ca_topic_score_gemma":0.0018817845,"teacher_disagreement_score":0.0040323455,"about_ca_system_score_codex":0.0023657097,"about_ca_system_score_gemma":0.0012501624,"threshold_uncertainty_score":0.020810068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6706906,0.00036693597,0.31831118,0.00027953275,0.000060274273,0.000059871527,0.00006292784,0.00060406025,0.009564583],"genre_scores_gemma":[0.99683017,0.000050779934,0.0020755937,0.000008796485,0.000005387676,0.000014651494,0.000013415891,0.000015073381,0.0009861481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.000073687865,0.000008964743,0.00005899005,0.000101509504,0.00006361693],"domain_scores_gemma":[0.99920374,0.00033226868,0.00014175105,0.000041986175,0.00022818705,0.00005210753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074210536,0.00041230218,0.0006046996,0.00057051226,0.00049591233,0.00062511547,0.00061393046,0.00048782365,0.0012925596],"category_scores_gemma":[0.0018553962,0.00022678805,0.0004463454,0.00020404646,0.00087169616,0.0005583538,0.0006492519,0.0004015367,0.00016639697],"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.0002617538,0.000038849394,0.0027067557,0.000053751464,0.00003535888,0.00037168106,0.0002835499,0.93801916,0.026931757,0.022584071,0.0006239651,0.008089407],"study_design_scores_gemma":[0.0000025344184,0.000012198574,0.00014087411,0.0000012960601,0.0000023785556,0.000008685961,0.000008118357,0.99833953,0.00086409575,0.0005610116,0.000056637306,0.0000025947752],"about_ca_topic_score_codex":0.0050303056,"about_ca_topic_score_gemma":0.001364495,"teacher_disagreement_score":0.0050303056,"about_ca_system_score_codex":0.0009254528,"about_ca_system_score_gemma":0.00069355324,"threshold_uncertainty_score":0.010002077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073652774,0.0006632202,0.92181957,0.00045096432,0.00003492031,0.000041479616,0.00002590384,0.00015298293,0.0031581349],"genre_scores_gemma":[0.95255417,0.0003810612,0.045157317,0.0000789655,0.000057845446,0.0000872308,0.00002814858,0.000021326554,0.0016340467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954945,0.00019368951,0.000017788761,0.00006965585,0.000101008525,0.00006843854],"domain_scores_gemma":[0.9988752,0.0008318522,0.0001254399,0.000025655703,0.000106335974,0.000035596226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635347,0.0005714685,0.0008291127,0.00038718886,0.00042382575,0.00075549306,0.00083085574,0.0009168643,0.00069163344],"category_scores_gemma":[0.0027393664,0.00034335026,0.0002757806,0.00056282815,0.0010525901,0.0010262595,0.0007414359,0.0008615846,0.000079099715],"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.00002032182,0.000012740789,0.00009846123,0.000013344532,0.0000056115937,0.000012725223,0.000011000806,0.98834455,0.0002338841,0.003191603,0.00010748879,0.007948155],"study_design_scores_gemma":[0.0000042545616,0.000008562185,0.000026197215,0.0000010128693,0.000001249165,0.0000019374222,0.0000019107624,0.99751943,0.00008852284,0.0022868975,0.000058777463,0.0000012423743],"about_ca_topic_score_codex":0.0069196606,"about_ca_topic_score_gemma":0.0038033777,"teacher_disagreement_score":0.0069196606,"about_ca_system_score_codex":0.0010515011,"about_ca_system_score_gemma":0.0008266124,"threshold_uncertainty_score":0.013758779},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008930289,0.000081747545,0.98956734,0.00011249693,0.0000306878,0.00003394417,0.0000082733295,0.00023249962,0.0010027388],"genre_scores_gemma":[0.7183911,0.00016333787,0.27813953,0.00025413767,0.000050659004,0.00023988904,0.000030928004,0.000045718567,0.0026845797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952364,0.00015747311,0.000025396117,0.00012266802,0.0001133528,0.00005755863],"domain_scores_gemma":[0.9989611,0.0006051315,0.00010992469,0.00008954849,0.0001857246,0.00004856749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994974,0.00042236314,0.00056527054,0.00033310594,0.00039777296,0.0004998039,0.0014750045,0.0008171958,0.001189097],"category_scores_gemma":[0.0032253207,0.00022351053,0.00042495952,0.0002730518,0.00081612816,0.00076392206,0.00083394005,0.0009636493,0.00019929274],"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.000105172556,0.00012110771,0.0009493184,0.00013751283,0.000055270448,0.00010852515,0.00019173823,0.80159086,0.010348919,0.05996828,0.0015906341,0.12483268],"study_design_scores_gemma":[0.000012718846,0.00005120497,0.00004294867,0.0000047149447,0.000006839424,0.00002385225,0.0000045776146,0.99149245,0.0011977509,0.0066805147,0.0004746736,0.000007854259],"about_ca_topic_score_codex":0.0012553092,"about_ca_topic_score_gemma":0.0012720308,"teacher_disagreement_score":0.0014750045,"about_ca_system_score_codex":0.0005399655,"about_ca_system_score_gemma":0.00073599286,"threshold_uncertainty_score":0.0052620173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018949587,0.0015867045,0.97142965,0.0003560178,0.0005614495,0.00018129939,0.00008492154,0.0021719,0.0046784068],"genre_scores_gemma":[0.61260134,0.0013999644,0.37615567,0.00052528817,0.0011318105,0.00033934697,0.00016491028,0.0001487546,0.0075329286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.00012573999,0.000056881214,0.00014765505,0.00034692534,0.00007183687],"domain_scores_gemma":[0.9991141,0.00022270603,0.000115293136,0.00015543087,0.0003228444,0.00006961482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321196,0.0006505539,0.0004794256,0.00054049515,0.0005871637,0.0014979737,0.0027089342,0.0010177682,0.0032090521],"category_scores_gemma":[0.0025964936,0.00027429458,0.00037740273,0.00041211813,0.00053518923,0.0018821097,0.0007203755,0.0015349612,0.00097142847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007305056,0.00046471308,0.0018520486,0.00055302004,0.00016828577,0.0009261952,0.00024080114,0.15413155,0.19452569,0.254573,0.0124951955,0.379339],"study_design_scores_gemma":[0.00010686707,0.00028459562,0.00032613962,0.000032322172,0.00008185886,0.0005069473,0.000013825768,0.9392607,0.025712734,0.012940854,0.020657837,0.0000752545],"about_ca_topic_score_codex":0.0008054793,"about_ca_topic_score_gemma":0.0007387745,"teacher_disagreement_score":0.0032090521,"about_ca_system_score_codex":0.00066572294,"about_ca_system_score_gemma":0.0009106316,"threshold_uncertainty_score":0.010735333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17547801,0.001713788,0.8178975,0.00034316874,0.00010969252,0.00010225345,0.00002955089,0.0004984721,0.0038275921],"genre_scores_gemma":[0.93392223,0.00038167136,0.06453948,0.000074963056,0.00004720639,0.00004557488,0.000020246696,0.000036130074,0.0009324785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883586,0.00055542204,0.000046585214,0.00013812762,0.00031069948,0.00011342625],"domain_scores_gemma":[0.9963552,0.0021601885,0.0005139796,0.00052689185,0.0002750762,0.00016871629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025286134,0.00048157442,0.0006187196,0.00040168737,0.00084861467,0.0008602041,0.001094751,0.00073270476,0.00059565733],"category_scores_gemma":[0.0053565367,0.00038293056,0.00025513774,0.00039221934,0.0009203022,0.0013560181,0.0006206388,0.0012235759,0.00013811848],"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.00046532394,0.00031407148,0.0023137848,0.00022497239,0.000039587852,0.0005131452,0.00026252694,0.7718191,0.043808855,0.045822665,0.0012270156,0.13318892],"study_design_scores_gemma":[0.000036090438,0.00012000548,0.00043367522,0.000012189731,0.00001542769,0.00018999226,0.000023762206,0.9718703,0.009817464,0.015992904,0.0014746898,0.0000135396585],"about_ca_topic_score_codex":0.0012670206,"about_ca_topic_score_gemma":0.0014995278,"teacher_disagreement_score":0.0025286134,"about_ca_system_score_codex":0.0007897365,"about_ca_system_score_gemma":0.0008524058,"threshold_uncertainty_score":0.013372719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00159299,0.000053288837,0.99590766,0.000037777823,0.000037262464,0.0000616931,0.00009167645,0.0011384473,0.0010791742],"genre_scores_gemma":[0.07759595,0.00016324424,0.9180819,0.000071071365,0.000049993603,0.0005625544,0.00041029052,0.00028508098,0.0027798712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516875,0.0012348247,0.00040228257,0.0008920297,0.0020918285,0.00021021537],"domain_scores_gemma":[0.99441236,0.001973895,0.00047972694,0.0015472341,0.00150023,0.00008644779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041656946,0.001360111,0.00081999693,0.0033807922,0.00080293394,0.0021379478,0.002035928,0.0013008651,0.0043590968],"category_scores_gemma":[0.016782232,0.0008258857,0.0005911145,0.0024405117,0.0008025332,0.0038178838,0.001328496,0.0021791458,0.0022730508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028777702,0.0002626822,0.0041405284,0.0002694738,0.000063967185,0.00011538453,0.0006362354,0.060246374,0.03946529,0.13563785,0.0068682074,0.7520062],"study_design_scores_gemma":[0.000026951173,0.00017678576,0.0012278025,0.00008144179,0.000028776321,0.00022376156,0.00011105782,0.90826046,0.033592883,0.025909234,0.030274108,0.000086672095],"about_ca_topic_score_codex":0.0020571523,"about_ca_topic_score_gemma":0.0011245646,"teacher_disagreement_score":0.0043590968,"about_ca_system_score_codex":0.0013001777,"about_ca_system_score_gemma":0.0009131007,"threshold_uncertainty_score":0.022030532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028796494,0.0006933382,0.96514434,0.0002299176,0.00010373689,0.000058471214,0.00002114543,0.0007603213,0.0041921753],"genre_scores_gemma":[0.7734206,0.00058170484,0.22192028,0.00016323233,0.000117574295,0.00008383031,0.000055372788,0.00009002019,0.0035674272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00005871727,0.000018354223,0.00007498931,0.00014251821,0.00006177531],"domain_scores_gemma":[0.999469,0.00021207117,0.00006638927,0.00008921444,0.00012835502,0.000035117926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018101,0.0003604469,0.00032564034,0.00041220157,0.00047175994,0.00068375806,0.00090221316,0.0003662441,0.0012563715],"category_scores_gemma":[0.0016800426,0.00017744761,0.0002302844,0.00031177886,0.00053378975,0.00068459235,0.0006534057,0.0009227242,0.00023561426],"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.00026374552,0.00014105519,0.0017210495,0.00019069266,0.00006322575,0.00025964444,0.0002578748,0.39063194,0.111187644,0.16561909,0.006081921,0.32358205],"study_design_scores_gemma":[0.000025555544,0.000059945127,0.00029591384,0.000010595323,0.000017694972,0.000116749965,0.000017641945,0.9669153,0.0103142625,0.016518833,0.005687834,0.00001967925],"about_ca_topic_score_codex":0.0015190591,"about_ca_topic_score_gemma":0.001324087,"teacher_disagreement_score":0.0015190591,"about_ca_system_score_codex":0.00055136526,"about_ca_system_score_gemma":0.0007827926,"threshold_uncertainty_score":0.0042030215},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018912544,0.0029366312,0.6456355,0.0070869694,0.0026147312,0.00042704362,0.00040785607,0.0058936607,0.31608513],"genre_scores_gemma":[0.3606663,0.0039463895,0.35866416,0.004918683,0.0020832645,0.0008030769,0.0015694383,0.0025074135,0.26484114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953052,0.0010585125,0.00024440023,0.0009543708,0.0019223824,0.0005151551],"domain_scores_gemma":[0.9915057,0.0020516112,0.00057617953,0.0031097454,0.0018070696,0.0009497013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035075827,0.0008215577,0.0009315166,0.0014589451,0.0022988303,0.0054664356,0.003485686,0.0020572199,0.03652082],"category_scores_gemma":[0.014776055,0.00045853818,0.0007436742,0.0013348217,0.0022145936,0.0073396955,0.0061649587,0.0034886226,0.00994496],"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.00036767032,0.00011253899,0.0012626899,0.00039401863,0.000030693798,0.00042366894,0.00078983174,0.0044224346,0.007520305,0.66207254,0.043097325,0.2795063],"study_design_scores_gemma":[0.000087573244,0.00028952537,0.0006970236,0.00017604836,0.000038726797,0.0017720761,0.00038688243,0.028895043,0.008739446,0.13492997,0.8239019,0.00008584331],"about_ca_topic_score_codex":0.0016998257,"about_ca_topic_score_gemma":0.0018571732,"teacher_disagreement_score":0.03652082,"about_ca_system_score_codex":0.0015118604,"about_ca_system_score_gemma":0.0022724862,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053120293,0.00061024196,0.9369591,0.00056847563,0.00022754437,0.00040257038,0.0001606309,0.0039814315,0.0039697387],"genre_scores_gemma":[0.6199216,0.0003290068,0.3733624,0.00022652313,0.00020827352,0.00024149462,0.00022930448,0.00023401929,0.005247415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794215,0.0007083963,0.00013610335,0.00031410877,0.0005960913,0.00030305394],"domain_scores_gemma":[0.9975165,0.00061126205,0.00025819303,0.00063186605,0.00059898256,0.00038321395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327758,0.0005997033,0.0013057453,0.00069410773,0.0010558829,0.0011906986,0.0030062117,0.0006441606,0.0032142117],"category_scores_gemma":[0.0037766562,0.00039798918,0.00036732122,0.000735047,0.00070165464,0.0017583868,0.0015263763,0.000878604,0.0012530724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020830703,0.0006581819,0.004316666,0.00031931393,0.00018670953,0.00047895376,0.00079407834,0.31134674,0.045312908,0.055644494,0.025810264,0.5530487],"study_design_scores_gemma":[0.00017478889,0.00021838384,0.00044029846,0.00000724294,0.000033223954,0.00020150395,0.000060599352,0.9696652,0.01029915,0.00897411,0.009844496,0.00008092025],"about_ca_topic_score_codex":0.004314655,"about_ca_topic_score_gemma":0.0045422767,"teacher_disagreement_score":0.004314655,"about_ca_system_score_codex":0.001021764,"about_ca_system_score_gemma":0.0020064455,"threshold_uncertainty_score":0.010752618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016970203,0.000060190676,0.9948679,0.00015077743,0.00005098519,0.00002295463,0.000029796973,0.00027451632,0.0028458473],"genre_scores_gemma":[0.22216745,0.00039369593,0.76702124,0.00032253706,0.00027211182,0.00025347582,0.0001890338,0.0003079709,0.00907261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981938,0.00056480424,0.00008815062,0.00023235094,0.0007591572,0.00016166196],"domain_scores_gemma":[0.99896026,0.00032615897,0.00007317168,0.00030890302,0.00023475866,0.000096876465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030185105,0.0008962127,0.0014477706,0.0011619781,0.0012014231,0.0031426568,0.0039653857,0.001936127,0.002834223],"category_scores_gemma":[0.0033785705,0.0007075907,0.0017009194,0.0012136283,0.0021441865,0.004062483,0.0031535728,0.003646451,0.0010241664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016314267,0.00003589253,0.00008834123,0.000025403482,0.000016664475,0.00007829354,0.00008366676,0.044481494,0.00095677737,0.9442043,0.00071878545,0.009294092],"study_design_scores_gemma":[0.000014434443,0.000014127743,0.000030236924,0.000012309423,0.000021797146,0.000039112736,0.00001784695,0.5690518,0.00080934766,0.42339143,0.0065854336,0.000012108671],"about_ca_topic_score_codex":0.0049118944,"about_ca_topic_score_gemma":0.0038529602,"teacher_disagreement_score":0.0049118944,"about_ca_system_score_codex":0.002092912,"about_ca_system_score_gemma":0.002130346,"threshold_uncertainty_score":0.015963614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01774256,0.00066895824,0.97693413,0.00040357254,0.00007630837,0.00004958435,0.000041007333,0.000111871625,0.003972017],"genre_scores_gemma":[0.8293662,0.0023270575,0.16299897,0.00037780622,0.0003406241,0.00027871132,0.00010667954,0.0001345628,0.004069415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954331,0.002365733,0.00022046913,0.00047841785,0.0011066337,0.00039565557],"domain_scores_gemma":[0.97965324,0.015550548,0.0016331974,0.0016104967,0.0010916283,0.00046092793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075523,0.0015045997,0.0012704779,0.001475995,0.0009665585,0.0025808564,0.001966612,0.002384987,0.0024124943],"category_scores_gemma":[0.0336594,0.0008554914,0.0013233287,0.0020403767,0.004782536,0.005290576,0.0024225058,0.0033789817,0.0004349001],"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.000067134264,0.00005505508,0.0007947079,0.000053374748,0.000028579145,0.00011305816,0.00019968869,0.29006183,0.001549354,0.6929323,0.0004649197,0.013679987],"study_design_scores_gemma":[0.000011444563,0.000052145064,0.00019284213,0.000026362048,0.000013531045,0.00007157342,0.000022132652,0.7684716,0.00048244267,0.22951208,0.0011172208,0.000026680274],"about_ca_topic_score_codex":0.002037371,"about_ca_topic_score_gemma":0.0010203609,"teacher_disagreement_score":0.0075523,"about_ca_system_score_codex":0.0019377512,"about_ca_system_score_gemma":0.0010533495,"threshold_uncertainty_score":0.039940834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74908334,0.0014124083,0.24526687,0.00010961179,0.00004373549,0.000081713486,0.0001085443,0.000598626,0.0032951334],"genre_scores_gemma":[0.99327505,0.00022164194,0.006183639,0.000012055561,0.000010614024,0.000021249693,0.000040940835,0.000010597103,0.00022409638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987147,0.00028959732,0.00005144728,0.00017921792,0.0005061705,0.00025889985],"domain_scores_gemma":[0.9974234,0.0011124837,0.00039515537,0.00027764682,0.0006648895,0.00012645723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013407436,0.0009774719,0.00076142343,0.0010890772,0.0004675671,0.0012394583,0.0010171409,0.0006602504,0.00039412038],"category_scores_gemma":[0.00760578,0.00034293218,0.00035968554,0.0014976778,0.00080924644,0.0020494976,0.0007727595,0.00081332936,0.00011039737],"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.0005555224,0.00017838116,0.010140993,0.00012520567,0.00017357194,0.00041638542,0.00017173606,0.9115609,0.025457768,0.007028756,0.0004089637,0.043781858],"study_design_scores_gemma":[0.0000059180857,0.00011428878,0.0015821384,0.000007910918,0.000033489665,0.00010156488,0.000021843995,0.9940043,0.0029517168,0.0010266012,0.00013959965,0.000010719714],"about_ca_topic_score_codex":0.004927696,"about_ca_topic_score_gemma":0.002085596,"teacher_disagreement_score":0.004927696,"about_ca_system_score_codex":0.0013706433,"about_ca_system_score_gemma":0.0007859137,"threshold_uncertainty_score":0.009944737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11413423,0.0013022858,0.8469188,0.0022318775,0.0005899735,0.00035138702,0.00052001316,0.0010107808,0.032940637],"genre_scores_gemma":[0.9637149,0.0011502568,0.020136658,0.0002738475,0.00024394205,0.00043926112,0.00019436888,0.00006778304,0.0137790395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993622,0.00013669394,0.000023674418,0.00010856375,0.0002684466,0.0001005113],"domain_scores_gemma":[0.9991953,0.00028613294,0.0001239851,0.00008287181,0.00023719491,0.000074581614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079048943,0.00074928324,0.0007317791,0.0007183614,0.000783817,0.0013395183,0.0022274484,0.0013688267,0.00204255],"category_scores_gemma":[0.002883633,0.00036093895,0.0006913372,0.00059546944,0.0009868771,0.0021662535,0.0010223157,0.001708522,0.00045247498],"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.000082788836,0.0000873127,0.0005885539,0.00005081324,0.000024936522,0.0003475556,0.00014461823,0.85950285,0.002703595,0.1268815,0.0027938224,0.0067915763],"study_design_scores_gemma":[0.000017665785,0.00002754013,0.00008532207,0.00000589813,0.0000103614375,0.000045936373,0.000008106775,0.98712164,0.00017891821,0.011359239,0.0011297438,0.0000096886315],"about_ca_topic_score_codex":0.0047105807,"about_ca_topic_score_gemma":0.0016704162,"teacher_disagreement_score":0.0047105807,"about_ca_system_score_codex":0.0010894903,"about_ca_system_score_gemma":0.0011000952,"threshold_uncertainty_score":0.0093663335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99148554,0.00060589187,0.0055081286,0.00007655324,0.000034282464,0.000010282131,0.000080467245,0.0003299286,0.0018689856],"genre_scores_gemma":[0.9990226,0.00008036899,0.00056527293,0.000011654224,0.000009279648,0.0000029477683,0.00006374886,0.000012884571,0.00023112202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975299,0.00061870407,0.00017152845,0.0003473774,0.00077172864,0.00056081865],"domain_scores_gemma":[0.9894986,0.006730357,0.0006811455,0.00051922083,0.0021781842,0.00039237482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158345,0.00083355594,0.0009791245,0.0010756381,0.0007491101,0.0015069749,0.0010227701,0.00086171523,0.0017055837],"category_scores_gemma":[0.008284132,0.0002907457,0.0003228339,0.0011819206,0.00083922996,0.0017086774,0.0009716335,0.00069139194,0.00034344452],"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.014714067,0.0011087076,0.028584914,0.00058977405,0.00034828126,0.0013905712,0.0009070855,0.5925813,0.2562802,0.0070738373,0.002178429,0.094242886],"study_design_scores_gemma":[0.000148633,0.0024836096,0.010029672,0.000030814233,0.00014965195,0.0005129343,0.00032727045,0.92846274,0.055357125,0.0019052806,0.0005062601,0.00008593699],"about_ca_topic_score_codex":0.0020202575,"about_ca_topic_score_gemma":0.0012097919,"teacher_disagreement_score":0.002158345,"about_ca_system_score_codex":0.0009240276,"about_ca_system_score_gemma":0.00040165006,"threshold_uncertainty_score":0.011414528},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05424831,0.708496,0.20484611,0.0018990237,0.0019546458,0.00020974327,0.00037551988,0.0012472726,0.026723435],"genre_scores_gemma":[0.2353972,0.6850437,0.06560937,0.00080902013,0.0034996646,0.0001833749,0.0010652944,0.00039189952,0.0080005275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975146,0.0007493783,0.00027538606,0.00036707023,0.00088209886,0.00021145998],"domain_scores_gemma":[0.9944764,0.0028569903,0.0003729896,0.00043114566,0.0017339004,0.00012867305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002427743,0.0010755884,0.0010816313,0.0031782193,0.00051849126,0.0021324656,0.0009475121,0.0010033456,0.0022807166],"category_scores_gemma":[0.00726642,0.0005532733,0.00061626284,0.0054473937,0.000424025,0.0043917503,0.00065062643,0.0013589795,0.0010376129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002877464,0.00015006907,0.004217024,0.004611839,0.00012341108,0.00015153397,0.0002691569,0.007255369,0.009452778,0.012675902,0.012191411,0.9486138],"study_design_scores_gemma":[0.00007192206,0.0034681542,0.019184599,0.006284792,0.0010014157,0.004344605,0.001031667,0.07876459,0.05296232,0.019749114,0.8128237,0.00031314092],"about_ca_topic_score_codex":0.00087044825,"about_ca_topic_score_gemma":0.00050743413,"teacher_disagreement_score":0.0031782193,"about_ca_system_score_codex":0.000614824,"about_ca_system_score_gemma":0.0007676537,"threshold_uncertainty_score":0.012839258},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94403934,0.0021282379,0.043042284,0.0007422006,0.00040342414,0.0003114202,0.0003341191,0.0010077639,0.007991174],"genre_scores_gemma":[0.9934809,0.00043422845,0.004915512,0.0001636246,0.00007048052,0.00006903831,0.00016359652,0.00008666681,0.0006159122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978102,0.00046357338,0.00016421871,0.00030866542,0.00086466316,0.000388717],"domain_scores_gemma":[0.99038494,0.003389869,0.0014937659,0.0019716327,0.0019074451,0.0008524336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035765604,0.00096772646,0.0010206058,0.0014655147,0.00089433487,0.0024912804,0.0020042812,0.0011914565,0.00085650117],"category_scores_gemma":[0.019574165,0.00048050308,0.00073396374,0.0011906634,0.0014871584,0.0035762205,0.0011995741,0.0020796668,0.00028729418],"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.013716615,0.0024157357,0.1433269,0.0012813918,0.0020433324,0.002979101,0.0023449387,0.3949524,0.110677145,0.07273579,0.009397044,0.2441296],"study_design_scores_gemma":[0.000555229,0.0070077176,0.07803325,0.0002289336,0.0009932859,0.0034959663,0.0018531709,0.7931998,0.061471578,0.03838265,0.01416506,0.00061340234],"about_ca_topic_score_codex":0.001490984,"about_ca_topic_score_gemma":0.0015591801,"teacher_disagreement_score":0.0035765604,"about_ca_system_score_codex":0.0007968693,"about_ca_system_score_gemma":0.00064016937,"threshold_uncertainty_score":0.018914878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053903207,0.00013920279,0.94378346,0.0002795183,0.000061145845,0.00016589997,0.000032481432,0.0005131865,0.0011218531],"genre_scores_gemma":[0.7287375,0.00014577436,0.26825005,0.00013035751,0.00006317037,0.0002087283,0.00012083045,0.000095150644,0.0022484516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995758,0.001129803,0.00025115462,0.0004789137,0.001974096,0.0004080777],"domain_scores_gemma":[0.99294853,0.002513566,0.0010042243,0.001500096,0.001682794,0.00035072234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005948951,0.00060505467,0.0010477373,0.0009788563,0.0010179353,0.0015227317,0.0022283525,0.0009648651,0.0024840648],"category_scores_gemma":[0.015380456,0.00067279505,0.00089782645,0.0005438033,0.0016150369,0.0028099953,0.0029944857,0.0026077032,0.00054683833],"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.0017816911,0.00030410645,0.0035031058,0.0004377563,0.0001677181,0.0015881995,0.0041284547,0.54909986,0.06659991,0.15168284,0.0039022225,0.21680413],"study_design_scores_gemma":[0.00009439946,0.00024871368,0.0005683035,0.000041706302,0.00003528735,0.0001943709,0.00018652131,0.9557036,0.010706719,0.029170753,0.0029933369,0.000056324534],"about_ca_topic_score_codex":0.0014070168,"about_ca_topic_score_gemma":0.0008482291,"teacher_disagreement_score":0.005948951,"about_ca_system_score_codex":0.00090674456,"about_ca_system_score_gemma":0.0016022917,"threshold_uncertainty_score":0.031461418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09674133,0.00270465,0.8870389,0.0016382057,0.00021009315,0.000060374306,0.000045857392,0.00033131268,0.01122924],"genre_scores_gemma":[0.86112005,0.0019282212,0.13482134,0.00017976297,0.0001624807,0.00006648218,0.00005806226,0.000052232946,0.0016113627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988967,0.00045463702,0.000039863313,0.000096336786,0.0003986303,0.00011368343],"domain_scores_gemma":[0.9993697,0.00025902543,0.00008382645,0.00009003314,0.00014370348,0.00005377771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983826,0.00035256564,0.00041373516,0.0003177226,0.00058971136,0.0017525011,0.0009585352,0.00072782254,0.00094854855],"category_scores_gemma":[0.0037829373,0.0003430126,0.00026478333,0.0007111168,0.0010072063,0.001588663,0.001121576,0.0010632033,0.00025455534],"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.00019403885,0.000102080434,0.0014015475,0.00026043472,0.000052332758,0.00040980807,0.00017882865,0.4289237,0.025396815,0.37881064,0.004472896,0.15979686],"study_design_scores_gemma":[0.000020228368,0.00006136874,0.000474945,0.00002554541,0.000020340955,0.00010417921,0.000045683246,0.9402676,0.0031870008,0.05040683,0.005367721,0.000018527786],"about_ca_topic_score_codex":0.0025133349,"about_ca_topic_score_gemma":0.0017351848,"teacher_disagreement_score":0.0025133349,"about_ca_system_score_codex":0.0009815698,"about_ca_system_score_gemma":0.0011225234,"threshold_uncertainty_score":0.0071218014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09771795,0.00064197974,0.8896673,0.00022822506,0.00036818715,0.0002620889,0.00026404776,0.001017476,0.009832721],"genre_scores_gemma":[0.7627163,0.000531195,0.23134387,0.00013327465,0.0001411624,0.00026969644,0.00039374444,0.00007117064,0.00439962],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.00007058206,0.000036793146,0.00007102637,0.00010720847,0.000051493276],"domain_scores_gemma":[0.99962854,0.000054770935,0.00004588287,0.000070839866,0.00015316112,0.000046811576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040954,0.00021155592,0.00024416088,0.00045925472,0.00036874428,0.00057414174,0.0013571779,0.0002587854,0.00089521124],"category_scores_gemma":[0.00065531774,0.0001774684,0.00020166952,0.00047295474,0.00035216255,0.0007014237,0.00052881823,0.00048005054,0.0002527683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050731696,0.00018021789,0.0019047857,0.0004523616,0.00005355806,0.00039351213,0.00026036787,0.14294386,0.36613125,0.27867717,0.0090598315,0.19943579],"study_design_scores_gemma":[0.00017761986,0.0009898049,0.0011706946,0.000045604458,0.00008453296,0.0007838742,0.000110462046,0.814922,0.09005948,0.025516469,0.06604271,0.00009681276],"about_ca_topic_score_codex":0.00069346174,"about_ca_topic_score_gemma":0.0012592857,"teacher_disagreement_score":0.0013571779,"about_ca_system_score_codex":0.00059163955,"about_ca_system_score_gemma":0.0006443175,"threshold_uncertainty_score":0.004292667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020167658,0.0029947583,0.958056,0.00039324022,0.0005277782,0.0003539579,0.00011354019,0.0030105165,0.014382567],"genre_scores_gemma":[0.6063114,0.0020074393,0.37334633,0.0007393692,0.00054882356,0.00066486676,0.0003033005,0.00017072828,0.015907718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985291,0.0002761737,0.00011727614,0.0003057623,0.0005358559,0.00023580411],"domain_scores_gemma":[0.9976283,0.0006693231,0.000211004,0.0009648263,0.00035698677,0.00016963526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014501502,0.0013195669,0.00095120113,0.0010775138,0.0010297573,0.0017691499,0.0039197206,0.0011294516,0.0048765396],"category_scores_gemma":[0.003803842,0.00043588955,0.00054444384,0.0009247322,0.0007058693,0.002289686,0.002119253,0.0014086551,0.0018309662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008017084,0.00071440014,0.0015753217,0.00055799,0.00018289073,0.00027442296,0.00035591933,0.06461983,0.07705636,0.13327397,0.016131105,0.70445603],"study_design_scores_gemma":[0.00034480478,0.00067337236,0.0013809352,0.00012459511,0.00031483534,0.0015255255,0.00020383565,0.74524415,0.06953368,0.090517156,0.089914426,0.00022277242],"about_ca_topic_score_codex":0.000819597,"about_ca_topic_score_gemma":0.0011277024,"teacher_disagreement_score":0.0048765396,"about_ca_system_score_codex":0.0007241719,"about_ca_system_score_gemma":0.0009517033,"threshold_uncertainty_score":0.016313672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026194738,0.00017363095,0.9686414,0.00015332657,0.000052612402,0.00008634389,0.00011003277,0.0010665123,0.0035214801],"genre_scores_gemma":[0.5816429,0.00023170478,0.41331923,0.00010587418,0.00006826317,0.00021934751,0.00024526758,0.00036643384,0.0038009312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.00011399073,0.000018518931,0.00007315067,0.00011236762,0.00008432955],"domain_scores_gemma":[0.99943846,0.00025038302,0.00006826277,0.00007890932,0.00011856608,0.0000454059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910083,0.0010674406,0.0010101055,0.00064417906,0.00046511376,0.000850116,0.0013219808,0.0009255167,0.0028182678],"category_scores_gemma":[0.0022402925,0.00061333505,0.00049562403,0.0006703933,0.00068295444,0.0010128138,0.00093723735,0.00096598134,0.00037166208],"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.00011286486,0.000036820857,0.00013105993,0.00003356784,0.000018440925,0.0000308156,0.000031712578,0.9399184,0.0041805287,0.013796871,0.0020375582,0.039671376],"study_design_scores_gemma":[0.000008339249,0.000035976576,0.00003178433,0.0000025425654,0.000005754523,0.000006165071,0.000004677957,0.99457955,0.0005439668,0.00460174,0.00017626339,0.0000032490645],"about_ca_topic_score_codex":0.002201356,"about_ca_topic_score_gemma":0.0026186598,"teacher_disagreement_score":0.0028182678,"about_ca_system_score_codex":0.0009341879,"about_ca_system_score_gemma":0.0012218405,"threshold_uncertainty_score":0.009428024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77233124,0.0010616424,0.21714923,0.00045605208,0.00006007737,0.0000656528,0.00012850198,0.00025236845,0.008495221],"genre_scores_gemma":[0.99679404,0.00012685297,0.002274394,0.00002463396,0.000019198455,0.000010102028,0.000017526012,0.000011973926,0.0007211137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.0001108259,0.000011973969,0.0000477836,0.00016329005,0.000078458535],"domain_scores_gemma":[0.9981187,0.0012049555,0.0002702796,0.00006676785,0.00025348223,0.00008578444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663275,0.0003091605,0.00039752675,0.0007371795,0.0003846819,0.0007560941,0.0010023525,0.00073606014,0.0009966475],"category_scores_gemma":[0.0032728706,0.00028190744,0.0003419712,0.00040066664,0.0010735553,0.00075377943,0.00035331328,0.0003550767,0.0000654406],"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.00019798479,0.00007982208,0.0025186767,0.000103568615,0.000053158517,0.0004802621,0.00013794412,0.8802968,0.016822603,0.09332789,0.00058196904,0.0053993356],"study_design_scores_gemma":[0.0000029088078,0.000013987718,0.00025728325,0.000002650344,0.0000056811027,0.000039851406,0.000006879335,0.9968761,0.0006018144,0.00211794,0.00007153108,0.000003378797],"about_ca_topic_score_codex":0.0031632113,"about_ca_topic_score_gemma":0.000974314,"teacher_disagreement_score":0.0031632113,"about_ca_system_score_codex":0.0015855092,"about_ca_system_score_gemma":0.00066573784,"threshold_uncertainty_score":0.011503756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043534935,0.0002578876,0.99405587,0.00006692819,0.000061774845,0.000052159576,0.0000078915855,0.0005304715,0.00061338407],"genre_scores_gemma":[0.19532587,0.0005186557,0.8007685,0.00014357101,0.00022429934,0.00019193576,0.00007429283,0.00017164169,0.0025813237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992823,0.00016565323,0.000055118748,0.00012108519,0.00031388574,0.0000619654],"domain_scores_gemma":[0.99856204,0.0006611232,0.00013963241,0.00016756816,0.0004083341,0.00006136714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258143,0.0006791147,0.00067552924,0.0008055722,0.0006243132,0.0008972184,0.0016111733,0.00079717115,0.0010547768],"category_scores_gemma":[0.005233792,0.00034226425,0.00030091114,0.0005164662,0.00047974332,0.0018576655,0.00073712255,0.0015913782,0.000589434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042098216,0.00020112198,0.0011609909,0.0001477575,0.000082573984,0.00016058837,0.00035996563,0.14001182,0.04965958,0.039404377,0.004371187,0.7640191],"study_design_scores_gemma":[0.0000787746,0.00012739445,0.00022916902,0.000020032245,0.000035064728,0.0002293715,0.00002146778,0.97047395,0.013308025,0.009044914,0.006391785,0.000040108625],"about_ca_topic_score_codex":0.001091043,"about_ca_topic_score_gemma":0.0008322456,"teacher_disagreement_score":0.0019258143,"about_ca_system_score_codex":0.000618806,"about_ca_system_score_gemma":0.0005629725,"threshold_uncertainty_score":0.010184765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036190015,0.00033073063,0.9931937,0.00015159074,0.000031375228,0.000027362643,0.000022598404,0.00007939344,0.002544295],"genre_scores_gemma":[0.46988475,0.0014280828,0.5129441,0.00016992018,0.00019062035,0.00070310204,0.00012918415,0.00022995485,0.014320233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997106,0.00012556025,0.000008565402,0.000028334636,0.00009881888,0.000028066612],"domain_scores_gemma":[0.99891865,0.0007977211,0.00007083507,0.000044035925,0.0001344539,0.000034292792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012132527,0.0007200516,0.0007985762,0.000618862,0.0006029581,0.0009829107,0.0010880879,0.00090486614,0.0038755678],"category_scores_gemma":[0.0028449069,0.0003884366,0.0005696285,0.0007287484,0.0012070236,0.0009302913,0.0011286712,0.0012928526,0.00032025768],"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.000027927726,0.000024597526,0.00012069179,0.000056330347,0.000016200149,0.000021056603,0.000035960595,0.93321866,0.00047279254,0.046586625,0.00084657007,0.018572655],"study_design_scores_gemma":[0.0000047892104,0.000004142539,0.000013742409,0.0000035225635,0.0000015191852,0.000002899688,0.0000033023107,0.9932088,0.00007240308,0.0063247043,0.00035832042,0.0000017847466],"about_ca_topic_score_codex":0.007010136,"about_ca_topic_score_gemma":0.006689007,"teacher_disagreement_score":0.007010136,"about_ca_system_score_codex":0.0011595588,"about_ca_system_score_gemma":0.0014442159,"threshold_uncertainty_score":0.013938665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1757194,0.00378923,0.8161717,0.00019786277,0.000120569195,0.000053285545,0.00011781329,0.00026228162,0.0035677936],"genre_scores_gemma":[0.9497167,0.0012689652,0.047768455,0.0000480802,0.0001508602,0.000059940605,0.00016044061,0.00005643425,0.0007700492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984842,0.00034112655,0.00007970453,0.00016637234,0.0007965427,0.00013207116],"domain_scores_gemma":[0.9972264,0.0012149358,0.00039702212,0.00035485803,0.0006829697,0.00012370279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657178,0.0005194534,0.0005716526,0.0018235451,0.0003345126,0.0014772255,0.0008727612,0.00072715554,0.0006817839],"category_scores_gemma":[0.007846224,0.00025338796,0.00025243763,0.001005256,0.0011837729,0.002696842,0.000685363,0.000727343,0.00017122606],"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.0003132048,0.00013759598,0.007062236,0.00032771812,0.00010284717,0.00025564077,0.0002438539,0.4477491,0.12589023,0.27698064,0.0012500061,0.13968694],"study_design_scores_gemma":[0.000013063025,0.00017055418,0.003133103,0.000038995382,0.00003161911,0.0003570017,0.00006151268,0.91470444,0.023750613,0.053443287,0.0042399974,0.000055896406],"about_ca_topic_score_codex":0.0005908799,"about_ca_topic_score_gemma":0.00025639532,"teacher_disagreement_score":0.0018235451,"about_ca_system_score_codex":0.0007382164,"about_ca_system_score_gemma":0.0005443245,"threshold_uncertainty_score":0.007751584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13855088,0.0010240844,0.8526443,0.00021258925,0.00009130741,0.00014673841,0.00009674097,0.0013934826,0.0058398913],"genre_scores_gemma":[0.8604689,0.00026689086,0.13724935,0.00006834924,0.000058738777,0.00005621649,0.0001347877,0.00004734955,0.001649415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942696,0.00013949117,0.000036626516,0.000064989916,0.0002102517,0.00012173287],"domain_scores_gemma":[0.9994924,0.00015586831,0.00007852904,0.00007668285,0.00011775504,0.000078743666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075660116,0.00036234924,0.00022942139,0.0005128674,0.0006144643,0.00052004465,0.0008072728,0.00023170319,0.0011870199],"category_scores_gemma":[0.0013107887,0.00024873685,0.00022131592,0.00038804632,0.0004262371,0.0006571233,0.0005245076,0.00047143584,0.000293176],"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.0005032699,0.00031554117,0.001987165,0.00024988205,0.000054082364,0.0002854238,0.00048172066,0.49946854,0.09287821,0.065987304,0.005359621,0.3324293],"study_design_scores_gemma":[0.000047625585,0.00016781308,0.0007798353,0.000011602955,0.000031432606,0.00007874096,0.000047113983,0.9767694,0.0063377274,0.013007181,0.002702112,0.000019317918],"about_ca_topic_score_codex":0.0058541633,"about_ca_topic_score_gemma":0.008352504,"teacher_disagreement_score":0.0058541633,"about_ca_system_score_codex":0.00093308,"about_ca_system_score_gemma":0.0011272153,"threshold_uncertainty_score":0.011640191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032844726,0.0030776656,0.7797716,0.0011092447,0.0024490356,0.000991095,0.0014277921,0.036294613,0.14203414],"genre_scores_gemma":[0.35543433,0.0023514982,0.36064872,0.0017443738,0.0016773712,0.0013553235,0.0043983627,0.0009903689,0.27139965],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991836,0.00012121592,0.000042956148,0.00019346488,0.00037204797,0.0000866301],"domain_scores_gemma":[0.9994962,0.000043784006,0.000022127628,0.00011489129,0.00024261953,0.00008038149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005643753,0.0006658524,0.0007214875,0.001091124,0.0008507416,0.002111376,0.0014667627,0.0011436718,0.036504146],"category_scores_gemma":[0.0007975309,0.00027999948,0.000407638,0.0011771814,0.00039720436,0.0017302008,0.0019192997,0.0010501962,0.019843308],"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.00092959224,0.00034253113,0.0014169392,0.0004934377,0.00016943265,0.000546489,0.00043495672,0.0031896443,0.20932265,0.09802478,0.12336291,0.5617666],"study_design_scores_gemma":[0.00027566255,0.0014468873,0.002485208,0.00014561473,0.00032216034,0.0019144603,0.00011742593,0.08035527,0.09767417,0.015602818,0.7995057,0.00015467324],"about_ca_topic_score_codex":0.0013751673,"about_ca_topic_score_gemma":0.0017974772,"teacher_disagreement_score":0.036504146,"about_ca_system_score_codex":0.00075551216,"about_ca_system_score_gemma":0.0010218064,"threshold_uncertainty_score":0.12211853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6447418,0.00069045427,0.3453345,0.00058443774,0.00018156788,0.00011890164,0.000059036593,0.00033943646,0.007949919],"genre_scores_gemma":[0.9946596,0.00007274835,0.004602894,0.000040401454,0.000015272155,0.000013552087,0.000006870641,0.000008145033,0.00058057846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988186,0.0005447716,0.000040216368,0.00012307534,0.00023731765,0.00023598745],"domain_scores_gemma":[0.995833,0.0027592622,0.00043994974,0.00022735698,0.00050124194,0.00023928277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017946631,0.00045023314,0.00062234706,0.00037854514,0.0005431965,0.00095513836,0.0013402598,0.0007445329,0.0011718794],"category_scores_gemma":[0.00771979,0.0002759726,0.00023470398,0.00055436656,0.0007741407,0.0010757538,0.0006783288,0.0009788582,0.00013464695],"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.0002693304,0.00020653076,0.0016392389,0.00006184423,0.000033854765,0.00027684114,0.00011596236,0.953484,0.01110072,0.01257531,0.0007393999,0.019497082],"study_design_scores_gemma":[0.00001034432,0.000038375358,0.00023457212,0.0000018325098,0.0000049103496,0.000038199323,0.000016220334,0.9958389,0.00114145,0.002445496,0.0002234858,0.00000627008],"about_ca_topic_score_codex":0.0036187186,"about_ca_topic_score_gemma":0.0016059086,"teacher_disagreement_score":0.0036187186,"about_ca_system_score_codex":0.0014198872,"about_ca_system_score_gemma":0.00056886504,"threshold_uncertainty_score":0.010302067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034842394,0.00019571143,0.95997584,0.00019504587,0.000050608392,0.000060211856,0.000015382228,0.0002809874,0.004383824],"genre_scores_gemma":[0.8618815,0.00025496766,0.13521612,0.00008661801,0.00008645815,0.00012925224,0.000023466722,0.000042652955,0.0022789978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.00020327237,0.000028467164,0.00007273381,0.00030300295,0.00007742924],"domain_scores_gemma":[0.9994974,0.00023892395,0.00008023117,0.0000742218,0.00007848332,0.000030661085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009167621,0.0004932257,0.00047361926,0.00030967762,0.0006432257,0.0010429969,0.000911405,0.0007263709,0.00074613024],"category_scores_gemma":[0.002478223,0.00014745047,0.00019850515,0.000319608,0.00092440797,0.0012219942,0.000739567,0.0008277024,0.00018691439],"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.0001253801,0.000100764,0.0010693929,0.000102156344,0.000029453984,0.00024359486,0.00036127793,0.6541662,0.064411454,0.18063068,0.0015621888,0.09719743],"study_design_scores_gemma":[0.000008613937,0.000020586422,0.0001089861,0.0000085572365,0.000005518848,0.00004166006,0.000027243514,0.97610074,0.005322756,0.0166174,0.0017276545,0.000010253428],"about_ca_topic_score_codex":0.0022794043,"about_ca_topic_score_gemma":0.0018091903,"teacher_disagreement_score":0.0022794043,"about_ca_system_score_codex":0.0011122057,"about_ca_system_score_gemma":0.0011164773,"threshold_uncertainty_score":0.008069694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9834172,0.00043549167,0.013414831,0.00008909012,0.000023832556,0.000015131755,0.000057205852,0.00061580737,0.0019314189],"genre_scores_gemma":[0.99833256,0.00005085414,0.0013665075,0.000009444096,0.0000046886325,0.000003161503,0.00003554131,0.000014989223,0.00018231622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990891,0.00023159149,0.000058855025,0.000113082766,0.0002706087,0.00023678345],"domain_scores_gemma":[0.99743265,0.0014137713,0.0002319111,0.00030019684,0.00048682842,0.00013471908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013420723,0.00038417085,0.00045131752,0.0004970254,0.0004569144,0.0010996797,0.0006914651,0.0004984879,0.0016149122],"category_scores_gemma":[0.004243761,0.00023954819,0.0002081326,0.0004124925,0.0004263156,0.0010338775,0.0005234977,0.0004754569,0.00025525404],"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.005912109,0.00055756094,0.023861263,0.00027336934,0.00020321013,0.00030963556,0.00042243185,0.67570037,0.16500084,0.0067164507,0.0014424557,0.119600214],"study_design_scores_gemma":[0.00008872189,0.00070160074,0.0034079382,0.000013329604,0.000040879557,0.000106121726,0.0000849224,0.95366174,0.040100496,0.0012977486,0.00046787434,0.000028662962],"about_ca_topic_score_codex":0.002537961,"about_ca_topic_score_gemma":0.00093734503,"teacher_disagreement_score":0.002537961,"about_ca_system_score_codex":0.0010189246,"about_ca_system_score_gemma":0.0004262656,"threshold_uncertainty_score":0.0073928833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007331178,0.00038519426,0.9881832,0.0003471867,0.00026851433,0.00009487235,0.00003145332,0.0007228367,0.002635475],"genre_scores_gemma":[0.55043054,0.00076477695,0.4398505,0.00056951295,0.00071208616,0.00034641149,0.00013589638,0.0001576935,0.0070326333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984332,0.00022463307,0.00008596104,0.00022297658,0.00089081825,0.0001424926],"domain_scores_gemma":[0.99925,0.00025207674,0.00007851239,0.00010717074,0.00023892132,0.00007330131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145927,0.0005812675,0.00074688264,0.00069862674,0.00067320914,0.0017280082,0.002697006,0.0010887437,0.0015183375],"category_scores_gemma":[0.002156013,0.0003331136,0.0005233884,0.0005838953,0.0009464686,0.0018970303,0.0012102246,0.002500632,0.00032698273],"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.00021121303,0.00036215282,0.0005442985,0.0002582459,0.000112244816,0.00027598863,0.00022500478,0.42138407,0.06855293,0.22997935,0.0061775735,0.27191696],"study_design_scores_gemma":[0.000026722375,0.000032674747,0.000057971833,0.000007473431,0.000013462995,0.000049440358,0.0000060621624,0.9826177,0.004797576,0.008523379,0.0038458502,0.000021694721],"about_ca_topic_score_codex":0.0018156059,"about_ca_topic_score_gemma":0.0013550977,"teacher_disagreement_score":0.002697006,"about_ca_system_score_codex":0.0013623948,"about_ca_system_score_gemma":0.0015084629,"threshold_uncertainty_score":0.0098849535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585368,0.00024431312,0.03298359,0.00017714944,0.000076579876,0.00030772554,0.00014975136,0.0025389998,0.0049851183],"genre_scores_gemma":[0.9689919,0.00009641311,0.029419936,0.000033601278,0.000015985746,0.000068691224,0.00030351378,0.000056784982,0.0010132401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998237,0.000422973,0.000107584696,0.00016729377,0.00077700627,0.0002880445],"domain_scores_gemma":[0.99702805,0.0006673061,0.00020010403,0.0003783728,0.0013927923,0.00033345027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019392264,0.00051180035,0.000625134,0.001014541,0.0004515045,0.0007219222,0.0015484617,0.000712297,0.0015622467],"category_scores_gemma":[0.0041664895,0.00029561136,0.00016170592,0.00096103287,0.0005330774,0.0011714882,0.00041302896,0.0007355073,0.00031988477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008606015,0.0053946087,0.02697741,0.0010233986,0.00028423168,0.000971626,0.0007902587,0.15911213,0.34292725,0.008795289,0.008386274,0.43673152],"study_design_scores_gemma":[0.0012687019,0.015614459,0.019436724,0.00003096315,0.00018861722,0.000527814,0.0003548325,0.72512764,0.2306177,0.00059538556,0.006140945,0.000096182965],"about_ca_topic_score_codex":0.0043758107,"about_ca_topic_score_gemma":0.0016951375,"teacher_disagreement_score":0.0043758107,"about_ca_system_score_codex":0.0009224174,"about_ca_system_score_gemma":0.0007756153,"threshold_uncertainty_score":0.010255694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058772517,0.00012955659,0.9914569,0.000073441275,0.000028999462,0.000055174984,0.000008367184,0.00016628909,0.002204039],"genre_scores_gemma":[0.65294987,0.0006228247,0.34032404,0.00011309775,0.00011938009,0.00042054104,0.000059630274,0.00015734416,0.0052332566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917537,0.0001995367,0.00004686569,0.00017266702,0.00033666796,0.00006887713],"domain_scores_gemma":[0.9985593,0.0006572614,0.0002044534,0.00007767906,0.00046725152,0.000033997858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017810736,0.0009018948,0.0008405553,0.00063488685,0.00055232726,0.001269633,0.0008363394,0.0010908087,0.0023433196],"category_scores_gemma":[0.0038742318,0.0003904231,0.0006125047,0.00035243054,0.0008604287,0.0009411662,0.00064365525,0.0008967847,0.00070201454],"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.00013820668,0.00006212406,0.0004551706,0.00017207483,0.000058803584,0.00016618635,0.00027257638,0.7918897,0.03200982,0.0914039,0.0009170551,0.082454436],"study_design_scores_gemma":[0.000020054455,0.00008077252,0.00006452232,0.000009188965,0.00000970103,0.000035709523,0.0000074349527,0.9909161,0.003619471,0.0043644463,0.0008603662,0.000012342648],"about_ca_topic_score_codex":0.0017753146,"about_ca_topic_score_gemma":0.0009447892,"teacher_disagreement_score":0.0023433196,"about_ca_system_score_codex":0.0008999037,"about_ca_system_score_gemma":0.001209191,"threshold_uncertainty_score":0.009419322},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832566,0.0074856803,0.0751236,0.0004303558,0.00010044952,0.00025124612,0.0003942657,0.0013265244,0.031631205],"genre_scores_gemma":[0.9729171,0.0016721588,0.020220397,0.0000418691,0.0000434104,0.00007598076,0.0003704405,0.000040203002,0.0046185046],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992285,0.00016042597,0.00003589761,0.00007307764,0.0003949142,0.000107323685],"domain_scores_gemma":[0.9979488,0.00072287815,0.00013856888,0.00020094126,0.0009075388,0.00008123686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106418,0.00048277748,0.00033681747,0.0009847999,0.00038336578,0.0006864298,0.0006368998,0.0006475704,0.0026671027],"category_scores_gemma":[0.0033243296,0.00015060417,0.00019215146,0.001193285,0.00021572264,0.001528099,0.00036608422,0.00030149607,0.00060759275],"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.0026779126,0.0006297547,0.016909214,0.0005965824,0.00012089472,0.0003417386,0.00032495594,0.3366754,0.04534007,0.01810819,0.0065986267,0.5716767],"study_design_scores_gemma":[0.0001017748,0.0033431642,0.012049644,0.00009121085,0.00010681095,0.0009867038,0.00029412296,0.8904429,0.0673485,0.0062080007,0.018965155,0.00006211421],"about_ca_topic_score_codex":0.0008222332,"about_ca_topic_score_gemma":0.000671409,"teacher_disagreement_score":0.0026671027,"about_ca_system_score_codex":0.00066538574,"about_ca_system_score_gemma":0.00023418001,"threshold_uncertainty_score":0.0089223385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019234302,0.0002404108,0.97862625,0.00009316153,0.000067011824,0.000035081976,0.00002088485,0.0003903419,0.0012925561],"genre_scores_gemma":[0.9405914,0.00016134653,0.057647385,0.000048794343,0.00005230712,0.00006213254,0.000041860945,0.000028243556,0.001366633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997571,0.000040062212,0.000016825426,0.00005551679,0.00010305605,0.000027416783],"domain_scores_gemma":[0.99971753,0.00008040819,0.00006243596,0.000028898869,0.00008801062,0.000022720697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581234,0.00066270656,0.00044864824,0.0003257034,0.00027468347,0.00060401985,0.000836484,0.00043660856,0.0007208257],"category_scores_gemma":[0.0010132707,0.0001960882,0.0003067372,0.00018923775,0.00046751896,0.00057839433,0.00053202006,0.00051502115,0.00013864406],"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.00016508119,0.00008819507,0.0002363741,0.00011634348,0.000059311802,0.00014258712,0.00012904394,0.77977663,0.04147135,0.037045404,0.001494953,0.13927476],"study_design_scores_gemma":[0.000012694845,0.00008697288,0.000055754397,0.000002808081,0.000008873409,0.00001405253,0.0000030582034,0.9953365,0.0022452048,0.0016925655,0.0005349666,0.000006686767],"about_ca_topic_score_codex":0.0024173327,"about_ca_topic_score_gemma":0.0015074585,"teacher_disagreement_score":0.0024173327,"about_ca_system_score_codex":0.0005500336,"about_ca_system_score_gemma":0.0005163894,"threshold_uncertainty_score":0.0048065186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19823843,0.005649459,0.78700376,0.0009470049,0.00083563174,0.0004354829,0.00012722585,0.0032041376,0.003558846],"genre_scores_gemma":[0.9411959,0.0011358489,0.05582259,0.00012549198,0.00028056419,0.00019152366,0.00008769729,0.00009681338,0.0010635583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839145,0.00062140654,0.00010119727,0.00018151209,0.0005240069,0.00018037818],"domain_scores_gemma":[0.9962125,0.0015068552,0.00043446358,0.0010741239,0.00060938805,0.00016278724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036584209,0.0006452057,0.00078699633,0.0010522256,0.0009106593,0.0014443947,0.0017023473,0.00085149665,0.00046467388],"category_scores_gemma":[0.008427621,0.00039028953,0.0005042458,0.00075167767,0.00084000407,0.0022904703,0.001188635,0.0013293898,0.00018672986],"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.0018717904,0.0005327329,0.00815845,0.00049631053,0.00030394326,0.001506163,0.0003688196,0.6381369,0.060460262,0.04429886,0.00684952,0.2370163],"study_design_scores_gemma":[0.00009764935,0.00019039282,0.0012512102,0.000023499784,0.000118793294,0.00020986456,0.00003195696,0.9711962,0.0076325773,0.014423437,0.0047645285,0.00005992262],"about_ca_topic_score_codex":0.0020923682,"about_ca_topic_score_gemma":0.0011687167,"teacher_disagreement_score":0.0036584209,"about_ca_system_score_codex":0.0011887375,"about_ca_system_score_gemma":0.0009780215,"threshold_uncertainty_score":0.019347787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009122692,0.0004679251,0.98697144,0.00022414068,0.00006438534,0.000040078085,0.000018022898,0.00013329633,0.002957973],"genre_scores_gemma":[0.5250597,0.0015926359,0.46697357,0.00017901509,0.00016504622,0.00018111558,0.0001476309,0.0000991721,0.0056021796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999554,0.0001523485,0.000016403406,0.000035405756,0.00020162523,0.000040137125],"domain_scores_gemma":[0.9996172,0.00013585445,0.000047252666,0.000071149414,0.00010361454,0.00002471815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071224204,0.0005064701,0.00029365602,0.00040653493,0.00040815028,0.0007380142,0.00097600714,0.0006569902,0.00090031023],"category_scores_gemma":[0.0018598018,0.00022768266,0.00030195634,0.00043400266,0.00065731775,0.0009010848,0.00061386346,0.00082966033,0.00040202853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010584577,0.00013983173,0.0007553658,0.00014270318,0.000033889693,0.00026080257,0.00017992254,0.42024642,0.036370352,0.4216113,0.0028980647,0.11725544],"study_design_scores_gemma":[0.000008444304,0.000030220637,0.00010011572,0.000010419301,0.000008383169,0.000060711438,0.000012732704,0.9422186,0.0024132135,0.050918862,0.004208988,0.0000093264325],"about_ca_topic_score_codex":0.0012298152,"about_ca_topic_score_gemma":0.0012712762,"teacher_disagreement_score":0.0012298152,"about_ca_system_score_codex":0.0010662402,"about_ca_system_score_gemma":0.0008464012,"threshold_uncertainty_score":0.0077361465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3316371,0.0008085741,0.6645178,0.00024311033,0.000068031,0.00009013502,0.00009154354,0.0006136873,0.001929848],"genre_scores_gemma":[0.98005575,0.00020837443,0.019106979,0.000019900273,0.000027229102,0.000019699419,0.000045190056,0.000028349612,0.0004886033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915326,0.0002560204,0.000044174238,0.00010127429,0.0002696988,0.00017559646],"domain_scores_gemma":[0.99842536,0.00079555745,0.00023392135,0.00015064573,0.00031445603,0.00008009484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914913,0.00044084678,0.0006777453,0.0007504041,0.0004944762,0.00082944176,0.00081899035,0.00042863665,0.00036228567],"category_scores_gemma":[0.0043589477,0.00025084693,0.00018810765,0.00070947735,0.0005278637,0.00088264,0.0004626653,0.00046550963,0.00009091295],"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.00031571573,0.00011471853,0.0020067806,0.000070569484,0.000027039396,0.00012283628,0.00012643456,0.85623956,0.017823795,0.017052915,0.0015555173,0.10454413],"study_design_scores_gemma":[0.0000035135897,0.000015901225,0.000097418524,0.0000016984227,0.000002624925,0.000012343998,0.000008322494,0.9967038,0.0012476554,0.0017815391,0.00012273912,0.0000025061593],"about_ca_topic_score_codex":0.0061484827,"about_ca_topic_score_gemma":0.0046629137,"teacher_disagreement_score":0.0061484827,"about_ca_system_score_codex":0.0016819984,"about_ca_system_score_gemma":0.0012179055,"threshold_uncertainty_score":0.0122253895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2097785,0.0014043035,0.7842593,0.00043166566,0.00007933744,0.000040177776,0.000026310889,0.00009345337,0.0038869865],"genre_scores_gemma":[0.989717,0.0002767617,0.009236774,0.0000293436,0.000040439714,0.000033815722,0.000009629524,0.000012653269,0.0006436277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.00030172613,0.000025922964,0.00009563662,0.00025254604,0.00019195933],"domain_scores_gemma":[0.99803907,0.0013599248,0.0002488651,0.000085583946,0.00018186744,0.00008464109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352756,0.0007634352,0.0007099745,0.0007530682,0.00043332324,0.001429154,0.0012922316,0.0008158043,0.00057238666],"category_scores_gemma":[0.0061616525,0.00043942698,0.0003737281,0.00052113854,0.0012167009,0.0019558903,0.0011355354,0.0007978357,0.00006923432],"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.000114135306,0.00003582444,0.0004810455,0.000041726733,0.000027459144,0.0000895088,0.00008626797,0.89902353,0.00674983,0.083270065,0.00016721075,0.009913383],"study_design_scores_gemma":[0.0000031570032,0.000007242093,0.00005115287,0.0000024746919,0.0000038513886,0.000009598443,0.0000060748343,0.99285275,0.00041912383,0.006589479,0.000051764582,0.0000033013346],"about_ca_topic_score_codex":0.0031554638,"about_ca_topic_score_gemma":0.0012204715,"teacher_disagreement_score":0.0031554638,"about_ca_system_score_codex":0.0016239206,"about_ca_system_score_gemma":0.0010277374,"threshold_uncertainty_score":0.011782348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22639613,0.0019756528,0.7608019,0.00053611625,0.00004842864,0.000042737065,0.00006717395,0.0002846776,0.009847122],"genre_scores_gemma":[0.98780257,0.00061618275,0.01046098,0.00008568363,0.000030291403,0.000036990095,0.00003713576,0.000045478635,0.000884734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989429,0.00038808052,0.000042074207,0.00011039618,0.0003441283,0.00017248697],"domain_scores_gemma":[0.99001396,0.0068994975,0.0012541274,0.00042948785,0.0011881542,0.00021493455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335857,0.0007269325,0.00065174885,0.0010001241,0.00048053995,0.001146474,0.0013439173,0.0007600648,0.0016594392],"category_scores_gemma":[0.018750338,0.00031751607,0.00033069582,0.00068891916,0.001299339,0.0028948123,0.0010717763,0.0013451825,0.00018536851],"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.00009877949,0.000057919417,0.001248579,0.000101903126,0.00003452377,0.00009831756,0.00023924936,0.6991389,0.0054944367,0.2796434,0.0006754252,0.013168683],"study_design_scores_gemma":[0.000003615588,0.000024791992,0.00015502475,0.000015709142,0.000008012227,0.00003529471,0.000027835178,0.9395495,0.001047574,0.058791067,0.00033399364,0.0000074757213],"about_ca_topic_score_codex":0.0013768511,"about_ca_topic_score_gemma":0.00069798384,"teacher_disagreement_score":0.002335857,"about_ca_system_score_codex":0.001366419,"about_ca_system_score_gemma":0.0006070854,"threshold_uncertainty_score":0.012353361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939057,0.00017842487,0.0030549946,0.00013586425,0.000033245025,0.000009465222,0.00008090781,0.00029936538,0.0023020518],"genre_scores_gemma":[0.99960774,0.000021565356,0.0001864411,0.000021197311,0.000004456974,0.0000018264852,0.000022198052,0.000013761609,0.000120854274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992644,0.00017839175,0.000026399752,0.00010295517,0.0001670345,0.00026072847],"domain_scores_gemma":[0.99389994,0.0044697816,0.0004635551,0.0002749277,0.00060098607,0.000290866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879016,0.00032173545,0.00024311343,0.00040066912,0.00044359994,0.0005237779,0.00036112207,0.00068847847,0.001138065],"category_scores_gemma":[0.005732861,0.00019715061,0.00013713582,0.0006154962,0.0004841974,0.0005497474,0.00026377293,0.00059315213,0.00024368295],"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.0028823412,0.0007424643,0.049241543,0.00017318845,0.00010581832,0.0020814878,0.0004896939,0.7394832,0.15577222,0.0020666076,0.0032932837,0.043668125],"study_design_scores_gemma":[0.00014311742,0.002235712,0.071302235,0.000053253003,0.00018693517,0.0020675655,0.000525497,0.7659495,0.15414608,0.0010929179,0.0021680705,0.00012919585],"about_ca_topic_score_codex":0.0026360054,"about_ca_topic_score_gemma":0.0025942642,"teacher_disagreement_score":0.0026360054,"about_ca_system_score_codex":0.0007494736,"about_ca_system_score_gemma":0.000357855,"threshold_uncertainty_score":0.0054377913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3214677,0.0011303494,0.66923845,0.00078839797,0.00014298504,0.00008679695,0.00013825715,0.00033735298,0.0066697327],"genre_scores_gemma":[0.98938507,0.0004139306,0.007917832,0.000053805776,0.00005162158,0.000049796006,0.000057210982,0.000030441402,0.0020403047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990139,0.00026723294,0.000036446323,0.00008847125,0.00040316692,0.00019079562],"domain_scores_gemma":[0.9940712,0.0041705193,0.0006930164,0.00021750017,0.0006346565,0.00021305427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023961698,0.0006578934,0.0006681192,0.0009908822,0.0005529283,0.0010063325,0.0012695114,0.000750844,0.001867845],"category_scores_gemma":[0.010104017,0.00043939264,0.00054663065,0.0007249028,0.0014408976,0.0014364285,0.0006614449,0.0012003548,0.0001777904],"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.00010410917,0.000063989624,0.0017897356,0.000060216305,0.00003681637,0.00018393026,0.00010963366,0.9131123,0.003115123,0.076335296,0.00039787666,0.004691038],"study_design_scores_gemma":[0.0000029185037,0.00000772466,0.0001396325,0.0000018233267,0.000002982715,0.000008247613,0.0000057852494,0.99648404,0.00013310299,0.0031514105,0.00005983024,0.0000025099644],"about_ca_topic_score_codex":0.008303043,"about_ca_topic_score_gemma":0.0031545397,"teacher_disagreement_score":0.008303043,"about_ca_system_score_codex":0.0024224976,"about_ca_system_score_gemma":0.001033207,"threshold_uncertainty_score":0.017576516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028951855,0.0004674559,0.93108237,0.00042770797,0.0004282753,0.00047708492,0.0002276465,0.005783195,0.032154437],"genre_scores_gemma":[0.8197984,0.00059867627,0.14521289,0.00074073614,0.00045666014,0.0005448312,0.0005530686,0.00077373086,0.03132094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953975,0.0006854431,0.0002534497,0.00064246176,0.0022010014,0.00082012126],"domain_scores_gemma":[0.9855317,0.0034327349,0.0011202827,0.007073652,0.0025589208,0.00028271152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004348726,0.0010300766,0.0009701516,0.0009367209,0.0012183093,0.003789504,0.0038984078,0.0020221928,0.016570566],"category_scores_gemma":[0.012613084,0.00039458487,0.0011122624,0.001041699,0.0015299218,0.003552634,0.0029369032,0.0024736547,0.0035789742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015742994,0.0009930579,0.00514727,0.0004703595,0.00019630457,0.00088775036,0.0009770774,0.10057126,0.09466965,0.36878082,0.034386035,0.3913461],"study_design_scores_gemma":[0.00019945404,0.00029475684,0.0007466446,0.00008058211,0.000088608045,0.0006410554,0.00010117918,0.72061616,0.10721459,0.08443027,0.085456796,0.00012980754],"about_ca_topic_score_codex":0.0014296761,"about_ca_topic_score_gemma":0.0007860655,"teacher_disagreement_score":0.016570566,"about_ca_system_score_codex":0.0014433861,"about_ca_system_score_gemma":0.0016143434,"threshold_uncertainty_score":0.05543405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59042376,0.00049956277,0.40146908,0.00019396149,0.00008964024,0.00017305276,0.000025645208,0.0026530654,0.0044721966],"genre_scores_gemma":[0.97504586,0.000061672494,0.023981068,0.000029684397,0.000010098847,0.000025474279,0.00001504104,0.000027930782,0.00080322375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906355,0.00025651575,0.00003336984,0.00013780252,0.00033958774,0.00016919282],"domain_scores_gemma":[0.9982565,0.00049740844,0.0001950041,0.00025862147,0.00062544306,0.0001669628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517796,0.0003495164,0.00051411643,0.00051501696,0.00061963015,0.00095128716,0.0013565659,0.0004765706,0.00080837705],"category_scores_gemma":[0.003119927,0.00024627533,0.00018183251,0.0003430996,0.00067575945,0.0009209464,0.0005456029,0.0005116218,0.00013403437],"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.0012656811,0.0004456687,0.012465447,0.00018327555,0.000179243,0.00030454242,0.00045330345,0.72773904,0.123717114,0.022315832,0.003239036,0.1076918],"study_design_scores_gemma":[0.00006126142,0.00041301345,0.0011449401,0.000010184765,0.00006462816,0.000057974208,0.000039912786,0.97757405,0.018095685,0.0013074069,0.0012072697,0.000023695131],"about_ca_topic_score_codex":0.0051551163,"about_ca_topic_score_gemma":0.0031658541,"teacher_disagreement_score":0.0051551163,"about_ca_system_score_codex":0.0011181851,"about_ca_system_score_gemma":0.00097206916,"threshold_uncertainty_score":0.010250211},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869523,0.0004631236,0.011205305,0.00005005457,0.000028219403,0.000042791165,0.000022437125,0.00017413324,0.0010615902],"genre_scores_gemma":[0.99740857,0.000077285804,0.0023121284,0.000010436529,0.000009749907,0.000008494408,0.00001911907,0.0000064302612,0.0001478052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977481,0.00096690055,0.00014388589,0.00016374903,0.00064925157,0.00032803963],"domain_scores_gemma":[0.9938958,0.003711272,0.0005883048,0.00030512532,0.0012594147,0.00024007873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036765242,0.00078518764,0.00052462885,0.0009974341,0.0004124215,0.00065702904,0.0006454493,0.00058947,0.0005822015],"category_scores_gemma":[0.007926212,0.0001745059,0.00023181702,0.00043663313,0.00064327504,0.0007943613,0.0004161675,0.00048547826,0.000057001656],"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.009800673,0.0014050369,0.021938033,0.0004442268,0.00035606924,0.00024938563,0.00039988974,0.65384644,0.12620355,0.0041112504,0.0007689494,0.18047652],"study_design_scores_gemma":[0.0002462512,0.0047635757,0.0065999576,0.00001825118,0.00014012944,0.000118575,0.0000933571,0.9385623,0.04867518,0.00034225226,0.00037712144,0.00006309903],"about_ca_topic_score_codex":0.0033329227,"about_ca_topic_score_gemma":0.0022412562,"teacher_disagreement_score":0.0036765242,"about_ca_system_score_codex":0.0008790344,"about_ca_system_score_gemma":0.00037410506,"threshold_uncertainty_score":0.019443512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28551078,0.0011095639,0.6837704,0.0008832782,0.00021572833,0.000098124896,0.000073835814,0.0002767311,0.028061612],"genre_scores_gemma":[0.98223466,0.00039320302,0.014024894,0.000069757545,0.000046318157,0.000051224073,0.000016339316,0.00002431268,0.0031392334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.00004894592,0.0000064770093,0.000020626396,0.00006805314,0.000023021494],"domain_scores_gemma":[0.9997713,0.00009842523,0.000047320784,0.000027097465,0.000033154345,0.00002274117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920431,0.0002894149,0.00038366322,0.0004266983,0.0003786128,0.0005464251,0.00045537777,0.0007818621,0.0012646285],"category_scores_gemma":[0.0008250814,0.00021784019,0.00043981735,0.000180005,0.0009283397,0.00077326957,0.0005033723,0.00062176574,0.00020825249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006048301,0.000056748082,0.0005910709,0.00008531042,0.000025687856,0.00056875433,0.0002834433,0.37761065,0.031204944,0.5818604,0.00071780436,0.0069347755],"study_design_scores_gemma":[0.000018135648,0.000034241246,0.00021048647,0.000008324409,0.0000072497533,0.00010072771,0.000022467375,0.9337753,0.0015687434,0.06328344,0.00095780607,0.00001301735],"about_ca_topic_score_codex":0.0011318803,"about_ca_topic_score_gemma":0.0005055939,"teacher_disagreement_score":0.0012646285,"about_ca_system_score_codex":0.00055265194,"about_ca_system_score_gemma":0.00035834167,"threshold_uncertainty_score":0.0042306185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8283967,0.004036189,0.15516195,0.00039152836,0.000120480414,0.0003475454,0.00035005505,0.00070784887,0.01048777],"genre_scores_gemma":[0.9834902,0.0007031056,0.014629301,0.000030602536,0.000025648018,0.000048314778,0.00009085427,0.000021772401,0.00096019736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99714357,0.0009875778,0.00016212702,0.0002628476,0.0009685622,0.00047534768],"domain_scores_gemma":[0.9917556,0.0050067976,0.00059786724,0.0008708064,0.0014451846,0.00032378195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027602161,0.00046836023,0.00093139545,0.0014369211,0.00094113214,0.0014726858,0.0014164654,0.00077233836,0.0031991315],"category_scores_gemma":[0.009586335,0.00022712564,0.0004750655,0.0018197143,0.0008468872,0.0034382395,0.0010162281,0.00069901336,0.00019338606],"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.008295232,0.0013337878,0.009387814,0.0016343101,0.0005231712,0.00037808312,0.0007593803,0.55850035,0.04975167,0.06613306,0.0038055421,0.29949751],"study_design_scores_gemma":[0.00028913716,0.0035926558,0.0030130937,0.000073773044,0.00019975241,0.00038868494,0.0003034365,0.9523901,0.022631938,0.011346507,0.005672542,0.000098329685],"about_ca_topic_score_codex":0.0018635083,"about_ca_topic_score_gemma":0.0013264461,"teacher_disagreement_score":0.0031991315,"about_ca_system_score_codex":0.002080219,"about_ca_system_score_gemma":0.0006148079,"threshold_uncertainty_score":0.015093088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015096295,0.001609341,0.97091246,0.001392542,0.00019200738,0.000109947025,0.000024250225,0.000076364704,0.010586751],"genre_scores_gemma":[0.8283025,0.002675536,0.15871666,0.0002531438,0.0005996215,0.0002954751,0.000039421408,0.00010886272,0.00900866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790776,0.0011087228,0.000052016923,0.00016593444,0.0006326636,0.00013297664],"domain_scores_gemma":[0.9980433,0.001291323,0.0001345008,0.000114764116,0.00030811364,0.000107974716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026733493,0.0010579707,0.0012252033,0.0011187375,0.0010433552,0.0024829356,0.0030315307,0.0025318952,0.002202913],"category_scores_gemma":[0.008281586,0.00064058707,0.00062838924,0.0015764425,0.0023011512,0.0040905983,0.0015813757,0.001788243,0.0003155738],"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.000029927405,0.00004937509,0.0002963917,0.00006205439,0.000040200277,0.00011285033,0.000073128824,0.79034483,0.00057316077,0.18243128,0.0011389318,0.02484788],"study_design_scores_gemma":[0.0000114639715,0.000021822098,0.000054831617,0.000007825895,0.0000099415565,0.000039848608,0.000022370124,0.92575026,0.00013840506,0.07288217,0.0010514987,0.000009528942],"about_ca_topic_score_codex":0.0026160853,"about_ca_topic_score_gemma":0.0023557083,"teacher_disagreement_score":0.0030315307,"about_ca_system_score_codex":0.0019776705,"about_ca_system_score_gemma":0.0014406726,"threshold_uncertainty_score":0.014349043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088205054,0.00066386454,0.89280933,0.0010843024,0.00032427447,0.00023187895,0.0009256199,0.00041414684,0.015341537],"genre_scores_gemma":[0.9163839,0.0011917212,0.062349197,0.00056670565,0.00042015506,0.00051162083,0.00090009044,0.000088018984,0.01758858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00020649357,0.00004952855,0.00016380538,0.00035241668,0.000117311516],"domain_scores_gemma":[0.99867463,0.00049832533,0.00021245745,0.00017743767,0.0003251413,0.00011200132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011548646,0.0005410317,0.00072536163,0.001014891,0.0005799223,0.001347615,0.00234549,0.0017936724,0.0026097156],"category_scores_gemma":[0.003731215,0.00038531906,0.00089438463,0.0009147971,0.0009552262,0.0018455742,0.000806761,0.0012820362,0.0009795144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007172779,0.00013418599,0.0029996731,0.00010635017,0.000047039335,0.0008485949,0.00025589557,0.2792399,0.0045507103,0.69714177,0.004541653,0.010062481],"study_design_scores_gemma":[0.000021710965,0.000036842735,0.00038055284,0.000010140211,0.000016601887,0.00037553866,0.000030637464,0.9221615,0.000439939,0.072392136,0.004108895,0.000025631318],"about_ca_topic_score_codex":0.0026329372,"about_ca_topic_score_gemma":0.0016948711,"teacher_disagreement_score":0.0026329372,"about_ca_system_score_codex":0.0011374397,"about_ca_system_score_gemma":0.0010511086,"threshold_uncertainty_score":0.0087304115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050925013,0.004798408,0.93701404,0.0005907253,0.00032137457,0.00021765956,0.000057933128,0.0014812979,0.0045935563],"genre_scores_gemma":[0.9206578,0.0020354143,0.073212646,0.00016069927,0.00022521066,0.00021553994,0.00007644817,0.00006082692,0.003355434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855703,0.00053476734,0.00008465271,0.00011140046,0.0005578098,0.00015435803],"domain_scores_gemma":[0.99787354,0.0013393941,0.00020963662,0.00010450205,0.00032658933,0.00014636613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017369534,0.00057399675,0.00076834165,0.00070093456,0.0011202829,0.0015717908,0.0014233793,0.00072264526,0.0012870394],"category_scores_gemma":[0.007344415,0.0002078173,0.0003002566,0.0007313901,0.00081563054,0.0010706756,0.00088619493,0.001175655,0.00021819379],"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.00049946044,0.00019204785,0.0011682963,0.00028278164,0.00006230411,0.00023458853,0.00038924886,0.70613694,0.014322793,0.07905142,0.003973368,0.1936868],"study_design_scores_gemma":[0.000039794395,0.00004598562,0.00012293593,0.000010277722,0.0000093770905,0.000039526305,0.000014695604,0.9861813,0.0016328099,0.01007229,0.0018160231,0.000015029846],"about_ca_topic_score_codex":0.0054872134,"about_ca_topic_score_gemma":0.0026444898,"teacher_disagreement_score":0.0054872134,"about_ca_system_score_codex":0.0019054253,"about_ca_system_score_gemma":0.001707118,"threshold_uncertainty_score":0.01382488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72435975,0.003837163,0.26302603,0.0006733422,0.00012659408,0.000050168175,0.0001230147,0.00046740862,0.0073365234],"genre_scores_gemma":[0.9962984,0.00019632994,0.0032283464,0.000017256361,0.00001658686,0.0000089653995,0.000014375722,0.000010801011,0.00020888116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992731,0.00030358226,0.00003246055,0.00006556617,0.00018929767,0.00013608982],"domain_scores_gemma":[0.9953181,0.0035843817,0.00046477778,0.00012316818,0.00043581004,0.00007368687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017047452,0.0003865661,0.0003101672,0.0005543135,0.00049871695,0.0011804664,0.00059873954,0.00045928993,0.001018256],"category_scores_gemma":[0.0078053726,0.00018446575,0.00019178775,0.00043715935,0.0007013217,0.0011997317,0.00045014755,0.0006118188,0.00006311155],"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.0007992135,0.00010367541,0.0054740384,0.00017572723,0.0000709707,0.00026784878,0.00022188827,0.8065477,0.071958415,0.076816894,0.001233583,0.03633],"study_design_scores_gemma":[0.000016539558,0.00004916444,0.00047684557,0.000008259355,0.000017150249,0.00003436708,0.000016499464,0.98804015,0.0065790103,0.0044032573,0.00035000872,0.000008643621],"about_ca_topic_score_codex":0.0045456802,"about_ca_topic_score_gemma":0.0020029587,"teacher_disagreement_score":0.0045456802,"about_ca_system_score_codex":0.0012622211,"about_ca_system_score_gemma":0.0009675205,"threshold_uncertainty_score":0.009158075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8220295,0.00051589136,0.17051896,0.00024491485,0.000026518568,0.0000480476,0.000102641534,0.00044968742,0.006063872],"genre_scores_gemma":[0.9973055,0.00009405933,0.0022657525,0.000009608362,0.000008219667,0.000009333087,0.00003486185,0.000012278083,0.0002603628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.00016304952,0.000011962034,0.000040839575,0.00020055701,0.000094723044],"domain_scores_gemma":[0.99852484,0.00091968797,0.00011292904,0.00007072164,0.00032466033,0.000047176767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935945,0.00042546482,0.00054347666,0.0006201004,0.0003617859,0.0004718389,0.00047185124,0.00040296375,0.0004896445],"category_scores_gemma":[0.0032333282,0.0001447584,0.00019403305,0.0005471647,0.0004905503,0.00054133474,0.00032259178,0.00035641808,0.000065953514],"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.00015801322,0.000059770922,0.0035646698,0.000045723315,0.000025702055,0.00018627175,0.00008661804,0.956714,0.014795957,0.0062837945,0.0005697649,0.017509613],"study_design_scores_gemma":[0.000001300078,0.000024736464,0.0005639478,0.000001077259,0.000002530674,0.000021352473,0.000010445778,0.9976749,0.0011187181,0.00052523374,0.00005294453,0.0000028332151],"about_ca_topic_score_codex":0.005041007,"about_ca_topic_score_gemma":0.0017524593,"teacher_disagreement_score":0.005041007,"about_ca_system_score_codex":0.0015184256,"about_ca_system_score_gemma":0.00037179372,"threshold_uncertainty_score":0.0110170245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070645384,0.00012747571,0.9262531,0.000058148238,0.000036228193,0.00003462551,0.000058948073,0.00024108165,0.0025450164],"genre_scores_gemma":[0.833314,0.00018841229,0.16302623,0.00005929498,0.000029507062,0.000085840686,0.000107540574,0.00005459994,0.003134674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961394,0.0000871084,0.000023649938,0.00005169307,0.00013725094,0.00008637012],"domain_scores_gemma":[0.99936324,0.00020447171,0.000080486156,0.00019878821,0.00010918342,0.000043818196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068735576,0.00027175064,0.0004208062,0.00034835775,0.00030033017,0.0007098974,0.0013117534,0.00026381746,0.0020285423],"category_scores_gemma":[0.0022742136,0.00018946017,0.0004142573,0.0006432992,0.00064723723,0.0010138844,0.000671834,0.0006740007,0.00025168876],"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.00020132383,0.0000531431,0.0010190025,0.000047303158,0.000024143876,0.000108252505,0.00010888825,0.7519021,0.0072622946,0.19823956,0.0007957512,0.040238183],"study_design_scores_gemma":[0.000008401088,0.000023399223,0.00007121522,0.000002199826,0.00000375721,0.000013371568,0.00000676379,0.98665434,0.00088783464,0.011505964,0.0008186178,0.000004179727],"about_ca_topic_score_codex":0.0041809375,"about_ca_topic_score_gemma":0.002774804,"teacher_disagreement_score":0.0041809375,"about_ca_system_score_codex":0.001043042,"about_ca_system_score_gemma":0.0011675762,"threshold_uncertainty_score":0.008313179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004374163,0.00058851315,0.98764336,0.00012750154,0.000048251633,0.00006532655,0.000079613295,0.00026162612,0.0068116677],"genre_scores_gemma":[0.4850643,0.00178374,0.5050488,0.00020879695,0.00032411845,0.0005610266,0.00037070442,0.00032071405,0.006317786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868995,0.0005642745,0.000040513623,0.00011414458,0.00042127605,0.00016977741],"domain_scores_gemma":[0.99872476,0.000787571,0.000104316656,0.000110435554,0.00022086849,0.000052033105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015953515,0.00144689,0.0010615345,0.0019708017,0.00071688415,0.0017808371,0.001761759,0.0010566299,0.004900929],"category_scores_gemma":[0.0046476815,0.0005638392,0.00096756243,0.0014451019,0.0009969975,0.001227795,0.00087206095,0.0012338391,0.00087487814],"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.000032744072,0.000028066686,0.00031186844,0.00009399231,0.000038093855,0.00010058749,0.0000489069,0.8876266,0.001117741,0.08224668,0.0020589032,0.026295872],"study_design_scores_gemma":[0.0000056906647,0.000015570586,0.000048609825,0.000014653613,0.00000662701,0.000024589946,0.000009781707,0.97228616,0.00030361707,0.025755363,0.001522355,0.0000069782823],"about_ca_topic_score_codex":0.0033562419,"about_ca_topic_score_gemma":0.0018409567,"teacher_disagreement_score":0.004900929,"about_ca_system_score_codex":0.0017535825,"about_ca_system_score_gemma":0.0011658092,"threshold_uncertainty_score":0.01639527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038438688,0.0005255432,0.8525769,0.00028058226,0.00015929749,0.00037733358,0.0032698258,0.107208475,0.031758226],"genre_scores_gemma":[0.079741545,0.0012314534,0.87424666,0.00032033978,0.00015423195,0.0008499804,0.008486201,0.012988134,0.0219815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985398,0.00023975522,0.0001595397,0.00021532139,0.0006768966,0.00016868017],"domain_scores_gemma":[0.99528706,0.0024775194,0.00029732514,0.00075048354,0.0010464583,0.00014114143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617242,0.0017303812,0.00076583837,0.0038460207,0.0006203469,0.0030807822,0.0030156476,0.0011864393,0.030636664],"category_scores_gemma":[0.011231305,0.0010269436,0.001183056,0.0023153652,0.0005690899,0.0029202201,0.0016332344,0.0022188493,0.013980588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002789413,0.0004057213,0.0029901853,0.0011293271,0.00010863658,0.00096041925,0.00075506204,0.12022664,0.01081119,0.09865227,0.12866807,0.63501346],"study_design_scores_gemma":[0.00015347936,0.00008794417,0.001630292,0.00036320247,0.00008048897,0.0012219398,0.000171804,0.45960242,0.034363095,0.08244145,0.41972205,0.00016186497],"about_ca_topic_score_codex":0.0030158968,"about_ca_topic_score_gemma":0.0019837248,"teacher_disagreement_score":0.030636664,"about_ca_system_score_codex":0.0008755307,"about_ca_system_score_gemma":0.0014199128,"threshold_uncertainty_score":0.10248989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027437646,0.00024571974,0.971628,0.00007118418,0.000015919366,0.000017607561,0.000021372754,0.00015345795,0.0004089871],"genre_scores_gemma":[0.9008293,0.0003213283,0.09790142,0.000022365703,0.000058794314,0.000067715606,0.000089892565,0.000046685218,0.0006625977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909985,0.00040232664,0.000034985376,0.00011860394,0.00026278122,0.00008150068],"domain_scores_gemma":[0.9984464,0.0010483892,0.0001439579,0.000089777284,0.00022423195,0.000047332047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016300358,0.00049048883,0.0006359842,0.00067307794,0.00037266326,0.0012657709,0.0008423822,0.00068440614,0.00044837012],"category_scores_gemma":[0.009231089,0.00043440767,0.0002297642,0.0004644961,0.00063543464,0.0013049503,0.0008687782,0.0007834604,0.00008811534],"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.00008586422,0.000029930983,0.0008556933,0.0000351187,0.000023434583,0.000027034332,0.000047273967,0.9228754,0.0049136346,0.017647637,0.00034749237,0.05311139],"study_design_scores_gemma":[0.000002397428,0.000008491931,0.00016259245,0.0000025006455,0.0000022523943,0.0000034343473,0.000003001662,0.9963565,0.00066220533,0.0026832556,0.00010939745,0.0000039995584],"about_ca_topic_score_codex":0.006938629,"about_ca_topic_score_gemma":0.0030890398,"teacher_disagreement_score":0.006938629,"about_ca_system_score_codex":0.0010512618,"about_ca_system_score_gemma":0.0010480144,"threshold_uncertainty_score":0.013796508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242587,0.00026883412,0.91608083,0.0003121539,0.00021127734,0.00029633948,0.00008256264,0.003163512,0.007158689],"genre_scores_gemma":[0.74438035,0.00012124267,0.24855076,0.00023261362,0.000114142706,0.0001777752,0.0001307677,0.00018727087,0.0061051864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936074,0.00009797769,0.000044460772,0.00017639702,0.00021975105,0.00010060523],"domain_scores_gemma":[0.99885917,0.00035769373,0.000069238304,0.00018685254,0.00041184766,0.00011528746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292391,0.0005826959,0.00061989005,0.00092283584,0.0007934134,0.0012154719,0.0023540524,0.00085025,0.0031083806],"category_scores_gemma":[0.0021826313,0.0002882572,0.00022798135,0.00041335137,0.00064268673,0.0008345461,0.00067793584,0.0012562554,0.0007936587],"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.001858104,0.0006639126,0.0061708135,0.0000823676,0.00014128811,0.00018703268,0.00032299187,0.07577133,0.062193155,0.017256048,0.0068174526,0.8285355],"study_design_scores_gemma":[0.00016527392,0.00022755917,0.0018503526,0.000012015399,0.000059474387,0.00021451645,0.000038177102,0.9572495,0.031009676,0.0036068878,0.0055019325,0.00006465606],"about_ca_topic_score_codex":0.0039700875,"about_ca_topic_score_gemma":0.0046803537,"teacher_disagreement_score":0.0039700875,"about_ca_system_score_codex":0.0008139345,"about_ca_system_score_gemma":0.0011668436,"threshold_uncertainty_score":0.010398567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33275908,0.0025456809,0.6233806,0.0066073267,0.00015768976,0.00013084715,0.0007489221,0.0006254758,0.033044476],"genre_scores_gemma":[0.97986907,0.0012858477,0.01698873,0.00016252787,0.0002202406,0.000086980464,0.00022399516,0.00009425931,0.0010684173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745744,0.0017151607,0.00008203466,0.00024455437,0.00037113336,0.00012976113],"domain_scores_gemma":[0.95160216,0.040871985,0.0027576447,0.0025529838,0.001559802,0.0006554238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055368766,0.00078549905,0.0012391396,0.002074946,0.0012843166,0.0026114488,0.0016145909,0.0014434789,0.0029292323],"category_scores_gemma":[0.04497443,0.0005164155,0.0008209805,0.0019282978,0.00286994,0.005794453,0.0021075658,0.0024792063,0.00029364903],"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.00007094205,0.000070761496,0.005789075,0.00014062301,0.000045905697,0.0001270583,0.00027319262,0.7836486,0.00035917753,0.19417895,0.0019640054,0.013331764],"study_design_scores_gemma":[0.0000060401208,0.000017375196,0.0005534249,0.000022427394,0.000010987196,0.000029145773,0.000041497606,0.901144,0.000093098075,0.09763846,0.00043371183,0.000009818493],"about_ca_topic_score_codex":0.0065086493,"about_ca_topic_score_gemma":0.005222419,"teacher_disagreement_score":0.0065086493,"about_ca_system_score_codex":0.0021067928,"about_ca_system_score_gemma":0.00096792565,"threshold_uncertainty_score":0.029282093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7573648,0.00091421296,0.23280321,0.0013744032,0.00011066878,0.00007508876,0.00009754952,0.00022779814,0.0070322184],"genre_scores_gemma":[0.9870883,0.0002474924,0.012147159,0.000025935855,0.000021541704,0.000010577751,0.000022106056,0.000009291898,0.00042754167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991417,0.00042328206,0.00003684227,0.000095647105,0.00020148481,0.00010099053],"domain_scores_gemma":[0.99457103,0.0040888307,0.00034482437,0.0004223503,0.0003893529,0.0001836711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019011978,0.0005030677,0.00043027112,0.00047772974,0.0008217906,0.00091857463,0.00084231724,0.0014307145,0.00033965975],"category_scores_gemma":[0.0045277784,0.00021828533,0.0005400703,0.0009883925,0.00083453424,0.0015010565,0.00047638963,0.0011554769,0.000044630353],"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.00022223317,0.00014064045,0.0078087654,0.00005770915,0.000038448154,0.00124364,0.00021130922,0.9249889,0.008554365,0.021837581,0.00069203606,0.03420429],"study_design_scores_gemma":[0.000008445816,0.000094588526,0.00095691,0.00000476021,0.000016276803,0.0002479426,0.000108778884,0.99087584,0.0035671098,0.003317475,0.0007844638,0.000017422404],"about_ca_topic_score_codex":0.0063798698,"about_ca_topic_score_gemma":0.0037332699,"teacher_disagreement_score":0.0063798698,"about_ca_system_score_codex":0.0008000451,"about_ca_system_score_gemma":0.00044267505,"threshold_uncertainty_score":0.012685478},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05332989,0.010904915,0.84541386,0.0066111065,0.0021838602,0.0002557963,0.0003010254,0.0021488178,0.07885079],"genre_scores_gemma":[0.75554603,0.00595374,0.21293528,0.002209638,0.0006939093,0.00028175113,0.00030424958,0.00026903348,0.021806354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665904,0.0012831896,0.00017455811,0.00034496517,0.0013553624,0.0001829165],"domain_scores_gemma":[0.99440444,0.0030353472,0.00034123322,0.00088208285,0.0011591825,0.00017765048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00383157,0.00056996115,0.00046844906,0.000671577,0.0006685532,0.003225057,0.0008456925,0.0017286869,0.0031076458],"category_scores_gemma":[0.011623924,0.00038083547,0.0002580832,0.0010937012,0.0015340961,0.0033908773,0.0012822334,0.001519632,0.0012278769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063143077,0.0003142378,0.0021268397,0.00054332067,0.000052633506,0.0005353796,0.0018942851,0.031498525,0.024635147,0.57533765,0.008568937,0.35386154],"study_design_scores_gemma":[0.00019803307,0.00055859477,0.0023293945,0.000504098,0.00013786886,0.0010056987,0.00044752954,0.20802084,0.06472271,0.5080724,0.2138196,0.00018323696],"about_ca_topic_score_codex":0.002210386,"about_ca_topic_score_gemma":0.00081378524,"teacher_disagreement_score":0.00383157,"about_ca_system_score_codex":0.0014925437,"about_ca_system_score_gemma":0.000955168,"threshold_uncertainty_score":0.020263493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85828185,0.0018212962,0.12761112,0.00045607152,0.000042312975,0.00013473236,0.00029297534,0.00064849335,0.010711199],"genre_scores_gemma":[0.9918286,0.00035442167,0.006847984,0.000019060893,0.000012069733,0.000035261946,0.00009444537,0.00003357551,0.00077451655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997925,0.00006178728,0.000008348691,0.000013842741,0.000080964805,0.000042585856],"domain_scores_gemma":[0.9991617,0.00062087143,0.000055491186,0.00002516163,0.00011670503,0.00002002142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007040519,0.0005815513,0.0005194148,0.00059669063,0.0002573654,0.00037495233,0.0004345541,0.00049884774,0.0017180895],"category_scores_gemma":[0.001603399,0.00020373502,0.000475001,0.00037773352,0.00025312984,0.00045391786,0.00019616731,0.00037358384,0.0001498757],"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.00014386588,0.000055206387,0.0013913917,0.000052310595,0.000023302091,0.000065612185,0.000027548402,0.9838705,0.0047195368,0.0031024143,0.00034210042,0.0062060743],"study_design_scores_gemma":[0.0000029211328,0.000019456054,0.00017255144,0.0000013001223,0.0000036049441,0.000006113519,0.0000023118907,0.99933344,0.00030983996,0.00010268595,0.00004404371,0.0000017172946],"about_ca_topic_score_codex":0.014638639,"about_ca_topic_score_gemma":0.0063226456,"teacher_disagreement_score":0.014638639,"about_ca_system_score_codex":0.0008639811,"about_ca_system_score_gemma":0.00050744356,"threshold_uncertainty_score":0.029106855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011307155,0.0014662516,0.98010045,0.0003266973,0.00028612354,0.00010039993,0.000032190033,0.0020045852,0.0043760953],"genre_scores_gemma":[0.85616606,0.0013365892,0.13222352,0.000248411,0.0005115636,0.00030623015,0.00012771417,0.00011345644,0.008966412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984958,0.0003130542,0.000061217936,0.00018928862,0.00079506444,0.00014555512],"domain_scores_gemma":[0.9989139,0.00044873357,0.000088400746,0.00017196753,0.0002855522,0.00009151314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543449,0.00063962594,0.0007134716,0.00057048345,0.0010213363,0.0016738774,0.0017775038,0.00088003423,0.0017827717],"category_scores_gemma":[0.0029257373,0.00021588107,0.00028901233,0.0006043688,0.0010619714,0.0014166625,0.0012396561,0.0014951562,0.00040628656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003767157,0.00023106618,0.0011776827,0.0002109831,0.000099094796,0.00029276044,0.00029860408,0.33468917,0.021211242,0.14052036,0.008101689,0.4927906],"study_design_scores_gemma":[0.000049926726,0.00005750259,0.00021063864,0.000013406543,0.000021750137,0.00007153965,0.000021476044,0.9523566,0.0035435408,0.034072567,0.009558806,0.000022203074],"about_ca_topic_score_codex":0.0039815344,"about_ca_topic_score_gemma":0.0024612115,"teacher_disagreement_score":0.0039815344,"about_ca_system_score_codex":0.001581994,"about_ca_system_score_gemma":0.0013091861,"threshold_uncertainty_score":0.011478245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025379485,0.0000759138,0.9970816,0.000015457,0.000010262505,0.000013068026,0.000038717877,0.00013903581,0.00008804366],"genre_scores_gemma":[0.11907651,0.0005966923,0.8783094,0.00004405084,0.000102608596,0.0002122706,0.00066718593,0.00011423903,0.0008769773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991333,0.00020991468,0.00009345855,0.00015558305,0.00034541846,0.00006227172],"domain_scores_gemma":[0.9975567,0.0011403301,0.0003476164,0.0003955662,0.00052533357,0.000034442684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013504082,0.0012563266,0.0010256227,0.0019894398,0.00025989884,0.0010781818,0.0012831625,0.0010511571,0.000722216],"category_scores_gemma":[0.006952425,0.0006061739,0.00057251356,0.0017595448,0.00042991238,0.0038302685,0.00070711214,0.001666108,0.00053548184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020955467,0.000158805,0.0034765734,0.00022529022,0.00008186128,0.0001438469,0.00014873588,0.38646376,0.095315635,0.033789735,0.0015184195,0.47846773],"study_design_scores_gemma":[0.000007405756,0.000026661448,0.00046335292,0.00000914562,0.000012662465,0.000086124724,0.000011186294,0.9873176,0.008634521,0.002276739,0.0011326848,0.000021881282],"about_ca_topic_score_codex":0.0018186528,"about_ca_topic_score_gemma":0.0010472459,"teacher_disagreement_score":0.0019894398,"about_ca_system_score_codex":0.00067527115,"about_ca_system_score_gemma":0.0006556591,"threshold_uncertainty_score":0.0071417093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042871144,0.00009336311,0.9927654,0.000116542506,0.000024998026,0.000032293872,0.000023753355,0.00010917023,0.0025472916],"genre_scores_gemma":[0.28992915,0.00032796728,0.70438665,0.00015729787,0.000074133015,0.00032263144,0.00018280852,0.00021783315,0.0044014673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.0003198211,0.000032313044,0.000082862025,0.000295059,0.00007181636],"domain_scores_gemma":[0.9981535,0.0013194416,0.0001340788,0.00009137121,0.00025726281,0.00004429405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015879719,0.0009044084,0.0006713392,0.00067279994,0.0005969176,0.0010599621,0.0011293461,0.0010704385,0.003020184],"category_scores_gemma":[0.0052555343,0.0004347724,0.00075549167,0.0012531953,0.0009053262,0.0011025901,0.0010677518,0.0016761484,0.00038704474],"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.000030761126,0.000017388362,0.00013193954,0.00004748288,0.000015595777,0.000037108653,0.00002494117,0.9488489,0.0014634449,0.02560088,0.0007753341,0.023006266],"study_design_scores_gemma":[0.0000045433485,0.000007078567,0.00001926179,0.0000027711449,0.0000017133988,0.00000837786,0.000002242336,0.994034,0.00035284605,0.0050113797,0.00055240165,0.000003369045],"about_ca_topic_score_codex":0.0038311856,"about_ca_topic_score_gemma":0.0030972841,"teacher_disagreement_score":0.0038311856,"about_ca_system_score_codex":0.0012371778,"about_ca_system_score_gemma":0.0011971741,"threshold_uncertainty_score":0.010103583},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013590191,0.6328262,0.25365195,0.06074243,0.006380562,0.00026953613,0.00011601673,0.00055908866,0.03186403],"genre_scores_gemma":[0.21461256,0.6491809,0.096977666,0.0040106014,0.015982743,0.0005217749,0.00027408532,0.00018553059,0.018254094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972276,0.0007742081,0.00029479995,0.00030000348,0.0011674897,0.00023579724],"domain_scores_gemma":[0.9952637,0.002338932,0.00036499885,0.00038508463,0.0014664019,0.00018090254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054461877,0.0010909645,0.0013050361,0.0021597,0.0017745662,0.0065452526,0.0027628462,0.0035648746,0.0022332296],"category_scores_gemma":[0.006314607,0.00073222665,0.0005726241,0.0036710456,0.0026165196,0.010726031,0.0017458777,0.0051607443,0.00084526115],"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.00009860448,0.00024103731,0.0014720756,0.0026406595,0.00006692037,0.00063032616,0.0007376473,0.018887423,0.0039008188,0.34376895,0.023989553,0.603566],"study_design_scores_gemma":[0.000040135616,0.00033567153,0.0011048426,0.0031361862,0.00013095773,0.0016320997,0.0021747544,0.16780697,0.005419619,0.45345798,0.3645841,0.00017663243],"about_ca_topic_score_codex":0.0016512423,"about_ca_topic_score_gemma":0.0008583152,"teacher_disagreement_score":0.0065452526,"about_ca_system_score_codex":0.0020224478,"about_ca_system_score_gemma":0.0027147918,"threshold_uncertainty_score":0.028802514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7125148,0.00097330625,0.26859778,0.0006323759,0.00007104316,0.00011435672,0.00032996136,0.0009238282,0.015842516],"genre_scores_gemma":[0.9930534,0.00027041495,0.0051210755,0.000026632018,0.00001985769,0.00004201637,0.00005897397,0.000031655243,0.001375972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.00013881475,0.000018667377,0.0000919997,0.000196398,0.00014633179],"domain_scores_gemma":[0.99849236,0.00079506624,0.00016058199,0.00009857212,0.00039426103,0.000059242997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070796575,0.0007622376,0.00058564544,0.00090442953,0.00056608877,0.0011011721,0.0012074761,0.0011102537,0.0008147497],"category_scores_gemma":[0.0041068564,0.0004119166,0.00042419138,0.0013274192,0.0008307929,0.0015314318,0.00057700265,0.000784525,0.00027245682],"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.000035227495,0.000031767537,0.0007865683,0.000012833298,0.000009716514,0.00007335294,0.000047154932,0.99208504,0.0013692684,0.0034145862,0.00016349586,0.001970998],"study_design_scores_gemma":[0.000001711488,0.0000065362988,0.00008317028,0.0000012619867,0.0000028922034,0.000005921684,0.0000053568206,0.9991683,0.00017479678,0.0005041065,0.000044303324,0.0000017166996],"about_ca_topic_score_codex":0.02811813,"about_ca_topic_score_gemma":0.0077458736,"teacher_disagreement_score":0.02811813,"about_ca_system_score_codex":0.0032055473,"about_ca_system_score_gemma":0.0013244017,"threshold_uncertainty_score":0.05590892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06776728,0.0013110765,0.9245542,0.0003565043,0.000111856214,0.000106423235,0.00006867865,0.0021588842,0.0035650735],"genre_scores_gemma":[0.79045725,0.0006928174,0.20592126,0.00018062812,0.00019669886,0.0000653436,0.00012388027,0.00013466814,0.0022274752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983796,0.00029839893,0.000075183954,0.00020301974,0.0008835696,0.00016014942],"domain_scores_gemma":[0.9971294,0.0008686542,0.00032575964,0.0005188366,0.001021362,0.00013607788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312748,0.00073130644,0.000605335,0.0010554121,0.00059118913,0.0013902129,0.0010504038,0.0006584718,0.0014634918],"category_scores_gemma":[0.00678828,0.00025362553,0.00028071823,0.0006951824,0.000608741,0.002092691,0.0010356639,0.0013307388,0.00029670354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009980812,0.00027600973,0.0040490236,0.0002711712,0.000059403545,0.00017833823,0.00053380965,0.123941116,0.14601763,0.07349054,0.0044909264,0.64569396],"study_design_scores_gemma":[0.00008610029,0.00043899493,0.0014689924,0.00003301347,0.00006543822,0.00023079815,0.00004904514,0.91130537,0.05900007,0.01749905,0.009773942,0.000049264338],"about_ca_topic_score_codex":0.0021120864,"about_ca_topic_score_gemma":0.0011853594,"teacher_disagreement_score":0.00312748,"about_ca_system_score_codex":0.0011380076,"about_ca_system_score_gemma":0.0008184766,"threshold_uncertainty_score":0.016539931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7300685,0.013789464,0.224795,0.0006660328,0.00041517176,0.0004950315,0.00019519168,0.0024159455,0.027159702],"genre_scores_gemma":[0.9134073,0.0023156179,0.08208882,0.00013024805,0.00009895887,0.00013565824,0.00017134797,0.00012688721,0.0015251107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952179,0.0018346073,0.00033414218,0.00024695427,0.0020462894,0.00032014996],"domain_scores_gemma":[0.99098504,0.005509048,0.00048004533,0.0007331254,0.002093002,0.00019971725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041148798,0.0007148062,0.00064346753,0.00219558,0.00050098274,0.00081776525,0.0011120939,0.0006658102,0.0007225516],"category_scores_gemma":[0.0108568175,0.0002633503,0.0004410057,0.0013390859,0.00049792894,0.0016269053,0.0006556772,0.0007041043,0.000118687196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046695936,0.00094505044,0.011605472,0.0014044564,0.00052635133,0.0004548645,0.0005330365,0.113193534,0.11187642,0.010071737,0.0028635801,0.74185586],"study_design_scores_gemma":[0.0006184048,0.00491365,0.030561099,0.00027037473,0.0009753654,0.0015370084,0.00043889205,0.75154656,0.18161349,0.0036443514,0.02356616,0.0003146669],"about_ca_topic_score_codex":0.0018354965,"about_ca_topic_score_gemma":0.001910866,"teacher_disagreement_score":0.0041148798,"about_ca_system_score_codex":0.0007434088,"about_ca_system_score_gemma":0.00046945977,"threshold_uncertainty_score":0.021761835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073163537,0.00020612981,0.9873877,0.00021596081,0.000026067277,0.00010676632,0.000025720845,0.000509374,0.0042058164],"genre_scores_gemma":[0.19405517,0.0003390296,0.80076766,0.00012486959,0.00004780698,0.0002973747,0.00010967763,0.00007088144,0.0041875686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948704,0.00015912582,0.000043008306,0.0000811277,0.00016757517,0.000062133455],"domain_scores_gemma":[0.9997203,0.000059420025,0.000030637755,0.000054773347,0.00010665933,0.000028276116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010110191,0.00031254787,0.00021439759,0.0007325853,0.00091105554,0.001337817,0.0011974941,0.00069367426,0.0022569227],"category_scores_gemma":[0.001032716,0.00028545887,0.00048285868,0.00069157116,0.0010355953,0.0016199257,0.0008545426,0.0009300644,0.00045177012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089647794,0.00014664365,0.0015185871,0.00026348047,0.000054564207,0.00019656692,0.00076273107,0.15476163,0.025752684,0.61995035,0.0064327675,0.19007032],"study_design_scores_gemma":[0.000040138362,0.00012571315,0.0007917888,0.00006367243,0.00006585349,0.00013431038,0.0001722193,0.8555905,0.009585105,0.10246324,0.030928928,0.00003851986],"about_ca_topic_score_codex":0.00605143,"about_ca_topic_score_gemma":0.00669268,"teacher_disagreement_score":0.00605143,"about_ca_system_score_codex":0.0014404942,"about_ca_system_score_gemma":0.0019882482,"threshold_uncertainty_score":0.01203239},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014985013,0.0015484355,0.97516,0.0005635743,0.0009386462,0.00034512495,0.00007406395,0.0029938773,0.0033913332],"genre_scores_gemma":[0.4571886,0.0015157331,0.52973205,0.00074592023,0.0015302895,0.00053648767,0.00031052306,0.0004033687,0.008037004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698323,0.0004664286,0.00022077265,0.00050389353,0.0015822506,0.0002433319],"domain_scores_gemma":[0.996243,0.00071849977,0.00039282514,0.0011055882,0.0012220904,0.00031802699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002685463,0.00086521026,0.0013149976,0.001855783,0.001255354,0.002229657,0.00376633,0.0012008763,0.001686049],"category_scores_gemma":[0.0068558548,0.00055613555,0.00080881466,0.0011097186,0.0015131638,0.0037070063,0.0029326743,0.0041030827,0.00076061336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086452067,0.00079100055,0.0030725896,0.00071003585,0.00041154452,0.00045401897,0.0008965928,0.08070077,0.0679584,0.12364686,0.02145774,0.6990359],"study_design_scores_gemma":[0.00042688614,0.0009164139,0.0017066468,0.0001022261,0.0003536308,0.0015469701,0.00014170156,0.85080934,0.029087817,0.028254818,0.086190395,0.00046323275],"about_ca_topic_score_codex":0.0019904873,"about_ca_topic_score_gemma":0.0019285951,"teacher_disagreement_score":0.00376633,"about_ca_system_score_codex":0.0010756595,"about_ca_system_score_gemma":0.0017296992,"threshold_uncertainty_score":0.014202237},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013362317,0.0009272606,0.9802025,0.0003277052,0.0002934781,0.00025228006,0.00008900645,0.0021227899,0.002422661],"genre_scores_gemma":[0.3961139,0.0011976297,0.5955283,0.00091750873,0.00039880746,0.0011490447,0.00041964685,0.00024133065,0.0040337886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990069,0.00025586697,0.00014832032,0.00011451789,0.0003945771,0.00007989379],"domain_scores_gemma":[0.9981139,0.000635045,0.00019428393,0.00033059967,0.0005950573,0.00013118706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391771,0.0007955858,0.000763567,0.0012373545,0.00097023434,0.0015402363,0.0025519938,0.00078882877,0.00095810735],"category_scores_gemma":[0.0034456977,0.00042548246,0.00055701693,0.0006780767,0.0010337416,0.0016446954,0.0022876072,0.0018795101,0.00052957435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010065796,0.0005120444,0.0031584464,0.0011535869,0.00021671102,0.001097153,0.0011238271,0.07529073,0.2607874,0.15404418,0.013881858,0.48772758],"study_design_scores_gemma":[0.0001973995,0.0006158921,0.0010928005,0.00009297001,0.00023731714,0.0013862799,0.00013045194,0.82362956,0.08899977,0.034285843,0.04911443,0.0002172799],"about_ca_topic_score_codex":0.000429788,"about_ca_topic_score_gemma":0.0005139073,"teacher_disagreement_score":0.0025519938,"about_ca_system_score_codex":0.0006452614,"about_ca_system_score_gemma":0.00092754455,"threshold_uncertainty_score":0.012649059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12130409,0.0026728234,0.8550214,0.0003644055,0.00056214345,0.00006584315,0.00007868836,0.00112085,0.01880975],"genre_scores_gemma":[0.98679304,0.0004936449,0.008324993,0.000024634366,0.000112042326,0.000020244323,0.000030586212,0.00003314932,0.00416772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999913,0.0000124462695,0.0000034848597,0.000019071915,0.000029147946,0.00002284663],"domain_scores_gemma":[0.9998436,0.00007364443,0.000020839867,0.00001106987,0.000040028553,0.000010710301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017453634,0.00042347502,0.00034981125,0.00025027932,0.0002570128,0.00043138512,0.0005945219,0.00030376617,0.0015182361],"category_scores_gemma":[0.00076437683,0.00014531077,0.0001682411,0.00027408075,0.0002759897,0.00049666566,0.00032996392,0.00050015707,0.000111483714],"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.00018041964,0.00006141796,0.00059679383,0.00011357004,0.0000398016,0.000118252145,0.000110902794,0.78721565,0.022451935,0.015311831,0.005067134,0.16873232],"study_design_scores_gemma":[0.000010313788,0.000038362898,0.00042866674,0.0000038962767,0.000013426031,0.000019452238,0.000012939731,0.99382704,0.0011258613,0.003513907,0.0009992153,0.0000069290995],"about_ca_topic_score_codex":0.003747145,"about_ca_topic_score_gemma":0.004334386,"teacher_disagreement_score":0.003747145,"about_ca_system_score_codex":0.0003813237,"about_ca_system_score_gemma":0.00020237146,"threshold_uncertainty_score":0.00745064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61427003,0.0007949717,0.38180333,0.0003396291,0.00007522425,0.00009387531,0.000057018016,0.00050190213,0.0020640222],"genre_scores_gemma":[0.9740398,0.00027597722,0.025282092,0.00005388692,0.000025199584,0.000019250785,0.000020394755,0.000014297976,0.0002690328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991949,0.00027402584,0.00006733209,0.00006193453,0.00023820925,0.00016357977],"domain_scores_gemma":[0.9960593,0.0020169774,0.0006583941,0.00052628294,0.00050964457,0.00022936957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020678048,0.00049768074,0.00046773022,0.00059267634,0.0007318004,0.00092034874,0.00086699444,0.0004674401,0.000287269],"category_scores_gemma":[0.00630007,0.00016846422,0.0001949196,0.00066906726,0.0009732344,0.0009958906,0.0006499974,0.00061413617,0.00008582983],"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.0010010243,0.00039378542,0.0062299287,0.00023465818,0.000060171533,0.00046662832,0.00081857946,0.5902472,0.09210679,0.106174156,0.0021782974,0.20008881],"study_design_scores_gemma":[0.00010765082,0.00037240313,0.0009947338,0.000025803816,0.000051552266,0.00019960428,0.00016161335,0.9416187,0.03144194,0.02276197,0.0022144474,0.00004956816],"about_ca_topic_score_codex":0.0018266487,"about_ca_topic_score_gemma":0.0013665239,"teacher_disagreement_score":0.0020678048,"about_ca_system_score_codex":0.00094444316,"about_ca_system_score_gemma":0.0014996413,"threshold_uncertainty_score":0.010935724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047328942,0.0015491407,0.98774827,0.0003048784,0.00020208408,0.000030624524,0.00008166119,0.00035631933,0.004994027],"genre_scores_gemma":[0.48228884,0.007406291,0.48073992,0.0010699569,0.0011044876,0.00042609696,0.0004031359,0.0011746808,0.025386702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.00017707284,0.000050030212,0.0002410486,0.00054642966,0.00009667177],"domain_scores_gemma":[0.99376595,0.0040653553,0.0003808084,0.00051963987,0.001181483,0.00008681421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021121558,0.00093194534,0.00069365604,0.0012960489,0.00037834814,0.0015107746,0.0020111832,0.001151212,0.0049853274],"category_scores_gemma":[0.01892036,0.00046481768,0.0006071349,0.0009374079,0.0011426122,0.0037759782,0.000776969,0.002445296,0.0025710417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006933937,0.00010921312,0.0013581837,0.00041179045,0.0000478123,0.0004247709,0.00041739017,0.24451037,0.015404062,0.5710026,0.010093559,0.1561511],"study_design_scores_gemma":[0.000009623701,0.000031205782,0.00045102334,0.00006875975,0.000020074185,0.0003992628,0.000029071514,0.8978311,0.0035589011,0.08999821,0.0075652795,0.000037639777],"about_ca_topic_score_codex":0.0011653218,"about_ca_topic_score_gemma":0.0011286675,"teacher_disagreement_score":0.0049853274,"about_ca_system_score_codex":0.0013050025,"about_ca_system_score_gemma":0.00090860523,"threshold_uncertainty_score":0.016677618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008460846,0.00037813792,0.9821004,0.00015316428,0.00027386108,0.00031545814,0.00014848515,0.0045516216,0.0036180671],"genre_scores_gemma":[0.38644287,0.0006136341,0.5950364,0.0003695209,0.00043616586,0.0026850267,0.0009763416,0.00041477467,0.013025178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864155,0.000270505,0.00011617633,0.00024589137,0.00060648436,0.0001194832],"domain_scores_gemma":[0.9978187,0.0004794597,0.00019903388,0.00060512125,0.0006532253,0.00024440108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018642473,0.00072372524,0.00081293075,0.0010761131,0.0009354089,0.0015221889,0.0023578517,0.0010277305,0.003992263],"category_scores_gemma":[0.0024729948,0.00047139698,0.00035939694,0.00094534253,0.0009229392,0.0013773639,0.0016522611,0.0018183273,0.0018679304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016126873,0.0008928062,0.0025207216,0.0006719649,0.00026929125,0.00092419237,0.00080601766,0.06622582,0.21264394,0.13064618,0.04224741,0.540539],"study_design_scores_gemma":[0.0009765355,0.00095081696,0.0012684593,0.00007632975,0.00020771644,0.0012651418,0.00011176507,0.7055789,0.103748366,0.05167436,0.13397789,0.00016362416],"about_ca_topic_score_codex":0.0007233966,"about_ca_topic_score_gemma":0.0008474354,"teacher_disagreement_score":0.003992263,"about_ca_system_score_codex":0.0010171884,"about_ca_system_score_gemma":0.0010584168,"threshold_uncertainty_score":0.013355434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93476933,0.00093200215,0.060450688,0.00019801126,0.00009556871,0.000059666534,0.00018367494,0.0006539443,0.0026570396],"genre_scores_gemma":[0.99745876,0.000056162186,0.0022419982,0.000018267845,0.000013665657,0.00001121423,0.000060186554,0.000021810434,0.00011789643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773324,0.0006283931,0.00010852632,0.00031514768,0.0010032122,0.0002115285],"domain_scores_gemma":[0.9874686,0.0070796874,0.0018216532,0.001143044,0.002127938,0.00035912855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232282,0.00038362664,0.0004400048,0.0007034912,0.00041151588,0.0010775314,0.00083404494,0.000523063,0.00048282277],"category_scores_gemma":[0.019130705,0.00022843677,0.00017948929,0.00096432195,0.0007787414,0.0008325902,0.0006816734,0.000793843,0.00011431734],"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.0022385232,0.00029779048,0.067023434,0.00024871112,0.0002852718,0.001446963,0.0005497266,0.79901016,0.04517309,0.007840693,0.002704144,0.073181495],"study_design_scores_gemma":[0.000030963827,0.0006160244,0.022943474,0.000024408915,0.000080816535,0.00064296264,0.00010435741,0.9570387,0.013924178,0.0026610314,0.0018730061,0.000060046405],"about_ca_topic_score_codex":0.0022715686,"about_ca_topic_score_gemma":0.0015648364,"teacher_disagreement_score":0.00232282,"about_ca_system_score_codex":0.0009125281,"about_ca_system_score_gemma":0.00058061525,"threshold_uncertainty_score":0.012284398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072548956,0.0006121298,0.9135713,0.00052319304,0.00013680103,0.00015687785,0.00017536977,0.0024481257,0.009827329],"genre_scores_gemma":[0.5563025,0.0004669364,0.43712375,0.00013037505,0.00008875082,0.00010859792,0.00032368518,0.00011042891,0.0053448975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982786,0.000031024596,0.000007503307,0.000023102888,0.00009159504,0.000018989842],"domain_scores_gemma":[0.9999031,0.00001661506,0.0000126985005,0.000018791885,0.000035026125,0.000013666159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020598364,0.00015277606,0.00017032119,0.0003464131,0.00045965676,0.0004642022,0.0007783218,0.00029964832,0.0011412145],"category_scores_gemma":[0.0003768232,0.00011907513,0.00019090725,0.00027985004,0.00023610856,0.00053663383,0.00033152287,0.00031980764,0.0002911046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029357677,0.00015766919,0.0010431096,0.00029525216,0.0000764431,0.0005226729,0.00031088365,0.1263589,0.30468336,0.14075385,0.015523241,0.40998104],"study_design_scores_gemma":[0.00009248862,0.00044945825,0.0011384853,0.000035766385,0.0000798032,0.00067355763,0.00009705702,0.82973194,0.062252507,0.02844177,0.076953515,0.00005361541],"about_ca_topic_score_codex":0.0013915349,"about_ca_topic_score_gemma":0.0018313567,"teacher_disagreement_score":0.0013915349,"about_ca_system_score_codex":0.0005772705,"about_ca_system_score_gemma":0.0005055539,"threshold_uncertainty_score":0.0041884184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54253334,0.0009674297,0.44514155,0.0004104313,0.00008520672,0.00007656097,0.00003573397,0.0003570418,0.010392754],"genre_scores_gemma":[0.9957419,0.000086239364,0.003779411,0.000016724453,0.0000072898906,0.000011702884,0.00000510174,0.000013197568,0.0003383745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00028221394,0.000040084666,0.00013423986,0.0003372129,0.00015863004],"domain_scores_gemma":[0.98952544,0.0085197985,0.0006498454,0.00042427104,0.0007783274,0.000102298276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572464,0.0004938622,0.0006553286,0.000493075,0.00046037498,0.0011680033,0.00041139722,0.00070278096,0.0016782449],"category_scores_gemma":[0.013406995,0.00022873098,0.00034306786,0.00016878419,0.0011794706,0.0008985607,0.0008628194,0.0007875027,0.00013791096],"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.000630842,0.000056206816,0.0012861912,0.00012538955,0.00003520702,0.00023452967,0.00021523498,0.9280931,0.029204123,0.022226613,0.00015644707,0.017736156],"study_design_scores_gemma":[0.000018612194,0.0001104765,0.00020322239,0.000008659743,0.000007759546,0.000038004124,0.000014909407,0.99205106,0.005501807,0.00189241,0.00014435769,0.000008821669],"about_ca_topic_score_codex":0.0017676557,"about_ca_topic_score_gemma":0.0006189918,"teacher_disagreement_score":0.0020572464,"about_ca_system_score_codex":0.00084850146,"about_ca_system_score_gemma":0.0006830765,"threshold_uncertainty_score":0.010879874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06246412,0.0007546079,0.9265569,0.00024670342,0.00009431695,0.00012537518,0.00008182513,0.0009960701,0.008680073],"genre_scores_gemma":[0.77225643,0.0008285255,0.21934295,0.00013548363,0.00013978555,0.00016962836,0.0002090771,0.000108499844,0.0068095834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994342,0.00013760368,0.00002499021,0.000051436047,0.0002875578,0.00006419415],"domain_scores_gemma":[0.9994311,0.00014655419,0.000040360483,0.00013829261,0.0002039928,0.000039739753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059066596,0.00029579856,0.000385259,0.00046344372,0.0008423526,0.0010025015,0.0012067173,0.0006612461,0.0014787244],"category_scores_gemma":[0.0011749672,0.00021184092,0.00030718,0.0005067002,0.0005039407,0.0015566739,0.0008709664,0.00051285565,0.0004040125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044411395,0.0001796312,0.0016695429,0.00043094042,0.000118560674,0.0007534432,0.00075689866,0.28745034,0.08719095,0.33167574,0.0062188436,0.28311092],"study_design_scores_gemma":[0.000057551395,0.00019545757,0.00049118913,0.000034376655,0.000054829477,0.00039723175,0.000099849094,0.88473225,0.025223222,0.055476684,0.033207964,0.000029384653],"about_ca_topic_score_codex":0.0006111859,"about_ca_topic_score_gemma":0.0007702484,"teacher_disagreement_score":0.0014787244,"about_ca_system_score_codex":0.00061086967,"about_ca_system_score_gemma":0.00043051358,"threshold_uncertainty_score":0.004946828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012813689,0.00009893241,0.9846631,0.000103740604,0.000023116905,0.000026940064,0.000009384574,0.00012562134,0.0021354845],"genre_scores_gemma":[0.78657985,0.00022633898,0.20867656,0.00010941772,0.00005951417,0.00012381127,0.00005484616,0.00009107931,0.004078582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819237,0.0005835302,0.0000874695,0.00040151083,0.0005332553,0.00020196292],"domain_scores_gemma":[0.9978573,0.0009876515,0.00021793705,0.00045410395,0.00039718577,0.00008584168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026407044,0.00053005386,0.00094850967,0.0005617319,0.00054753537,0.00146698,0.00187588,0.0008359844,0.0019987111],"category_scores_gemma":[0.0071477885,0.00044117574,0.0004955244,0.00067674264,0.0014542872,0.002038176,0.0017972549,0.0014445212,0.00040417368],"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.000101851496,0.000081973696,0.0003233705,0.000046962377,0.000020143483,0.000076579905,0.000121429664,0.75705934,0.0039495463,0.18210083,0.0011646296,0.054953374],"study_design_scores_gemma":[0.000015240033,0.000018171662,0.0000418889,0.0000032282062,0.000003407819,0.000025600406,0.000010709836,0.96531594,0.0008339509,0.03304097,0.00068548205,0.000005456159],"about_ca_topic_score_codex":0.0011945468,"about_ca_topic_score_gemma":0.0009010521,"teacher_disagreement_score":0.0026407044,"about_ca_system_score_codex":0.0014433161,"about_ca_system_score_gemma":0.0012252395,"threshold_uncertainty_score":0.013965547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021665627,0.00006535207,0.99561113,0.000045327884,0.000028960558,0.000030017072,0.0000076170872,0.00010199319,0.0019431022],"genre_scores_gemma":[0.6878253,0.0003741858,0.30555555,0.00021006481,0.00015525012,0.00041142837,0.00009520926,0.0000843525,0.005288662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.0000920673,0.000021034728,0.00017058705,0.00013336491,0.00005102869],"domain_scores_gemma":[0.9996997,0.00009574543,0.00006960376,0.000030590934,0.000085261774,0.000019121311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401476,0.0009966457,0.000723437,0.00038329908,0.00042357817,0.000928487,0.001267813,0.00093542103,0.0019659905],"category_scores_gemma":[0.00090870226,0.00028509114,0.00050553825,0.00033079673,0.0006176264,0.0006382951,0.00061596534,0.0007948955,0.000499081],"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.00005990508,0.000072400326,0.00019540594,0.00015694182,0.000036977868,0.000107335145,0.000095718744,0.8248216,0.017501876,0.038137577,0.0019203653,0.11689396],"study_design_scores_gemma":[0.000014715344,0.00010279204,0.000055481818,0.000008137334,0.000006715673,0.00002572135,0.000008390749,0.9932533,0.0015395951,0.0032947469,0.0016824341,0.000008092887],"about_ca_topic_score_codex":0.0016315007,"about_ca_topic_score_gemma":0.0013313802,"teacher_disagreement_score":0.0019659905,"about_ca_system_score_codex":0.0005969008,"about_ca_system_score_gemma":0.0009827646,"threshold_uncertainty_score":0.0065768957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27223858,0.0074078324,0.673882,0.00078219053,0.00030479525,0.00019461277,0.00033274275,0.0013878299,0.04346944],"genre_scores_gemma":[0.96938276,0.0024621522,0.022449847,0.000056347748,0.00012339058,0.00008621818,0.0002682459,0.00012454884,0.005046509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998681,0.00033197293,0.00003084221,0.00009837876,0.00060114486,0.00025667733],"domain_scores_gemma":[0.9961326,0.0025831317,0.00019206888,0.0002893785,0.00074175984,0.00006121924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021107593,0.0009049679,0.000461032,0.0014272138,0.0005580822,0.0011343365,0.0006613394,0.00041694578,0.0035003352],"category_scores_gemma":[0.008660497,0.00024774208,0.00040516318,0.0009804257,0.0007850018,0.0014745579,0.00042442107,0.00084789126,0.0006400735],"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.00050648197,0.00015880511,0.003210094,0.00042162117,0.00013561382,0.00028237217,0.00025382818,0.7309507,0.025999334,0.118933946,0.0049533313,0.11419389],"study_design_scores_gemma":[0.0000055753326,0.00010241155,0.0005670319,0.00001273364,0.000020138948,0.00006444236,0.00001771528,0.98900115,0.004310373,0.004732193,0.0011527998,0.000013485714],"about_ca_topic_score_codex":0.0043473286,"about_ca_topic_score_gemma":0.0021136054,"teacher_disagreement_score":0.0043473286,"about_ca_system_score_codex":0.002088794,"about_ca_system_score_gemma":0.00079392886,"threshold_uncertainty_score":0.015155375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05387119,0.00034728507,0.94390273,0.00027457933,0.000067110144,0.00004146113,0.00003169418,0.00026353227,0.0012003391],"genre_scores_gemma":[0.9290319,0.00026735695,0.069089904,0.00005820711,0.00008792272,0.000060252776,0.000050380924,0.000029944398,0.0013240767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841917,0.0004379628,0.000059285954,0.00014049758,0.0006180131,0.00032512727],"domain_scores_gemma":[0.9976005,0.0015213751,0.00023961172,0.00012207605,0.00038443186,0.00013198033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024320057,0.0006762826,0.0011084941,0.0005440273,0.0006434219,0.0012056425,0.0015224259,0.0007949243,0.00095043425],"category_scores_gemma":[0.0055526444,0.00045885713,0.00035334527,0.0008422036,0.00095582986,0.0011153462,0.0009368896,0.0010440975,0.00015610912],"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.00015043534,0.000066705004,0.00048546516,0.000040468778,0.00002330096,0.000080045174,0.000060249215,0.9442878,0.0028867119,0.025083214,0.00074752426,0.026088106],"study_design_scores_gemma":[0.00000819296,0.0000061878163,0.000027107913,6.219768e-7,0.0000014636479,0.0000032361338,0.0000027678693,0.9979596,0.00017256814,0.0017499431,0.0000665635,0.0000017928236],"about_ca_topic_score_codex":0.008397923,"about_ca_topic_score_gemma":0.0047265138,"teacher_disagreement_score":0.008397923,"about_ca_system_score_codex":0.00241278,"about_ca_system_score_gemma":0.0028260923,"threshold_uncertainty_score":0.017506063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99740785,0.000027522281,0.0011587207,0.000018615652,0.0000037529826,0.000022278105,0.0008473673,0.00015421068,0.00035970393],"genre_scores_gemma":[0.99548066,0.000047550697,0.0013840564,0.0000081169865,0.0000062947925,0.000023022385,0.0028370246,0.0000110657575,0.00020227123],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99943453,0.00009726543,0.00004726097,0.000079451864,0.00026954428,0.00007187556],"domain_scores_gemma":[0.9982437,0.0004979726,0.00023675711,0.00019655858,0.00069593586,0.00012911137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562418,0.0004854572,0.00037545987,0.0032358526,0.00047810102,0.00036748408,0.0004354666,0.00031955467,0.00041044655],"category_scores_gemma":[0.0014100913,0.00015581424,0.00021542625,0.0033235983,0.00026765247,0.0003852669,0.00022743226,0.00022782292,0.00012773104],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012019604,0.0010605013,0.69588363,0.0002818436,0.0005081455,0.0025002472,0.00088872534,0.08841788,0.0814516,0.0010817129,0.0033977814,0.123326026],"study_design_scores_gemma":[0.000036915957,0.0004350076,0.6435815,0.000016482856,0.00012100559,0.0010940585,0.0004661279,0.3326594,0.01924344,0.00040876368,0.00188548,0.00005180997],"about_ca_topic_score_codex":0.015312529,"about_ca_topic_score_gemma":0.013110908,"teacher_disagreement_score":0.015312529,"about_ca_system_score_codex":0.00082016416,"about_ca_system_score_gemma":0.0004672766,"threshold_uncertainty_score":0.030446768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05186986,0.0010449887,0.9014921,0.0015867213,0.00046867752,0.00036245357,0.00053825515,0.00092392386,0.041712873],"genre_scores_gemma":[0.8623516,0.0013248592,0.09205895,0.0005460144,0.00019571412,0.0007686718,0.0006441601,0.000087336906,0.042022765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995633,0.00008028774,0.00001919701,0.00007297855,0.00020078359,0.000063460764],"domain_scores_gemma":[0.9998443,0.000031511878,0.000016536043,0.000014928118,0.00007559407,0.00001713428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044284321,0.000599283,0.00045223546,0.0003787899,0.0005832218,0.0011137733,0.0015854609,0.0012236305,0.00298428],"category_scores_gemma":[0.0005812647,0.00026704863,0.00047624414,0.00040696745,0.0004850155,0.0009401293,0.00053802924,0.0011333153,0.0007348638],"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.00025367795,0.00018887466,0.0009368875,0.000106923326,0.000028078746,0.0005047549,0.00022519892,0.71474534,0.0122303525,0.2327757,0.0065916977,0.03141242],"study_design_scores_gemma":[0.000018335702,0.00003686903,0.000070891794,0.0000049629,0.0000057108577,0.00002824642,0.00000948358,0.98827785,0.00047443912,0.008547054,0.002519631,0.000006565971],"about_ca_topic_score_codex":0.0072108973,"about_ca_topic_score_gemma":0.00411755,"teacher_disagreement_score":0.0072108973,"about_ca_system_score_codex":0.0016664887,"about_ca_system_score_gemma":0.0011238508,"threshold_uncertainty_score":0.014337897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10060133,0.0032401083,0.5446536,0.016090337,0.0013901233,0.0015814339,0.0018836368,0.004794258,0.32576525],"genre_scores_gemma":[0.65363514,0.0028924828,0.26880276,0.0031144326,0.001133128,0.001678127,0.0035929312,0.0009862016,0.06416481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958262,0.0006259163,0.00035485285,0.0002534481,0.0025197282,0.00041983134],"domain_scores_gemma":[0.9922466,0.001597118,0.0004810839,0.0008396584,0.0046169497,0.00021864852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034114397,0.00048499563,0.0004838283,0.00091327174,0.000890667,0.002244117,0.0012975984,0.0021782345,0.0048897197],"category_scores_gemma":[0.0082339635,0.00041365568,0.0003690047,0.00042035116,0.00072356797,0.0023931218,0.0012972591,0.001455079,0.0038516133],"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.00035869502,0.00028010213,0.0038923023,0.0014107388,0.00002229312,0.0019900678,0.0017075093,0.030658001,0.1474484,0.5634019,0.03435256,0.21447738],"study_design_scores_gemma":[0.000048929687,0.00065988785,0.0036204748,0.0004786623,0.00003432772,0.0048025562,0.00079696794,0.08839514,0.08799728,0.064090475,0.7489968,0.000078473364],"about_ca_topic_score_codex":0.0013963338,"about_ca_topic_score_gemma":0.0007362401,"teacher_disagreement_score":0.0048897197,"about_ca_system_score_codex":0.0011083817,"about_ca_system_score_gemma":0.0013038471,"threshold_uncertainty_score":0.01804167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7970656,0.004605672,0.19131269,0.0005615717,0.00019039778,0.00019481295,0.00016514935,0.0003690563,0.0055350764],"genre_scores_gemma":[0.9598366,0.0006895838,0.037900988,0.00005247235,0.00018224346,0.00006182259,0.00009828185,0.000044074623,0.0011338623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966647,0.0015553121,0.00016949857,0.00042898313,0.0008920468,0.00028934874],"domain_scores_gemma":[0.96704996,0.024319328,0.0023422544,0.002471689,0.0030461338,0.0007706667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075496347,0.0013836807,0.0010708311,0.0017685201,0.0007259744,0.0015146285,0.001296852,0.0011823846,0.00093309284],"category_scores_gemma":[0.023784092,0.00034384208,0.00069111463,0.0013850512,0.0011844018,0.004210343,0.0012939767,0.0015343262,0.0003293508],"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.010536009,0.0018472295,0.046746574,0.00070889277,0.00056652044,0.00037385695,0.0010080223,0.44186097,0.05299064,0.025639182,0.001796706,0.41592535],"study_design_scores_gemma":[0.00007316477,0.0015423294,0.007901995,0.000053847165,0.0002056592,0.0002499582,0.00020437466,0.9720438,0.011105207,0.005386571,0.0011512971,0.000081692386],"about_ca_topic_score_codex":0.0012092768,"about_ca_topic_score_gemma":0.001030649,"teacher_disagreement_score":0.0075496347,"about_ca_system_score_codex":0.0008431997,"about_ca_system_score_gemma":0.00051981275,"threshold_uncertainty_score":0.039926708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13199666,0.00040265248,0.8640891,0.00027665403,0.00019231004,0.0002443576,0.00006209588,0.00088944886,0.0018466174],"genre_scores_gemma":[0.9229404,0.000075856165,0.075544804,0.000060968312,0.0000977571,0.00011462397,0.000040573384,0.000021568223,0.001103383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991062,0.00026638227,0.0000616027,0.00011522122,0.00029309568,0.00015743858],"domain_scores_gemma":[0.9984282,0.0005020354,0.000156463,0.00036991673,0.00039394482,0.00014941541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025811964,0.00050592556,0.00071974215,0.0009458839,0.0017729754,0.00090694503,0.0025836958,0.0007118708,0.0010907728],"category_scores_gemma":[0.0042083524,0.0002620831,0.0003504371,0.00047374208,0.0010497916,0.0015917169,0.0010604786,0.00058009336,0.00016473241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019962904,0.00093439996,0.0036861198,0.00018426713,0.00019872942,0.00068130845,0.0009773292,0.3833279,0.08675325,0.11189861,0.009792414,0.39956936],"study_design_scores_gemma":[0.00011726662,0.00027532352,0.000573189,0.000008278468,0.000058120488,0.0001691505,0.000051095372,0.9718641,0.011852119,0.012307904,0.002677399,0.00004608517],"about_ca_topic_score_codex":0.0028531894,"about_ca_topic_score_gemma":0.0049681272,"teacher_disagreement_score":0.0028531894,"about_ca_system_score_codex":0.0015345972,"about_ca_system_score_gemma":0.001319335,"threshold_uncertainty_score":0.013650835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91287977,0.00019913772,0.0831243,0.00013832492,0.000016901267,0.000034826004,0.0000470041,0.0014840515,0.002075793],"genre_scores_gemma":[0.9906403,0.00005615091,0.008980081,0.000014063334,0.000008541362,0.00000955947,0.000035558136,0.000020836,0.00023502145],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.0003007519,0.00003099322,0.000057629437,0.00027351725,0.000114522314],"domain_scores_gemma":[0.9980768,0.0007866631,0.00026598095,0.00037342287,0.00039699647,0.000100077195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104155,0.00025895817,0.00034169384,0.00053895614,0.00046746508,0.000643986,0.000625389,0.00048071562,0.00055951433],"category_scores_gemma":[0.0030059903,0.00016866272,0.0000870921,0.00028279767,0.00046184091,0.0012436261,0.0005974304,0.00030265382,0.00017129333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002314589,0.0005972928,0.013299584,0.00025246196,0.00008626996,0.0007992943,0.00065389386,0.16575266,0.6583435,0.009945605,0.0025458431,0.14540912],"study_design_scores_gemma":[0.00009551182,0.00092279445,0.0037409372,0.000010192387,0.000040319785,0.00029057084,0.0002516152,0.83059716,0.1565341,0.004889552,0.0025977816,0.000029445577],"about_ca_topic_score_codex":0.0010107971,"about_ca_topic_score_gemma":0.0007380184,"teacher_disagreement_score":0.0012104155,"about_ca_system_score_codex":0.00044789273,"about_ca_system_score_gemma":0.00019851894,"threshold_uncertainty_score":0.0064014196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012799039,0.0006631247,0.98247045,0.00010826433,0.00012109105,0.00008978287,0.00008277696,0.0019890678,0.0016763743],"genre_scores_gemma":[0.21726458,0.00059780217,0.77661884,0.0002196064,0.00023401341,0.00018587822,0.00034512515,0.000516351,0.0040178658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947685,0.00015870955,0.0000265419,0.00006570625,0.00020984272,0.00006241367],"domain_scores_gemma":[0.99929583,0.00024526156,0.000095128016,0.00011677447,0.00017512863,0.00007180009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011914223,0.00061486766,0.0006176341,0.00069271727,0.00048748174,0.0004932934,0.0015276225,0.00043452447,0.0024593591],"category_scores_gemma":[0.0025109092,0.00031292473,0.00027429877,0.00059708947,0.0003324784,0.0010248721,0.00056827086,0.00070625683,0.0010332424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00263911,0.00021576125,0.00094180997,0.00026851974,0.00011993128,0.00020428546,0.00029580388,0.17605862,0.10818044,0.034757953,0.017878592,0.6584391],"study_design_scores_gemma":[0.00014674258,0.00034149564,0.00050165306,0.000022139398,0.000041059884,0.0002779898,0.000018249986,0.9448248,0.022356354,0.008667544,0.022734147,0.00006780013],"about_ca_topic_score_codex":0.0017432758,"about_ca_topic_score_gemma":0.0022281746,"teacher_disagreement_score":0.0024593591,"about_ca_system_score_codex":0.00048929965,"about_ca_system_score_gemma":0.00074332487,"threshold_uncertainty_score":0.008227348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19183786,0.002513764,0.80014443,0.00064996857,0.00051571336,0.00021998082,0.000038601265,0.0016002031,0.0024794454],"genre_scores_gemma":[0.9473759,0.0005117671,0.051032186,0.00014649151,0.00010805428,0.000054952605,0.000018937595,0.000022275392,0.00072942284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.00014685257,0.000052581574,0.00007006088,0.0001594369,0.00009656762],"domain_scores_gemma":[0.99791986,0.00078765035,0.0003797385,0.00034042267,0.0004248848,0.00014745061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002035768,0.0005872566,0.00038917697,0.00074422575,0.0007513815,0.0017667977,0.002562823,0.000652038,0.0006699986],"category_scores_gemma":[0.0032408086,0.0002284372,0.00041381482,0.0005547989,0.00089652836,0.0015364783,0.00081550196,0.00084806466,0.00011848411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012952404,0.0012429297,0.012790362,0.0006170287,0.00032852642,0.0005861212,0.001070498,0.16848211,0.20753095,0.063734576,0.004844139,0.53747755],"study_design_scores_gemma":[0.00019718535,0.0007317087,0.0015583435,0.000041416857,0.00027167654,0.0003343524,0.00008511423,0.8968928,0.081481166,0.01040963,0.007932502,0.00006398235],"about_ca_topic_score_codex":0.0027240124,"about_ca_topic_score_gemma":0.0031825623,"teacher_disagreement_score":0.0027240124,"about_ca_system_score_codex":0.0009944466,"about_ca_system_score_gemma":0.0012535905,"threshold_uncertainty_score":0.010766268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13963687,0.06258327,0.72040194,0.003177198,0.004347188,0.00042164637,0.0012839735,0.0031713964,0.064976506],"genre_scores_gemma":[0.91259056,0.011463851,0.06377242,0.0011334101,0.0025403218,0.00035267998,0.0006202952,0.0005639308,0.0069625564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389327,0.0010824905,0.00043837103,0.0011832728,0.002979323,0.0004232378],"domain_scores_gemma":[0.99295855,0.0027790477,0.0012346759,0.0012309559,0.0014834631,0.00031337704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027682737,0.0007923337,0.0008373113,0.0015691431,0.0006525767,0.0027176915,0.0013562506,0.0015520946,0.0011944148],"category_scores_gemma":[0.01796324,0.00039933965,0.0006617744,0.0022260034,0.0019737678,0.0026310682,0.0020280038,0.0025342952,0.0006930616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021603082,0.00021299956,0.01435652,0.0023318361,0.00041468308,0.0017845436,0.0010856725,0.14438115,0.066463955,0.3314753,0.018542498,0.4167906],"study_design_scores_gemma":[0.00020023207,0.0026727591,0.03141993,0.00084069703,0.0007949826,0.010280092,0.00038276217,0.33168444,0.053407773,0.27034715,0.2972441,0.0007251196],"about_ca_topic_score_codex":0.0010475856,"about_ca_topic_score_gemma":0.00037388722,"teacher_disagreement_score":0.0027682737,"about_ca_system_score_codex":0.0011159313,"about_ca_system_score_gemma":0.00085003703,"threshold_uncertainty_score":0.014640212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16625848,0.00047107777,0.81887996,0.00038848686,0.00018022927,0.00025929732,0.000112118614,0.0024511844,0.010999048],"genre_scores_gemma":[0.8755483,0.00020459243,0.12034466,0.00011078134,0.0001680162,0.00017155745,0.00016185273,0.00016703509,0.003123154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990165,0.00015399695,0.000058456342,0.0001811115,0.0004512207,0.00013865762],"domain_scores_gemma":[0.99764025,0.0008121562,0.0002734231,0.0006115723,0.0005625515,0.00010004926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014065827,0.000600926,0.0005879071,0.00090332376,0.0014490569,0.0011174163,0.0012061604,0.00058306893,0.0030844177],"category_scores_gemma":[0.0055643576,0.00026878892,0.0003115756,0.0008290131,0.0006525145,0.0017538748,0.0012042302,0.0004902063,0.00069821737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007775638,0.00042167137,0.005211557,0.00024132594,0.00007674074,0.0002530174,0.00040486665,0.34358186,0.093300425,0.07891842,0.007833646,0.4689789],"study_design_scores_gemma":[0.000033222615,0.00009073696,0.00061108044,0.000008564001,0.000018131339,0.00014265499,0.000050015133,0.9459029,0.013121248,0.03536031,0.004645813,0.000015390333],"about_ca_topic_score_codex":0.0013741761,"about_ca_topic_score_gemma":0.0014425678,"teacher_disagreement_score":0.0030844177,"about_ca_system_score_codex":0.0013901977,"about_ca_system_score_gemma":0.0011698741,"threshold_uncertainty_score":0.0103183985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83246636,0.001798332,0.14383899,0.0010599043,0.00015534624,0.00007424564,0.0003295043,0.00047873243,0.019798642],"genre_scores_gemma":[0.9950439,0.0005861117,0.0029215477,0.000036530146,0.00005823166,0.000015810729,0.000032347434,0.000026364272,0.0012791671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992119,0.00030318732,0.000013316051,0.000046677564,0.0002423958,0.00018250292],"domain_scores_gemma":[0.99607337,0.0030856512,0.00032812895,0.0001468773,0.00021474285,0.00015133893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115752,0.000833199,0.0003773887,0.0006997612,0.00055129034,0.0011086774,0.00048569305,0.00070008537,0.0016865564],"category_scores_gemma":[0.0075780437,0.0002926482,0.00030064388,0.00061571563,0.0007580229,0.0019435699,0.0005647245,0.00066631107,0.00022623003],"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.00027271864,0.00011032161,0.0033822912,0.000058809917,0.000032333905,0.00018589885,0.0000482227,0.9491944,0.0076513737,0.02263767,0.0008781873,0.01554783],"study_design_scores_gemma":[0.00001190718,0.00016422314,0.0013304581,0.000006101647,0.00002649454,0.0000649889,0.00002346655,0.9874834,0.0019563304,0.008416055,0.0004970364,0.000019513578],"about_ca_topic_score_codex":0.0034106744,"about_ca_topic_score_gemma":0.0019315657,"teacher_disagreement_score":0.0034106744,"about_ca_system_score_codex":0.0011909793,"about_ca_system_score_gemma":0.0005975768,"threshold_uncertainty_score":0.008641183},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061251605,0.1977203,0.6269363,0.009382356,0.0036665667,0.00027096857,0.0005040743,0.00054765824,0.15484656],"genre_scores_gemma":[0.17892501,0.3446895,0.40724987,0.0046799257,0.0135618,0.0008553133,0.0009568537,0.000434372,0.04864736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986533,0.0003174391,0.000099139004,0.00015456529,0.0006677345,0.00010776452],"domain_scores_gemma":[0.9994548,0.0002651426,0.000055376287,0.000059588707,0.00013916021,0.000025905874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012991701,0.0011091745,0.0007650754,0.0016573035,0.0009664168,0.0032272667,0.0013433121,0.002101666,0.0057400567],"category_scores_gemma":[0.002830432,0.0005167213,0.0007296765,0.0038469431,0.0010083388,0.0056941835,0.0011831225,0.0030817094,0.0018159429],"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.000016669406,0.000042585012,0.00017838975,0.0003489562,0.000014460329,0.00011980257,0.000090702844,0.0066091428,0.00072117406,0.8146774,0.018862922,0.15831777],"study_design_scores_gemma":[0.000012349298,0.000049261096,0.00039719496,0.00029552061,0.000021538031,0.0007204505,0.00007637817,0.029276278,0.0006481288,0.5855382,0.38291773,0.000047032663],"about_ca_topic_score_codex":0.0012311096,"about_ca_topic_score_gemma":0.00058231165,"teacher_disagreement_score":0.0057400567,"about_ca_system_score_codex":0.001550443,"about_ca_system_score_gemma":0.00081985275,"threshold_uncertainty_score":0.019202352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09018771,0.00043646898,0.9040421,0.00016158858,0.000075251526,0.00006815397,0.000047789694,0.0019240356,0.0030568403],"genre_scores_gemma":[0.55921936,0.00045021457,0.4377505,0.000074083735,0.0000865277,0.00007462357,0.00019857434,0.00007625521,0.0020699275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.000102794394,0.000025929294,0.000037229594,0.00015746323,0.00004301801],"domain_scores_gemma":[0.99954,0.000107043685,0.00006778696,0.0001291388,0.00011980644,0.000036290527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043259005,0.00029546855,0.00043976473,0.0008447301,0.00041017428,0.0005723843,0.0007325934,0.00032726745,0.00058596564],"category_scores_gemma":[0.00086256664,0.00015168231,0.00019871286,0.00074996764,0.00027279914,0.0013688013,0.00066459266,0.00035126277,0.0002778338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046533198,0.00015562102,0.00242036,0.00018692143,0.00009299355,0.0004355776,0.00031842562,0.07901822,0.22090298,0.034105454,0.0034929435,0.6584052],"study_design_scores_gemma":[0.00005999661,0.00037556578,0.0013862745,0.000021687307,0.00006749435,0.0005677839,0.00008111056,0.8618381,0.099563,0.013735575,0.02226045,0.000042916836],"about_ca_topic_score_codex":0.0008443893,"about_ca_topic_score_gemma":0.00094231876,"teacher_disagreement_score":0.0008447301,"about_ca_system_score_codex":0.00045345057,"about_ca_system_score_gemma":0.00028560698,"threshold_uncertainty_score":0.0032900572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04788396,0.0012303636,0.9471076,0.00021339081,0.00014365345,0.00011391441,0.000018549077,0.0015166261,0.0017720226],"genre_scores_gemma":[0.8848102,0.00068313215,0.11237475,0.00015661969,0.00019772221,0.00015059051,0.00003781578,0.00011082859,0.0014782464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.0002630036,0.00006503348,0.0001379032,0.00032681576,0.00012282899],"domain_scores_gemma":[0.9972228,0.0014024079,0.00043927622,0.0003243613,0.00051649916,0.00009473785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026632422,0.00081358175,0.0006909941,0.0009892026,0.00075858325,0.0009212655,0.0017451438,0.0005284262,0.0008751479],"category_scores_gemma":[0.0063035344,0.00035757097,0.00025965535,0.0006298666,0.0008730757,0.0018605863,0.00093824876,0.0011244596,0.00020106588],"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.000532323,0.00053062814,0.0030768944,0.0005286032,0.00021076514,0.00046424282,0.0005851501,0.5646362,0.13583018,0.06998887,0.005164289,0.21845198],"study_design_scores_gemma":[0.00007370568,0.00029114212,0.00041099146,0.0000196783,0.0000621501,0.00015966514,0.000019042369,0.963805,0.02099956,0.010629137,0.0034949402,0.000034907094],"about_ca_topic_score_codex":0.0011254096,"about_ca_topic_score_gemma":0.0010842403,"teacher_disagreement_score":0.0026632422,"about_ca_system_score_codex":0.0006114802,"about_ca_system_score_gemma":0.0007284071,"threshold_uncertainty_score":0.014084756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015170018,0.00028288722,0.9775008,0.0003538855,0.00016451985,0.000092209855,0.00005109684,0.00078410003,0.005600486],"genre_scores_gemma":[0.5730983,0.0008978389,0.415569,0.00022434769,0.00013494326,0.00022740499,0.00010776152,0.0001341362,0.009606255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989747,0.00028783485,0.00007609036,0.00016424894,0.0003725091,0.00012469152],"domain_scores_gemma":[0.99813193,0.00091461174,0.00016303186,0.00022202905,0.00043583027,0.00013259971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651536,0.00081809534,0.00045339396,0.0011486833,0.00075521594,0.0012208818,0.0015213303,0.00078826287,0.0019990592],"category_scores_gemma":[0.003241178,0.00044334627,0.00081398804,0.00049722247,0.0018355689,0.002072042,0.0013084231,0.0018260856,0.0003238475],"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.00020833188,0.00011570386,0.0008223938,0.00023800624,0.00005710608,0.00034944853,0.00030266444,0.632996,0.012755698,0.30554533,0.00092171755,0.045687657],"study_design_scores_gemma":[0.0000275028,0.00007756142,0.00011597811,0.000027989907,0.00005164285,0.000068144844,0.000033804125,0.9229324,0.008024116,0.06363552,0.0049828882,0.000022548724],"about_ca_topic_score_codex":0.005797462,"about_ca_topic_score_gemma":0.0067327083,"teacher_disagreement_score":0.005797462,"about_ca_system_score_codex":0.0018132603,"about_ca_system_score_gemma":0.0023840056,"threshold_uncertainty_score":0.013156176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95552474,0.0044310596,0.03163373,0.00053644,0.000083179715,0.00008154707,0.00011804984,0.00023729344,0.007353999],"genre_scores_gemma":[0.9958637,0.0011123643,0.0025326533,0.00003082321,0.000050185452,0.000019602683,0.00006267178,0.000017692297,0.0003101776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982827,0.00073043397,0.000072139315,0.00012403014,0.0005490983,0.00024170155],"domain_scores_gemma":[0.9914834,0.0063859667,0.00071428774,0.00029537166,0.0010235285,0.00009738903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019107059,0.00049965363,0.00045446624,0.001135623,0.0006782493,0.0012990023,0.0005731611,0.0008291131,0.0006288733],"category_scores_gemma":[0.011938668,0.0002076432,0.00023157422,0.0021126634,0.000663587,0.0022053667,0.00047073982,0.0008611596,0.000104675855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011933541,0.00046599706,0.06293927,0.00079284806,0.00028506824,0.0017649073,0.002356475,0.7533361,0.05474909,0.021802105,0.0033820842,0.09693277],"study_design_scores_gemma":[0.000041447653,0.00054326834,0.015159895,0.00007360669,0.000101596306,0.00045855428,0.00069315406,0.9554328,0.019256242,0.005987572,0.0022032573,0.000048568992],"about_ca_topic_score_codex":0.0047112918,"about_ca_topic_score_gemma":0.0016335937,"teacher_disagreement_score":0.0047112918,"about_ca_system_score_codex":0.0011931992,"about_ca_system_score_gemma":0.0004609048,"threshold_uncertainty_score":0.010104895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98136914,0.00017493474,0.016588826,0.000046563946,0.000009737852,0.00001745652,0.000029419316,0.00007743436,0.0016865808],"genre_scores_gemma":[0.9983438,0.00003716791,0.0015006685,0.0000036580457,0.0000023661041,0.000003638284,0.000013663898,0.0000038151807,0.00009118553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.00028517595,0.000018426175,0.000033848,0.00022612413,0.000100929916],"domain_scores_gemma":[0.9957326,0.0032041944,0.00028277535,0.00017388402,0.0005101566,0.000096394804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017262364,0.000410615,0.00023892775,0.00052958773,0.00029560406,0.00042113068,0.00039099524,0.00035964904,0.00052818074],"category_scores_gemma":[0.0062590437,0.00012466263,0.00016814022,0.0005486766,0.00043495483,0.0007431071,0.00020182112,0.000256431,0.000056127716],"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.00083767425,0.00027219407,0.010165544,0.00009246367,0.0000612451,0.00012506159,0.000111795925,0.9282823,0.024971662,0.00593489,0.00027339888,0.028871652],"study_design_scores_gemma":[0.0000135983255,0.00039651623,0.0016085433,0.0000037482553,0.000012608435,0.000032629057,0.000023524994,0.98513955,0.012138692,0.00053157844,0.000087475164,0.000011573892],"about_ca_topic_score_codex":0.0028555398,"about_ca_topic_score_gemma":0.0017463954,"teacher_disagreement_score":0.0028555398,"about_ca_system_score_codex":0.0009172414,"about_ca_system_score_gemma":0.00042109855,"threshold_uncertainty_score":0.009129345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036808502,0.0004459573,0.95725864,0.00023298313,0.00022509234,0.00007580933,0.000016042128,0.0023332878,0.0026036473],"genre_scores_gemma":[0.88887626,0.00021177217,0.10785739,0.0002776545,0.0002152873,0.000101549434,0.000034131783,0.000045614954,0.002380225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995041,0.00008327547,0.000030765797,0.00010740654,0.0002295681,0.000044860986],"domain_scores_gemma":[0.99930215,0.00015063546,0.00011607438,0.00008875152,0.00030207259,0.000040285522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063306326,0.0003704272,0.00035377452,0.000447091,0.00043476225,0.00067473174,0.0015546283,0.0006863807,0.001125631],"category_scores_gemma":[0.0013649064,0.00018168503,0.00029757322,0.00018329806,0.00040589695,0.0006407138,0.00033966475,0.0008537967,0.00036298487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007335852,0.0008026162,0.005233353,0.00047036994,0.00019367757,0.0007749149,0.000404461,0.19395067,0.28740546,0.036259126,0.00733758,0.46643418],"study_design_scores_gemma":[0.000111392925,0.00032913106,0.00062904035,0.00000989107,0.00004971363,0.0003417418,0.00001716912,0.95881957,0.03343064,0.0019595781,0.0042721904,0.000029893978],"about_ca_topic_score_codex":0.00075873797,"about_ca_topic_score_gemma":0.00063389464,"teacher_disagreement_score":0.0015546283,"about_ca_system_score_codex":0.0003650149,"about_ca_system_score_gemma":0.00043774836,"threshold_uncertainty_score":0.0037656426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018275386,0.0004245614,0.99320495,0.00026897542,0.000074265256,0.000020673126,0.00005065412,0.00010436637,0.0040240064],"genre_scores_gemma":[0.42004904,0.0050584152,0.56137204,0.0005495554,0.0013041905,0.00055724103,0.0002651402,0.00031895508,0.010525381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878865,0.0003580922,0.000073099545,0.00014063217,0.00050906837,0.00013041997],"domain_scores_gemma":[0.9979513,0.0012426918,0.00019076817,0.00024428795,0.00029440934,0.000076422075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023064339,0.0010691243,0.0007620738,0.001673021,0.0008876934,0.001635522,0.0017609022,0.001244032,0.0025919455],"category_scores_gemma":[0.0044828486,0.00050367176,0.0015988285,0.0012854908,0.0028335815,0.0028653883,0.0014343638,0.0025426757,0.0007380138],"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.000006320096,0.000015257927,0.000107693835,0.00004444812,0.000015153677,0.000074720156,0.00009876135,0.07829183,0.0009923468,0.91262716,0.0009931928,0.0067330706],"study_design_scores_gemma":[0.000010931446,0.000031795324,0.00008997157,0.000027937887,0.000021167167,0.00009482639,0.000040109004,0.35934752,0.0007586933,0.62898284,0.010573697,0.000020504633],"about_ca_topic_score_codex":0.0026664203,"about_ca_topic_score_gemma":0.0010551547,"teacher_disagreement_score":0.0026664203,"about_ca_system_score_codex":0.0016095517,"about_ca_system_score_gemma":0.0016747366,"threshold_uncertainty_score":0.012197733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8762746,0.0012155422,0.10999617,0.00028092013,0.000052627205,0.000049741262,0.00020745795,0.00089868886,0.011024263],"genre_scores_gemma":[0.99483526,0.0001539641,0.0044890684,0.000020359701,0.000009173766,0.0000075029766,0.00008896399,0.000024329405,0.00037137722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920565,0.00015279978,0.000033165055,0.000082819664,0.00038531492,0.00014032479],"domain_scores_gemma":[0.99806756,0.0008796871,0.000121829464,0.00015584486,0.0007012788,0.000073796335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009660702,0.00050005194,0.0003146155,0.0007514324,0.0002784522,0.0005853572,0.00044602383,0.00048196226,0.00074191263],"category_scores_gemma":[0.0035999357,0.00016508135,0.000159082,0.0007013749,0.00029907553,0.0007520779,0.00026214484,0.00033976597,0.00023617611],"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.0017950101,0.00030354288,0.018886121,0.00021712478,0.000088810055,0.000809443,0.00029704327,0.68943685,0.16044553,0.017997183,0.0025784243,0.10714484],"study_design_scores_gemma":[0.00000930624,0.00015924805,0.003634918,0.000005913218,0.000011809513,0.00011751526,0.000047976362,0.97394234,0.020191114,0.0011898353,0.0006780899,0.000011960189],"about_ca_topic_score_codex":0.002912195,"about_ca_topic_score_gemma":0.0009259458,"teacher_disagreement_score":0.002912195,"about_ca_system_score_codex":0.0007855974,"about_ca_system_score_gemma":0.00022766701,"threshold_uncertainty_score":0.0057905316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045426942,0.0006878774,0.9513632,0.00024762662,0.000062241255,0.000047866513,0.0000426511,0.00018397297,0.001937595],"genre_scores_gemma":[0.8993081,0.00047587176,0.098804586,0.00007998716,0.00008963453,0.00007617508,0.00005033151,0.000013265614,0.0011021793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956745,0.00014203653,0.000034762037,0.000065563916,0.0001410183,0.000049244005],"domain_scores_gemma":[0.99904674,0.0006163608,0.000067252855,0.000022257856,0.0002171713,0.0000301071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212151,0.0004288774,0.00046416768,0.00055917935,0.00044474416,0.0010180707,0.00058941747,0.00072368863,0.0005503818],"category_scores_gemma":[0.003097804,0.00022005849,0.00032358174,0.00038820392,0.0004559839,0.00069718517,0.000295546,0.00068012316,0.00012016614],"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.0005163005,0.00015327393,0.0035545966,0.00021395416,0.00009301011,0.00032847427,0.00038085153,0.7591252,0.020122277,0.029268175,0.0015361329,0.18470784],"study_design_scores_gemma":[0.000013846718,0.00004769195,0.00033466108,0.000015024165,0.000016818069,0.000020640346,0.000014583739,0.9941896,0.001338825,0.0037174174,0.0002801205,0.000010726254],"about_ca_topic_score_codex":0.008847263,"about_ca_topic_score_gemma":0.0056065023,"teacher_disagreement_score":0.008847263,"about_ca_system_score_codex":0.0008409375,"about_ca_system_score_gemma":0.0007751269,"threshold_uncertainty_score":0.017591536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00153272,0.00015199701,0.99549097,0.00023699239,0.00003430348,0.000038059858,0.000037034213,0.000098223725,0.0023798132],"genre_scores_gemma":[0.3475895,0.0018472016,0.64220977,0.000332473,0.00026658125,0.00091258634,0.0002171015,0.00017565583,0.0064491206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865746,0.00062270026,0.000109354754,0.00013591444,0.00040320685,0.00007129421],"domain_scores_gemma":[0.9983315,0.001040174,0.00016468525,0.00015361467,0.00026248628,0.00004748194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683638,0.0012300484,0.0006794348,0.0010908985,0.00065057154,0.0021881005,0.0030556908,0.0015557277,0.0012534095],"category_scores_gemma":[0.0051329425,0.00074497896,0.0010201645,0.0011515887,0.0016224765,0.0025379949,0.001430047,0.0025130408,0.00034363382],"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.000017354432,0.000064697095,0.0004840959,0.00008552479,0.000029857418,0.00013600798,0.00024096739,0.63749135,0.0015075717,0.34314448,0.00067727943,0.016120825],"study_design_scores_gemma":[0.0000050864824,0.000025884134,0.000082302926,0.00001628536,0.000013430253,0.000039086262,0.000029960103,0.93415266,0.00051531225,0.06078691,0.0043199924,0.000013067559],"about_ca_topic_score_codex":0.004873449,"about_ca_topic_score_gemma":0.0025679192,"teacher_disagreement_score":0.004873449,"about_ca_system_score_codex":0.0017260597,"about_ca_system_score_gemma":0.0013613513,"threshold_uncertainty_score":0.01252526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7061298,0.000770021,0.27925953,0.00047909142,0.00016947265,0.00011062808,0.00006141675,0.0009119649,0.012108067],"genre_scores_gemma":[0.9477928,0.00023883014,0.050650373,0.000076800425,0.0001485801,0.000037157708,0.00006316562,0.000021914393,0.00097044196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960333,0.00009833955,0.000019849882,0.000041292657,0.00013211406,0.00010495049],"domain_scores_gemma":[0.9986166,0.00033885334,0.00015816228,0.00021104852,0.00055827096,0.00011704015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009508998,0.00031897725,0.00028157947,0.0006234453,0.00087156874,0.0009964833,0.0009725555,0.0006386686,0.0011575051],"category_scores_gemma":[0.0019819366,0.00014040833,0.00012783376,0.00037049945,0.0005338877,0.0013240403,0.00052861945,0.00064855465,0.00020533164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010112894,0.0006679322,0.011039979,0.00027695013,0.00006289892,0.0010127662,0.00071397534,0.061596207,0.33218613,0.06572963,0.0048490977,0.5208531],"study_design_scores_gemma":[0.00013367558,0.0010397454,0.005748395,0.000051812305,0.00012152465,0.0012519723,0.00026191687,0.85213655,0.09984578,0.015061786,0.024259087,0.0000877489],"about_ca_topic_score_codex":0.0018673321,"about_ca_topic_score_gemma":0.0028922958,"teacher_disagreement_score":0.0018673321,"about_ca_system_score_codex":0.000528067,"about_ca_system_score_gemma":0.00050139695,"threshold_uncertainty_score":0.0050289035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3327333,0.00040952626,0.6641946,0.00031302628,0.000042304775,0.00013338684,0.000019322968,0.00046225922,0.0016922613],"genre_scores_gemma":[0.9630678,0.00008255925,0.036491632,0.00004541242,0.000025236004,0.00003219793,0.000023012952,0.000030477933,0.00020161647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9867953,0.006065489,0.0015607204,0.0012781343,0.0033209394,0.0009794479],"domain_scores_gemma":[0.9532336,0.028140651,0.0050564087,0.00924169,0.0038616685,0.000466043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019082194,0.00071295234,0.00067331595,0.0008225138,0.0009778584,0.0026790395,0.002456801,0.0013802955,0.0006145551],"category_scores_gemma":[0.06275224,0.0005929792,0.00059828,0.0006780664,0.0019900715,0.007648642,0.0025193049,0.0023262436,0.00010736134],"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.0019174332,0.0010198539,0.029812295,0.00024027511,0.00030833785,0.00046412754,0.0018899399,0.52596486,0.03909083,0.10630051,0.00046272122,0.29252875],"study_design_scores_gemma":[0.00006932145,0.00042713553,0.003192866,0.000026340578,0.00008399776,0.0002552587,0.0002295122,0.9441981,0.018640451,0.031932514,0.0008800166,0.000064505664],"about_ca_topic_score_codex":0.00067675975,"about_ca_topic_score_gemma":0.0004213903,"teacher_disagreement_score":0.019082194,"about_ca_system_score_codex":0.0010262732,"about_ca_system_score_gemma":0.0008170043,"threshold_uncertainty_score":0.10091746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8340691,0.007096506,0.11599457,0.0011005726,0.00095809816,0.00031995287,0.00033260923,0.00500601,0.03512259],"genre_scores_gemma":[0.9864594,0.0005773641,0.011178185,0.00010635714,0.0000772834,0.000049036462,0.00017365199,0.00012713924,0.0012517022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696106,0.0006995727,0.00015091305,0.00027790797,0.0014478378,0.00046267404],"domain_scores_gemma":[0.9936668,0.003309101,0.00034257822,0.00065424823,0.0017993279,0.00022790853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030501918,0.0008415675,0.0010189479,0.0010318314,0.0010787778,0.0019744853,0.0014375205,0.0013023422,0.0015602368],"category_scores_gemma":[0.019657826,0.000308321,0.0004037636,0.0012064823,0.00082479767,0.0027944192,0.0012461762,0.0014793581,0.00031770018],"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.004921866,0.0011052227,0.023659218,0.0011035544,0.00070198294,0.0014795765,0.0008783824,0.6623576,0.08917812,0.023533762,0.010263633,0.18081696],"study_design_scores_gemma":[0.0001528001,0.0012129997,0.003721228,0.000116721756,0.0002033116,0.0008614993,0.00035831932,0.9212282,0.057137623,0.0077694603,0.0071193436,0.00011853385],"about_ca_topic_score_codex":0.007289157,"about_ca_topic_score_gemma":0.0024151937,"teacher_disagreement_score":0.007289157,"about_ca_system_score_codex":0.0008757626,"about_ca_system_score_gemma":0.001079556,"threshold_uncertainty_score":0.016131163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54909396,0.0010045355,0.44382417,0.00020761335,0.0000564064,0.00010762635,0.00008718134,0.0008707793,0.004747692],"genre_scores_gemma":[0.99220043,0.00019650586,0.0071693407,0.000020728896,0.0000094845445,0.000022852902,0.000030659965,0.000016503334,0.00033357958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983011,0.0004927737,0.0000651954,0.00015304163,0.00066167384,0.00032620897],"domain_scores_gemma":[0.9925184,0.005065875,0.000651701,0.00037359743,0.0012575608,0.00013278828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026790907,0.00053641136,0.00076091057,0.0008559341,0.00045465166,0.00075337617,0.000734337,0.0007008607,0.001187203],"category_scores_gemma":[0.008936949,0.00024891098,0.00043355316,0.00067145604,0.0008323174,0.00089807075,0.000601971,0.000720232,0.0001555939],"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.00035146772,0.00007083702,0.0021056312,0.00006943392,0.00006422708,0.00015479652,0.00010449622,0.95850545,0.011409093,0.010912266,0.00033567954,0.015916588],"study_design_scores_gemma":[0.0000055894557,0.00006291329,0.00021746119,0.0000022564905,0.0000064497526,0.00002392364,0.0000045495813,0.9982418,0.0010765331,0.00031017224,0.00004276788,0.000005553633],"about_ca_topic_score_codex":0.0069459327,"about_ca_topic_score_gemma":0.0021238644,"teacher_disagreement_score":0.0069459327,"about_ca_system_score_codex":0.0013438573,"about_ca_system_score_gemma":0.0011216038,"threshold_uncertainty_score":0.0141685605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14749189,0.003457698,0.8420908,0.00016973297,0.00013621736,0.00004788474,0.000052435396,0.00036648233,0.006186909],"genre_scores_gemma":[0.9866948,0.00055311405,0.011148263,0.000022294333,0.000061356004,0.000028563223,0.00002143745,0.000026512898,0.0014435317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.00006732945,0.000007800738,0.000045241148,0.00009551154,0.00005468622],"domain_scores_gemma":[0.99967873,0.00015355683,0.00004510401,0.000022829629,0.00007484947,0.000025028527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006125584,0.0004539352,0.00036799838,0.00055411377,0.0003292748,0.00085779856,0.0004868753,0.000314626,0.0008274466],"category_scores_gemma":[0.00091432704,0.00021233111,0.00030301788,0.00042698134,0.0007405924,0.0010575877,0.0004850862,0.00039263535,0.000066313994],"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.00012337876,0.00002172593,0.00097318453,0.00006619853,0.000048717986,0.00013300512,0.000058907684,0.90401447,0.005477741,0.050153594,0.00087625714,0.03805283],"study_design_scores_gemma":[0.00000830894,0.000041273128,0.00028126547,0.000004282888,0.000019575933,0.000031772848,0.000013346801,0.98468035,0.0006639461,0.0134878745,0.0007590186,0.0000089346],"about_ca_topic_score_codex":0.0024805241,"about_ca_topic_score_gemma":0.001995815,"teacher_disagreement_score":0.0024805241,"about_ca_system_score_codex":0.00081268867,"about_ca_system_score_gemma":0.0004332433,"threshold_uncertainty_score":0.0058965087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3182805,0.00083699333,0.65023226,0.00059987744,0.00012902757,0.00017351202,0.00049416575,0.0076362733,0.021617414],"genre_scores_gemma":[0.90277696,0.00047963698,0.093203366,0.00011785078,0.0000834655,0.000061034032,0.0003473223,0.00018469323,0.0027457175],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.00006865808,0.000018606785,0.000039386356,0.0003018459,0.00011048852],"domain_scores_gemma":[0.99948174,0.00013830938,0.00006482795,0.0001038684,0.00018967659,0.000021617408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042946485,0.0003697417,0.00029776306,0.00092818413,0.0007462231,0.0008860734,0.00050675403,0.0005907918,0.001542045],"category_scores_gemma":[0.0013927321,0.00017199643,0.00017316478,0.00053755066,0.00029492084,0.00075179763,0.00052305305,0.0005031936,0.00059004506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056459615,0.00024035631,0.0041083843,0.00032175318,0.000110438865,0.00057971274,0.00041827798,0.094873965,0.52918255,0.06834368,0.009003216,0.2922531],"study_design_scores_gemma":[0.00005566495,0.00028185893,0.0017352748,0.000029687744,0.00005109696,0.0005285117,0.00016881249,0.71839327,0.2279102,0.027700434,0.02310062,0.00004444892],"about_ca_topic_score_codex":0.0014579729,"about_ca_topic_score_gemma":0.000854692,"teacher_disagreement_score":0.001542045,"about_ca_system_score_codex":0.0007652751,"about_ca_system_score_gemma":0.00035819257,"threshold_uncertainty_score":0.0055525303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016864937,0.0024550462,0.97838277,0.00026803275,0.00010602734,0.000070092894,0.000028308265,0.00022036188,0.0016043744],"genre_scores_gemma":[0.43855923,0.0025813545,0.55697453,0.00016496329,0.00023943445,0.00023816661,0.00010039365,0.0001424119,0.0009994853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981773,0.0010885254,0.00007448239,0.0001562087,0.00042561055,0.000077826975],"domain_scores_gemma":[0.9981388,0.00089331676,0.00025979624,0.00012582638,0.000520764,0.00006156007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036118736,0.0012541339,0.0009057956,0.0018200368,0.00038372172,0.00126617,0.0011756087,0.00089010334,0.00044008117],"category_scores_gemma":[0.007332258,0.0003140916,0.000437165,0.0017791798,0.00062956923,0.002045466,0.0008695957,0.0010128437,0.00015069582],"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.00014244583,0.000090666945,0.0017586432,0.00015218416,0.000108313136,0.00009864468,0.00010108813,0.8324926,0.010169596,0.046276893,0.002594829,0.106014214],"study_design_scores_gemma":[0.000005653936,0.00005687924,0.00021135781,0.000009152805,0.00001392561,0.00002569956,0.000009382501,0.9944478,0.0010182536,0.00339429,0.0007978329,0.0000097125885],"about_ca_topic_score_codex":0.001986265,"about_ca_topic_score_gemma":0.0012760954,"teacher_disagreement_score":0.0036118736,"about_ca_system_score_codex":0.00085940736,"about_ca_system_score_gemma":0.0008569501,"threshold_uncertainty_score":0.01910168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08508403,0.0008543744,0.9108297,0.00021943384,0.000042048887,0.000029955472,0.000032938704,0.0003618418,0.00254563],"genre_scores_gemma":[0.9698224,0.00026760774,0.029441599,0.000020601125,0.000023431678,0.000038833583,0.000020876212,0.000020959758,0.00034364642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999044,0.00046613743,0.000042426287,0.00013462103,0.00025008447,0.00006271659],"domain_scores_gemma":[0.9986841,0.0007800522,0.00015312035,0.00019836744,0.00015377523,0.00003050552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010464675,0.000454534,0.0005740928,0.00035955012,0.0003270641,0.0010423304,0.0004925449,0.00041282608,0.00065694074],"category_scores_gemma":[0.0055775973,0.00030196295,0.00025728226,0.00033242864,0.00092887285,0.002224644,0.00063667673,0.00088934496,0.000082488514],"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.000070968155,0.000012916818,0.0005167533,0.000043899698,0.000013840607,0.000034567496,0.00006462704,0.9328003,0.00404113,0.03419305,0.00017967474,0.02802823],"study_design_scores_gemma":[0.0000040356776,0.000024241608,0.00012370644,0.00000525896,0.000005131672,0.000019063347,0.000009776764,0.9867632,0.0013651195,0.0112769175,0.0003957921,0.000007760455],"about_ca_topic_score_codex":0.0016076938,"about_ca_topic_score_gemma":0.0011792167,"teacher_disagreement_score":0.0016076938,"about_ca_system_score_codex":0.00070123386,"about_ca_system_score_gemma":0.0005713293,"threshold_uncertainty_score":0.0055342913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46806496,0.00031877848,0.52783275,0.00018524402,0.00003962191,0.00003089285,0.0001122586,0.000281618,0.0031338688],"genre_scores_gemma":[0.9893969,0.00011823056,0.009826733,0.000022978058,0.000009238947,0.000013766149,0.000054294356,0.000009943357,0.0005479612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.000063584586,0.000013094846,0.00004223385,0.000057330053,0.000023964843],"domain_scores_gemma":[0.99934274,0.00043309433,0.000058920006,0.0000319819,0.00011304181,0.00002017227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507988,0.00035626977,0.00039780518,0.00022097919,0.00016433817,0.00047633945,0.00042310037,0.0006318216,0.0004902841],"category_scores_gemma":[0.0019926045,0.00016322282,0.0003155527,0.00019087213,0.00026226233,0.0006620154,0.00036623378,0.0004390671,0.00012735087],"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.00004960798,0.000015572688,0.00072946836,0.00000785232,0.000007343876,0.00003707566,0.000009858111,0.9910851,0.0009709165,0.0006438822,0.0000476183,0.0063956464],"study_design_scores_gemma":[0.0000021782303,0.0000140262,0.00016565666,9.3416764e-7,0.0000018188324,0.0000046758123,0.0000012932384,0.9993555,0.00018789466,0.00024268671,0.000021414831,0.000001884213],"about_ca_topic_score_codex":0.006806268,"about_ca_topic_score_gemma":0.0027429785,"teacher_disagreement_score":0.006806268,"about_ca_system_score_codex":0.0003385925,"about_ca_system_score_gemma":0.0002680253,"threshold_uncertainty_score":0.013533294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82030046,0.0028029424,0.16383052,0.0003433963,0.0000783432,0.00009490247,0.00020752301,0.0005309221,0.0118110515],"genre_scores_gemma":[0.9908641,0.00041981213,0.007817589,0.000032673604,0.0000145102085,0.000019666397,0.00012501885,0.000023619716,0.00068296096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988997,0.00029400253,0.00003693726,0.00006792959,0.000544967,0.00015644479],"domain_scores_gemma":[0.9981086,0.0009857799,0.00015687438,0.00017950314,0.00049190456,0.000077325654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014367522,0.0006910932,0.00040396838,0.0007401638,0.00035919432,0.0007137627,0.0006371214,0.0005289387,0.0009330236],"category_scores_gemma":[0.005625448,0.00016781475,0.00024941342,0.00080095284,0.00032569686,0.0007977263,0.00037817738,0.00040756847,0.00020865159],"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.0005311244,0.00013376294,0.0070588114,0.00018673993,0.000074119096,0.00025756963,0.00013387001,0.90045965,0.030360395,0.01442565,0.0006923678,0.04568595],"study_design_scores_gemma":[0.000006684561,0.00009973497,0.0014933463,0.000009279505,0.000015277084,0.00006158732,0.000025126114,0.9898717,0.0061737215,0.0017230407,0.00051319436,0.0000073824153],"about_ca_topic_score_codex":0.0039178557,"about_ca_topic_score_gemma":0.0017909834,"teacher_disagreement_score":0.0039178557,"about_ca_system_score_codex":0.0014636862,"about_ca_system_score_gemma":0.00057576434,"threshold_uncertainty_score":0.010619819},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66379,0.0006640048,0.32257992,0.00059117936,0.0002101512,0.0002856078,0.00016454954,0.0021712992,0.009543327],"genre_scores_gemma":[0.9786057,0.00008223742,0.019571897,0.00006545144,0.00007419237,0.000047962898,0.00011223577,0.00006183865,0.0013785488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992855,0.0001420757,0.000046978887,0.0001377594,0.00025455054,0.00013312543],"domain_scores_gemma":[0.99826175,0.0003866445,0.00018273044,0.00026428717,0.0007017799,0.00020275355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007444761,0.00055516476,0.0006325681,0.0011595654,0.0010431504,0.0013303839,0.001418739,0.0006368491,0.0016474334],"category_scores_gemma":[0.0036598674,0.00020173262,0.00019997686,0.00083004194,0.0004320306,0.0012252885,0.0009552544,0.0005042826,0.00063668523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002129782,0.0015098715,0.015099217,0.00027200676,0.00014292361,0.00039263067,0.0006663756,0.20271981,0.27328977,0.01554977,0.007737664,0.48049018],"study_design_scores_gemma":[0.00011277457,0.0003047973,0.0031964164,0.00001703486,0.00004856215,0.0002540949,0.00036944577,0.93364406,0.050122857,0.006040169,0.005848102,0.00004171486],"about_ca_topic_score_codex":0.00094352214,"about_ca_topic_score_gemma":0.001237315,"teacher_disagreement_score":0.0016474334,"about_ca_system_score_codex":0.00091491576,"about_ca_system_score_gemma":0.00075749506,"threshold_uncertainty_score":0.006638229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99620265,0.00004196567,0.003045417,0.000035815676,0.0000038834582,0.000008625817,0.000045585206,0.00009466955,0.00052132003],"genre_scores_gemma":[0.9993449,0.000022214426,0.00042963657,0.000004524218,0.0000021559097,0.0000053981776,0.0000801177,0.0000073798274,0.00010363711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993135,0.00026376775,0.00004164383,0.000072423885,0.0002228873,0.00008570377],"domain_scores_gemma":[0.99655837,0.0020436205,0.00031855784,0.00017161798,0.0007661991,0.00014159706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221263,0.00027384097,0.00024684236,0.0011244457,0.00038920942,0.00047996588,0.00041622377,0.0005744184,0.00056638505],"category_scores_gemma":[0.0063172793,0.00015176609,0.00011945622,0.000941948,0.0004632774,0.0007333153,0.0002407925,0.00026655942,0.0001388155],"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.0022300216,0.00065804995,0.21667854,0.00025193163,0.0001390902,0.0021165612,0.0022831848,0.5785969,0.13287574,0.010166032,0.0018045525,0.05219941],"study_design_scores_gemma":[0.000027004982,0.00028438432,0.054191943,0.00002553437,0.000020239537,0.0006622787,0.0004375051,0.92656696,0.014981802,0.0021131968,0.0006505501,0.000038681967],"about_ca_topic_score_codex":0.0032417916,"about_ca_topic_score_gemma":0.0014826774,"teacher_disagreement_score":0.0032417916,"about_ca_system_score_codex":0.00095766067,"about_ca_system_score_gemma":0.00019459333,"threshold_uncertainty_score":0.0069484115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25222296,0.0007755418,0.73187983,0.00081383355,0.00016180899,0.00007556768,0.000022280576,0.0007190361,0.0133291185],"genre_scores_gemma":[0.9802168,0.00016617359,0.017882073,0.000043730768,0.00006881633,0.000032971864,0.000011808788,0.000034107285,0.0015436179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878806,0.00048651808,0.00004728746,0.00009465644,0.00037591404,0.0002076563],"domain_scores_gemma":[0.9974589,0.001268695,0.00026035868,0.000316621,0.00042536343,0.0002701035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016986576,0.00043926158,0.0004970078,0.00034149567,0.0008450699,0.0018980245,0.0014178501,0.00071553246,0.0012216793],"category_scores_gemma":[0.0060393782,0.00025446166,0.00026618916,0.00043584863,0.0007584795,0.0022715654,0.001257798,0.0007328793,0.00024460192],"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.00041970846,0.00040057456,0.0043418473,0.00013081114,0.000081585255,0.0011263797,0.0010364194,0.5099573,0.037711404,0.25257027,0.0043001184,0.18792363],"study_design_scores_gemma":[0.000022099106,0.000052108946,0.0005157923,0.0000060465854,0.000012736084,0.00012391491,0.00008854432,0.9628021,0.0029252502,0.029846879,0.0035824168,0.000022063517],"about_ca_topic_score_codex":0.001732233,"about_ca_topic_score_gemma":0.0012251373,"teacher_disagreement_score":0.0018980245,"about_ca_system_score_codex":0.0006588177,"about_ca_system_score_gemma":0.00049152854,"threshold_uncertainty_score":0.008983493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98551154,0.00010700889,0.011655271,0.00003470785,0.000008887307,0.00003827291,0.00016599281,0.00031108907,0.002167136],"genre_scores_gemma":[0.9982893,0.000036772875,0.0012725194,0.0000042620377,0.000003776331,0.000008778432,0.00016116201,0.000014770333,0.0002086451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987205,0.00038969418,0.00006808356,0.00013054446,0.00048405302,0.00020713551],"domain_scores_gemma":[0.99501836,0.0026172285,0.00044313184,0.00037613578,0.0013577295,0.00018747803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014533624,0.0005721838,0.00043532398,0.0009640115,0.00045045168,0.00080870604,0.0006488774,0.00052514166,0.0011637127],"category_scores_gemma":[0.0067464625,0.000114632596,0.0001792179,0.0010233251,0.0004432214,0.0008123813,0.00041592037,0.00029118898,0.00016544771],"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.0029475347,0.0004892936,0.051071674,0.00034185543,0.00013462717,0.00080869574,0.00057707913,0.613823,0.2325939,0.004858375,0.0012875326,0.091066524],"study_design_scores_gemma":[0.000033719607,0.00089214684,0.018565621,0.000010941809,0.000051919047,0.00023224675,0.00020763262,0.9023303,0.0763444,0.00060978625,0.00069012097,0.000031179083],"about_ca_topic_score_codex":0.0067723165,"about_ca_topic_score_gemma":0.0024635098,"teacher_disagreement_score":0.0067723165,"about_ca_system_score_codex":0.0013312205,"about_ca_system_score_gemma":0.0005371686,"threshold_uncertainty_score":0.013465762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074205506,0.0009202341,0.988937,0.00017411224,0.000088211214,0.00006237664,0.000018386436,0.00031517883,0.002063941],"genre_scores_gemma":[0.7355843,0.0034380641,0.25408235,0.00023900665,0.00053831504,0.0003546635,0.00014064123,0.00017174303,0.005450879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780244,0.0007185122,0.00012461696,0.0003033347,0.00082060735,0.00023039174],"domain_scores_gemma":[0.9954804,0.0023996234,0.00053237006,0.00044598524,0.0010540113,0.00008751399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004055041,0.0012384487,0.0010234889,0.001128618,0.0007008103,0.0017567163,0.0023333302,0.0010591525,0.0014668271],"category_scores_gemma":[0.0101388125,0.00040364175,0.0006482784,0.00084447616,0.0013359288,0.0028855458,0.0008483766,0.0016613116,0.00055575796],"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.0002851508,0.00021010969,0.00072686374,0.00026787323,0.000071818904,0.0003366291,0.00024213176,0.544473,0.02983722,0.29330266,0.0030446122,0.12720202],"study_design_scores_gemma":[0.00002608379,0.00009938987,0.00017153173,0.000021187392,0.000031770574,0.00010669985,0.000014273013,0.9655024,0.004289903,0.02712423,0.0025815887,0.000030946154],"about_ca_topic_score_codex":0.001416669,"about_ca_topic_score_gemma":0.0012979204,"teacher_disagreement_score":0.004055041,"about_ca_system_score_codex":0.0011849751,"about_ca_system_score_gemma":0.00090575934,"threshold_uncertainty_score":0.021445334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181148,0.0002632739,0.14426139,0.00050428184,0.00027242725,0.00093736546,0.00281977,0.005042225,0.027784504],"genre_scores_gemma":[0.93455565,0.00027242192,0.055872288,0.00012747,0.000050541417,0.00073339517,0.0022689048,0.00024547955,0.005873731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989391,0.00043436312,0.000061781,0.00012847049,0.00026455478,0.00017170703],"domain_scores_gemma":[0.99889046,0.00039697925,0.00008285309,0.00020523691,0.0002727645,0.000151715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014465263,0.00048253065,0.0004188105,0.000618982,0.000778669,0.00061700924,0.0010673368,0.00061744684,0.0045207576],"category_scores_gemma":[0.0018111254,0.00018623412,0.00024462666,0.001051922,0.00033372073,0.0007854765,0.00071371335,0.0006764144,0.0006625592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024264145,0.0041887457,0.013374416,0.0005449807,0.00014076539,0.0026318645,0.00093258807,0.40928128,0.40409747,0.051417213,0.019748429,0.09121582],"study_design_scores_gemma":[0.0005698164,0.0053590667,0.0073853876,0.00006420526,0.00006546517,0.0008265012,0.00051193807,0.5896265,0.33783537,0.011631864,0.0459985,0.00012537916],"about_ca_topic_score_codex":0.0013320588,"about_ca_topic_score_gemma":0.0009292782,"teacher_disagreement_score":0.0045207576,"about_ca_system_score_codex":0.0006981336,"about_ca_system_score_gemma":0.00038094784,"threshold_uncertainty_score":0.015123367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016001133,0.00005375815,0.9962453,0.000035196503,0.00003982148,0.00005387065,0.000031135984,0.0009583935,0.0009823345],"genre_scores_gemma":[0.08874628,0.00038423852,0.90728617,0.00005823744,0.000056940484,0.0005234921,0.00021043632,0.0003919683,0.002342252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986343,0.00057823496,0.00009413921,0.000104253006,0.0005319214,0.000057182893],"domain_scores_gemma":[0.9982303,0.0010865388,0.0001002835,0.00024552792,0.00027701154,0.000060322036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020311456,0.0011300826,0.00088942895,0.0012975229,0.00060988305,0.0014155572,0.0017808905,0.00080179016,0.0026626254],"category_scores_gemma":[0.0031249213,0.00063298125,0.0010505739,0.0010947217,0.00074460387,0.0016930964,0.0011300364,0.0012166515,0.00080054766],"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.0001359292,0.00011706303,0.001260789,0.000305585,0.0002201798,0.00023802869,0.0001945303,0.7529669,0.0096275695,0.076262504,0.002793625,0.15587735],"study_design_scores_gemma":[0.000020766862,0.00003086361,0.000089041736,0.000016401484,0.000021820408,0.000050225743,0.000014223815,0.97832507,0.0019664364,0.012451067,0.0069956216,0.000018586805],"about_ca_topic_score_codex":0.005809419,"about_ca_topic_score_gemma":0.005632059,"teacher_disagreement_score":0.005809419,"about_ca_system_score_codex":0.0008075682,"about_ca_system_score_gemma":0.001454833,"threshold_uncertainty_score":0.011551201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11289806,0.00060785766,0.87330693,0.00033980387,0.00007041323,0.00018750645,0.00015375498,0.0024363631,0.009999282],"genre_scores_gemma":[0.8463112,0.00034039476,0.14768893,0.00007484812,0.00009744474,0.00020968982,0.0002716146,0.00013781677,0.0048680105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.00012722294,0.000033984194,0.00010026304,0.00031406948,0.00012170835],"domain_scores_gemma":[0.9989008,0.00043823154,0.0000856219,0.0002532646,0.00022465619,0.00009736388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003772,0.00047431866,0.00068183814,0.00035719294,0.00057232013,0.00076894916,0.0014592049,0.0005407113,0.0017813321],"category_scores_gemma":[0.0024013105,0.00030701162,0.00032345686,0.00054510025,0.00039085024,0.0011036878,0.0010880905,0.0008531709,0.00039197545],"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.0005099055,0.00022378434,0.0019275554,0.00020464521,0.00009887166,0.0005804856,0.00030318587,0.5750921,0.08871612,0.07774378,0.008024094,0.24657556],"study_design_scores_gemma":[0.000023909968,0.000043261596,0.0002275446,0.000004785972,0.00001128782,0.000053070267,0.000026069401,0.983943,0.0053011337,0.008596699,0.0017611671,0.000008123336],"about_ca_topic_score_codex":0.0029340617,"about_ca_topic_score_gemma":0.002619706,"teacher_disagreement_score":0.0029340617,"about_ca_system_score_codex":0.00094544474,"about_ca_system_score_gemma":0.0008585741,"threshold_uncertainty_score":0.0068597198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097837485,0.00020333094,0.9002903,0.00012690049,0.000033016888,0.000040359613,0.00003317663,0.00085695094,0.0005784521],"genre_scores_gemma":[0.9180024,0.00014759191,0.08137311,0.000033301625,0.000018970932,0.000057394864,0.000058504113,0.00004306962,0.0002656672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99793136,0.00064071326,0.00007866073,0.00028113724,0.000991326,0.00007682852],"domain_scores_gemma":[0.99727017,0.0014615373,0.00036642177,0.000390272,0.00044884512,0.00006283504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018303423,0.00042335776,0.00067885104,0.0007240936,0.00033545916,0.00070644025,0.0012743475,0.0008044756,0.00040214753],"category_scores_gemma":[0.007137505,0.00027408832,0.00020677844,0.00057786755,0.0007386073,0.0016575545,0.0009610975,0.00095565635,0.00014307135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009013613,0.0005822074,0.011771325,0.00023753401,0.0000554391,0.00030770275,0.0006070629,0.39229804,0.17381126,0.010347939,0.0013777727,0.4077024],"study_design_scores_gemma":[0.0000072640873,0.000083205654,0.0010090113,0.0000043931664,0.000004634695,0.000050318475,0.00001759896,0.9807849,0.01660813,0.0011772902,0.00023866104,0.000014665186],"about_ca_topic_score_codex":0.0018854664,"about_ca_topic_score_gemma":0.00075950957,"teacher_disagreement_score":0.0018854664,"about_ca_system_score_codex":0.001126767,"about_ca_system_score_gemma":0.0005444885,"threshold_uncertainty_score":0.009679854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019102555,0.00090990367,0.9601829,0.00035507441,0.000121601035,0.00010241992,0.000048175232,0.0025633653,0.016614022],"genre_scores_gemma":[0.31710756,0.0017223593,0.6666802,0.000118614975,0.00012879624,0.00035668397,0.00018944968,0.00019996903,0.0134963365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.0001839619,0.000032205025,0.000048761558,0.00016117908,0.000031975134],"domain_scores_gemma":[0.99939513,0.00024321141,0.000042409803,0.00010627268,0.00018227441,0.00003062522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084398186,0.0003646346,0.0005361992,0.00062191096,0.0005347466,0.0012941166,0.0010373025,0.000593088,0.003517853],"category_scores_gemma":[0.0018847927,0.00024034774,0.00023739434,0.00067686546,0.0004927691,0.0012766758,0.00094863353,0.0007081503,0.0009799112],"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.0001058531,0.000077949495,0.00049476296,0.00010264978,0.00005215181,0.000110754234,0.00013037736,0.6761755,0.0033786867,0.12893908,0.004853408,0.18557887],"study_design_scores_gemma":[0.00003204793,0.00005094011,0.00008988125,0.000012455549,0.000013855312,0.000041466737,0.00002183304,0.9498615,0.0011150765,0.037388775,0.011362554,0.000009658151],"about_ca_topic_score_codex":0.0019508166,"about_ca_topic_score_gemma":0.0017744639,"teacher_disagreement_score":0.003517853,"about_ca_system_score_codex":0.0005876796,"about_ca_system_score_gemma":0.0005429423,"threshold_uncertainty_score":0.01176846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028421937,0.0002645148,0.96492106,0.000550839,0.000053206742,0.000095687144,0.000028017963,0.0009876158,0.0046770303],"genre_scores_gemma":[0.4089964,0.00044081666,0.5856725,0.00024927827,0.00016136393,0.00021399593,0.00010187078,0.00007355146,0.004090206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00015368253,0.000035001074,0.000057420883,0.0002505481,0.00005817803],"domain_scores_gemma":[0.99898773,0.00028986664,0.00010171744,0.00035867115,0.00021014446,0.00005181898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008154506,0.00036309578,0.0003665988,0.0006646899,0.0008193213,0.0009363252,0.0011380754,0.0007410708,0.0010992184],"category_scores_gemma":[0.0015059012,0.00022131718,0.00041138372,0.00068323896,0.0007937079,0.0027199555,0.0011647847,0.0011320728,0.00028440703],"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.00024818128,0.00040089147,0.0018061867,0.00024971023,0.000089512425,0.000414374,0.00076422363,0.069996595,0.118422166,0.3326839,0.003973433,0.4709508],"study_design_scores_gemma":[0.00007475491,0.00027812325,0.00050118077,0.000048181788,0.00011473132,0.00046575902,0.00016137563,0.78852344,0.110447764,0.0734758,0.025842983,0.00006590294],"about_ca_topic_score_codex":0.00084658264,"about_ca_topic_score_gemma":0.0009780653,"teacher_disagreement_score":0.0011380754,"about_ca_system_score_codex":0.00067955273,"about_ca_system_score_gemma":0.00074991834,"threshold_uncertainty_score":0.004930496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042781387,0.0026743812,0.93453443,0.002332856,0.00033514676,0.00011640287,0.00016691188,0.001083905,0.015974697],"genre_scores_gemma":[0.82815653,0.0039300285,0.15363573,0.00080582674,0.00081343396,0.0004280189,0.00031482006,0.00021909257,0.011696578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976882,0.0005019411,0.0001389968,0.00026499518,0.0010403289,0.00036553017],"domain_scores_gemma":[0.99441344,0.0027619272,0.0006944629,0.00082130614,0.00091307197,0.00039593352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003415787,0.00062287046,0.0005851408,0.0008654927,0.0014538538,0.0023642483,0.001992155,0.0014204673,0.00490179],"category_scores_gemma":[0.011262102,0.00048904296,0.00039835964,0.0009323486,0.0016302096,0.00404648,0.0032851244,0.0020298653,0.0008713607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032383428,0.00006234932,0.0008392062,0.00026194303,0.00003586052,0.00031574554,0.0006035164,0.04078903,0.011046693,0.85081923,0.006864868,0.0880377],"study_design_scores_gemma":[0.00013217868,0.00022037,0.0006591448,0.00011918503,0.000049364015,0.00046444082,0.00023215919,0.29073012,0.005916653,0.6352633,0.06613348,0.00007958636],"about_ca_topic_score_codex":0.0011307898,"about_ca_topic_score_gemma":0.0008371482,"teacher_disagreement_score":0.00490179,"about_ca_system_score_codex":0.001194417,"about_ca_system_score_gemma":0.00093434856,"threshold_uncertainty_score":0.018064678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93231034,0.004779826,0.036603644,0.0027222617,0.0002193874,0.000031370262,0.00010691395,0.0003430286,0.022883192],"genre_scores_gemma":[0.99692255,0.0010994173,0.0010311797,0.00009565481,0.000056917124,0.0000060017956,0.000016139502,0.000025604304,0.0007463905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99948287,0.0002558324,0.000007679083,0.000035895453,0.00012903145,0.00008873523],"domain_scores_gemma":[0.99528044,0.0039310753,0.00022176519,0.00013745166,0.0002823417,0.00014681903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071291596,0.0004427831,0.00045065462,0.0003641083,0.0005029272,0.0005581795,0.00042739935,0.0006997105,0.0016703074],"category_scores_gemma":[0.0060139736,0.00016130507,0.00030618702,0.00038919627,0.0008509528,0.0010245778,0.0005227191,0.0008493642,0.00013150407],"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.0007272815,0.00029637813,0.005038882,0.0001804555,0.00004411027,0.00066757336,0.0003111139,0.8832398,0.026898982,0.0314579,0.0031226203,0.04801486],"study_design_scores_gemma":[0.00004380278,0.00019156,0.00327029,0.000024178313,0.000036795696,0.00010796121,0.00016068266,0.97824746,0.0061695045,0.010628267,0.0010912888,0.000028207232],"about_ca_topic_score_codex":0.008524781,"about_ca_topic_score_gemma":0.0025670303,"teacher_disagreement_score":0.008524781,"about_ca_system_score_codex":0.0009256026,"about_ca_system_score_gemma":0.0003446519,"threshold_uncertainty_score":0.01695031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59640235,0.0008430414,0.39493027,0.00061375374,0.00010552037,0.000058345617,0.0000754651,0.00023663961,0.006734682],"genre_scores_gemma":[0.9882274,0.00033942642,0.008450402,0.000039900504,0.0000427152,0.00003556902,0.000025999583,0.000039252624,0.0027992695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997763,0.00006151575,0.000007748038,0.000025961008,0.00006640043,0.00006214255],"domain_scores_gemma":[0.99778455,0.0013409925,0.0004285162,0.00006981366,0.0002106122,0.00016549377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983381,0.00046188117,0.000528365,0.0007302472,0.0005788799,0.0010683521,0.000584292,0.00073741627,0.0016385168],"category_scores_gemma":[0.005134659,0.00032578353,0.0004891864,0.0004537656,0.001494989,0.0013068011,0.0007670924,0.0009905295,0.0001597746],"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.00015340385,0.000050885374,0.0011900908,0.00007066366,0.00003891892,0.00062913937,0.00029657764,0.8267063,0.014311697,0.1516124,0.00054374256,0.0043961676],"study_design_scores_gemma":[0.0000057023994,0.000022877983,0.000227968,0.0000045742263,0.000007648095,0.00004026005,0.00002870434,0.9882758,0.0011226111,0.010124117,0.00012630069,0.00001337728],"about_ca_topic_score_codex":0.0019509983,"about_ca_topic_score_gemma":0.0009382183,"teacher_disagreement_score":0.0019509983,"about_ca_system_score_codex":0.0012572082,"about_ca_system_score_gemma":0.00053559797,"threshold_uncertainty_score":0.009121776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07721262,0.00018649496,0.92169523,0.0000719177,0.00001970045,0.000028659611,0.000021171043,0.00030132028,0.0004628979],"genre_scores_gemma":[0.97248197,0.00011962872,0.0270507,0.000019652325,0.000008426838,0.000023568558,0.000035201814,0.000014594189,0.0002461941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00018028516,0.000028420414,0.0001367812,0.00028806712,0.00004316812],"domain_scores_gemma":[0.9982992,0.001021047,0.00031469497,0.00009668954,0.00023209973,0.00003633636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490028,0.00050751586,0.00037794354,0.00058569905,0.00024479209,0.0005550285,0.0008239606,0.0003879605,0.00025014358],"category_scores_gemma":[0.0041345176,0.0002500885,0.00026849334,0.00031432137,0.0004796354,0.0007415215,0.00043771707,0.0006060263,0.000061506675],"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.00019148545,0.00008366026,0.0038960178,0.00009952559,0.000037929436,0.00010216502,0.00009435348,0.91739595,0.025758991,0.0037294063,0.00027029103,0.04834009],"study_design_scores_gemma":[0.0000017390789,0.000027126,0.0003981494,0.0000015077856,0.0000038488515,0.000013971727,0.00000397999,0.99696213,0.002266859,0.00026443898,0.000050839044,0.0000053362073],"about_ca_topic_score_codex":0.0034580622,"about_ca_topic_score_gemma":0.0017357102,"teacher_disagreement_score":0.0034580622,"about_ca_system_score_codex":0.0006817381,"about_ca_system_score_gemma":0.00043962183,"threshold_uncertainty_score":0.0068758726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010194262,0.0007263057,0.9723913,0.00019310662,0.0002760588,0.00023555497,0.00017922025,0.006542714,0.009261456],"genre_scores_gemma":[0.4388198,0.0010043884,0.5347314,0.00044720824,0.00024225516,0.00060246896,0.0016948358,0.000725411,0.021732323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938583,0.00018120886,0.000050099952,0.00006604969,0.00023856897,0.00007823051],"domain_scores_gemma":[0.9995875,0.00010441652,0.000041886095,0.00014403531,0.00008338891,0.000038765393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316839,0.000305769,0.0004682763,0.00042417055,0.00048749687,0.0009945086,0.0014619109,0.0005973362,0.0029233485],"category_scores_gemma":[0.001375648,0.00019575904,0.0002876897,0.00039133322,0.0003680419,0.0009715701,0.0010220478,0.0012241383,0.0017461884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053651625,0.00026661906,0.0010464843,0.0005176954,0.0001361957,0.00085219374,0.00038241493,0.039574064,0.1279605,0.18853447,0.031486265,0.6087066],"study_design_scores_gemma":[0.00019697536,0.00056641793,0.0012952768,0.00009692745,0.00013574648,0.001741098,0.00015826902,0.49467385,0.101812355,0.0480847,0.35103074,0.00020757034],"about_ca_topic_score_codex":0.000606885,"about_ca_topic_score_gemma":0.0011078005,"teacher_disagreement_score":0.0029233485,"about_ca_system_score_codex":0.0003887589,"about_ca_system_score_gemma":0.00074984186,"threshold_uncertainty_score":0.0097795725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005221882,0.0028717683,0.97307897,0.0010190204,0.0024049045,0.000773129,0.0005594242,0.0028190326,0.011251842],"genre_scores_gemma":[0.12231311,0.005231067,0.82501936,0.002519335,0.0022924982,0.0051766676,0.0018542133,0.0006269467,0.03496682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980465,0.00036520718,0.00016574525,0.00031631996,0.0009450804,0.00016113943],"domain_scores_gemma":[0.9986847,0.00037474214,0.00012831499,0.00027458835,0.00045587242,0.00008179323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018679667,0.0008154604,0.0008102927,0.0015345124,0.001437693,0.0016711059,0.0016271748,0.0017502734,0.006051289],"category_scores_gemma":[0.003061597,0.00043003392,0.00078777253,0.0014692422,0.001619355,0.0033178267,0.001749613,0.0040033935,0.0023259658],"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.0006079006,0.00020067971,0.00035772164,0.0008039704,0.00012215786,0.000656312,0.00047128022,0.013159547,0.07826131,0.46805468,0.065350205,0.37195423],"study_design_scores_gemma":[0.00047652217,0.0008582722,0.00073038717,0.00021571395,0.00028149888,0.0024207155,0.00009576357,0.18158764,0.06565659,0.1805842,0.5667894,0.00030334413],"about_ca_topic_score_codex":0.00062961335,"about_ca_topic_score_gemma":0.00087835867,"teacher_disagreement_score":0.006051289,"about_ca_system_score_codex":0.0008013525,"about_ca_system_score_gemma":0.0012286688,"threshold_uncertainty_score":0.020243645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015126442,0.0002032527,0.98333573,0.00012053503,0.000013747736,0.000024507428,0.00004406565,0.00037058422,0.0007611244],"genre_scores_gemma":[0.86586195,0.00052602007,0.12878844,0.00009564457,0.000039804483,0.00023453076,0.0003697327,0.00012543511,0.003958464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995548,0.00012743902,0.000022550146,0.00012932952,0.00011274213,0.00005319663],"domain_scores_gemma":[0.998425,0.0010647153,0.00015673265,0.000099853045,0.00023042977,0.000023311673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011510103,0.0007906932,0.00083925837,0.0005687079,0.00036833883,0.0008942761,0.0007160474,0.00080382044,0.0017540465],"category_scores_gemma":[0.0065583102,0.0004764076,0.00042549256,0.00042908266,0.0005407028,0.00096435647,0.00068461354,0.0013393895,0.00056177477],"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.0000729751,0.000024528315,0.0008143232,0.00006534014,0.000028387265,0.00004805105,0.00007669058,0.94451225,0.0024678023,0.0062456336,0.0004730543,0.04517087],"study_design_scores_gemma":[0.0000035609958,0.000007809966,0.00018930784,0.000003070789,0.0000030736896,0.00001043182,0.0000038831113,0.9978422,0.0003572079,0.001396736,0.00017725308,0.000005485525],"about_ca_topic_score_codex":0.010383776,"about_ca_topic_score_gemma":0.0067463345,"teacher_disagreement_score":0.010383776,"about_ca_system_score_codex":0.0008546957,"about_ca_system_score_gemma":0.0008866079,"threshold_uncertainty_score":0.020646691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015646419,0.0006197095,0.97361463,0.00019220768,0.0003370758,0.00019333296,0.00042357834,0.003985898,0.0049871164],"genre_scores_gemma":[0.47683898,0.0006897841,0.51323,0.00022964744,0.0003056398,0.00026360387,0.0011120264,0.00036485525,0.0069654477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995146,0.00008061635,0.000048659604,0.00007154293,0.00018687763,0.000097855125],"domain_scores_gemma":[0.99921453,0.00012704547,0.00009662189,0.00033864548,0.00011040513,0.000112787726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424758,0.00046273106,0.0005135072,0.0009317341,0.00088998454,0.0013753579,0.0022784611,0.00047319685,0.0040377956],"category_scores_gemma":[0.0015223084,0.00030587893,0.00039560176,0.0009506295,0.00067849114,0.001227252,0.0017231053,0.0014495205,0.00095543877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011106518,0.0003576872,0.0010386792,0.00039480758,0.00007099292,0.00026923924,0.0002390873,0.11179515,0.04848545,0.14701678,0.020069081,0.66915244],"study_design_scores_gemma":[0.00040381093,0.0004608414,0.00074736495,0.000048225647,0.000060772192,0.00046340248,0.00004363536,0.8093951,0.035407748,0.06960411,0.08324365,0.000121358076],"about_ca_topic_score_codex":0.0008339865,"about_ca_topic_score_gemma":0.0012042078,"teacher_disagreement_score":0.0040377956,"about_ca_system_score_codex":0.0011062814,"about_ca_system_score_gemma":0.00097578083,"threshold_uncertainty_score":0.013507783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049012866,0.0043403534,0.8507196,0.00041378135,0.0006232841,0.0001257151,0.00021967066,0.0028770014,0.09166783],"genre_scores_gemma":[0.75772715,0.0021550234,0.17373529,0.00010863257,0.0003309603,0.00018384245,0.00047417026,0.00034091814,0.06494396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983776,0.000032027936,0.0000057444836,0.000018251232,0.000076391414,0.000029806835],"domain_scores_gemma":[0.9998388,0.000054520086,0.0000063982316,0.000045921985,0.0000430282,0.000011286298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019873277,0.00029655476,0.00024925295,0.0002484645,0.00043694023,0.0007759676,0.0008478775,0.00031789404,0.005200132],"category_scores_gemma":[0.0006694726,0.00020853821,0.00013441245,0.00034174486,0.00029729304,0.00078662747,0.0005269206,0.0007508197,0.00092065084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032683343,0.00010395266,0.000346611,0.0003064487,0.00003041557,0.0002161025,0.00022027188,0.06938378,0.03955753,0.27569234,0.029664902,0.58415085],"study_design_scores_gemma":[0.000047783666,0.00024030815,0.00081577507,0.00005908502,0.00005952226,0.0005487295,0.00008742699,0.6439244,0.027369,0.17833818,0.1484643,0.000045461282],"about_ca_topic_score_codex":0.0008915858,"about_ca_topic_score_gemma":0.0018699255,"teacher_disagreement_score":0.005200132,"about_ca_system_score_codex":0.00053872913,"about_ca_system_score_gemma":0.00040441228,"threshold_uncertainty_score":0.017396152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009726457,0.00045822293,0.984774,0.00015956449,0.000032020143,0.00036327564,0.000064507454,0.00074518676,0.0036768406],"genre_scores_gemma":[0.21367903,0.00039880647,0.7830665,0.00014378448,0.00008967648,0.00085772196,0.00020364164,0.00018827435,0.0013724506],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9808311,0.008692396,0.0017002879,0.0013636547,0.0066598933,0.00075264473],"domain_scores_gemma":[0.95332056,0.032805227,0.003833853,0.0037359172,0.0058695916,0.00043489714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014171774,0.00161874,0.0009131112,0.004092275,0.00083951594,0.0033963283,0.003210576,0.0017041059,0.003155536],"category_scores_gemma":[0.05692574,0.00083283306,0.0013732872,0.0017791705,0.002601966,0.0036492206,0.0019052757,0.0018195127,0.0006641982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039660756,0.00055527454,0.0065651005,0.0013197201,0.00024442768,0.00089117856,0.001067264,0.1585491,0.024581145,0.36861226,0.0025771016,0.43464074],"study_design_scores_gemma":[0.00011019649,0.00062708266,0.001016015,0.0004709415,0.00013665776,0.0011173692,0.00033599057,0.78673494,0.03972579,0.15594299,0.013699757,0.00008223527],"about_ca_topic_score_codex":0.00083390303,"about_ca_topic_score_gemma":0.0004973054,"teacher_disagreement_score":0.014171774,"about_ca_system_score_codex":0.0018625549,"about_ca_system_score_gemma":0.0013645055,"threshold_uncertainty_score":0.07494843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023475528,0.0011510437,0.9720324,0.00019138269,0.00012148816,0.00010787321,0.000039836235,0.0010628148,0.0018175356],"genre_scores_gemma":[0.7922519,0.0009501125,0.20469601,0.00011684615,0.00024050778,0.00026920877,0.00010966217,0.000118688375,0.0012470379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863017,0.00043902063,0.00009529793,0.00011092963,0.0006330693,0.00009152528],"domain_scores_gemma":[0.99741495,0.0011520073,0.00036578084,0.00028267995,0.00070306147,0.0000815888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002649931,0.0003813895,0.00044516072,0.0009940322,0.0005127655,0.00067419885,0.0010787022,0.0004153811,0.00066866],"category_scores_gemma":[0.008568925,0.0002551691,0.00032499773,0.0005714766,0.00047550967,0.0010450587,0.00051277986,0.0006748221,0.00014734869],"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.0004676523,0.0001538732,0.002495779,0.0004740976,0.00013838403,0.00035741282,0.00042855315,0.5564306,0.053574346,0.102187365,0.006308034,0.2769839],"study_design_scores_gemma":[0.000043537664,0.00013250642,0.00041004538,0.000023965353,0.00003927101,0.00013592181,0.000014614506,0.9775595,0.0064774994,0.01073342,0.0043903603,0.000039280298],"about_ca_topic_score_codex":0.0014802559,"about_ca_topic_score_gemma":0.0011839145,"teacher_disagreement_score":0.002649931,"about_ca_system_score_codex":0.0007139195,"about_ca_system_score_gemma":0.0007567959,"threshold_uncertainty_score":0.014014363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045227885,0.00048044242,0.9517971,0.00014734044,0.00016226503,0.00025757306,0.00005928402,0.0008082454,0.0010599567],"genre_scores_gemma":[0.6372464,0.00058558147,0.35962024,0.00016098523,0.00019191635,0.00023479068,0.00021085949,0.00007976867,0.0016695423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993297,0.00018216968,0.000061499995,0.00007689935,0.0002639323,0.00008577933],"domain_scores_gemma":[0.99861455,0.00043928222,0.00021926449,0.00024182319,0.00038747743,0.000097588905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020304401,0.0006202485,0.00046800278,0.0008683235,0.0009045675,0.00066449546,0.0014079658,0.00051540864,0.0006442238],"category_scores_gemma":[0.0028754263,0.0002547695,0.00028585485,0.00073658786,0.0005719676,0.0010069174,0.00046657736,0.0009761415,0.00022302306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001199945,0.0006380044,0.0022772877,0.00042006315,0.00013496247,0.0003980083,0.00041976082,0.13067232,0.23703787,0.065290205,0.0056962795,0.5558153],"study_design_scores_gemma":[0.00020773735,0.0015239748,0.0008949695,0.000028971359,0.00014793404,0.0006025868,0.000040748768,0.87832123,0.09299,0.0101669505,0.015007356,0.00006752283],"about_ca_topic_score_codex":0.0011947425,"about_ca_topic_score_gemma":0.0011277625,"teacher_disagreement_score":0.0020304401,"about_ca_system_score_codex":0.0009913292,"about_ca_system_score_gemma":0.0011872952,"threshold_uncertainty_score":0.010738134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008787383,0.00025968533,0.98216957,0.0001623641,0.0000716426,0.00036256603,0.00004026435,0.0006451346,0.007501485],"genre_scores_gemma":[0.47660545,0.0007832615,0.5125219,0.00017917599,0.00010781535,0.0010007129,0.00017488113,0.00018148897,0.008445259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981312,0.00027567195,0.0000932969,0.00019001518,0.0011798778,0.00012990116],"domain_scores_gemma":[0.99891627,0.00031673934,0.0001025465,0.00011966798,0.0005077459,0.0000370799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014421324,0.00061550795,0.00051190524,0.0006646988,0.00063844287,0.0015864454,0.0012490115,0.0007037917,0.0030266864],"category_scores_gemma":[0.0028219472,0.00047363306,0.0004212453,0.00023290214,0.0006333056,0.0010498345,0.0005956341,0.0011268901,0.0007947126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003344193,0.00027005307,0.0009942523,0.0005458165,0.00008423768,0.0005752689,0.00033598908,0.33503297,0.14002296,0.34131908,0.0031664812,0.17731848],"study_design_scores_gemma":[0.000066041735,0.0003010013,0.00020847245,0.000042026357,0.000057964462,0.00024763704,0.00003431318,0.93618864,0.02869507,0.019497102,0.01462667,0.00003501144],"about_ca_topic_score_codex":0.001374239,"about_ca_topic_score_gemma":0.0007746765,"teacher_disagreement_score":0.0030266864,"about_ca_system_score_codex":0.0006859979,"about_ca_system_score_gemma":0.0016442953,"threshold_uncertainty_score":0.010125279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00856091,0.0004193054,0.9846972,0.00015977616,0.000098725555,0.00010305983,0.000065318425,0.005363527,0.000532211],"genre_scores_gemma":[0.2114199,0.00026078892,0.783824,0.00026927417,0.00009500129,0.0003694781,0.00032411152,0.00027568598,0.0031617023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.00031256664,0.00009135659,0.00021103118,0.00033758435,0.00011952977],"domain_scores_gemma":[0.9970682,0.0015899739,0.0003189851,0.0003398371,0.00052696426,0.0001560999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028341182,0.00086952525,0.0011738228,0.0020154112,0.00060514844,0.0011127848,0.0033046706,0.0012514163,0.0025275538],"category_scores_gemma":[0.0076966956,0.00062253245,0.0004194577,0.0008441407,0.0006772998,0.0017428393,0.0016426469,0.0016448817,0.0010301915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012736348,0.00028017856,0.0022014834,0.00027778273,0.00011160006,0.00019015845,0.00015236314,0.23159087,0.012773321,0.01625494,0.010954391,0.7239393],"study_design_scores_gemma":[0.00013181065,0.00007294572,0.00013150366,0.000010399628,0.000013025533,0.000052600793,0.0000073114998,0.9890324,0.0037543743,0.004512863,0.0022631283,0.00001762842],"about_ca_topic_score_codex":0.001768451,"about_ca_topic_score_gemma":0.0015207488,"teacher_disagreement_score":0.0033046706,"about_ca_system_score_codex":0.0009983401,"about_ca_system_score_gemma":0.0011535293,"threshold_uncertainty_score":0.014988422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95527726,0.0025345802,0.03697195,0.00016759016,0.00016826823,0.00013659643,0.00007373942,0.0009398989,0.00372992],"genre_scores_gemma":[0.99552095,0.00023098919,0.0037455063,0.00002427648,0.000021701526,0.000022557753,0.00003734549,0.000023238063,0.00037340503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792707,0.0005269326,0.00018534878,0.00020277643,0.0008451993,0.0003126778],"domain_scores_gemma":[0.9935236,0.0036729968,0.00050072325,0.00030060607,0.0017462823,0.0002557859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025566588,0.0007021791,0.000668386,0.0015860037,0.00047844704,0.0010561172,0.0010221393,0.0006613671,0.0013424936],"category_scores_gemma":[0.008304551,0.00022742034,0.0003204522,0.000513197,0.0005157898,0.0008922266,0.00038565343,0.00060638884,0.00017120826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01548938,0.0022727307,0.01586584,0.0013427957,0.00043807866,0.00040446123,0.00097594684,0.31749633,0.28060776,0.010809297,0.0018675844,0.3524299],"study_design_scores_gemma":[0.00070320006,0.0066537787,0.007212974,0.00008556891,0.00028083145,0.00030961624,0.00023150077,0.84468603,0.13576396,0.0013115312,0.0026156818,0.00014528981],"about_ca_topic_score_codex":0.0017185647,"about_ca_topic_score_gemma":0.0008892133,"teacher_disagreement_score":0.0025566588,"about_ca_system_score_codex":0.0009636943,"about_ca_system_score_gemma":0.0003347541,"threshold_uncertainty_score":0.013521016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010266502,0.00046217412,0.9846303,0.00021878352,0.000026716654,0.000089357614,0.000056401877,0.00038254316,0.0038672],"genre_scores_gemma":[0.40516132,0.0016184194,0.58696306,0.00016047356,0.00009637347,0.00081113016,0.00028064434,0.00023904482,0.0046694926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988494,0.0002992474,0.00006588328,0.00016612223,0.00047464654,0.00014469802],"domain_scores_gemma":[0.9992937,0.00020632455,0.00010119564,0.00012693624,0.0002282816,0.000043693344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075648,0.0011614924,0.0007640349,0.00048319757,0.00056765456,0.0019362329,0.002161391,0.0010875444,0.0021848257],"category_scores_gemma":[0.003341452,0.00077748235,0.00069812924,0.00054189045,0.000831789,0.0016957412,0.0014567516,0.0010337889,0.0006486136],"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.000055967572,0.000026239128,0.00023582294,0.00022239839,0.000030662202,0.00013616194,0.0001224764,0.87323016,0.007650171,0.070318036,0.0012263249,0.046745628],"study_design_scores_gemma":[0.000033830936,0.00010328737,0.00009678487,0.000036548376,0.000034461693,0.0000665475,0.000040900355,0.94302624,0.002963024,0.04469601,0.008888255,0.000014108563],"about_ca_topic_score_codex":0.0009677371,"about_ca_topic_score_gemma":0.0009945234,"teacher_disagreement_score":0.0021848257,"about_ca_system_score_codex":0.00076044846,"about_ca_system_score_gemma":0.0015713845,"threshold_uncertainty_score":0.010977149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012005062,0.00007988835,0.9865574,0.00006822364,0.00003280876,0.00003747282,0.000028914885,0.000739366,0.00045084738],"genre_scores_gemma":[0.62221825,0.00014682458,0.37622,0.000089227455,0.000060961913,0.000111503585,0.00012981825,0.00009749252,0.0009259267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970114,0.0009255837,0.0001919963,0.00041285573,0.001272884,0.00018522269],"domain_scores_gemma":[0.98944646,0.005807287,0.0014758216,0.0019977542,0.0011215452,0.00015111476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00334431,0.0006750682,0.0007073919,0.0012224383,0.00063381885,0.000993759,0.0019110615,0.00095957454,0.0011166002],"category_scores_gemma":[0.021418113,0.00054815365,0.00036298865,0.0011698813,0.0010553976,0.002161674,0.001235795,0.0011699348,0.00031541675],"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.00044794756,0.00012352085,0.0040576723,0.00011994816,0.00009095808,0.00010576549,0.00013212506,0.68028384,0.017840972,0.047877077,0.0019219025,0.2469982],"study_design_scores_gemma":[0.00001352137,0.000039315804,0.0004868796,0.0000051726415,0.000010173541,0.000052999832,0.0000047820963,0.9878293,0.005759564,0.005248393,0.0005287443,0.000021232136],"about_ca_topic_score_codex":0.002272403,"about_ca_topic_score_gemma":0.0021667504,"teacher_disagreement_score":0.00334431,"about_ca_system_score_codex":0.0016939371,"about_ca_system_score_gemma":0.0012290071,"threshold_uncertainty_score":0.017686605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046555128,0.0006264466,0.94519347,0.00042611916,0.00014851327,0.000046798672,0.000071003466,0.00018317302,0.006749383],"genre_scores_gemma":[0.975368,0.00050549203,0.019673226,0.000074959695,0.000075995486,0.00006198101,0.000057007517,0.000042388638,0.004140884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00015393284,0.000024567556,0.000089817346,0.00029260255,0.00011939707],"domain_scores_gemma":[0.9979583,0.0010583453,0.00023869419,0.000109908644,0.00053657405,0.00009830673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013281729,0.00044822396,0.0005161517,0.0007066012,0.0003502312,0.0014461303,0.0008958849,0.0005506245,0.003123996],"category_scores_gemma":[0.006490575,0.00030353892,0.00038073852,0.0004723634,0.0011273753,0.0013962148,0.000761946,0.0011337386,0.00016118053],"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.00008300795,0.00003364027,0.0005502764,0.00006236153,0.0000280625,0.00005510292,0.00007678599,0.83595926,0.001928338,0.14994916,0.0008120282,0.010461913],"study_design_scores_gemma":[0.000002845084,0.000006186343,0.000041976924,0.0000019802972,0.0000019722213,0.0000023108325,0.0000032829457,0.9928054,0.0001280603,0.006811176,0.00019211648,0.0000027642434],"about_ca_topic_score_codex":0.0059728036,"about_ca_topic_score_gemma":0.0014905694,"teacher_disagreement_score":0.0059728036,"about_ca_system_score_codex":0.0016887923,"about_ca_system_score_gemma":0.0009592719,"threshold_uncertainty_score":0.012253106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4664418,0.00022974002,0.5093158,0.00024331994,0.00022002847,0.002082577,0.00096104434,0.010920412,0.009585304],"genre_scores_gemma":[0.7719442,0.00010966694,0.2233449,0.000052759115,0.000017796601,0.0012496327,0.00080206,0.00016351315,0.00231546],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993729,0.00016287487,0.000050224593,0.00011140943,0.00019022707,0.000112329704],"domain_scores_gemma":[0.9992248,0.00011546162,0.000091766255,0.00017418063,0.00022572075,0.00016815674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010434148,0.0004981148,0.0004619842,0.00046666965,0.00036543966,0.0005109213,0.0018290448,0.00036896617,0.0019724972],"category_scores_gemma":[0.0011299821,0.00024642848,0.00016949348,0.00032433443,0.0003800845,0.00067914027,0.00043186548,0.00047663445,0.00046781765],"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.0023069917,0.0028045808,0.019214613,0.00096137903,0.00020289651,0.0009774513,0.0006436151,0.29384625,0.43453285,0.025908347,0.008773799,0.20982717],"study_design_scores_gemma":[0.00049609,0.0041876826,0.009021234,0.000044265507,0.00010158523,0.0002954888,0.00014663526,0.66906476,0.2878102,0.002180127,0.026577767,0.00007420023],"about_ca_topic_score_codex":0.0012682285,"about_ca_topic_score_gemma":0.0007380188,"teacher_disagreement_score":0.0019724972,"about_ca_system_score_codex":0.0009564078,"about_ca_system_score_gemma":0.00065662095,"threshold_uncertainty_score":0.0069392323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007318947,0.00018953068,0.98852926,0.00029710095,0.00005837853,0.00007622881,0.000017044214,0.00020974914,0.0033037453],"genre_scores_gemma":[0.8942034,0.00047214425,0.10111637,0.00026502655,0.00015989268,0.00029493193,0.000044638648,0.00010907716,0.0033344224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828786,0.00047628046,0.00008988338,0.0001998748,0.00075334735,0.00019279879],"domain_scores_gemma":[0.9974463,0.001535199,0.0002246757,0.00012811676,0.0006102737,0.000055454802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023151492,0.0015237486,0.0011242523,0.00052006426,0.0005030749,0.001901033,0.0014058013,0.0014103095,0.0019793673],"category_scores_gemma":[0.005149466,0.00051969383,0.0006044311,0.0004986445,0.00079679297,0.0018537705,0.0008314862,0.0014423818,0.00035138818],"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.000075430835,0.00007881192,0.00031981262,0.000106765525,0.000028576253,0.00005931208,0.00003474098,0.9544106,0.004716881,0.014049692,0.0004637351,0.025655666],"study_design_scores_gemma":[0.000010391265,0.00007341103,0.000068360925,0.00000474589,0.0000123250675,0.000015076497,0.0000050015087,0.99680614,0.0008405218,0.0017434538,0.00041201877,0.000008596082],"about_ca_topic_score_codex":0.003945523,"about_ca_topic_score_gemma":0.0026943972,"teacher_disagreement_score":0.003945523,"about_ca_system_score_codex":0.001239799,"about_ca_system_score_gemma":0.0017365732,"threshold_uncertainty_score":0.012243807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033954836,0.00086920557,0.96283484,0.000091252245,0.00007198752,0.00009252525,0.000048191225,0.00038956257,0.0016475844],"genre_scores_gemma":[0.70632905,0.00107676,0.2895335,0.00010973514,0.000093475624,0.00021153754,0.00013474953,0.00010992042,0.0024013282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966,0.00008587858,0.000033044824,0.000066508495,0.00010122386,0.000053399046],"domain_scores_gemma":[0.9995598,0.00019456945,0.000075073316,0.00004308024,0.00009622319,0.000031139218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010660406,0.00059527316,0.0004036843,0.00046612328,0.00041996507,0.0014299081,0.0015354392,0.00043156647,0.0012823708],"category_scores_gemma":[0.0023162034,0.0003008566,0.00025492426,0.0004500727,0.00039429564,0.0013391511,0.0004516915,0.00048961275,0.0001837963],"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.0005005714,0.0001554799,0.0011444045,0.00061423366,0.000097603945,0.00032066277,0.00047828536,0.44327986,0.12280858,0.21227166,0.0027895465,0.21553916],"study_design_scores_gemma":[0.000105867795,0.00026584946,0.00026535807,0.000046878922,0.00008680322,0.00012310968,0.000048726102,0.9135502,0.030063866,0.045825187,0.0095847435,0.000033344182],"about_ca_topic_score_codex":0.00082089764,"about_ca_topic_score_gemma":0.0014639364,"teacher_disagreement_score":0.0015354392,"about_ca_system_score_codex":0.0007922839,"about_ca_system_score_gemma":0.00089202635,"threshold_uncertainty_score":0.005748391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04305141,0.00026190508,0.95461786,0.00021099285,0.00004440426,0.00003785892,0.000056531077,0.000147604,0.001571498],"genre_scores_gemma":[0.9374301,0.0005540976,0.05941261,0.000111842375,0.00011841435,0.00009939928,0.00007709529,0.00008807363,0.0021083083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916995,0.00021747913,0.000032067772,0.000164905,0.00029276908,0.00012283998],"domain_scores_gemma":[0.9983095,0.00084456126,0.0002570178,0.0001411084,0.00036651202,0.00008120633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012321298,0.0007335865,0.0006822343,0.00072875875,0.00047181032,0.00082484126,0.0015382451,0.0005798811,0.0010645945],"category_scores_gemma":[0.00380804,0.0004127037,0.0007979996,0.00083930994,0.00080335874,0.0015758151,0.00087434147,0.0010899081,0.00013005725],"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.000032366373,0.000040470433,0.0011044109,0.000049339556,0.00003782425,0.00011877578,0.00006454279,0.93026596,0.006455822,0.054235063,0.00055337365,0.0070420466],"study_design_scores_gemma":[0.0000010271145,0.000005184976,0.00015652982,0.0000010215384,0.0000022840597,0.0000064016203,0.000004762791,0.99746287,0.0001561773,0.0021052605,0.000095084746,0.000003347656],"about_ca_topic_score_codex":0.007708851,"about_ca_topic_score_gemma":0.0028987415,"teacher_disagreement_score":0.007708851,"about_ca_system_score_codex":0.001540743,"about_ca_system_score_gemma":0.0011147414,"threshold_uncertainty_score":0.01532793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010929491,0.00016500143,0.98564655,0.00016070613,0.000057093817,0.00005124308,0.00005966343,0.00027579413,0.002654489],"genre_scores_gemma":[0.78549194,0.000762943,0.20173861,0.00027446257,0.00014857818,0.00037927108,0.00019506275,0.0002620549,0.010747039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851197,0.00033430505,0.000057701644,0.00022984603,0.00067755324,0.00018861379],"domain_scores_gemma":[0.9978594,0.0011620319,0.00021191145,0.00026665034,0.00045478623,0.000045292334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018726278,0.00066851085,0.0010083521,0.0008623292,0.00073544314,0.0013081876,0.002371339,0.0018533582,0.0016750019],"category_scores_gemma":[0.007401679,0.00063518155,0.000777313,0.0005887098,0.001225972,0.0029569594,0.0006071603,0.0017506,0.0006667278],"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.000029058152,0.000025641066,0.00020256697,0.000026760768,0.000009922347,0.000056751178,0.00008219787,0.9465051,0.0029906854,0.04465591,0.00039106645,0.00502431],"study_design_scores_gemma":[0.0000027559574,0.000005863887,0.000024363944,0.000002094503,0.0000020381087,0.000010723095,0.0000021682483,0.9964005,0.00041130453,0.0027991883,0.00033461917,0.0000043019227],"about_ca_topic_score_codex":0.006876743,"about_ca_topic_score_gemma":0.002501679,"teacher_disagreement_score":0.006876743,"about_ca_system_score_codex":0.0022045926,"about_ca_system_score_gemma":0.0013641631,"threshold_uncertainty_score":0.015995562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025858311,0.00028750228,0.9694995,0.00022493346,0.000048254835,0.000051098676,0.000036804115,0.0001001716,0.0038934336],"genre_scores_gemma":[0.8518645,0.0005900048,0.140223,0.0001456349,0.00014582474,0.00018652354,0.00013009066,0.00013119365,0.006583225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889994,0.0003700015,0.000035588004,0.00018187716,0.00027926624,0.00023338216],"domain_scores_gemma":[0.998609,0.00078896777,0.00016770618,0.000085035965,0.00024113167,0.000108056425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314006,0.0020546068,0.0013310437,0.00085702445,0.00052680966,0.0015220469,0.0011966982,0.0013410692,0.0016215337],"category_scores_gemma":[0.0035664076,0.00053301034,0.0010391922,0.0011007357,0.00083313306,0.0018160586,0.0012551814,0.0013736608,0.0002386104],"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.000037008685,0.0000668733,0.0002631947,0.00003666518,0.000027959342,0.000045347188,0.00001816951,0.9746011,0.002329223,0.008086389,0.00035946313,0.014128639],"study_design_scores_gemma":[0.0000031473037,0.000024479958,0.000056381785,0.0000018217854,0.00000646078,0.000011685803,0.0000064745286,0.99666864,0.000494637,0.0025220762,0.00020138863,0.0000027839405],"about_ca_topic_score_codex":0.0030077097,"about_ca_topic_score_gemma":0.0022240344,"teacher_disagreement_score":0.0030077097,"about_ca_system_score_codex":0.000978749,"about_ca_system_score_gemma":0.0016160836,"threshold_uncertainty_score":0.007101357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031160623,0.00030625254,0.93478227,0.00034392974,0.00022983982,0.00041049375,0.0018340489,0.01049705,0.02043552],"genre_scores_gemma":[0.4461576,0.00081789953,0.5325155,0.00017753866,0.00006127953,0.00156328,0.003472018,0.0015139609,0.013720881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996244,0.00015812197,0.000025572504,0.00004073211,0.00010049732,0.00005065993],"domain_scores_gemma":[0.99892503,0.00062293245,0.000055344666,0.000111652145,0.00019882729,0.00008616281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010133354,0.001263386,0.0009346882,0.0006601152,0.0006588343,0.0012304819,0.0019257115,0.0010717247,0.013364539],"category_scores_gemma":[0.0025374987,0.00080344256,0.0009999397,0.00041066745,0.0004736486,0.0007095764,0.0008724083,0.0013181706,0.0016642387],"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.00006687119,0.000048690024,0.00036825906,0.00005863635,0.000034275487,0.000040955387,0.000033459186,0.9845962,0.0014654734,0.005029688,0.0014836815,0.006773751],"study_design_scores_gemma":[0.000016393911,0.00001477968,0.000031526106,0.000007075439,0.000005891163,0.0000046403634,0.000004986898,0.9962819,0.00058814266,0.000977265,0.0020636762,0.0000037120499],"about_ca_topic_score_codex":0.014152753,"about_ca_topic_score_gemma":0.013599308,"teacher_disagreement_score":0.014152753,"about_ca_system_score_codex":0.0010566687,"about_ca_system_score_gemma":0.002309072,"threshold_uncertainty_score":0.04470879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20868629,0.0005686649,0.76572794,0.00057153666,0.00019290127,0.00011429108,0.00014962768,0.0036213927,0.020367272],"genre_scores_gemma":[0.95643586,0.00011309154,0.041819613,0.000072742645,0.00007689047,0.000031514825,0.0000717163,0.00006433194,0.001314296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.00016632148,0.00005328653,0.00008481908,0.00031707747,0.00016910426],"domain_scores_gemma":[0.99834657,0.00065660116,0.00016830563,0.00037214957,0.00034420472,0.00011220344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013274616,0.00042537172,0.00060373783,0.00059532194,0.00061808364,0.001239378,0.0011376945,0.00034564,0.002110056],"category_scores_gemma":[0.0026943663,0.00020512735,0.00025205116,0.00068119867,0.00073363545,0.0012909995,0.001462993,0.0009617561,0.000450918],"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.0012444623,0.0003685531,0.0034628583,0.00022434571,0.00013258171,0.0006432147,0.0006410001,0.42641282,0.18821882,0.12652117,0.012768187,0.23936203],"study_design_scores_gemma":[0.000050542523,0.000106987,0.00032859945,0.000012211547,0.000023868337,0.0000909121,0.000082435065,0.963398,0.014682136,0.01767301,0.0035287582,0.000022503331],"about_ca_topic_score_codex":0.0017559438,"about_ca_topic_score_gemma":0.0020296818,"teacher_disagreement_score":0.002110056,"about_ca_system_score_codex":0.00059641915,"about_ca_system_score_gemma":0.0007239742,"threshold_uncertainty_score":0.007058859},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004294646,0.00055820635,0.45407987,0.0013268081,0.0020334905,0.004139036,0.06965199,0.41105482,0.052861203],"genre_scores_gemma":[0.1907196,0.0025753907,0.2823303,0.006286841,0.001926204,0.043874733,0.23127237,0.085970156,0.15504439],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99463415,0.0014017716,0.0008109342,0.00083320116,0.0015338279,0.0007861812],"domain_scores_gemma":[0.9891506,0.0025013073,0.00047233625,0.004882069,0.0021638672,0.00082978106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007903873,0.003034459,0.0029390168,0.0024634267,0.0016617886,0.0063492283,0.0055062966,0.004148359,0.2840011],"category_scores_gemma":[0.017789386,0.0014537922,0.0015113825,0.0024290853,0.001430842,0.0040233647,0.007911751,0.0040556225,0.25061128],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004041864,0.0003134055,0.0016959959,0.0012613185,0.00021068096,0.0009224316,0.0003606028,0.00476181,0.018275535,0.030420616,0.81598365,0.12175211],"study_design_scores_gemma":[0.0015187868,0.00033453002,0.0019212917,0.00045679396,0.00010296917,0.0006070522,0.00018091759,0.055507354,0.023314184,0.0840077,0.83180326,0.00024506316],"about_ca_topic_score_codex":0.0011687953,"about_ca_topic_score_gemma":0.0008253519,"teacher_disagreement_score":0.2840011,"about_ca_system_score_codex":0.0018273733,"about_ca_system_score_gemma":0.0030179338,"threshold_uncertainty_score":0.95007837},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015916798,0.011794774,0.13951038,0.008915524,0.010173249,0.00096848607,0.033931553,0.01587156,0.76291776],"genre_scores_gemma":[0.1868191,0.022710884,0.08845995,0.0023368958,0.006994736,0.0014468668,0.09442889,0.006233728,0.5905689],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907696,0.00024972574,0.000043958644,0.00010661326,0.00040245423,0.000120299235],"domain_scores_gemma":[0.9980709,0.00031339042,0.00008074379,0.00037412217,0.00095415075,0.00020669818],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013331795,0.0013260659,0.0010272274,0.0017474772,0.0011230337,0.0022976461,0.0017484059,0.0018780044,0.08300148],"category_scores_gemma":[0.0038169553,0.00035941254,0.0003474205,0.002440578,0.00052088057,0.0019911986,0.0011214104,0.0016965461,0.026410434],"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.00030405796,0.00012230058,0.0004552059,0.00049694616,0.0000276478,0.00015672884,0.000045611436,0.039882377,0.0025263703,0.11028452,0.66281337,0.18288496],"study_design_scores_gemma":[0.00007473789,0.00010290808,0.0008908922,0.00024251916,0.00002240604,0.0001481916,0.000036698748,0.056938455,0.0044239666,0.0375155,0.89955485,0.00004883714],"about_ca_topic_score_codex":0.0115775755,"about_ca_topic_score_gemma":0.009920673,"teacher_disagreement_score":0.9169985,"about_ca_system_score_codex":0.0018145518,"about_ca_system_score_gemma":0.0019021608,"threshold_uncertainty_score":0.27766758},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016131712,0.002179451,0.2953882,0.006504557,0.0029319122,0.00090383255,0.023916565,0.24112217,0.4109216],"genre_scores_gemma":[0.119753346,0.0027949049,0.35154194,0.003393616,0.0005625158,0.0011665433,0.10427326,0.08011765,0.33639637],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987004,0.00022194353,0.000056382236,0.00024708168,0.00058628054,0.00018791265],"domain_scores_gemma":[0.99724615,0.00049315,0.000108808104,0.00071604224,0.0009637387,0.00047214437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020647892,0.0008087969,0.0007553887,0.0013859207,0.0010119024,0.0028913799,0.0026660375,0.0010904435,0.08495085],"category_scores_gemma":[0.008751624,0.00060039444,0.00082585774,0.0012975489,0.0004733004,0.0033618435,0.0036102592,0.0024605503,0.057809345],"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.0003207855,0.00009633262,0.0017601836,0.00031039515,0.000036207854,0.00014909348,0.00033555654,0.0029289331,0.003956838,0.05532877,0.755016,0.1797608],"study_design_scores_gemma":[0.000051821884,0.000046343008,0.0009396389,0.000074041585,0.000019431873,0.00024589934,0.00006470623,0.012797888,0.003541741,0.01573954,0.96643263,0.00004622485],"about_ca_topic_score_codex":0.0035540438,"about_ca_topic_score_gemma":0.0043534236,"teacher_disagreement_score":0.08495085,"about_ca_system_score_codex":0.001447903,"about_ca_system_score_gemma":0.0022405428,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040984783,0.13083087,0.7377696,0.003383613,0.0021854374,0.00018226511,0.00016911661,0.0033177205,0.08117658],"genre_scores_gemma":[0.65165526,0.12297341,0.18395115,0.00082974415,0.0027188354,0.00026542583,0.00032528193,0.0004948018,0.03678608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.000098819924,0.00002472096,0.00004772812,0.00025409847,0.00004216208],"domain_scores_gemma":[0.99937135,0.0002524596,0.000043965643,0.00009739879,0.00021121651,0.000023583032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082790834,0.0008055473,0.00062503474,0.0007796836,0.00041053692,0.0022677914,0.0013366459,0.0010195756,0.0016382219],"category_scores_gemma":[0.0022819778,0.0003206435,0.00034425256,0.0019787636,0.0007548648,0.002400108,0.0006418188,0.001360275,0.00089608383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018197336,0.00016873145,0.001243184,0.0012030602,0.000109008965,0.00032792726,0.0003535102,0.13652311,0.032639217,0.12976874,0.019900858,0.6775807],"study_design_scores_gemma":[0.00005544874,0.0005713252,0.0024239223,0.000578506,0.00030814772,0.0010791656,0.00017859123,0.5831259,0.0329727,0.13835828,0.24021274,0.00013536711],"about_ca_topic_score_codex":0.00075695745,"about_ca_topic_score_gemma":0.0004793498,"teacher_disagreement_score":0.0022677914,"about_ca_system_score_codex":0.0010927098,"about_ca_system_score_gemma":0.0005990221,"threshold_uncertainty_score":0.007928252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13553804,0.124234915,0.60490674,0.0019695254,0.0018233269,0.0001749651,0.00023048682,0.0055384617,0.12558357],"genre_scores_gemma":[0.85996,0.04776594,0.0674914,0.0002567564,0.0012522889,0.000110202,0.00025436844,0.00032192247,0.022587089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995301,0.000120129145,0.000022183185,0.00004542661,0.00022982841,0.000052324318],"domain_scores_gemma":[0.9992637,0.00036994886,0.0000346016,0.00010062722,0.00020180787,0.00002937888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071280997,0.00052315026,0.00038897706,0.00072649546,0.00035106557,0.0017190702,0.00087605184,0.00067834853,0.0010860013],"category_scores_gemma":[0.0026130616,0.00020470569,0.00018772922,0.0017189033,0.00044923645,0.0013078955,0.00046097927,0.00064064265,0.00067609956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020554966,0.000113225105,0.0016290265,0.0006717764,0.00005316886,0.00053923,0.00034091814,0.12811129,0.02672443,0.05823325,0.017151097,0.766227],"study_design_scores_gemma":[0.000059697977,0.0005539504,0.0039919666,0.00044792105,0.00024367332,0.0017889335,0.00021588033,0.5824861,0.049619306,0.07575767,0.28471062,0.00012433669],"about_ca_topic_score_codex":0.00080223754,"about_ca_topic_score_gemma":0.00054688624,"teacher_disagreement_score":0.0017190702,"about_ca_system_score_codex":0.0006225959,"about_ca_system_score_gemma":0.0004861083,"threshold_uncertainty_score":0.004517317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08847086,0.0005317402,0.8991201,0.00039457076,0.000072207185,0.000049167164,0.00017139601,0.0007271909,0.01046271],"genre_scores_gemma":[0.6214639,0.0009297621,0.36640134,0.00023122618,0.0001500867,0.00013981308,0.00043351768,0.00048773043,0.009762584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992054,0.00024242383,0.00003146322,0.00013777293,0.00018910674,0.0001938516],"domain_scores_gemma":[0.99772424,0.0011711083,0.0002391734,0.0004491268,0.00026146465,0.0001548802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171208,0.0007444421,0.0005157413,0.000840241,0.0009054642,0.0011909283,0.0008015262,0.0003896384,0.002840875],"category_scores_gemma":[0.004241531,0.00036537313,0.0005007617,0.0014050404,0.0011903339,0.0028387131,0.0014456537,0.0010653508,0.00066767994],"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.00034112262,0.00007350082,0.0010762765,0.0001793116,0.000034276338,0.00012642596,0.00030990125,0.25345024,0.014578393,0.5593889,0.007603589,0.16283809],"study_design_scores_gemma":[0.000031760588,0.00008431122,0.0003802015,0.000020969617,0.00001598766,0.000115899085,0.00008389039,0.39645842,0.0066153263,0.5887439,0.007427774,0.000021617321],"about_ca_topic_score_codex":0.001660861,"about_ca_topic_score_gemma":0.0028251535,"teacher_disagreement_score":0.002840875,"about_ca_system_score_codex":0.0013485112,"about_ca_system_score_gemma":0.00082748284,"threshold_uncertainty_score":0.009784162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064816,0.06412198,0.21574216,0.0012380448,0.0004733027,0.00009696229,0.0001645086,0.0013458383,0.010335629],"genre_scores_gemma":[0.9763224,0.006740033,0.014613346,0.00006323154,0.00015299502,0.000011803775,0.00009684787,0.0000647724,0.0019344284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890804,0.00026050975,0.00006503806,0.00016962527,0.00047932466,0.00011745499],"domain_scores_gemma":[0.99189126,0.0040979125,0.00075992383,0.0008350597,0.0019989198,0.00041686682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030695377,0.00063773256,0.0007557311,0.0007662497,0.00036518683,0.0014649754,0.0010127622,0.0009469394,0.001566683],"category_scores_gemma":[0.008073775,0.0003124162,0.00021620572,0.0015009729,0.0009097609,0.0027710802,0.00061940664,0.0011173397,0.0004442565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002644422,0.0007721863,0.015782043,0.00092653086,0.00020868455,0.0005076868,0.0008958432,0.38839155,0.08633454,0.025546553,0.0040201396,0.47396982],"study_design_scores_gemma":[0.00008926191,0.0013747098,0.0056081847,0.0001274599,0.00009919707,0.0006114966,0.0001378274,0.93385965,0.03742553,0.014622899,0.005957077,0.00008674959],"about_ca_topic_score_codex":0.001865384,"about_ca_topic_score_gemma":0.0006199329,"teacher_disagreement_score":0.0030695377,"about_ca_system_score_codex":0.00080315245,"about_ca_system_score_gemma":0.00054302724,"threshold_uncertainty_score":0.016233444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009693894,0.084773116,0.88654006,0.0033279634,0.0016309993,0.00014831254,0.0001583222,0.0012043386,0.012523004],"genre_scores_gemma":[0.3091993,0.1857167,0.48244995,0.0009715706,0.0034103012,0.0003613815,0.00040233324,0.00039758906,0.017090842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996352,0.00009406513,0.0000326915,0.00003911858,0.00016232517,0.000036626185],"domain_scores_gemma":[0.9995098,0.00019781139,0.00006719663,0.000086190885,0.000114822105,0.000024094705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007134506,0.0007096146,0.0005085083,0.00076184765,0.0005130859,0.001874461,0.0009813084,0.0011703912,0.0019270878],"category_scores_gemma":[0.0016393111,0.00035635708,0.00041101326,0.0012088664,0.0007576654,0.0033107009,0.0009732308,0.00160979,0.00091670966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001513191,0.00007695108,0.0010360314,0.001829728,0.000091696995,0.0010871517,0.00038123078,0.04278256,0.041618984,0.3795453,0.01503142,0.5163676],"study_design_scores_gemma":[0.00003629434,0.0004749875,0.0015937916,0.0010653307,0.00030069688,0.004151202,0.00040206846,0.22400086,0.035421588,0.2829468,0.44940114,0.00020515692],"about_ca_topic_score_codex":0.0005535104,"about_ca_topic_score_gemma":0.0006810864,"teacher_disagreement_score":0.0019270878,"about_ca_system_score_codex":0.00060169253,"about_ca_system_score_gemma":0.0006437816,"threshold_uncertainty_score":0.006446719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029021114,0.00018732809,0.96545494,0.00014625987,0.00006197618,0.000045511093,0.0001760446,0.0004386581,0.0044682273],"genre_scores_gemma":[0.8800336,0.0006673488,0.102103785,0.00010057219,0.00007994279,0.00025844562,0.0004124223,0.00018751125,0.016156409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996432,0.00010237139,0.00001615271,0.00008466031,0.00010837495,0.000045252687],"domain_scores_gemma":[0.99960953,0.0001878204,0.000056975576,0.000033695032,0.00009923715,0.000012699714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055947946,0.00042701716,0.00039331996,0.0004910408,0.00027280799,0.0011205496,0.00096417364,0.00079116767,0.0019503532],"category_scores_gemma":[0.0019269162,0.00033086166,0.00041436986,0.00048498707,0.00045858885,0.0013448212,0.00037510568,0.0007786104,0.0005057019],"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.000027333519,0.000021415382,0.0012637391,0.000037126178,0.0000141367345,0.000078083904,0.000062140265,0.9563995,0.0020078742,0.028394891,0.00038287067,0.011310969],"study_design_scores_gemma":[0.0000010957483,0.000004554407,0.00012181829,0.0000027468877,0.0000038098813,0.000010262966,0.000002636668,0.99730897,0.00029229847,0.0017380556,0.0005113811,0.000002391744],"about_ca_topic_score_codex":0.013586054,"about_ca_topic_score_gemma":0.010822557,"teacher_disagreement_score":0.013586054,"about_ca_system_score_codex":0.00090950826,"about_ca_system_score_gemma":0.0008223652,"threshold_uncertainty_score":0.027013958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95920527,0.00018989998,0.02848074,0.00016344662,0.000015803333,0.00004981105,0.00016992874,0.00046532843,0.01125981],"genre_scores_gemma":[0.99817145,0.000036561567,0.0014377641,0.000006775386,0.0000027451317,0.0000095758705,0.000043536897,0.000011485161,0.00028006796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925417,0.0001892271,0.000027089674,0.000067194436,0.00033185695,0.0001304448],"domain_scores_gemma":[0.9977736,0.0012332301,0.00018518035,0.0001433804,0.0005930684,0.00007157008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929406,0.00048601654,0.00030547092,0.001086839,0.00032736047,0.00069648353,0.00033842502,0.00029914425,0.0010475467],"category_scores_gemma":[0.003551932,0.00012313176,0.00016888771,0.0010068187,0.00039863048,0.0007975317,0.00031695442,0.00041218157,0.00014477166],"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.00041093703,0.00012390356,0.00882172,0.00005484749,0.000031781972,0.00009564851,0.00008221304,0.94890255,0.01310073,0.006704199,0.0006789851,0.020992484],"study_design_scores_gemma":[0.000003228205,0.00008151454,0.0015940332,0.00000246891,0.00000502326,0.000013327444,0.000022126496,0.994575,0.0031167523,0.00045771518,0.00012439706,0.000004379194],"about_ca_topic_score_codex":0.007348115,"about_ca_topic_score_gemma":0.0024993015,"teacher_disagreement_score":0.007348115,"about_ca_system_score_codex":0.0013945225,"about_ca_system_score_gemma":0.00050667074,"threshold_uncertainty_score":0.014610708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5468711,0.017769841,0.34998566,0.0013666528,0.0004084076,0.00016243527,0.0010624088,0.0046287165,0.077744655],"genre_scores_gemma":[0.96815854,0.001994677,0.026197502,0.00012139872,0.00008628512,0.00004438897,0.00035766544,0.000058598253,0.0029808497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00011002982,0.000018223707,0.000037130976,0.00020236826,0.00008097745],"domain_scores_gemma":[0.99961853,0.00012389303,0.000059153965,0.00006876674,0.0000993639,0.000030257812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034896636,0.0004029526,0.00032511548,0.00073853164,0.0004649404,0.000870998,0.00048524418,0.00045175268,0.0033888605],"category_scores_gemma":[0.0012158417,0.000095115036,0.00014932636,0.0012027348,0.00035229855,0.00084491447,0.00083074975,0.00037912585,0.0005504539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013278075,0.00013011906,0.0054230737,0.00092479395,0.00011690602,0.0011519152,0.0005417354,0.30436015,0.11071708,0.17152198,0.019358909,0.38442558],"study_design_scores_gemma":[0.000082255676,0.00031525147,0.0025938794,0.00009083885,0.000059157108,0.00057968195,0.00031907222,0.877366,0.029649446,0.044501442,0.044398863,0.000044131873],"about_ca_topic_score_codex":0.0036618116,"about_ca_topic_score_gemma":0.0028434654,"teacher_disagreement_score":0.0036618116,"about_ca_system_score_codex":0.0010498086,"about_ca_system_score_gemma":0.00054219377,"threshold_uncertainty_score":0.011336863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08939627,0.00032254122,0.90744287,0.000102462385,0.000078715275,0.00002360015,0.00009934784,0.0010946867,0.0014395245],"genre_scores_gemma":[0.87976754,0.00025882965,0.116948724,0.000051188414,0.0001350862,0.00005757437,0.00033885706,0.00008127304,0.002360953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997112,0.000056758145,0.000019163119,0.000092718634,0.00007570347,0.000044466527],"domain_scores_gemma":[0.99835473,0.0009786357,0.000121330275,0.00015034905,0.0003261142,0.0000689129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159958,0.00067967054,0.0011777371,0.00094589574,0.00031858703,0.00071878795,0.0008923316,0.00064338144,0.0014502048],"category_scores_gemma":[0.0031285195,0.0004873851,0.0004996798,0.0007869525,0.00034039898,0.0012716546,0.00076795,0.00085452717,0.00061653985],"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.0008153743,0.00034668163,0.0069713336,0.00016571606,0.0001310922,0.00022836203,0.00010863635,0.52031624,0.035131797,0.009921148,0.0031013635,0.4227623],"study_design_scores_gemma":[0.0000034944283,0.000010288077,0.00027403454,0.0000019737174,0.000004272526,0.00001218214,0.00000150975,0.99830854,0.0007655142,0.0005592728,0.000055724377,0.0000032818975],"about_ca_topic_score_codex":0.0036200923,"about_ca_topic_score_gemma":0.0042288336,"teacher_disagreement_score":0.0036200923,"about_ca_system_score_codex":0.00042665054,"about_ca_system_score_gemma":0.0008619632,"threshold_uncertainty_score":0.0071980357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023760676,0.0010403383,0.97212166,0.00015473952,0.00011658607,0.00007163082,0.000019404159,0.0010850825,0.001629876],"genre_scores_gemma":[0.8177435,0.0012861013,0.17825839,0.00012552639,0.0002130626,0.00018027185,0.00010813645,0.00013463342,0.0019502885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970305,0.0007534999,0.00012470345,0.00040726404,0.0014973658,0.0001866813],"domain_scores_gemma":[0.9963115,0.0012956576,0.00019366803,0.00039017154,0.0016978645,0.000111198715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025430915,0.0008406302,0.0008640395,0.001496213,0.0006065874,0.0010880438,0.0015102467,0.0007053447,0.0008552774],"category_scores_gemma":[0.009061367,0.0004415317,0.00059948413,0.0008047214,0.00077493704,0.0026226642,0.001197051,0.0019433736,0.00031408953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010899638,0.00030097677,0.008313168,0.00053356506,0.00018349626,0.00023852574,0.00058384833,0.2780777,0.058642074,0.05674018,0.0043869633,0.59090954],"study_design_scores_gemma":[0.00008177709,0.00020323078,0.0010885441,0.000026890973,0.00007140198,0.00013048055,0.00002716453,0.9754024,0.015076267,0.0042552226,0.0035798517,0.00005665528],"about_ca_topic_score_codex":0.004075447,"about_ca_topic_score_gemma":0.0010644682,"teacher_disagreement_score":0.004075447,"about_ca_system_score_codex":0.0008215236,"about_ca_system_score_gemma":0.001421646,"threshold_uncertainty_score":0.013449311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033170073,0.0010177715,0.98443997,0.00046018892,0.00071288244,0.00022299703,0.00017527274,0.002603498,0.007050402],"genre_scores_gemma":[0.1703919,0.0021572565,0.79885644,0.00060078176,0.0007624681,0.0007206704,0.00057212415,0.0003621887,0.02557616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998946,0.00014763293,0.0000648361,0.00027435183,0.00049916294,0.000068043104],"domain_scores_gemma":[0.99923253,0.000115495546,0.00005426901,0.00014320713,0.00040606133,0.000048327274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097122806,0.0005156703,0.00054686697,0.0013987442,0.0009813658,0.0018634595,0.0020369997,0.00090273254,0.0056455857],"category_scores_gemma":[0.0023568626,0.0002783487,0.00050796184,0.0011102124,0.00065365416,0.0020751937,0.0007329894,0.0013707137,0.0020432216],"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.000257637,0.00023181194,0.0011449966,0.00048476216,0.00011503114,0.00018878414,0.00047063103,0.013930878,0.06724181,0.24645495,0.02989048,0.6395882],"study_design_scores_gemma":[0.00041848572,0.00084963994,0.0018469087,0.00015238843,0.00030647597,0.0016073958,0.00022233091,0.5240452,0.10007853,0.0740669,0.29607558,0.00033011154],"about_ca_topic_score_codex":0.0030961758,"about_ca_topic_score_gemma":0.0019836493,"teacher_disagreement_score":0.0056455857,"about_ca_system_score_codex":0.0012067133,"about_ca_system_score_gemma":0.0021595242,"threshold_uncertainty_score":0.018886328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04663058,0.0065342174,0.8956742,0.0060390984,0.0015603874,0.00021843034,0.00005101022,0.00020284767,0.043089256],"genre_scores_gemma":[0.9097252,0.0036030847,0.066891775,0.00075793575,0.002190053,0.00020718094,0.000043894033,0.000058129805,0.016522685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812406,0.0004908676,0.00006827769,0.00040455413,0.0006921379,0.00022004246],"domain_scores_gemma":[0.99816966,0.00083153823,0.00013213411,0.00012785861,0.000565959,0.00017298148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023153806,0.0004533229,0.0008287715,0.0008398836,0.0010829773,0.002522949,0.0015816189,0.0014339206,0.0035766133],"category_scores_gemma":[0.006010398,0.00025259654,0.0006850084,0.00051590457,0.0019447773,0.0026986494,0.001086954,0.0025008046,0.00031988294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009526959,0.00012504024,0.0009961532,0.00015128501,0.00006060095,0.00023870575,0.0002669793,0.07287617,0.0068067093,0.8667154,0.0028425627,0.048825134],"study_design_scores_gemma":[0.00004034826,0.00009537158,0.00030872438,0.000042789663,0.00002966094,0.0001541103,0.00006691881,0.8849508,0.0013032226,0.10796574,0.0050116675,0.000030640822],"about_ca_topic_score_codex":0.0025749675,"about_ca_topic_score_gemma":0.000593248,"teacher_disagreement_score":0.0035766133,"about_ca_system_score_codex":0.0020573332,"about_ca_system_score_gemma":0.0019034114,"threshold_uncertainty_score":0.01492703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031687252,0.00024671515,0.9630973,0.00009394385,0.000028068434,0.00003694339,0.000026491309,0.00042320072,0.004360121],"genre_scores_gemma":[0.8130564,0.0009664314,0.18125682,0.000059657516,0.00005171097,0.00013855637,0.00012211835,0.00024581904,0.004102387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.00021993293,0.00003387396,0.00008577622,0.00044428135,0.00008375622],"domain_scores_gemma":[0.99858034,0.0005819075,0.000095496594,0.00021824437,0.00049607875,0.00002805938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240011,0.0006106421,0.00038144115,0.0006821173,0.0005129879,0.00063191337,0.0008159886,0.00035218537,0.0011237004],"category_scores_gemma":[0.0042044213,0.00028091448,0.0005752002,0.00043555396,0.00056032423,0.0013320919,0.00047723047,0.0006697892,0.00016229924],"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.00018820753,0.000062833584,0.0022843087,0.00021906578,0.000059160706,0.00031578986,0.0005355552,0.7331239,0.037556026,0.13339952,0.0012605211,0.090995125],"study_design_scores_gemma":[0.0000035967144,0.000030042975,0.00028150147,0.0000059402582,0.000012645254,0.00009384864,0.0000337173,0.9835339,0.0072808196,0.00676987,0.0019430105,0.000011085551],"about_ca_topic_score_codex":0.005300819,"about_ca_topic_score_gemma":0.002253308,"teacher_disagreement_score":0.005300819,"about_ca_system_score_codex":0.0006337693,"about_ca_system_score_gemma":0.0008489653,"threshold_uncertainty_score":0.010539949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02241654,0.00040737618,0.97611177,0.0001491251,0.000050861334,0.00003365495,0.000014243676,0.00010143694,0.0007151274],"genre_scores_gemma":[0.56458575,0.0007088082,0.43069157,0.000113565584,0.000113561895,0.00014707174,0.000084009735,0.0000883272,0.0034673656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.00029656672,0.00004200586,0.00011536293,0.0003553796,0.00014083137],"domain_scores_gemma":[0.9982773,0.0009177626,0.00011380053,0.00012267068,0.0004438228,0.0001247348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022624,0.00044773048,0.0011052318,0.0006477516,0.0006265891,0.0013812003,0.0018200869,0.0009066638,0.0022960126],"category_scores_gemma":[0.0071467604,0.0003634863,0.0003236191,0.001003316,0.0008813802,0.0032721814,0.0015973822,0.0013296043,0.00027223842],"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.00060027605,0.00010890352,0.0014427915,0.00018169664,0.00006701505,0.00008251832,0.00023922553,0.71947837,0.00619359,0.12480161,0.0021299217,0.1446741],"study_design_scores_gemma":[0.000013651767,0.00001946453,0.0000314791,0.0000035663368,0.0000030142753,0.000010403947,0.000008863512,0.99563557,0.0003423595,0.0036186643,0.00030846594,0.000004464677],"about_ca_topic_score_codex":0.0027632064,"about_ca_topic_score_gemma":0.0009793399,"teacher_disagreement_score":0.0027632064,"about_ca_system_score_codex":0.0011271498,"about_ca_system_score_gemma":0.0013895333,"threshold_uncertainty_score":0.011964858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011968077,0.000068626665,0.996316,0.000051863568,0.0000617081,0.000081302656,0.000041052237,0.0012496035,0.0009330312],"genre_scores_gemma":[0.051737685,0.0002177141,0.94247985,0.000097329525,0.000102919155,0.0004847642,0.00032495987,0.00039636684,0.004158419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813616,0.0003676697,0.00013762104,0.00055705616,0.0006852951,0.00011611776],"domain_scores_gemma":[0.99875164,0.00030364038,0.0001054033,0.00031122603,0.00048221377,0.00004591385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015747583,0.0016430685,0.0011337498,0.0023564906,0.0011625162,0.0022548467,0.0028048053,0.0010527876,0.008629227],"category_scores_gemma":[0.0049577598,0.0005669498,0.00068768696,0.0017185557,0.00092246756,0.0030033304,0.0016125913,0.0018302865,0.005253628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004462274,0.00014260753,0.0025676433,0.00036140642,0.00012443635,0.00025284046,0.00038850793,0.1449543,0.02729609,0.08564457,0.012587485,0.72523385],"study_design_scores_gemma":[0.00012871846,0.00015462647,0.0010702913,0.0000397491,0.00006246884,0.00070033653,0.00008125235,0.91807425,0.023222486,0.036570013,0.019775353,0.00012037626],"about_ca_topic_score_codex":0.003109848,"about_ca_topic_score_gemma":0.0018891834,"teacher_disagreement_score":0.008629227,"about_ca_system_score_codex":0.0010992085,"about_ca_system_score_gemma":0.0012708838,"threshold_uncertainty_score":0.028867662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5966535,0.003576353,0.3814631,0.00040362158,0.000100908816,0.000080784186,0.00010543543,0.001740628,0.015875593],"genre_scores_gemma":[0.9943369,0.0001775698,0.005124483,0.000021834016,0.0000096724625,0.000009184852,0.000020188194,0.000019289446,0.0002809095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794394,0.0004884025,0.0000682023,0.00027166354,0.0006427985,0.00058508496],"domain_scores_gemma":[0.9945471,0.003014004,0.00044388397,0.00040788282,0.0014234072,0.00016364749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670732,0.00082426023,0.0006560754,0.0009808308,0.0005275234,0.0008007617,0.0007475046,0.00076013873,0.0010426005],"category_scores_gemma":[0.01024132,0.0001782108,0.00035256884,0.000786007,0.00057876983,0.0008617694,0.0005171662,0.0005132895,0.000197857],"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.001322786,0.00022853893,0.0080603175,0.00023018272,0.00010752455,0.00044524932,0.00027676031,0.8351054,0.03564853,0.0065949555,0.0012423344,0.11073743],"study_design_scores_gemma":[0.000018899618,0.0002812936,0.001751946,0.0000075499365,0.000046233756,0.00017093665,0.000034777502,0.9901693,0.0066469423,0.00061018666,0.00024357843,0.000018438846],"about_ca_topic_score_codex":0.007454975,"about_ca_topic_score_gemma":0.002766809,"teacher_disagreement_score":0.007454975,"about_ca_system_score_codex":0.0010275043,"about_ca_system_score_gemma":0.0011257575,"threshold_uncertainty_score":0.014823139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17128405,0.016394166,0.77939093,0.0022234668,0.00060642516,0.00013282434,0.00005925957,0.0006530241,0.029255902],"genre_scores_gemma":[0.92841333,0.0063314484,0.05233881,0.00012961778,0.00025546039,0.00007551409,0.000053610405,0.000047943082,0.0123542175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993079,0.00023265397,0.00003091504,0.00007373874,0.00028325638,0.00007148435],"domain_scores_gemma":[0.9984993,0.00068024965,0.00013935518,0.00023513485,0.00040533658,0.000040678544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862006,0.0003268353,0.00030253697,0.00081238593,0.00036932563,0.0011797469,0.0007149714,0.0007543568,0.0014025003],"category_scores_gemma":[0.0047966396,0.00020727506,0.00016253341,0.0010080554,0.0012497683,0.0025537289,0.00051237294,0.0008080393,0.00030414696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065082184,0.00026276227,0.002083045,0.00024373778,0.000029063602,0.00038974884,0.00056111655,0.15877925,0.011024894,0.45317662,0.0035981734,0.36920077],"study_design_scores_gemma":[0.00006949722,0.0003437153,0.001730388,0.000115538605,0.000053928343,0.0004730825,0.00024444063,0.75647247,0.019704299,0.20130466,0.019428687,0.000059354337],"about_ca_topic_score_codex":0.00146818,"about_ca_topic_score_gemma":0.00081005646,"teacher_disagreement_score":0.0014862006,"about_ca_system_score_codex":0.00090614427,"about_ca_system_score_gemma":0.00054712873,"threshold_uncertainty_score":0.007859826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308371,0.008939061,0.25201643,0.000621577,0.00044968506,0.0001344961,0.000039693405,0.00016648792,0.006795597],"genre_scores_gemma":[0.9955733,0.0006588707,0.003150367,0.000037602662,0.00018407761,0.000016182037,0.000011440494,0.000009518029,0.00035864275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506795,0.0020382593,0.0002748943,0.00047130525,0.0015361806,0.00061145995],"domain_scores_gemma":[0.96444494,0.024653511,0.0025478068,0.0012629486,0.0062807044,0.0008101091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005557723,0.00082214625,0.0009453362,0.0018665104,0.0015937082,0.0014014476,0.0011194235,0.00086794584,0.0006037945],"category_scores_gemma":[0.020220239,0.000411531,0.000563746,0.0012489103,0.001287953,0.0028332828,0.0007485953,0.0015559922,0.000073829695],"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.0032376107,0.0010565363,0.07429822,0.0013502846,0.0013208373,0.006804907,0.0062353485,0.50860655,0.1100151,0.119066894,0.004386402,0.16362128],"study_design_scores_gemma":[0.000033258664,0.0007195696,0.0051816376,0.000046662204,0.0002587009,0.0009343627,0.0005737095,0.969753,0.011269759,0.009799145,0.0013621722,0.00006797591],"about_ca_topic_score_codex":0.00258599,"about_ca_topic_score_gemma":0.0011395627,"teacher_disagreement_score":0.005557723,"about_ca_system_score_codex":0.0016144156,"about_ca_system_score_gemma":0.00073990185,"threshold_uncertainty_score":0.029392362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08848175,0.065260254,0.7548295,0.007110381,0.0018527745,0.00032225176,0.00060138106,0.0013560457,0.080185615],"genre_scores_gemma":[0.7514164,0.058978133,0.17203148,0.0011799682,0.0029629166,0.00045458626,0.00089792797,0.0003390759,0.011739508],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994262,0.0017188275,0.00020114332,0.0009136759,0.0026713226,0.0002330539],"domain_scores_gemma":[0.98268235,0.0088815205,0.0012691416,0.0017698394,0.005055829,0.00034132172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040104114,0.0009878437,0.0007811174,0.0032219451,0.00091991125,0.00321028,0.0016383849,0.0011817733,0.0021901878],"category_scores_gemma":[0.02474915,0.00045189957,0.00032431836,0.0074302433,0.0014056159,0.009394884,0.0013012276,0.002473983,0.0008214375],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002213735,0.0002527151,0.013008749,0.0011816769,0.000117589916,0.000082015096,0.00053449173,0.047511317,0.010963048,0.31991568,0.007566036,0.59864527],"study_design_scores_gemma":[0.000063218955,0.001338621,0.02780533,0.0015021419,0.00018815682,0.00093076937,0.0014401268,0.2868487,0.052443936,0.3166858,0.31046367,0.0002894793],"about_ca_topic_score_codex":0.0016819407,"about_ca_topic_score_gemma":0.0006763854,"teacher_disagreement_score":0.0040104114,"about_ca_system_score_codex":0.0021303918,"about_ca_system_score_gemma":0.0013169885,"threshold_uncertainty_score":0.0212093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20280477,0.00020924675,0.7935042,0.00020222989,0.00005606849,0.000084618994,0.00005622516,0.0007352201,0.0023475024],"genre_scores_gemma":[0.88199586,0.00017512297,0.1166481,0.00003484166,0.000057256424,0.00007991744,0.00011460314,0.000060424685,0.0008337986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662066,0.00096105784,0.00011569139,0.00050046743,0.0015911885,0.0002108892],"domain_scores_gemma":[0.9964761,0.0015382372,0.00034571852,0.0004143716,0.0010790962,0.00014656429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017174622,0.00055229646,0.0005200432,0.001236604,0.0007091046,0.0008459291,0.001109326,0.0004913384,0.0009873416],"category_scores_gemma":[0.008732141,0.00030718787,0.00046982127,0.0009828213,0.00067776145,0.0025655571,0.00081855536,0.0006433158,0.00019247142],"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.002064754,0.0004141774,0.04904372,0.0004827313,0.00014382182,0.00035626433,0.0018206789,0.08249279,0.3218418,0.08055103,0.0021089078,0.4586794],"study_design_scores_gemma":[0.000045076904,0.0005213566,0.011011693,0.000020550351,0.00007964506,0.0003911943,0.0002678402,0.8255944,0.14962883,0.009018456,0.0033584377,0.00006250298],"about_ca_topic_score_codex":0.003400952,"about_ca_topic_score_gemma":0.0012711963,"teacher_disagreement_score":0.003400952,"about_ca_system_score_codex":0.0014130541,"about_ca_system_score_gemma":0.000814054,"threshold_uncertainty_score":0.010252416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002744346,0.000082804596,0.9956455,0.00006830875,0.000015950742,0.00003098091,0.000009129748,0.00011103011,0.0012918819],"genre_scores_gemma":[0.3873599,0.00039048688,0.6086449,0.00009574286,0.00006143903,0.00033679864,0.00009605655,0.00010576727,0.0029089358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937135,0.00018761419,0.000028371682,0.00014934246,0.00017576029,0.00008763932],"domain_scores_gemma":[0.9994247,0.00025340493,0.00007742512,0.000046269168,0.00016162713,0.000036558806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014063958,0.00087260286,0.00078267243,0.0010660448,0.0008343133,0.0011846652,0.0015769723,0.0008879873,0.0019942152],"category_scores_gemma":[0.0026627649,0.00036902598,0.00053380296,0.0008304335,0.0014321922,0.0016958719,0.0013330424,0.0013866732,0.00025569662],"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.000077259785,0.000042640382,0.000576607,0.000068147325,0.000025562875,0.00008766561,0.00015243016,0.73251146,0.0029817238,0.19050358,0.0027090388,0.0702638],"study_design_scores_gemma":[0.000014334777,0.00003239051,0.00005850114,0.000009140224,0.000009232871,0.000026778693,0.00001746206,0.9708518,0.0008800737,0.026521984,0.0015686199,0.00000971961],"about_ca_topic_score_codex":0.00409447,"about_ca_topic_score_gemma":0.0016119473,"teacher_disagreement_score":0.00409447,"about_ca_system_score_codex":0.0018077398,"about_ca_system_score_gemma":0.0017592391,"threshold_uncertainty_score":0.013116121},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05607582,0.001646167,0.93307495,0.0012902645,0.00013028028,0.000070101145,0.00002075366,0.00037841173,0.007313102],"genre_scores_gemma":[0.74257094,0.0014714104,0.251218,0.00023279872,0.00024704417,0.000077697056,0.00004999844,0.000075708376,0.004056349],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992065,0.00028082344,0.000039510385,0.00010235653,0.00027385235,0.00009695876],"domain_scores_gemma":[0.9992562,0.00034072288,0.0001028811,0.00012863916,0.00014020185,0.00003128452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899546,0.00054411753,0.00042884736,0.00042730567,0.0011726046,0.0010175097,0.0009801727,0.0010546498,0.0014900989],"category_scores_gemma":[0.0030367724,0.00022411402,0.00039137728,0.0005647035,0.00076873164,0.0033666685,0.001053516,0.0012065282,0.0004437841],"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.0003254947,0.00025704887,0.005487965,0.0009266683,0.000091829366,0.0006117499,0.0007963602,0.11599229,0.058460448,0.17916201,0.0054182657,0.6324699],"study_design_scores_gemma":[0.000112613954,0.00054742105,0.003073058,0.00007963964,0.00010222578,0.0029969863,0.0005710185,0.7020371,0.10620179,0.15517642,0.028993571,0.00010819118],"about_ca_topic_score_codex":0.0005223331,"about_ca_topic_score_gemma":0.0004581943,"teacher_disagreement_score":0.0014900989,"about_ca_system_score_codex":0.0005013544,"about_ca_system_score_gemma":0.000586936,"threshold_uncertainty_score":0.005235493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69179446,0.0019309622,0.24525394,0.0018374104,0.0002656695,0.00041907994,0.0014067595,0.002143953,0.054947853],"genre_scores_gemma":[0.9923793,0.0002662236,0.0047598328,0.00003414669,0.000043651708,0.00004097587,0.00019012029,0.00004230744,0.0022434187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883336,0.0001440769,0.00007461563,0.00025523957,0.00055178534,0.00014092845],"domain_scores_gemma":[0.9952625,0.002085136,0.00044112405,0.00029893982,0.0017223385,0.00018994162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008859,0.00046193576,0.00034251084,0.0034895309,0.0008365142,0.0021411872,0.0006574064,0.0005114163,0.0039285272],"category_scores_gemma":[0.009007135,0.0002688125,0.0005809706,0.0017131404,0.0009189047,0.0030929348,0.0005526235,0.0005094594,0.00044769383],"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.0006172242,0.00026013443,0.26373872,0.0010371697,0.0004442569,0.0022477952,0.0052091186,0.10922097,0.051979344,0.16648094,0.014952127,0.38381222],"study_design_scores_gemma":[0.000048208236,0.00015023131,0.15975842,0.00014548897,0.00046976176,0.0012168684,0.0035096346,0.70085347,0.042806327,0.055549238,0.035221726,0.0002706643],"about_ca_topic_score_codex":0.008245751,"about_ca_topic_score_gemma":0.0047060223,"teacher_disagreement_score":0.008245751,"about_ca_system_score_codex":0.0020379315,"about_ca_system_score_gemma":0.0011416853,"threshold_uncertainty_score":0.016395569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024927389,0.0023184828,0.9163952,0.0014151228,0.0021725167,0.0020264213,0.00060059666,0.013089038,0.037055284],"genre_scores_gemma":[0.66137046,0.0021022947,0.28812233,0.0021687516,0.002284542,0.003391201,0.0015198473,0.0008436244,0.038197003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968708,0.0005211182,0.00044701702,0.00047308204,0.0013424362,0.00034548333],"domain_scores_gemma":[0.99625033,0.00062248536,0.00044901922,0.0010991088,0.001235158,0.00034393463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026326918,0.000818339,0.00086851674,0.0026339865,0.0018866503,0.0030506847,0.0042490796,0.0018289307,0.0063150343],"category_scores_gemma":[0.005212438,0.00060014817,0.0009218512,0.0012637158,0.0011303568,0.004366781,0.005287402,0.0032187002,0.0023719186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015795358,0.0007350892,0.0073281713,0.0015351602,0.00033705693,0.0022013802,0.0014560979,0.012456299,0.043952875,0.4179914,0.037686463,0.4727405],"study_design_scores_gemma":[0.0009440947,0.0013587103,0.005003381,0.0004623515,0.0006800903,0.008338905,0.00051477907,0.33825687,0.07093711,0.11649976,0.45619935,0.0008046968],"about_ca_topic_score_codex":0.00091623253,"about_ca_topic_score_gemma":0.00035826684,"teacher_disagreement_score":0.0063150343,"about_ca_system_score_codex":0.0009346415,"about_ca_system_score_gemma":0.0017877087,"threshold_uncertainty_score":0.021125853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13407323,0.014755463,0.7312969,0.016723482,0.0041444437,0.00043715996,0.00041623294,0.0011270199,0.09702602],"genre_scores_gemma":[0.8582107,0.0045761233,0.11525485,0.0010801037,0.0014295654,0.0002936086,0.00023020938,0.00032806615,0.018596817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944218,0.002030541,0.0003396214,0.0005184676,0.0021410636,0.0005485462],"domain_scores_gemma":[0.99328256,0.0030784337,0.00037432087,0.0012292621,0.0017834967,0.00025193478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055553517,0.0009411568,0.0009725699,0.001966434,0.0019770854,0.0050712503,0.0028302893,0.0027775166,0.006498415],"category_scores_gemma":[0.014979907,0.0008033392,0.0008323744,0.0019386645,0.0026410911,0.009688078,0.0033502372,0.0046958486,0.0012561255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009607022,0.00020826574,0.0008002249,0.00028268254,0.00004731963,0.00021104088,0.00040168036,0.027406385,0.0074054524,0.8678631,0.0066337786,0.08777931],"study_design_scores_gemma":[0.00014022939,0.00030597937,0.0005509116,0.00019300674,0.00012255639,0.00029410684,0.0005574191,0.28012553,0.005050083,0.6639597,0.048568908,0.00013153059],"about_ca_topic_score_codex":0.001578035,"about_ca_topic_score_gemma":0.004117685,"teacher_disagreement_score":0.006498415,"about_ca_system_score_codex":0.0024918304,"about_ca_system_score_gemma":0.0011188863,"threshold_uncertainty_score":0.029379845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12349949,0.0013903128,0.85841435,0.00040824807,0.00014735968,0.00011896802,0.0000941813,0.00031749136,0.015609637],"genre_scores_gemma":[0.9878142,0.00037489028,0.007876073,0.000051871873,0.00006336986,0.000069999085,0.00004629685,0.00005619041,0.0036472033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927336,0.00025582756,0.000029392477,0.00012565804,0.00020233092,0.00011334635],"domain_scores_gemma":[0.9962612,0.0021421232,0.0003566144,0.00016294308,0.0010023168,0.000074709926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029346796,0.0014214714,0.001048286,0.001108461,0.0006041532,0.0017267556,0.0010999863,0.0012109719,0.0030068692],"category_scores_gemma":[0.0062855347,0.00033677346,0.00094220747,0.0003751774,0.00131373,0.0009916835,0.0013717108,0.0012972893,0.00025438017],"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.00038953288,0.00006721137,0.00087880343,0.00021492691,0.00011528853,0.00017510583,0.00020897611,0.9306537,0.010573788,0.03653273,0.0011236455,0.019066347],"study_design_scores_gemma":[0.0000067020846,0.00005570429,0.00018246332,0.0000063490684,0.000009514098,0.000017490196,0.0000141920345,0.99597293,0.0006739905,0.0029159514,0.00013845261,0.0000062407594],"about_ca_topic_score_codex":0.0039885184,"about_ca_topic_score_gemma":0.0012663793,"teacher_disagreement_score":0.0039885184,"about_ca_system_score_codex":0.0011609193,"about_ca_system_score_gemma":0.0008401021,"threshold_uncertainty_score":0.015520275},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02286607,0.0012041752,0.7980132,0.00186102,0.0008770274,0.00052674516,0.0071518426,0.0708508,0.096649095],"genre_scores_gemma":[0.51405126,0.004096472,0.23981233,0.0006463348,0.0009609342,0.0012796521,0.03149639,0.008421017,0.19923559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993926,0.000106058076,0.000046836292,0.000055722576,0.0003151839,0.00008358124],"domain_scores_gemma":[0.9984787,0.00023987504,0.00008039184,0.000805887,0.00022397823,0.00017119554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011511649,0.00046386538,0.00047913348,0.00087761466,0.0005813451,0.0020658693,0.0010665485,0.0005498724,0.031894505],"category_scores_gemma":[0.004078264,0.00032643828,0.0002616245,0.001193397,0.0003124689,0.0022570859,0.001606726,0.0013070363,0.014300991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007628253,0.00019496134,0.0015511413,0.00029460556,0.00004166815,0.0003800467,0.0006156771,0.009560346,0.021121772,0.14895286,0.30879608,0.5077279],"study_design_scores_gemma":[0.00024524963,0.00015671713,0.0022132297,0.00008577568,0.0000355621,0.0005350076,0.00018208273,0.11351249,0.01665307,0.08454115,0.7817791,0.00006057053],"about_ca_topic_score_codex":0.0011884092,"about_ca_topic_score_gemma":0.0013804651,"teacher_disagreement_score":0.031894505,"about_ca_system_score_codex":0.0006495601,"about_ca_system_score_gemma":0.0009486886,"threshold_uncertainty_score":0.10669774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083075024,0.00058810326,0.9023478,0.0009988168,0.0001229056,0.00008521269,0.00019011283,0.00021482208,0.0123772165],"genre_scores_gemma":[0.954376,0.00067595235,0.036491845,0.00016545836,0.00014936602,0.0001674552,0.00011272718,0.00008977355,0.0077713877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987446,0.00029355657,0.000039710416,0.00018118139,0.0005264833,0.0002144159],"domain_scores_gemma":[0.997482,0.0014351045,0.00035434443,0.00011687619,0.00044188945,0.00016982888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017340686,0.00082816597,0.0009734325,0.0011983408,0.00079414103,0.0013620463,0.0011108266,0.00083911925,0.0022275227],"category_scores_gemma":[0.0050628437,0.00037529098,0.0009377108,0.0007073541,0.0019295657,0.0018908827,0.0013849562,0.0014001161,0.00019683993],"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.00004201684,0.00003948043,0.00039645744,0.00005281101,0.000030211286,0.00015009975,0.00009365239,0.49784544,0.004722076,0.49231124,0.00083831773,0.0034782232],"study_design_scores_gemma":[0.000003758432,0.000008739616,0.00007540824,0.00000251894,0.0000060298544,0.000013003462,0.000006897859,0.96383524,0.00023765951,0.035513233,0.0002907542,0.0000066220828],"about_ca_topic_score_codex":0.0073190187,"about_ca_topic_score_gemma":0.0032308716,"teacher_disagreement_score":0.0073190187,"about_ca_system_score_codex":0.002960922,"about_ca_system_score_gemma":0.0024535763,"threshold_uncertainty_score":0.021483064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076801434,0.0041417535,0.8822943,0.00588989,0.0009923765,0.00043158227,0.0008641014,0.006768385,0.021816127],"genre_scores_gemma":[0.7755271,0.0024842862,0.20275377,0.000654218,0.00080610096,0.0005824362,0.0013811998,0.00087691733,0.01493399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788684,0.0006242474,0.00011153748,0.0003742305,0.0007441668,0.00025888465],"domain_scores_gemma":[0.99348444,0.0024153898,0.00035358936,0.002665845,0.00074859685,0.00033203835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002171215,0.0010790449,0.0010689867,0.0010746118,0.002471513,0.002615756,0.0022900747,0.0015066292,0.013124958],"category_scores_gemma":[0.011208039,0.00058207137,0.00059474545,0.002450088,0.0021322484,0.0100067,0.0050602625,0.0030371782,0.00305669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016701367,0.0004290178,0.00410681,0.00069358095,0.00016650943,0.0010852175,0.00084477564,0.2170616,0.026186714,0.40071303,0.06277681,0.2842659],"study_design_scores_gemma":[0.00009055705,0.00013001559,0.0007117207,0.00008020653,0.00004324681,0.0001976905,0.00032076615,0.55526096,0.0117318835,0.4006189,0.03076763,0.000046432862],"about_ca_topic_score_codex":0.0030473727,"about_ca_topic_score_gemma":0.0028018395,"teacher_disagreement_score":0.013124958,"about_ca_system_score_codex":0.002117592,"about_ca_system_score_gemma":0.0015917602,"threshold_uncertainty_score":0.043907404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009209389,0.016990155,0.68075216,0.0049541118,0.0018554688,0.000089517984,0.00026790512,0.00031874623,0.28556263],"genre_scores_gemma":[0.28623742,0.03618332,0.24909836,0.0016313455,0.0047892067,0.00043185145,0.0007459551,0.0005034246,0.42037907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997805,0.000048271766,0.000008326367,0.000049122733,0.00009112779,0.00002256369],"domain_scores_gemma":[0.99976474,0.00014925528,0.000010485134,0.000025445426,0.000040112824,0.000009873345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050755334,0.0011361651,0.00076719915,0.0004696554,0.0005801279,0.0015610221,0.001181206,0.001452293,0.008804449],"category_scores_gemma":[0.001339209,0.0005117618,0.0005185945,0.000793714,0.0012638945,0.0027149545,0.00061229017,0.0025474,0.0012657607],"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.00003157142,0.000058917398,0.00005024835,0.00023512382,0.000012688958,0.00004666474,0.000104131206,0.047851693,0.0011816852,0.8105325,0.037016205,0.10287847],"study_design_scores_gemma":[0.000025908197,0.00001812804,0.00010903109,0.000082194936,0.000011703852,0.000066320936,0.000034800443,0.10986732,0.0006642693,0.83856326,0.050539646,0.000017441764],"about_ca_topic_score_codex":0.0019517583,"about_ca_topic_score_gemma":0.001366103,"teacher_disagreement_score":0.008804449,"about_ca_system_score_codex":0.0010906933,"about_ca_system_score_gemma":0.00074339606,"threshold_uncertainty_score":0.029453814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041482616,0.26452884,0.17710157,0.004745463,0.014358515,0.0001850983,0.015762575,0.017573537,0.5015962],"genre_scores_gemma":[0.029763514,0.10229277,0.045778655,0.0013209772,0.0040021404,0.00020571674,0.010573306,0.0021658754,0.8038971],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959594,0.000033119588,0.0000251839,0.00006732025,0.00024324589,0.000035251647],"domain_scores_gemma":[0.9994236,0.00012637896,0.00004441797,0.00008618937,0.00027274748,0.000046724246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006756879,0.0015575739,0.0014301968,0.0017078406,0.0003575568,0.0023138819,0.0015828054,0.0011571397,0.123370096],"category_scores_gemma":[0.001715832,0.000989848,0.0004373371,0.0023761913,0.00033867208,0.0024675427,0.000906067,0.0019276197,0.12750863],"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.000092045826,0.00005603675,0.00023329083,0.0004535643,0.000024040412,0.000065559725,0.00005451018,0.0048805,0.0022407414,0.009489146,0.604775,0.3776356],"study_design_scores_gemma":[0.000023603276,0.00007979282,0.00089816126,0.0003260526,0.000039104583,0.00040224704,0.000035167504,0.0066560484,0.0011842796,0.014740559,0.9755896,0.000025495778],"about_ca_topic_score_codex":0.001785683,"about_ca_topic_score_gemma":0.0021781113,"teacher_disagreement_score":0.123370096,"about_ca_system_score_codex":0.0006402895,"about_ca_system_score_gemma":0.0005441248,"threshold_uncertainty_score":0.41271406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012520717,0.00010165641,0.9861217,0.00006769685,0.00001956992,0.00002986257,0.000019553203,0.00038045284,0.0007387917],"genre_scores_gemma":[0.78806394,0.00021335675,0.20928146,0.000096069976,0.00006323339,0.00010505858,0.00011546938,0.00014777605,0.0019136551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889815,0.00018045372,0.00005221504,0.00032188563,0.00042506983,0.00012217296],"domain_scores_gemma":[0.99859947,0.00048087107,0.00018947806,0.00017845981,0.0004967458,0.000054926757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009482322,0.0009067005,0.00081091525,0.0013762179,0.00055702915,0.0010262541,0.0016860876,0.0008159085,0.00085737853],"category_scores_gemma":[0.003555319,0.00056811655,0.00051423704,0.0009015743,0.00067509,0.0015022475,0.0008549274,0.001283907,0.0003260103],"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.0001564702,0.00013111082,0.0034054115,0.00008585249,0.000057368277,0.00016031649,0.00017345823,0.783976,0.022532808,0.0111609055,0.0013759888,0.17678425],"study_design_scores_gemma":[0.000002286182,0.00001994086,0.00024619838,0.000003299419,0.0000071244413,0.000035234636,0.000007191613,0.99681515,0.0017278985,0.00077100797,0.0003546408,0.000010042646],"about_ca_topic_score_codex":0.009997823,"about_ca_topic_score_gemma":0.006794696,"teacher_disagreement_score":0.009997823,"about_ca_system_score_codex":0.0012795761,"about_ca_system_score_gemma":0.0012507509,"threshold_uncertainty_score":0.019879222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019791935,0.000095119445,0.9774024,0.00010933177,0.000019754303,0.00012479641,0.000037445985,0.00014152496,0.00227778],"genre_scores_gemma":[0.42291325,0.00015770886,0.57472336,0.000081308855,0.00002717577,0.00036217904,0.000119254866,0.000044024982,0.0015717365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989191,0.0005069217,0.000052073217,0.0001560796,0.00023412767,0.00013175863],"domain_scores_gemma":[0.9987116,0.00087068917,0.000116091884,0.000040968116,0.00019893993,0.00006169593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027725697,0.0009941917,0.0014265174,0.0013594695,0.00067401095,0.0015711191,0.0010500501,0.0010223546,0.0018156421],"category_scores_gemma":[0.0032021925,0.00062167126,0.0009879853,0.0012099451,0.0007034329,0.001061171,0.000825578,0.0009347826,0.00017235908],"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.000031853928,0.000024523124,0.00021746338,0.00002497522,0.00002360348,0.0000256907,0.000020346462,0.97436136,0.0005341271,0.0059059234,0.00021429804,0.01861595],"study_design_scores_gemma":[0.000007247287,0.000015550148,0.000024553217,0.0000028209702,0.0000041702688,0.0000039256834,0.0000061840005,0.99836427,0.00015831877,0.001270777,0.00013921785,0.000002952818],"about_ca_topic_score_codex":0.00775185,"about_ca_topic_score_gemma":0.006236969,"teacher_disagreement_score":0.00775185,"about_ca_system_score_codex":0.0021997395,"about_ca_system_score_gemma":0.0029155572,"threshold_uncertainty_score":0.015960276},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011120032,0.010630423,0.77410036,0.0020790503,0.0009008398,0.00007648883,0.00086659275,0.0016424329,0.19858377],"genre_scores_gemma":[0.40757507,0.019866254,0.33405176,0.00073976454,0.0007274102,0.00043889976,0.0030559702,0.00054697285,0.23299803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998412,0.00003733212,0.000007707373,0.0000409804,0.00005685812,0.000015836324],"domain_scores_gemma":[0.9997938,0.000098566285,0.00001066058,0.000035165544,0.000049120204,0.00001278589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023818329,0.0006867157,0.00044052646,0.0007164471,0.00042298262,0.0012721864,0.0006595106,0.0007141274,0.018339405],"category_scores_gemma":[0.0010268384,0.0001564771,0.0004294821,0.0010804171,0.0005920251,0.0016166668,0.00078214833,0.0010970378,0.0046118065],"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.000065902124,0.00003792198,0.00032678508,0.0002972458,0.00002806169,0.00015872503,0.00011435054,0.05512695,0.004010387,0.5020135,0.025863029,0.41195711],"study_design_scores_gemma":[0.000017089897,0.00007484598,0.00035327743,0.00013420418,0.000023312252,0.00035987588,0.000049577004,0.27447647,0.0029721449,0.43777564,0.2837314,0.00003215115],"about_ca_topic_score_codex":0.0012326655,"about_ca_topic_score_gemma":0.001221617,"teacher_disagreement_score":0.018339405,"about_ca_system_score_codex":0.00095297047,"about_ca_system_score_gemma":0.00054950826,"threshold_uncertainty_score":0.06135142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010872103,0.0009506641,0.97030884,0.00061570405,0.00017201238,0.000037820322,0.00014208024,0.0002767275,0.016624065],"genre_scores_gemma":[0.72217804,0.0058551165,0.23561256,0.0004572635,0.00053083425,0.0004096777,0.00037637475,0.00036295157,0.034217227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986434,0.000043765016,0.000006470971,0.00003415474,0.00003956831,0.000011771468],"domain_scores_gemma":[0.9998363,0.00008046208,0.000021072561,0.000016915252,0.000033571087,0.000011559624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027316768,0.00084426627,0.00046066297,0.00040818963,0.00039743754,0.0011140795,0.0013324325,0.0010526066,0.0029316244],"category_scores_gemma":[0.00081163074,0.00056624174,0.0006303104,0.0004048499,0.0006400287,0.0017131837,0.0007472517,0.0010377883,0.0005727529],"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.000014610095,0.000040149665,0.00027274474,0.000082377526,0.000032465512,0.00006395452,0.00007327655,0.8130337,0.0024453623,0.1641529,0.002180771,0.017607532],"study_design_scores_gemma":[0.000002965914,0.0000056889985,0.000039445105,0.000006681305,0.0000084002295,0.00001292299,0.0000069439734,0.9678437,0.00027849036,0.029760513,0.0020293277,0.000005007508],"about_ca_topic_score_codex":0.0040501677,"about_ca_topic_score_gemma":0.002735178,"teacher_disagreement_score":0.0040501677,"about_ca_system_score_codex":0.0006849937,"about_ca_system_score_gemma":0.0006654324,"threshold_uncertainty_score":0.009807289},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19270957,0.0008052424,0.7698997,0.0007844473,0.0003020598,0.00043178658,0.0002481496,0.0025535747,0.032265436],"genre_scores_gemma":[0.91754496,0.00020595832,0.077588424,0.000098461096,0.000058178535,0.000090212285,0.00019485485,0.000046798217,0.0041720243],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992372,0.00015564777,0.000038299426,0.00006669099,0.00035815785,0.00014400228],"domain_scores_gemma":[0.9994838,0.00005645957,0.000047435755,0.0001657356,0.00018805808,0.000058565394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766067,0.00032697307,0.0004455944,0.00059157016,0.00049584283,0.00078005675,0.0012186784,0.0005625777,0.0014292554],"category_scores_gemma":[0.0012657853,0.00012456413,0.00029702025,0.0006418956,0.0003692658,0.0009989352,0.0009947963,0.0007386597,0.00042177466],"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.0006450803,0.000778079,0.0030403193,0.00016455217,0.00009394903,0.00086865865,0.00036126794,0.26524028,0.18790011,0.16726412,0.011022014,0.36262164],"study_design_scores_gemma":[0.00005800779,0.00022902347,0.0008501832,0.000011169596,0.000018100573,0.00052549026,0.00007088182,0.94535923,0.022167718,0.016345076,0.014311292,0.00005384819],"about_ca_topic_score_codex":0.0008281115,"about_ca_topic_score_gemma":0.0005665235,"teacher_disagreement_score":0.0014292554,"about_ca_system_score_codex":0.0005596677,"about_ca_system_score_gemma":0.000575954,"threshold_uncertainty_score":0.0047813654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00790926,0.001410696,0.9659326,0.0004993643,0.00069452287,0.00044748466,0.00035732295,0.006170623,0.01657813],"genre_scores_gemma":[0.3592651,0.0026649379,0.5990516,0.00090350147,0.00077238027,0.0013562515,0.0022953656,0.0015636913,0.03212719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980344,0.00037948813,0.00019535585,0.00044264423,0.000657591,0.00029053332],"domain_scores_gemma":[0.99683064,0.0012158279,0.0002423702,0.000844046,0.00072557176,0.00014144785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029639688,0.001694788,0.0013342472,0.0025232022,0.0016071307,0.0033047255,0.0036242604,0.0019312982,0.012611261],"category_scores_gemma":[0.010976988,0.00085897266,0.0014299918,0.0013419547,0.0014263238,0.0035696812,0.0034840999,0.002295782,0.003916211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045381868,0.00018072846,0.0015672452,0.0005191072,0.0002022876,0.00016112569,0.00033341695,0.31251237,0.004317819,0.26029128,0.040429194,0.3790317],"study_design_scores_gemma":[0.00015730131,0.000109673136,0.00025125413,0.000067435176,0.0000665575,0.00010567097,0.000062308616,0.8720423,0.0032806336,0.074687146,0.049113076,0.000056669585],"about_ca_topic_score_codex":0.0030256046,"about_ca_topic_score_gemma":0.0022918514,"teacher_disagreement_score":0.012611261,"about_ca_system_score_codex":0.0016285782,"about_ca_system_score_gemma":0.0020323386,"threshold_uncertainty_score":0.042188883},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007126816,0.023679614,0.508843,0.004525881,0.0059788506,0.003767992,0.008740919,0.01465569,0.42268124],"genre_scores_gemma":[0.12865454,0.040406875,0.55384004,0.005766853,0.0040902044,0.0057403375,0.027419427,0.00233302,0.23174867],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99675024,0.00062900607,0.00029899922,0.00033932706,0.0015860364,0.0003964225],"domain_scores_gemma":[0.9978976,0.00044169027,0.00013685557,0.0006216692,0.00077658583,0.0001256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025255927,0.0013508578,0.0013104684,0.003586667,0.0028964942,0.0043894225,0.0029510637,0.0020580795,0.029705487],"category_scores_gemma":[0.0047320104,0.0006133067,0.0009540901,0.0031366094,0.0007148028,0.0035069748,0.0047897133,0.0018678948,0.020369096],"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.00017918274,0.00013480494,0.0004975379,0.0012178431,0.00011854782,0.0005043948,0.00058684277,0.004479432,0.007105835,0.3341469,0.21629666,0.43473202],"study_design_scores_gemma":[0.000061771025,0.00008843203,0.00023814681,0.0003880095,0.00005992936,0.0007704964,0.00016311991,0.008788211,0.004535112,0.07835663,0.90648985,0.00006018561],"about_ca_topic_score_codex":0.0011796582,"about_ca_topic_score_gemma":0.0013209367,"teacher_disagreement_score":0.029705487,"about_ca_system_score_codex":0.001627284,"about_ca_system_score_gemma":0.0015747104,"threshold_uncertainty_score":0.09937477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77652985,0.021916647,0.16821906,0.0010546979,0.0012372709,0.00046598315,0.0012329328,0.003315436,0.026028093],"genre_scores_gemma":[0.983549,0.0013810594,0.013638525,0.000042360767,0.00010309882,0.00010166076,0.00049942394,0.00008162184,0.00060337014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280435,0.0023326762,0.000618248,0.00064642745,0.002824154,0.0007741555],"domain_scores_gemma":[0.9772495,0.013646669,0.0011374839,0.0014505677,0.006034141,0.00048166714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007468617,0.0012000981,0.0014841569,0.004933271,0.001106925,0.0018679315,0.0017685994,0.0014347279,0.0012291061],"category_scores_gemma":[0.022980861,0.00028212255,0.00066141057,0.0037174341,0.0008173723,0.002410748,0.000923054,0.0008860902,0.00021689263],"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.0021848644,0.00061948074,0.011559872,0.00083981844,0.0005390931,0.00018912257,0.00025294826,0.80447274,0.0076357536,0.01626477,0.005501926,0.14993967],"study_design_scores_gemma":[0.000060988754,0.0005802934,0.0043272777,0.00003638195,0.000108122425,0.00014366659,0.00009675519,0.9861537,0.0046666367,0.0024941287,0.0012858193,0.000046265683],"about_ca_topic_score_codex":0.0030105524,"about_ca_topic_score_gemma":0.00134632,"teacher_disagreement_score":0.007468617,"about_ca_system_score_codex":0.0025508397,"about_ca_system_score_gemma":0.0014736784,"threshold_uncertainty_score":0.03949827},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051898025,0.011873171,0.13771722,0.4580352,0.0016736948,0.00010875776,0.00015830877,0.00018121516,0.33835435],"genre_scores_gemma":[0.9464075,0.004652486,0.008660765,0.020167537,0.0014724788,0.00011178661,0.00003987943,0.000044790035,0.018442744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866454,0.009033306,0.0004323939,0.00083416956,0.0021445865,0.00091016013],"domain_scores_gemma":[0.96900785,0.02190113,0.0024103308,0.0033892484,0.0025513098,0.0007401521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013057671,0.0002851205,0.00041371267,0.00089475245,0.0024162233,0.008839025,0.001094273,0.004961014,0.0025299366],"category_scores_gemma":[0.02457151,0.000279481,0.00039644685,0.0012579574,0.01234029,0.009505249,0.0021009382,0.005010878,0.00037710098],"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.0000127402045,0.000015779835,0.00045321212,0.000016808155,0.0000054980237,0.000044540175,0.0005556006,0.0015240469,0.0000753147,0.9870821,0.0034809876,0.006733356],"study_design_scores_gemma":[0.000005113027,0.00002153256,0.00064314366,0.00012733779,0.000008633175,0.000071039525,0.0006800616,0.0059637693,0.00061871525,0.92858607,0.06325644,0.00001806614],"about_ca_topic_score_codex":0.003986717,"about_ca_topic_score_gemma":0.0021211214,"teacher_disagreement_score":0.013057671,"about_ca_system_score_codex":0.004087831,"about_ca_system_score_gemma":0.004137729,"threshold_uncertainty_score":0.06905633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088870525,0.0011812944,0.8987291,0.00037587402,0.000093303584,0.000061587736,0.00024092416,0.00057641737,0.009871044],"genre_scores_gemma":[0.9220374,0.0014603754,0.07172202,0.00004985824,0.0000686753,0.00009648787,0.00029467058,0.000117299096,0.004153121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886227,0.00023528317,0.000056971065,0.00015227836,0.00058780727,0.00010536291],"domain_scores_gemma":[0.99876606,0.0005482528,0.000115529954,0.00017406032,0.00035522803,0.000040846837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011649112,0.00065356604,0.00043096545,0.00081178476,0.00039373958,0.0014938548,0.001139129,0.00066729955,0.0014096053],"category_scores_gemma":[0.0032260395,0.0002842422,0.0006134792,0.00064326706,0.0007096755,0.0015507953,0.0004661739,0.00075890357,0.0002635859],"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.00005599841,0.000048033748,0.0010862064,0.000086142965,0.000023517006,0.000066611094,0.00007758373,0.90208226,0.008277308,0.07639491,0.00031776162,0.011483644],"study_design_scores_gemma":[0.0000022305944,0.000013494633,0.000092854476,0.0000057544985,0.000005284413,0.000011958821,0.000006322274,0.99204034,0.0020777998,0.0049659163,0.0007735553,0.000004380966],"about_ca_topic_score_codex":0.006661402,"about_ca_topic_score_gemma":0.0014704255,"teacher_disagreement_score":0.006661402,"about_ca_system_score_codex":0.0019081933,"about_ca_system_score_gemma":0.0014057973,"threshold_uncertainty_score":0.0138450265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45789424,0.00076119957,0.53473777,0.00024713876,0.00004567977,0.000059166134,0.000073856245,0.0004328685,0.005748029],"genre_scores_gemma":[0.9896409,0.00011631794,0.009324015,0.000015168281,0.000012150189,0.000019597042,0.000028440501,0.000021372252,0.0008220308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00019361175,0.0000137965335,0.000046816258,0.00029773058,0.000086436725],"domain_scores_gemma":[0.99876285,0.00069387926,0.000096236006,0.00006258101,0.00032666317,0.00005780946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822854,0.000605901,0.00053692854,0.0005070239,0.00034751755,0.0006299342,0.00044207435,0.00034835658,0.0015270176],"category_scores_gemma":[0.0033132902,0.00016030413,0.00023901684,0.00039964757,0.0005732644,0.0006388044,0.0004912232,0.00040601325,0.00010822506],"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.00020213472,0.000028021597,0.0009943183,0.00003530515,0.000026601256,0.00005096549,0.00004431837,0.96707594,0.007123273,0.0070219515,0.0002795059,0.01711766],"study_design_scores_gemma":[0.0000016022806,0.000018855791,0.000111781825,0.0000010508734,0.0000028191332,0.000006031692,0.0000040044847,0.99913955,0.00032393116,0.000353035,0.00003610191,0.0000012577249],"about_ca_topic_score_codex":0.007454735,"about_ca_topic_score_gemma":0.0026346869,"teacher_disagreement_score":0.007454735,"about_ca_system_score_codex":0.0011992371,"about_ca_system_score_gemma":0.0007518145,"threshold_uncertainty_score":0.014822662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00965488,0.00019238402,0.98951155,0.00005766008,0.000035805955,0.00002698438,0.000018125495,0.0002968598,0.00020567208],"genre_scores_gemma":[0.54250145,0.00041252692,0.45534292,0.00012758082,0.00012692645,0.00014444024,0.00019567307,0.00006931046,0.0010791536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985393,0.00041492752,0.00007705406,0.0002911125,0.00061321544,0.000064364496],"domain_scores_gemma":[0.9969614,0.0014845552,0.00031542085,0.00031209,0.00084508624,0.00008142751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026592782,0.0006983638,0.0008913938,0.00064912415,0.00026561468,0.0008246888,0.0010579923,0.0010790265,0.0004526579],"category_scores_gemma":[0.0104283225,0.00038405054,0.0003186806,0.00042986302,0.00050631055,0.0018325093,0.00091691327,0.0010232409,0.00022809833],"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.0004763718,0.00023289055,0.006767074,0.00026706036,0.0001374292,0.00016841406,0.00015859166,0.5506055,0.051004317,0.014206564,0.0019599395,0.3740159],"study_design_scores_gemma":[0.000014699331,0.00007557614,0.00044310297,0.000004724536,0.000009371753,0.00006805672,0.0000047137078,0.99435496,0.0035130354,0.00087025284,0.0006265548,0.000015066526],"about_ca_topic_score_codex":0.0011327119,"about_ca_topic_score_gemma":0.0008064121,"teacher_disagreement_score":0.0026592782,"about_ca_system_score_codex":0.0006195829,"about_ca_system_score_gemma":0.0005905292,"threshold_uncertainty_score":0.014063776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018114911,0.00003685263,0.99725,0.00002615467,0.000012927463,0.000020755462,0.000027393291,0.00050023024,0.00031428091],"genre_scores_gemma":[0.106291465,0.00021789076,0.8893981,0.00014159398,0.000040828872,0.00023121604,0.00040584552,0.000563422,0.0027097298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992156,0.00018825254,0.000046719913,0.00016389061,0.00032393358,0.000061715175],"domain_scores_gemma":[0.99869883,0.00050355145,0.00021732789,0.00021791564,0.0003263589,0.000036105608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016269061,0.00132013,0.00069249223,0.0008929584,0.00039871468,0.00094014494,0.0014353463,0.0016323141,0.0030136239],"category_scores_gemma":[0.006137583,0.00066818664,0.0012717564,0.0007259764,0.00054360594,0.0011737915,0.0007869558,0.0020445164,0.0015714272],"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.00011382605,0.00012915795,0.0022216216,0.00015623495,0.000103339866,0.00013187568,0.0001521844,0.7280014,0.030458506,0.0135397995,0.0033035048,0.22168855],"study_design_scores_gemma":[0.000006427143,0.000029334527,0.00026172496,0.000010939791,0.000009259288,0.00007559744,0.000014907797,0.9924493,0.0030895364,0.0016686162,0.0023685833,0.000015806827],"about_ca_topic_score_codex":0.0063290778,"about_ca_topic_score_gemma":0.005025008,"teacher_disagreement_score":0.0063290778,"about_ca_system_score_codex":0.0008291521,"about_ca_system_score_gemma":0.001731416,"threshold_uncertainty_score":0.012584507},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086868085,0.34268406,0.0320449,0.19644856,0.003065879,0.0011456932,0.0003711844,0.00021160365,0.3371601],"genre_scores_gemma":[0.70026726,0.22591722,0.03515514,0.017070495,0.004111436,0.0010665896,0.0005415078,0.00033432097,0.015535928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9521254,0.021512926,0.0014421215,0.0012261352,0.02225701,0.0014364403],"domain_scores_gemma":[0.9243455,0.043639537,0.0024849062,0.0019474978,0.025040673,0.0025419279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04459656,0.0009034911,0.0008972128,0.005244851,0.0025230544,0.010445772,0.0034035132,0.0055597974,0.0063490034],"category_scores_gemma":[0.047381368,0.00029457465,0.00061982893,0.008534045,0.0071539665,0.018810445,0.0023178635,0.0028463264,0.0008893039],"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.000737262,0.0008032027,0.0040178006,0.0032035494,0.000059167687,0.00023153491,0.0016107729,0.0069064153,0.001751991,0.58613604,0.020618988,0.37392318],"study_design_scores_gemma":[0.00028710172,0.0021602109,0.010518423,0.009454771,0.00013519936,0.00050510076,0.012315749,0.027851146,0.01076494,0.2021203,0.7236971,0.00018992306],"about_ca_topic_score_codex":0.011380953,"about_ca_topic_score_gemma":0.0045706374,"teacher_disagreement_score":0.04459656,"about_ca_system_score_codex":0.015585337,"about_ca_system_score_gemma":0.0075781527,"threshold_uncertainty_score":0.235852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18307294,0.00077109406,0.80716825,0.0002186586,0.00016727862,0.00020588204,0.000079629724,0.0013165082,0.0069997488],"genre_scores_gemma":[0.87878835,0.00021902376,0.11790564,0.00005971842,0.00003359882,0.00006627801,0.00009005397,0.00002036803,0.0028168473],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998585,0.00001886747,0.000009515975,0.000035529803,0.000059363272,0.000018146848],"domain_scores_gemma":[0.9997471,0.00006547253,0.000036510657,0.00005179412,0.00008255109,0.000016581349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019019087,0.00027775913,0.00031048912,0.00041180136,0.00036297468,0.0003200254,0.0009402233,0.00028567313,0.0010494546],"category_scores_gemma":[0.00048481394,0.000106858926,0.000194577,0.00036026342,0.0002898368,0.0006712119,0.0004388832,0.00038538518,0.00017901858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094600185,0.00029056508,0.0026302678,0.00030841917,0.000071189665,0.0006202529,0.0004424993,0.16123253,0.44261903,0.015106214,0.0029916328,0.37274143],"study_design_scores_gemma":[0.000084971856,0.00064873014,0.0013457977,0.000025214544,0.000058747926,0.00072124624,0.000101248006,0.84972686,0.13772556,0.0031844808,0.006332142,0.00004497646],"about_ca_topic_score_codex":0.00096028106,"about_ca_topic_score_gemma":0.001103621,"teacher_disagreement_score":0.0010494546,"about_ca_system_score_codex":0.00034707336,"about_ca_system_score_gemma":0.00035294966,"threshold_uncertainty_score":0.0035107732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122109644,0.00071497785,0.87176025,0.00030093984,0.00006743793,0.00012569397,0.00007783637,0.00041258615,0.004430713],"genre_scores_gemma":[0.8020683,0.00019920219,0.19544064,0.00008971102,0.00003554183,0.0002299767,0.00013059663,0.000059498438,0.0017464915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.00016099805,0.000011166072,0.000044989833,0.000054506225,0.00005221775],"domain_scores_gemma":[0.9992519,0.0005237458,0.000087428336,0.000023027129,0.00007075249,0.000043143922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008383747,0.0005947503,0.0009623772,0.00071022485,0.00040127634,0.0004654076,0.0010644901,0.0009935393,0.0012381538],"category_scores_gemma":[0.0017387659,0.00040966805,0.00051210757,0.0006755753,0.00045568714,0.0006515361,0.00052686414,0.0006004631,0.00011619148],"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.00003510153,0.000026585249,0.00020065675,0.000017281625,0.000012051306,0.00002655578,0.000012561575,0.9906941,0.00024006377,0.0013547891,0.00026785088,0.007112459],"study_design_scores_gemma":[0.0000074638383,0.000012348487,0.000026665917,0.0000014872159,0.0000020387647,0.0000035432458,0.000004404324,0.99949586,0.00004266996,0.00034201515,0.000060417813,0.0000010728862],"about_ca_topic_score_codex":0.009960188,"about_ca_topic_score_gemma":0.00915189,"teacher_disagreement_score":0.009960188,"about_ca_system_score_codex":0.00072737463,"about_ca_system_score_gemma":0.0012812128,"threshold_uncertainty_score":0.019804418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06050869,0.00040353206,0.9325815,0.00035167686,0.0004622831,0.00025055924,0.00007897456,0.0022870873,0.0030757552],"genre_scores_gemma":[0.89902425,0.00009580681,0.09809645,0.00018462862,0.00029027855,0.00013985416,0.00004816739,0.00011543753,0.002005093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655735,0.00085122546,0.00032364044,0.0005437547,0.0011999304,0.00052404037],"domain_scores_gemma":[0.9896702,0.0034213078,0.0006299088,0.0033442404,0.0022100213,0.00072426145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006477695,0.00062513514,0.0012321948,0.0014217416,0.002540236,0.0026314212,0.003723514,0.0012931192,0.0022665164],"category_scores_gemma":[0.010990249,0.000487242,0.00047139113,0.0010945831,0.0021094137,0.003089498,0.0031339598,0.0021926747,0.0004892633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036176103,0.00094564795,0.004697112,0.00036921338,0.00028891172,0.0007664326,0.001329378,0.2311196,0.10279009,0.26948312,0.009362392,0.3752304],"study_design_scores_gemma":[0.00017563903,0.00033598221,0.00041628483,0.000024255769,0.000115447416,0.00022814357,0.000073975745,0.9347507,0.017271945,0.041088656,0.0054158317,0.00010309621],"about_ca_topic_score_codex":0.0020240971,"about_ca_topic_score_gemma":0.0021324493,"teacher_disagreement_score":0.006477695,"about_ca_system_score_codex":0.0017696274,"about_ca_system_score_gemma":0.0023182991,"threshold_uncertainty_score":0.03425777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12472253,0.0005907478,0.87040234,0.0005783152,0.00013741752,0.000070931426,0.000012091063,0.0005987909,0.0028866811],"genre_scores_gemma":[0.9662849,0.00012368732,0.032943614,0.00008428374,0.000037582748,0.00003174034,0.0000067678593,0.000019800864,0.00046766462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.00035419635,0.000033127213,0.0001456351,0.00016693724,0.0000917624],"domain_scores_gemma":[0.9969637,0.0020641966,0.00029355555,0.00025225905,0.00029749898,0.00012882608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002419485,0.0005256051,0.0005061236,0.00030645632,0.0004850774,0.00072405115,0.0009963172,0.0007425751,0.00053842267],"category_scores_gemma":[0.008861165,0.00024215317,0.00028782059,0.00023456574,0.00087771827,0.0013842415,0.0010362482,0.0010108063,0.00009045541],"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.00023507387,0.00027033777,0.0028546893,0.00006966008,0.000066429115,0.00010882852,0.00013302501,0.88224375,0.0091000125,0.012611454,0.0006785482,0.09162828],"study_design_scores_gemma":[0.000014991827,0.000054872035,0.00019877515,0.0000038076864,0.000010923013,0.000015083652,0.0000067785936,0.993993,0.0015644197,0.0039023554,0.00022934015,0.000005599953],"about_ca_topic_score_codex":0.0019803066,"about_ca_topic_score_gemma":0.0013145368,"teacher_disagreement_score":0.002419485,"about_ca_system_score_codex":0.00062890863,"about_ca_system_score_gemma":0.0007724959,"threshold_uncertainty_score":0.012795627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69377947,0.000250461,0.30149585,0.00066997943,0.000050386712,0.00031705954,0.0014753893,0.0007303969,0.001231179],"genre_scores_gemma":[0.8132769,0.00013056152,0.18426087,0.000059996662,0.000030896776,0.00025092505,0.0011731351,0.00002098915,0.0007956887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.00022691044,0.00006253257,0.00014416747,0.00011844119,0.00005440317],"domain_scores_gemma":[0.9973416,0.0017839479,0.00020874661,0.00015285313,0.00038532025,0.00012754292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014686532,0.0005020495,0.0006776439,0.0029806925,0.0004230409,0.00087592454,0.0006900043,0.0008373624,0.0007833361],"category_scores_gemma":[0.004237416,0.00023737122,0.00096600666,0.0020637095,0.00019130869,0.00069144665,0.00043870712,0.00067686645,0.0002543719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044339118,0.0023944597,0.38921422,0.00021648135,0.0005200857,0.0003172679,0.000730394,0.11794894,0.0066032307,0.0016590889,0.0034250985,0.47652733],"study_design_scores_gemma":[0.000014282665,0.00010537339,0.0276414,0.000019337846,0.00004653273,0.0000790591,0.00022825973,0.96897876,0.0015082768,0.0006981231,0.00065808056,0.000022592629],"about_ca_topic_score_codex":0.0074321567,"about_ca_topic_score_gemma":0.0076587,"teacher_disagreement_score":0.0074321567,"about_ca_system_score_codex":0.00047983436,"about_ca_system_score_gemma":0.00079039263,"threshold_uncertainty_score":0.01477778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5820629,0.0017875656,0.40730533,0.0009374382,0.00015559467,0.000168851,0.00031172312,0.00067484577,0.0065957773],"genre_scores_gemma":[0.99346256,0.00025437848,0.005405881,0.000012974781,0.000020527235,0.000029587027,0.000052869673,0.00003791514,0.00072338193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992416,0.00031942836,0.0000409618,0.00011641743,0.00015553272,0.00012601215],"domain_scores_gemma":[0.99473286,0.0036967967,0.0003588288,0.00022619539,0.00085855194,0.00012677272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019911446,0.0010390185,0.0009480913,0.0008549039,0.0006868551,0.0015678178,0.0016936985,0.0013662077,0.0009167665],"category_scores_gemma":[0.008643099,0.00056575943,0.00066770986,0.0009556304,0.0011698673,0.0012707042,0.0005484327,0.0012970102,0.00013624053],"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.000033519897,0.000017562375,0.00047881017,0.000014586516,0.0000075933376,0.00002385683,0.000019693045,0.9955337,0.00044596763,0.0018893474,0.000096551164,0.0014387942],"study_design_scores_gemma":[0.0000011333415,0.0000037634281,0.000050852963,9.615334e-7,0.0000022514757,0.0000028766867,0.0000018815283,0.99963367,0.000091498594,0.00019181389,0.000017777185,0.0000015128226],"about_ca_topic_score_codex":0.0392224,"about_ca_topic_score_gemma":0.011086705,"teacher_disagreement_score":0.0392224,"about_ca_system_score_codex":0.0023678085,"about_ca_system_score_gemma":0.001494846,"threshold_uncertainty_score":0.07798821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0342652,0.0003279686,0.9639438,0.000087750486,0.000022870658,0.000045667675,0.000027353073,0.00019936779,0.0010800795],"genre_scores_gemma":[0.6356533,0.00033065793,0.362303,0.00011390772,0.000029961084,0.00011399118,0.00015439016,0.000043710435,0.0012571035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961096,0.00013584584,0.000022289998,0.00006813166,0.00011414976,0.000048702554],"domain_scores_gemma":[0.99950755,0.00021729094,0.00007045758,0.00006522788,0.00010085433,0.000038652473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061823183,0.00046210596,0.0004578607,0.00060549256,0.00051492197,0.00041410053,0.00080210424,0.0003887407,0.00059703056],"category_scores_gemma":[0.0010881796,0.00018038093,0.00030089307,0.00054881343,0.0003040162,0.000702938,0.00067589537,0.00041172383,0.0001141226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004004825,0.00018301638,0.0031617014,0.00025550305,0.000084253916,0.00025420554,0.00041039375,0.34950152,0.09704973,0.058553185,0.0040667965,0.4860792],"study_design_scores_gemma":[0.00002903315,0.00018328633,0.0003600866,0.000010084191,0.000029896284,0.00020045927,0.00006613043,0.9673954,0.013892972,0.0139640635,0.0038509383,0.000017558834],"about_ca_topic_score_codex":0.0006485287,"about_ca_topic_score_gemma":0.001030188,"teacher_disagreement_score":0.00080210424,"about_ca_system_score_codex":0.0004712348,"about_ca_system_score_gemma":0.00056420825,"threshold_uncertainty_score":0.0034190416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45756692,0.0005819988,0.5107692,0.001067402,0.00009907666,0.00006970981,0.00012992455,0.00012518826,0.029590558],"genre_scores_gemma":[0.9910136,0.00017171662,0.0046240557,0.000033133714,0.000023562528,0.00004790135,0.000028012753,0.000007719864,0.004050409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982953,0.000041772837,0.000009550046,0.000039567763,0.000039497525,0.00004014352],"domain_scores_gemma":[0.99980813,0.00005726179,0.00006473925,0.0000107098185,0.00002658777,0.000032580705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031407064,0.00053340016,0.00053940556,0.0006726172,0.0004918932,0.00096557237,0.0006735788,0.0010699389,0.0016798403],"category_scores_gemma":[0.0008221427,0.00018780942,0.00040692944,0.0003234951,0.001166408,0.0009215591,0.0009906244,0.00056327495,0.0001308525],"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.000078564146,0.000077642035,0.0013844799,0.000068531925,0.0000467275,0.00046960358,0.00033748412,0.6354995,0.0043434836,0.35116535,0.0007930666,0.0057355943],"study_design_scores_gemma":[0.000014957714,0.000038580663,0.0002448771,0.0000067655365,0.000010149418,0.000028262066,0.000039576713,0.9610236,0.00031521928,0.037735928,0.0005322748,0.00000970926],"about_ca_topic_score_codex":0.005150365,"about_ca_topic_score_gemma":0.0018521476,"teacher_disagreement_score":0.005150365,"about_ca_system_score_codex":0.0007834421,"about_ca_system_score_gemma":0.00058476557,"threshold_uncertainty_score":0.010240793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01897354,0.00093026564,0.9679726,0.0006241685,0.000090566245,0.0001599723,0.00022077924,0.00020762139,0.010820486],"genre_scores_gemma":[0.7582303,0.0014103913,0.22463451,0.000251245,0.00011646798,0.00077991263,0.00061312714,0.00012246805,0.013841464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.0005592311,0.00003039607,0.00012379671,0.00021850344,0.00015064987],"domain_scores_gemma":[0.99750996,0.0018524048,0.0001731668,0.00003691082,0.00031569166,0.000111847556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121323,0.0010266316,0.0014955215,0.0010272783,0.0006425655,0.0013966683,0.0009772396,0.00104223,0.003747985],"category_scores_gemma":[0.0034931076,0.0008247768,0.0008229523,0.0012352731,0.0011074418,0.0008035696,0.000969025,0.0010254078,0.00031771924],"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.000009749366,0.000004617007,0.00006367118,0.000011827508,0.0000058269443,0.000014985061,0.0000044101985,0.9935463,0.000040670584,0.004473086,0.00022564761,0.0015991483],"study_design_scores_gemma":[0.000003916074,0.0000044210533,0.000020404665,0.0000023783698,0.0000015223786,0.0000015870639,0.0000026015798,0.9977933,0.000018371038,0.00195469,0.0001949867,0.0000017395597],"about_ca_topic_score_codex":0.02699713,"about_ca_topic_score_gemma":0.019863537,"teacher_disagreement_score":0.02699713,"about_ca_system_score_codex":0.0027706982,"about_ca_system_score_gemma":0.0033081498,"threshold_uncertainty_score":0.053679943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30798098,0.0060027367,0.66148764,0.001122365,0.00031058415,0.00024944334,0.0010145188,0.0015615723,0.020270089],"genre_scores_gemma":[0.98962295,0.0013096177,0.006613322,0.000054286305,0.00007671953,0.000063327396,0.00026757095,0.00004638914,0.0019459536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848527,0.00032706952,0.00004863022,0.00022175653,0.00068820344,0.00022907442],"domain_scores_gemma":[0.9983553,0.0008268411,0.00023141081,0.00015464507,0.00038581254,0.000046001547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360364,0.00065661274,0.0007242523,0.0013630905,0.000417072,0.0009222412,0.00071869453,0.0004345545,0.0012479306],"category_scores_gemma":[0.004040648,0.0002388009,0.0010898614,0.0010031401,0.00043001174,0.0009869256,0.00046456765,0.00080438936,0.00023382105],"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.00011191367,0.000063674364,0.0021519898,0.000109383356,0.00006707074,0.00015342062,0.00010318293,0.9515091,0.008165326,0.021529404,0.0011984626,0.014837059],"study_design_scores_gemma":[0.0000025243273,0.000045362623,0.00079118187,0.000008205445,0.000011423792,0.000041280415,0.000011144506,0.99500954,0.001041314,0.0025388168,0.000489181,0.00001005497],"about_ca_topic_score_codex":0.0076759686,"about_ca_topic_score_gemma":0.002353309,"teacher_disagreement_score":0.0076759686,"about_ca_system_score_codex":0.0022554004,"about_ca_system_score_gemma":0.0010871559,"threshold_uncertainty_score":0.016364098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37438515,0.0004105758,0.62135005,0.00023853533,0.00007780478,0.00007296428,0.000042192212,0.0016860695,0.0017366183],"genre_scores_gemma":[0.98275894,0.000058249134,0.01675591,0.000017145672,0.00000974902,0.000016324513,0.000016012464,0.000012923449,0.00035481137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995378,0.00013765483,0.000027834301,0.00010605305,0.00013741951,0.000053165448],"domain_scores_gemma":[0.9977992,0.0011977603,0.0003337754,0.0002511624,0.000319732,0.000098320874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006645,0.0004181311,0.0003951747,0.00027287327,0.00039926276,0.00054654316,0.0010849216,0.00036984956,0.00044593628],"category_scores_gemma":[0.0029866404,0.00015533033,0.00012430914,0.00020618289,0.0004585736,0.0009112873,0.00040682743,0.00051778596,0.00007443937],"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.0005268435,0.00028700856,0.0054014097,0.00008838383,0.000046085406,0.00020738189,0.0001281698,0.8166752,0.049380064,0.0034919267,0.00090777857,0.122859806],"study_design_scores_gemma":[0.000008278816,0.000059853548,0.00035078675,0.000001589261,0.0000049607015,0.00002066967,0.000011607557,0.9937769,0.0049443725,0.0007212608,0.00009528082,0.0000044898643],"about_ca_topic_score_codex":0.0024884604,"about_ca_topic_score_gemma":0.0026702986,"teacher_disagreement_score":0.0024884604,"about_ca_system_score_codex":0.0004886432,"about_ca_system_score_gemma":0.0006435212,"threshold_uncertainty_score":0.005323708},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34710872,0.017406028,0.007230064,0.022859514,0.0018337875,0.00038033014,0.0021419406,0.0006679183,0.6003717],"genre_scores_gemma":[0.89640534,0.00947818,0.005971602,0.0010429503,0.0007469427,0.00024440268,0.00084225775,0.00024346098,0.08502484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974317,0.0011312964,0.000089237445,0.00036405958,0.0004883525,0.0004953763],"domain_scores_gemma":[0.997421,0.0010489764,0.0003952543,0.0002732645,0.00054316013,0.00031841095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025194401,0.0005757627,0.0004965471,0.0033276188,0.0058503323,0.008311946,0.0012979815,0.0017399058,0.016846636],"category_scores_gemma":[0.0069291685,0.00036465802,0.00062892423,0.0065748026,0.002665708,0.005074964,0.004689662,0.0025551636,0.0021502238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021639593,0.0003287391,0.05128964,0.0015463092,0.000089589106,0.005959012,0.10745992,0.0010267686,0.001587443,0.5132307,0.05792496,0.25934052],"study_design_scores_gemma":[0.00001641624,0.00005904233,0.021075334,0.00073160976,0.00004396856,0.0010481265,0.06281434,0.0007215018,0.0006141266,0.010135169,0.9027049,0.00003543717],"about_ca_topic_score_codex":0.053699594,"about_ca_topic_score_gemma":0.06389194,"teacher_disagreement_score":0.053699594,"about_ca_system_score_codex":0.007261193,"about_ca_system_score_gemma":0.0039226688,"threshold_uncertainty_score":0.10677403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059419605,0.00021644044,0.9930549,0.000057746376,0.000015668862,0.000028787448,0.00003690939,0.00031159754,0.00033598117],"genre_scores_gemma":[0.51293486,0.0011212071,0.4826965,0.00018935821,0.00013311775,0.00026245168,0.00072765094,0.00033436003,0.0016003597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847835,0.0007241138,0.00007996331,0.0002766795,0.00031019546,0.00013067646],"domain_scores_gemma":[0.9941186,0.004108025,0.0004760214,0.0004552858,0.0007120523,0.00013008503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029874328,0.0011530333,0.0013866343,0.0013478518,0.00049383374,0.0010314971,0.0015316622,0.00091549,0.0016382501],"category_scores_gemma":[0.015107219,0.0006949618,0.0011869214,0.0012955131,0.00056682574,0.001915074,0.001331892,0.0019775408,0.0006314733],"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.00012257391,0.000112086185,0.0046598804,0.00018702199,0.00019491864,0.00019955166,0.00015294875,0.8286928,0.004551548,0.025617672,0.0031226922,0.13238624],"study_design_scores_gemma":[0.000002177598,0.0000057531397,0.00015861668,0.0000029142648,0.0000053940494,0.000018746083,0.0000042068073,0.9970847,0.0003166571,0.002229066,0.00016646174,0.0000053143435],"about_ca_topic_score_codex":0.007013144,"about_ca_topic_score_gemma":0.0032050263,"teacher_disagreement_score":0.007013144,"about_ca_system_score_codex":0.0008214086,"about_ca_system_score_gemma":0.001363426,"threshold_uncertainty_score":0.015799224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6679468,0.020762336,0.15666102,0.013248712,0.0024910169,0.0020039242,0.0037041325,0.00073782075,0.13244425],"genre_scores_gemma":[0.97301745,0.0045091365,0.017900014,0.0005573425,0.00026234786,0.0004854774,0.00070654537,0.00010805566,0.0024537551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96012825,0.021690361,0.0012429218,0.0016743494,0.012740768,0.002523342],"domain_scores_gemma":[0.8665163,0.09287341,0.0093533015,0.009443001,0.020355696,0.0014583007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03726249,0.0016027129,0.001040654,0.0024272315,0.0011132716,0.004540528,0.0016910584,0.0019217574,0.0032267203],"category_scores_gemma":[0.09110431,0.00048893556,0.00091533415,0.002162716,0.0022051078,0.0054234313,0.0015761085,0.003482031,0.0006066582],"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.003039493,0.004668661,0.059010874,0.0034778852,0.0016994693,0.00042030873,0.000553376,0.43480745,0.020101853,0.20627588,0.016402125,0.24954267],"study_design_scores_gemma":[0.00029452998,0.00805196,0.056464914,0.001776422,0.0017520529,0.00024952253,0.0034386823,0.6977296,0.051594578,0.139886,0.038514473,0.00024727813],"about_ca_topic_score_codex":0.006048683,"about_ca_topic_score_gemma":0.0037426495,"teacher_disagreement_score":0.03726249,"about_ca_system_score_codex":0.006261999,"about_ca_system_score_gemma":0.0071471967,"threshold_uncertainty_score":0.19706523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39451608,0.00038397004,0.59321445,0.0005654222,0.00016369678,0.000111672925,0.00007907386,0.0016076539,0.009357932],"genre_scores_gemma":[0.98033065,0.000037652928,0.01862395,0.000036780064,0.000038847822,0.000019516578,0.000014080328,0.000022759728,0.000875785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983438,0.0006233914,0.00005541896,0.0002231749,0.0003835636,0.00037059092],"domain_scores_gemma":[0.99784946,0.0009297107,0.00025030246,0.0003497438,0.00047216876,0.00014865414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024296422,0.00034349333,0.00061054167,0.0005869284,0.0011606335,0.0014467473,0.0012171239,0.0009487646,0.0014816787],"category_scores_gemma":[0.0036872432,0.0002679788,0.00028691615,0.00040525125,0.0008382146,0.0016113344,0.0015486446,0.00086490286,0.0001998501],"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.0029163398,0.0007357555,0.008200974,0.00022891563,0.00015198588,0.0016881506,0.00089299586,0.30669117,0.15518117,0.2965954,0.006812649,0.21990459],"study_design_scores_gemma":[0.00004945582,0.0002180533,0.000602167,0.000008317289,0.000028346027,0.00026793504,0.000057475172,0.97119844,0.0090384595,0.017309453,0.0011923225,0.000029582327],"about_ca_topic_score_codex":0.0013185134,"about_ca_topic_score_gemma":0.0012680467,"teacher_disagreement_score":0.0024296422,"about_ca_system_score_codex":0.0006114475,"about_ca_system_score_gemma":0.000995073,"threshold_uncertainty_score":0.0128493905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07087867,0.00020496701,0.9229994,0.00022433062,0.00012361581,0.00005044083,0.0000258176,0.00027253054,0.005220198],"genre_scores_gemma":[0.98717517,0.00008949122,0.009915464,0.00004271666,0.000024881145,0.000053790653,0.000019840385,0.000014961789,0.002663647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.00011686244,0.000021196549,0.000081035134,0.00015513874,0.000064371045],"domain_scores_gemma":[0.99888426,0.0004992097,0.00012414846,0.00007404057,0.00037996162,0.00003828783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092653435,0.0007424895,0.00065591664,0.00036342442,0.00040515797,0.0007753426,0.0006988345,0.0010516654,0.0012731998],"category_scores_gemma":[0.003685403,0.0002583269,0.00040923088,0.00037661812,0.00083421025,0.00056643604,0.0011464233,0.001009095,0.00015229725],"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.0001847144,0.00007026911,0.00031755812,0.00014251069,0.000029883837,0.00012686409,0.00013887398,0.9430674,0.009131565,0.015071982,0.00077661156,0.030941837],"study_design_scores_gemma":[0.000010537182,0.000052522817,0.000079357786,0.0000024789363,0.000004289427,0.0000064835535,0.0000058578826,0.9978124,0.00064391654,0.0012598914,0.00011785614,0.0000043772043],"about_ca_topic_score_codex":0.007928934,"about_ca_topic_score_gemma":0.0028966418,"teacher_disagreement_score":0.007928934,"about_ca_system_score_codex":0.00075847557,"about_ca_system_score_gemma":0.0009808976,"threshold_uncertainty_score":0.015765548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047921825,0.00019909583,0.94808066,0.00023647293,0.00008103548,0.00010816551,0.00010849694,0.00040893516,0.0028553952],"genre_scores_gemma":[0.6975444,0.0002282501,0.29711184,0.00015308706,0.00006896333,0.00019265637,0.00020075437,0.00012949876,0.0043706424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813277,0.00063381944,0.0000708533,0.00036679677,0.00042887533,0.0003670109],"domain_scores_gemma":[0.9962858,0.002144508,0.0005174178,0.00039720902,0.00048502808,0.00017000256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029763777,0.0010661631,0.0012278114,0.0007317704,0.00081324717,0.0014018454,0.0019369638,0.00089925196,0.0013832907],"category_scores_gemma":[0.00705061,0.0005060534,0.00075990625,0.00080307474,0.0011096954,0.0027181196,0.0012826127,0.0014510432,0.00016043012],"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.00009709183,0.00008602098,0.0003638394,0.00004559773,0.000029952273,0.000086448126,0.000051750172,0.93390936,0.0014074689,0.0434639,0.000964537,0.019494042],"study_design_scores_gemma":[0.000020298541,0.000049302012,0.000059286445,0.00000363134,0.000010390781,0.000023986739,0.000009987914,0.975966,0.00078913994,0.022492912,0.00056621694,0.000008865882],"about_ca_topic_score_codex":0.0037577425,"about_ca_topic_score_gemma":0.0039801938,"teacher_disagreement_score":0.0037577425,"about_ca_system_score_codex":0.0018135468,"about_ca_system_score_gemma":0.0027760721,"threshold_uncertainty_score":0.015740752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96066725,0.0015275008,0.030924182,0.00015264959,0.00012284928,0.00013148932,0.00013307684,0.0013140929,0.0050268653],"genre_scores_gemma":[0.99383235,0.00019240801,0.005346345,0.000022857439,0.000024431718,0.000021727492,0.00009901067,0.000039031052,0.0004219032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579924,0.0015138729,0.000312279,0.00038063404,0.0015068833,0.00048697047],"domain_scores_gemma":[0.9874572,0.007626439,0.00088963733,0.0010748784,0.002483794,0.00046805633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004775961,0.0008230496,0.0006929275,0.00065723166,0.000550615,0.000971546,0.0011523914,0.00055073574,0.00085354043],"category_scores_gemma":[0.014313949,0.00022728962,0.00015725757,0.0008343832,0.00066562905,0.001847397,0.00086802023,0.0006934604,0.00013573586],"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.00792403,0.0018315262,0.031216191,0.0013707918,0.0003684299,0.0006158682,0.00073029805,0.57671565,0.11657927,0.005837447,0.004103183,0.25270742],"study_design_scores_gemma":[0.00013303466,0.0031940376,0.009573006,0.000043411324,0.00010446112,0.0002737974,0.0001091551,0.941335,0.043434974,0.0005363147,0.0012043214,0.000058460064],"about_ca_topic_score_codex":0.0038909803,"about_ca_topic_score_gemma":0.0018021901,"teacher_disagreement_score":0.004775961,"about_ca_system_score_codex":0.0009681494,"about_ca_system_score_gemma":0.0006481116,"threshold_uncertainty_score":0.025257945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10979785,0.0002588497,0.8874892,0.0001425398,0.000035005814,0.00004760672,0.000028551247,0.00025176798,0.0019486812],"genre_scores_gemma":[0.8709809,0.00010731058,0.12775744,0.000042940956,0.000019068497,0.000047850222,0.000057653357,0.00002602038,0.00096076616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996878,0.00010176999,0.000018890569,0.000056887842,0.000075450225,0.00005914678],"domain_scores_gemma":[0.9994222,0.00018447672,0.000092600996,0.00011662584,0.00012558594,0.00005858217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152897,0.00026198718,0.00033698414,0.0005111283,0.00047164978,0.0004057716,0.00067349983,0.00028872836,0.0005655314],"category_scores_gemma":[0.00094512955,0.00013941695,0.00023969372,0.00039301938,0.00031096456,0.00046351113,0.00054205867,0.00037292982,0.000103010534],"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.00027933318,0.00013541398,0.0028438016,0.00009208111,0.000054475302,0.00019952821,0.0002297916,0.5795754,0.09647596,0.053695146,0.0025558674,0.26386324],"study_design_scores_gemma":[0.00000922251,0.00006057988,0.00040828,0.0000029852322,0.000011538334,0.00007678139,0.000032148,0.98581856,0.0060513774,0.0060010958,0.001517348,0.000010023875],"about_ca_topic_score_codex":0.0010757436,"about_ca_topic_score_gemma":0.0014299327,"teacher_disagreement_score":0.0010757436,"about_ca_system_score_codex":0.000520752,"about_ca_system_score_gemma":0.0005984762,"threshold_uncertainty_score":0.0037783384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1051699,0.0010634954,0.88572544,0.00035929942,0.0006332399,0.00030569546,0.00009844682,0.002708442,0.003936039],"genre_scores_gemma":[0.9567494,0.00014948337,0.041342348,0.0000929727,0.00008611436,0.00007925446,0.00008580024,0.00004034783,0.001374343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987583,0.00027509406,0.000116493924,0.00023432919,0.00041473957,0.00020110425],"domain_scores_gemma":[0.99700433,0.001076287,0.00019033575,0.000324945,0.0012077092,0.00019650036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024186475,0.00079620816,0.0013600237,0.0014415181,0.001228442,0.0016570402,0.0026483121,0.0005704114,0.00152177],"category_scores_gemma":[0.0040399577,0.00032906863,0.00032559907,0.0006351773,0.00086488796,0.0017742249,0.0016575822,0.0015678499,0.00017783788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004233329,0.0018687742,0.009264872,0.0006024457,0.0004174138,0.0005799269,0.00074011966,0.18457776,0.11196465,0.13233262,0.015465563,0.53795254],"study_design_scores_gemma":[0.00013952235,0.0002689972,0.0006280818,0.000012285575,0.000104602215,0.00010601241,0.000033480035,0.9804174,0.011832643,0.005322831,0.0010746596,0.000059420407],"about_ca_topic_score_codex":0.0034487774,"about_ca_topic_score_gemma":0.0054862974,"teacher_disagreement_score":0.0034487774,"about_ca_system_score_codex":0.0011949285,"about_ca_system_score_gemma":0.0025457453,"threshold_uncertainty_score":0.012791216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03124755,0.00043463637,0.96644986,0.00013268713,0.00006057319,0.000053172043,0.0000095511505,0.0003304383,0.0012815245],"genre_scores_gemma":[0.87231416,0.00022446107,0.12616819,0.000060037884,0.000056878183,0.000054967273,0.000013817881,0.000048696358,0.0010587538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991742,0.00029779456,0.00003274983,0.00011587747,0.0002833514,0.000095993266],"domain_scores_gemma":[0.99900216,0.00058630283,0.000104117,0.00011523152,0.00014802386,0.00004415269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018826223,0.000462069,0.00062089256,0.0007311302,0.00066702644,0.00079010084,0.0015449343,0.00058532454,0.0010735599],"category_scores_gemma":[0.004069032,0.00024948455,0.00036632826,0.00058483187,0.00091656303,0.0014609228,0.0006723765,0.00072993315,0.00015015363],"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.00035714763,0.00018882274,0.0009511937,0.000077355064,0.00005151145,0.0001294573,0.0001354476,0.74942374,0.025103241,0.037769187,0.0015060273,0.18430679],"study_design_scores_gemma":[0.000012777343,0.000042370917,0.000118060874,0.0000023921732,0.000008737547,0.000031518004,0.000007347178,0.9901342,0.0024755981,0.0066579776,0.0004981867,0.0000108854465],"about_ca_topic_score_codex":0.00301905,"about_ca_topic_score_gemma":0.0031576606,"teacher_disagreement_score":0.00301905,"about_ca_system_score_codex":0.0015280464,"about_ca_system_score_gemma":0.00093420973,"threshold_uncertainty_score":0.011086762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067165144,0.00027765307,0.90555733,0.0003316748,0.00047348812,0.0008144568,0.00036401738,0.013083585,0.011932615],"genre_scores_gemma":[0.60458624,0.00037005625,0.38564494,0.00037687644,0.00008177796,0.00060727575,0.0010328873,0.0005042996,0.006795656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.00022105349,0.00013823823,0.00015865998,0.0005939497,0.00016348452],"domain_scores_gemma":[0.9984707,0.0002920964,0.00010430823,0.0002672907,0.0007873902,0.00007822956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018428154,0.00063390884,0.00037228852,0.0005062326,0.00075472635,0.0013529274,0.0026112203,0.0006411707,0.0027359321],"category_scores_gemma":[0.0032047841,0.00030514578,0.0003719564,0.00037277627,0.0004151357,0.0009915314,0.00050351815,0.0014296528,0.00067131623],"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.0014791316,0.0011802538,0.009274922,0.0007837665,0.00022941642,0.00059620634,0.0010660255,0.39481434,0.12638065,0.057192724,0.015809283,0.39119327],"study_design_scores_gemma":[0.0000991662,0.00028337896,0.00094928255,0.00003463005,0.000035561738,0.00017895203,0.000050861094,0.9125302,0.06344947,0.0032662693,0.019069983,0.000052251486],"about_ca_topic_score_codex":0.008734094,"about_ca_topic_score_gemma":0.0046059615,"teacher_disagreement_score":0.008734094,"about_ca_system_score_codex":0.0015114688,"about_ca_system_score_gemma":0.0030323176,"threshold_uncertainty_score":0.017366529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009971749,0.00040155117,0.9876935,0.000104762374,0.00004926328,0.00005102663,0.00001598271,0.00016144707,0.0015507131],"genre_scores_gemma":[0.41105598,0.0004942436,0.5853026,0.00019999874,0.000068596906,0.00014890083,0.00008770959,0.00005059558,0.0025912954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.00013248455,0.000021890337,0.000072542876,0.00015574138,0.000052739237],"domain_scores_gemma":[0.9996902,0.000085775166,0.000035022676,0.000054835673,0.000107434724,0.000026720898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059735356,0.00040587626,0.00048707324,0.00062960107,0.00070994033,0.0004658192,0.001205197,0.00055628474,0.00086488057],"category_scores_gemma":[0.000725835,0.0001724426,0.0004228405,0.0005405683,0.00025145948,0.0007842686,0.0008049127,0.0007498422,0.0001546803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029869663,0.00024348957,0.0010475094,0.00041302887,0.00015003934,0.00032127203,0.0003653936,0.30034992,0.08590482,0.1171917,0.0050940644,0.48862],"study_design_scores_gemma":[0.000026072217,0.00021471235,0.00022961272,0.00002283844,0.00003199285,0.00028951978,0.000048698308,0.9573784,0.012078631,0.021539852,0.008122033,0.000017575854],"about_ca_topic_score_codex":0.00071675336,"about_ca_topic_score_gemma":0.0011891111,"teacher_disagreement_score":0.001205197,"about_ca_system_score_codex":0.0005981019,"about_ca_system_score_gemma":0.0006862705,"threshold_uncertainty_score":0.004339576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12818404,0.0007497098,0.80042875,0.0013508754,0.00034249222,0.00014039574,0.00038086987,0.00027312292,0.068149716],"genre_scores_gemma":[0.92273927,0.00062573917,0.04890325,0.0001910456,0.00022137091,0.0003850801,0.00022708658,0.000068443434,0.026638761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996463,0.00009559561,0.000016930273,0.00009282613,0.000093382936,0.00005488527],"domain_scores_gemma":[0.99970347,0.000065282875,0.000068792855,0.00003060094,0.00009161867,0.000040153733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048922555,0.00058287027,0.00069319806,0.0008237322,0.00086568075,0.0012747056,0.0013023801,0.0015929791,0.0049027293],"category_scores_gemma":[0.00093221845,0.00023169989,0.0006055771,0.00047612222,0.0013992632,0.0015887279,0.0010146633,0.00087837083,0.00065997493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051477477,0.00004226458,0.00040976994,0.000050258586,0.000022360018,0.0002578306,0.00017291614,0.21005252,0.006415889,0.7761721,0.0016915655,0.0046609747],"study_design_scores_gemma":[0.00003215252,0.000059493337,0.00023819065,0.000010514546,0.000011788981,0.00007457526,0.000045297238,0.9167136,0.00052100245,0.0793689,0.0029050985,0.00001927372],"about_ca_topic_score_codex":0.0027381007,"about_ca_topic_score_gemma":0.0011293181,"teacher_disagreement_score":0.0049027293,"about_ca_system_score_codex":0.0012116353,"about_ca_system_score_gemma":0.00077494705,"threshold_uncertainty_score":0.016401231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20357725,0.0014969156,0.7324253,0.0029655087,0.00014076376,0.00021358993,0.00058519543,0.0012060762,0.05738944],"genre_scores_gemma":[0.9624928,0.0013377059,0.024961347,0.00036285282,0.00013598094,0.0001702247,0.00022761861,0.0001707261,0.0101407925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989945,0.00018980267,0.000030551695,0.00022140967,0.00024833294,0.0003153653],"domain_scores_gemma":[0.9978816,0.00076510693,0.00027313372,0.00027274073,0.0005362658,0.0002712075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337159,0.00089507556,0.0010393491,0.0013537148,0.0011826308,0.0021471013,0.0014897812,0.0017520915,0.0052727764],"category_scores_gemma":[0.010621464,0.0004101471,0.00076779455,0.0016892047,0.0025816446,0.0025818313,0.002042793,0.0022827792,0.0013478211],"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.0000986644,0.000030315756,0.0005114218,0.00010073433,0.000012723517,0.00019553276,0.00032339917,0.13868307,0.0045170775,0.8372989,0.002470406,0.015757713],"study_design_scores_gemma":[0.000032585674,0.0000667762,0.00055171974,0.000049919003,0.000012693904,0.0003254858,0.00013615994,0.67322034,0.0013146244,0.31333205,0.0109201865,0.0000375022],"about_ca_topic_score_codex":0.0059810015,"about_ca_topic_score_gemma":0.0011734142,"teacher_disagreement_score":0.0059810015,"about_ca_system_score_codex":0.0038953074,"about_ca_system_score_gemma":0.0017235548,"threshold_uncertainty_score":0.028262615},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.520985,0.001709118,0.3906265,0.0009907245,0.000090834954,0.00032098574,0.000090936366,0.00032300755,0.08486281],"genre_scores_gemma":[0.9374596,0.0007324384,0.056384187,0.000106219755,0.00003322405,0.00007206901,0.000054387154,0.000025258221,0.0051325792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990345,0.00038743418,0.000028105625,0.00008117213,0.00032152154,0.0001471898],"domain_scores_gemma":[0.99775594,0.0011679885,0.00021191192,0.0003516789,0.00045073254,0.00006164371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012519045,0.00024977824,0.00027662405,0.000564119,0.0007075894,0.00095410924,0.00064010127,0.000522414,0.0023547716],"category_scores_gemma":[0.003490758,0.00012378277,0.00033675498,0.00047185193,0.00056239223,0.0020173658,0.00050642155,0.00055871287,0.00019124705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003836106,0.00034521444,0.00815706,0.00024711867,0.000054364056,0.00037120227,0.0010014938,0.09361076,0.07318487,0.61941355,0.002135251,0.2010956],"study_design_scores_gemma":[0.00004271412,0.0004745289,0.003961378,0.000087985114,0.00004858634,0.000698844,0.00055994815,0.81439483,0.058488026,0.099517845,0.021671375,0.000053995398],"about_ca_topic_score_codex":0.0011563766,"about_ca_topic_score_gemma":0.0009428289,"teacher_disagreement_score":0.0023547716,"about_ca_system_score_codex":0.0014296583,"about_ca_system_score_gemma":0.0005768588,"threshold_uncertainty_score":0.010372996},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91418946,0.0007497391,0.0772221,0.00034696845,0.000058819733,0.00002163597,0.00003294988,0.0002949227,0.007083399],"genre_scores_gemma":[0.9964966,0.00007206878,0.0019159956,0.000011047301,0.000009528057,0.0000053033946,0.000011982061,0.000009996407,0.0014675107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998222,0.000049694037,0.000009782248,0.000028986746,0.00005573988,0.000033608252],"domain_scores_gemma":[0.9993254,0.00035152803,0.00008586334,0.000035086636,0.00015924004,0.00004280716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096348,0.00014350418,0.000121662015,0.0004116693,0.00021079944,0.0006957488,0.00029446514,0.00023315697,0.0012332604],"category_scores_gemma":[0.0026268149,0.00011578059,0.00005809592,0.00026887274,0.00032448443,0.00047761522,0.000204312,0.00029386973,0.00012529163],"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.0025706436,0.0004128797,0.012670316,0.00012779297,0.000051754647,0.0002457434,0.00085426006,0.5035362,0.1497509,0.052217405,0.0034215304,0.27414063],"study_design_scores_gemma":[0.000041607746,0.00015027041,0.0027269258,0.000011761415,0.000015219269,0.00005763803,0.0000798946,0.97559386,0.013000754,0.0070722103,0.0012371568,0.000012630063],"about_ca_topic_score_codex":0.0036985592,"about_ca_topic_score_gemma":0.0034233576,"teacher_disagreement_score":0.0036985592,"about_ca_system_score_codex":0.0010078432,"about_ca_system_score_gemma":0.00028607843,"threshold_uncertainty_score":0.0073540807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983969,0.00018192854,0.0032131122,0.00007701503,0.000010594814,0.0000431981,0.0035225032,0.00015629796,0.008826445],"genre_scores_gemma":[0.9939785,0.00024747656,0.0018161928,0.000020342031,0.0000065353724,0.000040757946,0.003154693,0.000017450478,0.0007182064],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996326,0.00009577746,0.000052926083,0.00006242869,0.000097543445,0.000058645433],"domain_scores_gemma":[0.99770504,0.00047287004,0.0007114513,0.0001935031,0.00081759994,0.00009958378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082966784,0.00037171997,0.00023855103,0.0025219638,0.00023069824,0.00088222546,0.00022547483,0.00020214834,0.0007710154],"category_scores_gemma":[0.00189606,0.00010351845,0.00036316016,0.0034813923,0.00016843773,0.0008605775,0.00042975644,0.0003352293,0.00035099746],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026083563,0.00018246638,0.8989722,0.0002665843,0.00024585403,0.00093338004,0.0011097769,0.035368077,0.006689034,0.002107217,0.0031306741,0.05073394],"study_design_scores_gemma":[0.000007122728,0.00022064196,0.93162173,0.000056899156,0.00011432856,0.0004958,0.0028962337,0.05222217,0.006914926,0.00058926747,0.004818979,0.000041759766],"about_ca_topic_score_codex":0.006832725,"about_ca_topic_score_gemma":0.004163335,"teacher_disagreement_score":0.006832725,"about_ca_system_score_codex":0.00037260787,"about_ca_system_score_gemma":0.0002725036,"threshold_uncertainty_score":0.013585925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012886392,0.00040853082,0.9847388,0.0001293346,0.000047150235,0.000051190083,0.000022014376,0.00019956415,0.0015169065],"genre_scores_gemma":[0.58751726,0.00048227128,0.4090624,0.00021683982,0.00007772818,0.00013670218,0.00012675383,0.00007133162,0.0023087664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.0001915283,0.000024377976,0.00009019004,0.00020690277,0.000078496916],"domain_scores_gemma":[0.9995401,0.00015059733,0.00005564848,0.00008627253,0.00012624684,0.000041089865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074881106,0.00041597467,0.00051342597,0.0006689946,0.00068033615,0.0004914236,0.0013844498,0.0005357208,0.0008364788],"category_scores_gemma":[0.0010904175,0.00017852764,0.00038277727,0.0005838575,0.00028372073,0.0008367136,0.0008855045,0.00072550785,0.00012774469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003168319,0.0002408106,0.0011891252,0.00030788893,0.00014471906,0.00026619915,0.00030124065,0.40294513,0.076462395,0.102889985,0.0054325266,0.4095032],"study_design_scores_gemma":[0.0000212326,0.00018302782,0.000230562,0.000015268857,0.000026977068,0.00020117994,0.000043055577,0.96687704,0.008806538,0.017161569,0.0064176368,0.000015808595],"about_ca_topic_score_codex":0.0009012046,"about_ca_topic_score_gemma":0.0014228075,"teacher_disagreement_score":0.0013844498,"about_ca_system_score_codex":0.0007099427,"about_ca_system_score_gemma":0.0007986637,"threshold_uncertainty_score":0.005150974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066460915,0.0055638882,0.90598094,0.003060073,0.0006422663,0.00017551979,0.00024993258,0.00032092372,0.01754562],"genre_scores_gemma":[0.8615174,0.0015778224,0.13127102,0.0009578167,0.0013015304,0.0003673028,0.00016050901,0.00028275204,0.0025638568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9684244,0.0148118045,0.0019482101,0.0043625142,0.008223245,0.0022298219],"domain_scores_gemma":[0.87811613,0.09070869,0.00880474,0.0111265415,0.008411683,0.0028323706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03066925,0.002020491,0.002882809,0.005690654,0.0023990886,0.0065431665,0.0028846532,0.0032666137,0.0019112652],"category_scores_gemma":[0.105469406,0.00056478585,0.0015151752,0.0046684095,0.011415078,0.015219407,0.005009614,0.005062166,0.00047873944],"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.0003544048,0.00017389393,0.01002373,0.00020868784,0.00027109223,0.0001982763,0.0010038806,0.08872499,0.003497898,0.84625906,0.002064182,0.047219962],"study_design_scores_gemma":[0.000040566545,0.0005534554,0.006206276,0.00022186413,0.00012104432,0.00037447305,0.00035776864,0.23151544,0.0037303928,0.7498267,0.0068429224,0.00020909957],"about_ca_topic_score_codex":0.0032779968,"about_ca_topic_score_gemma":0.0014720809,"teacher_disagreement_score":0.03066925,"about_ca_system_score_codex":0.0054398323,"about_ca_system_score_gemma":0.0028532043,"threshold_uncertainty_score":0.16219646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053812772,0.004604858,0.91655654,0.00076964294,0.0001278318,0.00018124397,0.0002753373,0.000484507,0.023187308],"genre_scores_gemma":[0.94998413,0.002078733,0.044540014,0.00010788654,0.000060611743,0.000117798154,0.0001401096,0.0000561051,0.002914657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994018,0.00018640822,0.000016180149,0.00006146176,0.00017622721,0.0001578999],"domain_scores_gemma":[0.99924123,0.00043990117,0.000068084766,0.000029875542,0.00016750663,0.000053346346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297007,0.0007464813,0.00053388876,0.00080791075,0.00057298655,0.0013521409,0.0009407224,0.0006215794,0.002946744],"category_scores_gemma":[0.002516464,0.0004053233,0.0002869189,0.00094805565,0.0007120832,0.0013369732,0.0007964855,0.0007575149,0.00040281055],"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.000049259048,0.000021950756,0.00016983994,0.000078622405,0.000010692672,0.0000800478,0.000043015218,0.9549054,0.0023364131,0.019517792,0.0013603499,0.02142663],"study_design_scores_gemma":[0.0000052845085,0.000025390958,0.000107169704,0.000016702357,0.0000074732548,0.00001806808,0.00004168231,0.9859483,0.0012976337,0.011331777,0.0011911056,0.000009420009],"about_ca_topic_score_codex":0.008611016,"about_ca_topic_score_gemma":0.009139639,"teacher_disagreement_score":0.008611016,"about_ca_system_score_codex":0.0024079254,"about_ca_system_score_gemma":0.0018832496,"threshold_uncertainty_score":0.017470777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011216325,0.000031404637,0.9971148,0.000024045657,0.000015956755,0.000085159634,0.000101441954,0.0011447904,0.00036077623],"genre_scores_gemma":[0.07584748,0.00012066219,0.9210241,0.000067457106,0.000050226237,0.00060287496,0.00081217696,0.0005356523,0.00093943626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811506,0.0006564085,0.00015375885,0.00032459552,0.00062447065,0.0001258198],"domain_scores_gemma":[0.9951115,0.002370301,0.00052764674,0.00057337055,0.0012789827,0.0001381491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039138272,0.0018914903,0.00094813737,0.004057761,0.0009535854,0.0018304721,0.0019439565,0.0010490773,0.0038919896],"category_scores_gemma":[0.0101955235,0.0009025902,0.002115648,0.0021233198,0.0011861444,0.0015358814,0.0020635664,0.0020942828,0.0013401079],"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.000119728495,0.00024434537,0.006592972,0.00051467185,0.00021292517,0.00028632995,0.0005585866,0.6847437,0.0088912025,0.075955965,0.008453785,0.2134258],"study_design_scores_gemma":[0.0000074724658,0.000022887627,0.00016979023,0.000018463901,0.000008733574,0.000041528372,0.000033897606,0.98365706,0.0008408253,0.012302256,0.0028851018,0.0000119007445],"about_ca_topic_score_codex":0.006843133,"about_ca_topic_score_gemma":0.0054762666,"teacher_disagreement_score":0.006843133,"about_ca_system_score_codex":0.0012387016,"about_ca_system_score_gemma":0.0033522598,"threshold_uncertainty_score":0.020698607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101506645,0.0004894278,0.98335266,0.0003915445,0.00016047162,0.000028064054,0.0000426003,0.000096985634,0.00528756],"genre_scores_gemma":[0.8036654,0.002154981,0.18493347,0.00045510114,0.0006556538,0.00018448611,0.00013166835,0.00018508369,0.007634128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848986,0.00047192804,0.000056087596,0.0001483359,0.0007173832,0.00011639821],"domain_scores_gemma":[0.99761,0.0014969993,0.0002352779,0.00023740219,0.00032837197,0.0000920643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025443328,0.0010620625,0.0008116621,0.0010819811,0.0005674014,0.0017618303,0.0012076154,0.001283399,0.0013987742],"category_scores_gemma":[0.008983514,0.00039031278,0.0008110706,0.0010533143,0.0017372924,0.0024287328,0.0017784964,0.0022622526,0.00020724465],"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.000012091793,0.00001847728,0.00021236102,0.000028823628,0.000011027944,0.00006789407,0.000044606175,0.6847516,0.0012838924,0.30720672,0.0004434108,0.005919116],"study_design_scores_gemma":[0.0000011979303,0.000004320295,0.00003120926,0.00000248738,0.0000021715314,0.0000076025117,0.0000022436939,0.9687742,0.00009504956,0.030733684,0.0003417302,0.0000041290327],"about_ca_topic_score_codex":0.0064105387,"about_ca_topic_score_gemma":0.0022331136,"teacher_disagreement_score":0.0064105387,"about_ca_system_score_codex":0.0018267514,"about_ca_system_score_gemma":0.0015706038,"threshold_uncertainty_score":0.013455868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80859303,0.00044294875,0.16751504,0.00028852627,0.00005222939,0.00009841057,0.0001209543,0.00025565666,0.02263308],"genre_scores_gemma":[0.9946343,0.000038886148,0.0041781273,0.0000064751116,0.000005358119,0.000014546442,0.0000145122995,0.0000073555348,0.0011005548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999838,0.00005097607,0.000005448597,0.000022323104,0.000050264596,0.000032925087],"domain_scores_gemma":[0.99967265,0.00012751788,0.00003923654,0.00002814268,0.00011343653,0.000019009776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861938,0.00023516295,0.00029405218,0.0007436717,0.000506111,0.00044687584,0.0004022687,0.00040053565,0.0014455912],"category_scores_gemma":[0.0010410254,0.000091542344,0.00032440215,0.00029982324,0.00052618387,0.00029199908,0.00036250555,0.00024264707,0.00010995203],"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.00042605217,0.00008385009,0.0035065284,0.00011464447,0.000053698153,0.0005322753,0.00022186314,0.773025,0.06006613,0.1339581,0.0011587403,0.026853226],"study_design_scores_gemma":[0.000004005821,0.000019786474,0.00044109364,0.000002911197,0.000006950046,0.000025258967,0.000013496486,0.9957312,0.0015727282,0.002058734,0.00011969928,0.000004168793],"about_ca_topic_score_codex":0.0035111732,"about_ca_topic_score_gemma":0.0014561808,"teacher_disagreement_score":0.0035111732,"about_ca_system_score_codex":0.0007272072,"about_ca_system_score_gemma":0.0005027568,"threshold_uncertainty_score":0.0069814324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068845645,0.0003421345,0.9266756,0.00019087581,0.00016223971,0.000040099207,0.000018755945,0.0002914094,0.003433138],"genre_scores_gemma":[0.98712456,0.00007714678,0.01193471,0.000029743418,0.000020238209,0.000029392046,0.000009337153,0.0000061908454,0.00076860643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.00007841182,0.000019405397,0.000097127355,0.00012679519,0.000047110192],"domain_scores_gemma":[0.99947363,0.00021198319,0.00007160197,0.00003189997,0.00018236488,0.000028516683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006750089,0.00046674817,0.0005771052,0.00028323696,0.0004700119,0.00072431477,0.0007697344,0.00057777227,0.0010583708],"category_scores_gemma":[0.0015382292,0.00020833433,0.0002755194,0.0002893095,0.0006523109,0.0005219342,0.0006851651,0.0008603824,0.00007819286],"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.00028671,0.000082373655,0.0007612925,0.00012981682,0.000058630332,0.00013246475,0.00015554698,0.9165107,0.01401884,0.01080192,0.0008722379,0.05618945],"study_design_scores_gemma":[0.000007375769,0.000035451838,0.00006608329,0.000002108129,0.000004953605,0.0000072252014,0.0000026914283,0.99882203,0.00047090245,0.00049585203,0.0000822426,0.0000030242684],"about_ca_topic_score_codex":0.0066820155,"about_ca_topic_score_gemma":0.0033563278,"teacher_disagreement_score":0.0066820155,"about_ca_system_score_codex":0.0005926379,"about_ca_system_score_gemma":0.00072110083,"threshold_uncertainty_score":0.013286233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027910903,0.0009335092,0.9646685,0.00062820705,0.0005847286,0.0005239219,0.000101898215,0.00069637084,0.003951892],"genre_scores_gemma":[0.9024386,0.0005372045,0.0930307,0.0003427866,0.00017621263,0.0005781877,0.000147713,0.00004978565,0.0026988303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862766,0.00040922523,0.00009740441,0.00023817417,0.0004282787,0.0001992513],"domain_scores_gemma":[0.997898,0.0010300954,0.0001617849,0.00022196134,0.0005545418,0.00013359831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031822051,0.0005912599,0.00074610714,0.0010520612,0.0016355445,0.0013986437,0.0017272654,0.00082299666,0.0015211941],"category_scores_gemma":[0.006067676,0.000240801,0.0004301243,0.00073708495,0.0011683116,0.0017279957,0.0012709354,0.0010505719,0.0001434764],"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.0008224784,0.00042293052,0.0013105138,0.00035774958,0.00016794799,0.0006714781,0.00079770427,0.40426058,0.037375838,0.34119645,0.020708898,0.19190744],"study_design_scores_gemma":[0.00012308198,0.00021156998,0.00030457388,0.000023849587,0.00007059301,0.00015526914,0.00004761961,0.9406466,0.008462129,0.039579075,0.0103040105,0.00007170174],"about_ca_topic_score_codex":0.002850277,"about_ca_topic_score_gemma":0.0031092921,"teacher_disagreement_score":0.0031822051,"about_ca_system_score_codex":0.001964812,"about_ca_system_score_gemma":0.0026090306,"threshold_uncertainty_score":0.016829312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014537962,0.0003648632,0.9798131,0.00039476296,0.000079409736,0.000065701905,0.00025954845,0.00018245222,0.0043022605],"genre_scores_gemma":[0.8576423,0.0019348168,0.119044654,0.0005977394,0.0004858308,0.00044558514,0.0009772487,0.00027895937,0.018592762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987418,0.00033884702,0.000060575236,0.00030231086,0.0003386186,0.00021782216],"domain_scores_gemma":[0.997929,0.0010407243,0.00032416967,0.00016696933,0.0003951687,0.00014392336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018254173,0.0011005888,0.0011360239,0.0012455324,0.0007017841,0.0016770357,0.0026768274,0.0014265928,0.0041904137],"category_scores_gemma":[0.0059136194,0.000669974,0.0013696913,0.0013893156,0.0010511711,0.002689255,0.0015186187,0.0025480797,0.0009176028],"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.000081523955,0.000105715975,0.0030199892,0.00012510303,0.000101173944,0.00083706854,0.00026492827,0.5024875,0.0050641904,0.46133056,0.005649561,0.020932805],"study_design_scores_gemma":[0.0000044334806,0.000008853403,0.00019172649,0.0000050245726,0.000011774446,0.0000664277,0.000009409716,0.9774705,0.00015996814,0.021139467,0.0009228459,0.000009494856],"about_ca_topic_score_codex":0.006165172,"about_ca_topic_score_gemma":0.0035944001,"teacher_disagreement_score":0.006165172,"about_ca_system_score_codex":0.0015147295,"about_ca_system_score_gemma":0.0012236795,"threshold_uncertainty_score":0.014018357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09935738,0.0008346495,0.8927407,0.00032365668,0.00034123822,0.00008039083,0.000047099562,0.00053899863,0.0057358197],"genre_scores_gemma":[0.988884,0.00010609397,0.009856459,0.00003146119,0.000041185947,0.000023063598,0.000011403446,0.0000074460536,0.0010389384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.000060718172,0.000018063667,0.000069396316,0.000099995224,0.00005774616],"domain_scores_gemma":[0.9994729,0.0001300015,0.000067115114,0.000025627221,0.00027735368,0.00002701799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087723753,0.000469886,0.0005347191,0.00047990002,0.00058797153,0.00114013,0.0010219563,0.00072120083,0.0012745752],"category_scores_gemma":[0.0016758859,0.00019517774,0.00033353083,0.00036890127,0.00056092086,0.0006009727,0.0006393547,0.0006958509,0.00009571628],"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.0006561692,0.00019151054,0.0010898074,0.0002369264,0.00008595091,0.00016680652,0.00015795784,0.8056052,0.027147613,0.018929956,0.0026395095,0.14309257],"study_design_scores_gemma":[0.000014325829,0.00004267483,0.00011819689,0.000003034391,0.000011329497,0.000006806271,0.0000043572013,0.9978174,0.00076315075,0.0010666277,0.00014725997,0.000004862154],"about_ca_topic_score_codex":0.008630418,"about_ca_topic_score_gemma":0.0049621603,"teacher_disagreement_score":0.008630418,"about_ca_system_score_codex":0.0010088634,"about_ca_system_score_gemma":0.0006991639,"threshold_uncertainty_score":0.017160356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015807891,0.0013858376,0.96022797,0.0029351057,0.00029537803,0.00003427839,0.000128151,0.00014490007,0.01904054],"genre_scores_gemma":[0.8195877,0.0054084295,0.1575954,0.0017280949,0.0015268866,0.0003065557,0.00032466985,0.00036275745,0.0131594725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968644,0.0017202904,0.00009899124,0.00029542335,0.0008317785,0.00018911276],"domain_scores_gemma":[0.992826,0.005517801,0.00034978244,0.00053789717,0.0005583322,0.00021030192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064444225,0.0011718203,0.0012885628,0.0012222729,0.0009968432,0.0024322546,0.0012174404,0.0014086927,0.0040098475],"category_scores_gemma":[0.01790873,0.0004034742,0.0017040946,0.0015648573,0.0044223615,0.005256724,0.0027054173,0.0052331164,0.0007262681],"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.0000066687735,0.000009503192,0.000059064114,0.000018342338,0.0000050148415,0.000030020085,0.000055919503,0.016090157,0.00016095089,0.9809137,0.00057587744,0.0020748053],"study_design_scores_gemma":[0.000006586964,0.000014973709,0.000034623004,0.000012024268,0.0000044542353,0.000024312492,0.000015099254,0.13997841,0.0001245686,0.8581676,0.001610054,0.000007246069],"about_ca_topic_score_codex":0.0026665917,"about_ca_topic_score_gemma":0.0010376336,"teacher_disagreement_score":0.0064444225,"about_ca_system_score_codex":0.0022339371,"about_ca_system_score_gemma":0.001474468,"threshold_uncertainty_score":0.034081757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013334762,0.00003714364,0.99810684,0.00008778657,0.000010825705,0.000008120699,0.000019202302,0.000054091062,0.00034250974],"genre_scores_gemma":[0.52235895,0.00090770976,0.47226125,0.00041077659,0.0005170544,0.00051595323,0.00036007576,0.00027631753,0.0023919311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644816,0.0011513676,0.00020188013,0.0006648947,0.0012398175,0.0002938807],"domain_scores_gemma":[0.98288685,0.0118550975,0.001585027,0.0015167171,0.0017811388,0.00037523935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00556422,0.0011072003,0.0014502137,0.0021004025,0.00077478826,0.0020368467,0.0020803043,0.0016701714,0.0018201545],"category_scores_gemma":[0.030089224,0.0010243416,0.0017317804,0.0013373729,0.0027432016,0.00427858,0.0030402667,0.0041016447,0.00035814854],"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.000033032837,0.000032091848,0.0006359524,0.00006203784,0.00004639919,0.000068845424,0.00009635835,0.61268795,0.002388205,0.368947,0.0006258508,0.014376185],"study_design_scores_gemma":[0.0000027048177,0.00000942613,0.0000838837,0.000008569897,0.0000041248027,0.000013697555,0.000003908661,0.9309677,0.00034574667,0.06812683,0.00042300203,0.000010392544],"about_ca_topic_score_codex":0.0040962296,"about_ca_topic_score_gemma":0.0019966757,"teacher_disagreement_score":0.00556422,"about_ca_system_score_codex":0.0022146958,"about_ca_system_score_gemma":0.0021825442,"threshold_uncertainty_score":0.029426694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084966037,0.00031017725,0.99612767,0.00019934759,0.000033998294,0.000013918769,0.000030120129,0.000051580722,0.0023835415],"genre_scores_gemma":[0.6014861,0.004261976,0.38024634,0.0006257624,0.0010745766,0.00046173396,0.00031637604,0.0001481808,0.011378936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854326,0.00054199854,0.00008381994,0.0002787927,0.00044141395,0.000110831264],"domain_scores_gemma":[0.99772686,0.0015718831,0.00018712888,0.0001736093,0.00029693698,0.000043527176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017470629,0.0012534412,0.0011430825,0.0013631306,0.000657963,0.0023232917,0.0013676039,0.0011053308,0.0036766096],"category_scores_gemma":[0.005420613,0.00058250123,0.0011219766,0.0016953851,0.001914952,0.0030415356,0.001840758,0.002925584,0.0006467452],"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.000020226074,0.00003403368,0.00040981168,0.00012843552,0.000056532415,0.00008479498,0.00014307768,0.35042527,0.0013824973,0.6233625,0.0014380421,0.022514788],"study_design_scores_gemma":[0.0000046365735,0.000039107683,0.0001438799,0.000026788188,0.00001658601,0.00005942409,0.00003289832,0.7272979,0.0006088068,0.26802284,0.003725592,0.000021609903],"about_ca_topic_score_codex":0.0028013212,"about_ca_topic_score_gemma":0.0015506815,"teacher_disagreement_score":0.0036766096,"about_ca_system_score_codex":0.0018844231,"about_ca_system_score_gemma":0.0013290598,"threshold_uncertainty_score":0.013672471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249064,0.0005654941,0.92237574,0.000649436,0.00008045824,0.00008501537,0.00012405978,0.00035200556,0.00327713],"genre_scores_gemma":[0.9325336,0.00026314717,0.06535651,0.00014091971,0.0000431122,0.0001334929,0.00010776133,0.000044990848,0.001376437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951494,0.00019100677,0.000018219605,0.0000996585,0.00008088769,0.00009528282],"domain_scores_gemma":[0.99885094,0.00085948675,0.00010929117,0.000033272507,0.00010640927,0.000040565894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011216252,0.00089949305,0.001225316,0.0005205071,0.00035487302,0.0008247265,0.0009401499,0.0012282886,0.0011817253],"category_scores_gemma":[0.0021427067,0.0005327681,0.0006027604,0.0005606752,0.000533659,0.0009098796,0.00055814337,0.0010806606,0.00012584864],"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.000013863148,0.000014566746,0.00016943252,0.000014862977,0.000007426114,0.0000143955685,0.000007091537,0.99579275,0.0001634275,0.0005442578,0.00011641162,0.003141485],"study_design_scores_gemma":[0.0000017182031,0.0000067454425,0.00002393525,0.0000011326441,0.000001648066,0.000002333231,0.0000022081974,0.99959236,0.000053947664,0.0002839481,0.00002898528,9.591143e-7],"about_ca_topic_score_codex":0.0081152655,"about_ca_topic_score_gemma":0.005793437,"teacher_disagreement_score":0.0081152655,"about_ca_system_score_codex":0.0006678257,"about_ca_system_score_gemma":0.0012143707,"threshold_uncertainty_score":0.01613605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31590042,0.007083226,0.6513912,0.001440891,0.0006314664,0.00008562767,0.000056359382,0.00014705962,0.023263752],"genre_scores_gemma":[0.9906137,0.0008706138,0.0052657444,0.000043886874,0.0000941581,0.000020904663,0.000014660626,0.000018119174,0.0030582338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.0001091354,0.00001396062,0.00006438448,0.000092857095,0.00004216317],"domain_scores_gemma":[0.9992778,0.0003762013,0.000054128854,0.000021333344,0.00024059003,0.00002997744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801893,0.0005007431,0.00051828567,0.0005764565,0.00041735754,0.000778843,0.00079475046,0.00071628735,0.0012686019],"category_scores_gemma":[0.0028956986,0.00020847222,0.00058187975,0.00044404122,0.00061056006,0.0015012166,0.00049531495,0.0007384662,0.00004758444],"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.00017390566,0.00009733812,0.0028815398,0.00037102422,0.00011782385,0.0004654862,0.00021794254,0.8699942,0.006473783,0.09627852,0.0015549219,0.021373557],"study_design_scores_gemma":[0.0000023431805,0.000012743071,0.00017492783,0.0000030838821,0.000009391063,0.000019351732,0.000011642579,0.9970578,0.00014308188,0.0024502587,0.00011249599,0.0000028643253],"about_ca_topic_score_codex":0.0055070436,"about_ca_topic_score_gemma":0.001708396,"teacher_disagreement_score":0.0055070436,"about_ca_system_score_codex":0.00064915506,"about_ca_system_score_gemma":0.0007939538,"threshold_uncertainty_score":0.010949969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026903808,0.0004950295,0.9679633,0.0001821105,0.0001695615,0.00007662653,0.00002783446,0.00023776523,0.0039439728],"genre_scores_gemma":[0.96651256,0.00025803715,0.031258848,0.00006717194,0.000050415598,0.00016105105,0.000027194428,0.000016951686,0.0016475805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996635,0.00007225667,0.000026319552,0.00009011228,0.000104124345,0.000043626307],"domain_scores_gemma":[0.99940455,0.00018312954,0.00008893058,0.000025921796,0.00027128335,0.000026247348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095394923,0.0006110126,0.0007561734,0.00041267613,0.00052418077,0.001152285,0.0012914139,0.0010974063,0.0016146593],"category_scores_gemma":[0.0017615469,0.0003401291,0.0005033977,0.0003816183,0.0007039037,0.0007650987,0.00085023063,0.0010034359,0.00013928128],"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.00017981179,0.00006547018,0.00043910756,0.00018410556,0.00006546,0.00009429342,0.00009865933,0.9369519,0.0112371445,0.010648524,0.00062545016,0.039410073],"study_design_scores_gemma":[0.000007828835,0.000023426477,0.000054851647,0.0000036142028,0.000008059497,0.000005450922,0.0000025698287,0.99872714,0.00047095047,0.0005883126,0.00010392052,0.000003917717],"about_ca_topic_score_codex":0.007900266,"about_ca_topic_score_gemma":0.005770997,"teacher_disagreement_score":0.007900266,"about_ca_system_score_codex":0.00078119145,"about_ca_system_score_gemma":0.0012158823,"threshold_uncertainty_score":0.015708566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07837806,0.0005606988,0.9143858,0.0003461208,0.00022699306,0.000102082115,0.000045372468,0.0026306156,0.0033242793],"genre_scores_gemma":[0.95014715,0.00012446998,0.04793235,0.00013086006,0.00008101053,0.000052974603,0.000036857167,0.000036905916,0.0014573728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936944,0.00013422959,0.00004945991,0.00014778807,0.00020836333,0.000090719106],"domain_scores_gemma":[0.99860305,0.00048344527,0.00022451986,0.00018288149,0.00038469458,0.00012134251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011846641,0.0005973314,0.0006017786,0.0005072121,0.00041790612,0.001184804,0.0016370168,0.00062336866,0.0008350664],"category_scores_gemma":[0.0027172703,0.00027724745,0.00028908395,0.00031701426,0.00044782486,0.0013502808,0.0009218783,0.00097201724,0.0001887332],"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.0004677313,0.000621408,0.0031281402,0.00015885536,0.00011311792,0.00017179572,0.0001891426,0.6804663,0.043720208,0.011652978,0.0037877895,0.25552258],"study_design_scores_gemma":[0.0000193819,0.000035204997,0.00018254353,0.0000026700038,0.0000104334495,0.000011614726,0.0000033833094,0.99616855,0.0020811956,0.0011057144,0.00037188875,0.0000073931546],"about_ca_topic_score_codex":0.003553586,"about_ca_topic_score_gemma":0.0036616533,"teacher_disagreement_score":0.003553586,"about_ca_system_score_codex":0.00068730145,"about_ca_system_score_gemma":0.0009839358,"threshold_uncertainty_score":0.0070658326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20111535,0.0015982594,0.7740492,0.00053695537,0.0003507754,0.00035238313,0.0033148208,0.010676301,0.008005978],"genre_scores_gemma":[0.8805662,0.0005132156,0.1121229,0.00011618506,0.00013780077,0.00025437266,0.0044814376,0.00009770877,0.0017101568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985935,0.0002026558,0.00011637166,0.0004417796,0.0005222728,0.00012338252],"domain_scores_gemma":[0.9970235,0.0007921799,0.00052686426,0.0005174307,0.0010228113,0.00011714198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010327401,0.0015062433,0.00082883186,0.001874098,0.00044468485,0.0010976688,0.00172998,0.0007029303,0.0006694826],"category_scores_gemma":[0.0059363456,0.0002393806,0.000481114,0.002131293,0.00037068684,0.0020299542,0.0008845714,0.0011950646,0.0005117506],"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.00036922493,0.0006429146,0.020959053,0.00038272497,0.00024203464,0.00018505551,0.00011644911,0.55215544,0.017095806,0.004984551,0.011524628,0.39134204],"study_design_scores_gemma":[0.000013840035,0.000060064613,0.0036009464,0.0000091293505,0.00001709665,0.000047015812,0.000021003463,0.9865052,0.00556771,0.0026113247,0.001530824,0.000015850375],"about_ca_topic_score_codex":0.004980114,"about_ca_topic_score_gemma":0.004285155,"teacher_disagreement_score":0.004980114,"about_ca_system_score_codex":0.001143136,"about_ca_system_score_gemma":0.0008964826,"threshold_uncertainty_score":0.009902239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12150908,0.0006589865,0.8612989,0.00064189034,0.00017770863,0.00039095845,0.00015216207,0.009658313,0.005511947],"genre_scores_gemma":[0.78379405,0.00037546316,0.21043833,0.0002021995,0.00025243525,0.00028882644,0.000254949,0.00031329278,0.004080425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995808,0.000053891865,0.000022971746,0.00009205969,0.00020633935,0.00004385993],"domain_scores_gemma":[0.9994374,0.00016802755,0.000087027096,0.00011824526,0.000129882,0.00005942605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011175105,0.00054761523,0.00072578585,0.0007939814,0.0009533773,0.0009533577,0.0016397716,0.00060666347,0.002629752],"category_scores_gemma":[0.0019519178,0.00036182988,0.00024670493,0.0006832383,0.0005599719,0.0015151945,0.0006036119,0.00058492884,0.0010910399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000670871,0.0007269163,0.0024869535,0.00024311013,0.00010643539,0.00035932462,0.0003021745,0.17545283,0.21511213,0.017782617,0.012503983,0.57425267],"study_design_scores_gemma":[0.00011854007,0.00016126216,0.0005928516,0.000008916173,0.000029107563,0.000108714805,0.000035487315,0.96959096,0.016539084,0.007455069,0.005338563,0.000021428497],"about_ca_topic_score_codex":0.0015516705,"about_ca_topic_score_gemma":0.0020930783,"teacher_disagreement_score":0.002629752,"about_ca_system_score_codex":0.001037057,"about_ca_system_score_gemma":0.0009705362,"threshold_uncertainty_score":0.008797407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8186792,0.004092363,0.1662113,0.000640731,0.00015566142,0.00022967384,0.00023012857,0.0019759275,0.0077850865],"genre_scores_gemma":[0.99528176,0.0003146241,0.003990479,0.00003606053,0.00002827909,0.000040722272,0.00007150459,0.0000463806,0.00019014538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959914,0.0012179567,0.00017565885,0.00038990466,0.0014312972,0.0007938421],"domain_scores_gemma":[0.9834051,0.010084939,0.0020858857,0.0013220981,0.0027523767,0.00034953604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054695443,0.00085731567,0.00088833005,0.00233378,0.0009784922,0.0011809152,0.0010717777,0.0007731255,0.0006724781],"category_scores_gemma":[0.022385597,0.0003335019,0.0004934933,0.0014971558,0.0015673117,0.0021800844,0.0007989355,0.0008999984,0.00014420306],"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.00069298677,0.00020289692,0.009928708,0.00024963863,0.00014582151,0.0003790454,0.00019582834,0.9382678,0.013595197,0.006926466,0.0012966968,0.028118946],"study_design_scores_gemma":[0.000013889384,0.00018337635,0.0012594147,0.000010150998,0.00002759593,0.000099564495,0.000028464345,0.99426174,0.0032068475,0.00071095343,0.00018097948,0.000016958204],"about_ca_topic_score_codex":0.0045837574,"about_ca_topic_score_gemma":0.0013117372,"teacher_disagreement_score":0.0054695443,"about_ca_system_score_codex":0.0023869232,"about_ca_system_score_gemma":0.0011410324,"threshold_uncertainty_score":0.028926075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08005517,0.00029712758,0.9140997,0.00021800413,0.000082493214,0.00020293475,0.000085752385,0.0014121737,0.0035465856],"genre_scores_gemma":[0.89065486,0.000105957464,0.10740012,0.000087245884,0.000051601783,0.00011235161,0.00007771674,0.00006756476,0.0014425834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872607,0.00030393765,0.00007139424,0.00023587921,0.00041370385,0.00024891295],"domain_scores_gemma":[0.99749917,0.0008399091,0.00033996484,0.0006569194,0.00042986652,0.00023410656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020852925,0.0007947766,0.00076356874,0.0006773844,0.0011073116,0.0009212655,0.0013407405,0.00046608035,0.001923083],"category_scores_gemma":[0.003395223,0.0002570699,0.00043274078,0.000836482,0.0010271545,0.0016193943,0.0015664868,0.0011445883,0.00025098093],"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.00065732386,0.0006352839,0.0055471305,0.00027955213,0.00014249627,0.00034949213,0.00065149704,0.5047442,0.111927174,0.13892704,0.009012491,0.22712636],"study_design_scores_gemma":[0.00007118993,0.00021317287,0.0009471116,0.000011127675,0.000036462552,0.00008478226,0.000043303247,0.96059644,0.017714107,0.017715076,0.0025326812,0.00003454517],"about_ca_topic_score_codex":0.004773804,"about_ca_topic_score_gemma":0.005999053,"teacher_disagreement_score":0.004773804,"about_ca_system_score_codex":0.0012831857,"about_ca_system_score_gemma":0.0022851012,"threshold_uncertainty_score":0.01102823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02781598,0.0010264385,0.9638293,0.000861922,0.00021601815,0.000097507414,0.00009726343,0.0020047915,0.004050835],"genre_scores_gemma":[0.67370355,0.00045650417,0.32174298,0.0004592854,0.00009625832,0.000115107294,0.00013402588,0.00031073368,0.0029815517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796754,0.0006417399,0.00011690096,0.00035709998,0.0006752401,0.00024137284],"domain_scores_gemma":[0.99738353,0.0009944144,0.0002118991,0.0006826442,0.0005300062,0.00019744386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038690178,0.0007722166,0.0010030933,0.0008013097,0.0014010979,0.002710232,0.001654373,0.0007362924,0.0035755984],"category_scores_gemma":[0.011216159,0.00041975192,0.00034101095,0.001128931,0.00196157,0.003950184,0.0017905844,0.002300248,0.0007580865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024147204,0.00030033302,0.002274083,0.00022058579,0.000068460635,0.00018774008,0.0006725219,0.35673332,0.026661225,0.16950181,0.021940805,0.41902432],"study_design_scores_gemma":[0.00007581552,0.00011337362,0.00034092544,0.00003311876,0.000016496968,0.000059383223,0.000078095225,0.9365416,0.012149715,0.045200735,0.005340947,0.000049759357],"about_ca_topic_score_codex":0.0071285837,"about_ca_topic_score_gemma":0.006527492,"teacher_disagreement_score":0.0071285837,"about_ca_system_score_codex":0.002497241,"about_ca_system_score_gemma":0.0024660386,"threshold_uncertainty_score":0.02046156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053866124,0.00885666,0.69762355,0.2497976,0.006279557,0.000079716,0.00021104328,0.0006346814,0.031130563],"genre_scores_gemma":[0.47652483,0.035136633,0.37667066,0.05460552,0.022128329,0.0006443931,0.00040888556,0.0018273358,0.0320533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98268867,0.010694995,0.0004904369,0.0011996442,0.0042212764,0.00070495],"domain_scores_gemma":[0.9268708,0.05892273,0.001309725,0.0046059624,0.007111242,0.0011795441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020999596,0.001389272,0.0012968365,0.0012636087,0.001661821,0.0074334163,0.004967682,0.005611859,0.007355084],"category_scores_gemma":[0.07864047,0.001158024,0.002037116,0.0012277418,0.011545708,0.018362435,0.0031340788,0.018037396,0.0019819057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007157372,0.00005690443,0.00032968767,0.0000944984,0.000047889687,0.000041603114,0.0002787392,0.08456149,0.0002562699,0.874537,0.027220512,0.012503821],"study_design_scores_gemma":[0.00005036073,0.000043910375,0.00013238545,0.00018111969,0.000016568212,0.00003483878,0.0001720427,0.10870807,0.0010630473,0.8333283,0.056209344,0.00006002174],"about_ca_topic_score_codex":0.010784435,"about_ca_topic_score_gemma":0.003240043,"teacher_disagreement_score":0.020999596,"about_ca_system_score_codex":0.00698863,"about_ca_system_score_gemma":0.0055190455,"threshold_uncertainty_score":0.11105782},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03496293,0.0004561835,0.77968746,0.002075215,0.0011963553,0.0012788175,0.0033755987,0.09731648,0.07965099],"genre_scores_gemma":[0.09985971,0.0009835827,0.7239956,0.00067409413,0.00019399343,0.0016343951,0.014914146,0.022675585,0.13506897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981585,0.0003683599,0.00008800513,0.00021069999,0.00095068745,0.00022368104],"domain_scores_gemma":[0.9980616,0.00022166665,0.000070770315,0.0004269376,0.00084393215,0.0003751423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027679314,0.00079523865,0.00036668062,0.0006235122,0.00085439894,0.0021179607,0.0019313968,0.0011351764,0.022553422],"category_scores_gemma":[0.004396131,0.0009684639,0.00052232837,0.00076665543,0.000406689,0.0026609823,0.0014019762,0.0021922104,0.0154436445],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009802582,0.0012362765,0.002197437,0.0005734233,0.000077544544,0.00047182007,0.00107407,0.007113076,0.06863065,0.05589365,0.27468055,0.58707124],"study_design_scores_gemma":[0.00075208745,0.00091489987,0.00195624,0.0001539233,0.0000871613,0.0010484888,0.0002849119,0.076107815,0.08043669,0.012408492,0.8257479,0.000101363854],"about_ca_topic_score_codex":0.0024541507,"about_ca_topic_score_gemma":0.001223111,"teacher_disagreement_score":0.022553422,"about_ca_system_score_codex":0.00077872875,"about_ca_system_score_gemma":0.0019612154,"threshold_uncertainty_score":0.07544869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68785685,0.00017883688,0.29518408,0.00018162664,0.000087527806,0.00034879817,0.00031894137,0.0054149292,0.010428574],"genre_scores_gemma":[0.96341527,0.00010153647,0.035036452,0.000027067781,0.000010999057,0.00012476176,0.00031723932,0.00018749367,0.0007790954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799347,0.000871216,0.00016085755,0.00015963605,0.0006427636,0.00017205994],"domain_scores_gemma":[0.9961926,0.0014773185,0.00019094131,0.0010211833,0.0009989955,0.0001190298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030694224,0.000630378,0.00070398086,0.0009471718,0.0004334819,0.0011377757,0.001479809,0.00049581804,0.0012611072],"category_scores_gemma":[0.006651206,0.000300918,0.0003091266,0.00091633375,0.00043550748,0.0015029832,0.0008556458,0.00088073674,0.0002603038],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074848585,0.00083048386,0.011065939,0.0001950556,0.000116891984,0.00031438033,0.00016651484,0.8345399,0.02848846,0.007461351,0.0016853384,0.11438722],"study_design_scores_gemma":[0.00003621247,0.00022876293,0.0010725877,0.0000068523486,0.000013966518,0.00006366448,0.000036081372,0.9652637,0.030651368,0.0013177976,0.0012944049,0.00001454503],"about_ca_topic_score_codex":0.0016912814,"about_ca_topic_score_gemma":0.00076711946,"teacher_disagreement_score":0.0030694224,"about_ca_system_score_codex":0.0008150553,"about_ca_system_score_gemma":0.0006494878,"threshold_uncertainty_score":0.016232789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21883883,0.00079373526,0.75878143,0.0008047371,0.000051456507,0.0000681753,0.00023447705,0.00039042326,0.020036753],"genre_scores_gemma":[0.9786244,0.0002274302,0.020074122,0.000046738936,0.00002455527,0.000047175286,0.000049668666,0.00010309494,0.00080286677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983367,0.00076210016,0.000038846116,0.00019262976,0.00040990542,0.00025993228],"domain_scores_gemma":[0.99365413,0.00431006,0.0006736855,0.00042912748,0.0006947273,0.00023833176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028621953,0.0007230296,0.00044579766,0.0013986042,0.0005741455,0.0018589488,0.0007524732,0.00087578566,0.0020562038],"category_scores_gemma":[0.019322917,0.0003495367,0.00018468557,0.0008638428,0.0019432913,0.0032840006,0.00092118216,0.0008096232,0.0002519351],"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.00005467226,0.000019304973,0.0006120273,0.000021022906,0.000009134682,0.00003248644,0.000036933947,0.93171287,0.0016381263,0.061046552,0.00039917548,0.0044176904],"study_design_scores_gemma":[0.0000055652295,0.000021168167,0.00032516368,0.000020088997,0.000004140822,0.000025607891,0.00004140868,0.9538391,0.002221331,0.04308355,0.00039901352,0.000013762007],"about_ca_topic_score_codex":0.0016033578,"about_ca_topic_score_gemma":0.001254959,"teacher_disagreement_score":0.0028621953,"about_ca_system_score_codex":0.0021422051,"about_ca_system_score_gemma":0.0010849977,"threshold_uncertainty_score":0.015542865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011342648,0.00018939473,0.982734,0.0005154463,0.00012629075,0.00012298216,0.000048329683,0.0007029902,0.004217833],"genre_scores_gemma":[0.36163157,0.00025936504,0.6345906,0.00021953326,0.0000707895,0.00017849205,0.000115328105,0.00044945144,0.00248481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9633833,0.015350325,0.0026080983,0.0041569164,0.012328017,0.0021732536],"domain_scores_gemma":[0.9076446,0.052554864,0.008171001,0.011971856,0.018866321,0.00079128303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02957094,0.0015231059,0.0014624748,0.0042209337,0.002024656,0.007814769,0.0035952744,0.0013033573,0.004995421],"category_scores_gemma":[0.11087317,0.0008468864,0.0016673609,0.0022492423,0.003277734,0.01271975,0.0042004623,0.0042547267,0.00077945186],"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.00060821016,0.00020471253,0.010898974,0.0007406486,0.0002164959,0.0006592788,0.005736557,0.06092784,0.016401928,0.49636206,0.0044452823,0.4027981],"study_design_scores_gemma":[0.000108801,0.0004805243,0.0040553967,0.0006743115,0.0003455233,0.0008815878,0.003132958,0.44328952,0.047482092,0.45833662,0.04082265,0.00038994587],"about_ca_topic_score_codex":0.0057174433,"about_ca_topic_score_gemma":0.0049720677,"teacher_disagreement_score":0.02957094,"about_ca_system_score_codex":0.0036583375,"about_ca_system_score_gemma":0.0065573743,"threshold_uncertainty_score":0.15638793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026955131,0.00007930679,0.9719543,0.00007500271,0.0000040656437,0.000030170384,0.00005941668,0.00026108386,0.00058147137],"genre_scores_gemma":[0.6040366,0.00021859494,0.3940352,0.000032742886,0.000019628718,0.0001304031,0.00044579015,0.0000859456,0.000995049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986777,0.0007113949,0.000043522767,0.00016511859,0.00033007105,0.00007208435],"domain_scores_gemma":[0.99339277,0.0045590196,0.0008120939,0.0005590666,0.00055994064,0.00011715455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023216058,0.00060200685,0.0008453014,0.0015758331,0.00047721775,0.0011674378,0.0011721691,0.0008568819,0.00078524265],"category_scores_gemma":[0.01664646,0.00052116835,0.00033380665,0.0012471997,0.0007479649,0.0024064388,0.0013572566,0.0010000098,0.00037036013],"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.00028440056,0.00010417449,0.008993882,0.00013978242,0.00007241851,0.00015975485,0.00023162608,0.83383894,0.010023925,0.026604908,0.00096420344,0.11858198],"study_design_scores_gemma":[0.000007139422,0.000017084772,0.0006946829,0.0000052339537,0.0000047740346,0.000040892995,0.000016316153,0.98928946,0.0022448986,0.0074084173,0.00026138726,0.00000962788],"about_ca_topic_score_codex":0.001397309,"about_ca_topic_score_gemma":0.0018137685,"teacher_disagreement_score":0.0023216058,"about_ca_system_score_codex":0.0007025777,"about_ca_system_score_gemma":0.0007054449,"threshold_uncertainty_score":0.012277961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042124163,0.00033973515,0.95561695,0.00012233463,0.000047468744,0.00007421301,0.000022703842,0.0007838022,0.0008686994],"genre_scores_gemma":[0.85279775,0.00023229906,0.14607307,0.000049792932,0.000043643457,0.000076505836,0.00009282862,0.00004428021,0.0005898085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943143,0.00019884254,0.000035494486,0.000117351454,0.00015951671,0.000057347148],"domain_scores_gemma":[0.9989868,0.00048080718,0.00014124991,0.000101371625,0.00024875626,0.000040979405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084244605,0.0005105481,0.0004863328,0.0007337305,0.0004343505,0.00054722023,0.00089136837,0.00036127082,0.00041039172],"category_scores_gemma":[0.002432553,0.00023650173,0.00031540534,0.0006017089,0.0003687204,0.0009387285,0.00039322698,0.0005495908,0.00008668081],"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.00020607453,0.00019486182,0.002086668,0.00008401941,0.00006486316,0.00010571291,0.00009805222,0.7555885,0.02740947,0.0063730613,0.0010051958,0.20678362],"study_design_scores_gemma":[0.0000033712497,0.00003231199,0.00016666805,0.000002366453,0.000007260029,0.0000192855,0.000005442761,0.9967841,0.0018556302,0.00086994824,0.00024871982,0.0000049730565],"about_ca_topic_score_codex":0.002666891,"about_ca_topic_score_gemma":0.002669862,"teacher_disagreement_score":0.002666891,"about_ca_system_score_codex":0.0008727238,"about_ca_system_score_gemma":0.0008270607,"threshold_uncertainty_score":0.006332159},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9467,0.00048936356,0.05002486,0.00015870061,0.00013025157,0.000110436325,0.00021066444,0.00067986705,0.0014959094],"genre_scores_gemma":[0.9961253,0.0000683315,0.0035390635,0.000026912247,0.000007584746,0.00002421974,0.0000462153,0.000024240699,0.00013827189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978108,0.0006175305,0.00015570257,0.0004482855,0.0006794637,0.0002883345],"domain_scores_gemma":[0.97796905,0.015318855,0.0020880345,0.0017947778,0.002269105,0.00056026364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025834502,0.0008562461,0.00044095542,0.0010507721,0.0005433891,0.0011261442,0.0011045802,0.0006282547,0.00078700006],"category_scores_gemma":[0.021906141,0.00037369123,0.00019729786,0.0006407596,0.0008004431,0.0018056621,0.000835464,0.00086930895,0.00019370936],"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.0035549572,0.0010725755,0.075909615,0.00057814905,0.00024961418,0.0004696116,0.0006690076,0.465992,0.35037193,0.003966454,0.0010519829,0.09611419],"study_design_scores_gemma":[0.00013062196,0.004581357,0.037845988,0.000084695435,0.00028128264,0.00034756036,0.0004489227,0.5963436,0.3539487,0.0027550827,0.002974746,0.00025735455],"about_ca_topic_score_codex":0.0023191276,"about_ca_topic_score_gemma":0.0021757393,"teacher_disagreement_score":0.0025834502,"about_ca_system_score_codex":0.0009931575,"about_ca_system_score_gemma":0.00076395774,"threshold_uncertainty_score":0.013662696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96930087,0.0008226364,0.01222639,0.00025687454,0.00010231257,0.00012716428,0.0017977295,0.0011419394,0.014224059],"genre_scores_gemma":[0.99401605,0.000107063395,0.0032419993,0.000053106014,0.00002218129,0.00003084152,0.0015904063,0.00008191896,0.0008564353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414945,0.0015307326,0.0003460492,0.00057318504,0.0028976859,0.0005028261],"domain_scores_gemma":[0.9763243,0.010443588,0.001635047,0.0023185157,0.008201715,0.0010769088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004642593,0.00041763834,0.0003914467,0.0015469629,0.00033266074,0.001201833,0.0006485695,0.0007441874,0.0011197029],"category_scores_gemma":[0.02259395,0.00014131388,0.0001894179,0.0019059787,0.00048107182,0.001824612,0.0008663693,0.00085670804,0.00048340097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005029716,0.002868977,0.36393163,0.0014905151,0.00045999468,0.0007474316,0.0053879423,0.036022976,0.052007407,0.018139672,0.03160351,0.4823102],"study_design_scores_gemma":[0.00013526346,0.0065873573,0.7425801,0.00031619042,0.0001701156,0.00074000703,0.0041168765,0.13070947,0.068970755,0.006633007,0.03876747,0.00027337053],"about_ca_topic_score_codex":0.003986045,"about_ca_topic_score_gemma":0.0035144528,"teacher_disagreement_score":0.004642593,"about_ca_system_score_codex":0.0007484501,"about_ca_system_score_gemma":0.00048862037,"threshold_uncertainty_score":0.024552643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05599617,0.00055552676,0.93996364,0.00015354354,0.00009248075,0.000041247647,0.000014320262,0.000377664,0.002805268],"genre_scores_gemma":[0.9905376,0.00018824526,0.008166897,0.00001816541,0.000017033348,0.000030726005,0.000013115225,0.000006641505,0.0010217276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980146,0.00003679214,0.000010548475,0.000040655337,0.00008001156,0.000030485528],"domain_scores_gemma":[0.99972075,0.00012706402,0.00004451685,0.00002011444,0.00007360174,0.000013808707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046080304,0.0004001075,0.00032455003,0.00026370605,0.0003110476,0.0005809765,0.00056274555,0.00032804528,0.00063204166],"category_scores_gemma":[0.0011119255,0.00019860908,0.00031940633,0.00023443873,0.000558984,0.00044933235,0.0004002288,0.0006312645,0.00005769741],"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.00014992252,0.00006838914,0.0007674543,0.00012873902,0.00003418758,0.00015126907,0.00019501586,0.8981496,0.016509103,0.01615564,0.00085613347,0.06683456],"study_design_scores_gemma":[0.000005442896,0.00004293906,0.00012165805,0.00000252414,0.0000056665313,0.000005493175,0.0000053132826,0.9979073,0.0008125614,0.00087062333,0.00021798103,0.0000025000277],"about_ca_topic_score_codex":0.008564446,"about_ca_topic_score_gemma":0.005326144,"teacher_disagreement_score":0.008564446,"about_ca_system_score_codex":0.00057798624,"about_ca_system_score_gemma":0.0009140714,"threshold_uncertainty_score":0.017029166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07879235,0.00038292102,0.9166425,0.00017106411,0.00016877585,0.000046471512,0.000015913882,0.0004728888,0.0033070513],"genre_scores_gemma":[0.97768915,0.00008938649,0.021161336,0.000039071787,0.000020754116,0.00003147799,0.000010208146,0.000010033374,0.00094855035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.00009465822,0.000021277725,0.00012611694,0.00014642214,0.00006038658],"domain_scores_gemma":[0.9994325,0.00021775173,0.000061046776,0.000037552592,0.00021502796,0.000036153502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077932,0.00047812954,0.000666728,0.0004228659,0.0006215353,0.000783528,0.0010315635,0.00054101495,0.0011435482],"category_scores_gemma":[0.0014142832,0.0002187412,0.00027476647,0.00037293107,0.00058416615,0.00066364295,0.0006587401,0.0008670853,0.000088501445],"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.0005966489,0.00028900953,0.0016011053,0.00018212528,0.000093183866,0.0001994274,0.00026885522,0.77907664,0.04021209,0.020084796,0.0021177717,0.15527825],"study_design_scores_gemma":[0.00000853204,0.000047296977,0.00008243643,0.0000021092658,0.000006552844,0.000010552648,0.0000032205035,0.9981396,0.0010352915,0.0005588441,0.000101387224,0.0000040809323],"about_ca_topic_score_codex":0.0054823053,"about_ca_topic_score_gemma":0.0035897032,"teacher_disagreement_score":0.0054823053,"about_ca_system_score_codex":0.00077621016,"about_ca_system_score_gemma":0.0007906718,"threshold_uncertainty_score":0.010900795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34950724,0.007072814,0.6230369,0.0029579955,0.00082726486,0.00012224964,0.00033383138,0.003138132,0.013003543],"genre_scores_gemma":[0.97250044,0.0012710101,0.022545861,0.00020403764,0.00034604175,0.000032369764,0.0000818078,0.00014888543,0.0028695834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989452,0.00024531884,0.000037843427,0.00013402413,0.0003124689,0.00032514875],"domain_scores_gemma":[0.9957188,0.0028982107,0.0003203291,0.00041115502,0.00049002154,0.0001615582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021183598,0.0009213164,0.001004423,0.00092279445,0.0011021297,0.0017141086,0.0015678529,0.0007551656,0.003354762],"category_scores_gemma":[0.010114984,0.00053797895,0.00021779619,0.0011351249,0.0013007654,0.0040597133,0.0015698891,0.0013420512,0.00047712718],"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.0011227821,0.00042669664,0.0032155367,0.00037979532,0.000088389614,0.00029524774,0.00039135388,0.67793757,0.03150909,0.052991986,0.009764185,0.22187741],"study_design_scores_gemma":[0.000033942117,0.00024964812,0.0009143539,0.000030659467,0.00007155718,0.00011982006,0.00011499851,0.9518397,0.011746763,0.03196649,0.0028919242,0.000020140671],"about_ca_topic_score_codex":0.002408435,"about_ca_topic_score_gemma":0.002912631,"teacher_disagreement_score":0.003354762,"about_ca_system_score_codex":0.0016577148,"about_ca_system_score_gemma":0.000899329,"threshold_uncertainty_score":0.012027562},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022958739,0.0011654554,0.96883833,0.000900012,0.000246261,0.000096379175,0.00009816187,0.0017464394,0.0039502177],"genre_scores_gemma":[0.62069875,0.00058343034,0.37380818,0.0006211004,0.00013485955,0.00014703955,0.0001544476,0.00038465572,0.0034674064],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745923,0.0007737642,0.00015404812,0.00046984732,0.0008773769,0.00026563543],"domain_scores_gemma":[0.99641573,0.0014613733,0.00031459198,0.00093011494,0.00065122655,0.00022699765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004257469,0.0008839908,0.0010036506,0.000860048,0.0014254724,0.0031939493,0.0016861543,0.00092113606,0.0038957053],"category_scores_gemma":[0.014785491,0.0004531587,0.00039203675,0.0011787057,0.0021940114,0.0042047645,0.0020531877,0.0027826685,0.0008983048],"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.001903311,0.0003228842,0.0024384193,0.00024917696,0.00007458325,0.00019716483,0.00073564716,0.36502635,0.025055094,0.19786468,0.020779626,0.3853531],"study_design_scores_gemma":[0.00007485808,0.00012612541,0.00034780963,0.000048518767,0.00001796729,0.0000665361,0.00008885048,0.9178875,0.012482405,0.06240046,0.006400945,0.000057893183],"about_ca_topic_score_codex":0.0067061214,"about_ca_topic_score_gemma":0.0059266603,"teacher_disagreement_score":0.0067061214,"about_ca_system_score_codex":0.0026245483,"about_ca_system_score_gemma":0.0026506544,"threshold_uncertainty_score":0.022515953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06790839,0.00033016052,0.9256541,0.00025909112,0.00009107973,0.00022353162,0.00008340007,0.0017375728,0.003712704],"genre_scores_gemma":[0.8808098,0.00012745241,0.1169577,0.00012075876,0.00007022305,0.00014611964,0.000089318666,0.0000929072,0.0015857227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984053,0.0004275855,0.00009744459,0.00029523933,0.00048523457,0.00028923634],"domain_scores_gemma":[0.9961635,0.0014526285,0.0005219649,0.00087681226,0.0006635641,0.00032161144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028452424,0.0008445462,0.00085968216,0.0008257586,0.001225725,0.0010238498,0.0016437412,0.00057351467,0.0022335781],"category_scores_gemma":[0.005317176,0.0003191394,0.00045335942,0.0010227072,0.0011614049,0.0017920571,0.0018333818,0.0011358839,0.00033362527],"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.0006592555,0.00058393157,0.0062306346,0.0003093949,0.00016251032,0.0003661954,0.00078297337,0.5321321,0.07930285,0.13455239,0.010867197,0.23405057],"study_design_scores_gemma":[0.00007139989,0.00017630888,0.0010049712,0.0000137635225,0.000043998683,0.000099444995,0.000052914158,0.9639038,0.014908146,0.016304843,0.0033835215,0.00003690035],"about_ca_topic_score_codex":0.005204376,"about_ca_topic_score_gemma":0.006706315,"teacher_disagreement_score":0.005204376,"about_ca_system_score_codex":0.0015063,"about_ca_system_score_gemma":0.0026257718,"threshold_uncertainty_score":0.015047252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07367394,0.00054032117,0.9226712,0.0006668774,0.000060200116,0.000036747686,0.00020739617,0.0005357519,0.0016075555],"genre_scores_gemma":[0.9368507,0.00035964028,0.059469074,0.00020889203,0.000061622595,0.00010843617,0.00044195357,0.00014705873,0.0023526459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.00018154841,0.000028206228,0.00015482683,0.00013830942,0.00012654459],"domain_scores_gemma":[0.9918213,0.006307827,0.0005000894,0.00028060743,0.0007288571,0.0003612121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025529722,0.0012667069,0.0012349872,0.0008149026,0.00051228964,0.0011939616,0.0020230254,0.0015478292,0.0016437796],"category_scores_gemma":[0.013006992,0.0008428973,0.00071627233,0.0006170421,0.0014724686,0.0023950066,0.0015042968,0.003075864,0.00026621122],"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.000043728287,0.000011349594,0.00041227136,0.000016524717,0.000009728731,0.000012162202,0.000012732042,0.9922504,0.00021733317,0.003628405,0.00018847798,0.0031967836],"study_design_scores_gemma":[0.0000010153177,0.0000019407314,0.000021604088,0.000001503949,7.835201e-7,0.0000012082819,0.0000010130611,0.99838126,0.00006506498,0.0015008237,0.000022741084,9.5212863e-7],"about_ca_topic_score_codex":0.014419181,"about_ca_topic_score_gemma":0.012394315,"teacher_disagreement_score":0.014419181,"about_ca_system_score_codex":0.003619793,"about_ca_system_score_gemma":0.0023472726,"threshold_uncertainty_score":0.02867049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033354778,0.00065139146,0.95636606,0.00078944373,0.00016969792,0.000060338127,0.00018389554,0.00037421193,0.00805016],"genre_scores_gemma":[0.9741846,0.00028755685,0.021123584,0.000120511926,0.00009571275,0.00008967625,0.000093226234,0.00004289529,0.003962276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941015,0.00015004464,0.00002133666,0.00015440492,0.0001451124,0.0001190212],"domain_scores_gemma":[0.99874395,0.00069970044,0.00020050406,0.000073012256,0.00022113787,0.0000617323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013868032,0.0010497291,0.0008944128,0.0004190295,0.00044870275,0.0013243053,0.0012580671,0.0011634983,0.0033090587],"category_scores_gemma":[0.0040754294,0.00024164807,0.00054312765,0.0003791768,0.0011986004,0.00086127076,0.0011107816,0.0015015698,0.00020751734],"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.00025294107,0.00007922076,0.00034059802,0.00019899636,0.00006999553,0.00012351063,0.00010072783,0.80791813,0.0076025967,0.14311814,0.0033870523,0.03680803],"study_design_scores_gemma":[0.000009306521,0.00002201013,0.000057535006,0.0000039037554,0.0000046262626,0.000008914387,0.0000027931255,0.99270624,0.00030088227,0.006651214,0.0002276767,0.0000048421452],"about_ca_topic_score_codex":0.0076963096,"about_ca_topic_score_gemma":0.0036235906,"teacher_disagreement_score":0.0076963096,"about_ca_system_score_codex":0.0014286722,"about_ca_system_score_gemma":0.0014982919,"threshold_uncertainty_score":0.015303016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91332066,0.0002977178,0.0758979,0.00026967528,0.00006083759,0.0001644841,0.00013877869,0.00014354687,0.009706306],"genre_scores_gemma":[0.99212086,0.000071297625,0.006535448,0.00001149002,0.000008028873,0.000020080673,0.00004297655,0.000009911669,0.0011799057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987526,0.0004975422,0.000034973615,0.0001379692,0.00021229115,0.00036462015],"domain_scores_gemma":[0.9955113,0.003229359,0.00028528413,0.00022294871,0.00034677645,0.000404347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021475847,0.0006165777,0.00075472204,0.0010157146,0.001243343,0.0015835817,0.0014227383,0.0013072286,0.002315014],"category_scores_gemma":[0.0039743115,0.00035881664,0.0007815902,0.0013678226,0.0014940333,0.0014607107,0.00088944245,0.0007765919,0.00016003624],"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.0007471436,0.0005149524,0.0073007345,0.00014989643,0.000052024272,0.0018909205,0.00034908263,0.9285438,0.0028222138,0.035418764,0.0011601722,0.02105017],"study_design_scores_gemma":[0.000044771918,0.00020817967,0.00089924346,0.0000057030975,0.000026065414,0.00023810213,0.00047505717,0.98795474,0.00089550065,0.0085685635,0.0006679345,0.000016158057],"about_ca_topic_score_codex":0.008711672,"about_ca_topic_score_gemma":0.008382486,"teacher_disagreement_score":0.008711672,"about_ca_system_score_codex":0.001960061,"about_ca_system_score_gemma":0.0017083244,"threshold_uncertainty_score":0.017321944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050463457,0.0002380709,0.94234836,0.00034825725,0.00011036852,0.00013084656,0.000049260634,0.0023666108,0.00394469],"genre_scores_gemma":[0.7910411,0.00012798417,0.2048425,0.0004896142,0.00006201944,0.00013814576,0.00011385601,0.00018665717,0.0029981036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.00019488417,0.000043645905,0.0002086195,0.00016565871,0.00012594926],"domain_scores_gemma":[0.99769944,0.001127697,0.00025925876,0.0003012015,0.0004491259,0.00016330984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024780994,0.0011715223,0.0008693231,0.0005834859,0.00039856212,0.00074860704,0.0020088789,0.0010076056,0.001947097],"category_scores_gemma":[0.0074540786,0.0005066808,0.00044107632,0.00023750275,0.0010458411,0.0019325486,0.0015154638,0.0021036312,0.00032808376],"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.00018774635,0.00013793918,0.0019857492,0.00009493558,0.00006886085,0.00008314423,0.00017537927,0.8666089,0.0054374575,0.010455018,0.0028028695,0.111961894],"study_design_scores_gemma":[0.000023801349,0.000052537816,0.0000894424,0.00000850217,0.00000889724,0.000015440126,0.000011771077,0.99523634,0.0014427255,0.0024792333,0.00062452717,0.0000067703418],"about_ca_topic_score_codex":0.00573661,"about_ca_topic_score_gemma":0.006053739,"teacher_disagreement_score":0.00573661,"about_ca_system_score_codex":0.00088752754,"about_ca_system_score_gemma":0.0016313429,"threshold_uncertainty_score":0.013105571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96059257,0.0011146425,0.024176136,0.0001774554,0.00028617177,0.00033530846,0.0005906201,0.0044387425,0.00828829],"genre_scores_gemma":[0.99140716,0.00015280214,0.006472839,0.00004470194,0.000037832797,0.000060961032,0.00076701073,0.0000848369,0.0009718264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972458,0.000909415,0.00019345887,0.00037303584,0.0008678539,0.0004104815],"domain_scores_gemma":[0.9945662,0.0014983601,0.0002802822,0.00085988536,0.0022776385,0.00051756756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038941584,0.0012286309,0.00091744156,0.0013645445,0.00061054726,0.0010467411,0.0012993515,0.0007009209,0.001163679],"category_scores_gemma":[0.0060062115,0.00027279003,0.00024198675,0.0012093413,0.00044200945,0.0012282676,0.0006028196,0.00082310446,0.00027205655],"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.016191607,0.0037981905,0.04183859,0.0011767716,0.0007582881,0.0011259619,0.0008803124,0.37224492,0.26527825,0.008082766,0.01533762,0.2732867],"study_design_scores_gemma":[0.00035443855,0.007572436,0.017443424,0.0000276049,0.00012172165,0.0005976227,0.00011719038,0.92738485,0.041465186,0.0005560881,0.004264658,0.00009482721],"about_ca_topic_score_codex":0.005370935,"about_ca_topic_score_gemma":0.0019159346,"teacher_disagreement_score":0.005370935,"about_ca_system_score_codex":0.0010219392,"about_ca_system_score_gemma":0.000795053,"threshold_uncertainty_score":0.020594537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04648288,0.0041182414,0.47679293,0.07277366,0.0040988554,0.00048815852,0.0004195239,0.0023053656,0.39252043],"genre_scores_gemma":[0.83896846,0.0014226183,0.0754643,0.008211108,0.0023112227,0.00063935947,0.00016238469,0.0009306529,0.07188994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99334383,0.0020571912,0.0002612324,0.0014437422,0.0014701004,0.0014238702],"domain_scores_gemma":[0.9567821,0.023024352,0.0019675384,0.009615349,0.006489952,0.0021207528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011023828,0.0008868369,0.0011852782,0.0010869318,0.004248717,0.010559757,0.0063960375,0.010550305,0.03698412],"category_scores_gemma":[0.05887212,0.0014106091,0.00094294973,0.0008694565,0.0071916734,0.026048725,0.0054094675,0.010222284,0.006088968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016265757,0.000058588455,0.0010853269,0.00006157481,0.000013991657,0.00076414447,0.0006673274,0.003884056,0.0011204145,0.9667448,0.008218446,0.017218618],"study_design_scores_gemma":[0.00013074116,0.00006536867,0.00051074394,0.00020446081,0.00005465196,0.0010786259,0.0007620074,0.058219273,0.0025985811,0.8500938,0.08619109,0.00009070376],"about_ca_topic_score_codex":0.005589954,"about_ca_topic_score_gemma":0.0031296248,"teacher_disagreement_score":0.03698412,"about_ca_system_score_codex":0.0033749826,"about_ca_system_score_gemma":0.003232546,"threshold_uncertainty_score":0.12372422},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062198583,0.00083106465,0.056415193,0.005450105,0.002287373,0.0023801627,0.011267895,0.058264155,0.80090547],"genre_scores_gemma":[0.12070848,0.0006288252,0.04117066,0.0016660938,0.00023436554,0.0008856477,0.008742776,0.005526967,0.82043624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768674,0.00014252898,0.000056385154,0.00034714007,0.0011391564,0.0006280876],"domain_scores_gemma":[0.9939162,0.0002577048,0.00008888443,0.0004917785,0.0039991476,0.0012462131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012981935,0.0009650637,0.000538903,0.0018176775,0.0035929077,0.0037525052,0.0018018398,0.0013665602,0.27907312],"category_scores_gemma":[0.0028904674,0.0006831894,0.0005945873,0.0017588533,0.00072268175,0.0024530361,0.002931262,0.0017537535,0.08897141],"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.0009509548,0.00039257307,0.00674044,0.00021778919,0.00001527875,0.0006823189,0.001447815,0.0012170542,0.019542964,0.016632423,0.6795938,0.27256656],"study_design_scores_gemma":[0.0000853606,0.00010662843,0.00378481,0.00008962494,0.000021312715,0.0002540152,0.00067363295,0.0036655767,0.0056599346,0.0007164637,0.98485315,0.00008933148],"about_ca_topic_score_codex":0.37565392,"about_ca_topic_score_gemma":0.42365286,"teacher_disagreement_score":0.6243461,"about_ca_system_score_codex":0.007324744,"about_ca_system_score_gemma":0.018740764,"threshold_uncertainty_score":0.93359256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038038376,0.0008311356,0.967996,0.0022634943,0.00024054143,0.00019497742,0.0008435593,0.0012080421,0.022618521],"genre_scores_gemma":[0.1931189,0.003456967,0.77336127,0.00081655325,0.0004720706,0.0013999923,0.0020803998,0.00051449134,0.024779363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998855,0.00049774087,0.000055111886,0.00017112699,0.0003439079,0.0000770693],"domain_scores_gemma":[0.9987979,0.0006042127,0.00010839427,0.0002487581,0.00018075267,0.000059968424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018185576,0.0014464752,0.00091498584,0.001148022,0.0011645722,0.0035692828,0.0032202855,0.002978415,0.00747897],"category_scores_gemma":[0.0051134694,0.0006591201,0.0010160911,0.003452987,0.0015629511,0.004153239,0.0014060751,0.0024623699,0.0036649813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449004,0.00004711025,0.000306813,0.000086298845,0.000028657754,0.00014412616,0.000110257126,0.3169018,0.0006207162,0.6481882,0.010387783,0.023113754],"study_design_scores_gemma":[0.000043305674,0.000028969436,0.00009962751,0.000022636721,0.000017402304,0.00007473849,0.000018944938,0.67758125,0.00030532412,0.28406584,0.037724935,0.000017011114],"about_ca_topic_score_codex":0.00769993,"about_ca_topic_score_gemma":0.0063176593,"teacher_disagreement_score":0.00769993,"about_ca_system_score_codex":0.0022986117,"about_ca_system_score_gemma":0.0019060567,"threshold_uncertainty_score":0.025019705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010770094,0.008206285,0.95756596,0.0039710463,0.003945633,0.00016955906,0.00013992352,0.004286481,0.0109450575],"genre_scores_gemma":[0.57193,0.009658683,0.39303157,0.0033468595,0.008179874,0.00029526424,0.00024866543,0.0027729403,0.010536103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648917,0.0009644979,0.0001567464,0.0005485035,0.0015943823,0.00024670042],"domain_scores_gemma":[0.9930282,0.003549079,0.00025697687,0.0011536924,0.0017966835,0.0002153397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060570943,0.0017566093,0.0014971694,0.0013282918,0.00092485914,0.0035769478,0.0041927546,0.0016028779,0.0022742092],"category_scores_gemma":[0.021507775,0.0007620887,0.0006510408,0.0011685721,0.0023514347,0.0056344527,0.002194215,0.005009331,0.00090986706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041808077,0.0002744347,0.0015920565,0.0008512031,0.000147899,0.00025585407,0.0002832669,0.25966167,0.007277096,0.21466738,0.03586756,0.47870347],"study_design_scores_gemma":[0.000072266936,0.00012785169,0.00016237515,0.00010851521,0.00009255704,0.00009857195,0.00002334758,0.92465043,0.0040730094,0.042654708,0.027890444,0.000045880406],"about_ca_topic_score_codex":0.0057464447,"about_ca_topic_score_gemma":0.004405529,"teacher_disagreement_score":0.0060570943,"about_ca_system_score_codex":0.0016807978,"about_ca_system_score_gemma":0.0020555535,"threshold_uncertainty_score":0.032033384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.561546,0.0032218806,0.4211052,0.0002535924,0.00011222754,0.0005484412,0.00019474243,0.00469,0.008327939],"genre_scores_gemma":[0.9104711,0.0011339518,0.08664429,0.000048683083,0.000051677427,0.00007383392,0.00013737018,0.00014611604,0.0012930254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.00013157816,0.000025410158,0.000068476635,0.00023598778,0.000075461554],"domain_scores_gemma":[0.99914014,0.00033192008,0.00007588786,0.00012201343,0.00027706948,0.00005298539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052749226,0.0005352012,0.00025773328,0.00060583604,0.00036809398,0.0005879864,0.0008438801,0.00037806097,0.0005080565],"category_scores_gemma":[0.0024535847,0.00020068091,0.00022645036,0.0005819144,0.00032946662,0.0010154088,0.0005404302,0.00058656745,0.00010984493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006715749,0.0003550526,0.009041835,0.00084926235,0.00018818669,0.0009037204,0.0006216184,0.189732,0.3621275,0.008326519,0.00242691,0.4247558],"study_design_scores_gemma":[0.000058816386,0.0016969049,0.010639415,0.00007768785,0.00021100816,0.002067192,0.00025222215,0.7792821,0.1790182,0.0029711507,0.02361224,0.00011307601],"about_ca_topic_score_codex":0.003498089,"about_ca_topic_score_gemma":0.0019530766,"teacher_disagreement_score":0.003498089,"about_ca_system_score_codex":0.00049823895,"about_ca_system_score_gemma":0.00049348245,"threshold_uncertainty_score":0.006955445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22373378,0.03216717,0.6481418,0.0019581567,0.0023748225,0.002713756,0.00048567532,0.017582012,0.07084271],"genre_scores_gemma":[0.8516911,0.0040466394,0.137045,0.00056467036,0.00047532917,0.0004491395,0.0004351566,0.00029544978,0.0049974453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634224,0.0006374306,0.00024870917,0.0004618675,0.0019545653,0.0003551969],"domain_scores_gemma":[0.9965521,0.0006663668,0.00024865317,0.00061446155,0.0017035779,0.00021488212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032863254,0.0008393339,0.0007431747,0.001154451,0.00091223774,0.002468111,0.0024569738,0.0008843649,0.001146782],"category_scores_gemma":[0.007991759,0.0005844577,0.00037080827,0.0008166046,0.0005645343,0.002917206,0.0013840233,0.0021715476,0.000408598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012637898,0.00092039915,0.013073691,0.0017734434,0.00045020215,0.0008284541,0.00067312026,0.09187082,0.06990489,0.052290633,0.022096187,0.7448544],"study_design_scores_gemma":[0.00029263727,0.001687326,0.005978537,0.0003402995,0.00088464597,0.002234549,0.00024861563,0.7447567,0.10537631,0.016687894,0.12117784,0.00033472152],"about_ca_topic_score_codex":0.003173776,"about_ca_topic_score_gemma":0.0030309674,"teacher_disagreement_score":0.0032863254,"about_ca_system_score_codex":0.0013291946,"about_ca_system_score_gemma":0.0016259429,"threshold_uncertainty_score":0.01738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17471087,0.0015639932,0.81485265,0.00053814746,0.00013531624,0.000119865035,0.0000434879,0.00080161553,0.007234073],"genre_scores_gemma":[0.98795485,0.00018786761,0.01081202,0.000041985106,0.000018193019,0.00004294646,0.00002280208,0.000013587027,0.0009057594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989506,0.00031633698,0.000047725138,0.0001895279,0.00026707078,0.00022864806],"domain_scores_gemma":[0.99650216,0.002073613,0.00026706766,0.00010596718,0.00090434117,0.00014689821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023436975,0.0007392901,0.00093418075,0.00062120246,0.0006392216,0.0009782508,0.0010648901,0.000695306,0.0016791023],"category_scores_gemma":[0.005721698,0.00026204388,0.00040373008,0.0003687977,0.0007535237,0.0008792024,0.00072352006,0.0010940415,0.00016695418],"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.00014890125,0.000092127564,0.0018619004,0.000057725512,0.00003565205,0.000034485194,0.00005156988,0.9667898,0.0012004419,0.005196684,0.00045729903,0.024073433],"study_design_scores_gemma":[0.000004535001,0.000021939677,0.000073077594,0.0000010917247,0.0000025696881,0.000003253053,0.0000019491597,0.99949,0.00009971877,0.00027885323,0.000021250797,0.000001655687],"about_ca_topic_score_codex":0.014017196,"about_ca_topic_score_gemma":0.0039047196,"teacher_disagreement_score":0.014017196,"about_ca_system_score_codex":0.001372579,"about_ca_system_score_gemma":0.0020448247,"threshold_uncertainty_score":0.027871192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12101869,0.00013597656,0.8711494,0.00033428273,0.00007412996,0.0001531737,0.00006609643,0.0013553593,0.0057129785],"genre_scores_gemma":[0.9358022,0.00012303572,0.061902553,0.00009047987,0.000023920036,0.000060616152,0.000060763392,0.0000918299,0.001844597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.00028347655,0.000036627276,0.00018796272,0.00036900557,0.00019632926],"domain_scores_gemma":[0.9983986,0.00071691343,0.00022859387,0.0003601005,0.00021484976,0.000080925274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008413891,0.0007516648,0.0006085113,0.0004059002,0.0005294863,0.001130115,0.0010607364,0.00083973666,0.0011152385],"category_scores_gemma":[0.004713727,0.00034563112,0.00035816868,0.00025968507,0.0007500806,0.0015304054,0.0011323434,0.0012276734,0.00033676912],"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.00008790306,0.00009990728,0.0022780986,0.000057217516,0.000022028516,0.00023145154,0.000114805414,0.90408796,0.011206284,0.018673934,0.0014687066,0.061671738],"study_design_scores_gemma":[0.00000758522,0.000040892683,0.00023156991,0.0000057462084,0.0000074850977,0.000042982585,0.000035601915,0.98461443,0.0033055923,0.010270582,0.0014308806,0.000006596995],"about_ca_topic_score_codex":0.002116795,"about_ca_topic_score_gemma":0.0018970149,"teacher_disagreement_score":0.002116795,"about_ca_system_score_codex":0.0005801553,"about_ca_system_score_gemma":0.0010951547,"threshold_uncertainty_score":0.0044497848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119000115,0.007371103,0.037607327,0.067694776,0.0019579886,0.0000637698,0.00023483743,0.0009549023,0.7651152],"genre_scores_gemma":[0.8953689,0.0035561428,0.00774463,0.0043354346,0.0008830889,0.00007970024,0.000102052065,0.0005093114,0.08742062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985569,0.0005403225,0.000035619578,0.00020455843,0.00040512692,0.00025755903],"domain_scores_gemma":[0.9979709,0.00066100556,0.00021298672,0.00045154133,0.00026653544,0.00043711998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471685,0.00025767993,0.00034201014,0.0017274455,0.005270091,0.015696539,0.0008876828,0.002738951,0.011372491],"category_scores_gemma":[0.004318877,0.0004559739,0.0003989447,0.0016730378,0.013969831,0.018924154,0.0051823724,0.0034596354,0.0013061819],"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.000027492528,0.000015173871,0.00033842245,0.000024219857,0.0000029664052,0.0002361441,0.005811782,0.0002621786,0.00023173285,0.9616798,0.013655358,0.017714784],"study_design_scores_gemma":[0.000018443368,0.000024109073,0.00065902085,0.00025166254,0.000008342701,0.0003979606,0.010371497,0.0011057409,0.00033431523,0.3542039,0.6325889,0.00003609652],"about_ca_topic_score_codex":0.0046831914,"about_ca_topic_score_gemma":0.0054250904,"teacher_disagreement_score":0.015696539,"about_ca_system_score_codex":0.0026142448,"about_ca_system_score_gemma":0.0023218223,"threshold_uncertainty_score":0.03804475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13102797,0.00028938946,0.8652351,0.00025332198,0.000051873587,0.00011150468,0.000014246351,0.000620396,0.0023962304],"genre_scores_gemma":[0.97934365,0.00004823884,0.019990852,0.00003798031,0.00001293411,0.000043353746,0.000009138131,0.000013524422,0.0005002789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992368,0.00030777595,0.00003288587,0.00014118223,0.00014685895,0.00013446559],"domain_scores_gemma":[0.99754626,0.0012910911,0.00030166865,0.00016379541,0.00046238283,0.00023484233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017926908,0.000518887,0.00088942685,0.00042691032,0.0005686347,0.0009325094,0.0014019575,0.00069973985,0.00054928043],"category_scores_gemma":[0.0037971386,0.0002646781,0.00041010173,0.00031855848,0.001130765,0.000682675,0.001349994,0.0011082465,0.00009802749],"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.000104652216,0.00009888837,0.0011107922,0.000028446053,0.00003105894,0.00006211797,0.00006338719,0.96996707,0.002957342,0.0031323668,0.00034926817,0.022094691],"study_design_scores_gemma":[0.0000050079875,0.000018092285,0.00005992088,0.0000013277796,0.0000026149833,0.0000036553643,0.0000034147242,0.99896014,0.00031599475,0.00057797146,0.000049639308,0.000002188767],"about_ca_topic_score_codex":0.007960888,"about_ca_topic_score_gemma":0.0041697514,"teacher_disagreement_score":0.007960888,"about_ca_system_score_codex":0.0012442091,"about_ca_system_score_gemma":0.0012254898,"threshold_uncertainty_score":0.015829086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008406505,0.0004765374,0.97061116,0.0007195435,0.000059223377,0.000075405136,0.0000720094,0.00009133842,0.01948831],"genre_scores_gemma":[0.7392337,0.0013393739,0.24011597,0.0002945239,0.00021215064,0.00042426592,0.00007568765,0.00012901034,0.018175365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986505,0.00059724704,0.000039958526,0.00017841176,0.0003374774,0.00019632294],"domain_scores_gemma":[0.99896467,0.0005344601,0.00008530412,0.000107450374,0.00021023242,0.000098015014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242912,0.0009317905,0.0010239006,0.000753555,0.0009862318,0.0019880428,0.0021821184,0.0013356737,0.005297848],"category_scores_gemma":[0.0040477966,0.0005244786,0.0011367248,0.000732093,0.002483708,0.0034452707,0.002172365,0.0022755556,0.0006397073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015992988,0.000022621582,0.000060178838,0.00003695611,0.000009928084,0.00004555326,0.000073342446,0.09867523,0.0006364229,0.8932926,0.0012351377,0.0058961017],"study_design_scores_gemma":[0.000013247494,0.000027891685,0.000053437878,0.000015249546,0.000008467956,0.000041102605,0.000031215644,0.5847032,0.00024361491,0.41148618,0.0033612829,0.000015097289],"about_ca_topic_score_codex":0.0039733057,"about_ca_topic_score_gemma":0.0029541927,"teacher_disagreement_score":0.005297848,"about_ca_system_score_codex":0.0037342722,"about_ca_system_score_gemma":0.002480092,"threshold_uncertainty_score":0.027094185},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4576565,0.0031217074,0.46999922,0.0032810133,0.0008386942,0.0008112261,0.00272093,0.0037120155,0.05785873],"genre_scores_gemma":[0.9194985,0.0012091645,0.074178845,0.00015573083,0.00018030567,0.00012387063,0.0012299056,0.00011316237,0.0033105272],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947344,0.002357811,0.00028457286,0.0004809466,0.001913619,0.00022864304],"domain_scores_gemma":[0.9934342,0.0026312466,0.0010307425,0.0009743209,0.0016870694,0.00024240049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033631586,0.0009147043,0.0007016058,0.0025808453,0.00062147307,0.0019064876,0.0013705206,0.0010899579,0.001442048],"category_scores_gemma":[0.020341683,0.00029915536,0.00028574097,0.0030698502,0.0005305262,0.0031651934,0.00069458043,0.00087202387,0.0009706602],"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.00037492494,0.0006266644,0.19562018,0.0004623797,0.00023008864,0.00019990867,0.0008603555,0.10389489,0.02859647,0.047055513,0.022917282,0.5991613],"study_design_scores_gemma":[0.000028988607,0.0009051181,0.12483559,0.00019558123,0.00018079097,0.0009722737,0.0019700048,0.71493423,0.058188137,0.0537439,0.043751787,0.00029358277],"about_ca_topic_score_codex":0.0050175707,"about_ca_topic_score_gemma":0.0050726943,"teacher_disagreement_score":0.0050175707,"about_ca_system_score_codex":0.0010122745,"about_ca_system_score_gemma":0.0009482003,"threshold_uncertainty_score":0.017786324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010491445,0.0004862814,0.9853683,0.00018458147,0.00012616302,0.000093116876,0.000040286453,0.0024177707,0.0007920261],"genre_scores_gemma":[0.5154095,0.00038322675,0.48095152,0.0004211207,0.00015380929,0.00024308506,0.0002048741,0.00014212803,0.0020907542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989272,0.00024975403,0.00008729314,0.00026938922,0.0003894584,0.000076860095],"domain_scores_gemma":[0.9986235,0.00052064785,0.00031154658,0.00015034335,0.00033125997,0.000062736595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020028176,0.0009451633,0.0010708944,0.0013049286,0.00045753896,0.0008933742,0.0033868544,0.0011581315,0.000712808],"category_scores_gemma":[0.004696239,0.00034269327,0.0005312726,0.00063496816,0.0007117321,0.0013463162,0.0013257262,0.001612774,0.0003293941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052596047,0.00031163788,0.0030469229,0.00028614048,0.00020491508,0.00018189452,0.00020196216,0.42720035,0.037281353,0.016400808,0.0050308425,0.50932723],"study_design_scores_gemma":[0.00005184454,0.00008924635,0.00023069381,0.000007146476,0.000016515514,0.000053365988,0.000008877865,0.9915748,0.004597478,0.0018266727,0.0015176445,0.000025749072],"about_ca_topic_score_codex":0.002014279,"about_ca_topic_score_gemma":0.0011074387,"teacher_disagreement_score":0.0033868544,"about_ca_system_score_codex":0.00090394623,"about_ca_system_score_gemma":0.0010547638,"threshold_uncertainty_score":0.010592043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40549967,0.00031843447,0.46154246,0.0005013071,0.00033458322,0.0009318252,0.0014986574,0.115214676,0.014158438],"genre_scores_gemma":[0.862724,0.00016605064,0.12506196,0.00025455962,0.00006960587,0.00035198545,0.001791288,0.0027049293,0.006875585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989164,0.00017815318,0.000098797354,0.00020873912,0.00044093208,0.00015700162],"domain_scores_gemma":[0.99725795,0.0006670467,0.00015415237,0.0008887961,0.0008290043,0.00020297468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021284048,0.00093582214,0.00050868036,0.00067882123,0.0006961036,0.0017315296,0.0020160847,0.00043900366,0.0048927763],"category_scores_gemma":[0.006023099,0.00046999173,0.00039545906,0.00059504766,0.00068515463,0.0023988239,0.0010691059,0.001172321,0.0009733582],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006017682,0.002095264,0.051714018,0.00077112584,0.00036910985,0.0010674249,0.0008965688,0.23144431,0.2776345,0.024690066,0.054590892,0.34870902],"study_design_scores_gemma":[0.0002604611,0.00044573558,0.0043497644,0.00003621899,0.000066607645,0.00017606057,0.00011620535,0.79970515,0.17053327,0.0033598288,0.020871025,0.00007974758],"about_ca_topic_score_codex":0.008754694,"about_ca_topic_score_gemma":0.006828546,"teacher_disagreement_score":0.008754694,"about_ca_system_score_codex":0.0018105739,"about_ca_system_score_gemma":0.0019565523,"threshold_uncertainty_score":0.017407477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049613148,0.0019072323,0.9419498,0.00070366496,0.00017733486,0.000080312835,0.000036289428,0.00033187534,0.0052004443],"genre_scores_gemma":[0.94851536,0.0014260616,0.04699635,0.0000922444,0.00014288058,0.000116851304,0.000037899037,0.00003570145,0.0026366282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890184,0.00037576223,0.000049126018,0.00013322417,0.00043706232,0.000102930964],"domain_scores_gemma":[0.9980751,0.0012160009,0.00021000596,0.0001435094,0.00029433245,0.00006100039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022867087,0.00050382037,0.0004253539,0.0006930524,0.00070036494,0.0014602246,0.0013154717,0.00074271945,0.0011329203],"category_scores_gemma":[0.006339919,0.00028969094,0.00028968265,0.0006570425,0.0017929297,0.0024982092,0.00062968326,0.0010652528,0.00010739861],"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.000092475835,0.000074657386,0.00073477963,0.00015117608,0.00004071714,0.00013486255,0.00016765585,0.53683835,0.006553199,0.40795612,0.0021878865,0.045068134],"study_design_scores_gemma":[0.000024085039,0.000038365604,0.00018569324,0.0000103253515,0.00001583502,0.000039861625,0.000016512047,0.89756364,0.0014083476,0.09797758,0.0027074295,0.000012333173],"about_ca_topic_score_codex":0.004125555,"about_ca_topic_score_gemma":0.002540827,"teacher_disagreement_score":0.004125555,"about_ca_system_score_codex":0.002150673,"about_ca_system_score_gemma":0.001241115,"threshold_uncertainty_score":0.015604258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14195715,0.0013157021,0.83034575,0.0011872823,0.000821201,0.0004176102,0.00010998728,0.0036891934,0.020156085],"genre_scores_gemma":[0.978448,0.00015045986,0.018149985,0.00009010669,0.00016899887,0.00006966159,0.000040689323,0.000057667065,0.0028244164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856526,0.00028405563,0.00006835251,0.00018036038,0.00048586438,0.00041616682],"domain_scores_gemma":[0.99681747,0.0013759057,0.0001916692,0.0003353844,0.0010823823,0.0001971488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017170552,0.00063805905,0.0009117724,0.0011798987,0.0020604332,0.0024357268,0.0015105193,0.00069417054,0.0034878398],"category_scores_gemma":[0.0066912253,0.0003111505,0.00025794198,0.0008646865,0.001139268,0.001254653,0.001148785,0.002034666,0.0003972841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019382915,0.0009838805,0.0036235799,0.00018481772,0.00012474827,0.00046398432,0.00064161565,0.30299544,0.041841168,0.13184896,0.019720744,0.49563274],"study_design_scores_gemma":[0.00003872082,0.00007923342,0.00045007525,0.000007482274,0.000037030633,0.000051904048,0.000033238775,0.9804011,0.0036720869,0.013533908,0.0016752405,0.00002001925],"about_ca_topic_score_codex":0.010449848,"about_ca_topic_score_gemma":0.012727877,"teacher_disagreement_score":0.010449848,"about_ca_system_score_codex":0.0020975322,"about_ca_system_score_gemma":0.0018573172,"threshold_uncertainty_score":0.02077806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3666518,0.0065546534,0.5844599,0.00132754,0.00027493434,0.00035206752,0.0016393308,0.012642274,0.026097486],"genre_scores_gemma":[0.9018791,0.0015010171,0.09236678,0.0001919626,0.000083290055,0.00013367274,0.0009798531,0.00027177433,0.0025925087],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866664,0.00030851492,0.00006073872,0.000303484,0.00041396928,0.00024676815],"domain_scores_gemma":[0.99420905,0.002362976,0.0009272381,0.00082984497,0.001417962,0.00025292844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020880448,0.0008605041,0.001091031,0.004744943,0.0012786849,0.0021907173,0.0015853401,0.0016908057,0.0027860447],"category_scores_gemma":[0.011916868,0.00069297774,0.00040622984,0.0016672655,0.0006885175,0.004229139,0.00225325,0.0009931788,0.001300849],"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.0011017213,0.0003726979,0.06734625,0.0011396967,0.0002649903,0.0014075375,0.0019367158,0.16762018,0.05339331,0.071899034,0.032364774,0.6011531],"study_design_scores_gemma":[0.00011780309,0.00048900064,0.021832101,0.00037183653,0.00033609488,0.002351855,0.0013954745,0.7866066,0.07125564,0.07073628,0.04426707,0.00024025001],"about_ca_topic_score_codex":0.0027409743,"about_ca_topic_score_gemma":0.001890314,"teacher_disagreement_score":0.004744943,"about_ca_system_score_codex":0.0013066243,"about_ca_system_score_gemma":0.0011853087,"threshold_uncertainty_score":0.011042714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06231643,0.0030096807,0.9221378,0.00064262375,0.00013634238,0.00009849994,0.000055646473,0.00030050112,0.011302561],"genre_scores_gemma":[0.95181656,0.0021511193,0.044275448,0.00013496233,0.00012106696,0.00008626773,0.000037138794,0.00007881674,0.0012986538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657875,0.00124915,0.00013973129,0.00030272073,0.0012252491,0.00050447846],"domain_scores_gemma":[0.98973686,0.008095599,0.0006236089,0.00051165564,0.00083949685,0.00019285866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041367332,0.001000706,0.001003087,0.0011945178,0.00077384314,0.001810286,0.0015187387,0.0008035164,0.0009669583],"category_scores_gemma":[0.020662531,0.0005695712,0.0007280053,0.0014096824,0.002624556,0.0032460222,0.0018498235,0.0021874262,0.00023602079],"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.00030785135,0.00011313527,0.0009790487,0.00025007548,0.000031395986,0.00029345672,0.0003352447,0.7155115,0.014698211,0.23896542,0.0008106093,0.027704094],"study_design_scores_gemma":[0.000010966658,0.0000617019,0.00009942216,0.000038455073,0.000014662952,0.00005509202,0.000032756478,0.96459645,0.002573313,0.031856976,0.00064006215,0.000020225418],"about_ca_topic_score_codex":0.0036691048,"about_ca_topic_score_gemma":0.0015974126,"teacher_disagreement_score":0.0041367332,"about_ca_system_score_codex":0.0031780922,"about_ca_system_score_gemma":0.0018267315,"threshold_uncertainty_score":0.023058772},"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":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36297083,0.29815775,0.097033635,0.025825512,0.002616135,0.00016638779,0.0006694138,0.0017035388,0.21085681],"genre_scores_gemma":[0.9157594,0.049290247,0.021682821,0.00095102325,0.0009908911,0.000056765854,0.00033849326,0.00016774346,0.01076264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771154,0.0005058772,0.000113378774,0.00031612636,0.001047991,0.0003051049],"domain_scores_gemma":[0.9928725,0.0017870244,0.00054033555,0.0005621127,0.0036859298,0.0005520952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004353215,0.00045120012,0.00041372274,0.002009266,0.00070379337,0.004310507,0.0010458834,0.001588222,0.0031516715],"category_scores_gemma":[0.009401543,0.0002975165,0.00022749712,0.0027495553,0.001297929,0.00902944,0.000860141,0.0017582747,0.0010609087],"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.0010136287,0.00040394743,0.02082519,0.0008275809,0.000040896655,0.0005909109,0.0010249424,0.017231075,0.018543832,0.16523468,0.022301752,0.7519616],"study_design_scores_gemma":[0.00008595503,0.0027983973,0.03893523,0.0016891671,0.00028590043,0.0040741847,0.002866209,0.37922493,0.058802366,0.12635326,0.384237,0.0006474995],"about_ca_topic_score_codex":0.0035661485,"about_ca_topic_score_gemma":0.0013028341,"teacher_disagreement_score":0.004353215,"about_ca_system_score_codex":0.0022244786,"about_ca_system_score_gemma":0.0016196381,"threshold_uncertainty_score":0.023022234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.590118,0.0007015931,0.39668712,0.00023966067,0.00010827885,0.000114967035,0.00012888905,0.0076299235,0.0042715683],"genre_scores_gemma":[0.9523077,0.00013363572,0.04615452,0.000044993256,0.000017366576,0.000034557524,0.00006457365,0.0001056818,0.0011369988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985574,0.0003459345,0.00008536292,0.00016777286,0.0006306208,0.00021291278],"domain_scores_gemma":[0.9929261,0.0034293714,0.00075665367,0.0011873079,0.0015663044,0.00013428034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015509179,0.0007504831,0.0004683984,0.0009796167,0.00061861466,0.000999955,0.0012236078,0.00039131704,0.0010909131],"category_scores_gemma":[0.009399394,0.00025503585,0.00016077238,0.0010788327,0.0006877774,0.0020059186,0.0007521556,0.00067205465,0.00019854281],"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.00089569273,0.00033276656,0.0111361155,0.0002738672,0.00007890124,0.00045077706,0.00026491086,0.6617807,0.08276221,0.010999651,0.0027379745,0.22828639],"study_design_scores_gemma":[0.000030589417,0.00025456087,0.00096907554,0.000013998632,0.000023690272,0.00012168981,0.000036504018,0.9426115,0.052155294,0.0024171514,0.0013458317,0.000020105099],"about_ca_topic_score_codex":0.006115627,"about_ca_topic_score_gemma":0.0064536426,"teacher_disagreement_score":0.006115627,"about_ca_system_score_codex":0.0011232262,"about_ca_system_score_gemma":0.001909625,"threshold_uncertainty_score":0.012160063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008638437,0.000104781284,0.9899457,0.0001508767,0.00001366936,0.000028206825,0.000041910098,0.00042698914,0.0006494237],"genre_scores_gemma":[0.56313473,0.00023676959,0.433598,0.00019472875,0.00006685081,0.00022083153,0.0003274222,0.00028537255,0.0019353039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752086,0.0010165187,0.00011167419,0.00068538944,0.00042178654,0.0002437333],"domain_scores_gemma":[0.97823787,0.017270274,0.0013557009,0.0017794962,0.0009306414,0.00042616366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036644586,0.0014414384,0.0017471926,0.0012799315,0.00087756483,0.0014291682,0.0031031272,0.0019873164,0.0030880768],"category_scores_gemma":[0.029533481,0.0010781751,0.0009514001,0.0012366611,0.0023025374,0.0042793746,0.002929455,0.0037765955,0.00048594867],"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.00016244428,0.00007770605,0.0015416826,0.00010665006,0.000042230484,0.00008332747,0.00015763676,0.9104083,0.0013642631,0.029937262,0.0011816248,0.054936785],"study_design_scores_gemma":[0.0000123174295,0.000016666085,0.00009569382,0.000009665885,0.0000062166,0.00001869866,0.000011528725,0.9795904,0.00068308756,0.019302562,0.00024632624,0.0000067535725],"about_ca_topic_score_codex":0.007150798,"about_ca_topic_score_gemma":0.006311903,"teacher_disagreement_score":0.007150798,"about_ca_system_score_codex":0.0022160248,"about_ca_system_score_gemma":0.0027042055,"threshold_uncertainty_score":0.019379795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13375194,0.00084360247,0.854875,0.00064887357,0.00014367943,0.00013729966,0.00009381911,0.0026548943,0.00685089],"genre_scores_gemma":[0.5569256,0.00060556224,0.4396302,0.0001245929,0.00010836367,0.00007963413,0.000208435,0.00019433233,0.0021233803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.0003346288,0.0000510253,0.0001564764,0.00035156493,0.00012404346],"domain_scores_gemma":[0.998698,0.00054641,0.00011422566,0.00031701013,0.00027554372,0.000048897637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001969354,0.00060406304,0.00056965783,0.0013576373,0.00068287406,0.0009192943,0.0007866559,0.0006597677,0.0011221734],"category_scores_gemma":[0.0039930954,0.00021318796,0.00039389593,0.0011440379,0.000541913,0.0017413169,0.0012731816,0.0009641268,0.00035360458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033598032,0.00042809863,0.0051759277,0.00025668374,0.000092539834,0.00022399309,0.00048034659,0.33059984,0.044368804,0.06321401,0.0078969095,0.54692686],"study_design_scores_gemma":[0.000046333127,0.00024449825,0.0013564986,0.000016829741,0.000046410958,0.0002140529,0.000053940956,0.9599652,0.019105032,0.014065309,0.0048678922,0.000017959077],"about_ca_topic_score_codex":0.0022064259,"about_ca_topic_score_gemma":0.0025002703,"teacher_disagreement_score":0.0022064259,"about_ca_system_score_codex":0.00061664503,"about_ca_system_score_gemma":0.0012502493,"threshold_uncertainty_score":0.010415077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03686516,0.0014417956,0.93787247,0.0019448695,0.0007819618,0.00032422712,0.0008953124,0.0010761351,0.018798025],"genre_scores_gemma":[0.8420151,0.00079623534,0.14834183,0.0004234016,0.00037132774,0.0002752196,0.0006102186,0.00026868522,0.006898138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863476,0.0003967832,0.00007395279,0.00032825037,0.00028317168,0.00028301892],"domain_scores_gemma":[0.995955,0.0019690713,0.0004239411,0.00039443947,0.0008326296,0.00042496683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024783234,0.0010402674,0.0012003073,0.0010689792,0.0008322892,0.001962274,0.002470782,0.00084746606,0.006608891],"category_scores_gemma":[0.012261633,0.00042687796,0.00044411488,0.0018045763,0.00060668716,0.0026003667,0.0015514311,0.0017175776,0.0007132079],"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.00019517665,0.00015103095,0.002233295,0.00020168933,0.00003863869,0.00013838366,0.000106926665,0.83296824,0.0010814257,0.04051442,0.010268415,0.11210235],"study_design_scores_gemma":[0.000009508281,0.000026286101,0.00012347697,0.000010167477,0.0000081817425,0.000018730607,0.000035168152,0.989749,0.00019514762,0.0074133924,0.0024049864,0.0000058744085],"about_ca_topic_score_codex":0.011840014,"about_ca_topic_score_gemma":0.011808585,"teacher_disagreement_score":0.011840014,"about_ca_system_score_codex":0.0022335493,"about_ca_system_score_gemma":0.004979493,"threshold_uncertainty_score":0.023542225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23309122,0.006788948,0.6838888,0.0017760592,0.0013485342,0.000666742,0.0009388474,0.0063360934,0.065164715],"genre_scores_gemma":[0.8076758,0.0024173756,0.16533272,0.0006754264,0.0001697006,0.00021576358,0.00044652287,0.00018781492,0.02287885],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998357,0.00001512855,0.0000066570856,0.000032733624,0.00008590334,0.000023713594],"domain_scores_gemma":[0.9998355,0.00003566852,0.000022389908,0.000029591174,0.0000650918,0.000011692386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015157055,0.00039457314,0.00016952661,0.00070482097,0.0002909312,0.00025765735,0.0004480655,0.00039921005,0.002885988],"category_scores_gemma":[0.00047699394,0.00013979462,0.00014625295,0.00034268084,0.000197132,0.0005245761,0.00028896824,0.0007008016,0.0009688585],"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.00013572989,0.00007829423,0.0003954897,0.00020752923,0.000018931454,0.00038642512,0.00009645245,0.0015011848,0.78876716,0.0048549506,0.005631999,0.19792594],"study_design_scores_gemma":[0.000026084346,0.00029907346,0.001119846,0.00006189508,0.000039706567,0.0012219158,0.00008219275,0.057351116,0.8863103,0.0015456085,0.051894527,0.00004767588],"about_ca_topic_score_codex":0.001032148,"about_ca_topic_score_gemma":0.0012259433,"teacher_disagreement_score":0.002885988,"about_ca_system_score_codex":0.00032786487,"about_ca_system_score_gemma":0.00019756443,"threshold_uncertainty_score":0.009654641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016672436,0.0010719371,0.9965514,0.000043622418,0.00014215651,0.000010058294,0.000055100536,0.00018974536,0.0017692996],"genre_scores_gemma":[0.017513141,0.0046281684,0.9559147,0.00012875434,0.00055673806,0.00019260585,0.00047737508,0.00033850802,0.020250075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993154,0.00016558793,0.000030539042,0.00010523392,0.00035751492,0.000025839025],"domain_scores_gemma":[0.99879646,0.00070687,0.000048322312,0.00015753799,0.00027158824,0.000019208606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009605198,0.0015892129,0.0010599802,0.0013923012,0.00032615426,0.0011304413,0.0021728405,0.0014707162,0.009336575],"category_scores_gemma":[0.0038200715,0.0007186578,0.00095839455,0.0016235505,0.00077045546,0.001534443,0.0010367394,0.0031738502,0.0056012836],"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.000058651694,0.000084938074,0.00038643577,0.00053022825,0.000110844696,0.0001094301,0.00017860661,0.13011616,0.00738561,0.22338262,0.0394357,0.5982208],"study_design_scores_gemma":[0.00001912529,0.000028711229,0.00046350216,0.00009549121,0.000033217326,0.00023870879,0.000021538011,0.77906984,0.003084032,0.16055356,0.056346335,0.00004596428],"about_ca_topic_score_codex":0.002299806,"about_ca_topic_score_gemma":0.0026390424,"teacher_disagreement_score":0.009336575,"about_ca_system_score_codex":0.0005003476,"about_ca_system_score_gemma":0.0006375174,"threshold_uncertainty_score":0.031233907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96425956,0.0012914155,0.0314532,0.00030150023,0.00016263663,0.00012319686,0.00056984514,0.0005269163,0.0013116972],"genre_scores_gemma":[0.98845273,0.00032827162,0.01012156,0.000045666042,0.000037243255,0.000086361004,0.0004996702,0.00002251143,0.0004061043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989687,0.00041165875,0.000058874593,0.00017797673,0.00025131888,0.00013157555],"domain_scores_gemma":[0.9973737,0.0011715492,0.0006850962,0.00027612867,0.00035585382,0.00013771186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002879943,0.00050424726,0.00037151377,0.00049414235,0.00046513483,0.000761361,0.00070857897,0.000315686,0.0010799452],"category_scores_gemma":[0.0061277887,0.0001673528,0.00028009238,0.0004009085,0.00026496616,0.0009109896,0.0005835226,0.00042495795,0.000116718606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004780293,0.0013090179,0.19791733,0.0015973595,0.0005564249,0.0006925745,0.00082049635,0.1059596,0.1632181,0.0029934873,0.004126276,0.51602906],"study_design_scores_gemma":[0.00015250803,0.005659654,0.35377377,0.0003659057,0.0008499586,0.0008170781,0.0013268269,0.52842426,0.089840636,0.0052672257,0.013288254,0.00023399768],"about_ca_topic_score_codex":0.005017275,"about_ca_topic_score_gemma":0.009524703,"teacher_disagreement_score":0.005017275,"about_ca_system_score_codex":0.00093117,"about_ca_system_score_gemma":0.0011429247,"threshold_uncertainty_score":0.015230775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05840058,0.00040765872,0.8700159,0.00020407142,0.0004470972,0.00069655577,0.00079978997,0.0612681,0.007760391],"genre_scores_gemma":[0.7137752,0.00021995594,0.26930803,0.00037283546,0.00033290678,0.00051097554,0.001398685,0.0022094098,0.011872094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991386,0.00014019472,0.000075957105,0.000106712716,0.00036110243,0.00017732111],"domain_scores_gemma":[0.99816906,0.00050334143,0.00018459452,0.0005052859,0.00040050317,0.00023722736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018096803,0.000502574,0.0005577756,0.0007249536,0.00067111413,0.00093220297,0.0024526396,0.00046794076,0.006415717],"category_scores_gemma":[0.0038291898,0.00033571335,0.00034214582,0.00056207285,0.00065476185,0.0010113034,0.0012939712,0.0011647963,0.0014773963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029336475,0.00094357145,0.0072772456,0.00053174386,0.00021150483,0.00033761843,0.0007152516,0.16483483,0.099566035,0.06332108,0.08574348,0.57358396],"study_design_scores_gemma":[0.00044008065,0.00038063966,0.0015499291,0.000019675928,0.00005612826,0.00012176414,0.00004075182,0.89708465,0.04766281,0.009104576,0.04346299,0.00007595812],"about_ca_topic_score_codex":0.0046492675,"about_ca_topic_score_gemma":0.0031544336,"teacher_disagreement_score":0.006415717,"about_ca_system_score_codex":0.001133148,"about_ca_system_score_gemma":0.0025634726,"threshold_uncertainty_score":0.021462739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014481747,0.000597669,0.9814586,0.00013202812,0.00018464154,0.000084197454,0.000017324728,0.0011012856,0.0019425161],"genre_scores_gemma":[0.9148213,0.00050245924,0.081352346,0.00017454264,0.00008742647,0.00020530603,0.000069195194,0.000050067003,0.002737278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994491,0.00009846513,0.000031527583,0.00012057632,0.0002191123,0.00008116617],"domain_scores_gemma":[0.9994875,0.00014253196,0.00006794884,0.000034813864,0.00022305203,0.00004414201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357162,0.00076230185,0.00059095933,0.0005982179,0.0006036015,0.0007437203,0.0019474734,0.000656375,0.0014790721],"category_scores_gemma":[0.0014810693,0.00020807385,0.00041619007,0.000496289,0.00060520374,0.00073169614,0.0007775801,0.0010909236,0.00020979787],"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.00040446242,0.00029968866,0.0018222294,0.0003296635,0.00011847406,0.0003329496,0.00028216338,0.68601817,0.032659225,0.020045092,0.006160041,0.2515278],"study_design_scores_gemma":[0.000016610702,0.00007258447,0.000077140445,0.000004039959,0.000007430437,0.000022363505,0.0000047714157,0.99702066,0.001432701,0.0007335488,0.00059973804,0.000008275595],"about_ca_topic_score_codex":0.008618904,"about_ca_topic_score_gemma":0.0038070993,"teacher_disagreement_score":0.008618904,"about_ca_system_score_codex":0.00080480723,"about_ca_system_score_gemma":0.0010820605,"threshold_uncertainty_score":0.017137468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10947647,0.00031663477,0.8869363,0.00025102752,0.000054917135,0.0001136077,0.000014647635,0.00064645807,0.0021898425],"genre_scores_gemma":[0.9777721,0.00005492053,0.021546852,0.000043118427,0.000015007593,0.000048381713,0.000010448671,0.000014943441,0.00049417024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999148,0.00033202145,0.00003808124,0.00016350846,0.00016647343,0.00015180044],"domain_scores_gemma":[0.99745005,0.0013077084,0.00031753778,0.00016974023,0.0005118809,0.00024299514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899531,0.0005522065,0.0009729934,0.0004633554,0.0006165575,0.0009940218,0.0014916934,0.0007365051,0.00058213825],"category_scores_gemma":[0.0038479536,0.00027520722,0.00044131244,0.0003411566,0.0011021753,0.0007278475,0.001398737,0.0011550048,0.00010203836],"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.00012209885,0.00011039435,0.001261351,0.000035620393,0.000036011927,0.00007416716,0.00007682413,0.96436656,0.003412591,0.00340192,0.00043488047,0.026667614],"study_design_scores_gemma":[0.000005229591,0.000019139887,0.000061739134,0.0000014846962,0.0000029112718,0.0000042346155,0.000003797507,0.9989355,0.0003282625,0.00057980797,0.00005554533,0.0000023369048],"about_ca_topic_score_codex":0.0077273953,"about_ca_topic_score_gemma":0.0039636535,"teacher_disagreement_score":0.0077273953,"about_ca_system_score_codex":0.0012596918,"about_ca_system_score_gemma":0.0012774215,"threshold_uncertainty_score":0.015364826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029726028,0.016096754,0.79156303,0.0038582536,0.0007530048,0.00016434569,0.0022321225,0.01140043,0.14420599],"genre_scores_gemma":[0.696284,0.015959049,0.21789134,0.0013851464,0.0023175997,0.00014504137,0.002067355,0.0031193942,0.060831126],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992255,0.0000922323,0.00002943491,0.00010061004,0.00046037187,0.00009180458],"domain_scores_gemma":[0.9981931,0.0006263231,0.00011292372,0.00024660974,0.00058879034,0.00023233304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166968,0.0007108465,0.0007216893,0.0020516864,0.00051896094,0.0046279537,0.0016437396,0.000914246,0.017906139],"category_scores_gemma":[0.0030350722,0.00051334035,0.0004439388,0.001998418,0.000648397,0.0048728315,0.0013516156,0.0019283363,0.0025700647],"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.00059721194,0.0002539148,0.00757001,0.0012941846,0.0001891023,0.00049596664,0.00093766826,0.08838792,0.055685192,0.2739543,0.06791857,0.50271595],"study_design_scores_gemma":[0.00004742848,0.00026831575,0.013765696,0.00042492137,0.00023999016,0.0011234963,0.0006818959,0.6308231,0.027809782,0.11993074,0.20471448,0.00017019652],"about_ca_topic_score_codex":0.0071582696,"about_ca_topic_score_gemma":0.0058099944,"teacher_disagreement_score":0.017906139,"about_ca_system_score_codex":0.001812293,"about_ca_system_score_gemma":0.0006524396,"threshold_uncertainty_score":0.059901953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98050755,0.00022233406,0.0004183412,0.001260304,0.00003499549,0.00008927834,0.00008408129,0.000027692082,0.017355504],"genre_scores_gemma":[0.9909859,0.00025014082,0.0004022938,0.00020759524,0.000017416001,0.000032862252,0.000039377504,0.000011637327,0.008052943],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99918455,0.0002777498,0.00001425088,0.000060791604,0.00011258939,0.00035008285],"domain_scores_gemma":[0.99805,0.000616687,0.00018074001,0.000097643366,0.000113053095,0.00094188994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089845277,0.00041926382,0.00024768515,0.0010552332,0.008666526,0.0015663137,0.0016975631,0.002750383,0.008606804],"category_scores_gemma":[0.0021822085,0.00021873036,0.00030707923,0.0010693102,0.0027957123,0.0012040845,0.0033105055,0.0018009507,0.0006564542],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005759608,0.0059025907,0.11133754,0.00055121974,0.000086677275,0.15041631,0.5572501,0.002191758,0.0050936723,0.020738937,0.017851464,0.12800373],"study_design_scores_gemma":[0.000120741606,0.0021086435,0.100629374,0.0003274487,0.000048045145,0.02368036,0.7835213,0.0016858221,0.002335453,0.0037535615,0.08171666,0.00007261342],"about_ca_topic_score_codex":0.031538878,"about_ca_topic_score_gemma":0.10136497,"teacher_disagreement_score":0.031538878,"about_ca_system_score_codex":0.003981776,"about_ca_system_score_gemma":0.0030259744,"threshold_uncertainty_score":0.06271058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135718165,0.0004947297,0.9828135,0.0010642044,0.00005520575,0.00007411154,0.000085677864,0.00032797267,0.0015128322],"genre_scores_gemma":[0.35903227,0.0006290923,0.63710463,0.00018594763,0.00016792769,0.0007961646,0.00035533414,0.0001693129,0.0015592889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99301165,0.0039890734,0.00033537927,0.0010337612,0.0014018076,0.00022837335],"domain_scores_gemma":[0.9479606,0.04027356,0.002367983,0.006608919,0.0019811566,0.0008077806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00854652,0.0011909003,0.002265282,0.0012120255,0.0017304248,0.0025215957,0.0033285967,0.0017587736,0.003381491],"category_scores_gemma":[0.053514633,0.00089413504,0.0010523946,0.0016247939,0.0031652916,0.0056431876,0.004405196,0.0033700815,0.000862383],"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.0015441332,0.00021146111,0.0057567745,0.00045152806,0.00011576355,0.0002736821,0.00037585053,0.47727254,0.013130812,0.35576746,0.004415093,0.14068489],"study_design_scores_gemma":[0.00015871049,0.0002236685,0.00066003925,0.000067130764,0.00003747481,0.00014434448,0.000119728196,0.8621226,0.0042786826,0.1268529,0.0052983044,0.00003650776],"about_ca_topic_score_codex":0.0009559327,"about_ca_topic_score_gemma":0.0010670623,"teacher_disagreement_score":0.00854652,"about_ca_system_score_codex":0.0017938424,"about_ca_system_score_gemma":0.0015577355,"threshold_uncertainty_score":0.045198858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0695603,0.006854172,0.9114439,0.0038412574,0.00027398166,0.000370606,0.00023421175,0.0019009503,0.0055205384],"genre_scores_gemma":[0.6107567,0.003953523,0.3816908,0.00031199318,0.00030156187,0.00014411958,0.0004841789,0.00014313993,0.0022139892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936395,0.0021549908,0.00043993542,0.00088939426,0.0024341336,0.00044196929],"domain_scores_gemma":[0.9905117,0.004524783,0.0012289752,0.0015276425,0.0019898284,0.0002170043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059899325,0.00072301517,0.0010004634,0.0031408004,0.0011022966,0.0048318743,0.0027044138,0.00214802,0.00086723117],"category_scores_gemma":[0.0155466385,0.00065894483,0.00078442413,0.0040885727,0.0012644912,0.0042622783,0.0014899933,0.0023540861,0.00030085378],"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.00043599962,0.0007533969,0.037391555,0.0011676531,0.00036583835,0.0007211201,0.0010539154,0.21062976,0.008107764,0.13083844,0.010322813,0.59821177],"study_design_scores_gemma":[0.000028536457,0.00007947603,0.0020504927,0.00009649001,0.00008694861,0.00037606084,0.0003002084,0.9592201,0.0073427716,0.024181405,0.0061946455,0.00004288068],"about_ca_topic_score_codex":0.0039909533,"about_ca_topic_score_gemma":0.0017752547,"teacher_disagreement_score":0.0059899325,"about_ca_system_score_codex":0.0022307392,"about_ca_system_score_gemma":0.0029082904,"threshold_uncertainty_score":0.0316782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217432,0.000047215206,0.96478546,0.00006925356,0.0000037027228,0.000026722197,0.000041799056,0.00024177472,0.00056670414],"genre_scores_gemma":[0.6591192,0.0001051878,0.3393445,0.000027864813,0.000012815596,0.00010392762,0.00028131116,0.00008118738,0.0009240068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.00044217132,0.000024430326,0.000118885604,0.0002009399,0.00005528172],"domain_scores_gemma":[0.9942162,0.004131416,0.0006723963,0.00048360365,0.0003677118,0.00012858113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421174,0.0005661462,0.00069740374,0.0010231053,0.00049621094,0.0009852035,0.0010759558,0.0008729526,0.00085192436],"category_scores_gemma":[0.013780646,0.0005299041,0.000297286,0.00085210823,0.000920428,0.002107657,0.0013607253,0.0010274486,0.00033439873],"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.00028377195,0.00008254117,0.0056198915,0.00009054617,0.000043195654,0.00014611411,0.00020553442,0.88986963,0.009937465,0.026522448,0.0005901014,0.066608734],"study_design_scores_gemma":[0.000006359526,0.000011439542,0.00036415964,0.0000030505341,0.0000022710412,0.000029773251,0.000009900354,0.9913531,0.0016934497,0.0063817697,0.00013777557,0.000006848246],"about_ca_topic_score_codex":0.0012716891,"about_ca_topic_score_gemma":0.0014962686,"teacher_disagreement_score":0.0018421174,"about_ca_system_score_codex":0.0006938451,"about_ca_system_score_gemma":0.00065357913,"threshold_uncertainty_score":0.009742141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73336935,0.0018630947,0.22374114,0.0010306762,0.0002483547,0.00017316213,0.00020688915,0.00034764642,0.039019678],"genre_scores_gemma":[0.9916225,0.00031968317,0.0056702285,0.00004378889,0.00002568845,0.000033998258,0.000026802607,0.000027302634,0.0022300058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.0002245593,0.000012251492,0.000082346305,0.0001037971,0.0001267494],"domain_scores_gemma":[0.9990582,0.00049767835,0.00014595705,0.000064348525,0.00014727683,0.00008640537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091040996,0.00047279877,0.00053461234,0.0008970026,0.0008787853,0.00097365,0.0013662396,0.0007298148,0.0022006207],"category_scores_gemma":[0.0023723883,0.00030777827,0.000647174,0.00045026856,0.0009550415,0.0016583455,0.0009209057,0.0006062473,0.00013237089],"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.000084307736,0.000043305336,0.0018146562,0.0000550964,0.000032193275,0.0002472409,0.00009448,0.9403174,0.0024818114,0.05111173,0.000584544,0.0031332416],"study_design_scores_gemma":[0.0000028598283,0.00001831583,0.00012741453,0.0000034253787,0.0000047383282,0.000014528088,0.000016997921,0.99780005,0.00016522572,0.0016488533,0.0001944814,0.0000030728243],"about_ca_topic_score_codex":0.005784312,"about_ca_topic_score_gemma":0.0018533629,"teacher_disagreement_score":0.005784312,"about_ca_system_score_codex":0.0014535354,"about_ca_system_score_gemma":0.00077913515,"threshold_uncertainty_score":0.011501253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046519198,0.0011163126,0.9442795,0.00032935978,0.00010998308,0.00011258588,0.000017440212,0.00032284498,0.0071927574],"genre_scores_gemma":[0.8114299,0.0017614379,0.1803447,0.00018802685,0.00028350772,0.0002705831,0.000063801526,0.00009500309,0.0055630566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745613,0.00085476675,0.00012840547,0.0003145762,0.001028598,0.00021743018],"domain_scores_gemma":[0.9973929,0.0014876763,0.00039405347,0.00026956658,0.0004008986,0.000054916978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022417703,0.00061584415,0.0006366416,0.00091458356,0.00081074913,0.0018588337,0.0016382001,0.0012395103,0.0010083906],"category_scores_gemma":[0.0065909456,0.00032989128,0.0005795361,0.00084099395,0.001313453,0.0026829704,0.0007785117,0.0014182999,0.00028689046],"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.00016709024,0.0002991977,0.0018040215,0.00019877296,0.00007209345,0.00027898265,0.00049558905,0.48857322,0.03266354,0.27919012,0.0020964728,0.19416088],"study_design_scores_gemma":[0.000010941463,0.000053006053,0.00026028734,0.000014214724,0.0000116207775,0.000106186904,0.00003641326,0.9801887,0.004002399,0.013475717,0.0018195871,0.0000208571],"about_ca_topic_score_codex":0.0022913858,"about_ca_topic_score_gemma":0.0010231974,"teacher_disagreement_score":0.0022913858,"about_ca_system_score_codex":0.0014038768,"about_ca_system_score_gemma":0.0012720738,"threshold_uncertainty_score":0.011855781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32787755,0.0048346366,0.6444692,0.0017237243,0.00041822993,0.00024151037,0.00010866671,0.000513637,0.019812852],"genre_scores_gemma":[0.9616938,0.0007599353,0.0358379,0.00013078658,0.00006083817,0.000079764926,0.00004111354,0.000056458433,0.0013393759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972172,0.001656306,0.0000777175,0.00020077516,0.0004825198,0.0003654841],"domain_scores_gemma":[0.98116404,0.015441742,0.0009744223,0.0005920771,0.0012879536,0.00053968903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0134487385,0.0016280139,0.0013819949,0.0012521019,0.0012093921,0.0024391005,0.0012270357,0.0012876224,0.0021186138],"category_scores_gemma":[0.026306245,0.00052363664,0.00043284206,0.0009465818,0.0028975399,0.0022966573,0.0023800998,0.0019988413,0.00021066902],"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.0011387767,0.00022968352,0.0006422158,0.00010062582,0.000045441204,0.000029426896,0.000109450906,0.93510914,0.0013530235,0.037014235,0.00088506733,0.023342807],"study_design_scores_gemma":[0.000024121275,0.00008833046,0.000057049365,0.000010831431,0.0000066453813,0.0000071476165,0.000014853928,0.99474055,0.00032523312,0.004632171,0.000087459375,0.0000057021216],"about_ca_topic_score_codex":0.0044930144,"about_ca_topic_score_gemma":0.0022900226,"teacher_disagreement_score":0.0134487385,"about_ca_system_score_codex":0.0029978827,"about_ca_system_score_gemma":0.002364443,"threshold_uncertainty_score":0.07112461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14938152,0.00037270834,0.8435868,0.00046256575,0.000060309696,0.000057795907,0.0002436538,0.00028284665,0.0055518076],"genre_scores_gemma":[0.9343508,0.0006078472,0.060595743,0.00017927447,0.00016926715,0.00012489765,0.00029143694,0.00011731738,0.0035634886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815804,0.00036978628,0.000105888976,0.00022832399,0.0008243187,0.0003135637],"domain_scores_gemma":[0.99128985,0.004531894,0.0015334174,0.0007475364,0.0011646149,0.00073275453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024700735,0.00054887804,0.00070686586,0.0009838172,0.00079452177,0.0020208047,0.0011955075,0.000675099,0.001910325],"category_scores_gemma":[0.0105264345,0.00039195153,0.00057885423,0.001187867,0.0024484163,0.0037379959,0.0011953777,0.0017010682,0.00023536461],"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.00020683522,0.00008004113,0.0018841445,0.00011752624,0.000025084448,0.00031261847,0.0003694519,0.09437156,0.014060638,0.8715746,0.0008746541,0.01612289],"study_design_scores_gemma":[0.000035133966,0.00013016869,0.0011962409,0.000022515242,0.000022785447,0.0002661626,0.00008789789,0.6129128,0.0056264875,0.3772051,0.0024428528,0.000051847244],"about_ca_topic_score_codex":0.00180509,"about_ca_topic_score_gemma":0.0012039337,"teacher_disagreement_score":0.0024700735,"about_ca_system_score_codex":0.0018231224,"about_ca_system_score_gemma":0.0013866475,"threshold_uncertainty_score":0.013227761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046519198,0.0011163126,0.9442795,0.00032935978,0.00010998308,0.00011258588,0.000017440212,0.00032284498,0.0071927574],"genre_scores_gemma":[0.8114299,0.0017614379,0.1803447,0.00018802685,0.00028350772,0.0002705831,0.000063801526,0.00009500309,0.0055630566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745613,0.00085476675,0.00012840547,0.0003145762,0.001028598,0.00021743018],"domain_scores_gemma":[0.9973929,0.0014876763,0.00039405347,0.00026956658,0.0004008986,0.000054916978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022417703,0.00061584415,0.0006366416,0.00091458356,0.00081074913,0.0018588337,0.0016382001,0.0012395103,0.0010083906],"category_scores_gemma":[0.0065909456,0.00032989128,0.0005795361,0.00084099395,0.001313453,0.0026829704,0.0007785117,0.0014182999,0.00028689046],"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.00016709024,0.0002991977,0.0018040215,0.00019877296,0.00007209345,0.00027898265,0.00049558905,0.48857322,0.03266354,0.27919012,0.0020964728,0.19416088],"study_design_scores_gemma":[0.000010941463,0.000053006053,0.00026028734,0.000014214724,0.0000116207775,0.000106186904,0.00003641326,0.9801887,0.004002399,0.013475717,0.0018195871,0.0000208571],"about_ca_topic_score_codex":0.0022913858,"about_ca_topic_score_gemma":0.0010231974,"teacher_disagreement_score":0.0022913858,"about_ca_system_score_codex":0.0014038768,"about_ca_system_score_gemma":0.0012720738,"threshold_uncertainty_score":0.011855781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05704237,0.0018561286,0.9300091,0.0006003189,0.00039220502,0.0003091807,0.00015362822,0.0029025984,0.0067343707],"genre_scores_gemma":[0.88050157,0.0007283244,0.11353165,0.00040630382,0.0005071311,0.00016742476,0.00022032311,0.000101022306,0.003836308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998384,0.0003082053,0.000107095824,0.00025089455,0.00066360505,0.00028617858],"domain_scores_gemma":[0.9987078,0.00027201488,0.00013472803,0.0003377814,0.00036433368,0.00018335125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016544833,0.000703795,0.0010332508,0.00091280893,0.0016405408,0.0015704413,0.0031675217,0.0015635332,0.0014833573],"category_scores_gemma":[0.0036264516,0.00030221985,0.00043607535,0.0008973402,0.001511332,0.001590598,0.0018246832,0.0020193772,0.00055158156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092595536,0.00048825424,0.0017916592,0.0003503153,0.00012624203,0.0005759612,0.0009028828,0.121135324,0.15492232,0.22627619,0.0091971895,0.48330772],"study_design_scores_gemma":[0.00019032478,0.00055332633,0.0017327938,0.00008592308,0.00021085526,0.0015090825,0.00010725543,0.85378516,0.038118172,0.06445416,0.038909893,0.00034312572],"about_ca_topic_score_codex":0.0017229927,"about_ca_topic_score_gemma":0.0015800302,"teacher_disagreement_score":0.0031675217,"about_ca_system_score_codex":0.001553912,"about_ca_system_score_gemma":0.00093148905,"threshold_uncertainty_score":0.011274457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3164798,0.0004637734,0.6772625,0.0003621332,0.000033137738,0.000048370835,0.000039564537,0.0003137285,0.004997066],"genre_scores_gemma":[0.9405771,0.00014365067,0.057209667,0.0000195392,0.0000113383785,0.0000272325,0.000021928285,0.000030519466,0.0019592065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998362,0.000054666656,0.000004203333,0.000029078577,0.000038127902,0.000037722242],"domain_scores_gemma":[0.999819,0.00009309689,0.00003594473,0.000014162444,0.00002721585,0.0000106693105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038403427,0.0003112692,0.00043869246,0.000267919,0.00038881818,0.00044413135,0.00038678487,0.0005072796,0.0006492461],"category_scores_gemma":[0.0005845176,0.00016322329,0.00027560187,0.00022587739,0.0003256776,0.0005637938,0.00043226604,0.00042548144,0.00008690262],"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.000048263435,0.00002882362,0.00047056904,0.00002126324,0.000008309336,0.00004567652,0.00002692546,0.9744353,0.004760315,0.0060401373,0.00022153066,0.013892774],"study_design_scores_gemma":[0.000002224164,0.000013134719,0.00008268396,9.79828e-7,0.0000016694687,0.0000071683876,0.000007881062,0.99795854,0.0009132179,0.00091561564,0.00009563594,0.0000013192599],"about_ca_topic_score_codex":0.0023790516,"about_ca_topic_score_gemma":0.0014062237,"teacher_disagreement_score":0.0023790516,"about_ca_system_score_codex":0.0005932661,"about_ca_system_score_gemma":0.0003678621,"threshold_uncertainty_score":0.0047304034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067721573,0.0011565019,0.9904406,0.000069949325,0.00012722758,0.000047328725,0.000014774803,0.0003541124,0.001017337],"genre_scores_gemma":[0.4093015,0.002866003,0.5806492,0.000114368915,0.0002935981,0.00018061145,0.00012269923,0.00017141717,0.0063006477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.00010657635,0.000054949607,0.00017010787,0.00029771868,0.00005568372],"domain_scores_gemma":[0.9988933,0.0003927232,0.00012045872,0.0001104522,0.0004525049,0.00003055565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708078,0.00081775704,0.00058480795,0.0006758738,0.00040749484,0.001063403,0.0013300704,0.0005813124,0.0014069063],"category_scores_gemma":[0.0035175872,0.00024519573,0.0003593168,0.00055206596,0.0004002467,0.0013503304,0.00037530833,0.0013941614,0.00048690173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045081915,0.00022235313,0.0009428659,0.00028670326,0.000080200865,0.0001036699,0.0002476059,0.24718961,0.05772939,0.051104754,0.0037037814,0.6379383],"study_design_scores_gemma":[0.000030132709,0.00011162802,0.00024118827,0.000017405762,0.000026159189,0.00010898549,0.000015804402,0.96949166,0.021051282,0.0035045545,0.005368477,0.000032700766],"about_ca_topic_score_codex":0.0016745875,"about_ca_topic_score_gemma":0.0014721922,"teacher_disagreement_score":0.0016745875,"about_ca_system_score_codex":0.00092504284,"about_ca_system_score_gemma":0.00076558953,"threshold_uncertainty_score":0.0067117214},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020447078,0.24814793,0.008692868,0.49744228,0.10420484,0.00021446252,0.0021236632,0.0007023537,0.13642688],"genre_scores_gemma":[0.039287705,0.37434864,0.02150393,0.24199982,0.049733937,0.00076875277,0.0050011133,0.00050582143,0.26685026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686784,0.0009570737,0.00018222313,0.0005318701,0.0007973527,0.00066370727],"domain_scores_gemma":[0.9889754,0.0021404708,0.00036569356,0.00063154916,0.005218785,0.002668162],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00846825,0.001086187,0.00095795176,0.0017382527,0.0022282274,0.009446782,0.0032151986,0.005590993,0.14507556],"category_scores_gemma":[0.01389951,0.00033793383,0.0014763626,0.0019780141,0.0022961143,0.009743546,0.003697795,0.005373152,0.04558497],"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.0004357221,0.00021774585,0.000675421,0.0020855903,0.00005022288,0.00022669221,0.00036742253,0.00044164597,0.0005944912,0.08011447,0.6518941,0.2628965],"study_design_scores_gemma":[0.00006184384,0.00009169593,0.00037907835,0.0019726537,0.00005545232,0.00017057922,0.0014989651,0.00015529343,0.00041956003,0.055796087,0.9393763,0.000022473972],"about_ca_topic_score_codex":0.004561095,"about_ca_topic_score_gemma":0.0068121497,"teacher_disagreement_score":0.85492444,"about_ca_system_score_codex":0.0036796536,"about_ca_system_score_gemma":0.012511007,"threshold_uncertainty_score":0.4853261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3164798,0.0004637734,0.6772625,0.0003621332,0.000033137738,0.000048370835,0.000039564537,0.0003137285,0.004997066],"genre_scores_gemma":[0.9405771,0.00014365067,0.057209667,0.0000195392,0.0000113383785,0.0000272325,0.000021928285,0.000030519466,0.0019592065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998362,0.000054666656,0.000004203333,0.000029078577,0.000038127902,0.000037722242],"domain_scores_gemma":[0.999819,0.00009309689,0.00003594473,0.000014162444,0.00002721585,0.0000106693105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038403427,0.0003112692,0.00043869246,0.000267919,0.00038881818,0.00044413135,0.00038678487,0.0005072796,0.0006492461],"category_scores_gemma":[0.0005845176,0.00016322329,0.00027560187,0.00022587739,0.0003256776,0.0005637938,0.00043226604,0.00042548144,0.00008690262],"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.000048263435,0.00002882362,0.00047056904,0.00002126324,0.000008309336,0.00004567652,0.00002692546,0.9744353,0.004760315,0.0060401373,0.00022153066,0.013892774],"study_design_scores_gemma":[0.000002224164,0.000013134719,0.00008268396,9.79828e-7,0.0000016694687,0.0000071683876,0.000007881062,0.99795854,0.0009132179,0.00091561564,0.00009563594,0.0000013192599],"about_ca_topic_score_codex":0.0023790516,"about_ca_topic_score_gemma":0.0014062237,"teacher_disagreement_score":0.0023790516,"about_ca_system_score_codex":0.0005932661,"about_ca_system_score_gemma":0.0003678621,"threshold_uncertainty_score":0.0047304034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010723405,0.00025753648,0.98561805,0.00019969261,0.000112621325,0.00003061635,0.000015210173,0.000099794284,0.0029431568],"genre_scores_gemma":[0.60013986,0.0008947447,0.38287446,0.00020769618,0.00017104675,0.00024885207,0.000089299545,0.00031101826,0.015063003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00015216955,0.000016455153,0.000044145138,0.00009545285,0.000042815915],"domain_scores_gemma":[0.9987153,0.0008498235,0.00007421516,0.000076186036,0.00020402855,0.00008044993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010961645,0.00067171047,0.0006739053,0.00086358807,0.000649066,0.0015179609,0.001156847,0.0011968868,0.0030712062],"category_scores_gemma":[0.0046564797,0.00048517733,0.0006177338,0.00064039725,0.0009947194,0.0018083284,0.0015233749,0.0018348678,0.0004775124],"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.00014144077,0.00009520548,0.0005997807,0.00010176817,0.000054032902,0.00017273882,0.0003116028,0.6375455,0.007969808,0.29573,0.0018753787,0.05540269],"study_design_scores_gemma":[0.0000066618713,0.000007271725,0.000020538177,0.0000037023176,0.0000022129461,0.000006303881,0.00000609965,0.98360795,0.00028810452,0.015617582,0.00042976544,0.0000037742343],"about_ca_topic_score_codex":0.004392868,"about_ca_topic_score_gemma":0.0024817395,"teacher_disagreement_score":0.004392868,"about_ca_system_score_codex":0.0010801305,"about_ca_system_score_gemma":0.0009039174,"threshold_uncertainty_score":0.010274231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006464091,0.0001247721,0.9823868,0.00017396547,0.00007961947,0.000048177062,0.000024905037,0.0004707615,0.010226912],"genre_scores_gemma":[0.8439795,0.0002984762,0.14186019,0.00021049968,0.00013470578,0.0003881633,0.000102637016,0.00007667506,0.0129492385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.000064214706,0.0000107617925,0.000071192095,0.00012950887,0.000033158365],"domain_scores_gemma":[0.9997905,0.00006349953,0.000027399503,0.00003167064,0.00006525619,0.000021647773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032723063,0.0004953152,0.00039395358,0.0003004284,0.0004245322,0.00067247427,0.00082534563,0.00060603704,0.003027062],"category_scores_gemma":[0.00067003944,0.00016881252,0.0003005768,0.00023163475,0.00050760945,0.00061728683,0.0006933117,0.0006147695,0.00041674115],"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.00009987453,0.00014025133,0.0003404089,0.00013685276,0.000047117628,0.00028017772,0.00014886058,0.5749014,0.028793136,0.2242138,0.0071548307,0.1637434],"study_design_scores_gemma":[0.000035250392,0.000077129895,0.00009106315,0.000007781653,0.0000105307845,0.000072450406,0.000012889698,0.9657131,0.0017047658,0.024105227,0.008158397,0.000011401119],"about_ca_topic_score_codex":0.0015995313,"about_ca_topic_score_gemma":0.0018041648,"teacher_disagreement_score":0.003027062,"about_ca_system_score_codex":0.0006061875,"about_ca_system_score_gemma":0.0007214645,"threshold_uncertainty_score":0.0101264715},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012981436,0.0019774057,0.2228677,0.0075084465,0.0033341735,0.0009189777,0.02423736,0.24557838,0.4805961],"genre_scores_gemma":[0.09773494,0.0025991264,0.2732194,0.0041679405,0.0006051111,0.001118486,0.10749204,0.08040351,0.43265954],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849045,0.00025842097,0.000064704574,0.00027913178,0.00068431423,0.0002229086],"domain_scores_gemma":[0.99692374,0.00048040078,0.00010935226,0.00082842424,0.0010768869,0.0005812758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222765,0.0008298892,0.0007561096,0.0014022967,0.0011572691,0.0032203423,0.002728555,0.0011398293,0.1051489],"category_scores_gemma":[0.008952175,0.0006282949,0.00081027416,0.0012857395,0.00050773675,0.0037224356,0.0040924363,0.002670329,0.080142535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028738182,0.00008543013,0.0013192549,0.00024551855,0.000026027747,0.00012504452,0.000309756,0.0015297963,0.0031770747,0.040109906,0.80578524,0.14699951],"study_design_scores_gemma":[0.000042754942,0.00004069059,0.00071547576,0.000062472995,0.000014589303,0.0001859533,0.00006303399,0.0069153947,0.0024895086,0.011037267,0.97839624,0.000036764424],"about_ca_topic_score_codex":0.0039236173,"about_ca_topic_score_gemma":0.005384133,"teacher_disagreement_score":0.1051489,"about_ca_system_score_codex":0.0015337244,"about_ca_system_score_gemma":0.0024887708,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5695873,0.002212595,0.40261385,0.0021871969,0.00023750732,0.00017231845,0.00025503171,0.0003859095,0.02234827],"genre_scores_gemma":[0.9835476,0.00055717264,0.008975959,0.00019100269,0.00012340992,0.00010162038,0.00009174081,0.000041988547,0.0063693775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963534,0.00013993053,0.000010891779,0.000061274826,0.000073120296,0.00007947123],"domain_scores_gemma":[0.9985306,0.00069762557,0.00025048744,0.00007052989,0.00022943575,0.00022142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079612,0.00077356544,0.00083979993,0.0016328278,0.0010862526,0.001702503,0.0012557631,0.001834885,0.0019613628],"category_scores_gemma":[0.0036595215,0.00047607662,0.0010778753,0.0005510881,0.0022547857,0.0022529082,0.0011415221,0.0011246304,0.00018074713],"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.00010252454,0.0001393463,0.0022535447,0.00010171369,0.00010094602,0.00049033295,0.00029938752,0.7160918,0.0062773805,0.26951882,0.0011349499,0.0034892333],"study_design_scores_gemma":[0.000009485221,0.000016619639,0.00025130008,0.000007585138,0.0000073608117,0.000027679846,0.00003053376,0.9829573,0.00010410005,0.01634731,0.00022813563,0.00001257993],"about_ca_topic_score_codex":0.0074286503,"about_ca_topic_score_gemma":0.0016929102,"teacher_disagreement_score":0.0074286503,"about_ca_system_score_codex":0.0016902456,"about_ca_system_score_gemma":0.00094088604,"threshold_uncertainty_score":0.014770806},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016389588,0.02382667,0.4444654,0.4848139,0.010910337,0.00025005342,0.0005909157,0.0039846664,0.01476842],"genre_scores_gemma":[0.4529923,0.018872138,0.2986853,0.19086464,0.017575324,0.0012621402,0.00056065404,0.005035585,0.01415186],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94286215,0.037273455,0.002564451,0.0052932706,0.010446085,0.0015606164],"domain_scores_gemma":[0.6094076,0.31157607,0.015273821,0.02530336,0.034534656,0.003904402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08138745,0.0010934086,0.0025137987,0.0018779017,0.0020311775,0.005797877,0.0038241167,0.0070433766,0.010580747],"category_scores_gemma":[0.40423614,0.0010240489,0.0016314448,0.0029485365,0.011317334,0.017405886,0.0031408677,0.01732052,0.005003414],"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.0009916293,0.0006122576,0.036489256,0.0018276292,0.00079980725,0.00068819296,0.0046815644,0.012525225,0.0022524998,0.22667825,0.28632873,0.426125],"study_design_scores_gemma":[0.0004945636,0.0007171148,0.015135213,0.002151211,0.00031034107,0.00078679284,0.003527153,0.03146052,0.004994151,0.728121,0.21181996,0.00048195547],"about_ca_topic_score_codex":0.0057484936,"about_ca_topic_score_gemma":0.0029573615,"teacher_disagreement_score":0.08138745,"about_ca_system_score_codex":0.002176368,"about_ca_system_score_gemma":0.0033406294,"threshold_uncertainty_score":0.43042314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19391595,0.021838881,0.7054909,0.0013695762,0.0019029803,0.002035877,0.00033073555,0.014059961,0.059055116],"genre_scores_gemma":[0.8504212,0.0027892438,0.14069133,0.0004703499,0.00034657473,0.0003693208,0.00029116438,0.00024453696,0.004376334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976254,0.0003909179,0.0001617256,0.00032614835,0.0012436177,0.00025224098],"domain_scores_gemma":[0.9978138,0.00039695585,0.00016245911,0.0003894594,0.0010828516,0.0001542958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022961283,0.0007574441,0.0006180368,0.0008081202,0.00082677073,0.0020900706,0.0021187016,0.000819052,0.0011066709],"category_scores_gemma":[0.005309555,0.0005348155,0.0003486985,0.0005349936,0.0005376311,0.0023586887,0.0012498992,0.0019731477,0.00035482922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011519685,0.00082152936,0.014398211,0.0018975108,0.00046906457,0.0010297528,0.00076476246,0.104388095,0.10937023,0.056631777,0.018617252,0.69045985],"study_design_scores_gemma":[0.0002318229,0.0013527755,0.00503058,0.00028913352,0.00083822693,0.0021768748,0.00022038892,0.72946334,0.13726652,0.01502971,0.10781505,0.00028556507],"about_ca_topic_score_codex":0.002513813,"about_ca_topic_score_gemma":0.0026919432,"teacher_disagreement_score":0.002513813,"about_ca_system_score_codex":0.0009954035,"about_ca_system_score_gemma":0.0013031345,"threshold_uncertainty_score":0.012143254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027942998,0.00041350274,0.9676046,0.00036179606,0.000028256813,0.000045131612,0.000042405154,0.0000651991,0.0034961526],"genre_scores_gemma":[0.7644461,0.00067194394,0.22609834,0.0001069595,0.00007642753,0.0003276296,0.00014853965,0.000119703436,0.008004365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928707,0.00028091067,0.000019334131,0.00009368105,0.00024501837,0.00007405037],"domain_scores_gemma":[0.9993056,0.00041803683,0.000071142786,0.000056787187,0.000101517675,0.00004696765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826401,0.00084227184,0.00059596717,0.0006488517,0.00041626883,0.0007035077,0.00089566637,0.00091144885,0.002113705],"category_scores_gemma":[0.0025688221,0.00028579572,0.0004674742,0.00093159644,0.00074679864,0.0016896512,0.0012224143,0.0007510493,0.00022526315],"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.000037700127,0.000030122244,0.00018102361,0.00004964803,0.000017528075,0.00003484551,0.00004541202,0.92697453,0.0009620461,0.04736246,0.0010879026,0.023216778],"study_design_scores_gemma":[0.000008147985,0.000028667946,0.00007473422,0.000005002089,0.0000046371483,0.000013621878,0.0000142741765,0.9724027,0.00037605347,0.026272746,0.0007955133,0.000003939778],"about_ca_topic_score_codex":0.0022698508,"about_ca_topic_score_gemma":0.0014908832,"teacher_disagreement_score":0.0022698508,"about_ca_system_score_codex":0.0011865349,"about_ca_system_score_gemma":0.00075634086,"threshold_uncertainty_score":0.008608937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9652286,0.0012182138,0.015512359,0.00022111287,0.00024104204,0.00020272317,0.0005830737,0.0061048516,0.010688019],"genre_scores_gemma":[0.9789267,0.0006361743,0.015453612,0.00009561511,0.000078786135,0.00014647018,0.001849803,0.0006560958,0.0021567708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993407,0.0011918035,0.000742702,0.00078667613,0.0028783227,0.0009934756],"domain_scores_gemma":[0.99051017,0.0029433626,0.00037897378,0.001596186,0.0038891234,0.00068215537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034354238,0.001525246,0.0012448106,0.0031300932,0.0010067712,0.0026536777,0.002630265,0.0013079186,0.0026523606],"category_scores_gemma":[0.01164286,0.0008433573,0.0007162075,0.003814396,0.0007163112,0.0036322623,0.0016106908,0.0013676025,0.0014019655],"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.0074143647,0.0032809896,0.08522678,0.0020236988,0.0011728645,0.0010294616,0.0012157921,0.42180607,0.14976825,0.0088930745,0.01598003,0.30218863],"study_design_scores_gemma":[0.000431819,0.004620348,0.078463614,0.00013059424,0.00038089434,0.0006727575,0.0015728616,0.74594253,0.14875448,0.004348926,0.014431831,0.00024925667],"about_ca_topic_score_codex":0.003913076,"about_ca_topic_score_gemma":0.0023358124,"teacher_disagreement_score":0.003913076,"about_ca_system_score_codex":0.0015029487,"about_ca_system_score_gemma":0.0012233066,"threshold_uncertainty_score":0.01816845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013292175,0.00090348034,0.93646103,0.0005042059,0.0002537072,0.000083640705,0.00024244262,0.00089362875,0.047365654],"genre_scores_gemma":[0.5591009,0.0055242274,0.31071156,0.00038118367,0.00048395165,0.0007654529,0.0014748668,0.00056761,0.12099016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998049,0.000041469157,0.000007984646,0.000042382388,0.000083219544,0.00002013694],"domain_scores_gemma":[0.9997993,0.00008719513,0.000015744828,0.000043508117,0.00004465493,0.000009558623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586147,0.0008378473,0.00047730756,0.0003935752,0.0003472584,0.0011766102,0.0012713645,0.0007966017,0.004350818],"category_scores_gemma":[0.0009916098,0.00046064236,0.00056514447,0.00047803606,0.00050047727,0.001648009,0.00047875568,0.0012142521,0.0010313896],"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.000017200753,0.00005422291,0.00019502599,0.000051124982,0.000018078328,0.00003806725,0.000052644744,0.6391819,0.0022598538,0.311802,0.004054872,0.042275],"study_design_scores_gemma":[0.0000037873535,0.0000065415643,0.00003669592,0.000008266458,0.000007750976,0.000013553726,0.000004764144,0.923259,0.0006891824,0.069192596,0.0067726737,0.0000051946013],"about_ca_topic_score_codex":0.004000922,"about_ca_topic_score_gemma":0.002611013,"teacher_disagreement_score":0.004350818,"about_ca_system_score_codex":0.0009336612,"about_ca_system_score_gemma":0.0008096444,"threshold_uncertainty_score":0.014554918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015299087,0.00015560491,0.99690646,0.000066027795,0.000029889994,0.00003679598,0.000030225545,0.00021528392,0.0010298806],"genre_scores_gemma":[0.048978537,0.0003686767,0.9478485,0.000092229406,0.000043364213,0.00022727574,0.00019338168,0.0000941346,0.0021538637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991671,0.0002285779,0.00006274106,0.00014609216,0.00030875078,0.00008670669],"domain_scores_gemma":[0.9989768,0.0005161037,0.000060364444,0.00013308457,0.0002747457,0.00003893788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940668,0.0008550899,0.0005906133,0.0013823786,0.00049339706,0.0008315453,0.0013689643,0.0009321536,0.005518962],"category_scores_gemma":[0.003787906,0.00036187508,0.00089020166,0.0015401343,0.0005900934,0.0015833984,0.0010195698,0.0010856434,0.0009084061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016171801,0.00009959282,0.0003633357,0.00017918267,0.000046829013,0.000043377466,0.0001369037,0.37806532,0.0035501418,0.08482114,0.0069858297,0.52554667],"study_design_scores_gemma":[0.000050987037,0.000085548854,0.00008795599,0.000019437655,0.000019822786,0.000073431554,0.000020899712,0.9520803,0.0028380346,0.035332296,0.009373347,0.000018046941],"about_ca_topic_score_codex":0.0022708145,"about_ca_topic_score_gemma":0.0030696632,"teacher_disagreement_score":0.005518962,"about_ca_system_score_codex":0.0012727713,"about_ca_system_score_gemma":0.0013898257,"threshold_uncertainty_score":0.018462777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13375194,0.00084360247,0.854875,0.00064887357,0.00014367943,0.00013729966,0.00009381911,0.0026548943,0.00685089],"genre_scores_gemma":[0.5569256,0.00060556224,0.4396302,0.0001245929,0.00010836367,0.00007963413,0.000208435,0.00019433233,0.0021233803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.0003346288,0.0000510253,0.0001564764,0.00035156493,0.00012404346],"domain_scores_gemma":[0.998698,0.00054641,0.00011422566,0.00031701013,0.00027554372,0.000048897637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001969354,0.00060406304,0.00056965783,0.0013576373,0.00068287406,0.0009192943,0.0007866559,0.0006597677,0.0011221734],"category_scores_gemma":[0.0039930954,0.00021318796,0.00039389593,0.0011440379,0.000541913,0.0017413169,0.0012731816,0.0009641268,0.00035360458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033598032,0.00042809863,0.0051759277,0.00025668374,0.000092539834,0.00022399309,0.00048034659,0.33059984,0.044368804,0.06321401,0.0078969095,0.54692686],"study_design_scores_gemma":[0.000046333127,0.00024449825,0.0013564986,0.000016829741,0.000046410958,0.0002140529,0.000053940956,0.9599652,0.019105032,0.014065309,0.0048678922,0.000017959077],"about_ca_topic_score_codex":0.0022064259,"about_ca_topic_score_gemma":0.0025002703,"teacher_disagreement_score":0.0022064259,"about_ca_system_score_codex":0.00061664503,"about_ca_system_score_gemma":0.0012502493,"threshold_uncertainty_score":0.010415077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15317462,0.00035383806,0.82915086,0.0006252622,0.00020865153,0.00018001832,0.00010969785,0.0013716999,0.014825292],"genre_scores_gemma":[0.8530416,0.00008793128,0.14235185,0.00010001142,0.000024449371,0.00017536254,0.000100981524,0.0001283156,0.003989595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00026945543,0.000015269634,0.000068948386,0.00010939334,0.00007933505],"domain_scores_gemma":[0.9981621,0.0013112135,0.00007723326,0.00016421883,0.00020007808,0.00008519918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950778,0.00038756663,0.0009117237,0.00045931555,0.00053291995,0.00067861367,0.00126055,0.00082349475,0.003532157],"category_scores_gemma":[0.0029091726,0.0004595715,0.0005781661,0.0004204894,0.00068045966,0.000554607,0.00078904675,0.0008521297,0.00031333583],"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.00006526332,0.000026997064,0.00022595529,0.000015034859,0.000015417654,0.000016892496,0.000022386603,0.98765683,0.0006640499,0.003362046,0.00032180178,0.0076072905],"study_design_scores_gemma":[0.000007347916,0.000010371456,0.000026222384,0.0000010668721,0.0000019529323,0.0000015206406,0.0000026090415,0.9991104,0.00014643004,0.0005754307,0.0001155904,0.0000011187923],"about_ca_topic_score_codex":0.009087978,"about_ca_topic_score_gemma":0.007888935,"teacher_disagreement_score":0.009087978,"about_ca_system_score_codex":0.0012357173,"about_ca_system_score_gemma":0.0013893176,"threshold_uncertainty_score":0.018070161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73336935,0.0018630947,0.22374114,0.0010306762,0.0002483547,0.00017316213,0.00020688915,0.00034764642,0.039019678],"genre_scores_gemma":[0.9916225,0.00031968317,0.0056702285,0.00004378889,0.00002568845,0.000033998258,0.000026802607,0.000027302634,0.0022300058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.0002245593,0.000012251492,0.000082346305,0.0001037971,0.0001267494],"domain_scores_gemma":[0.9990582,0.00049767835,0.00014595705,0.000064348525,0.00014727683,0.00008640537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091040996,0.00047279877,0.00053461234,0.0008970026,0.0008787853,0.00097365,0.0013662396,0.0007298148,0.0022006207],"category_scores_gemma":[0.0023723883,0.00030777827,0.000647174,0.00045026856,0.0009550415,0.0016583455,0.0009209057,0.0006062473,0.00013237089],"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.000084307736,0.000043305336,0.0018146562,0.0000550964,0.000032193275,0.0002472409,0.00009448,0.9403174,0.0024818114,0.05111173,0.000584544,0.0031332416],"study_design_scores_gemma":[0.0000028598283,0.00001831583,0.00012741453,0.0000034253787,0.0000047383282,0.000014528088,0.000016997921,0.99780005,0.00016522572,0.0016488533,0.0001944814,0.0000030728243],"about_ca_topic_score_codex":0.005784312,"about_ca_topic_score_gemma":0.0018533629,"teacher_disagreement_score":0.005784312,"about_ca_system_score_codex":0.0014535354,"about_ca_system_score_gemma":0.00077913515,"threshold_uncertainty_score":0.011501253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44623482,0.0016691901,0.52523637,0.0015166426,0.00041324203,0.000085857544,0.00010592008,0.0005767758,0.024161225],"genre_scores_gemma":[0.9778527,0.0002716257,0.015735582,0.0000811711,0.00013420607,0.000037066562,0.000018352554,0.000045772318,0.005823547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988651,0.0004709522,0.00004862882,0.00016096597,0.00020625358,0.00024814054],"domain_scores_gemma":[0.9960192,0.0025635492,0.00038795194,0.00044943893,0.00031442122,0.00026557062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023241288,0.00029291923,0.00047941078,0.0006674853,0.0009582137,0.0015767838,0.001088972,0.0004833664,0.0027836876],"category_scores_gemma":[0.008386605,0.00036907344,0.00026757643,0.000485596,0.0012892502,0.0023505925,0.0012061915,0.000809344,0.00029095422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014326934,0.0001355819,0.0015232497,0.00007764524,0.00004860658,0.00017432768,0.0004664708,0.33027792,0.008769627,0.59828424,0.0028168554,0.055992797],"study_design_scores_gemma":[0.000054503802,0.0001060271,0.0006252748,0.00001435519,0.000029092571,0.00007089943,0.000092503265,0.791049,0.003157103,0.20212801,0.0026479238,0.000025348096],"about_ca_topic_score_codex":0.0016955636,"about_ca_topic_score_gemma":0.0011757654,"teacher_disagreement_score":0.0027836876,"about_ca_system_score_codex":0.0014094602,"about_ca_system_score_gemma":0.00089370407,"threshold_uncertainty_score":0.012291372},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13703021,0.007869907,0.0050878786,0.19298366,0.0017512307,0.00019028447,0.0012396123,0.00024998994,0.6535973],"genre_scores_gemma":[0.83887756,0.006001857,0.0028755236,0.022348315,0.00016333154,0.000052603707,0.00027635726,0.000106758285,0.12929769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994024,0.0004061746,0.00009305133,0.0004344347,0.0028055424,0.0022369237],"domain_scores_gemma":[0.9939342,0.0006817252,0.0001988271,0.0001570262,0.0033350838,0.0016932262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268794,0.00027307443,0.00031086116,0.001279762,0.02030035,0.00993283,0.0017217302,0.002359444,0.007734934],"category_scores_gemma":[0.0065222587,0.00030563463,0.0003832903,0.0026425538,0.008147755,0.0023545835,0.003439789,0.00486799,0.00034838385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051722083,0.000037716676,0.0070956973,0.00014432655,0.000015522293,0.0008279283,0.01300589,0.0011101709,0.0008525403,0.82995266,0.096306115,0.0505997],"study_design_scores_gemma":[0.000023945551,0.000037662518,0.027249577,0.00029003274,0.000025966932,0.0002378021,0.015263092,0.0021277822,0.0008920551,0.032591257,0.9211067,0.00015407914],"about_ca_topic_score_codex":0.9975777,"about_ca_topic_score_gemma":0.9978388,"teacher_disagreement_score":0.2387267,"about_ca_system_score_codex":0.2387267,"about_ca_system_score_gemma":0.30396557,"threshold_uncertainty_score":0.88296914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05034094,0.0010222832,0.9382034,0.0011551753,0.00024781335,0.00010782907,0.000028940432,0.00036467603,0.008528815],"genre_scores_gemma":[0.8866497,0.0005980899,0.10872525,0.0002413144,0.0001538664,0.00006597376,0.000037680486,0.000049668182,0.003478427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979983,0.00070396595,0.000106807056,0.00013647393,0.00082990737,0.00022447764],"domain_scores_gemma":[0.9982174,0.0007239013,0.00017258934,0.00023667954,0.00051561097,0.00013377573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033094063,0.0006454631,0.0005930145,0.00070592546,0.0007685752,0.0018019403,0.001977744,0.0013110103,0.001713621],"category_scores_gemma":[0.0064624944,0.00043132162,0.0005140932,0.0010010345,0.0014015838,0.003307961,0.0010564588,0.0017485297,0.00026641667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041571615,0.00024509727,0.0012655293,0.00007462697,0.00007028268,0.00018261731,0.00025853468,0.3691921,0.012340749,0.43486634,0.0019151131,0.17917323],"study_design_scores_gemma":[0.00003258466,0.00004997689,0.00019834035,0.000007958362,0.000020882302,0.000050055452,0.00002171532,0.9158733,0.0035394325,0.077787034,0.0023951067,0.000023711767],"about_ca_topic_score_codex":0.0038706595,"about_ca_topic_score_gemma":0.002366786,"teacher_disagreement_score":0.0038706595,"about_ca_system_score_codex":0.0019101094,"about_ca_system_score_gemma":0.0013092085,"threshold_uncertainty_score":0.01750207},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13703021,0.007869907,0.0050878786,0.19298366,0.0017512307,0.00019028447,0.0012396123,0.00024998994,0.6535973],"genre_scores_gemma":[0.83887756,0.006001857,0.0028755236,0.022348315,0.00016333154,0.000052603707,0.00027635726,0.000106758285,0.12929769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.994024,0.0004061746,0.00009305133,0.0004344347,0.0028055424,0.0022369237],"domain_scores_gemma":[0.9939342,0.0006817252,0.0001988271,0.0001570262,0.0033350838,0.0016932262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268794,0.00027307443,0.00031086116,0.001279762,0.02030035,0.00993283,0.0017217302,0.002359444,0.007734934],"category_scores_gemma":[0.0065222587,0.00030563463,0.0003832903,0.0026425538,0.008147755,0.0023545835,0.003439789,0.00486799,0.00034838385],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051722083,0.000037716676,0.0070956973,0.00014432655,0.000015522293,0.0008279283,0.01300589,0.0011101709,0.0008525403,0.82995266,0.096306115,0.0505997],"study_design_scores_gemma":[0.000023945551,0.000037662518,0.027249577,0.00029003274,0.000025966932,0.0002378021,0.015263092,0.0021277822,0.0008920551,0.032591257,0.9211067,0.00015407914],"about_ca_topic_score_codex":0.9975777,"about_ca_topic_score_gemma":0.9978388,"teacher_disagreement_score":0.2387267,"about_ca_system_score_codex":0.2387267,"about_ca_system_score_gemma":0.30396557,"threshold_uncertainty_score":0.88296914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26706392,0.0019325075,0.7227165,0.0007648107,0.00014367791,0.00012944554,0.00010941756,0.00067968975,0.0064599845],"genre_scores_gemma":[0.9492546,0.0008171983,0.04847649,0.00009264729,0.000031579366,0.000057781686,0.000066754386,0.000041191848,0.0011618136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995803,0.00017213706,0.000020042018,0.000059894188,0.00012278068,0.000044856533],"domain_scores_gemma":[0.99791044,0.0012647093,0.00023262149,0.0002655704,0.00024358305,0.00008307517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392925,0.00038901248,0.00037171112,0.00050120964,0.00046792493,0.0009643996,0.00051371404,0.0006471411,0.0013609359],"category_scores_gemma":[0.0040918356,0.00021189505,0.00018028928,0.00057200686,0.0009331627,0.0014244505,0.0007456789,0.00062856474,0.00018846687],"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.00010486038,0.000051138606,0.0014440368,0.000070873364,0.000033358312,0.00006824423,0.000078722536,0.9094804,0.008825483,0.029267048,0.0008996366,0.049676165],"study_design_scores_gemma":[0.000013901468,0.000049080438,0.00043604177,0.00000707854,0.000005902295,0.0000381916,0.000022112477,0.9712314,0.0015706331,0.025542753,0.001072453,0.000010361646],"about_ca_topic_score_codex":0.0014918653,"about_ca_topic_score_gemma":0.0009483728,"teacher_disagreement_score":0.0014918653,"about_ca_system_score_codex":0.00075949065,"about_ca_system_score_gemma":0.00034540117,"threshold_uncertainty_score":0.0060252547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024309674,0.0024084193,0.92565554,0.013582256,0.00035520052,0.000119462304,0.0001122405,0.00024025934,0.033216946],"genre_scores_gemma":[0.8980266,0.0034509136,0.08865943,0.0026874433,0.0011227193,0.00035931508,0.00009997145,0.00017435662,0.0054193833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98781395,0.0071059437,0.00035850596,0.0015739633,0.002388764,0.0007588946],"domain_scores_gemma":[0.8670555,0.115749694,0.0041861534,0.00859626,0.0031032136,0.0013092807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01828831,0.0013295765,0.0014551766,0.0015218491,0.0022398545,0.0045834966,0.003094619,0.0048721754,0.004877727],"category_scores_gemma":[0.082912154,0.00094736984,0.0013268187,0.0010183806,0.013026313,0.01158566,0.0055356375,0.008870433,0.00064687926],"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.000049952392,0.000047299203,0.00088666857,0.00012731482,0.000043735898,0.00013598854,0.00023435123,0.13474673,0.00043844455,0.85336363,0.002206534,0.007719266],"study_design_scores_gemma":[0.000022093316,0.00004470947,0.00014748718,0.000056249857,0.000010957635,0.00006905238,0.000056253826,0.23366864,0.0002072934,0.7632048,0.0024910974,0.000021439731],"about_ca_topic_score_codex":0.0024125492,"about_ca_topic_score_gemma":0.0011232017,"teacher_disagreement_score":0.01828831,"about_ca_system_score_codex":0.004049412,"about_ca_system_score_gemma":0.0023296757,"threshold_uncertainty_score":0.09671903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15971139,0.00020705601,0.8199022,0.00018769606,0.00012587829,0.00029808204,0.0005678992,0.0029703383,0.016029455],"genre_scores_gemma":[0.8175741,0.0001864382,0.17206645,0.0001000107,0.000033719072,0.00048104627,0.000500328,0.00011352048,0.008944274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996019,0.0000890218,0.000017537324,0.00005169235,0.00018485793,0.000055094642],"domain_scores_gemma":[0.9994629,0.00028167127,0.00003255198,0.00007832097,0.00010798022,0.00003667436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047914142,0.00044996457,0.00058764295,0.0005127027,0.00034213817,0.0009142957,0.0011715004,0.0009019386,0.003643561],"category_scores_gemma":[0.0011089996,0.0002588318,0.0004879897,0.0004479608,0.00041795496,0.0008513137,0.0008592854,0.00056007784,0.00042744845],"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.000101871796,0.0000744753,0.0006763189,0.000031299893,0.00002109445,0.000048623562,0.000029043013,0.97491133,0.0037928123,0.006139078,0.00051965244,0.013654333],"study_design_scores_gemma":[0.0000116609845,0.0000193897,0.000071147326,0.0000011187495,0.0000026448329,0.000007502757,0.000002618883,0.9970714,0.0011115557,0.0011406278,0.0005567449,0.0000034966843],"about_ca_topic_score_codex":0.006396259,"about_ca_topic_score_gemma":0.0027461655,"teacher_disagreement_score":0.006396259,"about_ca_system_score_codex":0.0005999854,"about_ca_system_score_gemma":0.00070898805,"threshold_uncertainty_score":0.0127180815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100658685,0.001994003,0.9800126,0.00044237816,0.00029562615,0.0003284088,0.000050991934,0.00071649236,0.0060935956],"genre_scores_gemma":[0.4213744,0.002291963,0.5618876,0.0008588508,0.00036957054,0.0015853059,0.00034816045,0.00013980438,0.011144293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00030459606,0.00006632188,0.000078452125,0.00038535404,0.00006312668],"domain_scores_gemma":[0.99918514,0.00030718237,0.00009784806,0.00014018749,0.0002071173,0.000062597624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014555003,0.00033943527,0.0004245967,0.00058029604,0.0010560644,0.0009769226,0.001359408,0.0008889061,0.0011079594],"category_scores_gemma":[0.0028518278,0.00019127932,0.00024197015,0.0005440818,0.00066354586,0.0015893513,0.0011025439,0.0013739249,0.00042514695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007244128,0.00042328268,0.0010813511,0.0008718292,0.00011238296,0.0010272585,0.0011685421,0.032640193,0.07992766,0.32783964,0.01930767,0.53487575],"study_design_scores_gemma":[0.00036066948,0.00091390335,0.0012630837,0.0002093544,0.00021118925,0.0024199751,0.00028554155,0.5620613,0.06268456,0.13097432,0.23847604,0.00014008519],"about_ca_topic_score_codex":0.00046897694,"about_ca_topic_score_gemma":0.00063962775,"teacher_disagreement_score":0.0014555003,"about_ca_system_score_codex":0.0005890305,"about_ca_system_score_gemma":0.0008431841,"threshold_uncertainty_score":0.0076975226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018889116,0.0003874396,0.96931857,0.00032565085,0.0004314625,0.00011693371,0.000042578416,0.0017256197,0.008762688],"genre_scores_gemma":[0.765805,0.00036229144,0.20418558,0.00022367241,0.00025222384,0.00018491158,0.00011881328,0.00019502842,0.028672498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940026,0.000083585706,0.00002395563,0.00014203771,0.00027799714,0.00007226189],"domain_scores_gemma":[0.9995509,0.0001119355,0.00002144784,0.00006053834,0.00021250804,0.000042777476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007534569,0.00055843126,0.00046557063,0.0005628783,0.0007868621,0.0011717555,0.0017406705,0.0007078231,0.006246253],"category_scores_gemma":[0.0020000278,0.00023860039,0.000361369,0.0004003599,0.00045563566,0.0011932595,0.0007566942,0.0009601822,0.00057553366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004466104,0.00053311145,0.00047120109,0.00019775867,0.00009848497,0.00014616005,0.0002834316,0.2831462,0.038729686,0.054286513,0.015165776,0.606495],"study_design_scores_gemma":[0.000052763222,0.00008199075,0.00008294972,0.0000054388056,0.00002332199,0.00003550838,0.000019943926,0.9847003,0.005183263,0.005797126,0.0040048915,0.000012564221],"about_ca_topic_score_codex":0.0052542337,"about_ca_topic_score_gemma":0.00633827,"teacher_disagreement_score":0.006246253,"about_ca_system_score_codex":0.00088505144,"about_ca_system_score_gemma":0.0013214528,"threshold_uncertainty_score":0.02089578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053481124,0.00008793549,0.9401393,0.0002479099,0.000057238398,0.000107102795,0.00011500735,0.0021158105,0.0036485791],"genre_scores_gemma":[0.84031254,0.00012430399,0.15680538,0.00009486348,0.000028511009,0.00012971913,0.00014269188,0.0002796789,0.0020823244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998171,0.0005646699,0.00015645579,0.0002631862,0.0006006809,0.00024405202],"domain_scores_gemma":[0.99596596,0.0023520319,0.0003491532,0.0008305388,0.00040802947,0.00009426728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027467038,0.0007903734,0.00095038355,0.0005708742,0.0010618465,0.0023979726,0.0017180364,0.0011802742,0.0027696418],"category_scores_gemma":[0.008390509,0.00093662407,0.0015406279,0.00049094396,0.0025124408,0.0040811854,0.0016308336,0.002376604,0.00032779144],"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.00028230058,0.000120617915,0.0012720287,0.00021403955,0.000078702236,0.0002553178,0.000299311,0.6524795,0.0073133106,0.31731042,0.0010757941,0.019298626],"study_design_scores_gemma":[0.00005291073,0.000038594022,0.00006107256,0.000011777293,0.00003173211,0.000036025183,0.000030693227,0.91050994,0.0052207652,0.082978085,0.0010136332,0.000014804698],"about_ca_topic_score_codex":0.0056248326,"about_ca_topic_score_gemma":0.0058512664,"teacher_disagreement_score":0.0056248326,"about_ca_system_score_codex":0.0010489858,"about_ca_system_score_gemma":0.002181649,"threshold_uncertainty_score":0.014526129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14331622,0.00046410412,0.8482392,0.0013289788,0.00008848236,0.00010317531,0.00006074151,0.000349291,0.0060498267],"genre_scores_gemma":[0.87150663,0.00049206946,0.12539107,0.00025950206,0.00012367187,0.00014191077,0.000089279834,0.00009292501,0.0019029072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967925,0.0014887309,0.00013457409,0.00054587686,0.0006308013,0.00040744068],"domain_scores_gemma":[0.9880034,0.008517136,0.0014213135,0.001251941,0.00055098353,0.00025518448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004773439,0.0005651235,0.0009457015,0.000628713,0.0010789951,0.0020570485,0.0021443928,0.0018727401,0.001138186],"category_scores_gemma":[0.018923152,0.00064531,0.00091192964,0.0010803337,0.003168335,0.005015747,0.0023456898,0.0028466552,0.0001662219],"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.00024175951,0.00015748237,0.0029378305,0.00016392858,0.000077509445,0.0005629859,0.0005846935,0.62946874,0.0047536315,0.33256963,0.002072369,0.026409475],"study_design_scores_gemma":[0.000057365258,0.00010308508,0.00028161486,0.000015971818,0.000035607554,0.0001725259,0.0001441673,0.8257779,0.0023974914,0.16939797,0.0015967241,0.00001959483],"about_ca_topic_score_codex":0.0017636192,"about_ca_topic_score_gemma":0.0010313429,"teacher_disagreement_score":0.004773439,"about_ca_system_score_codex":0.001424325,"about_ca_system_score_gemma":0.0010357422,"threshold_uncertainty_score":0.025244653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63965815,0.00042975394,0.355185,0.00026451665,0.00007224018,0.00007601069,0.00008957461,0.0017014307,0.0025232846],"genre_scores_gemma":[0.9913795,0.00005138864,0.008248721,0.000009785999,0.000003461303,0.000014968031,0.000022065333,0.000011541088,0.00025858532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994616,0.00016358081,0.000031932155,0.00011391218,0.00015223044,0.0000767262],"domain_scores_gemma":[0.9979095,0.0011806209,0.00027672344,0.00019053253,0.0003365693,0.00010604591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010413363,0.0005005639,0.00043854798,0.00034944693,0.00034623907,0.0005686036,0.00081652566,0.00032271637,0.00054014544],"category_scores_gemma":[0.0028706864,0.00018227691,0.00021247103,0.00023563945,0.0004300362,0.000751951,0.00038467676,0.0005296034,0.00007077014],"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.00018865406,0.00011645607,0.0033260274,0.000040743194,0.00002575802,0.00009421389,0.000054986296,0.961304,0.010078183,0.0012287521,0.00032177253,0.02322032],"study_design_scores_gemma":[0.000004595649,0.00002808858,0.00029766548,9.157193e-7,0.0000033634062,0.000007396457,0.0000067521714,0.9977642,0.0015733894,0.00026215328,0.000049069786,0.0000024400047],"about_ca_topic_score_codex":0.005361193,"about_ca_topic_score_gemma":0.003399852,"teacher_disagreement_score":0.005361193,"about_ca_system_score_codex":0.00058965856,"about_ca_system_score_gemma":0.0007609222,"threshold_uncertainty_score":0.010659993},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012590149,0.0217148,0.0050344346,0.015627772,0.02593051,0.0015703064,0.106548294,0.003019432,0.80796427],"genre_scores_gemma":[0.095503286,0.02201297,0.0020249663,0.0020402402,0.008565845,0.00092117675,0.029629888,0.0008491116,0.83845246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938345,0.00013458768,0.000034691064,0.000102986094,0.00024393796,0.000100245015],"domain_scores_gemma":[0.996949,0.0011891412,0.00014697094,0.0003449338,0.00081451394,0.00055529183],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010714362,0.00083017675,0.0014384427,0.0010972098,0.0008776388,0.0023577386,0.00081588275,0.0013561422,0.60759145],"category_scores_gemma":[0.003988147,0.00017349682,0.00053998537,0.0028639855,0.00018229689,0.0009141227,0.0007298479,0.00090466696,0.26778287],"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.0004664864,0.00016937964,0.0010433206,0.0004203356,0.000024217423,0.00002614286,0.000021457412,0.0002275189,0.00084860984,0.0009858387,0.9303573,0.06540955],"study_design_scores_gemma":[0.00023181427,0.00038948894,0.01821437,0.00043755138,0.00011015194,0.00012815926,0.000124362,0.0018562676,0.0017136058,0.0015623188,0.9751908,0.000041106756],"about_ca_topic_score_codex":0.004856832,"about_ca_topic_score_gemma":0.007686284,"teacher_disagreement_score":0.39240855,"about_ca_system_score_codex":0.0008748661,"about_ca_system_score_gemma":0.0010033156,"threshold_uncertainty_score":0.55972314},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01592807,0.02499251,0.39468715,0.5332706,0.011742742,0.00023549875,0.00055442395,0.0037112082,0.014877849],"genre_scores_gemma":[0.45243543,0.019784855,0.27297655,0.21445367,0.019436507,0.0011855005,0.00052566244,0.004835963,0.0143658975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9434229,0.036768258,0.0025393842,0.0052042976,0.010500981,0.0015642066],"domain_scores_gemma":[0.6103932,0.31086296,0.015324105,0.02467004,0.034771774,0.003977804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08267846,0.0010886395,0.002487851,0.001920746,0.0020733667,0.005956874,0.003751751,0.0073407204,0.0102838455],"category_scores_gemma":[0.40495685,0.0010086688,0.0016413594,0.0029583457,0.011798217,0.017671535,0.0031199048,0.017958319,0.004977483],"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.0009547341,0.0006011626,0.036312692,0.0017498945,0.0008087892,0.00068396074,0.004653338,0.011435201,0.002087024,0.22331591,0.30374494,0.41365233],"study_design_scores_gemma":[0.0004941533,0.000698543,0.015069399,0.0021886535,0.00031229068,0.0007897014,0.0036348826,0.028830212,0.0048028016,0.72496814,0.2177231,0.0004879877],"about_ca_topic_score_codex":0.0056949374,"about_ca_topic_score_gemma":0.0029114252,"teacher_disagreement_score":0.08267846,"about_ca_system_score_codex":0.0021882774,"about_ca_system_score_gemma":0.0033776446,"threshold_uncertainty_score":0.43725073},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5845669,0.0027301458,0.31865713,0.0019717694,0.00058558927,0.00011259075,0.00011650504,0.0017219388,0.0895374],"genre_scores_gemma":[0.9790147,0.0006564699,0.0072051208,0.00009278904,0.00013367868,0.000020272104,0.0000465304,0.000029115121,0.012801397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999856,0.00003357479,0.0000075545768,0.000019979598,0.000051239742,0.000031721684],"domain_scores_gemma":[0.99972993,0.000109369925,0.000022233777,0.000030801464,0.00008634852,0.000021167374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020766437,0.00019419388,0.00015028297,0.00022531814,0.00031017757,0.0006183697,0.0002493535,0.00029205225,0.0024961152],"category_scores_gemma":[0.0007517414,0.00012785532,0.00008869594,0.00013557648,0.0002809086,0.0006143273,0.00028012737,0.00030097025,0.00047046682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014985057,0.00027636078,0.00370542,0.00034666286,0.00005137722,0.0013482404,0.00065897196,0.09530059,0.34589788,0.10838815,0.012542458,0.42998537],"study_design_scores_gemma":[0.00011483668,0.0007266126,0.00390473,0.00012638084,0.00010859274,0.0009797087,0.00026582603,0.77353716,0.14099722,0.039214823,0.039993435,0.00003061895],"about_ca_topic_score_codex":0.0006624928,"about_ca_topic_score_gemma":0.00043164057,"teacher_disagreement_score":0.0024961152,"about_ca_system_score_codex":0.00039151142,"about_ca_system_score_gemma":0.00027863917,"threshold_uncertainty_score":0.008350372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057811446,0.0008137382,0.9267288,0.001252063,0.00013123921,0.00008966226,0.0001927762,0.00019840794,0.01278193],"genre_scores_gemma":[0.9308223,0.0013331212,0.05766015,0.00023539687,0.0002509036,0.0002017627,0.00014339559,0.000100063975,0.009252893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834836,0.00037303427,0.000051558985,0.00021146481,0.0007625024,0.00025311921],"domain_scores_gemma":[0.99687886,0.0018333228,0.00036571256,0.00015365191,0.0006025063,0.00016601491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368573,0.00074198376,0.00091468304,0.0012633505,0.0008323249,0.0015594816,0.0012134678,0.00079274154,0.0021522339],"category_scores_gemma":[0.006045897,0.00036933532,0.0009885597,0.0008220479,0.0019281473,0.002297632,0.001356633,0.0015618466,0.00022335802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035803558,0.0000359415,0.0003698501,0.000058334692,0.000028012337,0.000118905315,0.000095256604,0.4355131,0.0035295943,0.55390066,0.0011335443,0.005180978],"study_design_scores_gemma":[0.0000040236628,0.000010807858,0.0001043915,0.000003947234,0.000007836145,0.000017622098,0.000009203942,0.93879867,0.0002786958,0.060172215,0.00058449974,0.000008121738],"about_ca_topic_score_codex":0.007966991,"about_ca_topic_score_gemma":0.0036174154,"teacher_disagreement_score":0.007966991,"about_ca_system_score_codex":0.003458797,"about_ca_system_score_gemma":0.0029462327,"threshold_uncertainty_score":0.025095463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04034379,0.0048940447,0.9450665,0.0012387484,0.00023266449,0.00014790805,0.00016706702,0.0025525102,0.0053568264],"genre_scores_gemma":[0.82860166,0.0024350793,0.1644879,0.00046687646,0.00041577514,0.0001531351,0.00038583964,0.00023523779,0.0028184704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842995,0.00047549183,0.0000619802,0.000327573,0.0005013432,0.00020359304],"domain_scores_gemma":[0.9962373,0.0013221165,0.000550802,0.00095488975,0.00075207057,0.00018271602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025419898,0.0012179246,0.0012270093,0.0012081249,0.0007332933,0.002181675,0.0019942163,0.0009234621,0.0018085756],"category_scores_gemma":[0.006391427,0.00053270103,0.00067311287,0.0019557478,0.00088195904,0.0027759678,0.0013472434,0.0017479174,0.0006016097],"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.00033822877,0.00037648523,0.0059310272,0.00025331296,0.00020925242,0.00012708848,0.00018064285,0.46789917,0.01706124,0.03301876,0.009699173,0.46490556],"study_design_scores_gemma":[0.000015763422,0.00008499055,0.0011755908,0.000036910697,0.000037802587,0.000076426266,0.000029320843,0.9715479,0.005504009,0.016300952,0.0051670554,0.00002318397],"about_ca_topic_score_codex":0.0050194208,"about_ca_topic_score_gemma":0.004427642,"teacher_disagreement_score":0.0050194208,"about_ca_system_score_codex":0.0013606015,"about_ca_system_score_gemma":0.0018076668,"threshold_uncertainty_score":0.01344347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34607401,0.0033705889,0.64471036,0.00025525744,0.00017099346,0.00017780357,0.00005185078,0.0012915705,0.0038974462],"genre_scores_gemma":[0.9508791,0.00047762247,0.04753624,0.000048344238,0.000048430997,0.000045477187,0.000032392345,0.00006527609,0.0008672031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878305,0.00040403052,0.00006857598,0.0002029883,0.00032374918,0.00021767021],"domain_scores_gemma":[0.995667,0.0024444421,0.0006240744,0.0004997733,0.0006034749,0.0001612721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017653485,0.001145199,0.0007203477,0.00091805495,0.0006705249,0.001313518,0.001437654,0.00052669516,0.00081130216],"category_scores_gemma":[0.0062535093,0.00022166333,0.0002888437,0.0005668376,0.00058067613,0.0019042561,0.000909461,0.0007637576,0.00021390326],"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.0014437734,0.0005549668,0.0029958233,0.00036376007,0.000119880664,0.00034329912,0.00027552823,0.68183076,0.06756497,0.017922996,0.0016407713,0.2249435],"study_design_scores_gemma":[0.000028608876,0.00047172495,0.00056882255,0.000019364861,0.00005106177,0.00010986919,0.00006671063,0.9799968,0.014529501,0.0029750883,0.0011649962,0.00001738955],"about_ca_topic_score_codex":0.0016907147,"about_ca_topic_score_gemma":0.0019209764,"teacher_disagreement_score":0.0017653485,"about_ca_system_score_codex":0.001007918,"about_ca_system_score_gemma":0.0011106902,"threshold_uncertainty_score":0.009336233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017397564,0.00027913242,0.9735757,0.000356863,0.00016716264,0.0001287448,0.00008030095,0.0034588957,0.004555554],"genre_scores_gemma":[0.7694269,0.00025522217,0.22325273,0.0004916806,0.000102068465,0.00041470543,0.00024029239,0.0003465448,0.0054698274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.00025859446,0.0000405853,0.00016617325,0.00023232333,0.00017276482],"domain_scores_gemma":[0.9976337,0.0013592253,0.00017025968,0.00022295705,0.000426458,0.0001873607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943879,0.0013343234,0.0010442621,0.0006701659,0.0009016667,0.0010823229,0.0028447001,0.0013216862,0.00350363],"category_scores_gemma":[0.007191629,0.00053978205,0.00062096596,0.00042551348,0.0014531644,0.0017736945,0.0018419595,0.0025604018,0.0006423781],"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.00011712497,0.000107720334,0.0005872574,0.00003943075,0.000029959994,0.000038178576,0.000049309874,0.935714,0.00060772384,0.009197374,0.0027851101,0.05072671],"study_design_scores_gemma":[0.000014682134,0.00002370165,0.000027020937,0.0000029817559,0.0000032664339,0.0000040322843,0.0000028946397,0.99630797,0.00026441418,0.0030391556,0.00030679576,0.0000032499934],"about_ca_topic_score_codex":0.010715563,"about_ca_topic_score_gemma":0.008662811,"teacher_disagreement_score":0.010715563,"about_ca_system_score_codex":0.0014023762,"about_ca_system_score_gemma":0.0030807059,"threshold_uncertainty_score":0.021306396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08003366,0.00044931256,0.91253644,0.00041103625,0.0001971992,0.00010456115,0.000050958162,0.0024620346,0.0037547864],"genre_scores_gemma":[0.94621634,0.0001268072,0.051508088,0.00013584745,0.000077487595,0.000054488457,0.000046698988,0.00003507584,0.001799103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.000087149565,0.000033257944,0.00011779433,0.00013499444,0.00007350048],"domain_scores_gemma":[0.99899024,0.00036346904,0.00016166046,0.00012489292,0.00026494934,0.00009478185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096843956,0.0005427641,0.0005428557,0.00046387553,0.0004360527,0.0010872736,0.0016682938,0.0006415992,0.0008749127],"category_scores_gemma":[0.0021810348,0.0002601398,0.00027335656,0.00028736732,0.0005095286,0.0013465758,0.00084244605,0.0008735674,0.00018232645],"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.0003681942,0.00054486824,0.0032670726,0.00012848464,0.00009075811,0.00013644353,0.00014937577,0.7279405,0.03229241,0.011820243,0.003618529,0.21964312],"study_design_scores_gemma":[0.00001077072,0.00002264783,0.00012210243,0.0000017117152,0.000005787108,0.0000069662797,0.00000259508,0.9974451,0.0012785351,0.00083827873,0.00026067434,0.0000047841113],"about_ca_topic_score_codex":0.0047856625,"about_ca_topic_score_gemma":0.005367439,"teacher_disagreement_score":0.0047856625,"about_ca_system_score_codex":0.0007447326,"about_ca_system_score_gemma":0.0010396938,"threshold_uncertainty_score":0.0095155835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05748594,0.0011352843,0.8903934,0.0008824158,0.0004036857,0.0002388647,0.0032870614,0.026899064,0.019274354],"genre_scores_gemma":[0.6123797,0.0009139562,0.36172,0.0007546775,0.00008177837,0.0005068661,0.0084327925,0.0018367955,0.013373398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997254,0.00006240961,0.00001688707,0.00007511841,0.00007784858,0.000042334945],"domain_scores_gemma":[0.9992361,0.00037278625,0.00005670369,0.00016135363,0.00012478342,0.000048216225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070234376,0.00094515114,0.0006093372,0.000475171,0.00035425343,0.0010491027,0.0023423922,0.0009172042,0.009345029],"category_scores_gemma":[0.002952224,0.00048044926,0.0005727603,0.00049291126,0.0004852338,0.0017844423,0.0010916226,0.0017018457,0.0014068915],"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.00020627442,0.00011449421,0.0022502847,0.0001806976,0.000077139346,0.00010758957,0.000047582216,0.8753798,0.0021367571,0.022909557,0.015906494,0.08068339],"study_design_scores_gemma":[0.000009235671,0.000013029925,0.00005879899,0.000006138049,0.000002935744,0.000009448777,0.0000035555718,0.9918988,0.0008655917,0.004842378,0.0022861005,0.000003955942],"about_ca_topic_score_codex":0.010120987,"about_ca_topic_score_gemma":0.014944383,"teacher_disagreement_score":0.010120987,"about_ca_system_score_codex":0.0011203613,"about_ca_system_score_gemma":0.0015847266,"threshold_uncertainty_score":0.03126222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9452448,0.0012366767,0.050073374,0.00032119287,0.000045408728,0.000057020578,0.00013418347,0.00022102553,0.002666326],"genre_scores_gemma":[0.99772686,0.00020291912,0.0017238144,0.000026586347,0.000012050953,0.0000064256546,0.000035310146,0.000008854196,0.00025723648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99931574,0.00014021448,0.00002694494,0.00008821502,0.00028247657,0.00014641756],"domain_scores_gemma":[0.99781203,0.0010630838,0.00027887986,0.00017925516,0.00058305654,0.000083578394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512838,0.00039887434,0.00045422476,0.0006996445,0.00040255563,0.00045173737,0.00037608965,0.00047787346,0.000723244],"category_scores_gemma":[0.0029924747,0.00013205709,0.00027191418,0.00054019585,0.00041673874,0.0010467955,0.0002483975,0.0008742178,0.000100358135],"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.0011754106,0.000833266,0.0761454,0.00060437334,0.00020913393,0.002348184,0.0014743634,0.5125432,0.2802317,0.007400931,0.0027342308,0.114299804],"study_design_scores_gemma":[0.000006171692,0.00045576,0.03443922,0.000032289958,0.0000413601,0.00053049996,0.00034358373,0.9307845,0.030990573,0.0014450978,0.00090416736,0.000026768523],"about_ca_topic_score_codex":0.0036925687,"about_ca_topic_score_gemma":0.0023960858,"teacher_disagreement_score":0.0036925687,"about_ca_system_score_codex":0.0006712334,"about_ca_system_score_gemma":0.00023806636,"threshold_uncertainty_score":0.0073421597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3265281,0.002148452,0.6318327,0.0009101518,0.0011372048,0.00047770044,0.00025667922,0.021607155,0.0151019],"genre_scores_gemma":[0.9148764,0.00034582432,0.077372156,0.000266059,0.00019558163,0.00006790644,0.00022810683,0.00024092606,0.0064070676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.000091355876,0.000058205496,0.0001340962,0.00030945553,0.00014376396],"domain_scores_gemma":[0.99704176,0.0006558959,0.0001775301,0.0006722048,0.0013248096,0.0001277836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012466985,0.00054648763,0.00044033356,0.00094073766,0.00094202475,0.0009573847,0.0012449643,0.00066055893,0.001982149],"category_scores_gemma":[0.002960642,0.00026697555,0.00025105104,0.0005536737,0.00043363293,0.0013717297,0.0006233004,0.0010390803,0.0007058736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014025426,0.0008595478,0.009943747,0.00033831008,0.000099314166,0.00091829966,0.0002906209,0.02850276,0.33394223,0.012195267,0.01320981,0.59829754],"study_design_scores_gemma":[0.00019627846,0.0011790666,0.00742326,0.000056925037,0.00021499845,0.0017399164,0.00011683379,0.5657694,0.39016318,0.0073469467,0.025623703,0.00016946626],"about_ca_topic_score_codex":0.0041226,"about_ca_topic_score_gemma":0.0038050453,"teacher_disagreement_score":0.0041226,"about_ca_system_score_codex":0.0006943465,"about_ca_system_score_gemma":0.0009985485,"threshold_uncertainty_score":0.008197248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015105305,0.0005206695,0.97756314,0.00016272087,0.00010687108,0.00011072307,0.000025240859,0.0005731146,0.0058322595],"genre_scores_gemma":[0.8448858,0.00046950227,0.15001194,0.00014206325,0.000057472087,0.00030946897,0.0000583027,0.000031296266,0.0040340293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979657,0.000021312853,0.000010981615,0.00006954713,0.00006787844,0.00003366799],"domain_scores_gemma":[0.9998492,0.000028122267,0.000029077153,0.0000084143185,0.0000779844,0.000007222637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957859,0.0006138863,0.00053492305,0.00042084933,0.0005276929,0.000985788,0.00088733435,0.00087224663,0.0017482619],"category_scores_gemma":[0.000620813,0.00025111806,0.00033528236,0.00030924068,0.00033396197,0.00043384876,0.00032019446,0.0004730158,0.00037846414],"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.00026165717,0.00021254894,0.0015842569,0.0004918867,0.00009725541,0.00036154143,0.00021855146,0.6849878,0.07417284,0.018891795,0.0035810901,0.21513878],"study_design_scores_gemma":[0.00003534865,0.0001362563,0.00029094887,0.00001648471,0.000022847194,0.000055090022,0.000020609208,0.9889187,0.0061276765,0.0017940316,0.0025699788,0.000012041278],"about_ca_topic_score_codex":0.003988918,"about_ca_topic_score_gemma":0.002881437,"teacher_disagreement_score":0.003988918,"about_ca_system_score_codex":0.00054625253,"about_ca_system_score_gemma":0.000871994,"threshold_uncertainty_score":0.007931411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98454434,0.00027160192,0.013435791,0.000017042534,0.000024013205,0.000047642734,0.00011099824,0.0005416062,0.0010068779],"genre_scores_gemma":[0.989456,0.00009648819,0.009791559,0.000011576645,0.000009498291,0.000028181232,0.00016003271,0.000037527006,0.0004090277],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00021000119,0.00009312252,0.00018291002,0.00059463317,0.00009183341],"domain_scores_gemma":[0.9980026,0.00071882975,0.00027130637,0.00029299705,0.0006276205,0.00008680359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094289216,0.0003991558,0.00031141643,0.0012440444,0.00017266095,0.0005175072,0.00055870484,0.00055764295,0.00068462564],"category_scores_gemma":[0.0034821962,0.00021409137,0.00018030888,0.0012413552,0.00018081159,0.00096301455,0.0002986649,0.0005648881,0.00026042692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012554791,0.0010423703,0.058443747,0.00042545784,0.00020256548,0.0003037541,0.00054321537,0.013765735,0.7746281,0.00058346067,0.000754305,0.14805177],"study_design_scores_gemma":[0.000060370425,0.0040359744,0.23153286,0.000036151527,0.00022057853,0.0012316676,0.000288181,0.21812119,0.54193646,0.00037451586,0.0020121173,0.00015007115],"about_ca_topic_score_codex":0.0008472989,"about_ca_topic_score_gemma":0.00075925444,"teacher_disagreement_score":0.0012440444,"about_ca_system_score_codex":0.0002342966,"about_ca_system_score_gemma":0.00018349392,"threshold_uncertainty_score":0.0049865246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2307016,0.0027021135,0.7617742,0.00050097314,0.000042945234,0.00009583524,0.00018145292,0.0009785496,0.0030223527],"genre_scores_gemma":[0.9576301,0.00086414587,0.040959854,0.000014550767,0.00002177891,0.00004565981,0.00008015564,0.00003068941,0.00035302335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993179,0.000151542,0.000029707331,0.0000961269,0.0003386605,0.00006609296],"domain_scores_gemma":[0.9989736,0.00049964804,0.00014792664,0.00013744376,0.00021223327,0.000029190522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093600684,0.00077079353,0.00048874965,0.0010529166,0.00025274904,0.0006442797,0.00076079054,0.0004828502,0.00033094655],"category_scores_gemma":[0.0030329393,0.00027122573,0.00026392538,0.001284759,0.00047089174,0.0012670212,0.0005314524,0.00065162766,0.000073057825],"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.0002173466,0.00020468512,0.013158797,0.00017911875,0.00007498529,0.00010551451,0.00007821433,0.78619456,0.03483071,0.012899133,0.0008671263,0.15118976],"study_design_scores_gemma":[0.0000037595878,0.00008358142,0.0023916971,0.00000649079,0.000013499589,0.00004611431,0.000014436404,0.9859352,0.009481681,0.0015401033,0.00046833296,0.000015138618],"about_ca_topic_score_codex":0.004700047,"about_ca_topic_score_gemma":0.0026164749,"teacher_disagreement_score":0.004700047,"about_ca_system_score_codex":0.0010274687,"about_ca_system_score_gemma":0.00068759354,"threshold_uncertainty_score":0.009345353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00875048,0.0003208832,0.9883057,0.00036912426,0.00006435634,0.000029676632,0.00029480824,0.0013717449,0.0004933033],"genre_scores_gemma":[0.5311186,0.001039241,0.45973456,0.0003864638,0.00021126201,0.00025774576,0.0033399358,0.00037340974,0.0035388523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986738,0.0004628516,0.00008898072,0.00034743446,0.0002828303,0.00014412616],"domain_scores_gemma":[0.99582833,0.0017259155,0.0004910745,0.0008970919,0.00090815226,0.00014934815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786332,0.001630129,0.001335743,0.001400641,0.0007246041,0.0010913097,0.0022295434,0.0012688218,0.0017300952],"category_scores_gemma":[0.013885615,0.0007125448,0.0011849407,0.0025090503,0.0011987792,0.002962012,0.0015320174,0.0037968464,0.00077855366],"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.00018376086,0.00008190595,0.002664954,0.00014421847,0.00010859015,0.00009747466,0.00009363039,0.82295734,0.0018156177,0.022458527,0.005681156,0.14371286],"study_design_scores_gemma":[0.0000022490915,0.0000068005147,0.00011159024,0.000004083811,0.00000399588,0.000007353165,0.0000052002406,0.99073315,0.00034540344,0.008482517,0.00029268017,0.000004991245],"about_ca_topic_score_codex":0.016681112,"about_ca_topic_score_gemma":0.014331957,"teacher_disagreement_score":0.016681112,"about_ca_system_score_codex":0.0017349544,"about_ca_system_score_gemma":0.0023701976,"threshold_uncertainty_score":0.033168018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19980091,0.0058246236,0.5724536,0.0049741175,0.0007512208,0.00018457363,0.000504468,0.0014755971,0.21403097],"genre_scores_gemma":[0.8929337,0.002758516,0.07478806,0.0005589608,0.0006015372,0.0002461104,0.00017729489,0.00077243324,0.027163383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.0002006963,0.000012400695,0.00008972391,0.00018412435,0.00014402923],"domain_scores_gemma":[0.9940341,0.0048632664,0.0002286159,0.00039178637,0.00031160036,0.00017062374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016045589,0.0013188702,0.0009136294,0.0017963517,0.0010094768,0.0015501421,0.0017831203,0.0010614368,0.014133971],"category_scores_gemma":[0.01254759,0.0005690031,0.0007037176,0.0016190028,0.0021507526,0.0040042396,0.0015193274,0.0020701075,0.00086854235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002024059,0.00010363893,0.0004688344,0.00024696387,0.000029775967,0.00009595379,0.000099310884,0.3294666,0.0026729752,0.6398153,0.007759863,0.019038374],"study_design_scores_gemma":[0.000015947715,0.00002165673,0.00028838648,0.000024379264,0.000015485088,0.000035207428,0.000023237712,0.819373,0.00052642496,0.17809848,0.0015691106,0.000008778134],"about_ca_topic_score_codex":0.0025760015,"about_ca_topic_score_gemma":0.0033085411,"teacher_disagreement_score":0.014133971,"about_ca_system_score_codex":0.0025285254,"about_ca_system_score_gemma":0.0014174593,"threshold_uncertainty_score":0.047282815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044317536,0.00031276353,0.75506747,0.0005120594,0.0006382846,0.0008410963,0.00453948,0.1746687,0.019102663],"genre_scores_gemma":[0.43613964,0.00060917874,0.5200974,0.0010823803,0.00021814498,0.0016052217,0.009335108,0.013601206,0.017311752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995778,0.00007731522,0.000042825974,0.000060238937,0.00015204313,0.000089807734],"domain_scores_gemma":[0.9983084,0.00032667216,0.00013495522,0.000473734,0.0006037352,0.00015250484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309655,0.0008942322,0.00046459484,0.00068456173,0.0005858755,0.0007442527,0.0024002679,0.000590758,0.009537145],"category_scores_gemma":[0.0042819967,0.0006373592,0.00048600725,0.00067503116,0.00045189698,0.0009478994,0.00095549977,0.001721473,0.0025969725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002437874,0.0007780181,0.013691904,0.0012813613,0.00041177002,0.0006788862,0.00097589154,0.26410043,0.11419359,0.044955958,0.18167405,0.3748203],"study_design_scores_gemma":[0.00035689128,0.00040572503,0.0026329723,0.00007705262,0.00009732452,0.00036486413,0.000052196698,0.7994849,0.055771735,0.0052069155,0.13536263,0.00018688258],"about_ca_topic_score_codex":0.0072854627,"about_ca_topic_score_gemma":0.0069968347,"teacher_disagreement_score":0.009537145,"about_ca_system_score_codex":0.00087450433,"about_ca_system_score_gemma":0.0022228083,"threshold_uncertainty_score":0.031904876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014167539,0.00021248814,0.94319123,0.000100644895,0.000143641,0.000061614235,0.00075961667,0.050198175,0.0039158734],"genre_scores_gemma":[0.06621114,0.0004961211,0.9051165,0.0003105277,0.00015236631,0.00070097053,0.0026182095,0.013121758,0.0112723345],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941814,0.00016514334,0.000041088068,0.00010043098,0.00021335499,0.000061783816],"domain_scores_gemma":[0.99869066,0.0009650182,0.00006202571,0.00014103444,0.000104943014,0.000036368092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012256696,0.001651111,0.0010245573,0.0010759486,0.00047195246,0.0011546132,0.002290221,0.0010908492,0.035084456],"category_scores_gemma":[0.0036116885,0.0009279334,0.0010933517,0.00096614606,0.00043453876,0.0015289794,0.0011215615,0.002449284,0.00826252],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048957614,0.00024170431,0.00082629884,0.0007390243,0.00024416472,0.00022324403,0.00011440475,0.2871752,0.005621104,0.038281247,0.14840785,0.51763606],"study_design_scores_gemma":[0.00008647032,0.000036011697,0.00012332905,0.00003791367,0.000022941435,0.00007003882,0.000007866064,0.94662195,0.00519286,0.0205993,0.027177341,0.000023908386],"about_ca_topic_score_codex":0.0016035006,"about_ca_topic_score_gemma":0.0023896121,"teacher_disagreement_score":0.035084456,"about_ca_system_score_codex":0.00048193816,"about_ca_system_score_gemma":0.0008225846,"threshold_uncertainty_score":0.117369175},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5373678,0.0021895517,0.43513364,0.0005626957,0.0004384274,0.0002398274,0.00011671223,0.012961535,0.010989729],"genre_scores_gemma":[0.9423946,0.00040523164,0.053874563,0.0001155926,0.000095134674,0.00006967813,0.00016331077,0.00035051352,0.0025314507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988255,0.00020667876,0.00011754053,0.0001258564,0.00057189673,0.00015255358],"domain_scores_gemma":[0.9971209,0.0008888507,0.00021638894,0.0007481031,0.0009105321,0.00011530172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016354439,0.000708208,0.00042267086,0.0010265905,0.00036100726,0.001304867,0.0019826235,0.00066204945,0.0013872458],"category_scores_gemma":[0.006586096,0.00037350066,0.00030819493,0.0006622015,0.00041794736,0.003372228,0.0011678921,0.0014234823,0.0005469332],"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.0013619086,0.0015331864,0.0092705125,0.00045093766,0.0001544158,0.0007175214,0.0006240876,0.055354886,0.44195965,0.00951302,0.004771477,0.47428828],"study_design_scores_gemma":[0.00017026131,0.0010717227,0.006901446,0.000057260542,0.00020313948,0.0010160394,0.00016971726,0.6709502,0.30398473,0.0034041663,0.011942342,0.00012910842],"about_ca_topic_score_codex":0.0013642969,"about_ca_topic_score_gemma":0.0010926245,"teacher_disagreement_score":0.0019826235,"about_ca_system_score_codex":0.0005486717,"about_ca_system_score_gemma":0.0005626801,"threshold_uncertainty_score":0.00864917},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01776286,0.034440655,0.60641235,0.021907471,0.022260906,0.00053290714,0.0026623816,0.01911967,0.27490088],"genre_scores_gemma":[0.1377548,0.028577667,0.3108249,0.005764013,0.007773923,0.0006301684,0.013633083,0.015035726,0.48000574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972518,0.00076486333,0.00018965125,0.00047628602,0.0009073565,0.00041005906],"domain_scores_gemma":[0.99559253,0.001163442,0.000103523744,0.0017869865,0.00088604173,0.00046748575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395642,0.0015114156,0.0012868703,0.0012703381,0.0014125226,0.0055917464,0.0026200288,0.0019147242,0.08443033],"category_scores_gemma":[0.010350592,0.0009302106,0.0010966747,0.0015777098,0.0011816943,0.010785223,0.0050396943,0.0050959922,0.042266686],"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.0007453658,0.0003557076,0.0005787624,0.000393386,0.00006203511,0.0003417363,0.00050398486,0.005372218,0.0046336353,0.11956462,0.46903667,0.39841184],"study_design_scores_gemma":[0.00005312527,0.0000528778,0.00031216905,0.00021749291,0.000029131297,0.00022899866,0.00008643238,0.011542047,0.002226607,0.05084531,0.9343806,0.000025207382],"about_ca_topic_score_codex":0.0031034092,"about_ca_topic_score_gemma":0.0037279727,"teacher_disagreement_score":0.08443033,"about_ca_system_score_codex":0.0015912546,"about_ca_system_score_gemma":0.0017635528,"threshold_uncertainty_score":0.28244764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203673,0.00061289035,0.96408004,0.00032928053,0.00011622303,0.00006877698,0.00002300774,0.0012529987,0.0014801079],"genre_scores_gemma":[0.8212052,0.000204064,0.17701861,0.0002886807,0.00011784642,0.00007779982,0.00004631952,0.00008517449,0.00095619337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854386,0.0005403855,0.00005349847,0.0002602941,0.00040165317,0.00020042757],"domain_scores_gemma":[0.99660045,0.0015867738,0.0005374008,0.00046679142,0.000678765,0.00012998638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895229,0.001001544,0.00082110375,0.0008232194,0.0006940237,0.0011249289,0.0015568949,0.0008079851,0.00064080994],"category_scores_gemma":[0.0056964145,0.00031350343,0.0003498716,0.0006475994,0.0011070779,0.0016988615,0.0009523609,0.0017581861,0.00014323024],"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.0002445581,0.00027562378,0.0024357468,0.00013790176,0.0000930686,0.000067412984,0.00014300838,0.7717102,0.016923212,0.019195603,0.0032036118,0.18557005],"study_design_scores_gemma":[0.000013303075,0.000083175306,0.0002575576,0.000007307114,0.000009396588,0.000023578568,0.000009362168,0.9921886,0.00381871,0.0028633347,0.0007119761,0.000013784047],"about_ca_topic_score_codex":0.0053287293,"about_ca_topic_score_gemma":0.004493593,"teacher_disagreement_score":0.0053287293,"about_ca_system_score_codex":0.0011446162,"about_ca_system_score_gemma":0.0021262153,"threshold_uncertainty_score":0.015311658},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99271846,0.00018199011,0.0036871508,0.0000769179,0.000037251473,0.000045450994,0.00023331607,0.00038549045,0.0026340352],"genre_scores_gemma":[0.99821115,0.00003820628,0.0011339494,0.000012842064,0.000012917815,0.000008366234,0.0001968769,0.000023539802,0.00036208943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977584,0.0009469464,0.00010829943,0.00018022153,0.00064157543,0.00036449483],"domain_scores_gemma":[0.9921715,0.0050922423,0.00039637907,0.00043139778,0.001514686,0.0003938304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030913684,0.0007630341,0.00054055126,0.0011592286,0.0005890294,0.0012234523,0.000864259,0.0010604924,0.0015805238],"category_scores_gemma":[0.010493274,0.00020469438,0.00022291421,0.0011170742,0.0005723245,0.000977995,0.00054393633,0.0005958936,0.000314174],"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.0083186515,0.001665413,0.043590266,0.0002638788,0.00022835261,0.00035668528,0.0002133093,0.83110803,0.039745536,0.0025469,0.003533728,0.068429254],"study_design_scores_gemma":[0.00013321389,0.0021496087,0.0145365065,0.0000121442,0.00008716706,0.00007620668,0.000138033,0.96529806,0.016366849,0.0007026359,0.00047070015,0.000028780332],"about_ca_topic_score_codex":0.01594205,"about_ca_topic_score_gemma":0.008081168,"teacher_disagreement_score":0.01594205,"about_ca_system_score_codex":0.0015409697,"about_ca_system_score_gemma":0.0007936338,"threshold_uncertainty_score":0.031698465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050008938,0.00041079792,0.9451418,0.00019344447,0.00007867193,0.00006219576,0.00005886488,0.0019261269,0.002119263],"genre_scores_gemma":[0.9101844,0.0001584274,0.08785308,0.00013545419,0.000032279095,0.000105866035,0.00009104151,0.00007569419,0.0013637447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999652,0.00007752415,0.00001945732,0.000087384135,0.00009956738,0.000064054824],"domain_scores_gemma":[0.9992747,0.00032555268,0.00009919993,0.00007861878,0.00014755972,0.00007430567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086441304,0.0007908263,0.00062548346,0.0003822323,0.00026973724,0.00063471287,0.0012324237,0.0006367654,0.0012048904],"category_scores_gemma":[0.0019226457,0.00032638598,0.0005202038,0.00024734958,0.0005204002,0.00065232924,0.00093201554,0.00089307374,0.00023583385],"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.00008193562,0.000056097248,0.0011021433,0.00003939421,0.000046992922,0.00004724997,0.000034433786,0.9494862,0.004049342,0.0021289221,0.0005392325,0.042388022],"study_design_scores_gemma":[0.0000084204585,0.000027092981,0.00005918628,0.0000020306795,0.000005613365,0.0000063525013,0.0000026810467,0.9985644,0.000528007,0.00059344113,0.00019952789,0.000003352229],"about_ca_topic_score_codex":0.004753361,"about_ca_topic_score_gemma":0.004308966,"teacher_disagreement_score":0.004753361,"about_ca_system_score_codex":0.00067350623,"about_ca_system_score_gemma":0.0016243004,"threshold_uncertainty_score":0.009451389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124206,0.0004069108,0.86741245,0.00047452346,0.00011408075,0.00026906887,0.0008128641,0.0005304393,0.0057736454],"genre_scores_gemma":[0.9319347,0.00040821463,0.060640287,0.000080318474,0.000046793222,0.0005002771,0.0006500816,0.000035744346,0.00570364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.00022937865,0.000037326023,0.00014344379,0.0001571721,0.00012005745],"domain_scores_gemma":[0.9980946,0.0011941149,0.00022484192,0.00012599012,0.00030468113,0.000055698518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013761144,0.0009193023,0.0007811591,0.0009475017,0.00056071585,0.0009613938,0.002041379,0.0013874936,0.0023817602],"category_scores_gemma":[0.003236557,0.0004203826,0.00096532033,0.00082895986,0.00068919896,0.0013062373,0.0007402072,0.0017731256,0.00035693898],"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.00009436717,0.000069593,0.0020074064,0.000042469277,0.00002124593,0.00010862994,0.00006602111,0.9714968,0.0016788616,0.019129002,0.00044428013,0.004841184],"study_design_scores_gemma":[0.0000045600455,0.000014566839,0.00013353734,0.0000029002665,0.0000061743435,0.000008464396,0.000005825672,0.9976299,0.00023850665,0.0017518534,0.00019902791,0.0000046760483],"about_ca_topic_score_codex":0.018784747,"about_ca_topic_score_gemma":0.012814721,"teacher_disagreement_score":0.018784747,"about_ca_system_score_codex":0.0014318015,"about_ca_system_score_gemma":0.0016253238,"threshold_uncertainty_score":0.037350833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.501065,0.00054605125,0.49106914,0.00005082978,0.00007407201,0.00024320366,0.00088189106,0.0012728076,0.004796975],"genre_scores_gemma":[0.8962926,0.000268365,0.1016716,0.000011276402,0.000033383196,0.00016091115,0.0006921082,0.000060364822,0.0008094335],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99871457,0.0003202986,0.000065922795,0.00036110549,0.00038887936,0.00014921428],"domain_scores_gemma":[0.99791676,0.0009820776,0.0003260952,0.00021510356,0.00048504572,0.00007493326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009236438,0.0010948532,0.00064817676,0.009816516,0.00055683433,0.0008706888,0.00080652157,0.00070610474,0.000860849],"category_scores_gemma":[0.0043528965,0.00039145414,0.0009121234,0.006722916,0.00041121882,0.0011978854,0.000600135,0.00046554685,0.00043619005],"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.0003325918,0.00035601438,0.19983463,0.00028938282,0.00039930508,0.0004375766,0.00054806203,0.35723963,0.0147211235,0.004519611,0.0012096664,0.42011246],"study_design_scores_gemma":[0.000008313898,0.00008998797,0.07175334,0.000018885776,0.00006637018,0.00017615847,0.00024531584,0.9177159,0.0070320475,0.00183101,0.0009909761,0.00007170075],"about_ca_topic_score_codex":0.017223185,"about_ca_topic_score_gemma":0.008574814,"teacher_disagreement_score":0.017223185,"about_ca_system_score_codex":0.00071676605,"about_ca_system_score_gemma":0.00047134957,"threshold_uncertainty_score":0.03424585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99372923,0.00013554767,0.0028824515,0.00006457204,0.000026423268,0.000043653807,0.00016732268,0.0002974231,0.00265334],"genre_scores_gemma":[0.998372,0.000035591187,0.0010322748,0.000012961821,0.000010862362,0.000007852301,0.00015602759,0.000018013494,0.0003545471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763024,0.0010125043,0.00010643909,0.00016399584,0.0006773889,0.000409401],"domain_scores_gemma":[0.99181694,0.0052250368,0.0004288495,0.0003939285,0.0017103709,0.00042495393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031512338,0.0007155079,0.00045300473,0.0010480249,0.00060244714,0.001098941,0.00088820007,0.00088753604,0.001513947],"category_scores_gemma":[0.009601301,0.00018819912,0.00022534348,0.00094021973,0.0005733786,0.0009261576,0.0004780281,0.0005632779,0.0002752744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009714778,0.0020712952,0.05070445,0.00026305777,0.00023692311,0.00040233159,0.00023127107,0.81287456,0.049105164,0.0025234083,0.0030687419,0.06880397],"study_design_scores_gemma":[0.00018019325,0.0032180108,0.019932684,0.000012369753,0.00010939128,0.00009924983,0.00018988363,0.9536485,0.021497987,0.00055708655,0.00052174676,0.00003291348],"about_ca_topic_score_codex":0.022817856,"about_ca_topic_score_gemma":0.0124889575,"teacher_disagreement_score":0.022817856,"about_ca_system_score_codex":0.0019348705,"about_ca_system_score_gemma":0.0010391308,"threshold_uncertainty_score":0.045370042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022144655,0.00028944926,0.8793022,0.00035247835,0.00022819586,0.0010250151,0.002563062,0.082120046,0.011974918],"genre_scores_gemma":[0.25462332,0.0002931342,0.72336626,0.00022754747,0.0000688687,0.0015671575,0.0031725469,0.001058787,0.015622328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989893,0.000337045,0.0001150165,0.00019986594,0.00028423642,0.000074540214],"domain_scores_gemma":[0.99663085,0.0019898445,0.00017068879,0.0002584225,0.00082258275,0.00012754371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019384809,0.0008210021,0.00076645345,0.0012525134,0.00049179076,0.0012514734,0.0012744695,0.0011221328,0.01743898],"category_scores_gemma":[0.00911259,0.00031227327,0.00039654665,0.0005848369,0.00030583082,0.0010181516,0.00092118216,0.00086846,0.0048116567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020364407,0.0007122639,0.004552795,0.0013805468,0.0001656733,0.001695781,0.0011246065,0.10528012,0.03363754,0.017464677,0.08848212,0.7434674],"study_design_scores_gemma":[0.0002155714,0.00016509183,0.0018711735,0.00013505406,0.000048802955,0.00039598142,0.00019024944,0.92402935,0.015039366,0.010141428,0.047701422,0.00006665403],"about_ca_topic_score_codex":0.0027140265,"about_ca_topic_score_gemma":0.0028295992,"teacher_disagreement_score":0.01743898,"about_ca_system_score_codex":0.0005653872,"about_ca_system_score_gemma":0.0010508667,"threshold_uncertainty_score":0.05833918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09522939,0.0006422858,0.8726378,0.0005048532,0.00047942213,0.0012429008,0.00019953417,0.022720179,0.0063436264],"genre_scores_gemma":[0.7983807,0.00029580606,0.19116725,0.00039863598,0.000118953925,0.0007696564,0.00044307034,0.0013193289,0.007106594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823076,0.00036270035,0.00014085525,0.00042321673,0.0005929487,0.00024952396],"domain_scores_gemma":[0.99659926,0.00073730823,0.00026274344,0.0010167869,0.0012293998,0.00015447749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022625874,0.00077473954,0.00057223043,0.0010578693,0.0006151719,0.001938076,0.0026968892,0.001041759,0.0034162952],"category_scores_gemma":[0.0072209197,0.00072253094,0.00036397224,0.0005602121,0.00092422747,0.0025340337,0.0013837558,0.0023721626,0.0011151169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024264534,0.001671468,0.019814478,0.0013554795,0.00034783487,0.00089179055,0.0016174364,0.08256565,0.23853964,0.04872917,0.01829691,0.5837437],"study_design_scores_gemma":[0.000322894,0.001248775,0.0063529294,0.00019426008,0.00012651188,0.0007276067,0.0001542691,0.70002836,0.23927613,0.007523479,0.043832354,0.00021242471],"about_ca_topic_score_codex":0.0017456025,"about_ca_topic_score_gemma":0.0012178231,"teacher_disagreement_score":0.0034162952,"about_ca_system_score_codex":0.0010059227,"about_ca_system_score_gemma":0.0011781327,"threshold_uncertainty_score":0.011965871},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868283,0.18244796,0.28831932,0.012622199,0.0031375817,0.0006071625,0.0009837598,0.003827181,0.47937208],"genre_scores_gemma":[0.2681441,0.31389612,0.18848133,0.004957736,0.0037027344,0.00064827997,0.0022017485,0.00046993815,0.21749792],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996568,0.000030158484,0.000016561204,0.000060085396,0.0001826164,0.00005386092],"domain_scores_gemma":[0.99979943,0.00003413644,0.00001855559,0.0000125469,0.00011645653,0.000018851482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004405958,0.00062133005,0.00021119413,0.0011883366,0.0005652644,0.0020224901,0.00065381685,0.0013567506,0.0070959185],"category_scores_gemma":[0.00038028782,0.00027642844,0.00020883967,0.00127249,0.00025718904,0.0030042373,0.0006537374,0.0011966183,0.004538371],"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.00013033726,0.00015350892,0.00078224356,0.001107274,0.000023670485,0.0007389275,0.00026883787,0.0041609313,0.046648316,0.1492427,0.06746552,0.7292777],"study_design_scores_gemma":[0.0000124296575,0.00031772206,0.0007777621,0.00034738937,0.00002434131,0.0015173496,0.0001629507,0.011353525,0.014697102,0.015708312,0.95503724,0.000043796397],"about_ca_topic_score_codex":0.0013751031,"about_ca_topic_score_gemma":0.0011026447,"teacher_disagreement_score":0.0070959185,"about_ca_system_score_codex":0.0007875117,"about_ca_system_score_gemma":0.00072353415,"threshold_uncertainty_score":0.023738265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859513,0.00027967145,0.0034296962,0.0000753591,0.000035326502,0.000102351536,0.00040729504,0.0019893546,0.007729537],"genre_scores_gemma":[0.99290633,0.00017298697,0.0037986683,0.000038675695,0.000013263328,0.000039522656,0.00095218595,0.00010288056,0.0019755082],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798155,0.0003377649,0.00014611181,0.00028665995,0.0009877161,0.00026026412],"domain_scores_gemma":[0.9972133,0.0009865958,0.0002037973,0.00043272742,0.0009211528,0.00024247039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026205673,0.0005075025,0.00066623004,0.0015253309,0.00067539886,0.0018151513,0.0011303825,0.0005983282,0.0015981498],"category_scores_gemma":[0.004310515,0.0002096361,0.00027442563,0.00153935,0.0004865966,0.0021909946,0.0009331137,0.0006251748,0.00061677344],"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.007018345,0.0046985964,0.09574637,0.0013435046,0.0003924875,0.0014794606,0.0020341498,0.109482765,0.30608067,0.011296238,0.01866445,0.44176292],"study_design_scores_gemma":[0.00022543008,0.008505521,0.13091068,0.000107126216,0.00020350263,0.00093698775,0.0023431464,0.5668569,0.27461892,0.0031131476,0.011931786,0.00024694556],"about_ca_topic_score_codex":0.006210741,"about_ca_topic_score_gemma":0.006075417,"teacher_disagreement_score":0.006210741,"about_ca_system_score_codex":0.0011905313,"about_ca_system_score_gemma":0.0009976289,"threshold_uncertainty_score":0.013859034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5931023,0.00039479235,0.39835843,0.000111112415,0.00014107853,0.00023780012,0.00010539756,0.004500688,0.00304842],"genre_scores_gemma":[0.9644443,0.00006828974,0.034697816,0.00003783703,0.000025466376,0.00004990541,0.000043950615,0.000040857936,0.00059156265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988576,0.00029109645,0.00007466143,0.00026852122,0.0003365211,0.00017156504],"domain_scores_gemma":[0.99764603,0.0007947242,0.0003679058,0.0006173896,0.00043661756,0.00013739298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018220736,0.0006577069,0.0005100454,0.00083640346,0.00065826316,0.0015944056,0.0014419518,0.00031657933,0.00068917073],"category_scores_gemma":[0.003928927,0.00028102056,0.00038494894,0.000593782,0.0006753332,0.0015816394,0.0010866409,0.0007143687,0.0001525804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004862601,0.001245831,0.026296712,0.00035002446,0.000307451,0.0007787012,0.00068794965,0.24556863,0.23507148,0.022164578,0.003833205,0.45883286],"study_design_scores_gemma":[0.00023928787,0.0008741708,0.003106364,0.0000208645,0.00016298355,0.00016554703,0.00009311256,0.83283657,0.1528029,0.005989672,0.0036305354,0.00007801972],"about_ca_topic_score_codex":0.0040235445,"about_ca_topic_score_gemma":0.002787982,"teacher_disagreement_score":0.0040235445,"about_ca_system_score_codex":0.001086821,"about_ca_system_score_gemma":0.0011962741,"threshold_uncertainty_score":0.009636164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30999857,0.00050369184,0.67538357,0.00021397727,0.00018742768,0.00033390048,0.00015516592,0.008044637,0.005179073],"genre_scores_gemma":[0.9553926,0.00012512156,0.04240407,0.00010354222,0.000039891227,0.0000815988,0.00009916146,0.000101778605,0.0016522262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993357,0.00010730961,0.000053211854,0.0001743991,0.00022342775,0.00010590054],"domain_scores_gemma":[0.9982292,0.00039960473,0.00042438874,0.00039063502,0.00044886328,0.00010736933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031058,0.00081112474,0.00040486822,0.000941264,0.0005084969,0.0012667303,0.0015692158,0.00037084482,0.0011905046],"category_scores_gemma":[0.002078644,0.00020010083,0.00034943724,0.00045817334,0.0004835618,0.0014262953,0.000917807,0.00071638596,0.00032041618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026730304,0.00069524115,0.022528864,0.000520506,0.00036990942,0.0010695573,0.00055128016,0.0716642,0.43881863,0.013046198,0.0049491595,0.4431134],"study_design_scores_gemma":[0.00014967458,0.001808335,0.005375956,0.000044235287,0.00030515334,0.0009422792,0.00019026348,0.55618,0.41502517,0.004780132,0.015070393,0.00012842455],"about_ca_topic_score_codex":0.0018864692,"about_ca_topic_score_gemma":0.001125282,"teacher_disagreement_score":0.0018864692,"about_ca_system_score_codex":0.00064446457,"about_ca_system_score_gemma":0.00096379564,"threshold_uncertainty_score":0.004675925},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018597448,0.5174459,0.07049221,0.011469139,0.011801427,0.000109963315,0.00034173418,0.00062751875,0.3858523],"genre_scores_gemma":[0.04213941,0.5981195,0.038850635,0.009870627,0.023264792,0.0001937151,0.0004416651,0.00064569735,0.286474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994727,0.00009191788,0.000038337726,0.0001065523,0.0002323852,0.000058137037],"domain_scores_gemma":[0.9992478,0.0003982919,0.000025871575,0.00008191376,0.00019378569,0.000052430252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010256296,0.0010573454,0.00070651196,0.002500476,0.0010811507,0.0035307808,0.001293495,0.0022121693,0.022526298],"category_scores_gemma":[0.001967871,0.00083790155,0.0005394197,0.00497393,0.0016792086,0.0056523774,0.0012369191,0.00518769,0.008043024],"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.00007695454,0.00015803304,0.00016955107,0.0009770405,0.000021205693,0.00015374266,0.00023994446,0.0052331607,0.002005994,0.3843032,0.122048415,0.48461276],"study_design_scores_gemma":[0.000006164319,0.000059373197,0.00021229414,0.00061593694,0.000013355015,0.00024914273,0.000041257583,0.002299244,0.00069841463,0.073084064,0.9226948,0.000025984033],"about_ca_topic_score_codex":0.002139337,"about_ca_topic_score_gemma":0.0017721495,"teacher_disagreement_score":0.022526298,"about_ca_system_score_codex":0.0025776678,"about_ca_system_score_gemma":0.0013653245,"threshold_uncertainty_score":0.07535797},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007800994,0.012211801,0.1734606,0.43176898,0.111702256,0.00069989264,0.0030118306,0.054121025,0.20522277],"genre_scores_gemma":[0.11665254,0.009745284,0.14150335,0.276984,0.04238709,0.0011649004,0.0058307517,0.03364046,0.37209156],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.98196125,0.0051321215,0.0008797027,0.0015296311,0.009040286,0.0014570217],"domain_scores_gemma":[0.92834806,0.0088336365,0.0019884873,0.018250586,0.036825072,0.005754132],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.018974837,0.0011514544,0.0009973785,0.002513862,0.006106006,0.008963956,0.0048934515,0.0073889596,0.03233217],"category_scores_gemma":[0.0966655,0.0011253554,0.0007616448,0.00293588,0.004984648,0.025133306,0.009495974,0.01073415,0.031037077],"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.00012980987,0.00003197409,0.0010123429,0.00018148031,0.000015845191,0.00018427194,0.0009049783,0.0002289488,0.0020280983,0.037297376,0.8742186,0.083766304],"study_design_scores_gemma":[0.000018042514,0.00005179257,0.00035595088,0.00019688309,0.0000115238645,0.00024464156,0.00029573444,0.00056650356,0.0011393725,0.009263479,0.9877819,0.00007424825],"about_ca_topic_score_codex":0.02273829,"about_ca_topic_score_gemma":0.017088007,"teacher_disagreement_score":0.98102516,"about_ca_system_score_codex":0.0040827477,"about_ca_system_score_gemma":0.010151204,"threshold_uncertainty_score":0.108161926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6876119,0.000376297,0.305175,0.00076250784,0.00013599893,0.00010368032,0.00006241318,0.001272199,0.0045000105],"genre_scores_gemma":[0.9844386,0.000026294296,0.014726945,0.00007012855,0.00000568054,0.000023403632,0.00002905563,0.000026441125,0.0006535612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.000063603846,0.000011422261,0.000061772196,0.000039213977,0.00009907497],"domain_scores_gemma":[0.99903405,0.00043725752,0.00012144248,0.000055223685,0.00019675962,0.0001553227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007696798,0.0011168103,0.00051013415,0.00024246784,0.0003715457,0.00054470234,0.0007493579,0.0006814218,0.000939068],"category_scores_gemma":[0.002729327,0.0002840569,0.00025013095,0.00016454389,0.00049596664,0.00082617573,0.00062969077,0.0012760473,0.00016948815],"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.00013485842,0.00019578717,0.0015744796,0.000023414885,0.000016909107,0.000036544123,0.00002397173,0.9719392,0.004436484,0.00051761634,0.0005308586,0.02056986],"study_design_scores_gemma":[0.000006304016,0.000034245604,0.00009957617,0.0000012573857,0.0000023492269,0.0000029035925,0.000005595818,0.9989893,0.00060040725,0.00021159796,0.000044783006,0.000001610024],"about_ca_topic_score_codex":0.009966354,"about_ca_topic_score_gemma":0.011146989,"teacher_disagreement_score":0.009966354,"about_ca_system_score_codex":0.001051913,"about_ca_system_score_gemma":0.0014858001,"threshold_uncertainty_score":0.019816637},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05398074,0.00070331077,0.9363949,0.00020636442,0.00022196159,0.00020419802,0.00011619927,0.0040732888,0.0040990203],"genre_scores_gemma":[0.8431449,0.00029129122,0.15367919,0.00008820497,0.00008960177,0.00013767234,0.00010835178,0.00016721051,0.0022937013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925274,0.00014820126,0.00004475459,0.00016698685,0.00026419706,0.00012307706],"domain_scores_gemma":[0.9984255,0.00046444352,0.00023203835,0.0003134157,0.0004828136,0.00008165931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092680595,0.00078544964,0.00061350345,0.00080104213,0.0006280581,0.0008412757,0.0014401987,0.00040524817,0.0014648003],"category_scores_gemma":[0.0033153961,0.00029734182,0.00040783003,0.00044496192,0.00045146942,0.0010149427,0.0010640292,0.0007126844,0.00020725494],"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.00035006716,0.00012598703,0.0029791316,0.0002679388,0.00014407463,0.00030104833,0.0002600687,0.5810782,0.06835832,0.03322392,0.0067437035,0.30616763],"study_design_scores_gemma":[0.000046531255,0.00012109262,0.00055134064,0.000012624832,0.000046282228,0.0001811345,0.000025953139,0.9727145,0.0145771755,0.0066890926,0.0049922303,0.000041981562],"about_ca_topic_score_codex":0.0032039022,"about_ca_topic_score_gemma":0.0033794073,"teacher_disagreement_score":0.0032039022,"about_ca_system_score_codex":0.00070053316,"about_ca_system_score_gemma":0.0011741717,"threshold_uncertainty_score":0.006370485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3046769,0.004465721,0.6518733,0.0028018674,0.00095149264,0.0002751886,0.00036334977,0.0010052171,0.033586957],"genre_scores_gemma":[0.9649333,0.00088985194,0.025906766,0.00022289153,0.00017663054,0.00004383105,0.00007767732,0.00018614868,0.0075627924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985582,0.00070886844,0.000042833242,0.00019794673,0.00017422951,0.00031788205],"domain_scores_gemma":[0.9961927,0.002421951,0.0002708645,0.00029006856,0.00046077534,0.0003636557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031452628,0.00089046045,0.0018620852,0.0007379723,0.0010842066,0.0027113897,0.001834713,0.0013579406,0.0065515344],"category_scores_gemma":[0.007877326,0.00069808797,0.0006791121,0.0009127493,0.0013249512,0.0030087924,0.0020128158,0.0017305402,0.00068151846],"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.0021316893,0.0002306536,0.00094346603,0.0002811369,0.00010682279,0.00022854371,0.00037202076,0.7799018,0.005355028,0.13905309,0.009373187,0.062022667],"study_design_scores_gemma":[0.00003587326,0.00026831793,0.00020331556,0.000018751349,0.00003837944,0.00007460611,0.00007875514,0.9721727,0.0009415666,0.024893235,0.0012528644,0.000021576418],"about_ca_topic_score_codex":0.004761715,"about_ca_topic_score_gemma":0.004403703,"teacher_disagreement_score":0.0065515344,"about_ca_system_score_codex":0.0023516493,"about_ca_system_score_gemma":0.0013483211,"threshold_uncertainty_score":0.021917045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3661328,0.00093052245,0.43847993,0.00063424656,0.0009973361,0.002744646,0.020820448,0.13718045,0.03207962],"genre_scores_gemma":[0.7384117,0.0004910283,0.18816808,0.00044488278,0.000101134705,0.0020025389,0.046228267,0.00835944,0.0157929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696654,0.0007354762,0.00032284032,0.00030810866,0.0013252007,0.00034191084],"domain_scores_gemma":[0.99244654,0.0024332302,0.00046605765,0.0016231624,0.0026205382,0.00041050735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003218766,0.0020683233,0.0006083951,0.0018558159,0.00054549286,0.00077541685,0.002692905,0.001073175,0.005619626],"category_scores_gemma":[0.008488421,0.0005409348,0.000735371,0.0009871616,0.0006097938,0.0010563537,0.00089471415,0.0015632928,0.0018723559],"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.0023297397,0.00475414,0.025358047,0.0023932497,0.0007181077,0.0017182487,0.0006061583,0.3560512,0.09987683,0.019632274,0.18531224,0.30124977],"study_design_scores_gemma":[0.00060881063,0.0025552078,0.012021974,0.00017337844,0.00015806533,0.0010576759,0.00015781877,0.7786051,0.14011005,0.0045969556,0.05974922,0.00020577441],"about_ca_topic_score_codex":0.004329631,"about_ca_topic_score_gemma":0.0034899472,"teacher_disagreement_score":0.005619626,"about_ca_system_score_codex":0.0006922652,"about_ca_system_score_gemma":0.0016385005,"threshold_uncertainty_score":0.018799484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045871414,0.00066296966,0.9490238,0.0006679046,0.00012427682,0.00004117253,0.00035085573,0.0012182277,0.0020394074],"genre_scores_gemma":[0.90044916,0.00047255485,0.09323533,0.00029711574,0.00005815865,0.00014608301,0.0005567231,0.000107704895,0.00467712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987996,0.00003558693,0.000004363752,0.00003575116,0.000020821672,0.00002337833],"domain_scores_gemma":[0.9996786,0.000175171,0.000028409002,0.00002423369,0.000072509094,0.000021136133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003493803,0.0007210369,0.0006149199,0.00038911856,0.00030312972,0.00048833893,0.0016932293,0.0009315415,0.0015708451],"category_scores_gemma":[0.001242193,0.00036616917,0.0004568371,0.0004635376,0.00043535305,0.00091233506,0.0006582268,0.0014709941,0.00039563325],"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.000059222177,0.00002587593,0.00060420675,0.000022323875,0.000023967752,0.000021415985,0.000016540045,0.9702102,0.0017967296,0.0047490923,0.0009999787,0.021470485],"study_design_scores_gemma":[0.0000011837529,0.0000038030782,0.000031103013,7.2463575e-7,0.0000013210204,0.0000015895858,7.671304e-7,0.99885,0.00008778686,0.00092501217,0.00009559165,0.000001094993],"about_ca_topic_score_codex":0.018987374,"about_ca_topic_score_gemma":0.021491513,"teacher_disagreement_score":0.018987374,"about_ca_system_score_codex":0.0007502668,"about_ca_system_score_gemma":0.0009073629,"threshold_uncertainty_score":0.03775376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10662605,0.0011763104,0.6222314,0.00057398126,0.0009162953,0.001576519,0.00091450434,0.24972647,0.016258428],"genre_scores_gemma":[0.83625746,0.0003195673,0.14451058,0.0008789233,0.00017170982,0.0006309991,0.0015453037,0.0048180157,0.010867444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.00012119617,0.00005323894,0.00016082072,0.0003520106,0.00019279744],"domain_scores_gemma":[0.99832076,0.0005856817,0.00013469906,0.00029479119,0.000398638,0.00026532813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014755445,0.0011158936,0.00071567664,0.00084332586,0.00044164658,0.0009783193,0.0033862365,0.000826373,0.0064530866],"category_scores_gemma":[0.005161599,0.00043893006,0.0003539022,0.0002628481,0.0006870457,0.0011397266,0.0013773527,0.001859293,0.0011615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033782476,0.0024892513,0.011581419,0.000974749,0.0003433028,0.0013258425,0.0006315672,0.21909036,0.09848878,0.021367539,0.07921552,0.5611135],"study_design_scores_gemma":[0.00031622706,0.00069217716,0.0019698238,0.00004535101,0.000054390028,0.00029638584,0.00003500349,0.9450693,0.029663173,0.002945762,0.018788336,0.00012406372],"about_ca_topic_score_codex":0.004920589,"about_ca_topic_score_gemma":0.0036155786,"teacher_disagreement_score":0.0064530866,"about_ca_system_score_codex":0.0008949306,"about_ca_system_score_gemma":0.0013404372,"threshold_uncertainty_score":0.021587789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06082539,0.0002974677,0.93523675,0.00041191402,0.00006612445,0.000032358475,0.00004625776,0.00058448326,0.0024991857],"genre_scores_gemma":[0.96592516,0.000076821736,0.032728393,0.00010200605,0.000026540529,0.000043693464,0.000045923964,0.000023660154,0.0010278536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975413,0.00006314498,0.000012001183,0.00006258508,0.000056926463,0.00005117505],"domain_scores_gemma":[0.99920267,0.00042518397,0.0001153863,0.000056525565,0.00013800847,0.00006210796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084885,0.0007859584,0.0006572711,0.0002293409,0.00025894583,0.000669996,0.0009947162,0.000717433,0.000976563],"category_scores_gemma":[0.002211903,0.0003965088,0.00036065056,0.00024174902,0.00084100233,0.00082656083,0.0010392878,0.0016480907,0.00014762604],"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.000035424284,0.000034627985,0.00049204956,0.000017362743,0.000015918187,0.000021725878,0.000023599665,0.9783667,0.0008327356,0.0024788699,0.0003469004,0.017334146],"study_design_scores_gemma":[0.0000026402145,0.000007575318,0.000022061133,0.0000010707895,0.0000012933123,0.0000011913198,0.0000011403018,0.99889046,0.000106532694,0.00092745724,0.000037618553,0.0000010299332],"about_ca_topic_score_codex":0.0076782466,"about_ca_topic_score_gemma":0.007501065,"teacher_disagreement_score":0.0076782466,"about_ca_system_score_codex":0.00090518047,"about_ca_system_score_gemma":0.0013633858,"threshold_uncertainty_score":0.015267074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022866132,0.001005596,0.935733,0.00068436994,0.0007639407,0.0007144017,0.00032389344,0.02298589,0.014922725],"genre_scores_gemma":[0.70251447,0.0010509219,0.27688032,0.000890974,0.00066924427,0.0007369901,0.0011097142,0.001348693,0.0147986375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985904,0.00021986601,0.0000846327,0.00027625653,0.00059878797,0.00023004565],"domain_scores_gemma":[0.99811757,0.00032550766,0.00024621183,0.00036971417,0.0007168409,0.00022419017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570382,0.0013205796,0.0006734295,0.0016895907,0.0009296555,0.0017178686,0.0038147655,0.0009498504,0.003952767],"category_scores_gemma":[0.003006126,0.00043128993,0.00047345474,0.0007805817,0.00093666074,0.001792881,0.001792272,0.0014635971,0.0010366011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008949533,0.001027434,0.004614276,0.0007795008,0.00029921456,0.00074278447,0.0005605888,0.17567652,0.0903396,0.06345088,0.08049606,0.5811182],"study_design_scores_gemma":[0.00021312361,0.0004992061,0.0014576626,0.000051683106,0.00013754693,0.0005651855,0.00007411062,0.8836127,0.052321915,0.008108921,0.052800193,0.00015786805],"about_ca_topic_score_codex":0.00701337,"about_ca_topic_score_gemma":0.00556483,"teacher_disagreement_score":0.00701337,"about_ca_system_score_codex":0.0013506474,"about_ca_system_score_gemma":0.002387784,"threshold_uncertainty_score":0.013945103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037828766,0.0014021902,0.024854984,0.0019360413,0.0009569966,0.00016338349,0.0023262715,0.0023344522,0.9656475],"genre_scores_gemma":[0.007564358,0.0045454917,0.015969247,0.001328782,0.00039322625,0.00027893027,0.003580361,0.0010878402,0.96525174],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926645,0.0000937162,0.000039573548,0.00013303355,0.00039962874,0.00006755708],"domain_scores_gemma":[0.9990404,0.00021559787,0.000045249944,0.00025681625,0.00035636505,0.000085543754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085647946,0.0010772495,0.00040837468,0.0013379119,0.001260131,0.004125682,0.0014081736,0.001504768,0.19381988],"category_scores_gemma":[0.0028430328,0.0006196408,0.00037323622,0.0015389338,0.0006177212,0.0048323055,0.0015859455,0.002603688,0.12572867],"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.000019800738,0.000043737273,0.000065085,0.00012826174,0.0000032352468,0.00004879106,0.00013926545,0.0014858212,0.0005530589,0.371128,0.52333,0.103055],"study_design_scores_gemma":[0.0000024087124,0.0000034120628,0.000028466864,0.00005375205,0.0000011761113,0.00004028262,0.000019665667,0.00047152548,0.0001658031,0.01842142,0.98078775,0.00000433989],"about_ca_topic_score_codex":0.0034266391,"about_ca_topic_score_gemma":0.004712374,"teacher_disagreement_score":0.19381988,"about_ca_system_score_codex":0.0025181428,"about_ca_system_score_gemma":0.0016566458,"threshold_uncertainty_score":0.6483921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07688452,0.0074603204,0.89960426,0.000980497,0.00058271165,0.00048685056,0.00015666796,0.007539397,0.006304763],"genre_scores_gemma":[0.7668911,0.0023226403,0.22600454,0.00041444192,0.00037690197,0.00026309473,0.00024255784,0.00028912534,0.0031954981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00031852748,0.00006998362,0.00015918471,0.00045204195,0.00012495684],"domain_scores_gemma":[0.99869686,0.0004502434,0.00015895058,0.00017324163,0.0004324897,0.00008824097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023900124,0.00084016094,0.0005917027,0.0012211232,0.00063268415,0.0008862232,0.0020406924,0.00054621743,0.00077348144],"category_scores_gemma":[0.004302549,0.00029041298,0.0003045834,0.00076660723,0.00054002344,0.0016390434,0.0011112822,0.0009631243,0.00020997616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044292136,0.0005103473,0.004997614,0.00045955006,0.00017091371,0.00028097254,0.0002273641,0.3625279,0.041916233,0.013960493,0.012803241,0.56170243],"study_design_scores_gemma":[0.00009490158,0.00028661647,0.0008668174,0.000024589308,0.00006268485,0.00016482876,0.000021698372,0.97414964,0.011752167,0.0023253362,0.01021251,0.000038269216],"about_ca_topic_score_codex":0.0045638666,"about_ca_topic_score_gemma":0.0033491675,"teacher_disagreement_score":0.0045638666,"about_ca_system_score_codex":0.00084509124,"about_ca_system_score_gemma":0.0010190795,"threshold_uncertainty_score":0.012639761},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2999724,0.0066017257,0.2811662,0.0701652,0.006433488,0.00022402502,0.0009978641,0.004738943,0.32970023],"genre_scores_gemma":[0.92844176,0.0025628323,0.027903978,0.0018784403,0.0019963994,0.00006667833,0.00032375337,0.0005632215,0.03626288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989962,0.00027488184,0.000031391544,0.00013523946,0.00023298923,0.00032932885],"domain_scores_gemma":[0.99634653,0.001735808,0.00026714362,0.00067108235,0.0005892557,0.00039025318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013223649,0.001125177,0.00079990446,0.00140407,0.0022083793,0.0030700953,0.0013609632,0.002705583,0.02699611],"category_scores_gemma":[0.00831138,0.00033385627,0.0007429962,0.0031452256,0.0013853947,0.0039713625,0.0015162417,0.0020057198,0.0018360688],"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.0011749961,0.0010266791,0.010815548,0.0007371295,0.00029521724,0.00065569,0.0004889571,0.09490154,0.030455317,0.49359295,0.07470065,0.2911554],"study_design_scores_gemma":[0.00024401856,0.00047379045,0.008239229,0.00014870585,0.00025594654,0.0006657718,0.0007210726,0.20237179,0.026080307,0.67404234,0.08662911,0.000127925],"about_ca_topic_score_codex":0.005389588,"about_ca_topic_score_gemma":0.005147363,"teacher_disagreement_score":0.02699611,"about_ca_system_score_codex":0.0014515187,"about_ca_system_score_gemma":0.0012591681,"threshold_uncertainty_score":0.09031099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40516952,0.0007992305,0.5589512,0.00045085693,0.00027435293,0.00046526582,0.00028596073,0.026462669,0.0071409983],"genre_scores_gemma":[0.9575667,0.00012958296,0.04029165,0.00016771184,0.000044821212,0.00008127489,0.00018642105,0.00018097035,0.0013507684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992943,0.00021869928,0.000045031487,0.0001306744,0.00017680768,0.00013455503],"domain_scores_gemma":[0.9988072,0.00029419994,0.00018030725,0.00039306478,0.0002058979,0.000119424854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207402,0.00061168795,0.0005341674,0.00054725626,0.00049948954,0.00072501786,0.0012178476,0.00042464148,0.001348054],"category_scores_gemma":[0.003004483,0.00022392905,0.00031176518,0.00027977853,0.0007396709,0.00095111906,0.0012025458,0.0009106151,0.00044927152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023403938,0.00081306766,0.015852638,0.00053803716,0.00013709492,0.0014622712,0.00084624393,0.21524045,0.23172362,0.015521861,0.013116261,0.502408],"study_design_scores_gemma":[0.00016456384,0.00089078763,0.004783642,0.000047198897,0.00006743447,0.0006198752,0.000114225535,0.8478054,0.12708028,0.0049822913,0.01337262,0.00007161213],"about_ca_topic_score_codex":0.0013782234,"about_ca_topic_score_gemma":0.0009895816,"teacher_disagreement_score":0.0013782234,"about_ca_system_score_codex":0.00037185167,"about_ca_system_score_gemma":0.00072368723,"threshold_uncertainty_score":0.006385386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010000262,0.0011842819,0.89453954,0.00026167126,0.00029574733,0.00007229293,0.000059771693,0.0022327949,0.09135355],"genre_scores_gemma":[0.40488806,0.004239846,0.4655739,0.00035095378,0.0002903345,0.00013674556,0.0003147814,0.0007721679,0.1234333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998159,0.000025842946,0.0000069800476,0.000022516424,0.000109158,0.000019546591],"domain_scores_gemma":[0.99984264,0.000032343083,0.000008075474,0.00004758933,0.000059455586,0.000009877176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024291023,0.0004491484,0.00023086436,0.0005734048,0.00036676993,0.0009317931,0.00064096024,0.00037010264,0.004344803],"category_scores_gemma":[0.0003480039,0.00024399167,0.00020909711,0.0005060761,0.00027467168,0.00091626827,0.00058277557,0.00096029206,0.0020057934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000675905,0.00016375032,0.0002794725,0.00020022567,0.000041902545,0.00013907703,0.00013895996,0.05772318,0.08255806,0.19803509,0.019106552,0.64154613],"study_design_scores_gemma":[0.000019351328,0.00013190313,0.00040603732,0.000091328206,0.000054681375,0.0005553801,0.00008663347,0.50199807,0.14826132,0.12397057,0.22438492,0.000039764363],"about_ca_topic_score_codex":0.00046748976,"about_ca_topic_score_gemma":0.0007945146,"teacher_disagreement_score":0.004344803,"about_ca_system_score_codex":0.00040966665,"about_ca_system_score_gemma":0.00027620108,"threshold_uncertainty_score":0.014534771},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010796067,0.020256793,0.7280789,0.0035391462,0.0027140235,0.000117748314,0.000301532,0.00355251,0.23064323],"genre_scores_gemma":[0.3129989,0.027424162,0.29475173,0.0018776291,0.0041157575,0.00051799364,0.0006826746,0.0011134662,0.3565176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998018,0.000018368053,0.0000069238217,0.000028342301,0.0001258267,0.000018759023],"domain_scores_gemma":[0.9998091,0.00008182615,0.000011451518,0.00004844988,0.000036944522,0.000012217637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022787138,0.00083549897,0.00032737918,0.00042015407,0.00041444768,0.00089781824,0.0007092637,0.0005517035,0.014527637],"category_scores_gemma":[0.00062791625,0.0003469738,0.00016404789,0.0007528551,0.0006203165,0.001930939,0.00081734033,0.0015315047,0.0029658999],"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.00006347153,0.00004429506,0.00012248968,0.00043614465,0.000028619557,0.00012736839,0.00019578595,0.012098351,0.04118218,0.46125564,0.10048332,0.3839623],"study_design_scores_gemma":[0.000033397548,0.00015069447,0.00061811134,0.0002254798,0.0000508406,0.00059636927,0.00008474536,0.090039276,0.019680042,0.3087272,0.57974267,0.00005117835],"about_ca_topic_score_codex":0.0004315706,"about_ca_topic_score_gemma":0.0009442375,"teacher_disagreement_score":0.014527637,"about_ca_system_score_codex":0.0005459889,"about_ca_system_score_gemma":0.00040513,"threshold_uncertainty_score":0.04859984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3177243,0.0024487204,0.4598626,0.016956164,0.000534227,0.00009363613,0.0003032211,0.00027421818,0.20180292],"genre_scores_gemma":[0.9871974,0.0006145822,0.004832923,0.00031472734,0.00020907774,0.000031608677,0.00003351343,0.00003249221,0.0067337374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00032647667,0.000028157781,0.00019956719,0.0002930227,0.0002821384],"domain_scores_gemma":[0.99627835,0.0022915578,0.0004418279,0.0003480793,0.00044425143,0.00019589697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012842403,0.00064576743,0.00068703777,0.0005105362,0.0011675545,0.0027515537,0.001890699,0.0020038357,0.010283069],"category_scores_gemma":[0.011238285,0.00032336928,0.00069179793,0.0011381031,0.0019599875,0.005546576,0.001546016,0.0020436982,0.0005355245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019292353,0.000045004235,0.0006247736,0.000022874692,0.0000065478052,0.00015172498,0.0000694517,0.08123562,0.00038021116,0.90959114,0.0018764297,0.0059770024],"study_design_scores_gemma":[0.000013782854,0.000025811303,0.00038615213,0.000017744907,0.0000093564395,0.00018767946,0.00010486938,0.259107,0.00030878137,0.73727304,0.002550394,0.000015467673],"about_ca_topic_score_codex":0.0031052642,"about_ca_topic_score_gemma":0.0017208502,"teacher_disagreement_score":0.010283069,"about_ca_system_score_codex":0.0016698876,"about_ca_system_score_gemma":0.001650296,"threshold_uncertainty_score":0.034400344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.934284,0.0036621466,0.033992466,0.000746292,0.0006076055,0.000057428177,0.00071686547,0.0024284758,0.023504771],"genre_scores_gemma":[0.9962625,0.0003665584,0.0017366632,0.0000712057,0.000042427604,0.000011870751,0.00006347369,0.00013177402,0.0013135577],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987858,0.00023300391,0.00004400824,0.00020727178,0.00031977205,0.0004101344],"domain_scores_gemma":[0.962351,0.033321027,0.00084923685,0.0009714998,0.0018218973,0.00068525266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516737,0.0007070744,0.00060810434,0.0009203789,0.00066798035,0.0012870438,0.0009987083,0.0012722949,0.008234415],"category_scores_gemma":[0.014582811,0.000433703,0.0003188353,0.0008823028,0.00090411113,0.0017914122,0.00048654008,0.0011908017,0.0010550035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017581027,0.001219721,0.0072794785,0.0009341113,0.00020480719,0.0015278374,0.0007249497,0.3181797,0.47977418,0.009483959,0.0048840633,0.15820614],"study_design_scores_gemma":[0.00045004432,0.0024595992,0.010582565,0.00021877757,0.0006237227,0.0010731599,0.0003886094,0.49774417,0.4793608,0.004317886,0.0026287856,0.00015191612],"about_ca_topic_score_codex":0.004586669,"about_ca_topic_score_gemma":0.0026622848,"teacher_disagreement_score":0.008234415,"about_ca_system_score_codex":0.0013426099,"about_ca_system_score_gemma":0.0008273725,"threshold_uncertainty_score":0.027546823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058485646,0.000043237873,0.8992113,0.00008987961,0.00012508575,0.00014492111,0.0004481956,0.03176242,0.009689319],"genre_scores_gemma":[0.52383834,0.00020227904,0.46085376,0.00013456236,0.000048691683,0.00030756253,0.001724257,0.0075358576,0.005354658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.000050444592,0.00004415459,0.00007402538,0.0001303628,0.000039127004],"domain_scores_gemma":[0.9988637,0.00045022243,0.00007957537,0.00035529188,0.00022546711,0.000025742827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000403707,0.00048543708,0.00034762605,0.0004093918,0.00031248084,0.0006835747,0.00068469637,0.0003516529,0.003207158],"category_scores_gemma":[0.0028096014,0.00043240743,0.0005749903,0.0003642206,0.00042989742,0.00089370285,0.0005909621,0.0006280671,0.0008716484],"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.00014772484,0.00013365787,0.004767127,0.0002779152,0.00008179845,0.00054870994,0.00039315262,0.78152674,0.021360314,0.056922786,0.009658124,0.12418192],"study_design_scores_gemma":[0.000017032888,0.000028830837,0.00018449561,0.000018603263,0.000023234972,0.00008746045,0.000025005487,0.95490885,0.02332315,0.0111299325,0.010239117,0.000014242114],"about_ca_topic_score_codex":0.002572419,"about_ca_topic_score_gemma":0.0018954797,"teacher_disagreement_score":0.003207158,"about_ca_system_score_codex":0.0003977106,"about_ca_system_score_gemma":0.0010750813,"threshold_uncertainty_score":0.010728955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72221965,0.0012743452,0.25762156,0.00048205742,0.0002147657,0.00012722555,0.000637586,0.0049217567,0.012501072],"genre_scores_gemma":[0.9853452,0.00013875039,0.012802244,0.000036849513,0.000024356179,0.000012009741,0.00019170978,0.00004328794,0.0014056204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949956,0.00012738956,0.000036232897,0.00007873537,0.00015783437,0.000100192534],"domain_scores_gemma":[0.9992387,0.00027465867,0.000073044874,0.00015859985,0.00019298427,0.00006207029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723524,0.00036575767,0.00050221034,0.0005796678,0.00054721505,0.0012728439,0.00078206335,0.0002746785,0.0012899203],"category_scores_gemma":[0.0020222794,0.00025525503,0.000107983746,0.00052495,0.0002383396,0.0014257861,0.0006451716,0.00041615177,0.0001554259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002387584,0.00049270346,0.013324585,0.0001988756,0.00012149656,0.00039926625,0.0003757476,0.38085434,0.10365885,0.017874395,0.012117254,0.4681949],"study_design_scores_gemma":[0.00003657959,0.00008006161,0.0031534436,0.000009001153,0.000051794646,0.00008698781,0.00010083587,0.96623427,0.021762453,0.004782953,0.0036768436,0.000024692707],"about_ca_topic_score_codex":0.0042707785,"about_ca_topic_score_gemma":0.009884385,"teacher_disagreement_score":0.0042707785,"about_ca_system_score_codex":0.00077539467,"about_ca_system_score_gemma":0.00088249746,"threshold_uncertainty_score":0.008491874},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008899351,0.017748388,0.8212796,0.0014420606,0.0046427567,0.00013765521,0.00035546074,0.006901875,0.13859287],"genre_scores_gemma":[0.6293921,0.016834065,0.21194334,0.001495583,0.004456988,0.00039253506,0.0008913746,0.00070165045,0.13389231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961084,0.000040875148,0.000013337766,0.00011347875,0.00017652886,0.000045042405],"domain_scores_gemma":[0.99962103,0.00010178717,0.00003314127,0.00007972318,0.0001344411,0.000029854822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689433,0.0008781077,0.00042003673,0.00080319145,0.00039297197,0.0011380619,0.0011621485,0.00094109756,0.008772257],"category_scores_gemma":[0.001244701,0.00021449696,0.00031388566,0.001069463,0.0006437405,0.00095034955,0.0009235611,0.0015625256,0.002370386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010447308,0.00012136692,0.00032831257,0.0003121159,0.00003704106,0.0000653271,0.00005404796,0.045447174,0.007251813,0.11962036,0.07769321,0.7489647],"study_design_scores_gemma":[0.000090235335,0.0002493403,0.0011181447,0.00018538385,0.000090415546,0.0003982323,0.000029592318,0.5472352,0.013167438,0.121230684,0.31609863,0.000106616564],"about_ca_topic_score_codex":0.0029129593,"about_ca_topic_score_gemma":0.0023480812,"teacher_disagreement_score":0.008772257,"about_ca_system_score_codex":0.00056180585,"about_ca_system_score_gemma":0.00071259507,"threshold_uncertainty_score":0.029346108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6417739,0.003468108,0.2992972,0.010602263,0.00030057263,0.0002930862,0.0003651084,0.0017495594,0.042150114],"genre_scores_gemma":[0.8551862,0.0021326318,0.13809031,0.00021046294,0.000088593624,0.000092405426,0.00030359745,0.00017209689,0.0037236474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802643,0.0009969252,0.00009709543,0.00015153376,0.00056892756,0.00015905155],"domain_scores_gemma":[0.9928982,0.004824907,0.0001549818,0.0008428807,0.0009997846,0.0002792281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033421302,0.00060899754,0.00050310127,0.0004037395,0.00085993565,0.0014275536,0.002094777,0.0016840341,0.002736739],"category_scores_gemma":[0.009072378,0.0003617333,0.00063236285,0.00096396747,0.0008874535,0.0025409202,0.0011096579,0.0017493399,0.00029276847],"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.00030748884,0.0007819895,0.011992363,0.00039314697,0.00008823702,0.0014929286,0.0009641636,0.79394746,0.004078385,0.036771268,0.00808374,0.14109886],"study_design_scores_gemma":[0.00010677523,0.00026354188,0.0012047124,0.00007103159,0.000033312033,0.0005107862,0.00056537206,0.95554936,0.0074993195,0.01488306,0.019280717,0.000031971438],"about_ca_topic_score_codex":0.006090648,"about_ca_topic_score_gemma":0.0052714534,"teacher_disagreement_score":0.006090648,"about_ca_system_score_codex":0.0010996127,"about_ca_system_score_gemma":0.00085339975,"threshold_uncertainty_score":0.017675102},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015217994,0.0007621249,0.15560435,0.0012862929,0.0011824477,0.00019069483,0.03570856,0.64658785,0.15715583],"genre_scores_gemma":[0.071503446,0.001232038,0.10316891,0.001386364,0.00078053365,0.00075537106,0.09375,0.45665848,0.27076492],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986615,0.00016595783,0.00006480849,0.00019783586,0.00069095305,0.00021900689],"domain_scores_gemma":[0.9981851,0.00037147774,0.00010679669,0.00069779134,0.00043909496,0.00019963307],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015839587,0.0031718852,0.0020928115,0.0034848417,0.0008848466,0.005027088,0.0063752397,0.0028123227,0.61293054],"category_scores_gemma":[0.0041603846,0.0016367566,0.0016648998,0.0024134459,0.0011313559,0.0024772803,0.0037168919,0.0030054944,0.52232796],"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.00037572542,0.00007649823,0.00026938014,0.0005855579,0.00008952672,0.00013950543,0.000069256464,0.005105189,0.0043477453,0.014745168,0.9023209,0.0718755],"study_design_scores_gemma":[0.00045769764,0.00011318951,0.00060057285,0.000245886,0.000050425955,0.0002464276,0.000051056864,0.06283249,0.02629445,0.04150637,0.8674704,0.00013093626],"about_ca_topic_score_codex":0.0061400644,"about_ca_topic_score_gemma":0.0043856064,"teacher_disagreement_score":0.61293054,"about_ca_system_score_codex":0.0022618696,"about_ca_system_score_gemma":0.0011898675,"threshold_uncertainty_score":0.5521076},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62219536,0.0068083983,0.0027957242,0.0016784779,0.0005276968,0.00012569384,0.034427684,0.0005830267,0.33085787],"genre_scores_gemma":[0.9419009,0.0019310381,0.0030295402,0.00023770155,0.00002502481,0.00002122615,0.005140598,0.00008745936,0.04762649],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985707,0.0000055534224,0.00000472528,0.00004215908,0.00003899628,0.00005139886],"domain_scores_gemma":[0.99980015,0.000009937888,0.000027114042,0.000013907526,0.000110006746,0.00003891085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100252444,0.00025416585,0.00012609514,0.0017698354,0.0027460128,0.000783494,0.0005011399,0.00032990513,0.024151985],"category_scores_gemma":[0.00036445315,0.00012028779,0.00019480998,0.0022427347,0.00078668026,0.00028192706,0.00056987064,0.0003527487,0.002188212],"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.00045160754,0.000034030447,0.44446513,0.0011554352,0.0001391493,0.0034653852,0.013738151,0.0009322577,0.02075026,0.016373489,0.13335384,0.3651414],"study_design_scores_gemma":[0.0000065524114,0.000027759148,0.68841577,0.0002843628,0.000061829465,0.0023387645,0.006517646,0.0003143414,0.0014699112,0.0006683629,0.2998591,0.000035591584],"about_ca_topic_score_codex":0.9386091,"about_ca_topic_score_gemma":0.9833846,"teacher_disagreement_score":0.061390877,"about_ca_system_score_codex":0.0040104664,"about_ca_system_score_gemma":0.005417691,"threshold_uncertainty_score":0.12350482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019205234,0.000027348447,0.00047485746,0.00007984111,0.000029493613,0.0000767834,0.99758875,0.0007140429,0.00081687386],"genre_scores_gemma":[0.006881356,0.00022538622,0.005156673,0.00044791782,0.000099439414,0.0016984853,0.9747994,0.002038098,0.008653205],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935156,0.00008000112,0.00011585671,0.00014953918,0.00020491048,0.000098067656],"domain_scores_gemma":[0.9881223,0.0082122665,0.00070335175,0.0008988614,0.0015933489,0.00046988195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001776839,0.0013383924,0.0017983263,0.0023877863,0.00095649716,0.0018983885,0.0022811973,0.0015836444,0.874794],"category_scores_gemma":[0.014184836,0.00081435806,0.0013250785,0.003020645,0.0003870453,0.001896272,0.0011089008,0.0011543042,0.2138685],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008661451,0.0001913478,0.0018379054,0.0041621877,0.000083064326,0.00019740357,0.000061600906,0.0007258582,0.0007629073,0.0008557396,0.97917503,0.011080786],"study_design_scores_gemma":[0.0062250183,0.0006073464,0.024245188,0.0035669303,0.0003475044,0.0011225819,0.00035028366,0.0031579304,0.004874019,0.014061465,0.9411769,0.00026480618],"about_ca_topic_score_codex":0.004968981,"about_ca_topic_score_gemma":0.008339874,"teacher_disagreement_score":0.874794,"about_ca_system_score_codex":0.00091024255,"about_ca_system_score_gemma":0.0018907432,"threshold_uncertainty_score":0.17859107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006476698,0.012753442,0.0012967369,0.012784306,0.007851273,0.00003620834,0.0010715112,0.00073012826,0.96282876],"genre_scores_gemma":[0.001897062,0.0036315906,0.00026459948,0.0007704357,0.00027172887,0.000012343234,0.00030394862,0.00017979323,0.9926685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994604,0.000046165034,0.000023745963,0.00017883252,0.00022950706,0.00006146524],"domain_scores_gemma":[0.99939835,0.000097114826,0.000035575216,0.00008019614,0.00020805998,0.00018072514],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004118267,0.0008138632,0.00045913734,0.0009768398,0.0013761387,0.0046357894,0.0010021891,0.0016235983,0.5842117],"category_scores_gemma":[0.0016154743,0.00030971543,0.00029590604,0.0008766764,0.0005943635,0.0031527006,0.0024561933,0.0017521124,0.35001493],"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.000021933007,0.000017825561,0.00009123828,0.00010160288,0.0000030303206,0.00008370084,0.00008568877,0.00010120078,0.00021091771,0.013633122,0.89874333,0.0869063],"study_design_scores_gemma":[0.0000010401909,0.0000022512158,0.000053170286,0.000031487634,6.275796e-7,0.000027127115,0.000036637477,0.000019533001,0.000050391387,0.0005888314,0.9991875,0.000001384019],"about_ca_topic_score_codex":0.0034033873,"about_ca_topic_score_gemma":0.0074762,"teacher_disagreement_score":0.4157883,"about_ca_system_score_codex":0.0011241388,"about_ca_system_score_gemma":0.0014517972,"threshold_uncertainty_score":0.5930715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28459918,0.0032784285,0.68759364,0.0005927864,0.00009019363,0.00007638795,0.00027534025,0.0010592322,0.02243485],"genre_scores_gemma":[0.97987866,0.00092710723,0.01756225,0.00004227842,0.00004925358,0.00002824026,0.000156783,0.000057217596,0.0012982439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00026367855,0.000026454358,0.00009565152,0.00047673535,0.00012493052],"domain_scores_gemma":[0.99855024,0.0008277126,0.00015121994,0.00012550426,0.00031576148,0.000029543668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125565,0.0006701905,0.000355633,0.000801925,0.00034660666,0.00072451704,0.0005654212,0.0004683254,0.0009692273],"category_scores_gemma":[0.003207457,0.00015902256,0.0002446621,0.00079820724,0.000403968,0.0011812318,0.0004285627,0.00056018296,0.00023447585],"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.00017507136,0.000068983536,0.0020498168,0.00012358285,0.000051652485,0.00022066523,0.000081288665,0.85534817,0.035280973,0.05139048,0.0011762336,0.05403304],"study_design_scores_gemma":[0.0000027174237,0.000065025895,0.00059882074,0.0000066506036,0.000009163717,0.000073327246,0.000012213064,0.984583,0.0071562366,0.0066707185,0.0008127067,0.0000094295265],"about_ca_topic_score_codex":0.0014449189,"about_ca_topic_score_gemma":0.0006553968,"teacher_disagreement_score":0.0014449189,"about_ca_system_score_codex":0.0010072034,"about_ca_system_score_gemma":0.0004906625,"threshold_uncertainty_score":0.007307768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062900106,0.00015820573,0.99138695,0.00014099103,0.00006956437,0.00009277669,0.00003158453,0.00048644896,0.0013434464],"genre_scores_gemma":[0.14145553,0.00026799308,0.85370487,0.000097663455,0.00007763454,0.00023072613,0.00015559912,0.00011821157,0.0038917204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924254,0.0001965709,0.000050410552,0.00011558938,0.00031902955,0.00007587958],"domain_scores_gemma":[0.99937147,0.00028055016,0.000048103517,0.00009633975,0.00016331061,0.00004024915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622236,0.0006856491,0.00069538254,0.0007153784,0.0012613535,0.001311666,0.0026014599,0.0008807338,0.0021685523],"category_scores_gemma":[0.0032142207,0.00031698222,0.00040396955,0.00088856445,0.00070817734,0.001808926,0.000844838,0.00090171257,0.00062245294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004311562,0.00031014645,0.0010013313,0.00014115627,0.00006627797,0.00012506146,0.0003586823,0.30123788,0.016505217,0.18076104,0.012248751,0.48681325],"study_design_scores_gemma":[0.00006718102,0.00009628286,0.00015419346,0.000015282865,0.000017297882,0.000053236326,0.000022296448,0.9521662,0.003810944,0.034975167,0.00859674,0.000025187719],"about_ca_topic_score_codex":0.0038372544,"about_ca_topic_score_gemma":0.0052217552,"teacher_disagreement_score":0.0038372544,"about_ca_system_score_codex":0.0015108781,"about_ca_system_score_gemma":0.0019095698,"threshold_uncertainty_score":0.010962188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016033806,0.0056013884,0.9001969,0.0035028984,0.0008780461,0.0002865636,0.00043659657,0.00082617055,0.072237715],"genre_scores_gemma":[0.5126624,0.017036969,0.40314722,0.00040758893,0.0010956175,0.000639698,0.0014954095,0.0004932762,0.063021876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.000089855224,0.000014198069,0.00004357485,0.0001658341,0.00003686241],"domain_scores_gemma":[0.9997378,0.00008207117,0.000019694018,0.000054884847,0.000090766305,0.0000147347155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739193,0.00035946924,0.0002763017,0.00047374662,0.00055719033,0.0010372165,0.00068797637,0.00048700802,0.007417924],"category_scores_gemma":[0.0020124249,0.00022802786,0.0003006622,0.0007382885,0.00048424542,0.0010340234,0.00046061713,0.00088881387,0.0015208039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006269723,0.000058432277,0.00045802718,0.00021376678,0.000023833454,0.00013822183,0.0002251574,0.17569555,0.011311011,0.61747175,0.03691355,0.15742803],"study_design_scores_gemma":[0.0000249523,0.00007599097,0.00056907145,0.00007653455,0.000019456422,0.0001450163,0.000086996864,0.7065624,0.0030526128,0.16798352,0.12137543,0.000027978394],"about_ca_topic_score_codex":0.0026606459,"about_ca_topic_score_gemma":0.0037311423,"teacher_disagreement_score":0.007417924,"about_ca_system_score_codex":0.0017409157,"about_ca_system_score_gemma":0.00089775026,"threshold_uncertainty_score":0.02481538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031993464,0.0016994721,0.95053506,0.00042062413,0.00005135493,0.000087617496,0.000066417415,0.00018685493,0.014959148],"genre_scores_gemma":[0.89028686,0.0017853957,0.1027403,0.00008611986,0.000091746886,0.00026185802,0.00008683389,0.00008001069,0.004580946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983304,0.000901552,0.000038283324,0.0001544287,0.00033803043,0.00023732659],"domain_scores_gemma":[0.99838936,0.0011864547,0.000115932526,0.000073779374,0.00016481294,0.00006963661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016094283,0.0007804976,0.0006991056,0.0007318534,0.00054830307,0.001238481,0.001008248,0.00092361035,0.001997802],"category_scores_gemma":[0.0043576523,0.00049628876,0.00040654308,0.0011489514,0.0012000666,0.0013379686,0.0010632499,0.00080941804,0.00022936276],"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.000031602405,0.000018590768,0.0001362601,0.00006779745,0.0000149055995,0.00005422824,0.000038463517,0.91685367,0.0012456691,0.06549246,0.0007956468,0.015250632],"study_design_scores_gemma":[0.000006599868,0.00001349009,0.000056307163,0.000008502837,0.0000050809326,0.000017750697,0.00001501184,0.96309596,0.00044680326,0.0350639,0.0012651316,0.000005513365],"about_ca_topic_score_codex":0.0034569353,"about_ca_topic_score_gemma":0.0029621345,"teacher_disagreement_score":0.0034569353,"about_ca_system_score_codex":0.0022261592,"about_ca_system_score_gemma":0.0015504011,"threshold_uncertainty_score":0.016151965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011383774,0.00060021924,0.97835404,0.00037016242,0.00014606123,0.00032385206,0.000080675905,0.0011245593,0.0076167034],"genre_scores_gemma":[0.6071501,0.0013053752,0.37709934,0.0002595576,0.00027156936,0.0007597214,0.0002705577,0.00019015907,0.012693631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675363,0.0007540242,0.00016873113,0.00060825667,0.001397712,0.00031762276],"domain_scores_gemma":[0.99761236,0.00077837805,0.00034457014,0.00060398236,0.00051824213,0.00014245042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022837394,0.00053999794,0.00093478494,0.0010007742,0.0018442193,0.0024779153,0.0029114403,0.0012570028,0.003641839],"category_scores_gemma":[0.004433582,0.00045070314,0.00058482186,0.0013514123,0.0019121269,0.00484238,0.0031620057,0.0017032301,0.00074955786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026433295,0.00020109293,0.0011591694,0.00043268464,0.00013880593,0.00066849514,0.0008160004,0.11141294,0.033445343,0.654549,0.013968577,0.1829437],"study_design_scores_gemma":[0.0001893703,0.00028699051,0.0005568382,0.00005578925,0.00007730671,0.0007218519,0.00014671522,0.7564407,0.018765034,0.1266484,0.09596786,0.00014313175],"about_ca_topic_score_codex":0.0026286207,"about_ca_topic_score_gemma":0.001702669,"teacher_disagreement_score":0.003641839,"about_ca_system_score_codex":0.0016239369,"about_ca_system_score_gemma":0.0019709498,"threshold_uncertainty_score":0.012183189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11630386,0.0076242215,0.0025469027,0.020880697,0.0011214048,0.0001481731,0.0012134591,0.0006301848,0.84953105],"genre_scores_gemma":[0.20798412,0.0032859577,0.0018736558,0.003003358,0.00018246738,0.000101245365,0.0008810148,0.00018640867,0.78250176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995208,0.000073173505,0.000018051669,0.0000889165,0.00013438954,0.00016461182],"domain_scores_gemma":[0.9993135,0.00009804596,0.000070974325,0.000062560364,0.00020722253,0.00024761137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491894,0.00036639493,0.00020828666,0.0005479228,0.0030053502,0.0034972066,0.00040853434,0.0010382546,0.08467737],"category_scores_gemma":[0.0010109118,0.0002049209,0.0003005708,0.00080220593,0.0010025874,0.0015012875,0.0038488496,0.0016003837,0.021720398],"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.000570397,0.0003642476,0.046373166,0.0013518103,0.00008558684,0.004550931,0.055142052,0.00038157566,0.028854588,0.10226864,0.27771738,0.4823397],"study_design_scores_gemma":[0.0000069035877,0.000048845373,0.011932604,0.00012469986,0.000010580904,0.00026643637,0.004477066,0.000039993312,0.0012015359,0.00096060877,0.98092055,0.000010123047],"about_ca_topic_score_codex":0.015705846,"about_ca_topic_score_gemma":0.050295286,"teacher_disagreement_score":0.08467737,"about_ca_system_score_codex":0.002043529,"about_ca_system_score_gemma":0.004072278,"threshold_uncertainty_score":0.283274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01300137,0.015039978,0.0055147847,0.045152295,0.009581275,0.00013957974,0.00081522076,0.0006284909,0.9101271],"genre_scores_gemma":[0.05059078,0.0038938383,0.0020204734,0.0049203746,0.00063691864,0.00006889869,0.0004166684,0.000269694,0.9371823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965321,0.000857855,0.00014915754,0.0007992874,0.0011079591,0.0005534998],"domain_scores_gemma":[0.99670583,0.00045251797,0.00018623771,0.00060495327,0.0013324497,0.00071812776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028612441,0.00079400296,0.0006193866,0.00212335,0.007034874,0.010305081,0.0018382646,0.003620796,0.15337178],"category_scores_gemma":[0.0063836644,0.00043069356,0.0006021561,0.0022945069,0.003631039,0.0052243024,0.0053555435,0.003807289,0.05048831],"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.00011370452,0.000101449376,0.002996811,0.00038946196,0.000020392494,0.0004753733,0.014173082,0.00016307781,0.0022451628,0.43248227,0.3341653,0.21267386],"study_design_scores_gemma":[0.0000032547882,0.00000970938,0.0010160705,0.0001137025,0.0000029653643,0.000104351726,0.0019406023,0.000038369562,0.0002081442,0.0035083545,0.99304754,0.0000068910044],"about_ca_topic_score_codex":0.04548962,"about_ca_topic_score_gemma":0.07415579,"teacher_disagreement_score":0.8466282,"about_ca_system_score_codex":0.008418302,"about_ca_system_score_gemma":0.011892969,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01905014,0.0023658688,0.9619318,0.00053079793,0.00083728717,0.0007356275,0.00031853476,0.0067089032,0.0075209998],"genre_scores_gemma":[0.6527851,0.0015879718,0.33743104,0.0005948214,0.00030778692,0.0007454534,0.0005534646,0.00026963578,0.0057247435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981987,0.0003721828,0.000120693825,0.0003707148,0.00082792126,0.00010981084],"domain_scores_gemma":[0.9978732,0.00072652183,0.00035906935,0.0003159955,0.0006121268,0.00011303069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001860418,0.0009206548,0.0007252586,0.0018289846,0.0006992096,0.0014887694,0.0017540732,0.00073913473,0.0015287712],"category_scores_gemma":[0.005306267,0.00039274598,0.00067047094,0.00085822406,0.00078766595,0.001330484,0.0011805424,0.0016516369,0.00045686276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007586232,0.0007237376,0.009886393,0.0011550039,0.0005895887,0.00037859654,0.0005339204,0.1394427,0.06324931,0.05723729,0.034305386,0.6917393],"study_design_scores_gemma":[0.00018723636,0.00041821552,0.0023133112,0.000099022094,0.00017854449,0.00047908514,0.000051528266,0.91428304,0.034248732,0.011913062,0.03568871,0.00013955608],"about_ca_topic_score_codex":0.004880748,"about_ca_topic_score_gemma":0.003371855,"teacher_disagreement_score":0.004880748,"about_ca_system_score_codex":0.0009969547,"about_ca_system_score_gemma":0.0012210552,"threshold_uncertainty_score":0.009838998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25770116,0.0011041921,0.59001416,0.0006016594,0.0002851461,0.0009241817,0.010940736,0.017998291,0.120430514],"genre_scores_gemma":[0.7895943,0.0008906606,0.18376131,0.00010144798,0.00013406813,0.000593395,0.010148853,0.0006192157,0.014156772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742246,0.0006796917,0.00022669326,0.00024922114,0.0012757718,0.00014612945],"domain_scores_gemma":[0.9960748,0.0014483114,0.00043208254,0.0004928616,0.0014937721,0.000058196118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002250788,0.00088911416,0.0004018509,0.005729964,0.0003746638,0.0019961,0.0007395317,0.00037708733,0.004439928],"category_scores_gemma":[0.008110921,0.00017244721,0.00048673747,0.004887806,0.00020618428,0.0015353039,0.00045446775,0.00055011956,0.0019643744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056123093,0.0009448553,0.057386857,0.0004486479,0.000238984,0.00033020135,0.00068422995,0.21198788,0.014970008,0.06473594,0.022593258,0.6251179],"study_design_scores_gemma":[0.00003487612,0.0003988674,0.043537393,0.00013417256,0.00008378139,0.0003198663,0.00055372505,0.8710185,0.034074508,0.015841782,0.033885274,0.00011719245],"about_ca_topic_score_codex":0.0052023325,"about_ca_topic_score_gemma":0.002560754,"teacher_disagreement_score":0.005729964,"about_ca_system_score_codex":0.0012033827,"about_ca_system_score_gemma":0.0005246246,"threshold_uncertainty_score":0.014853001},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015028325,0.0004243793,0.8530361,0.00027207434,0.00037798536,0.0007331184,0.0016764194,0.10165403,0.026797501],"genre_scores_gemma":[0.32921323,0.001701156,0.5752419,0.0006967539,0.00018597813,0.0027379743,0.008793616,0.02238528,0.0590441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937636,0.00018682951,0.00003346412,0.00005326413,0.00028121853,0.00006877389],"domain_scores_gemma":[0.99924856,0.00026805795,0.000054338347,0.0001605192,0.00018001486,0.000088495915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010968408,0.0008582858,0.00052610383,0.0006696299,0.00030874135,0.0008212141,0.002376104,0.000648179,0.015968956],"category_scores_gemma":[0.0031617503,0.00038434338,0.0002551813,0.0005220775,0.00028190232,0.0013647733,0.0009466052,0.0014688799,0.007098727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019685465,0.0008127294,0.005688321,0.0012805992,0.00021171694,0.0009425906,0.0008681421,0.119122565,0.07737653,0.060494673,0.31018677,0.42104685],"study_design_scores_gemma":[0.00049814844,0.00058003794,0.0015952626,0.00014326288,0.00008512762,0.00070014823,0.000052445703,0.56234497,0.07829503,0.009633353,0.34595716,0.00011504242],"about_ca_topic_score_codex":0.00045266547,"about_ca_topic_score_gemma":0.00052443036,"teacher_disagreement_score":0.015968956,"about_ca_system_score_codex":0.0003753334,"about_ca_system_score_gemma":0.0005051074,"threshold_uncertainty_score":0.053421438},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022847093,0.004206791,0.00028634357,0.003350041,0.0025836749,0.00012078905,0.02383702,0.0016686964,0.9637182],"genre_scores_gemma":[0.0015033409,0.0044437144,0.0007976979,0.00096008857,0.00045899794,0.00014448645,0.010798999,0.0016582706,0.97923446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996811,0.00039711228,0.00028565546,0.0007750916,0.0013048095,0.00042629286],"domain_scores_gemma":[0.9926927,0.0008281298,0.0006039298,0.0013737142,0.0023555278,0.0021459924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003482112,0.0020343242,0.0033102133,0.009400233,0.0033762306,0.027495634,0.0018268123,0.0036588449,0.84335315],"category_scores_gemma":[0.0143263,0.001012069,0.0010195553,0.025642684,0.0024486447,0.010702327,0.006920902,0.002796937,0.85705173],"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.000025921465,0.000016561093,0.00014851918,0.00046746113,0.0000064903243,0.000025806621,0.00006561112,0.000015095708,0.00018275055,0.0056662005,0.95882154,0.034558117],"study_design_scores_gemma":[0.0000052350424,0.0000047563253,0.00023654383,0.0002242636,0.0000030365413,0.000015611477,0.00006158169,0.0000074704785,0.0000489687,0.00028710408,0.99909985,0.0000055157293],"about_ca_topic_score_codex":0.013332849,"about_ca_topic_score_gemma":0.011028029,"teacher_disagreement_score":0.84335315,"about_ca_system_score_codex":0.0058762254,"about_ca_system_score_gemma":0.013502056,"threshold_uncertainty_score":0.22343767},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06947112,0.4150089,0.4136729,0.018173127,0.001914323,0.00018862517,0.00016838928,0.00039060976,0.08101202],"genre_scores_gemma":[0.63468224,0.22897239,0.12306958,0.00085664034,0.0037830211,0.00010545506,0.0001204214,0.00023875249,0.008171531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.0013710501,0.00016950292,0.0004308837,0.001243047,0.0002396649],"domain_scores_gemma":[0.95473313,0.039560318,0.0009270358,0.0010825048,0.0032585901,0.00043850753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006885114,0.0010502973,0.000790616,0.002178756,0.00091043767,0.004390598,0.0015101222,0.002302107,0.0048919567],"category_scores_gemma":[0.026265433,0.0006906652,0.0005005374,0.0042265733,0.0037652687,0.008388089,0.0012622867,0.0017377697,0.0009822503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045844112,0.00021984965,0.0016351189,0.0017144594,0.00009873987,0.00017904084,0.0005380261,0.09761819,0.0030554247,0.27931497,0.0068390705,0.60832864],"study_design_scores_gemma":[0.00015299264,0.00076655817,0.0018563964,0.0015293452,0.00021445098,0.0010876821,0.0009518541,0.3905687,0.0075862273,0.4553363,0.13979875,0.00015078254],"about_ca_topic_score_codex":0.0028941487,"about_ca_topic_score_gemma":0.0010308645,"teacher_disagreement_score":0.006885114,"about_ca_system_score_codex":0.002205732,"about_ca_system_score_gemma":0.00091621897,"threshold_uncertainty_score":0.03641236},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014390826,0.018717766,0.11752619,0.06858562,0.1847484,0.0012551416,0.053338002,0.017335128,0.5241029],"genre_scores_gemma":[0.023617685,0.008120645,0.02341971,0.0028565568,0.00525739,0.00019271913,0.013228678,0.0028584492,0.92044824],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857426,0.00015991354,0.00009008331,0.0004110877,0.0005186676,0.0002460188],"domain_scores_gemma":[0.992867,0.0011397118,0.00015281771,0.0010354102,0.0038515017,0.0009536026],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002678437,0.0011420996,0.0020040264,0.0021817798,0.0024283286,0.0075024385,0.0015757467,0.0020253353,0.4061631],"category_scores_gemma":[0.011140857,0.0008536417,0.00059427344,0.003662974,0.0009207018,0.003033226,0.001799525,0.0017229026,0.21050051],"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.00018104533,0.00006824292,0.000909099,0.00021510514,0.00003329938,0.00008700089,0.00005781592,0.0010770956,0.0010499646,0.003152256,0.8414912,0.15167779],"study_design_scores_gemma":[0.00006765991,0.00007871804,0.0016765395,0.00015514958,0.000030407668,0.00011285608,0.00011987041,0.009052139,0.0019174841,0.0036008055,0.98314846,0.000039908384],"about_ca_topic_score_codex":0.029512571,"about_ca_topic_score_gemma":0.063431464,"teacher_disagreement_score":0.4061631,"about_ca_system_score_codex":0.0027606795,"about_ca_system_score_gemma":0.0037914051,"threshold_uncertainty_score":0.84703624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8569588,0.0029203007,0.10015915,0.0014340883,0.00026004552,0.00008853604,0.00034592245,0.0002643533,0.037568703],"genre_scores_gemma":[0.9943298,0.0002035449,0.0015850741,0.000028898472,0.000017412201,0.000012007609,0.000030986033,0.000015928583,0.0037762062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999603,0.000072937124,0.00000979105,0.00006664559,0.00011461803,0.0001330101],"domain_scores_gemma":[0.9981469,0.0010363747,0.00019133909,0.00009205712,0.00041630992,0.00011703978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007584525,0.00034217275,0.00038579942,0.00092638965,0.0005138879,0.001073626,0.00049234566,0.00037156197,0.005471526],"category_scores_gemma":[0.004989307,0.00021165074,0.0001975422,0.0007808715,0.0007099038,0.00089577603,0.0006606093,0.00045083484,0.00031522618],"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.00099087,0.00011650276,0.038913053,0.00020078967,0.00017208421,0.0012767424,0.0007662026,0.68871355,0.014482827,0.13055415,0.0116459215,0.1121673],"study_design_scores_gemma":[0.000018158253,0.00008202887,0.010262996,0.000030330946,0.00003839475,0.00028142016,0.0003232757,0.9743894,0.0017415391,0.009014987,0.0037889418,0.000028584467],"about_ca_topic_score_codex":0.04258682,"about_ca_topic_score_gemma":0.03067324,"teacher_disagreement_score":0.04258682,"about_ca_system_score_codex":0.0025413213,"about_ca_system_score_gemma":0.0014693968,"threshold_uncertainty_score":0.084677815},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49376434,0.00045062634,0.37357512,0.00050410995,0.00070239214,0.011434215,0.033422902,0.053992018,0.032154255],"genre_scores_gemma":[0.8502212,0.00032745744,0.108629264,0.00026044244,0.00020098368,0.0076906327,0.020046774,0.002226237,0.010396974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885535,0.00016254727,0.00008183732,0.00019978522,0.00052760536,0.00017289427],"domain_scores_gemma":[0.9979488,0.00043186868,0.00008999238,0.00062285486,0.000580487,0.00032612841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011751138,0.00071409676,0.001133723,0.0018851642,0.0009576634,0.0010582166,0.0011806036,0.00055763073,0.009548583],"category_scores_gemma":[0.003496045,0.0005165189,0.00015407882,0.0013147953,0.00036768557,0.0009264753,0.0010315321,0.0011216556,0.002714344],"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.007601127,0.003259141,0.040672038,0.0013083325,0.00019565721,0.0017412098,0.001620224,0.048426114,0.36979717,0.007255692,0.06586197,0.45226136],"study_design_scores_gemma":[0.0013761088,0.0026542637,0.080570385,0.0002208754,0.0001609616,0.0009015881,0.00089205784,0.41451746,0.3821314,0.0066482876,0.10953745,0.00038919906],"about_ca_topic_score_codex":0.0035875568,"about_ca_topic_score_gemma":0.0026138856,"teacher_disagreement_score":0.009548583,"about_ca_system_score_codex":0.00078708184,"about_ca_system_score_gemma":0.0010195912,"threshold_uncertainty_score":0.031943142},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013670511,0.0010830157,0.06431877,0.009900958,0.004394676,0.0023308794,0.027391586,0.08300344,0.79390615],"genre_scores_gemma":[0.08466694,0.0006103588,0.018623138,0.0028841083,0.0016079078,0.0006225558,0.023947483,0.004382492,0.862655],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.00023407233,0.00006596541,0.00014839969,0.0006323576,0.00017820773],"domain_scores_gemma":[0.9948716,0.0005964434,0.0001558866,0.00078493444,0.0029654745,0.00062571774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027232429,0.00074789644,0.00050233887,0.0015814451,0.0011680785,0.0024589545,0.0010481481,0.0015834385,0.24812336],"category_scores_gemma":[0.005796478,0.00039408635,0.00021794678,0.00079150323,0.00030208073,0.0012770942,0.00101411,0.0012619266,0.13207641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023501625,0.00008371503,0.0009702944,0.000059880553,0.0000058782052,0.00011743772,0.00005165621,0.00064350717,0.001544356,0.0028561912,0.91355735,0.07987462],"study_design_scores_gemma":[0.00011201883,0.00012633229,0.003306526,0.00005543399,0.000008929944,0.00013581062,0.000052091007,0.0056165042,0.0041913507,0.0020068,0.98435956,0.00002863065],"about_ca_topic_score_codex":0.0048896824,"about_ca_topic_score_gemma":0.009519441,"teacher_disagreement_score":0.24812336,"about_ca_system_score_codex":0.0013893216,"about_ca_system_score_gemma":0.0009652155,"threshold_uncertainty_score":0.83005536},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010242224,0.0009840252,0.0066525345,0.0024649147,0.0010995243,0.00016447932,0.0030701528,0.0019093642,0.9826308],"genre_scores_gemma":[0.021830423,0.0028659448,0.010237491,0.0028245545,0.0008486741,0.0002523849,0.01203615,0.0007479972,0.94835633],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927443,0.000094069204,0.000040780575,0.00011902808,0.0003755154,0.000096310556],"domain_scores_gemma":[0.9987459,0.00016599259,0.000052577576,0.00037249873,0.0005235582,0.00013948468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065993593,0.0006224675,0.00047765762,0.0023426542,0.0014180121,0.004410972,0.001461787,0.0018661381,0.38891324],"category_scores_gemma":[0.0028248013,0.00031250794,0.0004176471,0.002165084,0.0004773169,0.0045335144,0.002185149,0.0014473198,0.24913469],"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.00005913372,0.000067140136,0.00044040717,0.00018802482,0.000009315003,0.00015359814,0.000120587225,0.00032133234,0.0008510802,0.14304762,0.61341053,0.24133123],"study_design_scores_gemma":[0.000005834625,0.000010240496,0.00017901971,0.000047203463,0.0000033185963,0.0000951533,0.000036942773,0.00022532466,0.00025047976,0.005626121,0.99351525,0.000005026524],"about_ca_topic_score_codex":0.002256042,"about_ca_topic_score_gemma":0.002482762,"teacher_disagreement_score":0.6110867,"about_ca_system_score_codex":0.0010678205,"about_ca_system_score_gemma":0.001168176,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006855061,0.0013775278,0.051298782,0.017334597,0.009837957,0.0046878997,0.039097607,0.013684173,0.8558264],"genre_scores_gemma":[0.02581631,0.0010409987,0.04432208,0.003924148,0.0014682759,0.002510699,0.09157601,0.0038282913,0.82551324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954993,0.0008545613,0.00010202999,0.000700412,0.0019733605,0.00087017694],"domain_scores_gemma":[0.99268085,0.000253976,0.00013255037,0.00082525803,0.003942782,0.0021646097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006995927,0.0010222611,0.00071492273,0.0020812508,0.0017929127,0.0052481187,0.0033253822,0.0034325437,0.31617486],"category_scores_gemma":[0.006444291,0.00045754685,0.00061259314,0.0018512039,0.00056396605,0.0025018894,0.0037594817,0.0016803643,0.25528985],"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.00026777532,0.00031340081,0.0006818776,0.00017893923,0.000014199312,0.00008527946,0.00007533971,0.0004287654,0.0025026035,0.026936138,0.87523896,0.09327682],"study_design_scores_gemma":[0.00006837064,0.000119197655,0.00047655698,0.000053486314,0.000007036609,0.00008311185,0.00006164744,0.000800288,0.0015778975,0.0025621932,0.9941802,0.000010032887],"about_ca_topic_score_codex":0.006276159,"about_ca_topic_score_gemma":0.003939424,"teacher_disagreement_score":0.31617486,"about_ca_system_score_codex":0.0028751038,"about_ca_system_score_gemma":0.010530284,"threshold_uncertainty_score":0.97539353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057965033,0.002118084,0.91097456,0.0019373174,0.00046788392,0.00015425215,0.0025769202,0.0053397524,0.018466245],"genre_scores_gemma":[0.42478192,0.0028643294,0.53955585,0.00015989572,0.00017531359,0.00014786568,0.005572427,0.00034322002,0.026399205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905306,0.00019220808,0.000029880002,0.00022027102,0.00041347832,0.000091038564],"domain_scores_gemma":[0.99791485,0.0006978853,0.0001536512,0.00031055333,0.0007609004,0.0001620976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013434842,0.0010493781,0.0008464527,0.0017615083,0.0011139548,0.0027253367,0.0016467073,0.0010732558,0.0031721732],"category_scores_gemma":[0.007135191,0.00074260484,0.00041982858,0.0020298962,0.0008483717,0.0011487571,0.0012376268,0.0015113616,0.0012413758],"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.0007431806,0.00015314811,0.010654841,0.0002639206,0.00015021501,0.00039693678,0.0002933065,0.557953,0.011897103,0.033995125,0.02915092,0.3543483],"study_design_scores_gemma":[0.000017762364,0.000021312864,0.001523958,0.000026277821,0.000014154883,0.000062330866,0.000043448686,0.9787356,0.0030095698,0.00884471,0.00767803,0.00002276786],"about_ca_topic_score_codex":0.22395179,"about_ca_topic_score_gemma":0.17931506,"teacher_disagreement_score":0.22395179,"about_ca_system_score_codex":0.0036920267,"about_ca_system_score_gemma":0.0060192323,"threshold_uncertainty_score":0.44529647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826312,0.00028150986,0.09897862,0.0006368002,0.00016528921,0.00019814211,0.00021799604,0.0035212769,0.013369206],"genre_scores_gemma":[0.990677,0.00003300098,0.00843796,0.00009779816,0.0000066915622,0.000033933044,0.000029272735,0.00007766136,0.0006066513],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905616,0.00019621904,0.00004618669,0.00013093163,0.00034775666,0.00022277341],"domain_scores_gemma":[0.99552697,0.0014213455,0.0005093464,0.0017543928,0.0006235557,0.00016443197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012469039,0.0004161373,0.00026542484,0.0005113103,0.00063096674,0.0010649987,0.0011183934,0.0005441892,0.0020893984],"category_scores_gemma":[0.0061466065,0.00017714669,0.00019440158,0.00031405536,0.0012144673,0.0015375935,0.0006822167,0.0013922786,0.00023330598],"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.0020648486,0.0014710005,0.036055803,0.0006278046,0.00019858232,0.001719622,0.0014956631,0.20342241,0.46244073,0.15278137,0.010134732,0.12758738],"study_design_scores_gemma":[0.00006960593,0.00074085733,0.0052224696,0.000053244068,0.000071454684,0.0004563752,0.00026266475,0.7109044,0.25468,0.017212708,0.010213671,0.000112498616],"about_ca_topic_score_codex":0.0016332803,"about_ca_topic_score_gemma":0.0017763738,"teacher_disagreement_score":0.0020893984,"about_ca_system_score_codex":0.0008196868,"about_ca_system_score_gemma":0.0011118614,"threshold_uncertainty_score":0.006989777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008243485,0.00010446532,0.94742155,0.00017516268,0.00009458324,0.00031397436,0.0002544442,0.028157819,0.015234517],"genre_scores_gemma":[0.2902956,0.0003487516,0.6813554,0.000289972,0.00007161287,0.0010124189,0.0010104689,0.005809933,0.01980586],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874157,0.00036161684,0.00007991081,0.00019326663,0.0003868032,0.00023689553],"domain_scores_gemma":[0.9982686,0.0008125921,0.00008279851,0.00031931704,0.00029847218,0.00021818726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002429588,0.0016120984,0.00066728203,0.000857716,0.0009644723,0.00312589,0.0038667747,0.0015475146,0.031996068],"category_scores_gemma":[0.0049207453,0.001254815,0.0013151648,0.0004296907,0.0011364412,0.0029880537,0.0029885734,0.0018197517,0.0055770874],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026134881,0.0005279937,0.0039849416,0.0012694601,0.00016801295,0.0025819612,0.0023587942,0.16712525,0.062266387,0.32770994,0.054227088,0.3751666],"study_design_scores_gemma":[0.00035156796,0.0004007173,0.00041623585,0.00020059515,0.00008541057,0.00059346255,0.00023369346,0.7369035,0.051143598,0.077495545,0.13204685,0.00012886444],"about_ca_topic_score_codex":0.003379332,"about_ca_topic_score_gemma":0.0034171916,"teacher_disagreement_score":0.031996068,"about_ca_system_score_codex":0.0010341721,"about_ca_system_score_gemma":0.0013357189,"threshold_uncertainty_score":0.107037544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06480878,0.0010928847,0.93054634,0.00017658662,0.00014467169,0.00009972151,0.00003408508,0.0019627623,0.0011342337],"genre_scores_gemma":[0.75178057,0.0005708321,0.24585442,0.000103323386,0.000088502085,0.000111738394,0.000092268136,0.00010359078,0.0012947532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00006866865,0.000030082569,0.00008112507,0.00012413529,0.000041974185],"domain_scores_gemma":[0.9991617,0.00034637307,0.00017734316,0.00008436216,0.00019111834,0.00003901196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111522,0.0008339678,0.0006758554,0.0008348866,0.00047038347,0.000406213,0.0011442853,0.0005044537,0.0005754489],"category_scores_gemma":[0.0027894115,0.00021568564,0.00035165428,0.0003939213,0.0002787306,0.0009972345,0.00038760004,0.0007508082,0.00017515704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048964703,0.00022720332,0.003566529,0.00022164552,0.00011144282,0.00025093794,0.00027318377,0.41937757,0.06327275,0.009355883,0.003117898,0.4997354],"study_design_scores_gemma":[0.000030489138,0.00015071103,0.00043626322,0.000009292917,0.000035569723,0.00009707241,0.00001573347,0.9855137,0.011252062,0.0010697638,0.0013700963,0.000019199828],"about_ca_topic_score_codex":0.0013730355,"about_ca_topic_score_gemma":0.0013475001,"teacher_disagreement_score":0.0013730355,"about_ca_system_score_codex":0.0004632189,"about_ca_system_score_gemma":0.0007277088,"threshold_uncertainty_score":0.00534755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027746258,0.00017674378,0.9605656,0.00039114355,0.000092531765,0.00011121797,0.000025873544,0.00046673062,0.010423821],"genre_scores_gemma":[0.7528327,0.00017075021,0.23751047,0.00014226403,0.000047750193,0.00017277202,0.000033241547,0.000027998864,0.00906194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.000065698994,0.000013391918,0.00004256061,0.00010175853,0.000030684092],"domain_scores_gemma":[0.9996462,0.00014949556,0.000037205427,0.000025256093,0.00010316526,0.000038619477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006298228,0.0003047251,0.00040665356,0.00023437616,0.0003710045,0.0006010815,0.000942788,0.00070209615,0.0020059443],"category_scores_gemma":[0.0015649787,0.00014127523,0.00030802455,0.0001673686,0.0005527083,0.00044883022,0.0004567208,0.0007616223,0.00029341172],"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.000121548335,0.0001496728,0.0008009525,0.000076091674,0.000048577138,0.00017789294,0.00017364914,0.810392,0.0071611525,0.06916443,0.0018785899,0.10985546],"study_design_scores_gemma":[0.000017329754,0.00003820617,0.00004844271,0.000003959988,0.000004805287,0.00001788448,0.0000063906123,0.9937763,0.0007698059,0.0039799786,0.0013325769,0.000004292738],"about_ca_topic_score_codex":0.0033109132,"about_ca_topic_score_gemma":0.0031756412,"teacher_disagreement_score":0.0033109132,"about_ca_system_score_codex":0.00092924415,"about_ca_system_score_gemma":0.0010524729,"threshold_uncertainty_score":0.006742239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16282707,0.00036633815,0.820705,0.00021626567,0.000058116042,0.0002199825,0.0011498213,0.0022072042,0.012250154],"genre_scores_gemma":[0.84064794,0.0005927381,0.14852934,0.00009037698,0.000059265527,0.00024025832,0.0020809625,0.0001918693,0.0075672483],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99947697,0.00007983432,0.00003703941,0.0000876719,0.0002626872,0.000055736105],"domain_scores_gemma":[0.9988367,0.0002626697,0.00008107174,0.0001811238,0.0006066879,0.000031772775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046553047,0.00042628733,0.0004776207,0.0015248618,0.00032737607,0.00091985165,0.0006607358,0.0005102944,0.0017510152],"category_scores_gemma":[0.0023408183,0.00017793998,0.0002087702,0.0006787336,0.0002508821,0.0012757581,0.0003555945,0.0006810958,0.0012001855],"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.0005619876,0.0004833125,0.026356416,0.00026488543,0.00005015413,0.0004866597,0.00039769756,0.19413127,0.30384874,0.03168131,0.0068638925,0.43487367],"study_design_scores_gemma":[0.000009738898,0.0001228837,0.01624924,0.00002713963,0.000016396263,0.0004206931,0.00015968409,0.8467878,0.1223739,0.0071554086,0.0066210832,0.000056037337],"about_ca_topic_score_codex":0.0009272428,"about_ca_topic_score_gemma":0.0007988384,"teacher_disagreement_score":0.0017510152,"about_ca_system_score_codex":0.00037907634,"about_ca_system_score_gemma":0.00037226258,"threshold_uncertainty_score":0.005857706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029007347,0.0015074768,0.9647241,0.00037737112,0.000066809436,0.00004625222,0.0000808402,0.00010794611,0.0040819095],"genre_scores_gemma":[0.7991304,0.006412548,0.18624257,0.00015540197,0.00029171375,0.00021239833,0.0002102803,0.00006928193,0.0072755083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966085,0.000083585415,0.000020866879,0.000052763084,0.00015248281,0.000029365734],"domain_scores_gemma":[0.9995685,0.00020437449,0.00007226572,0.000049531936,0.000087700086,0.000017681969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051496294,0.0005465496,0.00036970276,0.0010271741,0.00033438695,0.001174151,0.00050775293,0.0006715402,0.00042659015],"category_scores_gemma":[0.0017712986,0.000230199,0.00080526713,0.00079296704,0.0007682739,0.0013546906,0.0007029407,0.00077885453,0.00015081772],"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.000018989595,0.000042200183,0.0012493412,0.0001083639,0.000022584922,0.00017956771,0.00016832026,0.5630619,0.009843329,0.3989105,0.0008969481,0.025497938],"study_design_scores_gemma":[0.0000024840065,0.000015753742,0.0002125563,0.000012653985,0.0000041609833,0.00005636883,0.000016535954,0.94248027,0.00080398814,0.05423349,0.0021538823,0.0000077425475],"about_ca_topic_score_codex":0.0020746123,"about_ca_topic_score_gemma":0.0008154969,"teacher_disagreement_score":0.0020746123,"about_ca_system_score_codex":0.0008172324,"about_ca_system_score_gemma":0.00070268015,"threshold_uncertainty_score":0.0059295297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014965129,0.1262513,0.48242313,0.025344336,0.10841528,0.00043229153,0.0020781748,0.0028400244,0.23725034],"genre_scores_gemma":[0.47072783,0.13312446,0.053684983,0.0038200468,0.10745156,0.0012728475,0.0039794394,0.0010162523,0.22492261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778265,0.00047448932,0.00015134599,0.00045380354,0.0010170181,0.00012085656],"domain_scores_gemma":[0.9975932,0.0009992451,0.00018075484,0.000367853,0.00073913747,0.00011980208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020015752,0.0015817101,0.0013532669,0.0012360723,0.00062804134,0.004163497,0.00088726706,0.0017194459,0.018294536],"category_scores_gemma":[0.00540731,0.00025172287,0.00040441848,0.001317178,0.0014283131,0.0023438605,0.001186618,0.0020964665,0.0044025118],"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.00021049277,0.00010898623,0.0009817426,0.0010152427,0.000167585,0.00020793932,0.00021851475,0.0382558,0.0034508568,0.34646288,0.25767747,0.3512425],"study_design_scores_gemma":[0.000079854704,0.00033477967,0.0019051783,0.00036136538,0.00007409622,0.00029013524,0.000111481175,0.11029508,0.0021205947,0.23862097,0.64573425,0.000072319686],"about_ca_topic_score_codex":0.0009148089,"about_ca_topic_score_gemma":0.00033956376,"teacher_disagreement_score":0.018294536,"about_ca_system_score_codex":0.0012529853,"about_ca_system_score_gemma":0.0011898993,"threshold_uncertainty_score":0.061201334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13713667,0.0006375403,0.6246881,0.0014219044,0.00182629,0.0024074798,0.03835325,0.10829065,0.085238114],"genre_scores_gemma":[0.3992569,0.0008865173,0.5150681,0.00085892656,0.00012828107,0.0031961633,0.051273763,0.0069127786,0.022418665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937636,0.00017594901,0.00006361139,0.00007983481,0.00021075315,0.00009352704],"domain_scores_gemma":[0.998204,0.00067866914,0.0000736754,0.00034900627,0.0005736536,0.00012103161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012607859,0.0009553286,0.0006209674,0.00063533016,0.00048049368,0.0009865208,0.002566664,0.00091721345,0.013757983],"category_scores_gemma":[0.0030044771,0.00063048076,0.0006895258,0.000696516,0.00035524467,0.0009539638,0.00066580984,0.002252279,0.0034317446],"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.00073431595,0.00080061215,0.0059925723,0.0006457477,0.00036145124,0.00035312067,0.0002730177,0.8084089,0.016211081,0.031823706,0.07631135,0.05808405],"study_design_scores_gemma":[0.00020563981,0.00009981917,0.00058063236,0.00002346491,0.000047658385,0.00005854064,0.000026409018,0.9367742,0.009524249,0.0043592737,0.04827041,0.000029674171],"about_ca_topic_score_codex":0.0072046327,"about_ca_topic_score_gemma":0.0065249964,"teacher_disagreement_score":0.013757983,"about_ca_system_score_codex":0.00096553593,"about_ca_system_score_gemma":0.0021758347,"threshold_uncertainty_score":0.04602498},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021106493,0.09724847,0.29786348,0.026223302,0.1194989,0.0012021317,0.0017450444,0.0039157444,0.43119645],"genre_scores_gemma":[0.13932668,0.08634539,0.09690783,0.0056444807,0.025935741,0.0008967478,0.008648105,0.0016622032,0.63463277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979399,0.0004469605,0.00012853196,0.00024218607,0.001032581,0.00020992044],"domain_scores_gemma":[0.9970493,0.00049862696,0.000117905365,0.00032254643,0.0015160616,0.00049562386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002901811,0.001479642,0.0013819344,0.0011463467,0.00093806064,0.0046609975,0.0016934549,0.0018608856,0.04663453],"category_scores_gemma":[0.0040932,0.0003364673,0.0008231245,0.0010985463,0.00097049517,0.002597143,0.0016609494,0.0032466578,0.019108938],"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.0004095777,0.00021904161,0.0010936743,0.0006684343,0.00011844813,0.00050272106,0.0003160678,0.00367224,0.00868478,0.019868657,0.626355,0.3380914],"study_design_scores_gemma":[0.000029254894,0.00016041684,0.0013406788,0.000283478,0.000058157726,0.00042430556,0.00022257489,0.011405821,0.0019340002,0.007096554,0.97700274,0.00004208428],"about_ca_topic_score_codex":0.0031570557,"about_ca_topic_score_gemma":0.0044273143,"teacher_disagreement_score":0.04663453,"about_ca_system_score_codex":0.0013408758,"about_ca_system_score_gemma":0.002133513,"threshold_uncertainty_score":0.156008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042084012,0.0006880582,0.9494032,0.00056735094,0.00047651352,0.00015130296,0.00014204788,0.003128456,0.0033590063],"genre_scores_gemma":[0.7255379,0.00042836482,0.26702413,0.00033465316,0.00033386386,0.00017935528,0.00020897886,0.00014475931,0.005808067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.00013554048,0.00004457723,0.00012113189,0.0002059631,0.00009677981],"domain_scores_gemma":[0.9988746,0.00029827308,0.00004116555,0.00025366838,0.00040967713,0.00012266368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020498391,0.00046814172,0.00068618223,0.0005826562,0.0015076846,0.0016450218,0.0032468399,0.0011137219,0.0038765601],"category_scores_gemma":[0.0034455506,0.000341379,0.00038490893,0.0006177756,0.0008126039,0.0019899758,0.00118278,0.0012472585,0.00064787414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018525115,0.0007977787,0.002508404,0.00027159287,0.00014286955,0.00027504866,0.0005632598,0.28428882,0.07338896,0.16312808,0.022470463,0.45031217],"study_design_scores_gemma":[0.00014740165,0.00020744665,0.00019992726,0.000015060654,0.000057462592,0.000054956145,0.000020156516,0.95244133,0.008098286,0.030524999,0.008194469,0.000038500966],"about_ca_topic_score_codex":0.006760418,"about_ca_topic_score_gemma":0.008460179,"teacher_disagreement_score":0.006760418,"about_ca_system_score_codex":0.0019524957,"about_ca_system_score_gemma":0.002052666,"threshold_uncertainty_score":0.014166415},"labels":[],"label_agreement":null}]}