{"meta":{"query_hash":"23d21b3c2611","filters":{"venue":"IEEE/ACM Transactions on Networking"},"cohort_total":117,"direct_labels_cover":0,"predictions_cover":117,"exported":117,"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/23d21b3c2611","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE%2FACM+Transactions+on+Networking"},"results":[{"id":"W1971246165","doi":"10.1109/tnet.2012.2194508","title":"FireCol: A Collaborative Protection Network for the Detection of Flooding DDoS Attacks","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Public Works and Government Services Canada; University of Waterloo","funders":"","keywords":"Denial-of-service attack; Botnet; Computer science; Computer security; Software deployment; Flooding (psychology); Application layer DDoS attack; Computer network; The Internet; Overhead (engineering); World Wide Web","score_opus":0.03682731981442335,"score_gpt":0.26350178786766415,"score_spread":0.2266744680532408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971246165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005223933,0.0009329313,0.9824183,0.00041082394,0.009265378,0.0014290325,0.000004491463,0.00023564327,0.00007948411],"genre_scores_gemma":[0.98677146,0.00029116368,0.009841548,0.00014200526,0.0021924549,0.0006694091,0.0000010441065,0.000029401532,0.00006151628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979728,0.00022440193,0.00046660707,0.00037450608,0.00032747767,0.0006342084],"domain_scores_gemma":[0.99779457,0.0007803586,0.00041569592,0.00069638377,0.00020767997,0.00010533273],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010669,0.00025295478,0.0002643324,0.00014071082,0.0014423949,0.00012660639,0.0005710604,0.00020241122,0.000012627461],"category_scores_gemma":[0.000036869136,0.0002143698,0.00021957938,0.0017436449,0.00006974177,0.0007332876,0.000016474347,0.00046798153,0.000010869359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002177051,0.00015409804,0.000034743673,0.000034293353,0.0001476288,3.1408618e-7,0.0012657328,0.15101297,0.0022243024,0.00045214946,0.00024013658,0.8442159],"study_design_scores_gemma":[0.0010637253,0.00087333075,0.0003761934,0.0002988618,0.00015979345,0.000040010895,0.00016776513,0.85855764,0.051372256,0.003112134,0.08338158,0.00059668545],"about_ca_topic_score_codex":0.000043834258,"about_ca_topic_score_gemma":0.00016391912,"teacher_disagreement_score":0.98154753,"about_ca_system_score_codex":0.00013754942,"about_ca_system_score_gemma":0.000047994985,"threshold_uncertainty_score":0.9998576},"labels":[],"label_agreement":null},{"id":"W1980609711","doi":"10.1109/tnet.2013.2272599","title":"On Signaling-Free Failure Dependent Restoration in All-Optical Mesh Networks","year":2013,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Optical Network Technologies","field":"Engineering","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 Waterloo","funders":"","keywords":"Network topology; Computer science; Spare part; Heuristic; Overhead (engineering); Resource allocation; Distributed computing; Routing (electronic design automation); Computer network; Mesh networking; Reliability engineering; Engineering; Telecommunications","score_opus":0.018368318661564062,"score_gpt":0.22442504752289164,"score_spread":0.2060567288613276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980609711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2672098,0.0002915683,0.7220677,0.0015984942,0.0032542832,0.0011249441,0.0000055914606,0.0027606469,0.0016869877],"genre_scores_gemma":[0.9870857,0.00021349368,0.0116677685,0.00019858181,0.00042578345,0.00025252884,0.000007758084,0.00010197956,0.00004638229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976609,0.00006559699,0.00055421755,0.00047139727,0.0004002174,0.000847669],"domain_scores_gemma":[0.99808943,0.00061450055,0.000049597,0.0010481613,0.00004699085,0.00015133443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024967958,0.00041649456,0.00036314546,0.0003181239,0.00014651456,0.00017087966,0.0006932097,0.00054945017,0.00013977595],"category_scores_gemma":[0.00003906138,0.00043127997,0.00012909551,0.00067345117,0.00008488867,0.00029219117,0.000015022027,0.0014776923,0.00016283969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025154985,0.00007907528,0.000044226712,0.00001357613,0.000059220787,0.000019017354,0.000046690104,0.9558285,0.00047043152,0.0009330213,0.0023810607,0.040100016],"study_design_scores_gemma":[0.0010246382,0.0002872022,0.00023875576,0.00038781864,0.0000622858,0.000014784636,0.000112030255,0.9831052,0.0022866968,0.01055609,0.0011120936,0.000812416],"about_ca_topic_score_codex":0.000023150684,"about_ca_topic_score_gemma":0.00041877743,"teacher_disagreement_score":0.71987593,"about_ca_system_score_codex":0.00034477178,"about_ca_system_score_gemma":0.000013622347,"threshold_uncertainty_score":0.9998139},"labels":[],"label_agreement":null},{"id":"W1985235227","doi":"10.1109/tnet.2014.2350013","title":"Diffusion LMS Strategies in Sensor Networks With Noisy Input Data","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"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":"Noise (video); Convergence (economics); Least mean squares filter; Computer science; Stability (learning theory); Regression; A priori and a posteriori; Algorithm; White noise; Node (physics); Diffusion; Mathematics; Statistics; Artificial intelligence; Adaptive filter; Machine learning; Engineering","score_opus":0.026300359878116727,"score_gpt":0.24808881779888767,"score_spread":0.22178845792077095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985235227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020955425,0.00008795438,0.97606385,0.00003430742,0.00068063213,0.00025201798,0.000011828042,0.0011943206,0.0007196822],"genre_scores_gemma":[0.93292826,0.00028079312,0.06613307,0.00004628167,0.0004008723,0.000045652694,0.000024588677,0.00010555943,0.000034931003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984819,0.0000617871,0.00030603705,0.00045433638,0.00019614729,0.00049977377],"domain_scores_gemma":[0.9983682,0.00021432036,0.00005068337,0.0012600936,0.000024506353,0.000082171704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021115458,0.00033140296,0.00029753658,0.00018582244,0.00013782646,0.00008886583,0.0005992842,0.00015458214,0.000014686531],"category_scores_gemma":[0.000004843146,0.00031788254,0.000038582406,0.00044345265,0.00005467133,0.00043410232,0.000017447308,0.00068374275,0.000007119015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038852824,0.000031564578,0.00010247943,0.00002134926,0.00002280714,0.00001068064,0.00006554804,0.9446619,0.001043885,0.000029770603,0.0000622972,0.053908836],"study_design_scores_gemma":[0.00051817077,0.00014448832,0.00060773175,0.0005878691,0.000027284768,0.000021570864,0.00008101734,0.9877819,0.0010380005,0.000421142,0.0082202265,0.0005505967],"about_ca_topic_score_codex":0.000032971584,"about_ca_topic_score_gemma":0.0005044819,"teacher_disagreement_score":0.9119728,"about_ca_system_score_codex":0.000107477514,"about_ca_system_score_gemma":0.000013196789,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W1995673582","doi":"10.1109/tnet.2014.2320723","title":"Hierarchical Cache Performance Analysis Under TTL-Based Consistency","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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; Cache; Latency (audio); Consistency (knowledge bases); Cache coherence; Protocol (science); Consistency model; Computer network; Hierarchy; Operating system; Data consistency; Parallel computing; CPU cache; Real-time computing; Cache algorithms; Telecommunications","score_opus":0.027594597186736704,"score_gpt":0.23484559831767923,"score_spread":0.20725100113094252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995673582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058509838,0.00006340892,0.93797356,0.0010380686,0.0011182866,0.000085315325,0.0000018784782,0.00030756215,0.0009021101],"genre_scores_gemma":[0.99223894,0.0000266893,0.00582364,0.0014346046,0.00020510453,0.000021676973,0.0000035495375,0.000015423171,0.00023040066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998089,0.00021277837,0.0003194503,0.00055058696,0.00038799387,0.00044017626],"domain_scores_gemma":[0.99804544,0.0005145554,0.00008765436,0.001134146,0.00006565611,0.00015253616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047384205,0.00022403122,0.00030211773,0.00039349144,0.000604391,0.00018492958,0.00083095767,0.00010945723,0.000022363542],"category_scores_gemma":[0.00000789606,0.00021591311,0.00036114486,0.0012962731,0.000081600374,0.00020442932,0.000009962973,0.0005081796,0.00004423505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027943084,0.0001290279,0.0011558696,0.000010800032,0.0002660353,0.000004489587,0.00009417039,0.79897755,0.00016081471,0.00066144136,0.000059032354,0.19845282],"study_design_scores_gemma":[0.00040307041,0.00011807319,0.0019061421,0.00005183523,0.00021690082,0.000006744433,0.000008939345,0.9949713,0.00024926526,0.00041569243,0.0013577412,0.00029430416],"about_ca_topic_score_codex":0.000065750035,"about_ca_topic_score_gemma":0.00010225126,"teacher_disagreement_score":0.93372905,"about_ca_system_score_codex":0.00008022838,"about_ca_system_score_gemma":0.000070014175,"threshold_uncertainty_score":0.88046813},"labels":[],"label_agreement":null},{"id":"W1997932713","doi":"10.1109/tnet.2012.2227338","title":"Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"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; Cache; FIFO (computing and electronics); Cache algorithms; Cache invalidation; Smart Cache; CPU cache; Cache coloring; Markov chain; Cache pollution; FIFO and LIFO accounting; Parallel computing; Algorithm; Operating system","score_opus":0.04008999090234793,"score_gpt":0.2645258474085417,"score_spread":0.22443585650619374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997932713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675033,0.00027409714,0.9194571,0.00013210255,0.0026933055,0.00012305203,0.0000034713507,0.00028528064,0.0002812683],"genre_scores_gemma":[0.93665403,0.0000146525035,0.06228512,0.0002626022,0.0006002655,0.000012380948,0.000002653767,0.000021250096,0.00014701406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980134,0.00018493102,0.00037817075,0.00041652907,0.00037802974,0.0006289337],"domain_scores_gemma":[0.99846923,0.00029565912,0.00015536921,0.0008506572,0.0000534341,0.0001756757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060389686,0.00024919532,0.0003102507,0.00040531805,0.0007346865,0.00024890114,0.0006442996,0.00010560089,0.000022638258],"category_scores_gemma":[0.00001244884,0.00025955922,0.00029257758,0.001565106,0.000032849184,0.0005499008,0.000017355303,0.00041100403,0.000016589893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015763186,0.00011714602,0.0008957582,0.000009425746,0.00040148394,0.000027106953,0.0009145214,0.8162796,0.0011357932,0.00011118418,0.000025784713,0.1800664],"study_design_scores_gemma":[0.0001756767,0.000027273316,0.000112551235,0.000061130435,0.00030174782,0.00007746485,0.000048643993,0.9984078,0.00021724112,0.00006833655,0.00019857606,0.00030357737],"about_ca_topic_score_codex":0.000247891,"about_ca_topic_score_gemma":0.00009483286,"teacher_disagreement_score":0.85990375,"about_ca_system_score_codex":0.00021452138,"about_ca_system_score_gemma":0.00004662794,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2012493153","doi":"10.1109/tnet.2014.2354262","title":"Measurement Study of Netflix, Hulu, and a Tale of Three CDNs","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Defense Threat Reduction Agency; National Science Foundation","keywords":"Computer science; Cloud computing; Service provider; Content delivery network; Bandwidth (computing); Key (lock); Quality of service; Content delivery; Video streaming; Computer network; Service (business); Multimedia; World Wide Web; Server; Computer security; Operating system","score_opus":0.04813788733683651,"score_gpt":0.23413764308448615,"score_spread":0.18599975574764965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012493153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33831924,0.00015491142,0.6604609,0.000066022985,0.0006199503,0.0001649046,6.469597e-7,0.000051627096,0.00016179432],"genre_scores_gemma":[0.99902254,0.000021253565,0.0007978866,0.000041160547,0.000075607146,0.000013591215,9.8400925e-8,0.00000902851,0.000018838786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870646,0.000087247136,0.0002952121,0.00029284143,0.00043234203,0.00018587493],"domain_scores_gemma":[0.998966,0.000101806545,0.00012070598,0.00065761857,0.00009731201,0.00005656151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055576855,0.0001285726,0.0002323941,0.00012414691,0.00015074898,0.000036983045,0.0004422165,0.000041322186,0.00000254936],"category_scores_gemma":[0.000007164295,0.00012382933,0.00007598472,0.00027326486,0.000035005214,0.000120626624,0.000013913434,0.00016244297,0.0000014165529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007270762,0.0012162138,0.0044828807,0.000054463097,0.0002415926,0.000004265944,0.0018022902,0.061001573,0.0064035775,0.00026325366,0.000045729186,0.9244115],"study_design_scores_gemma":[0.0076072016,0.006514119,0.028010074,0.0015160615,0.0004910101,0.000050666593,0.0008605272,0.94007635,0.007289177,0.004304048,0.0019216702,0.0013590886],"about_ca_topic_score_codex":0.0002805377,"about_ca_topic_score_gemma":0.0007189698,"teacher_disagreement_score":0.9230524,"about_ca_system_score_codex":0.00002550254,"about_ca_system_score_gemma":0.000019866371,"threshold_uncertainty_score":0.5049614},"labels":[],"label_agreement":null},{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","score_opus":0.018892686491035097,"score_gpt":0.22881789716586323,"score_spread":0.20992521067482814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013174072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01043478,0.00043657256,0.98353326,0.0012918208,0.0024745583,0.00023062502,0.0000015223626,0.0003624087,0.0012344723],"genre_scores_gemma":[0.9857188,0.0001344662,0.012386208,0.0011472282,0.00022490743,0.000042190495,5.575026e-7,0.000018966166,0.00032671535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830526,0.00017539882,0.00026501238,0.0005448545,0.0002602327,0.0004492336],"domain_scores_gemma":[0.998639,0.000295177,0.00007765984,0.0007277308,0.000083913925,0.00017654666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037512698,0.00023574149,0.00022912832,0.000099081895,0.000465466,0.00021340993,0.0005491894,0.00012776352,0.000026234808],"category_scores_gemma":[0.0000065470845,0.00024140564,0.00007518913,0.00071529794,0.00003991565,0.00032635074,0.000008124863,0.0003756019,0.00004186707],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001850973,0.00010173283,0.0001478298,0.000016704313,0.000049527756,0.000018063307,0.00037474956,0.02570246,0.000059181726,0.0070320466,0.00013880919,0.96634036],"study_design_scores_gemma":[0.004186928,0.00033521475,0.0013145424,0.00041226845,0.00017836713,0.0003584476,0.00022868958,0.7753425,0.0011947298,0.015764292,0.19877858,0.0019053938],"about_ca_topic_score_codex":0.000018045894,"about_ca_topic_score_gemma":0.00013391631,"teacher_disagreement_score":0.975284,"about_ca_system_score_codex":0.000046472833,"about_ca_system_score_gemma":0.00007337859,"threshold_uncertainty_score":0.9844236},"labels":[],"label_agreement":null},{"id":"W2017118543","doi":"10.1109/tnet.2011.2166560","title":"Differentiated Quality-of-Recovery in Survivable Optical Mesh Networks Using $p$-Structures","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Concordia University","funders":"","keywords":"Notation; Computer science; Quality (philosophy); Order (exchange); Algorithm; Mathematics; Arithmetic; Physics","score_opus":0.06373815538564491,"score_gpt":0.27015896617277135,"score_spread":0.20642081078712643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017118543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29282975,0.0002996636,0.7039698,0.000004171461,0.0014742573,0.00019480941,0.0000049471428,0.0005870329,0.00063556514],"genre_scores_gemma":[0.9403162,0.00047658148,0.058946658,0.00001631736,0.00012270082,0.000022515467,0.000004207224,0.000083202234,0.000011635595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997818,0.00008024297,0.0007582281,0.00037126802,0.00023343708,0.00073882536],"domain_scores_gemma":[0.99865055,0.00045139543,0.000091797636,0.0006710968,0.000040533814,0.00009461126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002388576,0.00037234466,0.0005815588,0.0002951223,0.00011109919,0.000025886837,0.00045955606,0.00041215928,0.00007828858],"category_scores_gemma":[0.000024641964,0.000388018,0.00017448615,0.000890603,0.00016171506,0.00020942051,0.000014855668,0.0008749525,0.0000037419004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009893969,0.000073602896,0.0007212293,0.000038999566,0.00011001343,0.000009019294,0.000057394445,0.9612985,0.00090942957,0.00062318065,0.0000070207916,0.03605265],"study_design_scores_gemma":[0.0012807463,0.00018432067,0.0068427934,0.0005307218,0.00012994756,0.000016634227,0.00020782252,0.9557401,0.01197422,0.02175964,0.00007243105,0.0012606204],"about_ca_topic_score_codex":0.00006713934,"about_ca_topic_score_gemma":0.0001912257,"teacher_disagreement_score":0.64748645,"about_ca_system_score_codex":0.00015578806,"about_ca_system_score_gemma":0.000013702578,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W2019267322","doi":"10.1109/90.836475","title":"Secure group communications using key graphs","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":1096,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Cairo University; York University","keywords":"Rekeying; Computer science; Communication in small groups; Group key; Secure multicast; Key (lock); Key management; Multicast; Scalability; Computer network; Joins; Computer security; Distributed computing; Encryption; Source-specific multicast; Database; Reliable multicast","score_opus":0.0416883586162558,"score_gpt":0.2717763594392165,"score_spread":0.23008800082296071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019267322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02791005,0.0009958459,0.96359324,0.0010509834,0.0024153737,0.00041138873,0.0000083128925,0.00093820924,0.0026765668],"genre_scores_gemma":[0.90363467,0.0012767254,0.09377337,0.0007967375,0.00032751643,0.00003586405,0.000006641907,0.000050040257,0.000098422504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973963,0.00030322338,0.0004925892,0.00064409233,0.00044610735,0.0007177272],"domain_scores_gemma":[0.9956354,0.00048362036,0.00012551888,0.0034847797,0.000071197006,0.00019950386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003174658,0.00035323037,0.0003159103,0.0002450645,0.0012125858,0.0003316893,0.0031511025,0.000246317,0.00013193395],"category_scores_gemma":[0.000003399171,0.00039925403,0.0002603984,0.0015951602,0.00018306867,0.0005914363,0.000031269505,0.00095649494,0.00010333328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003344193,0.00047697412,0.000112282585,0.000016432836,0.00015666585,0.00003007097,0.0024281554,0.3831496,0.0002810629,0.006696667,0.0004380031,0.6061806],"study_design_scores_gemma":[0.0006262637,0.00010402255,0.00009005388,0.00028911306,0.00006866436,0.00014190123,0.000062269755,0.9440047,0.0002251501,0.010106343,0.0435353,0.0007461881],"about_ca_topic_score_codex":0.00009966441,"about_ca_topic_score_gemma":0.00026438097,"teacher_disagreement_score":0.8757246,"about_ca_system_score_codex":0.00014132414,"about_ca_system_score_gemma":0.000042032494,"threshold_uncertainty_score":0.9998459},"labels":[],"label_agreement":null},{"id":"W2035780607","doi":"10.1109/tnet.2011.2166087","title":"Insights on Media Streaming Progress Using BitTorrent-Like Protocols for On-Demand Streaming","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","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","funders":"","keywords":"BitTorrent; Computer science; Upload; Download; Bandwidth (computing); Peer-to-peer; Real Time Streaming Protocol; Computer network; Probabilistic logic; On demand; Distributed computing; The Internet; Multimedia; World Wide Web","score_opus":0.10056895592961519,"score_gpt":0.30897624665017687,"score_spread":0.2084072907205617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035780607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0408164,0.00008687455,0.94419205,0.00019064426,0.003427821,0.009449875,0.000013812615,0.0015149136,0.0003076299],"genre_scores_gemma":[0.84907895,0.0000110445,0.14373578,0.00023431933,0.0005557853,0.006250035,0.000003618868,0.00008360413,0.000046844336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963905,0.000111401096,0.0006068678,0.0012012181,0.0006661411,0.0010238681],"domain_scores_gemma":[0.99693465,0.0006244288,0.00027758695,0.0017746893,0.0001448208,0.00024384198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033221938,0.0005855371,0.0004990336,0.00073982764,0.0008308924,0.00029631075,0.0020866813,0.00031103758,0.0000068123],"category_scores_gemma":[0.00003291709,0.00055302633,0.00022180083,0.0013119655,0.00013336724,0.0004741756,0.000056934503,0.0006371591,0.00002253608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026844838,0.0007948545,0.00026992275,0.00007205718,0.00016539604,0.000061058876,0.0030938447,0.045516394,0.00045836033,0.0016495135,0.00032020302,0.94732994],"study_design_scores_gemma":[0.0076155467,0.008422899,0.0025392468,0.013341684,0.00038312303,0.00011502349,0.0009647845,0.77280074,0.11662978,0.025005538,0.04587204,0.0063096066],"about_ca_topic_score_codex":0.000021252925,"about_ca_topic_score_gemma":0.00010246014,"teacher_disagreement_score":0.9410203,"about_ca_system_score_codex":0.0002914785,"about_ca_system_score_gemma":0.000103128674,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null},{"id":"W2038021311","doi":"10.1109/tnet.2014.2312928","title":"Decomposition Approaches for Virtual Network Embedding With One-Shot Node and Link Mapping","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"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 virtualization; Embedding; Heuristic; Node (physics); Network topology; Virtualization; Distributed computing; Virtual network; Computer network; Cloud computing; Artificial intelligence","score_opus":0.07766406967826003,"score_gpt":0.269455083827348,"score_spread":0.19179101414908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038021311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00500246,0.00018094358,0.99151236,0.0009959291,0.0012698923,0.00041800502,0.0000032870425,0.00043929034,0.00017782819],"genre_scores_gemma":[0.71573,0.000051606752,0.28209266,0.00053634593,0.0013924876,0.000118212934,0.000007700089,0.0000431406,0.00002781857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778366,0.00011412024,0.00036000638,0.0007608966,0.00027353258,0.00070780807],"domain_scores_gemma":[0.99789053,0.0010144109,0.00016236084,0.0007001397,0.000059165668,0.00017341325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005931391,0.00033478966,0.0003666133,0.00015310073,0.0009665475,0.0003725405,0.00054537924,0.00017799753,0.000003243697],"category_scores_gemma":[0.000007891499,0.00032434473,0.00011849376,0.0006090717,0.00007180146,0.0004045137,0.000020181424,0.00038908116,0.0000029766531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068681875,0.00005109221,0.00017724035,0.000023343677,0.00007690814,0.0000014949234,0.00026564475,0.6327827,0.00003248361,0.002235766,0.000087850225,0.36419678],"study_design_scores_gemma":[0.0010201389,0.000451526,0.00041083503,0.00045318247,0.00006364636,0.00003750708,0.000033572433,0.9872979,0.00017319541,0.0038192903,0.0057047126,0.0005344977],"about_ca_topic_score_codex":0.000007931834,"about_ca_topic_score_gemma":0.00003143778,"teacher_disagreement_score":0.7107276,"about_ca_system_score_codex":0.00006149917,"about_ca_system_score_gemma":0.00003119396,"threshold_uncertainty_score":0.99992085},"labels":[],"label_agreement":null},{"id":"W2039309022","doi":"10.1109/tnet.2014.2362356","title":"A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","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":"Polytechnique Montréal","funders":"","keywords":"Iterated local search; Computer science; Mathematical optimization; Integer programming; Heuristic; Algorithm; Local search (optimization); Hybrid algorithm (constraint satisfaction); Wireless network; Iterated function; Wireless; Mathematics; Local consistency; Constraint satisfaction","score_opus":0.022120663308773648,"score_gpt":0.2632879101337656,"score_spread":0.24116724682499197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039309022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000734677,0.00037332045,0.995395,0.00021227235,0.0018474915,0.0009104616,0.000013366487,0.00027364283,0.00023978733],"genre_scores_gemma":[0.92966795,0.00006853222,0.06876923,0.00022960537,0.0008892303,0.0002419345,0.00000952627,0.00004639399,0.00007758751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674827,0.00032574075,0.00062928343,0.0007500111,0.0005351417,0.0010115528],"domain_scores_gemma":[0.99646527,0.0016390438,0.0002118575,0.0012619189,0.00024247204,0.00017942632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014249432,0.000375055,0.00046478462,0.000090194524,0.0007627706,0.000293831,0.0018910853,0.00017413429,0.000008163787],"category_scores_gemma":[0.000004089428,0.00031693265,0.0002481481,0.0010745807,0.00017877953,0.00032079755,0.00004616719,0.0006266606,0.0000049506316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023973358,0.000050812363,0.000055193126,0.000011918112,0.000063449166,0.0000030006042,0.000058913767,0.53528076,0.000003658074,0.0004385862,0.00012807976,0.46388164],"study_design_scores_gemma":[0.0007384668,0.0002586291,0.000059627415,0.00028434882,0.000039087892,0.000039623686,0.00002617052,0.99249715,0.00034081368,0.0012585385,0.0041361093,0.00032145248],"about_ca_topic_score_codex":0.000121431716,"about_ca_topic_score_gemma":0.000048979968,"teacher_disagreement_score":0.92893326,"about_ca_system_score_codex":0.00017220216,"about_ca_system_score_gemma":0.00010514927,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W2042858188","doi":"10.1109/tnet.2011.2176140","title":"Optimal Control of Wireless Networks With Finite Buffers","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"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; Queue; Bounded function; Scheduling (production processes); Flow network; Notation; Algorithm; Theoretical computer science; Discrete mathematics; Computer network; Mathematics; Mathematical optimization; Arithmetic","score_opus":0.014251260490836366,"score_gpt":0.19166796158321012,"score_spread":0.17741670109237376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042858188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013113167,0.0002624626,0.9838193,0.000007788772,0.0011119426,0.0003432802,0.000010554014,0.0005081034,0.00082340447],"genre_scores_gemma":[0.9708313,0.00050397334,0.028101807,0.000043431875,0.00026593835,0.00007945193,0.0000075880935,0.00013561684,0.00003090719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841803,0.000051778366,0.00043803084,0.00031341944,0.00022913433,0.0005496099],"domain_scores_gemma":[0.9988415,0.00026550196,0.00012129208,0.0005601624,0.00008257623,0.0001289406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001226306,0.0003587567,0.00041499184,0.00016995273,0.00015442762,0.000019891188,0.00031070257,0.00019380006,0.00007180629],"category_scores_gemma":[0.0000021366427,0.00035879813,0.00011727802,0.0006342501,0.00011457633,0.00022863518,0.0000026153941,0.0004889956,0.000006367924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024337579,0.00005744205,0.00020589601,0.000024076102,0.00017789919,0.000010306132,0.00024487113,0.96418756,0.000064570646,0.000022120072,0.000021584145,0.034740303],"study_design_scores_gemma":[0.0011022614,0.0001891529,0.00011367882,0.00025270108,0.00011443411,0.000010091054,0.000055133856,0.9959681,0.0015812812,0.000028473361,0.0001878794,0.00039679726],"about_ca_topic_score_codex":0.000011358774,"about_ca_topic_score_gemma":0.000034316854,"teacher_disagreement_score":0.95771813,"about_ca_system_score_codex":0.00008220575,"about_ca_system_score_gemma":0.000018154135,"threshold_uncertainty_score":0.9998864},"labels":[],"label_agreement":null},{"id":"W2046925041","doi":"10.1109/tnet.2011.2158237","title":"Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","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 Calgary","funders":"","keywords":"Bottleneck; Computer science; Wireless ad hoc network; Computer network; Node (physics); Gaussian; Algorithm; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Physics; Embedded system","score_opus":0.0222817164076196,"score_gpt":0.21827676254539705,"score_spread":0.19599504613777743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046925041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008019692,0.0013907873,0.9864516,0.00012867103,0.0020092092,0.00022626485,7.8012056e-7,0.00029033393,0.0014826548],"genre_scores_gemma":[0.9844094,0.0017884764,0.012783558,0.00034249507,0.00030018974,0.00014773318,0.0000014940193,0.000055932596,0.00017070146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706346,0.00017330574,0.00045550163,0.0009934361,0.00035269122,0.0009616287],"domain_scores_gemma":[0.99815005,0.00021716463,0.0001646033,0.0011884251,0.000048987822,0.0002307942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034544253,0.00043682347,0.00042166025,0.0002533996,0.00038372917,0.00018090972,0.0011229337,0.00024188554,0.000020081901],"category_scores_gemma":[0.0000014997523,0.00039772686,0.00008886946,0.0014824307,0.00016876266,0.00054096215,0.000035235204,0.00062669447,0.000005349943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202614,0.00033211973,0.0002800684,0.00001421598,0.000060025675,0.00016013146,0.0019608233,0.22921786,0.000015962016,0.0030658178,0.000049320708,0.76472163],"study_design_scores_gemma":[0.0013893946,0.00077902485,0.0007318092,0.0006089603,0.000039190272,0.0001573668,0.0000921675,0.99041396,0.00044678594,0.001433517,0.002951848,0.00095599424],"about_ca_topic_score_codex":0.000090751055,"about_ca_topic_score_gemma":0.0008723263,"teacher_disagreement_score":0.9763897,"about_ca_system_score_codex":0.00009874131,"about_ca_system_score_gemma":0.000063919004,"threshold_uncertainty_score":0.9998475},"labels":[],"label_agreement":null},{"id":"W2047066606","doi":"10.1109/tnet.2014.2358497","title":"An Ultra-Low-Latency Guaranteed-Rate Internet for Cloud Services","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"McMaster University","funders":"Cisco Systems","keywords":"Computer science; Computer network; Jitter; Quality of service; Router; Network packet; Internet traffic; Queueing theory; The Internet; Telecommunications; Operating system","score_opus":0.011400196745121379,"score_gpt":0.23351655892299253,"score_spread":0.22211636217787115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047066606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06952072,0.00017132192,0.9231805,0.00006838966,0.0033922,0.00037793018,0.000015706342,0.0025293285,0.0007438768],"genre_scores_gemma":[0.9749672,0.00020212725,0.023448363,0.00020827867,0.00084343035,0.0001430909,0.000012242445,0.00012264361,0.000052668503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998271,0.000044037715,0.0004118904,0.00043982337,0.00014358804,0.0006896744],"domain_scores_gemma":[0.9985836,0.00042344848,0.000057622794,0.0007749232,0.000047662237,0.000112742586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025255105,0.0003727813,0.00034388297,0.00014615171,0.00019116096,0.000090376285,0.0006940415,0.00028690277,0.000023796045],"category_scores_gemma":[0.000008593227,0.00037996116,0.00014773746,0.00037038393,0.00008530209,0.00026340527,0.0000027043952,0.0005167043,0.000041341787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005702107,0.000054468004,0.000042929245,0.00011723224,0.000064045154,0.000002077882,0.00015826814,0.8667372,0.0033549601,0.00043793774,0.00008689056,0.12888695],"study_design_scores_gemma":[0.00073804107,0.00035703607,0.00004703768,0.0004932877,0.00007978732,0.000010703568,0.00013575965,0.9573589,0.015465574,0.011492784,0.013099317,0.0007217947],"about_ca_topic_score_codex":0.0000074409586,"about_ca_topic_score_gemma":0.00008991364,"teacher_disagreement_score":0.9054464,"about_ca_system_score_codex":0.00007633378,"about_ca_system_score_gemma":0.000004977375,"threshold_uncertainty_score":0.99986523},"labels":[],"label_agreement":null},{"id":"W2049401533","doi":"10.1109/tnet.2013.2283924","title":"Joint Dimensioning of Server and Network Infrastructure for Resilient Optical Grids/Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"FP7 Information and Communication Technologies; Natural Sciences and Engineering Research Council of Canada; Universiteit Gent; Concordia University; European Commission","keywords":"Computer science; Cloud computing; Backup; Distributed computing; Computer network; Network topology; Overlay network; Dimensioning; Virtual machine; Virtual network; Grid; Server; Server farm; Node (physics); The Internet; Operating system; Client–server model","score_opus":0.011913497437404117,"score_gpt":0.2158486462719548,"score_spread":0.2039351488345507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049401533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24580726,0.0008367778,0.749873,0.00019604425,0.0016523142,0.0007135028,0.0000055715154,0.0006867166,0.00022884528],"genre_scores_gemma":[0.83737564,0.0003191619,0.16171537,0.000053526124,0.0003202572,0.00012059959,0.0000028329002,0.00006364219,0.000028962262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984117,0.000018257102,0.00046059763,0.00032520707,0.00018107895,0.0006031541],"domain_scores_gemma":[0.99884343,0.00040847014,0.000060148803,0.00049972156,0.00007128541,0.00011691289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013110955,0.00029326283,0.0004029746,0.00008980286,0.00019711636,0.00004186248,0.0002024505,0.00026847396,0.00003061482],"category_scores_gemma":[0.000023034114,0.0002781719,0.00011624905,0.0003632652,0.0001523687,0.00016291345,0.00001589225,0.0005209255,0.0000065075033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020567746,0.000013925845,0.000095459814,0.00005858085,0.00006550147,0.0000012226585,0.00003804096,0.91119325,0.001102484,0.00045579261,0.0009282874,0.08602686],"study_design_scores_gemma":[0.00124867,0.00043375147,0.003280684,0.0008682274,0.00016001938,0.000033462937,0.00016447465,0.9359065,0.008359503,0.042724658,0.005858412,0.0009616325],"about_ca_topic_score_codex":0.0000033965673,"about_ca_topic_score_gemma":0.000010358411,"teacher_disagreement_score":0.59156835,"about_ca_system_score_codex":0.000077882425,"about_ca_system_score_gemma":0.000009560583,"threshold_uncertainty_score":0.99996704},"labels":[],"label_agreement":null},{"id":"W2055223676","doi":"10.1109/tnet.2007.896535","title":"Assessing Network Service Profitability: Modeling From Market Science Perspective","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","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 Waterloo","funders":"","keywords":"Profitability index; Upgrade; Service provider; Network planning and design; Computer science; Service (business); Population; Marketing; Business; Telecommunications; Finance","score_opus":0.06183688442079645,"score_gpt":0.30920911489198805,"score_spread":0.2473722304711916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055223676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43129426,0.00023258173,0.5327499,0.002146113,0.0052573667,0.0005935501,0.000004338845,0.00067509024,0.027046843],"genre_scores_gemma":[0.9857508,0.000009826145,0.0037242405,0.0048930934,0.0054844976,0.000021738813,0.0000070995,0.00006105309,0.00004767996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996491,0.00004358989,0.0006010428,0.00096441805,0.0007986808,0.0011012806],"domain_scores_gemma":[0.99774283,0.00038515707,0.00024691186,0.0008992026,0.00065581093,0.00007008439],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034478332,0.00038576216,0.00036407818,0.0004053008,0.0019618238,0.0012350057,0.00088810385,0.00017141031,0.00035550463],"category_scores_gemma":[0.000044376255,0.000409037,0.00015837951,0.0036337005,0.00014426376,0.0031941673,0.000047250604,0.00073132257,0.00012120306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007549462,0.00069532386,0.006797574,0.0002960994,0.000244502,0.00004748453,0.0021493277,0.842656,0.0007914145,0.0027419105,0.00040592876,0.14241946],"study_design_scores_gemma":[0.00085631723,0.0000166337,0.006049117,0.000626346,0.00026995435,0.0000045237216,0.009915432,0.951082,0.000117087446,0.024395688,0.005633139,0.0010337756],"about_ca_topic_score_codex":0.005905229,"about_ca_topic_score_gemma":0.005328247,"teacher_disagreement_score":0.55445653,"about_ca_system_score_codex":0.00038340624,"about_ca_system_score_gemma":0.000120100995,"threshold_uncertainty_score":0.99983615},"labels":[],"label_agreement":null},{"id":"W2081092554","doi":"10.1109/tnet.2007.896499","title":"A Framework for Evaluating the Performance of Cluster Algorithms for Hierarchical Networks","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"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; Cluster analysis; Hierarchical network model; Hierarchical clustering; Scalability; Algorithm; Routing table; Hierarchical routing; Canopy clustering algorithm; Routing (electronic design automation); Hierarchy; Correlation clustering; Routing protocol; Static routing; Machine learning; Computer network","score_opus":0.0744156281436579,"score_gpt":0.33880117369311996,"score_spread":0.26438554554946203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081092554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028556032,0.00018556358,0.96678615,0.00063552154,0.0030179673,0.0006835296,0.0000038662056,0.00010379212,0.00002757265],"genre_scores_gemma":[0.8247533,0.000036856465,0.17357768,0.000628543,0.00078219787,0.000121061494,0.0000016006248,0.000021333979,0.000077432545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982313,0.0000744596,0.00044541748,0.00038905538,0.00031044192,0.0005493098],"domain_scores_gemma":[0.99521226,0.0036884283,0.00016231186,0.0007248839,0.00013694771,0.00007515367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021382456,0.0001863165,0.00022383955,0.00010488352,0.00071261806,0.0000959895,0.00090903474,0.00014981507,0.0000018831036],"category_scores_gemma":[0.00003866002,0.00014747007,0.00028302666,0.00040995047,0.000068758105,0.00016443127,0.000014923073,0.0005024973,0.0000011325278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025808942,0.00005971229,0.000040629056,0.0000225325,0.000055734745,4.0826788e-7,0.0003323475,0.35128406,0.00009227249,0.0010401412,0.00005513283,0.6467589],"study_design_scores_gemma":[0.00054033933,0.0006384561,0.000078135265,0.00022228909,0.00004365869,0.000010090447,0.000028891749,0.99455434,0.00034327823,0.0027637854,0.0005986184,0.00017810769],"about_ca_topic_score_codex":0.000008757073,"about_ca_topic_score_gemma":0.0000121319135,"teacher_disagreement_score":0.79619724,"about_ca_system_score_codex":0.00005338209,"about_ca_system_score_gemma":0.000045417753,"threshold_uncertainty_score":0.60136545},"labels":[],"label_agreement":null},{"id":"W2089579029","doi":"10.1109/tnet.2014.2332423","title":"Does Network Coding Combined With Interference Cancellation Bring Any Gain to a Wireless Network?","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","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; Scheduling (production processes); Single antenna interference cancellation; Wireless network; Computer network; Linear network coding; Wireless; Network performance; Signal-to-interference-plus-noise ratio; Distributed computing; Telecommunications; Mathematical optimization; Channel (broadcasting)","score_opus":0.02806034948562919,"score_gpt":0.2545347139560839,"score_spread":0.22647436447045471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089579029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053792647,0.00008799425,0.9879572,0.0017776906,0.002540227,0.00050755136,0.0000010640699,0.0004917144,0.0012572878],"genre_scores_gemma":[0.96713275,0.00032394065,0.029585129,0.0014245409,0.0010222987,0.00009335534,0.0000036623671,0.000047982176,0.00036633897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996906,0.00047211206,0.0005316267,0.0008026989,0.00037447351,0.00091310125],"domain_scores_gemma":[0.9969193,0.00077583716,0.00021887012,0.0016096691,0.00019376764,0.00028255465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009587126,0.00041861736,0.0004513197,0.00016524324,0.0011724734,0.00048940384,0.0016400829,0.00011578816,0.000028601313],"category_scores_gemma":[0.000014133992,0.00032593793,0.00010760318,0.001754427,0.0000715976,0.00042001944,0.00008393115,0.0006336049,0.00003407075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011308957,0.000046105226,0.00050657947,0.0000123486125,0.000052507054,0.0000030538122,0.0006368543,0.7422884,0.0001901344,0.0032069997,0.0005023192,0.2524416],"study_design_scores_gemma":[0.0008276577,0.0005055592,0.0006132364,0.0014803144,0.000032940603,0.000010313376,0.000033684264,0.9810725,0.00079535047,0.0011355128,0.012733313,0.00075962354],"about_ca_topic_score_codex":0.000027029351,"about_ca_topic_score_gemma":0.0016274919,"teacher_disagreement_score":0.9617535,"about_ca_system_score_codex":0.00020883007,"about_ca_system_score_gemma":0.00007436501,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W2091941493","doi":"10.1109/tnet.2006.890084","title":"A Cross-Layer Architecture of Wireless Sensor Networks for Target Tracking","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"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; Protocol stack; Wireless sensor network; Computer network; OSI model; Quality of service; Key distribution in wireless sensor networks; Energy consumption; Wireless network; Interconnection; Wireless; Protocol (science); Network architecture; Distributed computing; Application layer; Layer (electronics); Telecommunications; Engineering","score_opus":0.025838681738351247,"score_gpt":0.28161268053965033,"score_spread":0.2557739988012991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091941493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03405119,0.00034580653,0.95983076,0.00015587715,0.004318056,0.00054074876,0.000009517405,0.00044152894,0.00030649494],"genre_scores_gemma":[0.8452377,0.000058435824,0.15303026,0.0002796916,0.0010538519,0.0000384392,0.0000064886694,0.000083764215,0.00021137828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960669,0.00012099627,0.00093773764,0.0009659222,0.00058352144,0.001324867],"domain_scores_gemma":[0.9958593,0.0017664776,0.00041375612,0.0014227097,0.00028481666,0.00025288612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012091981,0.00050362723,0.000582345,0.00040982128,0.00063867396,0.0002255341,0.0015381863,0.0004210011,0.000015325835],"category_scores_gemma":[0.000019166104,0.0005123867,0.0004852147,0.001375646,0.00018386017,0.00029056214,0.000025363366,0.00083271606,0.0000036688095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013370336,0.00015042383,0.00018125637,0.00002660937,0.00007279719,0.000017022538,0.0002788536,0.7934381,0.001018469,0.00031929422,0.000031761203,0.20433176],"study_design_scores_gemma":[0.0012948646,0.00026773277,0.0003737471,0.00035118588,0.00004897038,0.000063248335,0.000035268386,0.96240884,0.028014015,0.0004874615,0.005890875,0.00076377345],"about_ca_topic_score_codex":0.000023280196,"about_ca_topic_score_gemma":0.00008746218,"teacher_disagreement_score":0.8111865,"about_ca_system_score_codex":0.00011584576,"about_ca_system_score_gemma":0.000058730144,"threshold_uncertainty_score":0.9997328},"labels":[],"label_agreement":null},{"id":"W2096299490","doi":"10.1109/tnet.2009.2030326","title":"On Burst Transmission Scheduling in Mobile TV Broadcast Networks","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Computer network; Base station; Testbed; Real-time computing; Schedule","score_opus":0.01001123022695009,"score_gpt":0.23320184627877416,"score_spread":0.22319061605182408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096299490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018934352,0.0015423048,0.9757651,0.00006661325,0.0015717311,0.00051907246,0.0000031227503,0.00081296294,0.0007847569],"genre_scores_gemma":[0.9831653,0.0029236344,0.012854553,0.00020258818,0.00057724933,0.0000878898,0.000019382764,0.000116851064,0.000052556126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997798,0.00006733454,0.00055829907,0.00050241314,0.00029450306,0.0007794402],"domain_scores_gemma":[0.9989145,0.00024968386,0.0000670636,0.0005606494,0.000032622702,0.00017549537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018798198,0.00045661026,0.00039583276,0.00035705933,0.0002691901,0.00007264409,0.00032123266,0.00032450413,0.00006967752],"category_scores_gemma":[0.0000034783375,0.00051667745,0.00015471033,0.00114648,0.00003331312,0.00028653964,0.0000018254027,0.0010545172,0.000021115788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060936865,0.000076579105,0.0000072748044,0.000008367096,0.000012408819,0.000011679618,0.00008306987,0.6290365,0.00015744608,0.000018411964,0.0000359,0.37049145],"study_design_scores_gemma":[0.0008284456,0.00020379903,0.00006473953,0.0007134034,0.000023445007,0.000009378156,0.000033100016,0.99387914,0.00074529054,0.00062835315,0.0023567493,0.0005141282],"about_ca_topic_score_codex":0.000003965633,"about_ca_topic_score_gemma":0.00001383531,"teacher_disagreement_score":0.96423095,"about_ca_system_score_codex":0.0003041213,"about_ca_system_score_gemma":0.000015833884,"threshold_uncertainty_score":0.9997285},"labels":[],"label_agreement":null},{"id":"W2099890714","doi":"10.1109/tnet.2005.861253","title":"An estimator of regulator parameters in a stochastic setting","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Burstiness; Computer science; Estimator; Queue; Queueing theory; Provisioning; Mathematical optimization; Algorithm; Computer network; Statistics; Network packet; Mathematics","score_opus":0.014701930863112578,"score_gpt":0.2514101569266887,"score_spread":0.23670822606357614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099890714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06746405,0.00011788029,0.9304783,0.0006826418,0.0007655247,0.00022835442,0.000001892616,0.00021483818,0.00004655263],"genre_scores_gemma":[0.9103473,0.0000069163643,0.08913479,0.00022144573,0.00020336275,0.00004340737,7.8835063e-7,0.000018738438,0.000023300196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982233,0.0001281278,0.0004659189,0.00046291464,0.00028416322,0.00043554805],"domain_scores_gemma":[0.9984531,0.00039693445,0.00014833447,0.0008130768,0.000047631253,0.00014092927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000406136,0.00020661257,0.00027604634,0.00023507109,0.00016396286,0.00007990675,0.00077891577,0.00010525495,0.000009387421],"category_scores_gemma":[0.000009579059,0.00021965224,0.00010587413,0.0006320121,0.00005602999,0.0004403405,0.000005813687,0.0003213756,0.000012991833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017024071,0.000078988276,0.000022163022,0.0000024757474,0.00001148255,0.0000025160145,0.00017428459,0.5716693,0.000073309464,0.0002651749,0.000015854375,0.42766747],"study_design_scores_gemma":[0.00064803194,0.00011534335,0.00016310274,0.00017014603,0.000017792247,0.000014969198,0.00002995672,0.99763095,0.00035122645,0.0004233449,0.00021100974,0.00022410047],"about_ca_topic_score_codex":0.000014237336,"about_ca_topic_score_gemma":0.00009706567,"teacher_disagreement_score":0.8428832,"about_ca_system_score_codex":0.00008663977,"about_ca_system_score_gemma":0.000077241006,"threshold_uncertainty_score":0.89571583},"labels":[],"label_agreement":null},{"id":"W2104354412","doi":"10.1109/tnet.2008.2005219","title":"Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"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; Time division multiple access; Computer network; Scheduling (production processes); Router; Transmission delay; Wireless network; Distributed computing; Wireless; Mathematical optimization; Network packet; Mathematics","score_opus":0.054886598819135046,"score_gpt":0.27810405897408164,"score_spread":0.2232174601549466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104354412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043324786,0.0006325388,0.9862902,0.00043433649,0.0063316613,0.0009761995,0.0000058474347,0.0009220662,0.00007463873],"genre_scores_gemma":[0.8081184,0.0006619347,0.18741162,0.0006410347,0.0022893783,0.00042730605,0.000010364151,0.00010885649,0.00033109367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960136,0.00016775442,0.0007802419,0.0012262927,0.00048035753,0.001331743],"domain_scores_gemma":[0.99647254,0.00083967525,0.00027850905,0.0018055753,0.00024482247,0.0003588786],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000536221,0.0005815789,0.0005788429,0.00023601364,0.0017024808,0.00023045509,0.0020062048,0.0004732539,0.000016707856],"category_scores_gemma":[0.000012318497,0.0006263771,0.00047127903,0.0012155665,0.0001430773,0.0006351276,0.000040635117,0.0010991022,0.000033693963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003837807,0.00012867054,0.00009992158,0.000015416896,0.00008436234,0.00004933589,0.0002696796,0.7576395,0.00003408938,0.00022258863,0.00021764566,0.24120037],"study_design_scores_gemma":[0.0013048121,0.00019676384,0.00008066962,0.00024303247,0.000043846223,0.00014561291,0.000019858518,0.99045575,0.0003008616,0.00018027565,0.0063476656,0.00068085955],"about_ca_topic_score_codex":0.00002639136,"about_ca_topic_score_gemma":0.000102479295,"teacher_disagreement_score":0.8037859,"about_ca_system_score_codex":0.00020837369,"about_ca_system_score_gemma":0.00015514875,"threshold_uncertainty_score":0.99961877},"labels":[],"label_agreement":null},{"id":"W2105030329","doi":"10.1109/tnet.2005.845551","title":"Optimization of optical cross-connects with wave-mixing conversion","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Optical Network Technologies","field":"Engineering","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":"Mixing (physics); Topology (electrical circuits); Four-wave mixing; Space (punctuation); Network topology; Wavelength; Constant (computer programming); Physics; Computer science; Discrete mathematics; Mathematics; Combinatorics; Optics; Computer network; Nonlinear optics; Quantum mechanics","score_opus":0.015681819922735447,"score_gpt":0.22394461970041368,"score_spread":0.20826279977767823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105030329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536112,0.00015760663,0.84076786,0.00013163825,0.0006245134,0.00021095223,0.000003736771,0.0010107212,0.0017318481],"genre_scores_gemma":[0.8642344,0.00019876113,0.13521683,0.000031471154,0.00020663608,0.000016850703,0.0000031321852,0.000057085053,0.000034857465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987046,0.000015582866,0.0003378756,0.0002656383,0.00024602073,0.0004302793],"domain_scores_gemma":[0.9990856,0.00025797644,0.000049869996,0.00045915667,0.00006623923,0.00008113465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001262971,0.00024200858,0.0002678514,0.00016526601,0.00014900834,0.000053380398,0.00022685838,0.00023237089,0.00007315483],"category_scores_gemma":[0.00001070682,0.0002323661,0.000082805906,0.00049383537,0.00016406618,0.00026533118,0.00000594997,0.0004417345,0.000016319706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049444883,0.00004258135,0.00007114502,0.000035500743,0.000056435896,0.000005610995,0.000042897125,0.9553549,0.0004217537,0.00012702683,0.000028392906,0.043764256],"study_design_scores_gemma":[0.00062304974,0.00014669425,0.00005608257,0.00022358113,0.00005268731,0.000019862862,0.000038552473,0.96270126,0.03518364,0.000061179366,0.00059541664,0.00029800803],"about_ca_topic_score_codex":0.0000020176728,"about_ca_topic_score_gemma":0.000010560571,"teacher_disagreement_score":0.7088733,"about_ca_system_score_codex":0.00013036249,"about_ca_system_score_gemma":0.000013941771,"threshold_uncertainty_score":0.94756144},"labels":[],"label_agreement":null},{"id":"W2105628131","doi":"10.1109/tnet.2006.880168","title":"Collected experience from implementing RSVP","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Unix; Variety (cybernetics); Software deployment; The Internet; Standardization; Protocol (science); Domain (mathematical analysis); Computer network; Resource Reservation Protocol; Software; Distributed computing; Software engineering; Internet Protocol; Operating system","score_opus":0.015199420446345044,"score_gpt":0.23421580667478734,"score_spread":0.2190163862284423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105628131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032845408,0.00024201526,0.96138054,0.00046317387,0.002402911,0.000232391,0.00000681868,0.0006636798,0.0017630429],"genre_scores_gemma":[0.9817577,0.00003165501,0.016069317,0.00039809113,0.0009609931,0.00010745498,0.0000064122914,0.00002309356,0.000645282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977397,0.000110592606,0.00045287333,0.00063925004,0.00037446962,0.0006831553],"domain_scores_gemma":[0.9984339,0.00041612374,0.0001428344,0.0008247239,0.00007690756,0.000105516716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017740797,0.0002582116,0.0002426897,0.00013120774,0.0008107487,0.0003198413,0.0009807224,0.00010163797,0.00011680142],"category_scores_gemma":[0.0000040329514,0.0002731013,0.00014389517,0.00094465894,0.00004831049,0.00034226672,0.000015857659,0.00030649273,0.000053681124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030907922,0.00016847077,0.00047794406,0.0000029459436,0.00006498629,0.00003491565,0.000578653,0.07847906,0.0008437577,0.0014069048,0.0021778282,0.91573364],"study_design_scores_gemma":[0.0021421434,0.0001343256,0.0020385887,0.00016887338,0.00006618277,0.00001877004,0.00013732516,0.8904501,0.0031362488,0.0053256974,0.09538594,0.0009958114],"about_ca_topic_score_codex":0.00029033344,"about_ca_topic_score_gemma":0.00056516926,"teacher_disagreement_score":0.94891226,"about_ca_system_score_codex":0.00008745587,"about_ca_system_score_gemma":0.000064762564,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W2106544745","doi":"10.1109/tnet.2009.2038998","title":"A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","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 British Columbia","funders":"","keywords":"Multicast; Computer science; Tree (set theory); Algorithm; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Computer network","score_opus":0.016209824052714223,"score_gpt":0.24367288810799226,"score_spread":0.22746306405527802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106544745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021598772,0.00046842967,0.9933939,0.0006592891,0.0017608296,0.0011587978,0.000016860584,0.00026128415,0.00012074694],"genre_scores_gemma":[0.8460347,0.0004870478,0.151798,0.00019768372,0.00044213096,0.00081539043,0.000045963327,0.000056600846,0.00012248322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974727,0.00016237136,0.00060259545,0.00074371643,0.00025749367,0.0007611213],"domain_scores_gemma":[0.996886,0.0009401953,0.00021224254,0.0016684994,0.00010012471,0.00019294625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008061921,0.00036088037,0.00039250066,0.00019222472,0.00051039323,0.00032395616,0.0014040633,0.0003478433,0.0000088260085],"category_scores_gemma":[0.000012594016,0.00038691662,0.00013902607,0.000978629,0.00013787395,0.0004882888,0.00004674761,0.0011419371,0.000003946035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001439604,0.00015065607,0.00018229478,0.000012937599,0.000031774205,0.000004167952,0.00024772974,0.11955092,0.00008253327,0.0003098326,0.0002712411,0.8791415],"study_design_scores_gemma":[0.0011001297,0.00012405959,0.00057196757,0.0001919548,0.000029941799,0.000035930487,0.00002034636,0.98151046,0.00012800025,0.0026700157,0.013204393,0.00041277797],"about_ca_topic_score_codex":0.00008023615,"about_ca_topic_score_gemma":0.0036344922,"teacher_disagreement_score":0.87872875,"about_ca_system_score_codex":0.000098593446,"about_ca_system_score_gemma":0.000055515648,"threshold_uncertainty_score":0.99985826},"labels":[],"label_agreement":null},{"id":"W2107631978","doi":"10.1109/tnet.2009.2035115","title":"A System-Theoretic Approach to Bandwidth Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Bandwidth (computing); Network packet; Nonlinear system; Testbed; Robustness (evolution); Algorithm; Computer network; Quality of service","score_opus":0.01373783591961571,"score_gpt":0.22643818604133129,"score_spread":0.21270035012171556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107631978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007990462,0.000101454534,0.9902207,0.0012003949,0.0015935017,0.00046485802,0.0000012970785,0.0008731912,0.0047455393],"genre_scores_gemma":[0.92463,0.000010165436,0.07391005,0.0008000317,0.00037645153,0.000080079626,0.000001822219,0.000015871217,0.00017553882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980305,0.00013430633,0.00035536048,0.00059360726,0.00039143043,0.0004948104],"domain_scores_gemma":[0.99851924,0.0001746984,0.00008795746,0.00092916295,0.000062965206,0.00022598801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033709,0.00025953978,0.00027359877,0.000214815,0.00042906607,0.00026716196,0.00091686886,0.00011437351,0.000005046729],"category_scores_gemma":[0.000005878441,0.00025314264,0.0001375101,0.0009270152,0.000026369427,0.00026901547,0.0000053044523,0.0002965773,0.000105337596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001691792,0.000079373385,0.0000013106958,0.000007220189,0.0000135888595,0.0000035407793,0.00023657382,0.43618682,0.000013656491,0.01693634,0.00017878486,0.54632586],"study_design_scores_gemma":[0.00046843293,0.00019153624,0.000041509516,0.0001621637,0.00003374559,0.000049268183,0.000032283144,0.9954495,0.0000811167,0.0018835631,0.0013008795,0.00030601278],"about_ca_topic_score_codex":0.000003687599,"about_ca_topic_score_gemma":0.000002529903,"teacher_disagreement_score":0.9238309,"about_ca_system_score_codex":0.00013717155,"about_ca_system_score_gemma":0.00005036959,"threshold_uncertainty_score":0.9999921},"labels":[],"label_agreement":null},{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.01933816349824027,"score_gpt":0.2448934649100482,"score_spread":0.22555530141180793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112947567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00257362,0.00021994639,0.9925183,0.003098761,0.00077851,0.0006421603,0.0000030175238,0.00010491978,0.000060751983],"genre_scores_gemma":[0.9721674,0.00009370369,0.023949977,0.0030271707,0.0003892083,0.00022712,0.0000023559426,0.000015241082,0.00012783575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998712,0.00012335305,0.00030051076,0.00039335096,0.00013364508,0.00033710984],"domain_scores_gemma":[0.9989095,0.0004741499,0.00009900801,0.00040267222,0.000054654716,0.000060025737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057833677,0.00019107443,0.00020487506,0.00010953684,0.00021228507,0.00025868346,0.0006853866,0.000097263866,0.0000063509683],"category_scores_gemma":[0.0000025573759,0.00015633066,0.00007698104,0.00029752846,0.000035949364,0.00036774194,0.000005306272,0.00024260487,0.0000069997736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039396604,0.00006867809,0.000045496778,0.000008421811,0.000024008159,0.0000016210817,0.00063810224,0.74831975,0.0000094044035,0.00020291863,0.00005917102,0.25058302],"study_design_scores_gemma":[0.0022894323,0.0000748841,0.00012519633,0.00007546343,0.000027071364,0.000008049691,0.000057061545,0.9924671,0.000036220827,0.000062159685,0.0046114014,0.00016596894],"about_ca_topic_score_codex":0.000017448427,"about_ca_topic_score_gemma":0.00038250943,"teacher_disagreement_score":0.96959376,"about_ca_system_score_codex":0.000042080774,"about_ca_system_score_gemma":0.000024087318,"threshold_uncertainty_score":0.63749796},"labels":[],"label_agreement":null},{"id":"W2115982908","doi":"10.1109/tnet.2002.801416","title":"Managing capacity for telecommunications networks under uncertainty","year":2002,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Capacity planning; Upgrade; Telecommunications; Revenue; Bandwidth (computing); Broadband; Notice; Operations research; Business; Finance","score_opus":0.09732849604555749,"score_gpt":0.2414378003609132,"score_spread":0.1441093043153557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115982908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005558656,0.0089328475,0.9761666,0.0028249102,0.001452903,0.00041176027,0.00006525094,0.0001625215,0.004424524],"genre_scores_gemma":[0.98221844,0.008416372,0.0063471,0.00078562077,0.0003850101,0.00014520645,0.000018026209,0.00004519074,0.00163903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985533,0.000025524958,0.0005300488,0.00040976523,0.000042733842,0.00043864342],"domain_scores_gemma":[0.99859565,0.00025660032,0.00021446268,0.00080200174,0.000031024432,0.000100255915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029310625,0.00020866237,0.00034591724,0.00027895006,0.0007459497,0.00012213072,0.0004155561,0.0001359311,0.00039948296],"category_scores_gemma":[0.000007082466,0.00024310757,0.00037168068,0.0005476305,0.00008287048,0.00017525327,0.0000064071883,0.0003274616,0.0001365052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010038706,0.00017796196,0.00014260203,0.000008676502,0.00024670883,4.4492188e-7,0.00021985534,0.9363725,0.0000026509279,0.043890696,0.0012964361,0.017631402],"study_design_scores_gemma":[0.00044655672,0.000050969316,0.00008688235,0.000030761952,0.00006408625,0.0000022652182,0.00006767453,0.88412756,0.0000116493475,0.07737387,0.03738826,0.0003494909],"about_ca_topic_score_codex":0.00022099269,"about_ca_topic_score_gemma":0.00039854093,"teacher_disagreement_score":0.9766598,"about_ca_system_score_codex":0.00018406034,"about_ca_system_score_gemma":0.000003519296,"threshold_uncertainty_score":0.9913639},"labels":[],"label_agreement":null},{"id":"W2117668131","doi":"10.1109/tnet.2008.2001467","title":"Survivability Approaches Using p-Cycles in WDM Mesh Networks Under Static Traffic","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Backup; Computer science; Routing and wavelength assignment; Survivability; Wavelength-division multiplexing; Integer programming; Routing (electronic design automation); Metric (unit); Computer network; Distributed computing; Path protection; Network topology; Traffic grooming; Mathematical optimization; Path (computing); Algorithm; Wavelength; Mathematics; Engineering","score_opus":0.08503258910870942,"score_gpt":0.253445848948188,"score_spread":0.16841325983947858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117668131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3851105,0.0004255347,0.6121439,0.000054884407,0.0008173628,0.00029374208,0.0000033708118,0.0010256723,0.00012508142],"genre_scores_gemma":[0.96117073,0.00088148454,0.03751714,0.000037361548,0.00019985413,0.0000639845,0.000004677026,0.00011169261,0.000013049073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757636,0.000099358025,0.00060772983,0.00052684237,0.00027268843,0.00091705396],"domain_scores_gemma":[0.99836606,0.0006536397,0.000059531605,0.0007814336,0.000024085863,0.000115278526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026596006,0.0004481722,0.00051105424,0.0002591426,0.0003091136,0.00003728533,0.000431978,0.00035540928,0.000021287065],"category_scores_gemma":[0.000014254621,0.00048580946,0.0001574604,0.0011874052,0.00029731638,0.00026814122,0.000010214026,0.0011163028,0.000007664485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024941533,0.00009333133,0.00027859374,0.000027272716,0.000050603267,0.000019999146,0.00012250025,0.9445137,0.000025735248,0.000044274555,0.000018816734,0.054780282],"study_design_scores_gemma":[0.00042192696,0.00003882771,0.0008149731,0.00013455006,0.00003105444,0.00003226656,0.00023549424,0.9963392,0.00009989422,0.0012433386,0.00009926898,0.00050921174],"about_ca_topic_score_codex":0.000017305943,"about_ca_topic_score_gemma":0.00029955982,"teacher_disagreement_score":0.57606024,"about_ca_system_score_codex":0.00041612404,"about_ca_system_score_gemma":0.000027153448,"threshold_uncertainty_score":0.9997594},"labels":[],"label_agreement":null},{"id":"W2122482858","doi":"10.1109/tnet.2009.2020820","title":"Resequencing Analysis of Stop-and-Wait ARQ for Parallel Multichannel Communications","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automatic repeat request; Hybrid automatic repeat request; Selective Repeat ARQ; Real-time computing; Channel (broadcasting); Go-Back-N ARQ; Computer network; Algorithm; Telecommunications link","score_opus":0.039136945375168285,"score_gpt":0.28321959936349017,"score_spread":0.24408265398832188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122482858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005354727,0.0007478868,0.99268794,0.00016373169,0.00025280184,0.00034569492,0.000024108042,0.0002515932,0.00017151654],"genre_scores_gemma":[0.8797308,0.0016841439,0.11828216,0.000054719243,0.00008019086,0.00006693216,0.0000344794,0.0000335358,0.000033022858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887127,0.000040038714,0.00042018696,0.00022855283,0.00013340748,0.00030656633],"domain_scores_gemma":[0.9984563,0.00046687748,0.00009308217,0.0008268209,0.00008237313,0.00007457255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017618606,0.0001946176,0.0003608522,0.00039384514,0.00025971892,0.000025092348,0.00032001358,0.000118046504,0.0000058143296],"category_scores_gemma":[0.000011331089,0.00022573747,0.0001686844,0.0010979698,0.00005641376,0.00015683642,0.0000037485438,0.00024172154,8.14679e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024022942,0.000034144043,0.000024346013,0.00001152484,0.0002995789,3.2193486e-7,0.00033299852,0.9438025,0.0005372032,0.00013200917,0.000016771495,0.05478462],"study_design_scores_gemma":[0.0003677083,0.000051905605,0.00020938671,0.00008560336,0.00050609733,0.0000011259988,0.00008116843,0.9969184,0.0004259654,0.00085050595,0.0002930614,0.00020911345],"about_ca_topic_score_codex":0.000008622987,"about_ca_topic_score_gemma":0.00010718647,"teacher_disagreement_score":0.8744058,"about_ca_system_score_codex":0.0000992847,"about_ca_system_score_gemma":0.000010394432,"threshold_uncertainty_score":0.92053074},"labels":[],"label_agreement":null},{"id":"W2123682542","doi":"10.1109/tnet.2006.876199","title":"Dynamic inter-SLA resource sharing in path-oriented differentiated services networks","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Spare part; Quality of service; Bandwidth (computing); Service-level agreement; Dynamic bandwidth allocation; Differentiated services; Shared resource; Service level; Bandwidth management; Distributed computing; Overhead (engineering); Bandwidth allocation; Operating system","score_opus":0.006542617317342361,"score_gpt":0.2084842481203477,"score_spread":0.2019416308030053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123682542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04929976,0.0004771624,0.9462207,0.0003598973,0.0021297205,0.0003197679,0.0000027648082,0.0006829144,0.0005072883],"genre_scores_gemma":[0.9962947,0.00006628772,0.002375429,0.00033058372,0.0003312898,0.00007592796,0.000020871574,0.0000451817,0.00045976817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970445,0.00016647729,0.00067523145,0.0009319378,0.000338222,0.00084362115],"domain_scores_gemma":[0.99826497,0.00026012197,0.0001954083,0.0010902387,0.00006059518,0.00012869648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033909385,0.0004089105,0.0003916225,0.00033103692,0.00038887342,0.00031326286,0.0013955123,0.0002265898,0.00002456365],"category_scores_gemma":[0.0000017702813,0.0004258853,0.00018936241,0.0013449251,0.000051020597,0.00037961843,0.00004100241,0.00077861414,0.000022382204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065964894,0.00023843959,0.0013619127,0.000016205771,0.0000456361,0.00004767085,0.00018699128,0.71412367,0.000038948638,0.00039032882,0.00009331247,0.2833909],"study_design_scores_gemma":[0.0010708796,0.000065987966,0.0018536726,0.00046069024,0.000028398614,0.00001614965,0.00003927104,0.9919395,0.00001783667,0.0006573095,0.003432806,0.0004175352],"about_ca_topic_score_codex":0.00012994806,"about_ca_topic_score_gemma":0.0016866084,"teacher_disagreement_score":0.9469949,"about_ca_system_score_codex":0.000176247,"about_ca_system_score_gemma":0.000022259668,"threshold_uncertainty_score":0.9998193},"labels":[],"label_agreement":null},{"id":"W2125430046","doi":"10.1109/tnet.2014.2310735","title":"Minimum-Delay Multicast Algorithms for Mesh Overlays","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"Multicast; Computer science; Latency (audio); Network delay; Overlay network; Overlay; Computer network; Algorithm; Node (physics); Overlay multicast; Time complexity; Set (abstract data type); Distributed computing; Source-specific multicast; Pragmatic General Multicast","score_opus":0.039391372062308645,"score_gpt":0.28298174869595577,"score_spread":0.24359037663364713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125430046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017030204,0.00006147958,0.9884854,0.0026731223,0.0042560813,0.00063608214,0.0000120220775,0.0014931276,0.00067964714],"genre_scores_gemma":[0.6311736,0.000027060603,0.36665282,0.00084713014,0.0006316061,0.00025432618,0.000002578056,0.000047527057,0.00036333082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709564,0.00008486318,0.00046595788,0.0009455588,0.00044583957,0.00096212083],"domain_scores_gemma":[0.99668044,0.0010131459,0.00012857487,0.0018222263,0.00013601437,0.00021959424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006194698,0.00039459395,0.00040423332,0.00035257443,0.00056337495,0.00027401894,0.0022462676,0.00025921676,0.000008972824],"category_scores_gemma":[0.000060313152,0.0004045178,0.00024974614,0.0010389612,0.00008417367,0.0003394962,0.000047178546,0.00045058702,0.00009713756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035759014,0.00014744658,0.00001981769,0.000016001,0.00008165999,0.000008945407,0.00029526162,0.060524464,0.00050837826,0.0023532417,0.004488762,0.9315203],"study_design_scores_gemma":[0.0009430537,0.0005165883,0.000060764924,0.00014849255,0.000045965095,0.000037795253,0.000045641278,0.8695837,0.0035577205,0.0057985834,0.11855093,0.0007107164],"about_ca_topic_score_codex":0.000021451699,"about_ca_topic_score_gemma":0.00006577958,"teacher_disagreement_score":0.93080956,"about_ca_system_score_codex":0.00019231568,"about_ca_system_score_gemma":0.00004251466,"threshold_uncertainty_score":0.9998407},"labels":[],"label_agreement":null},{"id":"W2126882180","doi":"10.1109/90.986568","title":"The impact of point-to-multipoint traffic concentration on multirate networks design","year":2002,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Heuristic; Computer science; Network planning and design; Mathematical optimization; Point (geometry); Basis (linear algebra); Computer network; Mathematics; Artificial intelligence","score_opus":0.03693535878669211,"score_gpt":0.25821409428934855,"score_spread":0.22127873550265645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126882180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0611211,0.00015428361,0.9352126,0.0005274944,0.001174451,0.0008586296,0.000002898745,0.00028344992,0.00066505163],"genre_scores_gemma":[0.99749756,0.000104815656,0.0007336923,0.00041291086,0.0009917262,0.000060234663,0.000003774644,0.000059273527,0.0001360213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981164,0.00010994224,0.0005255215,0.0004083625,0.00028277904,0.0005570463],"domain_scores_gemma":[0.99796635,0.00082517264,0.00035193638,0.00067658734,0.00013980885,0.000040147163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070269447,0.0003343825,0.00031998486,0.00020313876,0.00083036395,0.00022462998,0.0004468955,0.00010645212,0.00015551866],"category_scores_gemma":[0.00006693645,0.00025401384,0.0003616931,0.0011566778,0.000093343646,0.00046615032,0.0000074027116,0.00039031278,0.00013566464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027732633,0.00012872837,0.000023771618,0.0000053658378,0.00012521174,0.000003433972,0.00007833511,0.869657,0.00019311439,0.00009378063,0.00042637583,0.1289876],"study_design_scores_gemma":[0.0005779041,0.0001035398,0.00008522843,0.00015032242,0.00011722952,0.0000015261268,0.00006539129,0.9970054,0.00021698841,0.0005402572,0.00084822933,0.000287975],"about_ca_topic_score_codex":0.000054422024,"about_ca_topic_score_gemma":0.000056141118,"teacher_disagreement_score":0.93637645,"about_ca_system_score_codex":0.00014977773,"about_ca_system_score_gemma":0.000009276204,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W2133216448","doi":"10.1109/tnet.2009.2033058","title":"Broadcasting Video Streams Encoded With Arbitrary Bit Rates in Energy-Constrained Mobile TV Networks","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Bit rate; Mobile telephony; Energy (signal processing); Energy consumption; Mobile radio; Telecommunications; Real-time computing; Electrical engineering","score_opus":0.007655420271796784,"score_gpt":0.2123924308660398,"score_spread":0.204737010594243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133216448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02538804,0.0011287994,0.970051,0.00003757683,0.0007820399,0.00039087186,0.0000064528745,0.00094298087,0.0012722409],"genre_scores_gemma":[0.9772047,0.0012230499,0.020465054,0.00016752955,0.0005855446,0.00014927857,0.00003694369,0.00012336098,0.00004458561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976313,0.000075610806,0.0006111311,0.0005457004,0.0002632929,0.000872964],"domain_scores_gemma":[0.9987834,0.00033476765,0.00011410167,0.0005481502,0.000052317453,0.0001672265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015613149,0.00053076196,0.00047190484,0.000339895,0.0002497261,0.00009976382,0.00031202953,0.00026613465,0.00004675125],"category_scores_gemma":[0.000003965076,0.0005586622,0.000112545786,0.0014903105,0.00007347982,0.00045153568,0.000003263984,0.0007676394,0.0000037779128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006956693,0.00006518174,0.0000955266,0.000009181178,0.000038269398,0.000033462595,0.0000965551,0.74623734,0.00022469452,0.000023676936,0.00003060479,0.25307596],"study_design_scores_gemma":[0.0009989537,0.00021342111,0.00007163501,0.00059331075,0.00004020326,0.000036893074,0.00008246065,0.9945333,0.0019338244,0.00040864557,0.00046634438,0.0006209801],"about_ca_topic_score_codex":0.00002502944,"about_ca_topic_score_gemma":0.00020252146,"teacher_disagreement_score":0.9518166,"about_ca_system_score_codex":0.00023897547,"about_ca_system_score_gemma":0.000041141175,"threshold_uncertainty_score":0.9996865},"labels":[],"label_agreement":null},{"id":"W2138088113","doi":"10.1109/tnet.2010.2043368","title":"Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","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":"University of Waterloo","funders":"","keywords":"Path (computing); Computer science; Heuristic; Asymptotically optimal algorithm; Redundancy (engineering); Network packet; Algorithm; Mathematical optimization; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Computer network","score_opus":0.02673900923945198,"score_gpt":0.2510959506195389,"score_spread":0.22435694138008688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138088113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23528601,0.000105680956,0.7629032,0.00034961847,0.00088286336,0.00013805357,0.00000109765,0.0001684862,0.00016496023],"genre_scores_gemma":[0.9911436,0.0019436678,0.006104209,0.00047807925,0.00018681708,0.000020027983,0.000006094464,0.000012305494,0.00010519744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850756,0.00017662148,0.00026922705,0.00048650874,0.00021424606,0.00034583927],"domain_scores_gemma":[0.9980833,0.00030951755,0.00013301021,0.0012126411,0.000115989555,0.00014553164],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00070641865,0.00022296628,0.00024770014,0.00025563402,0.0014368122,0.00024033799,0.0009449256,0.00012168387,0.000048354806],"category_scores_gemma":[0.000009516474,0.00022513844,0.00012668165,0.0017668739,0.00007777284,0.00056764437,0.00010681396,0.0006598659,0.000008627718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005096764,0.00018011498,0.024651062,0.000014590746,0.0005102871,0.0000047585067,0.0016256563,0.10524897,0.0014785446,0.0009154211,0.00017546538,0.86514413],"study_design_scores_gemma":[0.00036449748,0.00005756269,0.055413827,0.00003542678,0.00013917615,0.0000037837642,0.000012322701,0.9418456,0.00033831084,0.00013432464,0.0013425293,0.00031266818],"about_ca_topic_score_codex":0.000020453283,"about_ca_topic_score_gemma":0.00061585585,"teacher_disagreement_score":0.8648315,"about_ca_system_score_codex":0.000046423753,"about_ca_system_score_gemma":0.00002866798,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W2138720770","doi":"10.1109/tnet.2013.2259596","title":"Energy Efficiency in TDMA-Based Next-Generation Passive Optical Access Networks","year":2013,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"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; Passive optical network; Time division multiple access; Broadband; Computer network; Efficient energy use; Bandwidth (computing); Sleep mode; Transmission (telecommunications); Scheduling (production processes); Overhead (engineering); Sizing; Real-time computing; Telecommunications; Power (physics); Wavelength-division multiplexing; Power consumption; Engineering; Electrical engineering; Operating system","score_opus":0.04724419910141661,"score_gpt":0.26423696501565425,"score_spread":0.21699276591423763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138720770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016648637,0.00049349276,0.9784824,0.0001382924,0.0024418335,0.00038655475,0.0000019749205,0.00038832705,0.0010184522],"genre_scores_gemma":[0.99640024,0.00026755326,0.0020464496,0.00017661805,0.00037199174,0.00059044326,0.000016822807,0.00007267205,0.000057234487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982663,0.00010971184,0.00055003364,0.0003310014,0.00023698238,0.0005059865],"domain_scores_gemma":[0.998407,0.0003951706,0.00007413163,0.00092490466,0.00006937827,0.00012942466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013676083,0.00028384803,0.00028234956,0.00024799403,0.00020516849,0.00021522515,0.0006587565,0.00020080946,0.0001243123],"category_scores_gemma":[0.000006306768,0.0003116186,0.00010418774,0.00083337224,0.00005170671,0.00048203443,0.000008630697,0.0005223124,0.000027340611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052122878,0.000050577015,0.000026958161,0.000007650542,0.000014822823,0.0000020129046,0.000044617624,0.87706995,0.0012651247,0.000033945646,0.00013951269,0.12133962],"study_design_scores_gemma":[0.00043405814,0.000027366787,0.00009878627,0.00012601975,0.000011737054,0.0000041707867,0.000028969398,0.9918678,0.004164625,0.00008896786,0.0028327429,0.00031477213],"about_ca_topic_score_codex":0.00013191941,"about_ca_topic_score_gemma":0.00048361806,"teacher_disagreement_score":0.9797516,"about_ca_system_score_codex":0.0003127374,"about_ca_system_score_gemma":0.000035921683,"threshold_uncertainty_score":0.9999336},"labels":[],"label_agreement":null},{"id":"W2140490525","doi":"10.1109/90.842137","title":"Modeling TCP Reno performance: a simple model and its empirical validation","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; H-TCP; TCP acceleration; Flow (mathematics); Communication source; TCP global synchronization; File Transfer Protocol; Zeta-TCP; CUBIC TCP; Transfer (computing); Simple (philosophy); Computer network; Network congestion; Operating system; Mechanics; The Internet; Physics","score_opus":0.04610366903569576,"score_gpt":0.27204982972925246,"score_spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140490525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24834807,0.00018950888,0.74971277,0.0005393955,0.00032316754,0.00017062556,0.0000017859022,0.0003090939,0.0004055655],"genre_scores_gemma":[0.99265385,0.00069670397,0.0052349186,0.00056307885,0.000309274,0.000051933057,0.0000029867633,0.000022447502,0.00046479816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826276,0.000078167155,0.00034716405,0.00054558093,0.00031671015,0.00044959874],"domain_scores_gemma":[0.99911386,0.00010707763,0.000045010678,0.00050562544,0.00006632223,0.00016211029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027954296,0.00023312707,0.00021902287,0.000115447445,0.00059287355,0.00018947771,0.00047998177,0.000134861,0.000058623984],"category_scores_gemma":[0.0000026393982,0.00023697714,0.0000871055,0.00043875413,0.000022468557,0.0005863941,0.000007765963,0.0003731343,0.000049632516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020884763,0.000026823598,0.000009727057,0.0000037062111,0.000011279786,0.0000012084495,0.00013516059,0.5923687,0.000014844653,0.000045936034,0.000047898735,0.40731382],"study_design_scores_gemma":[0.00051033986,0.000074176955,0.000012891443,0.000055299854,0.000027468655,0.000019986297,0.0000066610237,0.9972359,0.00007588955,0.0007601094,0.00095961074,0.00026166378],"about_ca_topic_score_codex":0.0000041393246,"about_ca_topic_score_gemma":0.000008454645,"teacher_disagreement_score":0.74447787,"about_ca_system_score_codex":0.000053099837,"about_ca_system_score_gemma":0.000066089786,"threshold_uncertainty_score":0.96636474},"labels":[],"label_agreement":null},{"id":"W2141282318","doi":"10.1109/tnet.2012.2186979","title":"Providing Performance Guarantees in Multipass Network Processors","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Parallel computing","score_opus":0.033253282176561545,"score_gpt":0.2510242015594304,"score_spread":0.21777091938286885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141282318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10270357,0.00062794535,0.88450336,0.00021727335,0.009831315,0.0005042694,7.948661e-7,0.00039299304,0.0012184526],"genre_scores_gemma":[0.99104375,0.00013661476,0.006029501,0.00028883043,0.0019571076,0.00017288145,9.2999585e-7,0.000035708283,0.00033468168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972188,0.00018145,0.00059319957,0.000496547,0.00036342544,0.001146599],"domain_scores_gemma":[0.99859446,0.00028259977,0.00017867406,0.00072529743,0.00006788154,0.00015109585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010953476,0.00031952534,0.00034457725,0.00024318628,0.00054317544,0.0001987731,0.0009118148,0.00017978557,0.000015924154],"category_scores_gemma":[0.000008909349,0.0003049714,0.00014049084,0.001297226,0.000037334805,0.0012794113,0.000018112705,0.0006073996,0.00006124357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006668073,0.00027624425,0.013900139,0.0000868435,0.000059799877,0.000008518771,0.0035409858,0.78242433,0.0000853973,0.00064643746,0.0005721884,0.19833241],"study_design_scores_gemma":[0.0008811275,0.00018465507,0.0024255097,0.0011104838,0.000019327174,0.000101252524,0.00016437566,0.9725377,0.0011006905,0.0002628171,0.020419933,0.0007921231],"about_ca_topic_score_codex":0.00004479636,"about_ca_topic_score_gemma":0.000123632,"teacher_disagreement_score":0.8883402,"about_ca_system_score_codex":0.00018536155,"about_ca_system_score_gemma":0.00004513809,"threshold_uncertainty_score":0.9999402},"labels":[],"label_agreement":null},{"id":"W2143434759","doi":"10.1109/tnet.2014.2313627","title":"Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","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; University of Manitoba; University of Alberta","funders":"","keywords":"Wireless ad hoc network; Topology control; Topology (electrical circuits); Wireless network; Upper and lower bounds; Computer science; Approximation algorithm; Mathematics; Discrete mathematics; Combinatorics; Wireless; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.012906072893361334,"score_gpt":0.22872477816238448,"score_spread":0.21581870526902314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143434759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051541187,0.00030972905,0.94527686,0.00025325123,0.0015319183,0.00043312038,5.281996e-7,0.00022096348,0.00043245958],"genre_scores_gemma":[0.9882488,0.00043690667,0.010495314,0.0002793455,0.00026975657,0.00018402726,0.0000034952932,0.0000435034,0.000038822618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970153,0.00040991718,0.00057648774,0.00083479134,0.00032458562,0.00083890854],"domain_scores_gemma":[0.99785256,0.00078519736,0.0001767302,0.0009953303,0.00005269933,0.00013747056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091463607,0.00037937603,0.00048167238,0.00040344798,0.00026816886,0.00034291815,0.0011376693,0.00021304285,0.000010109135],"category_scores_gemma":[0.000006663889,0.0003687678,0.000099291276,0.0015700557,0.00009204517,0.0006736067,0.000024664938,0.0010054519,0.00001013305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002638007,0.00012661988,0.0010817868,0.000013102953,0.000018799108,0.000032473537,0.00045887782,0.6411704,0.00007994836,0.00047376208,0.000011312955,0.35626912],"study_design_scores_gemma":[0.0027551414,0.00027581592,0.0012209361,0.0014083417,0.000015982074,0.00004664228,0.000034075743,0.9923333,0.00022709333,0.0008126445,0.00036366947,0.00050638046],"about_ca_topic_score_codex":0.00004467955,"about_ca_topic_score_gemma":0.002327115,"teacher_disagreement_score":0.9367076,"about_ca_system_score_codex":0.0002946324,"about_ca_system_score_gemma":0.000064544445,"threshold_uncertainty_score":0.99987644},"labels":[],"label_agreement":null},{"id":"W2145873975","doi":"10.1109/tnet.2006.876191","title":"Deterministic packet marking for time-varying congestion price estimation","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Explicit Congestion Notification; Header; Network packet; Network congestion; Probabilistic logic; Path (computing); Computer network; Router; Real-time computing","score_opus":0.014281859668981167,"score_gpt":0.23712905641764304,"score_spread":0.22284719674866188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145873975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023191636,0.00014438348,0.9924755,0.00065654423,0.0022347546,0.0006245628,0.000006939964,0.00066703715,0.00087112235],"genre_scores_gemma":[0.9274666,0.000018205132,0.07058152,0.00024353748,0.00083455135,0.00022417266,0.000016430618,0.00003800575,0.0005770025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978416,0.00011743799,0.00049771776,0.00062861,0.00032419836,0.0005904515],"domain_scores_gemma":[0.9977672,0.0011143092,0.00022644395,0.00066255545,0.00012310916,0.00010639636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047729947,0.0003072355,0.00029073155,0.00020144954,0.00074153015,0.0003462101,0.0006324551,0.00016162597,0.00002066389],"category_scores_gemma":[0.000020867692,0.00033518422,0.00017918958,0.0005355419,0.00005009493,0.00045481723,0.000008805581,0.00027164488,0.000064570755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043780416,0.00006661269,0.00001168618,0.00001478993,0.000023451958,0.0000061019796,0.00003869095,0.39066917,0.00016811007,0.0007502408,0.00042351073,0.60778385],"study_design_scores_gemma":[0.0008870767,0.00012985892,0.000114748625,0.0001795478,0.00006396508,0.00003520107,0.0000032888333,0.9888073,0.00023921648,0.004419818,0.0047442247,0.00037575685],"about_ca_topic_score_codex":0.000010591619,"about_ca_topic_score_gemma":0.000014752327,"teacher_disagreement_score":0.9251474,"about_ca_system_score_codex":0.00013881162,"about_ca_system_score_gemma":0.00007944882,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W2150586899","doi":"10.1109/tnet.2005.857070","title":"Packet classification consuming small amount of memory","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Space Agency","funders":"","keywords":"Computer science; Bottleneck; Router; Network packet; The Internet; Algorithm; Speedup; Computer network; Parallel computing; Embedded system","score_opus":0.045177678743253,"score_gpt":0.25899352591856756,"score_spread":0.21381584717531454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150586899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011478236,0.0002988205,0.9845263,0.00071758445,0.0011355601,0.00015935318,0.000001802775,0.00027988167,0.0014024844],"genre_scores_gemma":[0.87762743,0.00023023496,0.121195406,0.00024116505,0.00039409462,0.000023579583,0.0000036587953,0.000021599952,0.00026280017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983973,0.00010447735,0.00044431956,0.00043630536,0.00026900528,0.00034857384],"domain_scores_gemma":[0.9985022,0.00024401824,0.00025275256,0.0007731274,0.00013411212,0.00009382322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041282922,0.0001978898,0.00022041495,0.00019904066,0.000338357,0.00012834901,0.00066986703,0.00012836693,0.000016118054],"category_scores_gemma":[0.000007891746,0.00020683518,0.00010443814,0.0007436739,0.000077995224,0.00039681923,0.000006766548,0.00028350682,0.000025211219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016090895,0.00011490763,0.000067324305,0.000020856038,0.000026676089,0.0000013184979,0.0006875741,0.3022881,0.0005179015,0.0002852183,0.00017550656,0.6957985],"study_design_scores_gemma":[0.0005965857,0.00008139162,0.00025913774,0.00030275484,0.000047009114,0.00002022971,0.00008251593,0.98150367,0.01021142,0.00078471925,0.005722235,0.00038831745],"about_ca_topic_score_codex":0.000009310926,"about_ca_topic_score_gemma":0.000059221846,"teacher_disagreement_score":0.86614925,"about_ca_system_score_codex":0.0001063711,"about_ca_system_score_gemma":0.00007592025,"threshold_uncertainty_score":0.84344935},"labels":[],"label_agreement":null},{"id":"W2153876525","doi":"10.1109/tnet.2004.833125","title":"Design and Stability Analysis of a Rate Control Algorithm Using the Routh–Hurwitz Stability Criterion","year":2004,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Routh–Hurwitz stability criterion; Stability (learning theory); Computer science; Control theory (sociology); Stability criterion; Transfer function; Flow control (data); Control system; Algorithm; Feedback control; Control (management); Mathematics; Control engineering; Artificial intelligence; Telecommunications; Engineering","score_opus":0.042524042390701296,"score_gpt":0.25735752594914296,"score_spread":0.21483348355844167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153876525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050054062,0.00029180854,0.9477659,0.0005913133,0.00060681516,0.0005381665,0.000012459537,0.00013311522,0.0000063605044],"genre_scores_gemma":[0.9480463,0.00005302435,0.05150319,0.0002441139,0.00009752463,0.000039281953,0.0000012256158,0.000013053757,0.000002286302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973555,0.000715847,0.00055613596,0.000624379,0.0003251237,0.0004230206],"domain_scores_gemma":[0.9973078,0.0010896592,0.00021896012,0.0010782718,0.00018173596,0.00012357881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017803618,0.00026539477,0.00050022145,0.00018545265,0.00053408026,0.00017764687,0.0006161439,0.00011266862,0.00002194265],"category_scores_gemma":[0.00001547044,0.00021301005,0.00024903144,0.001620564,0.0002019008,0.00030996455,0.000012429807,0.00034694446,0.0000014961894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008202267,0.00013117574,0.0001075719,0.0000067394462,0.0004630639,0.0000035617234,0.00088228885,0.7610548,0.0007619917,0.00010442328,9.643201e-7,0.2364014],"study_design_scores_gemma":[0.0010580496,0.00011863173,0.0003824443,0.0000422783,0.00068804657,0.0000057393736,0.000087044915,0.9955454,0.00091519917,0.0009121353,0.00003079046,0.00021422339],"about_ca_topic_score_codex":0.00012804935,"about_ca_topic_score_gemma":0.00010975607,"teacher_disagreement_score":0.89799225,"about_ca_system_score_codex":0.00016100562,"about_ca_system_score_gemma":0.00013584737,"threshold_uncertainty_score":0.86862975},"labels":[],"label_agreement":null},{"id":"W2156046876","doi":"10.1109/tnet.2005.860109","title":"Cooperation in wireless ad hoc networks: a market-based approach","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"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; Convergence (economics); Computer network; Mobile ad hoc network; Network packet; Wireless; Ad hoc wireless distribution service; Wireless network; Iterative method; Optimized Link State Routing Protocol; Mathematical optimization; Telecommunications; Algorithm; Economics; Mathematics","score_opus":0.01717339039060323,"score_gpt":0.23230330249416412,"score_spread":0.2151299121035609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156046876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019993607,0.00092087674,0.9922505,0.00059073605,0.0015103811,0.0006554148,0.0000015209557,0.00045785576,0.0016133591],"genre_scores_gemma":[0.9303832,0.00048752234,0.0666911,0.0009808447,0.00073769205,0.00034147283,0.0000087304925,0.00005672269,0.0003127372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670255,0.00035551545,0.0006483753,0.0009618759,0.00044353522,0.0008881482],"domain_scores_gemma":[0.99770474,0.00042628587,0.00015971255,0.0014349286,0.00008084695,0.00019348766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008199924,0.00042029886,0.00040214809,0.0003126013,0.00039732485,0.00033437044,0.0013528643,0.00029359892,0.000052273008],"category_scores_gemma":[0.000005359914,0.00045229628,0.00017467588,0.0018345483,0.00007295357,0.00067928043,0.000018479948,0.0009009881,0.00002770484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004313375,0.00020828255,0.0000366714,0.0000067902797,0.000013975526,0.000007353247,0.000088016524,0.6098406,0.000015691681,0.00014678367,0.00037495547,0.3892178],"study_design_scores_gemma":[0.0010413128,0.00009946296,0.00013104774,0.0001658588,0.00001573635,0.000015975145,0.0000113015685,0.98436725,0.00014064525,0.00005913209,0.013489531,0.00046271688],"about_ca_topic_score_codex":0.000009643252,"about_ca_topic_score_gemma":0.00040328526,"teacher_disagreement_score":0.9283838,"about_ca_system_score_codex":0.0003494702,"about_ca_system_score_gemma":0.00012740938,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","score_opus":0.021668590843779242,"score_gpt":0.2531395800328795,"score_spread":0.23147098918910025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159743267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002290294,0.00010496603,0.99164367,0.0009727375,0.003962386,0.0004507182,0.000008984761,0.00046252672,0.00010369271],"genre_scores_gemma":[0.97691065,0.000024877372,0.021458298,0.00048406897,0.00081285974,0.00010022864,0.0000155286,0.000022367267,0.00017109256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.000065017266,0.0003999658,0.0004704398,0.00020411785,0.00055797957],"domain_scores_gemma":[0.9979225,0.0010504697,0.000114911185,0.0006156269,0.00014021233,0.0001563042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974697,0.00022039193,0.00020465712,0.00014133772,0.00046131384,0.00014356588,0.0006579819,0.00012507124,0.0000095889545],"category_scores_gemma":[0.000021043703,0.0002252445,0.00014946105,0.0006808635,0.000029988527,0.00026284537,0.000005574946,0.0002525399,0.000031954565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007820316,0.00007547703,0.000009020078,0.0000067857286,0.000043556367,0.0000045981715,0.00006956494,0.2723538,0.00019237648,0.0014911238,0.00031276292,0.7253627],"study_design_scores_gemma":[0.0011004125,0.00019056458,0.00018790753,0.00007599926,0.000049342576,0.000011311382,0.000017123732,0.97025126,0.00050418277,0.0017943264,0.025489345,0.00032825145],"about_ca_topic_score_codex":0.0000051176385,"about_ca_topic_score_gemma":0.00011237021,"teacher_disagreement_score":0.9746204,"about_ca_system_score_codex":0.000102216225,"about_ca_system_score_gemma":0.00006502528,"threshold_uncertainty_score":0.9185204},"labels":[],"label_agreement":null},{"id":"W2160955579","doi":"10.1109/tnet.2011.2107563","title":"On Dynamic Server Provisioning in Multichannel P2P Live Streaming","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"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; Upload; Server; Computer network; Bandwidth (computing); Real Time Streaming Protocol; Provisioning; Live streaming; The Internet; Quality of service; Channel (broadcasting); Peer-to-peer; Operating system","score_opus":0.03435184294614749,"score_gpt":0.25355584554659694,"score_spread":0.21920400260044945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160955579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19159368,0.00008195336,0.8037815,0.00035989255,0.0020688586,0.00054266554,0.0000029894243,0.0010743606,0.0004940937],"genre_scores_gemma":[0.9284503,0.00003622145,0.070835784,0.00029912757,0.000065760156,0.00011342358,0.0000011895446,0.00004196056,0.00015622369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972743,0.00010390567,0.00044712552,0.0009081027,0.00041857857,0.0008479785],"domain_scores_gemma":[0.9978296,0.00038873425,0.00012606663,0.001452075,0.00006550214,0.00013800662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040806172,0.0003781544,0.00032435003,0.00067342375,0.00033864728,0.00013440003,0.0018516881,0.00023011526,0.000018481216],"category_scores_gemma":[0.000036939713,0.00038724756,0.00012513468,0.0014157183,0.00005590221,0.00044687706,0.000066601104,0.0008122088,0.00015219823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745802,0.00046802696,0.00039390876,0.000021593345,0.00006402269,0.00016493043,0.005616819,0.3065368,0.00025591798,0.0007432189,0.00010359221,0.6855437],"study_design_scores_gemma":[0.0013119468,0.0010362362,0.0044966196,0.0017868939,0.000035627134,0.000039651113,0.0005978979,0.9699347,0.003615233,0.015371595,0.0004216697,0.0013519294],"about_ca_topic_score_codex":0.00020684942,"about_ca_topic_score_gemma":0.0010850689,"teacher_disagreement_score":0.73685664,"about_ca_system_score_codex":0.00030394722,"about_ca_system_score_gemma":0.000050953793,"threshold_uncertainty_score":0.99985796},"labels":[],"label_agreement":null},{"id":"W2162932658","doi":"10.1109/tnet.2005.852881","title":"Load balancing for parallel forwarding","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Scheduling (production processes); Distributed computing; Computer network; The Internet; Network packet; Hash function; Packet forwarding; Workload; Internet traffic; Operating system","score_opus":0.020646405727576714,"score_gpt":0.24991975956255086,"score_spread":0.22927335383497416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162932658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005752668,0.00042567198,0.99188775,0.0028000947,0.0025458126,0.0004151366,0.0000027519009,0.00054962456,0.0007978985],"genre_scores_gemma":[0.8734871,0.00008544732,0.122619495,0.0011947716,0.0016827394,0.00018668198,0.0000012427018,0.000027857219,0.0007146511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804133,0.000054268992,0.0003705835,0.00055342074,0.00033548084,0.000644942],"domain_scores_gemma":[0.9983834,0.00052500283,0.00011038834,0.00071653334,0.00010981486,0.00015486336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047849043,0.00025217683,0.00027044734,0.00010771891,0.0006014961,0.00020848219,0.0008428274,0.00012271576,0.000017850796],"category_scores_gemma":[0.000010518162,0.00025915087,0.00025734218,0.0003845891,0.000028504594,0.0004487232,0.000008377041,0.00029472422,0.00006059827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025960699,0.000037272548,0.0000093875615,0.0000045484244,0.00003772972,0.0000016985487,0.00013138594,0.33777717,0.000030871077,0.0009908938,0.00088024,0.66007286],"study_design_scores_gemma":[0.0011485079,0.000090409565,0.000016820513,0.0000925164,0.000036536887,0.000017877705,0.000017674607,0.8733096,0.00016085361,0.001117404,0.123659566,0.00033221644],"about_ca_topic_score_codex":0.000005468301,"about_ca_topic_score_gemma":0.00007550932,"teacher_disagreement_score":0.8729119,"about_ca_system_score_codex":0.00020064351,"about_ca_system_score_gemma":0.00010754402,"threshold_uncertainty_score":0.99998605},"labels":[],"label_agreement":null},{"id":"W2163400165","doi":"10.1109/tnet.2005.858448","title":"Price-based rate control in random access networks","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Aloha; Computer science; Random access; Throughput; Markov chain; A priori and a posteriori; Network packet; Markov process; Set (abstract data type); Channel (broadcasting); Aggregate (composite); Computer network; Wireless; Telecommunications; Mathematics","score_opus":0.02611470150294075,"score_gpt":0.2805187479822777,"score_spread":0.25440404647933695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163400165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000627362,0.00023690074,0.99117815,0.0021169006,0.0014444996,0.0034181734,0.0000022456816,0.00034437538,0.0006313689],"genre_scores_gemma":[0.9858189,0.000093485025,0.0066619115,0.0035209341,0.001223792,0.002538584,0.00000202839,0.00004188982,0.000098479526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694747,0.00044685847,0.000642522,0.00072495686,0.00032471432,0.00091349107],"domain_scores_gemma":[0.99729294,0.0011199634,0.00020788795,0.0011101764,0.00006955957,0.00019950578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011281692,0.00037912442,0.00048465488,0.00029335136,0.0003873154,0.0005817314,0.0019066347,0.00023336543,0.000061883315],"category_scores_gemma":[0.000007258451,0.0003685981,0.00022642371,0.0013837862,0.000055250322,0.00083483104,0.000016364276,0.00080359733,0.000030374526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021689222,0.0001312254,0.00022195854,0.0000070810984,0.000026795527,0.000014788568,0.000042777257,0.7996037,0.000018542853,0.00009511052,0.00027767484,0.19934347],"study_design_scores_gemma":[0.005784412,0.00008698836,0.00057401136,0.00026132909,0.0000181634,0.000005237227,0.0000018897705,0.9722111,0.00022734005,0.00032942017,0.020079974,0.00042010876],"about_ca_topic_score_codex":0.000039478,"about_ca_topic_score_gemma":0.00025176728,"teacher_disagreement_score":0.9851915,"about_ca_system_score_codex":0.00019205843,"about_ca_system_score_gemma":0.00014307308,"threshold_uncertainty_score":0.9998766},"labels":[],"label_agreement":null},{"id":"W2164399652","doi":"10.1109/tnet.2010.2091652","title":"An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"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; Linear network coding; Retransmission; Multicast; Computer network; Wireless network; Spectral efficiency; Performance metric; Multiple description coding; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.05062227745882194,"score_gpt":0.2949330877752368,"score_spread":0.24431081031641486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164399652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019338593,0.00022284457,0.975256,0.00058988197,0.0029368973,0.0006682057,0.000009177789,0.00055905053,0.00041931894],"genre_scores_gemma":[0.82541454,0.00023894235,0.17271568,0.00051864714,0.0008615669,0.00011544575,0.000013612919,0.00005231089,0.00006922832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730515,0.00023545811,0.00052505,0.00083377707,0.00034998005,0.0007506057],"domain_scores_gemma":[0.9965824,0.00061598816,0.00020244102,0.0019434509,0.00032723357,0.00032851097],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006418741,0.0004124381,0.00037629364,0.00015486885,0.0015458516,0.00044863787,0.0021690885,0.00027404292,0.000041664574],"category_scores_gemma":[0.000006657726,0.00041690623,0.00020344817,0.00097139366,0.00011118246,0.00080998894,0.000033646105,0.000977089,0.000017424982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022844899,0.0004961124,0.000058457543,0.000029572378,0.00007959543,0.0000054419775,0.0014064724,0.032900024,0.0731019,0.0020872734,0.0001300609,0.88947666],"study_design_scores_gemma":[0.0009830747,0.0004299131,0.00007052135,0.00033037207,0.000031510488,0.000021612896,0.00008021538,0.972473,0.0071736993,0.0005043685,0.017324392,0.0005773113],"about_ca_topic_score_codex":0.000012632611,"about_ca_topic_score_gemma":0.00047991096,"teacher_disagreement_score":0.939573,"about_ca_system_score_codex":0.00007434643,"about_ca_system_score_gemma":0.000070990216,"threshold_uncertainty_score":0.9998283},"labels":[],"label_agreement":null},{"id":"W2170110577","doi":"10.1109/tnet.2008.926501","title":"Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hong Kong University of Science and Technology","keywords":"Speedup; Computer science; Control reconfiguration; Scheduling (production processes); Network packet; Packet switching; Algorithm; Parallel computing; Overhead (engineering); Computer network; Mathematical optimization; Embedded system; Mathematics","score_opus":0.04540626732718292,"score_gpt":0.23710428738030484,"score_spread":0.19169802005312192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170110577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09762963,0.0000629672,0.89707947,0.00023156701,0.003354372,0.00032509305,0.0000018762216,0.00023733557,0.0010776692],"genre_scores_gemma":[0.96423787,0.00006575259,0.033679407,0.00035411344,0.00094552926,0.00008328157,0.0000010802385,0.000035769266,0.0005972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979912,0.000035716235,0.00045986552,0.00056006265,0.0003582604,0.0005948959],"domain_scores_gemma":[0.99859786,0.00034966337,0.00014357654,0.00064341986,0.00013656693,0.00012892378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032635627,0.00029299472,0.00033605896,0.00019117154,0.00077141705,0.00017172891,0.00083259767,0.00012974959,0.000009028638],"category_scores_gemma":[0.0000063177617,0.00025045004,0.000193219,0.00050414447,0.00008712548,0.00041206836,0.000011137236,0.000406261,0.000021757529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012855079,0.0006752868,0.0034161538,0.00019438403,0.0006269393,0.00014350818,0.0059051486,0.61630946,0.0015327466,0.002149784,0.0028510808,0.36491],"study_design_scores_gemma":[0.0017998647,0.0011680534,0.0004009744,0.00073442445,0.000048304246,0.0015304255,0.00017924019,0.9680368,0.006875042,0.00015587495,0.018301936,0.00076907675],"about_ca_topic_score_codex":0.00002209982,"about_ca_topic_score_gemma":0.0000379425,"teacher_disagreement_score":0.86660826,"about_ca_system_score_codex":0.00010813446,"about_ca_system_score_gemma":0.00008061172,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W2170717320","doi":"10.1109/tnet.2009.2017742","title":"On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Toronto","funders":"","keywords":"Scheduling (production processes); Computer science; Ergodic theory; Mathematical optimization; Schedule; Mathematics","score_opus":0.014120889917670278,"score_gpt":0.22524018239270077,"score_spread":0.2111192924750305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170717320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15237786,0.0004696361,0.8451712,0.000036438032,0.00064590503,0.0008204522,0.0000027214705,0.00031276667,0.00016298483],"genre_scores_gemma":[0.9644693,0.0013821257,0.0335277,0.0000746897,0.0003627925,0.00008107078,0.000013452046,0.00006686446,0.000021962185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983367,0.00008591361,0.00059904566,0.00036422422,0.00017555364,0.00043856277],"domain_scores_gemma":[0.99812454,0.0011044256,0.00014739156,0.00044371656,0.00008633785,0.000093572155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004917382,0.00032468874,0.0006134233,0.00015382687,0.00031329674,0.000026266043,0.00016262881,0.00020727822,0.000008702507],"category_scores_gemma":[0.000028102531,0.00033868194,0.00017843161,0.00038292367,0.00008547086,0.00024175327,0.0000026531106,0.00042959655,0.0000014508574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047985446,0.000040387462,0.0000069753205,0.000052894302,0.000051002036,8.9787005e-7,0.000105856365,0.90378743,0.0001762356,0.0000135385935,0.000009680577,0.09095657],"study_design_scores_gemma":[0.011247149,0.00017215405,0.000007646168,0.00045217513,0.00007988335,0.000006989379,0.000008788218,0.9851827,0.002263865,0.0002587215,0.000020639178,0.00029930408],"about_ca_topic_score_codex":0.0000012396448,"about_ca_topic_score_gemma":0.0000016428792,"teacher_disagreement_score":0.81209147,"about_ca_system_score_codex":0.00010549949,"about_ca_system_score_gemma":0.00001447298,"threshold_uncertainty_score":0.99990654},"labels":[],"label_agreement":null},{"id":"W2171446212","doi":"10.1109/tnet.2015.2448597","title":"Performance Analysis of Network-Coding-Based P2P Live Streaming Systems","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","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":"Concordia University","funders":"","keywords":"Computer science; Linear network coding; Coding (social sciences); Scalability; Multiple description coding; Distributed computing; Redundancy (engineering); Computer network; Video on demand; Real-time computing; Network packet","score_opus":0.07365480834146866,"score_gpt":0.28159692257043467,"score_spread":0.20794211422896602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171446212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022705715,0.00087598525,0.973008,0.00016038671,0.0017434452,0.00023904358,0.000003723185,0.00023988682,0.0010238125],"genre_scores_gemma":[0.99079096,0.00053618156,0.008118027,0.00014739316,0.00022343197,0.000046282745,0.000008107182,0.000020002,0.00010962508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770737,0.0003235074,0.00058320817,0.0004572464,0.00046103733,0.00046765836],"domain_scores_gemma":[0.9970706,0.00052488083,0.0002989938,0.0015828033,0.00032900614,0.00019368964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317331,0.00026361243,0.00049796427,0.00048137637,0.00045076568,0.00017181515,0.0014226667,0.00010850597,0.000015889123],"category_scores_gemma":[0.000015519096,0.00026662604,0.0002331473,0.00341867,0.00007157979,0.00035407208,0.00003375861,0.00037132314,0.000016671582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019530293,0.00007298739,0.0015650061,0.000010903575,0.00029352197,0.0000019705415,0.00052312907,0.93476576,0.0000285008,0.00028501125,0.0001404571,0.06229324],"study_design_scores_gemma":[0.00037851545,0.00013977799,0.00074526214,0.00025541103,0.00023283772,0.0000023499274,0.00006739492,0.995922,0.00016460485,0.000018958226,0.0018013323,0.00027152165],"about_ca_topic_score_codex":0.00003630379,"about_ca_topic_score_gemma":0.00015154065,"teacher_disagreement_score":0.9680852,"about_ca_system_score_codex":0.0001763258,"about_ca_system_score_gemma":0.00014456658,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W2313902655","doi":"10.1109/tnet.2012.2190296","title":"Capability Reconciliation for a CSP Approach to Virtual Device Composition","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Service-Oriented Architecture and Web Services","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; Mobile ad hoc network; Distributed computing; Wireless ad hoc network; Composition (language); Service composition; Computer network; Service (business); Node (physics); Constraint (computer-aided design); Mobile device; Service discovery; Quality of service; Telecommunications; Web service; Operating system; Wireless; World Wide Web","score_opus":0.038901781928919334,"score_gpt":0.2685209132069926,"score_spread":0.2296191312780733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313902655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049695067,0.000062835185,0.9454326,0.0006675934,0.002481272,0.00067963084,0.000011295978,0.00027234608,0.0006973313],"genre_scores_gemma":[0.9003945,0.0000067575784,0.09628748,0.0022752269,0.00074870215,0.00023556645,0.000015667352,0.000019494082,0.00001660224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982045,0.00013132222,0.0003242582,0.0005011302,0.0002843557,0.00055440835],"domain_scores_gemma":[0.99839556,0.00038755682,0.00009817273,0.0007741568,0.00011708695,0.00022748506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005528983,0.00022754855,0.00021267215,0.00017094909,0.00049625256,0.00011960759,0.0007271878,0.00011659945,0.000004050163],"category_scores_gemma":[0.0000034593863,0.00022646369,0.000138769,0.0007595526,0.000016821892,0.00058097916,0.000014584415,0.00023201994,0.000030393092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031822966,0.0015554895,0.0007600698,0.00019651205,0.00019148848,6.9446867e-7,0.020587603,0.30162898,0.005124258,0.006868987,0.00029021458,0.6624775],"study_design_scores_gemma":[0.004059363,0.001712303,0.0079418225,0.0005980176,0.00037113426,0.000114342845,0.0016072231,0.8289662,0.045935385,0.0074703344,0.09812553,0.0030983237],"about_ca_topic_score_codex":0.0000698288,"about_ca_topic_score_gemma":0.00011849927,"teacher_disagreement_score":0.8506994,"about_ca_system_score_codex":0.00013594034,"about_ca_system_score_gemma":0.000035695655,"threshold_uncertainty_score":0.9234921},"labels":[],"label_agreement":null},{"id":"W2323101214","doi":"10.1109/tnet.2015.2510864","title":"Towards Promoting Backup-Sharing in Survivable Virtual Network Design","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backup; Computer science; Computer network; Provisioning; Survivability; Node (physics); Backup software; Distributed computing; Operating system; Engineering","score_opus":0.04589320865502491,"score_gpt":0.25163968362328104,"score_spread":0.20574647496825613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323101214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042186277,0.00023406389,0.99009067,0.00066396035,0.003377557,0.00040461175,0.0000019001972,0.00063520734,0.00037337726],"genre_scores_gemma":[0.9011527,0.0002668088,0.09655236,0.0003395846,0.0011402766,0.00012045549,9.903257e-7,0.000072338094,0.00035451745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962431,0.00027241014,0.0006527943,0.0010516441,0.00047978153,0.0013002349],"domain_scores_gemma":[0.99707454,0.0011425855,0.00017899177,0.001314644,0.00007331498,0.0002159017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016133222,0.00042030285,0.0004435292,0.00024403163,0.0005056365,0.0002918862,0.0017363426,0.00023215734,0.000059101752],"category_scores_gemma":[0.000038327806,0.00034714153,0.00017851444,0.0016585349,0.00006195225,0.00076850416,0.00006210837,0.0005131062,0.000085314554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048143673,0.00010575426,0.0010837534,0.000008263812,0.0000422366,0.00003998867,0.00028328653,0.37194723,0.00012512994,0.00078802265,0.0003487657,0.6251794],"study_design_scores_gemma":[0.004937532,0.001212012,0.0027561435,0.004434155,0.00007715172,0.00013334514,0.000060983435,0.9205383,0.0032075448,0.04654172,0.013246992,0.0028541393],"about_ca_topic_score_codex":0.000078954145,"about_ca_topic_score_gemma":0.00012267657,"teacher_disagreement_score":0.89693403,"about_ca_system_score_codex":0.00025087027,"about_ca_system_score_gemma":0.00012267336,"threshold_uncertainty_score":0.9998981},"labels":[],"label_agreement":null},{"id":"W2344469604","doi":"10.1109/tnet.2016.2523242","title":"On the Distance-Sensitive and Load-Balanced Information Storage and Retrieval for 3D Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"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":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hubei Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Data retrieval; Graph; Constraint (computer-aided design); Focus (optics); Wireless sensor network; Key (lock); Graph theory; Path (computing); Data mining; Distributed computing; Theoretical computer science; Computer network","score_opus":0.01837742692926666,"score_gpt":0.22367623441328024,"score_spread":0.20529880748401358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344469604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033454478,0.00007536553,0.9924516,0.0016559273,0.0014406877,0.00049116847,0.00002536392,0.00013060958,0.000383824],"genre_scores_gemma":[0.9912017,0.00036296842,0.0066953986,0.0011773126,0.00032978185,0.00002918321,0.0000027270728,0.000016042159,0.00018488865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985227,0.00009093567,0.00031554865,0.00036202176,0.00028543247,0.00042336684],"domain_scores_gemma":[0.99714774,0.0019006502,0.00016259185,0.0005317731,0.00012512424,0.0001321393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052243355,0.00023971726,0.00022894207,0.00006448016,0.00061799877,0.00022219343,0.00025790176,0.00014192458,0.0000051687152],"category_scores_gemma":[0.0000128554275,0.00015436379,0.00007030799,0.00025678656,0.00013853137,0.00047630686,0.000013333968,0.0002546088,0.0000054259126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000617994,0.000039819588,0.00002049688,0.000016070044,0.000076067896,0.000011251615,0.0006602678,0.011095897,0.000050025625,0.0036172327,0.0012525189,0.98254234],"study_design_scores_gemma":[0.0010441083,0.0002413912,0.000070889524,0.00026709956,0.00003283531,0.000029200228,0.000052293526,0.9872052,0.000083451334,0.0018943858,0.008771398,0.00030773753],"about_ca_topic_score_codex":0.000003889136,"about_ca_topic_score_gemma":0.00000959903,"teacher_disagreement_score":0.98785627,"about_ca_system_score_codex":0.000097284996,"about_ca_system_score_gemma":0.000051834915,"threshold_uncertainty_score":0.62947726},"labels":[],"label_agreement":null},{"id":"W2344562284","doi":"10.1109/tnet.2016.2521365","title":"Congestion Control for Vehicular Networks With Safety-Awareness","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Computer science; Computer network; Beacon; Quality of service; Control channel; Channel (broadcasting); Node (physics); Context (archaeology); Network congestion; Vehicular ad hoc network; Transmission (telecommunications); Power control; Wireless; Wireless ad hoc network; Power (physics); Telecommunications; Base station; Engineering","score_opus":0.011088180634576053,"score_gpt":0.2105524872374385,"score_spread":0.19946430660286243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344562284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009553632,0.000580149,0.9847461,0.0003283338,0.0026434886,0.0010049462,0.000046716483,0.0009544028,0.00014226056],"genre_scores_gemma":[0.9948282,0.0004967609,0.002388227,0.00016744263,0.0013208353,0.00043291855,0.000018859359,0.00020670952,0.0001400471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761105,0.00009369804,0.00047483566,0.00053023384,0.00030997163,0.0009802032],"domain_scores_gemma":[0.99794555,0.0008186804,0.00009070983,0.00078305317,0.00012631336,0.00023569391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004015949,0.00049801555,0.00050257373,0.00015164762,0.00041206865,0.00007937929,0.00037068233,0.0003298022,0.000047223853],"category_scores_gemma":[0.00000842671,0.0003844597,0.00022366045,0.00039519937,0.00009813492,0.00025252643,0.0000028232141,0.00039840234,0.000024540157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032605958,0.000033519693,0.00014313974,0.000027239954,0.0002833283,0.000014975326,0.000020267771,0.89104295,0.00033114795,0.000038732458,0.00028131742,0.10745732],"study_design_scores_gemma":[0.004042791,0.00024488414,0.00027871138,0.0007547771,0.0002744301,0.000056411245,0.000011456034,0.9663773,0.0006602263,0.0001681953,0.026396608,0.0007341898],"about_ca_topic_score_codex":0.000008398972,"about_ca_topic_score_gemma":0.00018509857,"teacher_disagreement_score":0.98527455,"about_ca_system_score_codex":0.00030103273,"about_ca_system_score_gemma":0.00004505846,"threshold_uncertainty_score":0.9998607},"labels":[],"label_agreement":null},{"id":"W2487311990","doi":"10.1109/tnet.2016.2590320","title":"Performance Modeling, Analysis, and Optimization of Delayed Mobile Data Offloading for Mobile Users","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Green IT and Sustainability","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"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; Processor sharing; Computer network; Key (lock); Mobile broadband; Cellular network; Distributed computing; Mobile device; Wireless; Computer security","score_opus":0.023978005978798452,"score_gpt":0.2498403927074172,"score_spread":0.22586238672861875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487311990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32246462,0.00013278147,0.6767602,0.0000047608746,0.00019747084,0.0002874377,0.000049714534,0.00008895946,0.000014054208],"genre_scores_gemma":[0.98478127,0.000706046,0.014230496,0.0000042581364,0.000070148926,0.00012564578,0.00002584092,0.000030614156,0.000025683355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998992,0.000015817062,0.00032014516,0.00029069153,0.000116599986,0.0002647151],"domain_scores_gemma":[0.99896896,0.00015316847,0.00004494187,0.00069212186,0.00007916641,0.000061615385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028140488,0.000154878,0.00024613345,0.00020038229,0.00014480333,0.000018944856,0.00025801698,0.000092129165,0.000020511665],"category_scores_gemma":[0.0000058568708,0.00013475641,0.00008354903,0.00043275376,0.00003581275,0.00029880268,0.0000069196667,0.000088655645,4.9083246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038963415,0.000019281808,0.0008097279,0.000059999158,0.00022848783,1.487714e-7,0.00011261153,0.9380154,0.00018832032,6.9457036e-7,0.000011540748,0.06051484],"study_design_scores_gemma":[0.00034812553,0.00008333475,0.000030710267,0.000049560094,0.00031794625,7.7809347e-7,0.00008083657,0.99810624,0.0005971772,0.000024428648,0.00019922938,0.00016162395],"about_ca_topic_score_codex":0.000023674129,"about_ca_topic_score_gemma":0.000074089185,"teacher_disagreement_score":0.6625297,"about_ca_system_score_codex":0.00007688427,"about_ca_system_score_gemma":0.00001736646,"threshold_uncertainty_score":0.5495207},"labels":[],"label_agreement":null},{"id":"W2513211841","doi":"10.1109/tnet.2015.2462772","title":"A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Time Synchronization Technologies","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":"Carleton University","funders":"Technische Universität Darmstadt","keywords":"Computer science; Network packet; Clock synchronization; Synchronization (alternating current); Offset (computer science); Real-time computing; Protocol (science); Transmission delay; Clock drift; Computer network; Algorithm; Channel (broadcasting)","score_opus":0.0366477630222541,"score_gpt":0.293136963532105,"score_spread":0.2564892005098509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513211841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005651025,0.0007911291,0.99318683,0.0012187794,0.0026477126,0.0009572164,0.000004649878,0.000904982,0.00023217688],"genre_scores_gemma":[0.50137323,0.00008411236,0.4972561,0.00045373713,0.0003594534,0.00031456482,0.000015430682,0.00005811323,0.00008523991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969805,0.0003069129,0.0006099224,0.0008645185,0.00043370278,0.00080447854],"domain_scores_gemma":[0.99680865,0.0011727423,0.00028243082,0.0012366938,0.00032265967,0.00017685306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011979379,0.00037624003,0.00042184116,0.0009892586,0.00029088958,0.00022359504,0.0014025184,0.0003781796,0.000006601358],"category_scores_gemma":[0.00016015206,0.00040813762,0.00016081826,0.0053721745,0.00006708752,0.0004722303,0.000025695037,0.0005349183,0.000020031313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002836775,0.000082109975,0.00007785803,0.000008523274,0.000019031808,0.0000046943896,0.00007080078,0.6143071,0.0000015996005,0.0010137901,0.00093029195,0.38345584],"study_design_scores_gemma":[0.0014936542,0.00032971354,0.000029158276,0.00015596555,0.000027420356,0.0000097861275,0.00004697234,0.98252153,0.0006631979,0.009000588,0.0052859336,0.0004360997],"about_ca_topic_score_codex":0.00003257427,"about_ca_topic_score_gemma":0.00010663353,"teacher_disagreement_score":0.5013167,"about_ca_system_score_codex":0.0007123797,"about_ca_system_score_gemma":0.0002889963,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W2523950303","doi":"10.1109/tnet.2015.2482988","title":"Explicit Path Control in Commodity Data Centers: Design and Applications","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Microsoft Research Asia","keywords":"XPath; Computer science; Testbed; Path (computing); Network topology; Routing (electronic design automation); Distributed computing; Computer network; Shortest path problem; Theoretical computer science; XML; Operating system","score_opus":0.10706035144848618,"score_gpt":0.28127386689732026,"score_spread":0.17421351544883407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523950303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030781658,0.00053024996,0.997047,0.0005674084,0.00065363786,0.0005640846,0.000021369742,0.0002396173,0.00006882251],"genre_scores_gemma":[0.9456868,0.00020543329,0.052706167,0.0008162444,0.00033901303,0.00019708366,0.000012934592,0.000022058271,0.000014248604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982081,0.0001983063,0.0003088186,0.000630601,0.00024709105,0.0004070848],"domain_scores_gemma":[0.9973186,0.0006433149,0.00008848296,0.0016975639,0.00004750535,0.00020450453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076384743,0.00020255068,0.0002455938,0.00012934578,0.00022286108,0.00019427283,0.0014129605,0.00010289106,0.0000025968463],"category_scores_gemma":[0.000009720714,0.00020515257,0.00003701747,0.00059339916,0.000043061806,0.0005134119,0.000041882708,0.00035209695,0.000014665347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001323794,0.00055351015,0.0025072892,0.00001878848,0.00008223812,0.000030432928,0.00071816373,0.3413532,0.000027714115,0.0009777118,0.0057272343,0.6478713],"study_design_scores_gemma":[0.0019793487,0.00012778735,0.0003302929,0.00011932889,0.00003025675,0.000029106657,0.000043274667,0.96706706,0.00002869808,0.00520409,0.024661755,0.0003789853],"about_ca_topic_score_codex":0.00007863316,"about_ca_topic_score_gemma":0.00008149435,"teacher_disagreement_score":0.945379,"about_ca_system_score_codex":0.00007780308,"about_ca_system_score_gemma":0.000068912064,"threshold_uncertainty_score":0.8365879},"labels":[],"label_agreement":null},{"id":"W2525766229","doi":"10.1109/tnet.2015.2480418","title":"An Asynchronous Fixed-Point Algorithm for Resource Sharing With Coupled Objectives","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Stochastic Gradient Optimization Techniques","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; University of Alberta","funders":"","keywords":"Computer science; Subgradient method; Mathematical optimization; Distributed algorithm; Asynchronous communication; Convergence (economics); Gradient descent; Resource allocation; Distributed computing; Algorithm; Mathematics","score_opus":0.030646572589519035,"score_gpt":0.26949438514312657,"score_spread":0.23884781255360754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525766229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037989847,0.00005509657,0.99673647,0.00014791547,0.00066764664,0.00069548836,0.0000052931387,0.0010503073,0.0002618814],"genre_scores_gemma":[0.30943605,0.0000058694213,0.6897684,0.00016817766,0.00024813449,0.00026841607,0.0000058095966,0.000045717512,0.000053456217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980967,0.00005483804,0.00029388352,0.00072584156,0.00035479572,0.0004739094],"domain_scores_gemma":[0.99810266,0.00023376953,0.0001422336,0.0010735118,0.00020366,0.0002441478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048262297,0.0002689134,0.00025301837,0.00025235227,0.0003954134,0.00027480125,0.0010550062,0.0001058693,0.0000043704827],"category_scores_gemma":[0.000012667414,0.0002575111,0.000081410355,0.00063179387,0.00006989832,0.0005670036,0.000014313884,0.00024347624,0.0000039757992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000779942,0.0002633525,0.00003886256,0.00001001941,0.00008117153,0.000010380755,0.0022411144,0.6782054,0.000052414467,0.0008565834,0.00013173763,0.318031],"study_design_scores_gemma":[0.0008398566,0.0010079477,0.000016855533,0.000111058514,0.000029299337,0.00004458191,0.000168822,0.9926643,0.0012322457,0.0030939702,0.00044637354,0.0003446956],"about_ca_topic_score_codex":0.000037926613,"about_ca_topic_score_gemma":0.000028191065,"teacher_disagreement_score":0.31768632,"about_ca_system_score_codex":0.00023004637,"about_ca_system_score_gemma":0.00010577267,"threshold_uncertainty_score":0.9999877},"labels":[],"label_agreement":null},{"id":"W2526269066","doi":"10.1109/tnet.2015.2478059","title":"A Methodology for the Design of Self-Optimizing, Decentralized Content-Caching Strategies","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Cache; Computer network; Distributed computing; Node (physics); Set (abstract data type); Network topology; Content delivery; Scheme (mathematics); Energy consumption","score_opus":0.31656922367101437,"score_gpt":0.3304753474713745,"score_spread":0.01390612380036016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526269066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001423145,0.0009142486,0.99368596,0.00057312334,0.0026064385,0.0004848141,0.0000026027872,0.0002564275,0.000053252814],"genre_scores_gemma":[0.7125819,0.00021093224,0.286681,0.0002495238,0.00012803938,0.00008281642,6.447018e-7,0.000018197565,0.000046949586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980425,0.0005610565,0.0003729002,0.00035377167,0.0002522825,0.0004174376],"domain_scores_gemma":[0.996016,0.0028355313,0.00018358247,0.0006974354,0.00016586747,0.00010154741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017685492,0.00020242586,0.0003125334,0.00011775796,0.00034860236,0.00017986703,0.0010456878,0.00009701134,0.0000021596911],"category_scores_gemma":[0.000047210335,0.00015502995,0.00021327018,0.00029239614,0.000057479618,0.00033125494,0.000013020793,0.00028480036,0.0000025595657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023225138,0.00010857621,0.000013618731,0.000013702686,0.00026613873,0.0000040069444,0.002205968,0.9350753,0.0016733612,0.0023333922,0.00025957506,0.057814095],"study_design_scores_gemma":[0.0023149177,0.00041905843,0.00001339645,0.00010260663,0.0001851162,0.000044204342,0.0013132688,0.9862797,0.0022200295,0.0047291936,0.002067316,0.00031117108],"about_ca_topic_score_codex":0.00016516595,"about_ca_topic_score_gemma":0.000032525677,"teacher_disagreement_score":0.71115875,"about_ca_system_score_codex":0.00007043624,"about_ca_system_score_gemma":0.00017573757,"threshold_uncertainty_score":0.63219374},"labels":[],"label_agreement":null},{"id":"W2535315879","doi":"10.1109/tnet.2016.2612695","title":"Network Latency Estimation for Personal Devices: A Matrix Completion Approach","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix completion; Completion (oil and gas wells); Estimation; Computer science; Latency (audio); Engineering; Telecommunications; Physics","score_opus":0.043574682002764056,"score_gpt":0.2692010705119042,"score_spread":0.22562638850914013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535315879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094978436,0.00032557145,0.9940879,0.0010328001,0.0022534768,0.0005689322,0.000012629311,0.0006025174,0.00016640806],"genre_scores_gemma":[0.72587043,0.00006573054,0.27205518,0.0004302386,0.0010724252,0.00023431561,0.000011523654,0.00004026004,0.0002198742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764144,0.00010578477,0.0004380045,0.0007080586,0.00037515373,0.0007315368],"domain_scores_gemma":[0.99807745,0.00088356866,0.00019481887,0.0005830718,0.00011587764,0.00014520677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053203176,0.0003161809,0.0003195706,0.00013997167,0.0007487073,0.00019977953,0.0007132943,0.0001854385,0.000021386995],"category_scores_gemma":[0.000013252773,0.00024980484,0.00023281608,0.0007146205,0.00005593834,0.00052572053,0.000014111068,0.00021447419,0.000042434327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013863985,0.000226913,0.00046263676,0.00006599293,0.0001133153,0.0000039898405,0.0005656069,0.225386,0.00007099378,0.003024024,0.0032801302,0.76666176],"study_design_scores_gemma":[0.0011355347,0.00021281156,0.0005123131,0.0003512784,0.00005772341,0.000037516784,0.000012106555,0.977233,0.000030548083,0.011692009,0.008240438,0.0004847521],"about_ca_topic_score_codex":0.000014166108,"about_ca_topic_score_gemma":0.000018120369,"teacher_disagreement_score":0.766177,"about_ca_system_score_codex":0.00014239266,"about_ca_system_score_gemma":0.00006233752,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W2546477115","doi":"10.1109/tnet.2016.2619743","title":"Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"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; Profit maximization; Cloud computing; Provisioning; Server; Common value auction; Combinatorial auction; Profit (economics); Social Welfare; Online algorithm; Maximization; Virtual machine; Competitive analysis; Mathematical optimization; Microeconomics; Computer network; Economics; Operating system; Algorithm; Mathematics","score_opus":0.016364431367474154,"score_gpt":0.22549230196001036,"score_spread":0.2091278705925362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546477115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22805163,0.00006428011,0.76294047,0.0075208736,0.00067686016,0.00028669793,0.0000029559728,0.0002636002,0.00019265313],"genre_scores_gemma":[0.989901,0.00004664511,0.00919849,0.00016804996,0.00016766615,0.000026632604,0.0000011529079,0.000019726116,0.00047062655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986432,0.000083983476,0.0002326607,0.00047862172,0.00023496136,0.00032653144],"domain_scores_gemma":[0.99911517,0.00009771892,0.00007933057,0.00058065495,0.000045841938,0.00008130594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018498735,0.00018157536,0.00015562326,0.00020638976,0.00034251402,0.00010011376,0.00039387573,0.00006893719,0.0000096856975],"category_scores_gemma":[0.0000037137686,0.00012918911,0.000041653602,0.0007014486,0.00005000575,0.00007712798,0.000023726065,0.00018636053,0.000006504523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039185354,0.00020327042,0.0025150508,0.000021729686,0.000054813685,0.000026600906,0.0003768395,0.21845816,0.00002675376,0.0009795116,0.00005504751,0.777243],"study_design_scores_gemma":[0.008286167,0.0012142755,0.072340816,0.004013477,0.00016266585,0.00029062625,0.0006367654,0.86842465,0.0006463103,0.0026251765,0.039101385,0.0022577106],"about_ca_topic_score_codex":0.00006356713,"about_ca_topic_score_gemma":0.00047714353,"teacher_disagreement_score":0.7749853,"about_ca_system_score_codex":0.00014298948,"about_ca_system_score_gemma":0.00001925322,"threshold_uncertainty_score":0.52681786},"labels":[],"label_agreement":null},{"id":"W2547763301","doi":"10.1109/tnet.2016.2615889","title":"DISCS: A Distributed Coordinate System Based on Robust Nonnegative Matrix Completion","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Convergence (economics); Usability; Distributed computing; Set (abstract data type); Scale (ratio); Matrix (chemical analysis); Matrix completion; Coordinate system; Algorithm; Computer engineering; Data mining; Artificial intelligence; Database","score_opus":0.023738617826167707,"score_gpt":0.2295285528162291,"score_spread":0.2057899349900614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547763301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008616709,0.000036968246,0.9866079,0.00021271623,0.0013108008,0.0003088504,0.00011751613,0.0020846666,0.00070383976],"genre_scores_gemma":[0.9965721,0.000027291671,0.0028878003,0.00003823046,0.00027688898,0.00006909482,0.00001677505,0.000071101465,0.00004073364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986661,0.00008954078,0.00029513822,0.00031655404,0.00023739727,0.000395249],"domain_scores_gemma":[0.99886024,0.00034361437,0.0000683871,0.0005680982,0.000066917564,0.00009275364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001240623,0.00030049362,0.00029333754,0.00017902574,0.00025867284,0.000060226088,0.00023589788,0.0001343585,0.000026365218],"category_scores_gemma":[0.0000053643653,0.00024026989,0.00014666482,0.00034846106,0.000053366115,0.00010378475,0.0000031362013,0.0002546647,0.00004939303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092830356,0.00005611356,0.00003509047,0.00003263703,0.00007524767,0.000024358145,0.000033045417,0.97053975,0.0034811816,0.000086829146,0.0011023912,0.02444052],"study_design_scores_gemma":[0.0010403509,0.00018775507,0.00026624577,0.0029912433,0.00009347349,0.000017413378,0.000063007865,0.9604052,0.03047441,0.00020983076,0.0036524464,0.0005986801],"about_ca_topic_score_codex":0.000020543057,"about_ca_topic_score_gemma":0.000021817383,"teacher_disagreement_score":0.9879554,"about_ca_system_score_codex":0.0003613426,"about_ca_system_score_gemma":0.00001221984,"threshold_uncertainty_score":0.9797922},"labels":[],"label_agreement":null},{"id":"W2551266388","doi":"10.1109/tnet.2016.2621067","title":"Flexible Caching Algorithms for Video Content Distribution Networks","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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":"Computer science; Cache; Server; The Internet; Computer network; Online algorithm; Algorithm; Enhanced Data Rates for GSM Evolution; Greedy algorithm; Cache algorithms; Content delivery; Distributed computing; CPU cache; Operating system","score_opus":0.07465156012194464,"score_gpt":0.2679168982591032,"score_spread":0.19326533813715857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551266388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032839305,0.0001842882,0.9900378,0.00088545366,0.0045833336,0.00034982077,0.000034733734,0.0006029192,0.000037709848],"genre_scores_gemma":[0.9923529,0.00008854559,0.005560022,0.00052797666,0.0008733206,0.00014078511,0.000012707099,0.000030161174,0.0004135887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997948,0.00011877973,0.0003741659,0.0006591461,0.00027405212,0.00062587863],"domain_scores_gemma":[0.9980652,0.00055872404,0.00013099941,0.00092817994,0.00012734959,0.00018959926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056659314,0.00026220796,0.00025047152,0.00009731953,0.00073653244,0.00024116148,0.00086491316,0.00011738948,0.000006170953],"category_scores_gemma":[0.000017185977,0.00020693033,0.00025364046,0.00029787727,0.00004499068,0.00076251844,0.0000140341035,0.00025454993,0.000013920318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569516,0.00013858912,0.000057293844,0.000006307389,0.00006913842,0.0000071824697,0.0000653126,0.09549526,0.0013641163,0.001203862,0.00042685526,0.90108037],"study_design_scores_gemma":[0.0019047385,0.00050874386,0.00016461503,0.0004291594,0.00006826128,0.00005090783,0.00003617185,0.9761207,0.002710634,0.0021310083,0.015183289,0.0006917373],"about_ca_topic_score_codex":0.00009957488,"about_ca_topic_score_gemma":0.00004980908,"teacher_disagreement_score":0.989069,"about_ca_system_score_codex":0.00021263245,"about_ca_system_score_gemma":0.000045761597,"threshold_uncertainty_score":0.84383744},"labels":[],"label_agreement":null},{"id":"W2587594232","doi":"10.1109/tnet.2017.2650964","title":"Software Defined Cooperative Offloading for Mobile Cloudlets","year":2017,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Tsinghua National Laboratory for Information Science and Technology; National Natural Science Foundation of China","keywords":"Computer science; Energy consumption; Distributed computing; Knapsack problem; Scheduling (production processes); Mobile device; Software; Embedded system; Operating system; Mathematical optimization; Algorithm","score_opus":0.045432928711410275,"score_gpt":0.29437383318469607,"score_spread":0.2489409044732858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587594232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009081806,0.0001123365,0.96381104,0.00030111548,0.025437247,0.00047646055,0.000001874645,0.00036789477,0.00041025516],"genre_scores_gemma":[0.8827676,0.000032661625,0.11206514,0.00032803163,0.0040817764,0.00018809014,0.0000030719739,0.00004495905,0.00048864924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822336,0.000051552513,0.00030571,0.0005917846,0.00021210397,0.0006155082],"domain_scores_gemma":[0.9976587,0.0005405721,0.00019466094,0.0013393977,0.00014140495,0.00012524023],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003756824,0.0002637731,0.00028419498,0.00011373991,0.003173089,0.0007505687,0.001634561,0.00012664811,0.000004154807],"category_scores_gemma":[0.000047490765,0.00026770457,0.00019792609,0.00018478974,0.00006953556,0.0005280057,0.000036685567,0.00031850341,0.000039422284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050406015,0.00013083544,0.00017484935,0.000036443063,0.00011041384,0.000023132545,0.0013869724,0.046261784,0.00041917394,0.00024166086,0.0036776068,0.9474867],"study_design_scores_gemma":[0.003501336,0.0010557291,0.0005547235,0.0010202845,0.00013196579,0.000105328974,0.000072426075,0.78223395,0.017103624,0.0075414865,0.18465945,0.002019722],"about_ca_topic_score_codex":0.000023758415,"about_ca_topic_score_gemma":0.000015256625,"teacher_disagreement_score":0.945467,"about_ca_system_score_codex":0.00009634794,"about_ca_system_score_gemma":0.00008313342,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W2594773304","doi":"10.1109/tnet.2016.2628838","title":"Efficient Spectrum Utilization in Large Scale RWA Problems","year":2017,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":23,"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","keywords":"Heuristics; Routing and wavelength assignment; Exploit; Computer science; Novelty; Mathematical optimization; Algorithm; Wavelength; Routing (electronic design automation); Mathematics; Wavelength-division multiplexing; Computer network","score_opus":0.02772091954352915,"score_gpt":0.257714003899398,"score_spread":0.22999308435586888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594773304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07695978,0.00040886374,0.9166126,0.0002377911,0.0019882564,0.0003937633,0.000007879343,0.0011298228,0.0022612023],"genre_scores_gemma":[0.9908136,0.00040475596,0.008396624,0.000019179248,0.00017844269,0.00006937782,0.0000024494261,0.00006124866,0.000054296415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855196,0.000016542152,0.00029905213,0.00031816977,0.00018272543,0.00063156895],"domain_scores_gemma":[0.99883217,0.00007783161,0.00005861781,0.0009525117,0.000015698388,0.00006317015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001704711,0.0002340892,0.00023310538,0.00016998427,0.00045533758,0.00010037932,0.0005115389,0.00019588947,0.000028968705],"category_scores_gemma":[0.000013645393,0.00025152476,0.00007609198,0.00029420844,0.000088493405,0.000117195195,0.000012081261,0.0005586344,0.000040375726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081747885,0.000065110595,0.00035550288,0.000019706544,0.00001396274,0.0000062230447,0.00007037508,0.9462224,0.00012684174,0.00008582207,0.000019350684,0.053006507],"study_design_scores_gemma":[0.00055554707,0.000042093547,0.0018836977,0.0002869895,0.00001886822,0.000004769153,0.000057012956,0.9902734,0.0012968216,0.0024869011,0.0027573942,0.00033650882],"about_ca_topic_score_codex":0.000005889696,"about_ca_topic_score_gemma":0.00052348606,"teacher_disagreement_score":0.9138538,"about_ca_system_score_codex":0.00015408442,"about_ca_system_score_gemma":0.000007845204,"threshold_uncertainty_score":0.9999937},"labels":[],"label_agreement":null},{"id":"W2767812464","doi":"10.1109/tnet.2019.2940888","title":"Curing Epidemics on Networks Using a Polya Contagion Model","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Curing (chemistry); Computer science; Mathematical optimization; Gradient descent; Network structure; Operations research; Mathematics; Artificial intelligence; Distributed computing; Artificial neural network; Materials science","score_opus":0.06640543453596294,"score_gpt":0.31935022585741313,"score_spread":0.2529447913214502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767812464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021657689,0.00027753477,0.9717358,0.00011046151,0.0027323917,0.0009716294,0.000061736246,0.000458136,0.001994653],"genre_scores_gemma":[0.98255,0.00018267265,0.012731676,0.00028759032,0.0034578345,0.0001500367,0.000110564884,0.00023267683,0.00029692854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559766,0.00026372852,0.0011062388,0.0014283984,0.0005210081,0.0010829495],"domain_scores_gemma":[0.9959966,0.00050520914,0.00079379574,0.0023469233,0.00013549237,0.00022200763],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005935014,0.0010281401,0.0012815322,0.0005037496,0.00059036544,0.00027445576,0.001104837,0.00055709074,0.00011181501],"category_scores_gemma":[0.0000028506233,0.0011573313,0.0011858902,0.0005052753,0.00008226878,0.00014440752,0.000106248604,0.0034297593,0.000023843773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007945691,0.00017686239,0.0008256029,0.000028002645,0.0004997898,0.0000027085932,0.00008399167,0.9550414,0.000039196595,0.0004151396,0.00037078824,0.042437058],"study_design_scores_gemma":[0.00037517105,0.00005185698,0.000015125566,0.0015291133,0.0005311529,0.0000019465974,0.00002904731,0.98231006,0.00025676392,0.0131944185,0.00071163446,0.0009936856],"about_ca_topic_score_codex":0.00055814424,"about_ca_topic_score_gemma":0.00004613654,"teacher_disagreement_score":0.9608923,"about_ca_system_score_codex":0.0004922678,"about_ca_system_score_gemma":0.0001916546,"threshold_uncertainty_score":0.9990877},"labels":[],"label_agreement":null},{"id":"W2768096823","doi":"10.1109/tnet.2019.2926230","title":"SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix Characteristics","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Trie; Prefix; Scalability; Parallel computing; IPv6; Data structure; Latency (audio); Exploit; Tree traversal; Algorithm; Operating system; The Internet","score_opus":0.032428039253844645,"score_gpt":0.2392706449452485,"score_spread":0.20684260569140384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768096823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077600237,0.00047502574,0.97285736,0.00027667737,0.016528878,0.0006536987,0.000033649263,0.00093601627,0.00047868383],"genre_scores_gemma":[0.8242359,0.002720571,0.16854404,0.00041002783,0.0016957102,0.00021882169,0.00009099722,0.0001352,0.0019487125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955851,0.00019446011,0.0007534608,0.0015783359,0.0008508331,0.0010378226],"domain_scores_gemma":[0.9960818,0.00026507874,0.00066158903,0.0025165959,0.00024231391,0.00023257878],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061695644,0.0008158576,0.0008254747,0.00040134022,0.00072922005,0.0011504224,0.0024573521,0.00073785114,0.000030593965],"category_scores_gemma":[0.00000773454,0.00086255453,0.0002384924,0.00082430465,0.0000897463,0.00086234586,0.00015481177,0.001977677,0.00017644532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002230058,0.00012643634,0.00013148709,0.0001912476,0.00008749849,0.000009037429,0.00030357164,0.50999725,0.000005971815,0.000015904054,0.00027695094,0.48883232],"study_design_scores_gemma":[0.00052497536,0.00013601783,0.00032426053,0.0023878205,0.00011371043,0.000024786266,0.000011904864,0.99072385,0.0011684418,0.0009984564,0.002529452,0.0010563408],"about_ca_topic_score_codex":0.000029705372,"about_ca_topic_score_gemma":0.000007273861,"teacher_disagreement_score":0.8164759,"about_ca_system_score_codex":0.00031941704,"about_ca_system_score_gemma":0.00034806825,"threshold_uncertainty_score":0.99988645},"labels":[],"label_agreement":null},{"id":"W2770230939","doi":"10.1109/tnet.2017.2765246","title":"Toward Cloud-Based Distributed Interactive Applications: Measurement, Modeling, and Analysis","year":2017,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","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":"Simon Fraser University","funders":"University of Minnesota; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Mississippi","keywords":"Computer science; Cloud computing; Bottleneck; Software deployment; The Internet; Latency (audio); Distributed computing; Virtual machine; Computer network; Operating system; Embedded system; Telecommunications","score_opus":0.07414595958929883,"score_gpt":0.29384931291472166,"score_spread":0.21970335332542285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770230939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016722352,0.00015593255,0.99315053,0.0030518644,0.00066765974,0.00046182267,0.000027702752,0.00067110383,0.0001411492],"genre_scores_gemma":[0.9481429,0.000060208306,0.05103605,0.00022064548,0.00016024472,0.0003385295,0.000007333006,0.000019041585,0.000015045554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770826,0.000068061636,0.00036400047,0.00084096426,0.000527177,0.00049155334],"domain_scores_gemma":[0.9966477,0.00013936347,0.00023189685,0.0025507917,0.00026416912,0.00016608441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052754616,0.00030137916,0.00037326335,0.00044576693,0.0011393575,0.0007320803,0.0023787592,0.00014979808,0.000004171789],"category_scores_gemma":[0.00005078087,0.00031223838,0.00019800846,0.0010440382,0.00009931134,0.000442082,0.000069326146,0.000445272,0.000016504477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040483268,0.00013322839,0.00044554716,0.000011835086,0.00054730516,0.000007952409,0.00016391308,0.7042667,0.00009488076,0.00028102112,0.00019296272,0.29381415],"study_design_scores_gemma":[0.00036866695,0.000071417555,0.00041772594,0.000093877774,0.00026345256,0.0000035916685,0.00003179545,0.9901581,0.00086744316,0.0034612517,0.0038707848,0.00039190584],"about_ca_topic_score_codex":0.000101008285,"about_ca_topic_score_gemma":0.00026096887,"teacher_disagreement_score":0.9464707,"about_ca_system_score_codex":0.00024883717,"about_ca_system_score_gemma":0.00006426708,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W2791952354","doi":"10.1109/tnet.2018.2806352","title":"Modeling Compound TCP Over WiFi for IoT","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"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; Throughput; TCP acceleration; TCP Friendly Rate Control; Network packet; CUBIC TCP; TCP tuning; TCP global synchronization; Packet loss; Network congestion; Zeta-TCP; Transmission Control Protocol; Wireless; Real-time computing; Telecommunications","score_opus":0.057697222599225155,"score_gpt":0.3086903651843955,"score_spread":0.25099314258517036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791952354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024410642,0.00006106369,0.9907669,0.00044671708,0.0030640545,0.0022238295,0.000004858072,0.00032245033,0.00066909834],"genre_scores_gemma":[0.9119728,0.000019394827,0.08281257,0.00082091015,0.0026263872,0.0013521368,0.0000018685951,0.000044715052,0.00034922478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980374,0.00006967089,0.000376544,0.00060076325,0.00028960494,0.00062602706],"domain_scores_gemma":[0.99839664,0.00027666255,0.00008638418,0.00096634123,0.00013109889,0.00014287868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039839145,0.00026201058,0.00026597566,0.00016646204,0.00086446636,0.0003292825,0.001043588,0.00015535935,0.000029882058],"category_scores_gemma":[0.000003628823,0.0002611113,0.00019655413,0.00063703454,0.00006797216,0.00026574527,0.000015680605,0.00029916968,0.00003390359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103110535,0.00011950589,0.000017170987,0.000024588933,0.00007009991,0.000004320151,0.00037801403,0.71498185,0.00022982415,0.0031611775,0.0014094416,0.2795009],"study_design_scores_gemma":[0.0006401942,0.0002292801,0.0000076070805,0.00017017398,0.00001570594,0.000010042095,0.000006081491,0.95733166,0.0005963131,0.007698376,0.032977473,0.00031709153],"about_ca_topic_score_codex":0.000028944889,"about_ca_topic_score_gemma":0.00009438539,"teacher_disagreement_score":0.9095317,"about_ca_system_score_codex":0.000075970616,"about_ca_system_score_gemma":0.00007689064,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W2804263917","doi":"10.1109/tnet.2018.2833815","title":"Optimal Network Service Chain Provisioning","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"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; Mitacs; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Provisioning; Computer network; Scalability; Distributed computing; Virtual network; Server; Service (business); Network virtualization; Network service; Bandwidth (computing); Virtualization; Cloud computing; Operating system","score_opus":0.02551980842782342,"score_gpt":0.2518965565975303,"score_spread":0.22637674816970688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804263917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053866203,0.00027441618,0.9843208,0.0013186645,0.00639816,0.0003248365,0.0000019792396,0.0010066179,0.0009678935],"genre_scores_gemma":[0.8123543,0.00008204686,0.17854917,0.0034452667,0.005111567,0.00007590657,0.0000033982003,0.000069120026,0.0003091859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969528,0.00014621888,0.00047093004,0.00088150875,0.0004763805,0.0010721785],"domain_scores_gemma":[0.9974406,0.00048167436,0.00017168054,0.0014689323,0.0001949682,0.00024216431],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006187084,0.0003911381,0.00033752352,0.00016011726,0.0013069673,0.0003899248,0.0016242986,0.00021909876,0.000072033705],"category_scores_gemma":[0.0000109962275,0.00038643897,0.0001716149,0.0020990106,0.0000841661,0.0004934626,0.000050889776,0.0005984049,0.00025195276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006567008,0.00011142497,0.00016894842,0.000014293775,0.000080351805,0.000024023766,0.0007991789,0.62303513,0.000040891406,0.00071606884,0.003340517,0.37160352],"study_design_scores_gemma":[0.00084068073,0.00051998434,0.00033915433,0.0005139704,0.00004717698,0.00007792887,0.00003770383,0.93053514,0.00047092227,0.0025992116,0.06315859,0.00085955346],"about_ca_topic_score_codex":0.000056690562,"about_ca_topic_score_gemma":0.0001434655,"teacher_disagreement_score":0.80696774,"about_ca_system_score_codex":0.00009501584,"about_ca_system_score_gemma":0.00010024642,"threshold_uncertainty_score":0.9999932},"labels":[],"label_agreement":null},{"id":"W2808622696","doi":"10.1109/tnet.2018.2841397","title":"Delayed Installation and Expedited Eviction: An Alternative Approach to Reduce Flow Table Occupancy in SDN Switches","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"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; Timeout; Knapsack problem; OpenFlow; Network packet; Table (database); Throughput; Computer network; Real-time computing; Algorithm; Software-defined networking; Operating system; Data mining","score_opus":0.04438624312030501,"score_gpt":0.2806499170756158,"score_spread":0.2362636739553108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808622696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07723614,0.00014170751,0.9189476,0.00015795983,0.0021516166,0.00036243783,0.0000041678054,0.00027773366,0.0007206514],"genre_scores_gemma":[0.91500866,0.00007017251,0.083065785,0.00034443755,0.0013159628,0.00009400117,0.0000072637235,0.000027229691,0.00006647314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798024,0.00010552676,0.00036357463,0.00077656825,0.00030026428,0.00047384098],"domain_scores_gemma":[0.99873006,0.00014856172,0.00009810234,0.0007122166,0.00011906632,0.00019201582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003520286,0.0002632089,0.00024682074,0.00032669678,0.00043675795,0.00024388723,0.0005403922,0.00014397941,0.000008708657],"category_scores_gemma":[0.000010986153,0.0002725752,0.00004739578,0.0015467689,0.000053896016,0.00084659125,0.000021617376,0.00031767404,0.0000115503135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027134386,0.00040668857,0.0010729611,0.000014420447,0.0000731672,0.000007695275,0.008943459,0.37559423,0.00033689602,0.00027080602,0.0004602346,0.6125481],"study_design_scores_gemma":[0.0008568618,0.000498265,0.0018834672,0.0001605901,0.000019406636,0.000034016208,0.00015138387,0.9903823,0.00089806074,0.0014983598,0.003141571,0.0004756889],"about_ca_topic_score_codex":0.00020795997,"about_ca_topic_score_gemma":0.00031070592,"teacher_disagreement_score":0.83777255,"about_ca_system_score_codex":0.0001524963,"about_ca_system_score_gemma":0.00007301329,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2883077902","doi":"10.1109/tnet.2019.2912077","title":"A Market-Based Framework for Multi-Resource Allocation in Fog Computing","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Resource allocation; Preemption; Incentive; Computer network; Microeconomics; Economics","score_opus":0.03929296603729922,"score_gpt":0.2864870703180051,"score_spread":0.24719410428070587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883077902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010861253,0.000073370815,0.976817,0.00055193895,0.010491238,0.0006495113,4.0241244e-7,0.00031113342,0.00024413785],"genre_scores_gemma":[0.63022,0.0000026681012,0.36792794,0.000641568,0.0010424564,0.000028903156,0.0000024484705,0.000032648277,0.00010136115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978053,0.00013925502,0.00044934909,0.0006705617,0.00026263087,0.00067291147],"domain_scores_gemma":[0.9974509,0.0013920799,0.00016505481,0.00083368074,0.00006482564,0.00009347864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008010459,0.000265811,0.00029081808,0.00031547365,0.00035310313,0.00020660294,0.0009473058,0.000199029,0.0000057010884],"category_scores_gemma":[0.00002784078,0.00029633808,0.00018067668,0.0008986137,0.000025008982,0.00020024752,0.000018250443,0.0005306512,0.000031674586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009029515,0.0003045356,0.0015872604,0.00010025066,0.000040643637,0.0000059069644,0.0012019178,0.43982878,0.00013865148,0.00040753515,0.00060962903,0.55568457],"study_design_scores_gemma":[0.0009650686,0.0000926531,0.00080155494,0.00057276135,0.000009696358,0.0000035320247,0.000025874599,0.98772836,0.0004231146,0.000833384,0.0082053095,0.00033871294],"about_ca_topic_score_codex":0.000024463932,"about_ca_topic_score_gemma":0.000013575386,"teacher_disagreement_score":0.6193588,"about_ca_system_score_codex":0.00016796932,"about_ca_system_score_gemma":0.00008211236,"threshold_uncertainty_score":0.99994886},"labels":[],"label_agreement":null},{"id":"W2889625362","doi":"10.1109/tnet.2018.2864726","title":"Truthful Online Auction Toward Maximized Instance Utilization in the Cloud","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Blockchain Technology Applications and Security","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":"Simon Fraser University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Vickrey–Clarke–Groves auction; Distributed computing; Mathematical optimization; Auction theory; Bidding; Microeconomics; Operating system","score_opus":0.06214532607699685,"score_gpt":0.2906575556953133,"score_spread":0.22851222961831646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889625362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030688616,0.000119368284,0.96232516,0.0043511325,0.0015836572,0.0003372671,0.0000041638154,0.0003409009,0.00024971913],"genre_scores_gemma":[0.9820694,0.00020276659,0.01641854,0.00071401795,0.0004565375,0.000093699215,0.0000044170174,0.000012012026,0.000028654911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985321,0.00014408378,0.00032473225,0.0004511887,0.0002288765,0.00031901736],"domain_scores_gemma":[0.9985457,0.00015514858,0.00010780608,0.0010769111,0.00007949899,0.00003490752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047005236,0.00016731645,0.00016341657,0.00020736999,0.0004599081,0.00008446478,0.0012354683,0.00018484562,0.000013692158],"category_scores_gemma":[0.00001117747,0.00014301979,0.00007160403,0.0016787999,0.00015254694,0.00019065225,0.000012470133,0.00047349866,0.000022286657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077627235,0.0007544131,0.00012030501,0.000013367436,0.000035539266,0.00000935171,0.003968586,0.0061931615,0.00014365422,0.02097441,0.00043156842,0.967278],"study_design_scores_gemma":[0.0023748928,0.00046541943,0.002466164,0.0001910814,0.000050190934,0.00013514826,0.000796742,0.7867204,0.0038182545,0.10130824,0.100872226,0.00080126623],"about_ca_topic_score_codex":0.000033955406,"about_ca_topic_score_gemma":0.00040894342,"teacher_disagreement_score":0.96647674,"about_ca_system_score_codex":0.00007868701,"about_ca_system_score_gemma":0.000037884376,"threshold_uncertainty_score":0.5832178},"labels":[],"label_agreement":null},{"id":"W2902698307","doi":"10.1109/tnet.2018.2881169","title":"Tapping the Knowledge of Dynamic Traffic Demands for Optimal CDN Design","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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; National Natural Science Foundation of China","keywords":"Computer science; Cache; Software deployment; Distributed computing; Scalability; Computer network; Internet traffic; TRACE (psycholinguistics); Content delivery network; The Internet; Server; Database; Operating system","score_opus":0.045638838684408024,"score_gpt":0.2784231943188788,"score_spread":0.23278435563447078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902698307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018430848,0.00033363685,0.9781841,0.00034087567,0.0021334924,0.0003148228,0.0000026099947,0.00016200432,0.00009762925],"genre_scores_gemma":[0.97775644,0.000044483557,0.021459222,0.00012032199,0.00032480052,0.000058964106,6.564784e-7,0.00001842327,0.0002166771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875253,0.000117012,0.0002865832,0.00035296933,0.00013773878,0.00035315473],"domain_scores_gemma":[0.9983609,0.0006962774,0.000102427635,0.00067450886,0.00011159481,0.00005429172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060738873,0.0001692731,0.00019075564,0.00012989376,0.0006403489,0.00009733126,0.0009674982,0.000077890916,0.000004148175],"category_scores_gemma":[0.000008228671,0.0001371765,0.00019761025,0.0004171381,0.00010644841,0.00016531511,0.000010653885,0.00020609907,0.000011450904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000934365,0.0001455733,0.0000019585023,0.000020834748,0.00011685002,0.0000012950901,0.0024813684,0.29837132,0.0016959469,0.00021264535,0.00029269097,0.6965661],"study_design_scores_gemma":[0.00039772963,0.0003140508,0.000023662285,0.00013822515,0.000044735894,0.000014418986,0.00006522619,0.9963809,0.00065541436,0.00024435334,0.0015504988,0.00017077489],"about_ca_topic_score_codex":0.0000085990305,"about_ca_topic_score_gemma":0.000049694918,"teacher_disagreement_score":0.9593256,"about_ca_system_score_codex":0.000057260808,"about_ca_system_score_gemma":0.00006943999,"threshold_uncertainty_score":0.55938953},"labels":[],"label_agreement":null},{"id":"W2903151719","doi":"10.1109/tnet.2018.2879979","title":"On Efficient Tree-Based Tag Search in Large-Scale RFID Systems","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"RFID technology advancements","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Beijing Institute of Technology; National Natural Science Foundation of China","keywords":"Notation; Computer science; Scale (ratio); Hash function; Algorithm; Discrete mathematics; Information retrieval; Mathematics; Theoretical computer science; Programming language; Arithmetic","score_opus":0.015069389742678902,"score_gpt":0.24705012118934708,"score_spread":0.23198073144666817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903151719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35419533,0.00014343836,0.6396753,0.000062698826,0.0034695733,0.0004256096,0.000016686125,0.00074178085,0.0012695534],"genre_scores_gemma":[0.9981216,0.000025371302,0.001257634,0.00006474957,0.00023420723,0.00012332837,0.0000047208705,0.00007406591,0.000094328134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820876,0.00006340475,0.00033984974,0.00038063165,0.0003022772,0.0007050835],"domain_scores_gemma":[0.9989617,0.00016874088,0.000031422216,0.00071913365,0.00003880406,0.000080238904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031157615,0.0002575194,0.00025472135,0.00048760185,0.00022111162,0.000035570793,0.00035574008,0.00022195191,0.000053263662],"category_scores_gemma":[0.0000047108397,0.0002832824,0.00007328017,0.0008595912,0.00008348771,0.000053669493,0.0000038981434,0.0006465993,0.00018843717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049337224,0.00015876167,0.0002961829,0.000030766805,0.00002876894,0.000012214644,0.000120880504,0.98529774,0.0008614457,0.000033933207,0.0000765687,0.013033398],"study_design_scores_gemma":[0.0013338631,0.00021076547,0.00036427286,0.0004255439,0.000016547077,0.000003524224,0.000090175046,0.9804687,0.013395758,0.000054979188,0.0033070077,0.00032886222],"about_ca_topic_score_codex":0.000016213526,"about_ca_topic_score_gemma":0.00028007018,"teacher_disagreement_score":0.64392626,"about_ca_system_score_codex":0.00035841562,"about_ca_system_score_gemma":0.000020156695,"threshold_uncertainty_score":0.9999619},"labels":[],"label_agreement":null},{"id":"W2943618428","doi":"10.1109/tnet.2019.2912717","title":"Routing via Functions in Virtual Networks: The Curse of Choices","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","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; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Virtual network; Heuristics; Distributed computing; Heuristic; Network virtualization; Virtualization; Routing (electronic design automation); Network architecture; Computer network; Service (business); Mathematical optimization; Cloud computing; Artificial intelligence","score_opus":0.01458533927659281,"score_gpt":0.2283739847456111,"score_spread":0.2137886454690183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943618428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018314011,0.00038326863,0.9743436,0.00034284117,0.005437404,0.00035891667,0.000002028339,0.00021386206,0.0006040773],"genre_scores_gemma":[0.99697655,0.00010370689,0.0016419578,0.0003593364,0.0005186725,0.000045895806,0.0000021561941,0.000029665838,0.00032205708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977957,0.00017538067,0.00054301636,0.0005373773,0.00035507616,0.0005934341],"domain_scores_gemma":[0.99720085,0.001216399,0.0002215589,0.0012184061,0.00006212373,0.00008068717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321066,0.00026588017,0.0003261438,0.00019843143,0.00033696182,0.00012636874,0.001216809,0.00015693303,0.00004657498],"category_scores_gemma":[0.00001001079,0.00021665436,0.00020283382,0.001658062,0.00007956069,0.00042134672,0.00003008348,0.0007041433,0.00005411232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022806254,0.00009297317,0.0031618301,0.0000046608625,0.00003751979,0.000002553797,0.0002730622,0.8318484,0.000027547674,0.00053046056,0.0001056148,0.16389261],"study_design_scores_gemma":[0.0007277471,0.00022869033,0.0030410537,0.00029229687,0.0000324445,0.00001823957,0.000119976634,0.990268,0.00008280347,0.0007319281,0.004098625,0.00035820168],"about_ca_topic_score_codex":0.00014446536,"about_ca_topic_score_gemma":0.00028137796,"teacher_disagreement_score":0.97866255,"about_ca_system_score_codex":0.00007367036,"about_ca_system_score_gemma":0.00005340971,"threshold_uncertainty_score":0.88349086},"labels":[],"label_agreement":null},{"id":"W2956735194","doi":"10.1109/tnet.2019.2928798","title":"The Gain of Energy Accumulation in Multi-Hop Wireless Network Broadcast","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":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":"Hop (telecommunications); Computer science; Computer network; Dissemination; Wireless network; Efficient energy use; Energy (signal processing); Wireless; Broadcast radiation; Exponent; Broadcast communication network; Distributed computing; Topology (electrical circuits); Telecommunications; Mathematics; Electrical engineering; Engineering; Combinatorics","score_opus":0.054493448252643954,"score_gpt":0.29381675744607544,"score_spread":0.23932330919343148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956735194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024398968,0.0017111602,0.9833298,0.00023889689,0.010969501,0.00079494296,0.000006311163,0.00021858445,0.00029095128],"genre_scores_gemma":[0.9817956,0.0024678416,0.013860025,0.00017150487,0.000949623,0.00027966517,0.000016414577,0.000089648565,0.00036965345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508464,0.0006748501,0.0012529986,0.0012421296,0.0006987165,0.0010466819],"domain_scores_gemma":[0.9937525,0.0017533198,0.0008128163,0.0033766292,0.00017305161,0.00013168261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001257359,0.00064441195,0.00078999734,0.00026523645,0.00043854723,0.00035810552,0.003412876,0.0007259891,0.000008479665],"category_scores_gemma":[0.000011857854,0.00059533573,0.00042817948,0.0012462632,0.00013130499,0.00027014047,0.00021813004,0.0018314719,0.000012312813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035227822,0.00008951811,0.00022758506,0.000028320148,0.000066573186,0.000006362194,0.00017962443,0.69517106,0.000013328588,0.00057857315,0.00013807022,0.30346578],"study_design_scores_gemma":[0.00062435033,0.000060753035,0.00054507033,0.0010721285,0.00003454371,0.0000065989966,0.000016557933,0.98993576,0.00018124802,0.0023825213,0.004589329,0.00055114756],"about_ca_topic_score_codex":0.00032970583,"about_ca_topic_score_gemma":0.0016159401,"teacher_disagreement_score":0.97935575,"about_ca_system_score_codex":0.00033599904,"about_ca_system_score_gemma":0.0002729756,"threshold_uncertainty_score":0.9996498},"labels":[],"label_agreement":null},{"id":"W2964238519","doi":"10.1109/tnet.2018.2797107","title":"Proactive Doppler Shift Compensation in Vehicular Cyber-Physical Systems","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Doppler effect; Wireless; Compensation (psychology); Network packet; Probabilistic logic; Real-time computing; Frequency offset; Transceiver; Offset (computer science); IEEE 802.11p; Broadcasting (networking); Vehicular ad hoc network; Computer network; Wireless ad hoc network; Telecommunications; Channel (broadcasting); Orthogonal frequency-division multiplexing; Artificial intelligence","score_opus":0.017199317615045385,"score_gpt":0.23409175721117684,"score_spread":0.21689243959613144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964238519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6276288,0.0002890127,0.36259025,0.0001013643,0.004935142,0.0011446031,0.000014329941,0.0008909145,0.0024055894],"genre_scores_gemma":[0.99689925,0.000043923497,0.000533735,0.00004782284,0.0021146976,0.00018526129,0.00001553131,0.000116637304,0.000043142176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978231,0.00014890227,0.00042142835,0.00047087765,0.000400106,0.0007355839],"domain_scores_gemma":[0.9988691,0.00019820288,0.000064766806,0.0006550162,0.00006180718,0.00015109473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029358853,0.0003900845,0.00042355424,0.00024860227,0.00022874986,0.000119115284,0.00032564008,0.0002309023,0.000029417162],"category_scores_gemma":[0.000004289717,0.0004200225,0.00015114718,0.0007685948,0.00010192537,0.00027318782,0.0000058442433,0.0007820464,0.00018761099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035432997,0.00009502442,0.00010523909,0.000027374974,0.00012711037,0.000021931297,0.0007913505,0.98944646,0.0004468282,0.00007984167,0.00019640643,0.008627011],"study_design_scores_gemma":[0.00064032886,0.00010910094,0.0012604978,0.00027609162,0.0000659577,0.000030441015,0.00007893667,0.9913234,0.0013918995,0.00027240496,0.004067437,0.00048352158],"about_ca_topic_score_codex":0.00009757659,"about_ca_topic_score_gemma":0.0004296939,"teacher_disagreement_score":0.36927044,"about_ca_system_score_codex":0.0004145552,"about_ca_system_score_gemma":0.000030240526,"threshold_uncertainty_score":0.9998252},"labels":[],"label_agreement":null},{"id":"W2964906425","doi":"10.1109/tnet.2019.2926142","title":"TailCutter: Wisely Cutting Tail Latency in Cloud CDNs Under Cost Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Age of Information Optimization","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Latency (audio); Scheduling (production processes); Workload; Distributed computing; Minification; Benchmark (surveying); Computer network; Operating system; Mathematical optimization; World Wide Web","score_opus":0.018968826807936684,"score_gpt":0.23768311213593732,"score_spread":0.21871428532800063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964906425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010616997,0.000022261636,0.978921,0.0010313987,0.002949067,0.0005324318,0.0000032623173,0.00029566613,0.0056279344],"genre_scores_gemma":[0.96977276,0.000053879863,0.028431026,0.0011607007,0.00015587095,0.000035132995,0.000006605629,0.00002508336,0.00035892683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979748,0.00010160332,0.00058335013,0.00042908112,0.00038018113,0.0005309946],"domain_scores_gemma":[0.9985796,0.00023603514,0.00022093387,0.00075147295,0.00010373244,0.00010818832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000441959,0.00024950178,0.00024180175,0.00033908858,0.00024239263,0.00025234706,0.000831041,0.00016211186,0.00019902505],"category_scores_gemma":[0.00000989815,0.00027213673,0.00010259756,0.0009545158,0.00006813547,0.0012194111,0.000018538902,0.0004984968,0.00045509668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011619005,0.000060581304,0.0006636564,0.000014585069,0.000022322161,0.000007809619,0.000882313,0.88207394,0.00006047947,0.0012502216,0.00015171884,0.11480078],"study_design_scores_gemma":[0.0017113835,0.00010977622,0.0008039603,0.00044359584,0.000016608648,0.000057215224,0.00038557398,0.9898506,0.00068590423,0.0017689307,0.003471986,0.00069445645],"about_ca_topic_score_codex":0.000020716647,"about_ca_topic_score_gemma":0.000026647112,"teacher_disagreement_score":0.9591558,"about_ca_system_score_codex":0.0002244262,"about_ca_system_score_gemma":0.000106566775,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W2965983834","doi":"10.1109/tnet.2019.2924152","title":"Network Navigation With Scheduling: Distributed Algorithms","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Tellabs (Canada)","funders":"Office of Naval Research","keywords":"Computer science; Wireless network; Asynchronous communication; Distributed computing; Scheduling (production processes); Wireless; Wireless sensor network; Real-time computing; Computer network; Algorithm; Telecommunications","score_opus":0.012333443045676077,"score_gpt":0.2108393640984207,"score_spread":0.19850592105274462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965983834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04737209,0.0001791348,0.9478023,0.00007355225,0.0020445983,0.00030736162,0.00001565607,0.0017255824,0.00047972158],"genre_scores_gemma":[0.98831344,0.000079705685,0.010977563,0.000055497294,0.00032667926,0.00004519087,0.000060206465,0.00006912234,0.00007262419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987541,0.000021850406,0.00025843724,0.0002711356,0.00023034775,0.00046416835],"domain_scores_gemma":[0.9992421,0.00009205304,0.000047718113,0.00050171453,0.000056086163,0.000060302813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011208067,0.00025251377,0.00022634157,0.00009549658,0.00020786806,0.00007375684,0.00025917034,0.00020378319,0.00005824639],"category_scores_gemma":[0.0000022778122,0.00023844052,0.00007019754,0.00081491855,0.00004428462,0.00016511708,0.0000031350455,0.0004651829,0.000083133724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021529338,0.000015444964,0.00037600158,0.000026135267,0.000055382217,0.000004878017,0.00003902229,0.97280216,0.00008048239,0.00006324212,0.00012344756,0.02639228],"study_design_scores_gemma":[0.00088135304,0.00016085808,0.0001815435,0.00044251262,0.00006329527,0.000027205866,0.0001583127,0.98322093,0.0058087977,0.0007534679,0.007713202,0.0005885383],"about_ca_topic_score_codex":0.000005183275,"about_ca_topic_score_gemma":0.0000092936925,"teacher_disagreement_score":0.94094133,"about_ca_system_score_codex":0.0001220829,"about_ca_system_score_gemma":0.000017262983,"threshold_uncertainty_score":0.97233224},"labels":[],"label_agreement":null},{"id":"W2979600268","doi":"10.1109/tnet.2019.2943561","title":"Optimization of MIMO Device-to-Device Networks via Matrix Fractional Programming: A Minorization–Maximization Approach","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"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; Huawei Technologies","keywords":"Computer science; Beamforming; Transmitter; Maximization; Scheduling (production processes); Distributed computing; MIMO; Mathematical optimization; Computer network; Telecommunications","score_opus":0.014131150406218252,"score_gpt":0.23930682988668978,"score_spread":0.2251756794804715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979600268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010582167,0.00026742407,0.99315035,0.000027168711,0.0025250684,0.0015854404,0.000010879987,0.0006586634,0.0007167674],"genre_scores_gemma":[0.7552533,0.00011378203,0.24339043,0.000045979654,0.00044883718,0.00021779284,0.00016287957,0.0001614537,0.00020555063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753535,0.00009539228,0.0008572414,0.0005599147,0.00041674243,0.0005353689],"domain_scores_gemma":[0.9983804,0.00018651357,0.00026769048,0.0006998387,0.00029578537,0.00016974595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002613653,0.0004396355,0.0004748111,0.0004942188,0.00021182849,0.00008458208,0.00035034784,0.00033604848,0.00009699364],"category_scores_gemma":[0.000013479765,0.00051953935,0.00015619046,0.0019349316,0.000030371244,0.00056222663,0.000008264322,0.00040762438,0.000041120227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058368005,0.00011706374,0.00030587357,0.00016965439,0.00010777815,6.510166e-7,0.00019204404,0.98369735,0.0002828366,0.000025155132,0.000044580738,0.01499867],"study_design_scores_gemma":[0.0006221581,0.00008834358,0.000038970295,0.00022022318,0.00008797279,0.000015709285,0.00009135214,0.9964196,0.00042444532,0.000020051391,0.0014938341,0.00047734973],"about_ca_topic_score_codex":0.000019083776,"about_ca_topic_score_gemma":0.0000149098505,"teacher_disagreement_score":0.7541951,"about_ca_system_score_codex":0.00028705737,"about_ca_system_score_gemma":0.000038941893,"threshold_uncertainty_score":0.99972564},"labels":[],"label_agreement":null},{"id":"W2990839184","doi":"10.1109/tnet.2019.2953806","title":"OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"China National Funds for Distinguished Young Scientists; National Natural Science Foundation of China","keywords":"Computer science; Server; Cloud computing; Upload; Response time; Latency (audio); Job scheduler; Scheduling (production processes); Schedule; Mobile edge computing; Distributed computing; Online algorithm; Scalability; Job shop scheduling; Computer network; Mathematical optimization; Algorithm; Operating system","score_opus":0.017639311282922787,"score_gpt":0.2452361231883151,"score_spread":0.22759681190539233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990839184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6187465,0.0001625502,0.37199664,0.00026524518,0.008342124,0.00017988477,6.8811346e-7,0.00014944327,0.0001568963],"genre_scores_gemma":[0.9760548,0.00007901663,0.022230104,0.0002928662,0.0012099838,0.000005563403,0.0000026240289,0.00003275318,0.000092329276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786615,0.00012375158,0.00040200932,0.00070504163,0.00025788893,0.0006451364],"domain_scores_gemma":[0.9987949,0.00035136772,0.00010563077,0.0005738239,0.00004577704,0.00012850414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034559818,0.0002972694,0.00033773942,0.00026166806,0.00033846553,0.00020994093,0.00053468184,0.00014193432,0.0000029249593],"category_scores_gemma":[0.0000075734674,0.00030657952,0.0001164317,0.0006286963,0.000038953713,0.00034824415,0.000046877292,0.0006746466,0.000034918405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005649441,0.0002506375,0.008306406,0.00006486525,0.00009659919,0.0001689821,0.0046818946,0.4831567,0.001852685,0.000091792084,0.00002540445,0.5012475],"study_design_scores_gemma":[0.0008285811,0.00015600916,0.004618911,0.0006919848,0.000020884068,0.00013441473,0.00008480862,0.989843,0.0012876424,0.0011186147,0.0005968973,0.00061825715],"about_ca_topic_score_codex":0.00010934984,"about_ca_topic_score_gemma":0.00012728402,"teacher_disagreement_score":0.5066863,"about_ca_system_score_codex":0.0001106544,"about_ca_system_score_gemma":0.000053124804,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W2995544305","doi":"10.1109/tnet.2019.2950908","title":"Measurement, Analysis, and Enhancement of Multipath TCP Energy Efficiency for Datacenters","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":27,"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 Natural Science Foundation of China; University of Minnesota Duluth","keywords":"Multipath TCP; Computer science; Computer network; Energy consumption; Efficient energy use; Network packet; Latency (audio); Multipath propagation; Throughput; Network congestion; Wireless; Operating system; Channel (broadcasting); Telecommunications","score_opus":0.02395341032923135,"score_gpt":0.23947900684135226,"score_spread":0.21552559651212091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995544305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03294322,0.00027699678,0.96522117,0.00012568479,0.0009568147,0.00023518599,0.0000025926283,0.00006477874,0.00017354208],"genre_scores_gemma":[0.98960966,0.000053498254,0.009967396,0.00012667871,0.000058999678,0.000023595328,0.0000015049283,0.000009762659,0.00014892574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.000059663424,0.00033117607,0.0005157634,0.0004088928,0.0003144946],"domain_scores_gemma":[0.998796,0.000092484304,0.00016197945,0.0008080133,0.00007438048,0.000067142835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005427026,0.00016644222,0.00027125454,0.0002963359,0.00017517152,0.0000694164,0.00062627945,0.0000413345,0.0000049213013],"category_scores_gemma":[0.000003726629,0.00015563601,0.00017349291,0.000743176,0.00002722588,0.00003113461,0.000029661904,0.00008552939,0.0000020002199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053824046,0.00045989203,0.000637881,0.00009812027,0.00095010595,0.0000014930462,0.0006526367,0.5047964,0.002508552,0.00051803835,0.00011046469,0.48921263],"study_design_scores_gemma":[0.0008678513,0.0002577266,0.00023027237,0.00019167874,0.0002154164,9.940635e-7,0.00005442959,0.98408425,0.005844661,0.000077949,0.00792321,0.0002515442],"about_ca_topic_score_codex":0.000066349545,"about_ca_topic_score_gemma":0.000046728255,"teacher_disagreement_score":0.9566664,"about_ca_system_score_codex":0.00006267612,"about_ca_system_score_gemma":0.000019693247,"threshold_uncertainty_score":0.63466525},"labels":[],"label_agreement":null},{"id":"W3001623914","doi":"10.1109/tnet.2019.2963792","title":"Steganographic-Based Header Size Reduction Technique for Multimedia Streams","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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":"CMC Microsystems (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Network packet; Header; Overhead (engineering); Hypertext Transfer Protocol; Internet Protocol; Transmission Control Protocol; Multimedia; The Internet; Node (physics); Link Control Protocol; User Datagram Protocol; Quality of service; Operating system","score_opus":0.042193796324499905,"score_gpt":0.25227943749033716,"score_spread":0.21008564116583725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001623914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020751632,0.0000852212,0.99089354,0.0039420472,0.0016986906,0.00064407435,0.000010369831,0.000605565,0.000045316105],"genre_scores_gemma":[0.9378401,0.000024502166,0.0602627,0.0009607229,0.000565651,0.00026727116,0.000004107005,0.000028960914,0.00004599664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984288,0.00008457335,0.0002893849,0.00056937605,0.00025264476,0.00037522346],"domain_scores_gemma":[0.99867713,0.00040770142,0.0000950827,0.0005653539,0.000083175226,0.00017155816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020907959,0.00022685692,0.00021578786,0.00012709912,0.00038529886,0.00014229507,0.000623818,0.0001382894,0.00000843575],"category_scores_gemma":[0.000018313578,0.0002363356,0.00027816038,0.00070231955,0.00004677369,0.0002603515,0.000005741196,0.00038936106,0.0000084591165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003673992,0.00042302156,0.00006982871,0.000103271974,0.0001741645,0.000018230017,0.0011433675,0.25687572,0.074526794,0.00013124045,0.0016213367,0.6645456],"study_design_scores_gemma":[0.0013860654,0.0005807172,0.000022180282,0.00020997415,0.00006883544,0.000019621413,0.000102899874,0.9439646,0.047914017,0.0005084715,0.0046561547,0.0005664824],"about_ca_topic_score_codex":0.000033938584,"about_ca_topic_score_gemma":0.0000117099535,"teacher_disagreement_score":0.9357649,"about_ca_system_score_codex":0.000052419728,"about_ca_system_score_gemma":0.000067464505,"threshold_uncertainty_score":0.96374863},"labels":[],"label_agreement":null},{"id":"W3013536937","doi":"10.1109/tnet.2020.2979807","title":"Efficient Computing Resource Sharing for Mobile Edge-Cloud Computing Networks","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":251,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada","keywords":"Cloud computing; Utility computing; Computer science; Mobile edge computing; Distributed computing; Profit maximization; Edge computing; Mobile cloud computing; Cloud testing; Cloud computing security; Computer network; Profit (economics); Microeconomics; Economics; Operating system","score_opus":0.035090396451270454,"score_gpt":0.2591921747431791,"score_spread":0.22410177829190867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013536937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0191274,0.00037437296,0.9595454,0.00060122233,0.017906541,0.00082355936,8.8652695e-7,0.0011856359,0.00043498052],"genre_scores_gemma":[0.93110913,0.000007612638,0.051476188,0.0017503387,0.015487166,0.000028529388,0.0000062284016,0.00009293656,0.00004187175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577266,0.00013166782,0.0008578243,0.0014188401,0.00045458262,0.0013644282],"domain_scores_gemma":[0.99693817,0.0011955434,0.0003314626,0.0010048144,0.00013227544,0.00039774188],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009455246,0.0005253579,0.00057105866,0.0001881669,0.0018690366,0.00060248387,0.0022078773,0.0002217178,0.00000332759],"category_scores_gemma":[0.000030169118,0.00058261474,0.00041896716,0.0014338755,0.000071813694,0.00013228517,0.0001628072,0.0009424278,0.000029449466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002809573,0.00006572354,0.00005701426,0.000040282048,0.000047576093,0.000009540433,0.0018456473,0.79042757,0.00004553238,0.000058387115,0.0013587096,0.20601593],"study_design_scores_gemma":[0.0007556719,0.00023102993,0.000030619558,0.00032108396,0.00003763501,0.000021245862,0.00008540262,0.97294796,0.00027240897,0.00009546476,0.02459884,0.00060263986],"about_ca_topic_score_codex":0.000011181669,"about_ca_topic_score_gemma":0.0000013324293,"teacher_disagreement_score":0.9119817,"about_ca_system_score_codex":0.00016780033,"about_ca_system_score_gemma":0.000062469655,"threshold_uncertainty_score":0.9996625},"labels":[],"label_agreement":null},{"id":"W3014068862","doi":"10.1109/tnet.2020.2979966","title":"DeepCast: Towards Personalized QoE for Edge-Assisted Crowdcast With Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"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 Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Human–computer interaction; Reinforcement; Artificial intelligence; Psychology; Social psychology","score_opus":0.06871222429529984,"score_gpt":0.29951652129179057,"score_spread":0.23080429699649074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014068862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005722472,0.00011528806,0.9935089,0.0037050077,0.00062630966,0.0005379407,0.0000012894025,0.00036208343,0.0005709589],"genre_scores_gemma":[0.9186502,0.00004105803,0.07793238,0.0023317856,0.00044656778,0.00019082302,0.000008784438,0.000040982995,0.0003574165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767345,0.00013886194,0.00041949013,0.00065552053,0.0005087774,0.000603872],"domain_scores_gemma":[0.9986745,0.00024120933,0.00018045114,0.0005087316,0.0001520325,0.0002430926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003288893,0.00031877507,0.00034697712,0.000103506594,0.0007639686,0.00038741366,0.0007649152,0.00009701572,0.000049412098],"category_scores_gemma":[0.000016945858,0.00029713122,0.00022624446,0.00066349295,0.0000655785,0.00046863948,0.000020143678,0.00046212922,0.000023152035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040790887,0.00014151272,0.00002962071,0.00012446649,0.0002706412,0.000042948817,0.0065472093,0.547243,0.00056346407,0.0006212715,0.00030267105,0.4437053],"study_design_scores_gemma":[0.0026837934,0.001314492,0.000092833216,0.00018945841,0.00012282965,0.000038810984,0.0006187711,0.9494628,0.0029044233,0.000115697134,0.041799802,0.0006562903],"about_ca_topic_score_codex":0.000029847874,"about_ca_topic_score_gemma":0.00003090721,"teacher_disagreement_score":0.91807795,"about_ca_system_score_codex":0.0001455529,"about_ca_system_score_gemma":0.00014724724,"threshold_uncertainty_score":0.9999481},"labels":[],"label_agreement":null},{"id":"W3015860851","doi":"10.1109/tnet.2020.2981977","title":"Fast Switch-Based Load Balancer Considering Application Server States","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cloud Computing and Resource Management","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Server; Latency (audio); Computer science; Load balancing (electrical power); Load management; Computer network; Operating system; Distributed computing; Real-time computing; Engineering; Grid; Telecommunications","score_opus":0.023075505679000498,"score_gpt":0.2314193686570892,"score_spread":0.2083438629780887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015860851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016725315,0.00010183092,0.9754878,0.005793946,0.00065736123,0.0002459242,0.0000015357319,0.00064349786,0.0003427372],"genre_scores_gemma":[0.9835566,0.000012113364,0.0127149,0.0032260548,0.0003639917,0.000039847233,0.000001545803,0.00002333855,0.000061575185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829936,0.00006343106,0.00028416168,0.0005840816,0.00039118185,0.00037775742],"domain_scores_gemma":[0.99882716,0.00017086611,0.00010828426,0.00068380946,0.000060619346,0.00014924159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002012032,0.00021338461,0.00019336262,0.00006475026,0.00035847147,0.00019321001,0.0007461533,0.000062562314,0.00001577189],"category_scores_gemma":[0.0000038297712,0.00021493818,0.00011977398,0.0005550225,0.000034887806,0.00004230849,0.00002550763,0.00029794784,0.00009800552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011945518,0.000040642943,0.00010246126,0.000025496853,0.000030045021,0.000007135332,0.00047614775,0.83582604,0.00013235888,0.00005473478,0.0002395665,0.16305341],"study_design_scores_gemma":[0.00044914347,0.00006598232,0.00010134948,0.00007492092,0.000018405777,0.0000025607553,0.000046305366,0.97474474,0.0010776896,0.0003025944,0.02285913,0.0002571618],"about_ca_topic_score_codex":0.000048082555,"about_ca_topic_score_gemma":0.000027921984,"teacher_disagreement_score":0.9668313,"about_ca_system_score_codex":0.00011367937,"about_ca_system_score_gemma":0.000055464883,"threshold_uncertainty_score":0.87649244},"labels":[],"label_agreement":null},{"id":"W3033036004","doi":"10.1109/tnet.2020.2994015","title":"FoGMatch: An Intelligent Multi-Criteria IoT-Fog Scheduling Approach Using Game Theory","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"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 en Outaouais","funders":"Lebanese American University","keywords":"Computer science; Distributed computing; Cloud computing; Internet of Things; Scheduling (production processes); Fog computing; Job shop scheduling; Latency (audio); Computer network; Mathematical optimization; Embedded system; Operating system","score_opus":0.15526643044389024,"score_gpt":0.31995294127897794,"score_spread":0.1646865108350877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033036004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022918673,0.00020780941,0.9647975,0.00021881673,0.010706856,0.00029386464,6.815708e-7,0.0006859165,0.00016991347],"genre_scores_gemma":[0.63802105,0.000015680607,0.35782096,0.0007595189,0.0033028666,0.0000106942025,0.0000026756784,0.000050131388,0.000016434873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969123,0.0004168564,0.0005560216,0.0009615308,0.00036296304,0.0007903423],"domain_scores_gemma":[0.9981843,0.00027766253,0.00016430598,0.0009260112,0.00008455205,0.00036313882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008507415,0.0004097861,0.0003914159,0.0001954317,0.0006818957,0.0005172977,0.001537497,0.00017913464,0.000007940564],"category_scores_gemma":[0.00002263737,0.0004305354,0.0002295979,0.0009951617,0.00007325312,0.0004857825,0.000057471672,0.0007424533,0.000037106038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055651853,0.00028034614,0.000044354492,0.00006014861,0.00009139872,0.000025376783,0.008674349,0.55959255,0.0018829125,0.00023173176,0.000034832778,0.42902634],"study_design_scores_gemma":[0.00035663074,0.00009820401,0.000017259003,0.0001317165,0.000036955335,0.000036510995,0.00018968491,0.9939939,0.0022334368,0.0007688505,0.0016452094,0.0004916741],"about_ca_topic_score_codex":0.000021674017,"about_ca_topic_score_gemma":0.0000015501498,"teacher_disagreement_score":0.6151024,"about_ca_system_score_codex":0.00012131156,"about_ca_system_score_gemma":0.00008860244,"threshold_uncertainty_score":0.9998146},"labels":[],"label_agreement":null},{"id":"W3040089136","doi":"10.1109/tnet.2020.3002876","title":"High-Throughput and Robust Rate Adaptation for Backscatter Networks","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Telecommunications link; Throughput; Overhead (engineering); Channel (broadcasting); Multipath propagation; Computer network; Fading; Backscatter (email); Interference (communication); Real-time computing; Wireless; Telecommunications","score_opus":0.03960769983014683,"score_gpt":0.2113566458322956,"score_spread":0.17174894600214877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040089136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007639245,0.000464124,0.98733705,0.0006358243,0.002668463,0.00033780534,0.000011909032,0.0007910716,0.00011448728],"genre_scores_gemma":[0.95872307,0.0006162034,0.037002753,0.00092481513,0.0023327016,0.00015339207,0.00003007628,0.0001589502,0.000058041165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984165,0.00006349522,0.00039706958,0.00045644224,0.00013275862,0.0005337533],"domain_scores_gemma":[0.99877834,0.00058006105,0.00006908769,0.0003278752,0.000048965878,0.00019569315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018821498,0.00034888939,0.00032750555,0.0000668779,0.00029463702,0.00012780676,0.0002294381,0.00023162736,0.00002536784],"category_scores_gemma":[0.000011400634,0.00039561512,0.000108290005,0.00038456565,0.000057904348,0.00023203844,0.0000054061134,0.0005108431,0.000009856779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004442109,0.00001143454,0.000018286677,0.000052022842,0.000087241155,0.0000033429096,0.00019045205,0.9372933,0.000110770736,0.00005003702,0.0013693164,0.060769394],"study_design_scores_gemma":[0.0006793785,0.000092312795,0.000078744466,0.00016270926,0.00008241484,0.0000049527875,0.0000383323,0.9928259,0.0003892312,0.00015791348,0.005080099,0.0004079606],"about_ca_topic_score_codex":0.000015008712,"about_ca_topic_score_gemma":0.00007265762,"teacher_disagreement_score":0.95108384,"about_ca_system_score_codex":0.00006743439,"about_ca_system_score_gemma":0.000012791085,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W3088524644","doi":"10.1109/tnet.2020.3022757","title":"Network Latency Estimation With Leverage Sampling for Personal Devices: An Adaptive Tensor Completion Approach","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Leverage (statistics); Latency (audio); Adaptive sampling; Estimator; Real-time computing; Artificial intelligence; Telecommunications; Statistics","score_opus":0.11341228068737016,"score_gpt":0.26079468070376877,"score_spread":0.1473824000163986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088524644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011873026,0.000116513256,0.98576814,0.000081715356,0.00027414976,0.0005173519,0.000016458187,0.001144236,0.0002084158],"genre_scores_gemma":[0.7536268,0.000016135498,0.24534106,0.00025827973,0.00057814294,0.000073836934,0.000036885354,0.00006527084,0.0000035557919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880457,0.00004113593,0.00023521333,0.00035759475,0.00018832476,0.00037317906],"domain_scores_gemma":[0.9994157,0.00013145563,0.00006346918,0.00019563393,0.00007781489,0.000115929084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009966782,0.0002703814,0.00026936512,0.00006052145,0.00036831433,0.00008451099,0.0001653411,0.000115496994,0.000008165807],"category_scores_gemma":[0.00000258949,0.000266847,0.00008545538,0.00031164338,0.000032716172,0.00022779003,0.000002360827,0.00032604238,0.0000032366981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017670615,0.000030175608,0.000028543116,0.000029516841,0.00007469927,0.0000019107074,0.0006465187,0.9634572,0.00028911885,0.000021921278,0.00014571499,0.035097934],"study_design_scores_gemma":[0.0003540075,0.00035888582,0.00016212644,0.00021226011,0.00009171154,0.000012692655,0.00013006652,0.99693304,0.00035424798,0.00033428942,0.00072086987,0.00033579217],"about_ca_topic_score_codex":0.000013000838,"about_ca_topic_score_gemma":0.000019082496,"teacher_disagreement_score":0.7417538,"about_ca_system_score_codex":0.000069173126,"about_ca_system_score_gemma":0.000016113012,"threshold_uncertainty_score":0.99997836},"labels":[],"label_agreement":null},{"id":"W3097624413","doi":"10.1109/tnet.2020.3030850","title":"Conflict-Free Scheduling in Cellular V2X Communications","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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; Scheduling (production processes); Scalability; Network packet; Distributed computing; Computer network; Reuse; Information exchange; Job shop scheduling; Heuristic; Network topology; Routing (electronic design automation); Mathematical optimization","score_opus":0.04403500177099686,"score_gpt":0.23756118968181253,"score_spread":0.19352618791081566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097624413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067775,0.005043858,0.9235386,0.0029017767,0.0018660747,0.0007509198,0.000027996859,0.0016675038,0.003525525],"genre_scores_gemma":[0.9838906,0.0012087899,0.01357036,0.000546276,0.00052407634,0.00008124137,0.00001974058,0.00012498056,0.000033951186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980943,0.00011141042,0.00052182365,0.0003691971,0.00026684813,0.0006363736],"domain_scores_gemma":[0.9975917,0.0002757013,0.000054939625,0.0017928075,0.000035394558,0.00024949788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024458367,0.00033292497,0.00036287497,0.0001591797,0.0002384965,0.00008914066,0.00140171,0.00022298057,0.00006930489],"category_scores_gemma":[0.00001851959,0.00041201207,0.00016547207,0.0009494204,0.0000798485,0.00018622777,0.000027906466,0.001265842,0.00011674517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014212969,0.000038627517,0.000075500844,0.00003266367,0.000069379035,0.000021288066,0.0005730315,0.98442554,0.0018224332,0.00004905289,0.0002855711,0.012592693],"study_design_scores_gemma":[0.0007440396,0.000037085538,0.000039456794,0.00018128262,0.0000467885,0.0000070340816,0.00009913626,0.9704337,0.0017124307,0.00020809894,0.026084939,0.00040597963],"about_ca_topic_score_codex":0.000021827896,"about_ca_topic_score_gemma":0.00021844663,"teacher_disagreement_score":0.9232128,"about_ca_system_score_codex":0.00016007778,"about_ca_system_score_gemma":0.000030490384,"threshold_uncertainty_score":0.99983317},"labels":[],"label_agreement":null},{"id":"W3140719572","doi":"10.1109/tnet.2021.3066558","title":"Multi-Persona Mobility: Joint Cost-Effective and Resource-Aware Mobile-Edge Computation Offloading","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; École de technologie supérieure; Lebanese American University","keywords":"Computer science; Computation offloading; Mobile device; Mobile computing; Mobile edge computing; Context (archaeology); Edge computing; Computer network; Distributed computing; Enhanced Data Rates for GSM Evolution; Server; Operating system; Telecommunications","score_opus":0.04643610454694119,"score_gpt":0.28222713604103894,"score_spread":0.23579103149409775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140719572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035922028,0.00051148,0.9547081,0.00020439691,0.007125398,0.0009419907,0.0000016303229,0.00040527087,0.00017971412],"genre_scores_gemma":[0.9650279,0.000053158547,0.0328742,0.0003810406,0.0012649469,0.00023772873,0.000008350662,0.000042562773,0.00011005982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974301,0.0003191628,0.00041648102,0.0009324968,0.00031001066,0.00059175905],"domain_scores_gemma":[0.99818796,0.00068924425,0.00013728921,0.0006310082,0.00016095943,0.00019355868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005285003,0.00032971663,0.000378195,0.00020843426,0.0009234217,0.00037235016,0.0003681492,0.00016231115,0.0000037941993],"category_scores_gemma":[0.00002009404,0.00036304464,0.00017911867,0.0008781427,0.00008341249,0.00035649096,0.000051760857,0.00061105576,0.000019189054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018116343,0.0002151648,0.00015442584,0.000056749133,0.00007891209,0.00005977694,0.0031575488,0.05838605,0.0009020686,0.000008335757,0.00026909387,0.9366937],"study_design_scores_gemma":[0.0011084479,0.00016309679,0.0012604103,0.00042373932,0.000049121805,0.00013737165,0.00032843792,0.979179,0.0056022704,0.0002576681,0.010945765,0.00054464734],"about_ca_topic_score_codex":0.000024857918,"about_ca_topic_score_gemma":0.0000157772,"teacher_disagreement_score":0.9361491,"about_ca_system_score_codex":0.00023505486,"about_ca_system_score_gemma":0.00008012451,"threshold_uncertainty_score":0.99988216},"labels":[],"label_agreement":null},{"id":"W3141077842","doi":"10.1109/tnet.2021.3068339","title":"Dynamic Property Enforcement in Programmable Data Planes","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; National Science Foundation","keywords":"Computer science; Scalability; Correctness; Forwarding plane; Distributed computing; Overhead (engineering); Latency (audio); Software-defined networking; Embedded system; Computer network; Operating system; Programming language; Network packet","score_opus":0.056886858641739764,"score_gpt":0.28112603905830325,"score_spread":0.2242391804165635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141077842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011264625,0.00074718404,0.9934298,0.0008144658,0.0023348136,0.0003418315,0.000010726177,0.00037672292,0.0008180162],"genre_scores_gemma":[0.9262291,0.0007215405,0.07076726,0.0005775305,0.0002078165,0.00010733409,0.000076873985,0.000037927213,0.0012745892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774384,0.00010027508,0.00037614972,0.00082723,0.00034066098,0.0006118664],"domain_scores_gemma":[0.99745685,0.00019624464,0.00007421339,0.0021189016,0.00004928209,0.000104532526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036021404,0.0002326173,0.00024954148,0.000121489866,0.0002680365,0.00029812637,0.0015276121,0.000110106004,0.000049822916],"category_scores_gemma":[0.000010411227,0.00019078552,0.0000669363,0.0010653863,0.00003267306,0.0004817346,0.000071935734,0.00041512406,0.00003477104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026509244,0.0002917565,0.00038802336,0.000029987561,0.000055567085,0.00020361853,0.00024454642,0.15823287,0.00004128367,0.00021507725,0.0005378914,0.8397329],"study_design_scores_gemma":[0.00079713773,0.00010609252,0.00015153749,0.00033319416,0.00002451817,0.00010773894,0.000058024045,0.8922526,0.00020325344,0.0010972753,0.10441554,0.0004530871],"about_ca_topic_score_codex":0.000114790804,"about_ca_topic_score_gemma":0.0012038412,"teacher_disagreement_score":0.92510265,"about_ca_system_score_codex":0.000106718624,"about_ca_system_score_gemma":0.00015438926,"threshold_uncertainty_score":0.7780008},"labels":[],"label_agreement":null},{"id":"W3156584142","doi":"10.1109/tnet.2021.3071488","title":"How Do You Earn Money on Live Streaming Platforms?—A Study of Donation-Based Markets","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Chinese University of Hong Kong","keywords":"Stochastic game; Donation; Computer science; Fraction (chemistry); Service (business); Upper and lower bounds; Business; Microeconomics; Marketing; Economics; Mathematics","score_opus":0.029968937007925512,"score_gpt":0.241565742154676,"score_spread":0.21159680514675047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156584142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862397,0.00010867887,0.008815121,0.00036312127,0.0017757574,0.0004808727,0.000007328321,0.00016655673,0.0020429206],"genre_scores_gemma":[0.9985347,0.000023014572,0.00019452236,0.00023001341,0.00051442074,0.000050694394,0.000018541943,0.00005484642,0.00037925018],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99817836,0.000038573406,0.0003497932,0.0005135575,0.0005401526,0.00037954937],"domain_scores_gemma":[0.9983887,0.0004474162,0.0002646284,0.00063617795,0.00023512814,0.000027941114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000396046,0.0003094583,0.00033746375,0.0004397957,0.0005071171,0.000428177,0.00029141494,0.000110449306,0.00028399786],"category_scores_gemma":[0.000043557713,0.00031564146,0.00018075404,0.0009598511,0.00003205131,0.000512989,0.000015459253,0.00042140516,0.000019608786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000633296,0.0024203914,0.08306771,0.00021744259,0.0003206985,0.0001580821,0.0006833279,0.04345115,0.00065755827,0.00006273276,0.00023214314,0.86809546],"study_design_scores_gemma":[0.035067003,0.0014303928,0.5308594,0.00824584,0.0072554457,0.000047994236,0.058618136,0.26261315,0.009040895,0.002794291,0.07542798,0.008599462],"about_ca_topic_score_codex":0.00021839816,"about_ca_topic_score_gemma":0.00072276226,"teacher_disagreement_score":0.859496,"about_ca_system_score_codex":0.00006115014,"about_ca_system_score_gemma":0.00004595776,"threshold_uncertainty_score":0.99992955},"labels":[],"label_agreement":null},{"id":"W3189232707","doi":"10.1109/tnet.2021.3094839","title":"Graph-Based Namespaces and Load Sharing for Efficient Information Dissemination","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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":"National Institute of Standards and Technology; National Science Foundation","keywords":"Computer science; Scalability; Namespace; Distributed computing; Graph; Dissemination; Load balancing (electrical power); Computer network; Workload; Theoretical computer science; Operating system; Grid","score_opus":0.016498251722111865,"score_gpt":0.24520414887140804,"score_spread":0.22870589714929618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189232707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042943493,0.0001992699,0.95457625,0.0007751415,0.0010979283,0.00014748162,0.0000049579294,0.00015012296,0.000105334526],"genre_scores_gemma":[0.9933813,0.000036414207,0.0061390116,0.00024494817,0.00006364006,0.000045354845,0.000006840205,0.0000066075017,0.00007586677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.000025422258,0.00018914008,0.0002603501,0.00022578434,0.00020411162],"domain_scores_gemma":[0.99910676,0.00025935416,0.0000711267,0.0003608682,0.00014473492,0.000057140624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594502,0.00011636456,0.000108492655,0.00013043357,0.00038994008,0.00034922213,0.00023591034,0.00005497637,0.0000021293201],"category_scores_gemma":[0.00001878577,0.00012296642,0.000092187955,0.0003615809,0.000018272534,0.00035376832,0.000008159397,0.00013009831,0.0000028348709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447859,0.00010637783,0.00012638757,0.000068181864,0.000041352832,0.000004718179,0.001135554,0.43698695,0.001479399,0.0009343537,0.0001619006,0.55891],"study_design_scores_gemma":[0.00043083535,0.000052666885,0.00015126361,0.00022011521,0.000022366256,0.00000962083,0.000092250084,0.9933421,0.003314342,0.00044043953,0.0017417289,0.00018228959],"about_ca_topic_score_codex":0.000013794925,"about_ca_topic_score_gemma":0.000028108148,"teacher_disagreement_score":0.95043784,"about_ca_system_score_codex":0.00007220552,"about_ca_system_score_gemma":0.000052756128,"threshold_uncertainty_score":0.5014425},"labels":[],"label_agreement":null},{"id":"W3205923723","doi":"10.1109/tnet.2021.3118006","title":"Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth Tomography","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Bandwidth (computing); Computer science; Inference; Artificial intelligence; Path (computing); Inverse; Algorithm; Mathematics; Computer network","score_opus":0.012964939210906998,"score_gpt":0.2284827704830011,"score_spread":0.21551783127209412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205923723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014371254,0.0004114298,0.9826254,0.0006175236,0.0012850076,0.00015782546,6.7334946e-7,0.00019681634,0.00033406142],"genre_scores_gemma":[0.99101585,0.00026262164,0.0080272835,0.00041938873,0.00012304613,0.000047646427,0.0000035515848,0.000011583936,0.00008902442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983604,0.00016729307,0.00033134967,0.0005009577,0.00026515115,0.0003748799],"domain_scores_gemma":[0.998883,0.0003716984,0.00009820396,0.00044385938,0.00008707431,0.00011613626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025638912,0.00020323855,0.0002228698,0.00020562096,0.0003455342,0.0002539265,0.00026429456,0.000108611624,0.00003111058],"category_scores_gemma":[0.00001269727,0.00022151436,0.000090839036,0.000928782,0.0000849568,0.00025204598,0.000009534995,0.00048548324,0.000005613037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021485368,0.000043185206,0.0014419843,0.000009045365,0.000020696654,0.00002662528,0.000116617884,0.5556775,0.00003537748,0.00074269,0.000014745133,0.44185007],"study_design_scores_gemma":[0.0014739431,0.0001699886,0.00087168626,0.0002770486,0.000025674684,0.00003136245,0.00006229609,0.99075216,0.0004125561,0.001208708,0.004357457,0.00035714734],"about_ca_topic_score_codex":0.000017637263,"about_ca_topic_score_gemma":0.00013213554,"teacher_disagreement_score":0.9766446,"about_ca_system_score_codex":0.00005711329,"about_ca_system_score_gemma":0.0001534693,"threshold_uncertainty_score":0.90330935},"labels":[],"label_agreement":null},{"id":"W4205177387","doi":"10.1109/tnet.2021.3126203","title":"Accelerating Reads With In-Network Consistency-Aware Load Balancing","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Distributed systems and fault tolerance","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Load balancing (electrical power); Pipeline (software); Latency (audio); Distributed computing; Consistency (knowledge bases); Network packet; Associative array; Computer network; Real-time computing; Operating system; Grid; Artificial intelligence","score_opus":0.02511280640174448,"score_gpt":0.24210917407825333,"score_spread":0.21699636767650884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205177387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057185944,0.0008748871,0.9867891,0.00048164872,0.002214405,0.00019949095,0.000007364632,0.00025734198,0.0034571888],"genre_scores_gemma":[0.9764537,0.000070315786,0.022203002,0.00046807827,0.0004384676,0.000055927583,0.000005437901,0.000027072092,0.00027800436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973562,0.00016419984,0.0005219193,0.0007486729,0.0004935965,0.00071543327],"domain_scores_gemma":[0.9981362,0.00028981522,0.00015388368,0.0010676794,0.00021901887,0.00013340992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045883987,0.00029163048,0.00040904776,0.000071569804,0.00059188675,0.00038185556,0.0006379336,0.00013908738,0.000020217032],"category_scores_gemma":[0.000010848407,0.00028217278,0.00011062139,0.001609996,0.00004233194,0.00042397084,0.000017852246,0.0005642866,0.000020229805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061530605,0.0002942878,0.004049154,0.00010506193,0.00015707882,0.0011707605,0.0017702837,0.669935,0.00030894476,0.001731598,0.0010861058,0.3193302],"study_design_scores_gemma":[0.0051038093,0.00048544962,0.0043352926,0.008217673,0.00011077437,0.0013481501,0.0013102329,0.9220738,0.0037893762,0.0024978402,0.047776584,0.0029510113],"about_ca_topic_score_codex":0.000085781794,"about_ca_topic_score_gemma":0.0013222502,"teacher_disagreement_score":0.9707351,"about_ca_system_score_codex":0.00022945258,"about_ca_system_score_gemma":0.0003927366,"threshold_uncertainty_score":0.99996305},"labels":[],"label_agreement":null},{"id":"W4205907408","doi":"10.1109/tnet.2021.3135599","title":"Hybrid NOMA in Multi-Cell Networks: From a Centralized Analysis to Practical Schemes","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Noma; Telecommunications link; Single antenna interference cancellation; Scheduling (production processes); Simple (philosophy); Coding (social sciences); Upper and lower bounds; Power (physics); Multiplexing; Scheme (mathematics); Distributed computing; Mathematical optimization; Computer network; Algorithm; Telecommunications; Decoding methods; Mathematics","score_opus":0.03785111971195174,"score_gpt":0.2901773568484785,"score_spread":0.25232623713652674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205907408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05503273,0.0014335944,0.9415192,0.0003740478,0.0005173267,0.00018653907,0.00001974302,0.0008360487,0.00008079729],"genre_scores_gemma":[0.845644,0.001778077,0.15219055,0.00010835184,0.00005624583,0.00010140374,0.000031213523,0.000052039322,0.000038129998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982975,0.00010047345,0.0004708862,0.00042936843,0.00018602793,0.00051573734],"domain_scores_gemma":[0.997891,0.00056548667,0.000058843238,0.0013100783,0.000056485915,0.00011811745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010808196,0.00027775843,0.00043678426,0.0003640284,0.00013550787,0.00007853712,0.0004376478,0.00015950477,0.00009586847],"category_scores_gemma":[0.000038815688,0.00033546603,0.00019758187,0.0019388767,0.000039394927,0.00018864502,0.00002144954,0.0007898933,0.000031006737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021087586,0.000161142,0.00037247236,0.000005534291,0.0002678179,0.00004732227,0.00007963833,0.95894,0.0009793033,0.0000093231765,0.000060189574,0.03905612],"study_design_scores_gemma":[0.00085077167,0.00001565791,0.00053017196,0.000091226655,0.00018242859,0.0000047963217,0.00022520828,0.9601075,0.030172307,0.00014056836,0.007224777,0.00045460605],"about_ca_topic_score_codex":0.00003902407,"about_ca_topic_score_gemma":0.0006121083,"teacher_disagreement_score":0.79061127,"about_ca_system_score_codex":0.000227194,"about_ca_system_score_gemma":0.000028547847,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W4285236576","doi":"10.1109/tnet.2022.3183231","title":"CharmSeeker: Automated Pipeline Configuration for Serverless Video Processing","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"Shanghai Jiao Tong University; British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Computer science; Leverage (statistics); Pipeline transport; Pipeline (software); Cloud computing; Scalability; Distributed computing; Key (lock); Real-time computing; Embedded system; Artificial intelligence; Database; Operating system","score_opus":0.04848542494560888,"score_gpt":0.31927066374913754,"score_spread":0.27078523880352867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285236576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008587291,0.00013935968,0.9926288,0.0025929166,0.0019634767,0.0005646359,0.000014238308,0.0010735473,0.00016430725],"genre_scores_gemma":[0.9789092,0.000016175443,0.018122204,0.0015939992,0.00032146013,0.0005270329,0.0000272461,0.000030508125,0.00045215408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979267,0.00019360763,0.00044792597,0.0005362671,0.0004538478,0.00044166693],"domain_scores_gemma":[0.9987806,0.00021358061,0.00019924181,0.00059433654,0.00013034866,0.00008191226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007155249,0.0002097245,0.0002290488,0.00017118012,0.001539355,0.00032132227,0.0008394133,0.000055972745,0.000045070163],"category_scores_gemma":[0.000006331413,0.00023438626,0.00014230491,0.0007301526,0.000024153347,0.00059238885,0.000021009386,0.0003418457,0.0000096912545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009899339,0.00043564168,0.000011342117,0.0001107618,0.000055503104,0.000017000342,0.0019735768,0.33960703,0.0022619318,0.00063517346,0.0033919613,0.6514011],"study_design_scores_gemma":[0.0007793784,0.00016453637,0.000028319522,0.00006034365,0.0000294536,0.000022415315,0.00019705464,0.96850556,0.0044135978,0.00079563993,0.024698807,0.0003048835],"about_ca_topic_score_codex":0.000031227562,"about_ca_topic_score_gemma":0.000020134272,"teacher_disagreement_score":0.9780505,"about_ca_system_score_codex":0.00021434872,"about_ca_system_score_gemma":0.0001678112,"threshold_uncertainty_score":0.9997605},"labels":[],"label_agreement":null},{"id":"W4285252588","doi":"10.1109/tnet.2022.3174003","title":"An Anonymity Vulnerability in Tor","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Anonymity; Vulnerability (computing); Computer science; Computer security; Internet privacy","score_opus":0.024148166594408743,"score_gpt":0.2682630529693672,"score_spread":0.24411488637495846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285252588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16652212,0.000040792904,0.83107823,0.00023546486,0.0016216674,0.00012977271,0.0000032019386,0.00017926535,0.00018950891],"genre_scores_gemma":[0.9940099,0.000005332627,0.0052573667,0.00037368725,0.00019985663,0.00006127747,0.0000029141002,0.0000141678565,0.00007547977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976862,0.0004689458,0.0003881291,0.0006316568,0.00040501799,0.00042005128],"domain_scores_gemma":[0.9989119,0.00019707765,0.00008869886,0.0006740556,0.000033437755,0.00009478345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010904205,0.00017639624,0.00023642223,0.00020791386,0.0006325082,0.00013652594,0.0012797834,0.00005401494,0.00019244466],"category_scores_gemma":[0.0000058056303,0.00019050148,0.00016401976,0.00094823266,0.000029294772,0.00031944542,0.00002312691,0.0007619685,0.000009562494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018980052,0.0003312539,0.00022780681,0.0000032186417,0.000019469904,0.000024335273,0.0009990974,0.9136376,0.00004668879,0.0017265665,0.000057112655,0.08290788],"study_design_scores_gemma":[0.00025746223,0.00015661305,0.00034403114,0.000012692958,0.000010032173,0.000012458145,0.00013652729,0.99637645,0.00009138935,0.00016700072,0.0022117854,0.00022355907],"about_ca_topic_score_codex":0.00008742089,"about_ca_topic_score_gemma":0.00065572344,"teacher_disagreement_score":0.82748777,"about_ca_system_score_codex":0.0002544731,"about_ca_system_score_gemma":0.000056716144,"threshold_uncertainty_score":0.7768425},"labels":[],"label_agreement":null},{"id":"W4285505943","doi":"10.1109/tnet.2022.3188285","title":"Delay-Tolerant OCO With Long-Term Constraints: Algorithm and Its Application to Network Resource Allocation","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Calgary; Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Centre of Innovation","keywords":"Regret; Computer science; Mathematical optimization; Convex function; Term (time); Convex optimization; Benchmark (surveying); Online algorithm; Algorithm; Regular polygon; Mathematics","score_opus":0.05761274990379705,"score_gpt":0.35392292111505874,"score_spread":0.2963101712112617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285505943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008424963,0.00035704573,0.9878702,0.0010939955,0.0005432519,0.0013574003,0.000059856582,0.00014343107,0.00014985072],"genre_scores_gemma":[0.98198533,0.00006183836,0.014838126,0.00067641214,0.00066257664,0.0009410856,0.00003068924,0.00007130013,0.0007326657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484164,0.00045785872,0.00068778277,0.0011415422,0.0021030835,0.00076807156],"domain_scores_gemma":[0.9967609,0.0013377393,0.00024677222,0.0010183504,0.00029089386,0.00034530976],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021962707,0.0003175933,0.00038851332,0.00046130567,0.0018419707,0.00025309922,0.0010245618,0.000093549024,0.00028208754],"category_scores_gemma":[0.000044218872,0.00028838756,0.00009247177,0.002710549,0.00017527907,0.0003083668,0.000059713067,0.00081526086,0.000073024545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012123676,0.00006112013,0.0001128577,0.0000025134211,0.000028585864,0.000020684705,0.00022057135,0.4882105,0.00004498406,0.000013895225,0.00015458789,0.5110085],"study_design_scores_gemma":[0.00305386,0.001664502,0.0034469382,0.00023337704,0.00013158335,0.0008405926,0.0015526048,0.88785106,0.0007592536,0.0034766681,0.09541705,0.0015725141],"about_ca_topic_score_codex":0.000012960007,"about_ca_topic_score_gemma":0.00007820194,"teacher_disagreement_score":0.97356033,"about_ca_system_score_codex":0.0002864903,"about_ca_system_score_gemma":0.00012313983,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W4294068673","doi":"10.1109/tnet.2022.3198331","title":"Distributed Stable Multisource Global Broadcast for SINR-Based Wireless Multihop Networks","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Network packet; Computer science; Bounded function; Distributed algorithm; Computer network; Wireless network; Algorithm; Latency (audio); Wireless sensor network; Wireless; Distributed computing; Mathematics; Telecommunications","score_opus":0.021829212398229787,"score_gpt":0.2519617721337929,"score_spread":0.2301325597355631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294068673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002928078,0.00042135254,0.9884153,0.00043152028,0.0053083547,0.0012664197,0.0003159406,0.0008487918,0.00006422402],"genre_scores_gemma":[0.9723388,0.000032714575,0.02480189,0.00067703763,0.00062875444,0.0011648539,0.00013944435,0.00007628693,0.00014024966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561256,0.00036479547,0.0006874741,0.0012273357,0.0007139315,0.0013939204],"domain_scores_gemma":[0.9965301,0.0009380704,0.00031642892,0.0017831331,0.00011202226,0.00032023015],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00067344774,0.00053704996,0.0005201254,0.00013282691,0.0022889907,0.0003596283,0.0023480374,0.00020117972,0.00006522343],"category_scores_gemma":[0.000010015316,0.00063374476,0.000420098,0.0018845183,0.00009486493,0.00033902985,0.000081170074,0.0009263561,0.000008580807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012207423,0.00030863407,0.00014406118,0.000010161854,0.000057461144,0.000018677343,0.00005265028,0.72167885,0.000025320027,0.00017418624,0.0009451789,0.27646273],"study_design_scores_gemma":[0.0018867056,0.00037167888,0.000083740575,0.000059274433,0.00005350211,0.000030186744,0.0000488583,0.93722016,0.00010711729,0.0002574549,0.059261598,0.00061974366],"about_ca_topic_score_codex":0.0000764436,"about_ca_topic_score_gemma":0.00010043852,"teacher_disagreement_score":0.9694107,"about_ca_system_score_codex":0.0008398032,"about_ca_system_score_gemma":0.00018700567,"threshold_uncertainty_score":0.9996114},"labels":[],"label_agreement":null},{"id":"W4312517346","doi":"10.1109/tnet.2022.3213426","title":"Fair Multi-Resource Allocation in Heterogeneous Servers With an External Resource Type","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":23,"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":"Server; Resource allocation; Computer science; Resource management (computing); Mobile edge computing; Shared resource; Max-min fairness; Resource (disambiguation); Computer network; Upload; Distributed computing; Game theory; Microeconomics; Economics","score_opus":0.027815715109475114,"score_gpt":0.2447873800142804,"score_spread":0.2169716649048053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312517346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44106826,0.00009160521,0.5572201,0.00036105362,0.000509317,0.0002655511,0.0000011399367,0.00032289638,0.00016006228],"genre_scores_gemma":[0.98912036,0.0000029672524,0.009666587,0.00053389446,0.00016377025,0.000048740694,0.000002798696,0.00003446978,0.0004264351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977744,0.00033118727,0.0002582395,0.00066571956,0.00051314465,0.00045728567],"domain_scores_gemma":[0.99864763,0.000106062515,0.00011845011,0.0009867303,0.000026849797,0.00011429378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004558637,0.00022919255,0.00018669653,0.00029203962,0.0007262911,0.00014791972,0.0012894922,0.0000422078,0.000012277505],"category_scores_gemma":[0.0000020982686,0.00023104365,0.00007734003,0.0010700654,0.000033822827,0.00005134413,0.000065308035,0.000527908,0.0000072473827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007644038,0.0002633856,0.00014687119,0.0000061750147,0.000022759777,0.00006882077,0.0016251885,0.89542925,0.000037812337,0.000021212514,0.000022026483,0.10228007],"study_design_scores_gemma":[0.00081977656,0.0006615413,0.00029269516,0.00007406703,0.000017616674,0.00009547505,0.00036592313,0.9813353,0.00015181338,0.000073349634,0.01577561,0.0003368239],"about_ca_topic_score_codex":0.0001409685,"about_ca_topic_score_gemma":0.00018945424,"teacher_disagreement_score":0.5480521,"about_ca_system_score_codex":0.00024761495,"about_ca_system_score_gemma":0.0000373753,"threshold_uncertainty_score":0.94216865},"labels":[],"label_agreement":null},{"id":"W4313887518","doi":"10.1109/tnet.2023.3233953","title":"6Scan: A High-Efficiency Dynamic Internet-Wide IPv6 Scanner With Regional Encoding","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Science and Technology Program of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; IPv6; Scanner; IPv4; The Internet; Identifier; Encoding (memory); Asynchronous communication; Address space; IPv6 address; Network packet; Computer network; Distributed computing; Artificial intelligence; World Wide Web","score_opus":0.020793596242129165,"score_gpt":0.23665176167806332,"score_spread":0.21585816543593414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313887518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044515863,0.000067270135,0.948067,0.0017354179,0.0036457959,0.00026268014,0.0000021785506,0.0010644175,0.0006393502],"genre_scores_gemma":[0.99224734,0.00024975825,0.0053654527,0.00061003,0.00035649733,0.00007557433,0.000005777201,0.000040305982,0.0010492752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973425,0.00012853659,0.0003881845,0.00081645156,0.00060442486,0.0007198816],"domain_scores_gemma":[0.99831,0.00041027853,0.00015248342,0.00086836604,0.00008864307,0.00017017397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044493875,0.00031988684,0.00026988186,0.00052322174,0.0006738941,0.00027599433,0.0010965535,0.00015512454,0.000077541146],"category_scores_gemma":[0.000008853665,0.00029404496,0.00015097186,0.0026428045,0.00010984428,0.0005579598,0.0000326278,0.00063688634,0.0001909067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018504997,0.00024631122,0.000101185295,0.000036650326,0.00014515103,0.00014546457,0.0022028163,0.62014997,0.00045920527,0.0026361737,0.0034188223,0.37027323],"study_design_scores_gemma":[0.000695254,0.00047149527,0.0004185122,0.00042095815,0.000032624073,0.000113953785,0.00008292926,0.9709291,0.00090640626,0.0025914826,0.02273345,0.00060387753],"about_ca_topic_score_codex":0.00013618487,"about_ca_topic_score_gemma":0.0004483692,"teacher_disagreement_score":0.94773144,"about_ca_system_score_codex":0.00020386786,"about_ca_system_score_gemma":0.00008606215,"threshold_uncertainty_score":0.9999512},"labels":[],"label_agreement":null},{"id":"W4365790250","doi":"10.1109/tnet.2023.3264583","title":"Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"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; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Scheduling (production processes); Computer science; Queue; Real-time computing; Distributed computing; Mathematical optimization; Mathematics; Computer network","score_opus":0.016335534703965728,"score_gpt":0.23649131461318515,"score_spread":0.22015577990921942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365790250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065039443,0.00008731936,0.9885792,0.00044856747,0.00087014434,0.0006241351,0.000006540423,0.0027813686,0.000098748074],"genre_scores_gemma":[0.89367527,0.00016890978,0.10419736,0.00015811475,0.0003239408,0.00015059453,0.00003180529,0.000100604666,0.0011934204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657124,0.00020166478,0.00055193,0.0010612815,0.00053467124,0.0010792343],"domain_scores_gemma":[0.9975738,0.0006056503,0.00021218315,0.0013067295,0.00016180814,0.0001398358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054509984,0.00049576396,0.0005213118,0.0007655559,0.0005271849,0.00027269157,0.001460005,0.0003332842,0.00004660644],"category_scores_gemma":[0.00001980468,0.00049882993,0.00013723336,0.0053803683,0.0001576261,0.00054858846,0.000065290114,0.00091597176,0.00064414414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033835506,0.00008348466,0.0000610426,0.0000069151065,0.000067954374,0.000058603247,0.00020702384,0.87965184,0.00021926481,0.000013617647,0.000121853,0.11947456],"study_design_scores_gemma":[0.0011206372,0.00012067366,0.00013704374,0.00047787814,0.0000231573,0.0000143459165,0.000062195824,0.9928557,0.004253345,0.00020314753,0.00015475231,0.00057708216],"about_ca_topic_score_codex":0.000017214576,"about_ca_topic_score_gemma":0.000054292468,"teacher_disagreement_score":0.8871713,"about_ca_system_score_codex":0.00025804044,"about_ca_system_score_gemma":0.00012731382,"threshold_uncertainty_score":0.9997463},"labels":[],"label_agreement":null},{"id":"W4376607990","doi":"10.1109/tnet.2023.3268982","title":"Graph-Tensor Neural Networks for Network Traffic Data Imputation","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Imputation (statistics); Artificial neural network; Data mining; Graph; Traffic generation model; Algorithm; Artificial intelligence; Missing data; Theoretical computer science; Machine learning; Computer network","score_opus":0.05153299197999835,"score_gpt":0.28153342578009444,"score_spread":0.2300004338000961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001705962,0.00056213315,0.9828049,0.0021109153,0.009721646,0.0009161739,0.000027344744,0.0021062016,0.0000447051],"genre_scores_gemma":[0.9779167,0.00034738702,0.016103633,0.0010963915,0.003671906,0.00031159524,0.00015949635,0.0000861316,0.00030675498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609476,0.0002121461,0.0006711696,0.0012763013,0.0004494766,0.0012961164],"domain_scores_gemma":[0.995605,0.0015621999,0.00022984641,0.0022039649,0.00014182585,0.00025717326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001101139,0.0004526686,0.00045168577,0.00029054724,0.0011370191,0.00042815803,0.0026616722,0.00025225186,0.000011727487],"category_scores_gemma":[0.000021467644,0.00046919778,0.0002930836,0.002635101,0.00008106038,0.0007414923,0.00005122652,0.0005659181,0.000050495182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000429151,0.000029714769,0.000009284725,0.00000592045,0.00005858786,0.0000085418615,0.00004163205,0.54187024,0.0000010455037,0.0002769351,0.006345431,0.45130974],"study_design_scores_gemma":[0.0010631824,0.00017422224,0.00010079519,0.00007435392,0.000088751265,0.000021953407,0.000022152084,0.98526925,0.0000025950983,0.0012871601,0.0114127165,0.00048284032],"about_ca_topic_score_codex":0.0000054549228,"about_ca_topic_score_gemma":0.00008479661,"teacher_disagreement_score":0.9762108,"about_ca_system_score_codex":0.000058609323,"about_ca_system_score_gemma":0.00007511214,"threshold_uncertainty_score":0.99977595},"labels":[],"label_agreement":null},{"id":"W4390968202","doi":"10.1109/tnet.2023.3348950","title":"GLAC: High-Precision Tracking of Mobile Objects With COTS RFID Systems","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Position (finance); Inference; Artificial intelligence; Tracking (education)","score_opus":0.010852880440162378,"score_gpt":0.21899056195003105,"score_spread":0.20813768150986867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390968202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08793246,0.0033446914,0.9003,0.000013445871,0.005009501,0.0004303224,0.000023604725,0.0022759847,0.0006699505],"genre_scores_gemma":[0.99800146,0.00059763994,0.000898916,0.0000075767634,0.00021663881,0.000096279255,0.000006146888,0.00008431595,0.00009104373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987126,0.000028747794,0.00037163094,0.00027680333,0.00028639415,0.00032382127],"domain_scores_gemma":[0.99916905,0.00024381738,0.000038323153,0.00044276862,0.00005949007,0.000046531804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015171942,0.00024254352,0.00029568485,0.00033295908,0.0001324989,0.000118970354,0.00025270268,0.00019723928,0.000026495252],"category_scores_gemma":[0.000004156849,0.00021265764,0.00008812478,0.0008774506,0.000058387388,0.00019572231,0.0000032759287,0.00038524668,0.000021595846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019201445,0.00002264133,0.000022049137,0.00022651658,0.00008414602,0.00001857814,0.00031621827,0.8824835,0.0014954547,0.00011119788,0.00009489798,0.1151056],"study_design_scores_gemma":[0.0011512686,0.0006146512,0.000109365996,0.005140388,0.00025845127,0.00011531557,0.001469162,0.80275273,0.16725037,0.00066526106,0.019403225,0.0010697925],"about_ca_topic_score_codex":0.00003146955,"about_ca_topic_score_gemma":0.000036952642,"teacher_disagreement_score":0.910069,"about_ca_system_score_codex":0.000119944365,"about_ca_system_score_gemma":0.00002582005,"threshold_uncertainty_score":0.86719275},"labels":[],"label_agreement":null},{"id":"W4393032351","doi":"10.1109/tnet.2024.3377655","title":"More Than Enough is Too Much: Adaptive Defenses Against Gradient Leakage in Production Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Privacy-Preserving Technologies in Data","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; Leakage (economics); Computation; Information leakage; Gradient descent; Artificial intelligence; Computer security; Machine learning; Algorithm; Artificial neural network","score_opus":0.04892456912357768,"score_gpt":0.27583562187992894,"score_spread":0.22691105275635126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393032351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08880569,0.0011662884,0.8791706,0.02119679,0.005318349,0.0005440463,0.00001321014,0.0033114331,0.00047359595],"genre_scores_gemma":[0.9655968,0.0006922531,0.032853313,0.00022044896,0.00022718072,0.00009609673,0.000009514178,0.00004828217,0.00025611036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970566,0.00017870095,0.00042732386,0.0012099915,0.000434465,0.0006929166],"domain_scores_gemma":[0.99641615,0.00029930795,0.00009481977,0.0030459217,0.00006914199,0.000074654025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052257266,0.0003569057,0.00028229598,0.00057599915,0.000604897,0.00053058204,0.005189684,0.00022094729,0.0000070443366],"category_scores_gemma":[0.00047722517,0.0003667559,0.00013440246,0.0022793517,0.000120654506,0.000974698,0.00079198676,0.0013995536,0.000047388687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006967248,0.0002795781,0.00023667788,0.00009430331,0.00022038787,0.0003556024,0.004120068,0.095789626,0.0019395462,0.00031525575,0.020802142,0.8757771],"study_design_scores_gemma":[0.00031267668,0.00025536894,0.00022391189,0.001196709,0.000033792192,0.00008099075,0.000740202,0.9490164,0.019560307,0.013257659,0.014552066,0.0007699328],"about_ca_topic_score_codex":0.00010039122,"about_ca_topic_score_gemma":0.00014832454,"teacher_disagreement_score":0.8767911,"about_ca_system_score_codex":0.0004029399,"about_ca_system_score_gemma":0.00009783596,"threshold_uncertainty_score":0.99987847},"labels":[],"label_agreement":null},{"id":"W4393404821","doi":"10.1109/tnet.2024.3382269","title":"MAMS: Mobility-Aware Multipath Scheduler for MPQUIC","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":20,"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; Compute Canada","keywords":"Computer science; Multipath propagation; Multipath TCP; Computer network","score_opus":0.048181466703105746,"score_gpt":0.30995818041616,"score_spread":0.2617767137130543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393404821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007357634,0.0007238849,0.98972255,0.00041168454,0.004574722,0.0009997318,0.000017089944,0.0025727036,0.00024186338],"genre_scores_gemma":[0.8677273,0.00006177262,0.13014323,0.0002037221,0.00058694946,0.0007294763,0.0000029065818,0.00006175438,0.00048290743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975555,0.00014306734,0.00047661923,0.00090185157,0.00034559768,0.0005773839],"domain_scores_gemma":[0.9975534,0.0007596878,0.000068509835,0.0013847494,0.00010104538,0.00013257434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080839987,0.0003177029,0.0002998378,0.0003172678,0.00035009184,0.0004655357,0.0011825311,0.00022025994,0.000017370274],"category_scores_gemma":[0.000011185809,0.00030978982,0.00031138957,0.0008281508,0.00005359144,0.0005981397,0.000015506967,0.00048093748,0.00006908563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056206885,0.0004175625,0.0000410319,0.0007234593,0.00030787388,0.00008496326,0.0023263227,0.025456756,0.0040555405,0.0066804113,0.0056345426,0.95421535],"study_design_scores_gemma":[0.000384949,0.0003332463,0.0000127819085,0.0011891833,0.000056114666,0.000069206784,0.000068009,0.92232364,0.017197866,0.013251975,0.044412468,0.0007005465],"about_ca_topic_score_codex":0.000027906039,"about_ca_topic_score_gemma":0.00003090513,"teacher_disagreement_score":0.95351475,"about_ca_system_score_codex":0.00023182237,"about_ca_system_score_gemma":0.000114064205,"threshold_uncertainty_score":0.99993545},"labels":[],"label_agreement":null},{"id":"W4393404835","doi":"10.1109/tnet.2024.3383479","title":"Accurate Prediction of Network Distance via Federated Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Machine Learning and ELM","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":"National Natural Science Foundation of China; European Commission","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Machine learning","score_opus":0.017164375861791623,"score_gpt":0.24907826946750833,"score_spread":0.2319138936057167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393404835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006381102,0.00078310195,0.9920887,0.00028818456,0.003911605,0.00016568534,8.769354e-7,0.0008069561,0.0013168125],"genre_scores_gemma":[0.9937053,0.00028049416,0.004460093,0.000084664745,0.00055817986,0.00003281861,0.000008808675,0.000030181449,0.00083947123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980442,0.0001633094,0.0004642212,0.00049770786,0.00036047527,0.00047010195],"domain_scores_gemma":[0.99897456,0.00027937416,0.00012646314,0.0004589683,0.00006341144,0.000097232834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049448037,0.00023436657,0.00022874343,0.0001447443,0.0006277005,0.00031281746,0.00046550127,0.00010959048,0.000041286516],"category_scores_gemma":[0.000009359666,0.00022916138,0.00014637016,0.0011346819,0.0000374565,0.0003924811,0.0000147174915,0.0006220658,0.000037760477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018412986,0.00001990618,0.000045372584,0.00003661058,0.00006297786,0.000009155889,0.00034106,0.7820867,0.000071341594,0.0002978097,0.00021649782,0.21679421],"study_design_scores_gemma":[0.00018533229,0.00018079167,0.000094395764,0.0004008976,0.000029674287,0.000016832913,0.000013501817,0.9735738,0.000221681,0.00055837753,0.024543194,0.00018151988],"about_ca_topic_score_codex":0.00004395047,"about_ca_topic_score_gemma":0.000031389856,"teacher_disagreement_score":0.9930672,"about_ca_system_score_codex":0.000099111785,"about_ca_system_score_gemma":0.00004995724,"threshold_uncertainty_score":0.934493},"labels":[],"label_agreement":null},{"id":"W4394564161","doi":"10.1109/tnet.2024.3384839","title":"Communication Efficient Compressed and Accelerated Federated Learning in Open RAN Intelligent Controllers","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":12,"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":"Mitacs","keywords":"Ran; Computer science; C-RAN; Distributed computing; Computer network; Radio access network","score_opus":0.09159896378776836,"score_gpt":0.32041495351794325,"score_spread":0.2288159897301749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394564161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6063543,0.0010078037,0.3737302,0.005047071,0.0033978384,0.0028544434,0.0000122383735,0.0013840046,0.0062120724],"genre_scores_gemma":[0.998453,0.00047206003,0.0000916481,0.0003455211,0.000040209667,0.0001361325,0.000004723515,0.000034237153,0.00042241716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808943,0.00056125235,0.0003770211,0.0005191407,0.00018529351,0.00026787905],"domain_scores_gemma":[0.9985357,0.0009630188,0.00007712046,0.00031215677,0.00003111792,0.00008088129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049727963,0.00018375002,0.00021014233,0.0002627923,0.0007046532,0.0009038605,0.00039120804,0.000093681454,0.000080775586],"category_scores_gemma":[0.00005457152,0.00018490618,0.00005134639,0.0009880046,0.00009831925,0.00018701232,0.000016668759,0.0007513538,0.000034963934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044665212,0.00028578678,0.000032600215,0.000037373553,0.000030378384,0.000020943437,0.0020295552,0.58992326,0.1131241,0.00033263172,0.00009859071,0.29363814],"study_design_scores_gemma":[0.0010053549,0.00007520693,0.00018887832,0.00032755008,0.00001792441,0.000022404656,0.00057675404,0.9387697,0.052037913,0.00012921695,0.0066173454,0.00023177554],"about_ca_topic_score_codex":0.00006496267,"about_ca_topic_score_gemma":0.000120974786,"teacher_disagreement_score":0.39209875,"about_ca_system_score_codex":0.00015109632,"about_ca_system_score_gemma":0.000049682443,"threshold_uncertainty_score":0.8715948},"labels":[],"label_agreement":null},{"id":"W4400409418","doi":"10.1109/tnet.2024.3424446","title":"AutoTomo: Learning-Based Traffic Estimator Incorporating Network Tomography","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Fundamental Research Funds for Central Universities of the Central South University; Fundamental Research Funds for the Central Universities; Beijing University of Posts and Telecommunications","keywords":"Network tomography; Tomography; Estimator; Computer science; Artificial intelligence; Environmental science; Geology; Statistics; Mathematics; Medicine; Radiology; Inference","score_opus":0.03598564231312523,"score_gpt":0.271309441805969,"score_spread":0.23532379949284377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400409418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046270754,0.0003246039,0.9335983,0.0016467505,0.010651007,0.00076365646,0.000012022227,0.0048211166,0.0019118363],"genre_scores_gemma":[0.9962771,0.000022252369,0.0015823108,0.0005886478,0.0008380875,0.00017658815,0.000004646057,0.00009493306,0.00041546518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734074,0.00034549294,0.0004617427,0.00084897364,0.0004445277,0.0005585107],"domain_scores_gemma":[0.99813575,0.0010292875,0.00013688148,0.00049093424,0.00003329465,0.00017385432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000460197,0.00033232136,0.00023620075,0.00038133873,0.0011895435,0.00044757972,0.00035984092,0.0001725214,0.00013709985],"category_scores_gemma":[0.000054802647,0.00034249597,0.00029501805,0.0025455307,0.00016279571,0.00024212647,0.000004018441,0.0011227465,0.00019148743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044266577,0.00007152622,0.00002315432,0.000039759514,0.000013848828,0.000039231538,0.00007670636,0.8347113,0.005069254,0.00020969877,0.00027604683,0.15942521],"study_design_scores_gemma":[0.0003234523,0.00022983705,0.00007522644,0.00039406616,0.000053797947,0.000056173812,0.000038949,0.960146,0.01404972,0.000623859,0.023575256,0.00043367303],"about_ca_topic_score_codex":0.00000414412,"about_ca_topic_score_gemma":0.000021030355,"teacher_disagreement_score":0.9500063,"about_ca_system_score_codex":0.00012753272,"about_ca_system_score_gemma":0.000121190205,"threshold_uncertainty_score":0.9999027},"labels":[],"label_agreement":null},{"id":"W4400770749","doi":"10.1109/tnet.2024.3426607","title":"Enhancing Low Latency Adaptive Live Streaming Through Precise Bandwidth Prediction","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Image and Video Quality Assessment","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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Live streaming; Computer science; Latency (audio); Low latency (capital markets); Bandwidth (computing); Computer network; Real-time computing; Telecommunications","score_opus":0.03482308548934951,"score_gpt":0.2891563329060424,"score_spread":0.25433324741669294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400770749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023092504,0.0008109215,0.989005,0.00038935055,0.0053874115,0.0003348533,0.000012051018,0.0008144414,0.0009366869],"genre_scores_gemma":[0.9595577,0.0004453781,0.03834305,0.00020867739,0.0008259856,0.00008889525,0.0000048654088,0.00003667023,0.0004887743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753594,0.00017859705,0.00047881168,0.00078916934,0.0004765798,0.00054089376],"domain_scores_gemma":[0.99845135,0.000531938,0.0000842586,0.0007498271,0.000081247475,0.00010135775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004255889,0.00030258627,0.00025214613,0.0001769627,0.0005231522,0.0005332737,0.00060606893,0.00014321682,0.00005064209],"category_scores_gemma":[0.0000076109563,0.0002978198,0.00021017816,0.0007948164,0.000044864217,0.0016316057,0.000020912368,0.0006212893,0.000125136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006733861,0.00044117574,0.000034145192,0.0002311201,0.00043922945,0.00022046971,0.02018379,0.100586355,0.0027869593,0.0023270342,0.0007477269,0.87193465],"study_design_scores_gemma":[0.0006751684,0.00075021427,0.00019505287,0.0039883284,0.00018966179,0.00008671252,0.0009172909,0.9360311,0.037027057,0.013439835,0.005755858,0.0009436972],"about_ca_topic_score_codex":0.00012587282,"about_ca_topic_score_gemma":0.000111304864,"teacher_disagreement_score":0.95724845,"about_ca_system_score_codex":0.0002662969,"about_ca_system_score_gemma":0.00016179336,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W4401879294","doi":"10.1109/tnet.2024.3444593","title":"Game-Theoretic Bandits for Network Optimization With High-Probability Swap-Regret Upper Bounds","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Regret; Swap (finance); Computer science; Mathematical optimization; Mathematical economics; Upper and lower bounds; Mathematics; Economics; Machine learning","score_opus":0.0798903136994101,"score_gpt":0.37092698617727515,"score_spread":0.291036672477865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401879294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002726146,0.00059238664,0.98931193,0.0011630827,0.004328113,0.0011490675,0.00007120568,0.00038054824,0.00027752045],"genre_scores_gemma":[0.92172533,0.00019077028,0.073547654,0.00014473098,0.0019479749,0.0004170436,0.000033819462,0.00012314471,0.0018695431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946058,0.0003502157,0.00083992846,0.001406179,0.0017427794,0.0010551079],"domain_scores_gemma":[0.99270195,0.0049942844,0.00015341285,0.0014005022,0.00048929156,0.00026055545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028928118,0.00043856882,0.0005334827,0.00046769704,0.0008473676,0.0011075127,0.0010262628,0.00024817552,0.00056267955],"category_scores_gemma":[0.00020184147,0.00032288476,0.00030256147,0.0029474809,0.00048700674,0.00071101903,0.000015103955,0.0007317307,0.000109591456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003209011,0.00006393555,0.00006017033,0.00003310445,0.0000783832,0.0000129758655,0.00014847972,0.90580064,0.0000054447187,0.0005257528,0.00096237956,0.09198785],"study_design_scores_gemma":[0.0009284607,0.0006090906,0.000083024934,0.00048030072,0.000107429245,0.000038045284,0.000073025585,0.78214055,0.00039972807,0.1856615,0.028899787,0.0005790685],"about_ca_topic_score_codex":0.000015262916,"about_ca_topic_score_gemma":0.00009403623,"teacher_disagreement_score":0.9189992,"about_ca_system_score_codex":0.00036300614,"about_ca_system_score_gemma":0.00026347916,"threshold_uncertainty_score":0.9999294},"labels":[],"label_agreement":null},{"id":"W4403183286","doi":"10.1109/tnet.2024.3470649","title":"Distributed Stable Multi-Source Dynamic Broadcasting for Wireless Multi-Hop Networks Under SINR-Based Adversarial Channel Jamming","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Security in Wireless Sensor Networks","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":"Simon Fraser University","funders":"Natural Science Foundation of Shandong Province; Simon Fraser University; National Natural Science Foundation of China","keywords":"Jamming; Computer science; Computer network; Adversarial system; Hop (telecommunications); Broadcasting (networking); Wireless network; Wireless; Channel (broadcasting); Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.037559570009831816,"score_gpt":0.27928787821002277,"score_spread":0.24172830820019095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403183286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00348379,0.0009794523,0.97928053,0.00064039516,0.012417436,0.0011014737,0.000084143685,0.0020036492,0.000009146282],"genre_scores_gemma":[0.9364789,0.00010429426,0.061135337,0.00035051195,0.0012364715,0.0002268496,0.000102149235,0.00019010612,0.00017534435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948482,0.00026411496,0.00090161443,0.0016367531,0.00059333065,0.0017560094],"domain_scores_gemma":[0.99534327,0.0024603163,0.0002509942,0.0013808438,0.00021880105,0.00034579475],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007928686,0.0007926047,0.000671503,0.0004486732,0.0013706428,0.0010920749,0.0016423545,0.000588326,0.000012447247],"category_scores_gemma":[0.000032561966,0.00088464585,0.00056194625,0.0020043142,0.00015816616,0.00072098576,0.000051196195,0.0014543444,0.000021135183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007903276,0.00022285413,0.000005235082,0.00008673694,0.00016496806,0.000033872762,0.00045529674,0.8508109,0.00020693296,0.00006591482,0.00011990023,0.14774837],"study_design_scores_gemma":[0.0020506412,0.00017882275,0.0000134862785,0.0010821145,0.00013819062,0.000032344393,0.00020605614,0.99189705,0.00042958825,0.0001227152,0.0029182346,0.0009307438],"about_ca_topic_score_codex":0.00012704321,"about_ca_topic_score_gemma":0.00038907462,"teacher_disagreement_score":0.93299514,"about_ca_system_score_codex":0.00069499755,"about_ca_system_score_gemma":0.00020696383,"threshold_uncertainty_score":0.99994487},"labels":[],"label_agreement":null}]}