{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17655288,0.0012650732,0.76460344,0.0006885191,0.00023797511,0.0009281903,0.0015873006,0.044133272,0.010003298],"genre_scores_gemma":[0.735772,0.00031664097,0.25740817,0.00020465862,0.00007075714,0.00029851738,0.0022414688,0.00030219683,0.00338554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992736,0.00016713835,0.00002942729,0.00016733116,0.00025439175,0.000108074106],"domain_scores_gemma":[0.99799865,0.00061647565,0.00029671498,0.0005825586,0.00027424382,0.00023129173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015374888,0.0008483855,0.00067532907,0.002299213,0.00074026146,0.0008214058,0.0022348918,0.0011614088,0.0019233961],"category_scores_gemma":[0.0037726434,0.00029143563,0.00033803002,0.00092328567,0.00067421264,0.0021792888,0.002673737,0.00072622177,0.00079829775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003289053,0.0011923788,0.020924076,0.000464698,0.00030646456,0.0009613003,0.000481478,0.20686054,0.048002627,0.016555663,0.05394785,0.64701384],"study_design_scores_gemma":[0.00022981403,0.00046391448,0.004282928,0.000027868096,0.00006133779,0.0005939036,0.00009069513,0.95069647,0.017324807,0.0049904766,0.021179251,0.000058650567],"about_ca_topic_score_codex":0.0027558291,"about_ca_topic_score_gemma":0.0031425252,"teacher_disagreement_score":0.0027558291,"about_ca_system_score_codex":0.0008235756,"about_ca_system_score_gemma":0.0009443482,"threshold_uncertainty_score":0.008131087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07894745,0.003144822,0.90555084,0.00092535623,0.00016821417,0.00008128738,0.00007492151,0.00013675571,0.010970386],"genre_scores_gemma":[0.9276824,0.003357016,0.065328695,0.00014384593,0.00021737494,0.000069648166,0.00007313892,0.00006016427,0.0030676466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949443,0.0002329452,0.0000186007,0.000055489872,0.00011839002,0.000080097685],"domain_scores_gemma":[0.9990132,0.00066332414,0.00009634573,0.000092691276,0.00009839994,0.00003603471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085742,0.0006138763,0.0004648686,0.0006882938,0.0006390008,0.00074788893,0.000935155,0.00059200596,0.001522932],"category_scores_gemma":[0.002721147,0.00022758216,0.00046515453,0.0007505875,0.00092834193,0.0014550767,0.00075453793,0.00078802137,0.00013833703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011348316,0.00005875627,0.00037503787,0.00012489675,0.000018803306,0.00008599702,0.00005983194,0.88579005,0.0029533596,0.068526395,0.0013553948,0.040538065],"study_design_scores_gemma":[0.0000052722494,0.000046387457,0.00010800146,0.000013164513,0.00000648306,0.000030274869,0.000028488195,0.971254,0.0007973092,0.02681276,0.00089098193,0.000006871511],"about_ca_topic_score_codex":0.0024246492,"about_ca_topic_score_gemma":0.0019778279,"teacher_disagreement_score":0.0024246492,"about_ca_system_score_codex":0.0013050411,"about_ca_system_score_gemma":0.0006795569,"threshold_uncertainty_score":0.009468794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04151964,0.0008711832,0.95472085,0.0004434039,0.000043740903,0.00003332527,0.000028839459,0.00018194309,0.0021571738],"genre_scores_gemma":[0.88835967,0.00094482535,0.10747209,0.0001467855,0.000071694834,0.00012325725,0.00004981553,0.000040656858,0.002791229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.000277307,0.000037957543,0.00012219796,0.00017342146,0.000046315967],"domain_scores_gemma":[0.9962515,0.0029541044,0.00029120824,0.00013234119,0.0003321709,0.00003868816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015596873,0.00088720035,0.000755618,0.0004671748,0.0003543402,0.00070127466,0.000851611,0.0011164114,0.0005786805],"category_scores_gemma":[0.00789592,0.00037136863,0.00027393078,0.0005977964,0.0008339878,0.0014235474,0.0008773612,0.0006425842,0.00016606523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009830853,0.00003011322,0.00051367626,0.00011038387,0.000032649954,0.000099537676,0.00011879869,0.93902177,0.007274506,0.015346631,0.0004185768,0.036935095],"study_design_scores_gemma":[0.0000103532775,0.000025813002,0.00006429512,0.0000041297335,0.0000038128144,0.000011807859,0.000007005866,0.9948808,0.0012053392,0.003599393,0.00018238407,0.0000048400093],"about_ca_topic_score_codex":0.0021198269,"about_ca_topic_score_gemma":0.0012941703,"teacher_disagreement_score":0.0021198269,"about_ca_system_score_codex":0.00078907644,"about_ca_system_score_gemma":0.0005084933,"threshold_uncertainty_score":0.008248508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45102417,0.0014646583,0.5364411,0.00057182566,0.00006364394,0.000111919006,0.0003537777,0.0014007185,0.008568233],"genre_scores_gemma":[0.99093807,0.00017216035,0.007925168,0.00006302215,0.000034771958,0.00003783322,0.00007876004,0.000039912768,0.0007103417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975164,0.00040197794,0.000110436034,0.00031123738,0.0011617362,0.0004980983],"domain_scores_gemma":[0.9920264,0.0032867722,0.0014347867,0.0012109285,0.0017559417,0.00028516006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023960595,0.00055711303,0.00073168223,0.0011452705,0.00065345113,0.0010727701,0.0016031999,0.00078566297,0.0010236679],"category_scores_gemma":[0.014202656,0.00029575403,0.00043641718,0.0015186671,0.001093333,0.0028480685,0.0011962326,0.0009998088,0.00030220317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029275435,0.0001136456,0.009110314,0.00014509347,0.000056231027,0.00029877166,0.00030303167,0.8930847,0.01696059,0.05491721,0.0013974097,0.023320187],"study_design_scores_gemma":[0.0000062969425,0.00004078215,0.0008028625,0.000004077501,0.0000096710755,0.000047794252,0.000022198661,0.9942834,0.0014519901,0.003103043,0.0002179794,0.000009892113],"about_ca_topic_score_codex":0.0082674725,"about_ca_topic_score_gemma":0.002925082,"teacher_disagreement_score":0.0082674725,"about_ca_system_score_codex":0.0022633688,"about_ca_system_score_gemma":0.0018136477,"threshold_uncertainty_score":0.016438663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10073347,0.00036970543,0.89601815,0.00011690336,0.000022027307,0.000085499276,0.00025676866,0.0008401948,0.001557334],"genre_scores_gemma":[0.9155977,0.0006021526,0.08205648,0.000060649836,0.000041109535,0.0001761682,0.00056116836,0.0000693354,0.0008352172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986518,0.00044597106,0.000081824706,0.0002542138,0.00037171168,0.0001945292],"domain_scores_gemma":[0.9885944,0.0086070625,0.0009992239,0.00070824585,0.00091497315,0.00017600787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029002246,0.0008278121,0.0011100185,0.0020242706,0.000468523,0.0012316639,0.0013441279,0.0010867486,0.0011221204],"category_scores_gemma":[0.016031222,0.0006468118,0.00070956117,0.0015136653,0.0007171435,0.0026357071,0.00075919984,0.0010983779,0.0004015614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011345987,0.000059600945,0.008448909,0.0000547205,0.000058776383,0.00012632424,0.00006264081,0.9528158,0.0024698297,0.015903972,0.00055417616,0.019331787],"study_design_scores_gemma":[0.0000027552485,0.000008895883,0.00036106686,0.0000033132487,0.00000554061,0.000021475229,0.000004164775,0.9969273,0.00036936929,0.0022122266,0.0000768726,0.000006989188],"about_ca_topic_score_codex":0.0095395325,"about_ca_topic_score_gemma":0.004413016,"teacher_disagreement_score":0.0095395325,"about_ca_system_score_codex":0.0015471316,"about_ca_system_score_gemma":0.0012117674,"threshold_uncertainty_score":0.018968046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910546,0.00007813164,0.0045335563,0.00016181458,0.000013118216,0.0000909016,0.0003318197,0.0003911257,0.0033450036],"genre_scores_gemma":[0.9967907,0.000029038205,0.0023943994,0.000037073652,0.000005010368,0.00002960907,0.00035836032,0.0000082808065,0.00034754764],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987864,0.00023954974,0.0000702072,0.00026573482,0.00044052713,0.00019753556],"domain_scores_gemma":[0.9968562,0.0008579098,0.0003793099,0.0002956915,0.0012443119,0.0003665772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452616,0.00055236096,0.00027078053,0.0013554629,0.00071864313,0.00078127376,0.0009435302,0.00055923633,0.0004983463],"category_scores_gemma":[0.00444183,0.00015824854,0.00012483011,0.0015053428,0.0004895747,0.0016967569,0.000646142,0.0008004565,0.00016472723],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021017555,0.002234908,0.5021325,0.0004394284,0.00029726778,0.0020571402,0.0039473386,0.08275134,0.10495696,0.013670954,0.013033347,0.27237704],"study_design_scores_gemma":[0.00011635247,0.001851346,0.43023938,0.0000734596,0.00014108354,0.001119556,0.0033978685,0.484324,0.065890476,0.0015903536,0.011114002,0.00014211347],"about_ca_topic_score_codex":0.022610335,"about_ca_topic_score_gemma":0.01501948,"teacher_disagreement_score":0.022610335,"about_ca_system_score_codex":0.0023156847,"about_ca_system_score_gemma":0.00060413964,"threshold_uncertainty_score":0.04495746},"labels":[],"label_agreement":null},{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","score_opus":0.018892686491035097,"score_gpt":0.22881789716586323,"score_spread":0.20992521067482814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013174072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07331382,0.00210954,0.87067014,0.0026640368,0.00046659395,0.00011059096,0.0001409444,0.00022795777,0.05029632],"genre_scores_gemma":[0.9340519,0.0012891345,0.04866744,0.00041826174,0.0007947644,0.00013234241,0.00006413138,0.00009066324,0.014491387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.0013139689,0.000097089476,0.0005057552,0.0009706675,0.0007810251],"domain_scores_gemma":[0.9952531,0.00305012,0.00051798933,0.00027035183,0.0005261974,0.00038227515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040208413,0.0012322705,0.001131628,0.0006564335,0.0016441443,0.003685366,0.0022390254,0.0016996777,0.005235863],"category_scores_gemma":[0.010702827,0.00064491585,0.00066955783,0.0011639827,0.0026903332,0.0056839716,0.0016923711,0.0021119355,0.00066317635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022234739,0.000074135336,0.00043115087,0.00009630751,0.00003144955,0.00016772732,0.0002676816,0.087519765,0.0013732814,0.897642,0.0020446314,0.010129583],"study_design_scores_gemma":[0.00007585231,0.00009644776,0.00022335326,0.000026847069,0.000033305016,0.00020379045,0.00010270963,0.44181544,0.00080420176,0.5487029,0.007890996,0.000024188705],"about_ca_topic_score_codex":0.0038875183,"about_ca_topic_score_gemma":0.0018649182,"teacher_disagreement_score":0.005235863,"about_ca_system_score_codex":0.0029993912,"about_ca_system_score_gemma":0.0031004718,"threshold_uncertainty_score":0.021762252},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098022334,0.00033293033,0.8971042,0.00021647409,0.000017528575,0.00005898565,0.000016306969,0.00017940396,0.004051899],"genre_scores_gemma":[0.83071613,0.0002552193,0.16720177,0.000072249466,0.000017522598,0.00006291298,0.000022961369,0.0000258217,0.0016253674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961406,0.00014666717,0.000017338874,0.00006604606,0.00011506395,0.000040708775],"domain_scores_gemma":[0.9992392,0.00031363222,0.00014730816,0.0001356056,0.00013781767,0.00002636849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008372411,0.00033865304,0.00017448144,0.00034889666,0.00041626132,0.00062508543,0.00089955097,0.0003871097,0.0007158233],"category_scores_gemma":[0.001865212,0.0002353783,0.00026876022,0.0002533365,0.0006629138,0.0012016359,0.0005999588,0.00045682598,0.00017510226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042443877,0.00016818303,0.0018792793,0.00021824236,0.000044716922,0.00018540633,0.00038322073,0.46941754,0.113863006,0.21586286,0.00096622464,0.19658683],"study_design_scores_gemma":[0.000029994315,0.00019059321,0.0002657439,0.000025088306,0.000015531637,0.000085805645,0.000034903787,0.9603548,0.01712006,0.020235417,0.0016277677,0.000014271511],"about_ca_topic_score_codex":0.00081203616,"about_ca_topic_score_gemma":0.0011972392,"teacher_disagreement_score":0.0011533689,"about_ca_system_score_codex":0.0011533689,"about_ca_system_score_gemma":0.0005209963,"threshold_uncertainty_score":0.008368313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023848101,0.00039050035,0.96800464,0.0006130355,0.000073853305,0.00019272891,0.00013188749,0.001832238,0.0049129706],"genre_scores_gemma":[0.7188197,0.0010553726,0.27434078,0.00033720786,0.00014739699,0.00048761652,0.00045554264,0.00029539468,0.0040609995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960146,0.0015564478,0.0002867691,0.0005447452,0.0011771772,0.00042031545],"domain_scores_gemma":[0.9925171,0.003097421,0.0009735367,0.0025031348,0.0006226524,0.00028603722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026162672,0.00096492446,0.00080994767,0.0015539548,0.0013934473,0.0032512518,0.00117671,0.0011999317,0.0024810373],"category_scores_gemma":[0.0074723186,0.00052064133,0.0007828436,0.0017944342,0.002643763,0.008748216,0.0034535055,0.0014289531,0.0009179775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004720939,0.00011416803,0.000808371,0.00024939064,0.000077817305,0.000375637,0.00072326936,0.17061481,0.014421451,0.7019685,0.005579649,0.104594834],"study_design_scores_gemma":[0.00012588136,0.00017171618,0.0002718776,0.00005108633,0.00005653819,0.00026136113,0.00021375915,0.40807533,0.011430438,0.5556073,0.02366429,0.00007042978],"about_ca_topic_score_codex":0.0021291727,"about_ca_topic_score_gemma":0.0014814734,"teacher_disagreement_score":0.0032512518,"about_ca_system_score_codex":0.0019238831,"about_ca_system_score_gemma":0.0016697088,"threshold_uncertainty_score":0.013958871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992806,0.0017462495,0.6524994,0.0030132728,0.00015164654,0.00017790588,0.0005510902,0.0008136547,0.041766256],"genre_scores_gemma":[0.963709,0.0017121853,0.028852671,0.00016029442,0.00008039053,0.000054482534,0.00013996042,0.00012166248,0.0051694275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994431,0.00018242297,0.000020468344,0.00005898755,0.00024021849,0.000054728822],"domain_scores_gemma":[0.99696463,0.001985055,0.0003571966,0.00021662902,0.00039341292,0.00008304678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093709765,0.00088793685,0.0006419044,0.0008590398,0.00054998166,0.0011373232,0.0010979673,0.0011077389,0.0024375871],"category_scores_gemma":[0.0078048036,0.00047679307,0.0005284474,0.0004846028,0.0006680924,0.0031693517,0.000615454,0.001528101,0.00033860913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054321703,0.00010418538,0.0011314827,0.00010169499,0.000021018395,0.00021837163,0.0002499375,0.8816932,0.0060591926,0.09980921,0.0011236205,0.009433731],"study_design_scores_gemma":[0.0000037299383,0.000021518073,0.00024954058,0.000009313928,0.000007298262,0.0000784311,0.000033504075,0.9877664,0.00075700646,0.010300076,0.0007646322,0.000008617927],"about_ca_topic_score_codex":0.0070643937,"about_ca_topic_score_gemma":0.0045755124,"teacher_disagreement_score":0.0070643937,"about_ca_system_score_codex":0.0015901633,"about_ca_system_score_gemma":0.0010183763,"threshold_uncertainty_score":0.01404655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029929483,0.00016262953,0.99458885,0.000059135215,0.000023090137,0.00003413191,0.000031836804,0.000105613726,0.0020017237],"genre_scores_gemma":[0.29223287,0.0007232344,0.7011955,0.00012570259,0.00006950224,0.00032392997,0.0003030788,0.00021570013,0.004810445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917656,0.00037874706,0.000030741463,0.00012387523,0.00017399708,0.00011606577],"domain_scores_gemma":[0.9987457,0.0007580833,0.0001055902,0.00018074703,0.00013231883,0.00007760951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046908,0.0014486589,0.0010139042,0.0008649329,0.0005068516,0.0013007729,0.0015188132,0.00091746816,0.005068011],"category_scores_gemma":[0.0028184403,0.00064944284,0.0010491043,0.0012383196,0.00077073334,0.0018983695,0.0017429164,0.0015487486,0.0007165761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053630018,0.00008708723,0.0001908234,0.00014154767,0.000039615938,0.00006776089,0.000069206704,0.8815945,0.0020284213,0.05882118,0.0020562026,0.05485],"study_design_scores_gemma":[0.0000041544813,0.000020188045,0.000025629226,0.0000069568496,0.0000049923333,0.00001971883,0.000012905288,0.98121786,0.00029697397,0.017694322,0.000692338,0.0000040494515],"about_ca_topic_score_codex":0.002030503,"about_ca_topic_score_gemma":0.0021550006,"teacher_disagreement_score":0.005068011,"about_ca_system_score_codex":0.0011067652,"about_ca_system_score_gemma":0.0010341692,"threshold_uncertainty_score":0.016954184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009759556,0.00024444342,0.9860372,0.00015066215,0.000026249409,0.00006814139,0.0000458828,0.00043561397,0.0032323094],"genre_scores_gemma":[0.31203386,0.00030524353,0.6829234,0.00027648738,0.0000438446,0.00042857585,0.00029063885,0.00016861618,0.0035293133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995827,0.00015815292,0.000016671993,0.000075369455,0.000105975814,0.000061164006],"domain_scores_gemma":[0.9995709,0.0002832329,0.000046951674,0.000025054364,0.00005069676,0.00002324006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008210462,0.0008293774,0.00081641873,0.0006279492,0.00038446192,0.00066511414,0.0013904587,0.00094352616,0.0030159699],"category_scores_gemma":[0.0012956582,0.0003742895,0.00065670913,0.0006872811,0.00060480996,0.00088752335,0.00087859144,0.00090536935,0.00044767992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005861485,0.000050062503,0.00027021804,0.00006557788,0.00003289795,0.00006934977,0.000062665145,0.9312439,0.0009664458,0.0074418196,0.0016451449,0.05809335],"study_design_scores_gemma":[0.000023249035,0.00002803941,0.00003438686,0.0000054704265,0.000006656972,0.00001654794,0.000012679616,0.99635774,0.0002995135,0.002334574,0.00087709446,0.000004049195],"about_ca_topic_score_codex":0.005199199,"about_ca_topic_score_gemma":0.005654541,"teacher_disagreement_score":0.005199199,"about_ca_system_score_codex":0.0008020068,"about_ca_system_score_gemma":0.0012432762,"threshold_uncertainty_score":0.010337889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106209,0.0019010551,0.89614755,0.0009591468,0.00018448402,0.0000617431,0.00009982127,0.00022967158,0.00935451],"genre_scores_gemma":[0.97939533,0.0008947374,0.015989697,0.00010997708,0.000086865475,0.00009883897,0.000043969005,0.000034582008,0.0033460448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909365,0.0003139636,0.000032186774,0.000195123,0.00017385525,0.00019119866],"domain_scores_gemma":[0.997062,0.002177726,0.0003196378,0.00007992241,0.00023538515,0.00012540125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016827744,0.0012557871,0.0009101849,0.00061917823,0.00048668456,0.0019076213,0.0010799937,0.00093787967,0.001366432],"category_scores_gemma":[0.0077271285,0.00039137373,0.00042359534,0.00063179055,0.0022810977,0.0019540929,0.0011371417,0.0010393042,0.00012778476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094738214,0.00002622954,0.00026294196,0.000060132155,0.000024554141,0.000050191153,0.000042573203,0.93733853,0.0011043403,0.05484692,0.00039535027,0.005753594],"study_design_scores_gemma":[0.000015937701,0.000024779567,0.000056141605,0.000005500784,0.000006198042,0.000004244641,0.000010563051,0.98415345,0.00024848725,0.015260821,0.00020923371,0.000004599278],"about_ca_topic_score_codex":0.00797337,"about_ca_topic_score_gemma":0.0029694834,"teacher_disagreement_score":0.00797337,"about_ca_system_score_codex":0.0021794932,"about_ca_system_score_gemma":0.0015598395,"threshold_uncertainty_score":0.015853941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19143066,0.0033953637,0.79342425,0.0014479563,0.00011513291,0.000074685566,0.00028292122,0.0005592867,0.009269767],"genre_scores_gemma":[0.9813027,0.0016509928,0.014725077,0.00016552793,0.00012987494,0.00007288166,0.00009060206,0.00007505761,0.0017872943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972819,0.0011029069,0.000071615905,0.0002727453,0.00060642266,0.0006644552],"domain_scores_gemma":[0.98386383,0.013220596,0.0009873816,0.0007104216,0.0009515235,0.00026624222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047152285,0.00096471806,0.001203138,0.0017037027,0.0007458761,0.0019489708,0.0015557914,0.0009894124,0.0009883549],"category_scores_gemma":[0.018762242,0.0006978302,0.000523916,0.001698023,0.0024205707,0.00390517,0.0014224836,0.0009347283,0.00030376532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025098407,0.0000966429,0.0015705201,0.0001241523,0.000076750344,0.00014741595,0.00012868595,0.91636604,0.0016762113,0.065776795,0.001525259,0.012260483],"study_design_scores_gemma":[0.000011662581,0.00003556718,0.00029237644,0.000010789693,0.000015246833,0.000033683456,0.00003028605,0.9732059,0.00043295827,0.025632152,0.00029239125,0.000006987328],"about_ca_topic_score_codex":0.0036008388,"about_ca_topic_score_gemma":0.0021247983,"teacher_disagreement_score":0.0047152285,"about_ca_system_score_codex":0.0026283904,"about_ca_system_score_gemma":0.0015462884,"threshold_uncertainty_score":0.024936855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18019314,0.0014457013,0.7983249,0.00069198903,0.00022831665,0.00019718519,0.000178282,0.0013338535,0.017406698],"genre_scores_gemma":[0.67640334,0.00059631607,0.3183564,0.00022290324,0.000065829525,0.000078524026,0.0002084677,0.00003794376,0.0040303846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998282,0.00003859175,0.00000792129,0.000033221942,0.000055829438,0.00003633417],"domain_scores_gemma":[0.9998658,0.000021363494,0.000021208041,0.000032032745,0.00003812219,0.000021438398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480763,0.000219165,0.00020008537,0.00016936925,0.00030406142,0.00068310153,0.0010807187,0.0002789079,0.0008778458],"category_scores_gemma":[0.00030525695,0.00010529775,0.00017807152,0.00024234928,0.00023611556,0.0007863805,0.0004189662,0.0004533084,0.00017975322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006474091,0.0004532291,0.004825482,0.00041355504,0.00008999583,0.0010930438,0.00010993779,0.2001978,0.21017036,0.17604472,0.0147534115,0.39120105],"study_design_scores_gemma":[0.000045207707,0.00027389114,0.0009890501,0.00002339376,0.000039408646,0.000458247,0.000023734485,0.9401794,0.027499828,0.004854832,0.025589135,0.000023776305],"about_ca_topic_score_codex":0.0012059485,"about_ca_topic_score_gemma":0.0027130947,"teacher_disagreement_score":0.0012059485,"about_ca_system_score_codex":0.0006412908,"about_ca_system_score_gemma":0.0008925331,"threshold_uncertainty_score":0.004652858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06541251,0.00033952683,0.92791575,0.00043394387,0.00004982648,0.000086016444,0.00008144036,0.000329926,0.005351008],"genre_scores_gemma":[0.814161,0.0002210349,0.1831087,0.00010317075,0.00003281023,0.000103786944,0.00008853998,0.00007104888,0.0021099243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00016473143,0.000017114786,0.000093948365,0.000093042996,0.00015069396],"domain_scores_gemma":[0.9994019,0.0002138143,0.00011376187,0.0001264763,0.000068239315,0.00007577979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888591,0.0006487936,0.00067183527,0.00036570363,0.00051944226,0.0011207595,0.0010430819,0.0005703377,0.0024714025],"category_scores_gemma":[0.0012969286,0.00035223053,0.0005460638,0.00048645775,0.0008872451,0.0014434521,0.0014368999,0.00103011,0.00031262895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007933778,0.00008689834,0.00069598574,0.00008681344,0.000021972388,0.00009574756,0.000060806724,0.92749184,0.006217776,0.027798938,0.001097397,0.036266454],"study_design_scores_gemma":[0.000011111076,0.0000645463,0.000140886,0.0000082213855,0.0000094175175,0.000044919467,0.000054270204,0.9806489,0.0028371045,0.014261362,0.0019105307,0.000008691956],"about_ca_topic_score_codex":0.0016937259,"about_ca_topic_score_gemma":0.0024060248,"teacher_disagreement_score":0.0024714025,"about_ca_system_score_codex":0.00089538185,"about_ca_system_score_gemma":0.0010236781,"threshold_uncertainty_score":0.008267701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47837615,0.0016241906,0.44689697,0.008395727,0.00015101592,0.00026052733,0.00072669826,0.00033248737,0.06323625],"genre_scores_gemma":[0.98237914,0.0010886447,0.012700228,0.00019132985,0.00012782247,0.000107081556,0.00016534737,0.000023237344,0.003217216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00018897069,0.000014572437,0.00005941561,0.00012023706,0.00011006291],"domain_scores_gemma":[0.99830675,0.0011869982,0.00021100738,0.000052941294,0.00017308215,0.00006923699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013451498,0.0005973997,0.0005519697,0.0008084287,0.0004080328,0.0019888359,0.0011931146,0.0018382025,0.0017392691],"category_scores_gemma":[0.004864596,0.00028482356,0.000531688,0.0010792608,0.00089887925,0.0027615868,0.00051852857,0.0012365021,0.0002601341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015236304,0.00006143083,0.0029368214,0.000030002759,0.000013321202,0.00008682059,0.000120292585,0.91839117,0.0003572012,0.070042096,0.000897651,0.0070480546],"study_design_scores_gemma":[0.0000021853161,0.000009466464,0.00029009883,0.0000037049501,0.0000032205871,0.000009554988,0.00002689035,0.98831916,0.00005594279,0.01097894,0.00029657388,0.0000043264886],"about_ca_topic_score_codex":0.018362077,"about_ca_topic_score_gemma":0.008864536,"teacher_disagreement_score":0.018362077,"about_ca_system_score_codex":0.0022289867,"about_ca_system_score_gemma":0.0014692436,"threshold_uncertainty_score":0.036510408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07229095,0.00086177135,0.91801476,0.0002433955,0.000098757766,0.001118599,0.0006751183,0.001389775,0.0053067715],"genre_scores_gemma":[0.43853363,0.00049464026,0.5572809,0.000119667915,0.000056231882,0.0018231524,0.0007074468,0.000259161,0.0007251591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98981935,0.0049722274,0.00059621537,0.00068180216,0.0032853512,0.00064510526],"domain_scores_gemma":[0.97828126,0.01413496,0.0017479282,0.0029047884,0.0026058045,0.0003253671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012753861,0.0019267612,0.0016921149,0.0053626806,0.0014357187,0.0024542254,0.0023916753,0.0024969238,0.0014148854],"category_scores_gemma":[0.04228688,0.00046160456,0.001531342,0.0046929456,0.0018282362,0.003245038,0.0019851916,0.0018489249,0.00039830114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042005905,0.00040614686,0.004146945,0.00029239227,0.00029945892,0.000058990634,0.00014065251,0.88981104,0.0058006695,0.049010128,0.001974532,0.047639083],"study_design_scores_gemma":[0.000059973994,0.00084194104,0.0016606774,0.00003867665,0.00005387084,0.00007059065,0.00011362942,0.97737473,0.0046320986,0.013234091,0.0018715976,0.000047974394],"about_ca_topic_score_codex":0.004968696,"about_ca_topic_score_gemma":0.0024810913,"teacher_disagreement_score":0.012753861,"about_ca_system_score_codex":0.0027644706,"about_ca_system_score_gemma":0.0018045746,"threshold_uncertainty_score":0.06744969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18051776,0.0042458926,0.77983224,0.002451956,0.0002948954,0.000059761984,0.00007246326,0.00027910777,0.032245863],"genre_scores_gemma":[0.9650069,0.0016244479,0.031712193,0.00016702435,0.000111407455,0.000021559661,0.000024174982,0.00001909559,0.0013132616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00020235022,0.000009308527,0.000037077487,0.0001642459,0.000109627974],"domain_scores_gemma":[0.9978381,0.0016130487,0.00015655285,0.0001280631,0.00022005309,0.000044183962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009651051,0.0006311625,0.0004136543,0.00030854478,0.00022907778,0.00058373535,0.00054736086,0.0006946105,0.0008768452],"category_scores_gemma":[0.004891534,0.00019136321,0.00028342928,0.0004891943,0.0008901296,0.0016152299,0.00045300325,0.0005577716,0.0001516362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117700845,0.000092376176,0.0016561488,0.00018470557,0.00007425813,0.00014324485,0.00006319153,0.84894395,0.012886875,0.062999435,0.0010857049,0.07175238],"study_design_scores_gemma":[0.0000082825645,0.00012738544,0.0003157571,0.000017023058,0.000028720016,0.000078968485,0.000039102826,0.977562,0.0046700956,0.016197365,0.0009441129,0.000011233648],"about_ca_topic_score_codex":0.00334305,"about_ca_topic_score_gemma":0.0035431515,"teacher_disagreement_score":0.00334305,"about_ca_system_score_codex":0.0005473663,"about_ca_system_score_gemma":0.00063416053,"threshold_uncertainty_score":0.0066471696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017828127,0.0013143241,0.9619779,0.00069191883,0.00025702448,0.00011681833,0.00006543235,0.0019228933,0.015825573],"genre_scores_gemma":[0.3958372,0.0025233638,0.57538813,0.00063326047,0.00022349165,0.00030241607,0.0004768381,0.00019601382,0.024419345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.000055619967,0.000018568326,0.000032408854,0.0001003222,0.000018805704],"domain_scores_gemma":[0.9998091,0.000033298,0.000019764984,0.00004661095,0.00007240889,0.000018719289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047380914,0.0003986132,0.00013868135,0.000278448,0.00033371118,0.0009872335,0.001032204,0.00044369826,0.0023596112],"category_scores_gemma":[0.000561139,0.00023628086,0.0002513037,0.00029666533,0.00028940247,0.0012407635,0.0007079381,0.00068942393,0.000854688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022847467,0.00017918301,0.0020302655,0.0005604513,0.00016348426,0.00062480685,0.00055160106,0.17266038,0.15313117,0.22903319,0.018926358,0.42191067],"study_design_scores_gemma":[0.000028343788,0.00034085332,0.001111642,0.00006971776,0.00009023336,0.0005411359,0.0001118701,0.779396,0.051049683,0.03312797,0.13408592,0.000046595367],"about_ca_topic_score_codex":0.00071596046,"about_ca_topic_score_gemma":0.0016267799,"teacher_disagreement_score":0.0023596112,"about_ca_system_score_codex":0.0003273408,"about_ca_system_score_gemma":0.0004382392,"threshold_uncertainty_score":0.007893622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027883204,0.0017202892,0.96392995,0.0005490235,0.00012140984,0.00013297144,0.0000722231,0.00019182194,0.0053990562],"genre_scores_gemma":[0.7245629,0.00439901,0.2667039,0.00029779715,0.00040084723,0.00025445377,0.00019892449,0.0001643706,0.0030177466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894387,0.000470908,0.000042687774,0.00010202502,0.00028101268,0.00015960363],"domain_scores_gemma":[0.99643886,0.0028459178,0.00019236591,0.00017873316,0.00025711153,0.00008702903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019212143,0.0009960614,0.0010323387,0.00065484765,0.0010697285,0.0011967175,0.0010148706,0.000695093,0.0019081843],"category_scores_gemma":[0.0055510965,0.0004723933,0.00033501844,0.0013966338,0.0011662418,0.0019519588,0.0010695837,0.0012981348,0.00033733965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000340777,0.00008620614,0.0004926522,0.00015469072,0.000025292382,0.00009300036,0.00015697308,0.8880491,0.0038046532,0.059156455,0.0031080954,0.044532046],"study_design_scores_gemma":[0.000025784875,0.000040995044,0.00006921884,0.00001263744,0.000005752231,0.00002439899,0.000030581366,0.9773821,0.0007692519,0.020415515,0.0012184294,0.0000052880973],"about_ca_topic_score_codex":0.0050811507,"about_ca_topic_score_gemma":0.0035713776,"teacher_disagreement_score":0.0050811507,"about_ca_system_score_codex":0.0018350825,"about_ca_system_score_gemma":0.0014718552,"threshold_uncertainty_score":0.013314486},"labels":[],"label_agreement":null},{"id":"W2099890714","doi":"10.1109/tnet.2005.861253","title":"An estimator of regulator parameters in a stochastic setting","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Burstiness; Computer science; Estimator; Queue; Queueing theory; Provisioning; Mathematical optimization; Algorithm; Computer network; Statistics; Network packet; Mathematics","score_opus":0.014701930863112578,"score_gpt":0.2514101569266887,"score_spread":0.23670822606357614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099890714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044923755,0.00007903037,0.9945176,0.00008122544,0.000018418139,0.000017385473,0.000036030677,0.00016374957,0.00059413444],"genre_scores_gemma":[0.6213583,0.0007451795,0.3716193,0.00030344413,0.00031554178,0.00030657675,0.0005144536,0.00020015208,0.0046369894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834883,0.00052891125,0.000057674504,0.00044666202,0.0004698257,0.00014798334],"domain_scores_gemma":[0.99104065,0.0060717533,0.00083113514,0.00071705884,0.001110934,0.00022857853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036811645,0.00093861134,0.0014932646,0.00095605885,0.00047793105,0.0014808711,0.0013894724,0.0015973944,0.0017035763],"category_scores_gemma":[0.02168851,0.00072552235,0.00044527277,0.00067808223,0.0014519977,0.0025200574,0.0014275644,0.0023317735,0.00070496975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012400818,0.00009392696,0.0029138147,0.00009782892,0.00006979739,0.00010525803,0.00007923168,0.8192144,0.008660004,0.103130475,0.0015686549,0.06394261],"study_design_scores_gemma":[0.000010308753,0.000018283814,0.00022409543,0.000010465461,0.0000050280823,0.00002516212,0.0000041031867,0.98986465,0.0007013853,0.008528072,0.00059283845,0.000015563748],"about_ca_topic_score_codex":0.0019003032,"about_ca_topic_score_gemma":0.0013738183,"teacher_disagreement_score":0.0036811645,"about_ca_system_score_codex":0.00096628047,"about_ca_system_score_gemma":0.0015349612,"threshold_uncertainty_score":0.019468129},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010023803,0.0019447992,0.9834104,0.00018549812,0.00016027548,0.00011339467,0.000097106735,0.0004261321,0.003638634],"genre_scores_gemma":[0.29529405,0.0028078759,0.6968279,0.000100534475,0.0001722287,0.0002866166,0.00034474971,0.0001602376,0.004005766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00012432427,0.000025501355,0.000054093358,0.0001530185,0.000030702184],"domain_scores_gemma":[0.9993418,0.0003925544,0.00006629863,0.000078124096,0.00009356144,0.000027688113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007439148,0.00048589284,0.0003558865,0.0005642314,0.000593354,0.0007368518,0.00086121244,0.0003597812,0.002017966],"category_scores_gemma":[0.002531227,0.0002911812,0.0003055487,0.0009226428,0.00035208295,0.0007647499,0.0004402154,0.00069787446,0.00040205382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017806282,0.00009572225,0.0006967951,0.00038949543,0.000049790742,0.00008977998,0.00012920157,0.573741,0.012670649,0.06343639,0.004293219,0.34422988],"study_design_scores_gemma":[0.000037648635,0.00009290433,0.00020516825,0.000024517318,0.000018540119,0.000056551475,0.000029171038,0.95467186,0.0041915555,0.02975512,0.010903374,0.000013501684],"about_ca_topic_score_codex":0.0025720838,"about_ca_topic_score_gemma":0.0036999984,"teacher_disagreement_score":0.0025720838,"about_ca_system_score_codex":0.001188742,"about_ca_system_score_gemma":0.0015706111,"threshold_uncertainty_score":0.008624971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36190733,0.00093401934,0.6051711,0.00032534476,0.00007827223,0.0001103226,0.00015145047,0.00061408436,0.030708171],"genre_scores_gemma":[0.9114696,0.00035375025,0.08246873,0.000049589955,0.0000293299,0.00007600622,0.000113507354,0.00007946187,0.0053600464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997228,0.000098673445,0.000009960742,0.000043686807,0.00007455071,0.000050258084],"domain_scores_gemma":[0.99964654,0.00018832527,0.00006927907,0.000028705317,0.00004813677,0.000018981817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031111375,0.00079680583,0.00032299184,0.00030650917,0.00031898665,0.00051260344,0.0006234783,0.00035986095,0.004000911],"category_scores_gemma":[0.0010070499,0.00032245126,0.00021475193,0.00037809345,0.00031124338,0.0009744935,0.0005371655,0.00040420552,0.00035934077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028133683,0.0000925377,0.0007873368,0.00014943996,0.0000369384,0.000102439866,0.000036690883,0.8837981,0.029826047,0.024660366,0.0011676155,0.059061028],"study_design_scores_gemma":[0.00002045006,0.00015546661,0.0004314913,0.000008286632,0.000019770792,0.000058386337,0.000017566588,0.97624993,0.013508985,0.0070828237,0.0024377424,0.000009212493],"about_ca_topic_score_codex":0.00047177792,"about_ca_topic_score_gemma":0.0012267668,"teacher_disagreement_score":0.004000911,"about_ca_system_score_codex":0.0007875549,"about_ca_system_score_gemma":0.00030065016,"threshold_uncertainty_score":0.013384342},"labels":[],"label_agreement":null},{"id":"W2105628131","doi":"10.1109/tnet.2006.880168","title":"Collected experience from implementing RSVP","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Unix; Variety (cybernetics); Software deployment; The Internet; Standardization; Protocol (science); Domain (mathematical analysis); Computer network; Resource Reservation Protocol; Software; Distributed computing; Software engineering; Internet Protocol; Operating system","score_opus":0.015199420446345044,"score_gpt":0.23421580667478734,"score_spread":0.2190163862284423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105628131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87642866,0.004405999,0.022694474,0.004001624,0.00017867686,0.00026889495,0.001019982,0.00075341214,0.09024837],"genre_scores_gemma":[0.95186025,0.005804634,0.019083051,0.0012754635,0.00009140114,0.000120581295,0.0017410557,0.0004835765,0.01954003],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.990444,0.004484282,0.0005314587,0.0006162407,0.0032273713,0.00069671444],"domain_scores_gemma":[0.9712725,0.011115937,0.0015510997,0.0032171623,0.011000774,0.0018425386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00907688,0.00044394154,0.00029050742,0.0009393391,0.0017375147,0.0025613653,0.0014582278,0.0009923985,0.005262984],"category_scores_gemma":[0.035673376,0.00031604918,0.00025874694,0.0023906776,0.0013347416,0.0024836229,0.0014730948,0.00134239,0.0017319361],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088851445,0.0026548728,0.09523879,0.0012711115,0.00016474178,0.0010158467,0.04272335,0.0066898824,0.012501588,0.008503318,0.028406065,0.7999419],"study_design_scores_gemma":[0.0001268872,0.008088234,0.12918608,0.0013969571,0.00031584027,0.0032929508,0.06344509,0.009035089,0.0366945,0.0030997195,0.7450599,0.00025879435],"about_ca_topic_score_codex":0.0073104664,"about_ca_topic_score_gemma":0.008372607,"teacher_disagreement_score":0.00907688,"about_ca_system_score_codex":0.0014881081,"about_ca_system_score_gemma":0.0022199189,"threshold_uncertainty_score":0.048003674},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024978477,0.00034755215,0.99421847,0.00031488892,0.00007626513,0.000079040736,0.000047184825,0.00032046475,0.0020983217],"genre_scores_gemma":[0.106229946,0.00054074044,0.8874887,0.00029962437,0.0001611577,0.00049022783,0.0002676553,0.00018631613,0.004335631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985833,0.0004856508,0.00006656681,0.00037546904,0.00033333723,0.00015567176],"domain_scores_gemma":[0.9980882,0.0012875921,0.00012267915,0.00022011831,0.00017761343,0.00010372417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191376,0.0014285906,0.001665962,0.000989322,0.0011236169,0.001895054,0.0031704744,0.0021321469,0.005532913],"category_scores_gemma":[0.00599315,0.0007132949,0.0010780904,0.0019253313,0.0011736065,0.0035701816,0.002773634,0.0022460588,0.0010187096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031768187,0.00023373724,0.0005228438,0.00035741428,0.00011093803,0.00013126485,0.000268092,0.5679957,0.0023811953,0.15179586,0.014358139,0.26152703],"study_design_scores_gemma":[0.000095034455,0.00008008553,0.00006964078,0.000019667621,0.000020220039,0.00007472484,0.000047896196,0.89294857,0.0007487929,0.10058579,0.0052956706,0.000013987617],"about_ca_topic_score_codex":0.0020094498,"about_ca_topic_score_gemma":0.0025884532,"teacher_disagreement_score":0.005532913,"about_ca_system_score_codex":0.0016074711,"about_ca_system_score_gemma":0.0020483823,"threshold_uncertainty_score":0.018509448},"labels":[],"label_agreement":null},{"id":"W2107631978","doi":"10.1109/tnet.2009.2035115","title":"A System-Theoretic Approach to Bandwidth Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Bandwidth (computing); Network packet; Nonlinear system; Testbed; Robustness (evolution); Algorithm; Computer network; Quality of service","score_opus":0.01373783591961571,"score_gpt":0.22643818604133129,"score_spread":0.21270035012171556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107631978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059983495,0.00022032544,0.99714655,0.00019881163,0.0000362842,0.000010450048,0.000027434213,0.000050195264,0.0017100822],"genre_scores_gemma":[0.48515356,0.0037100571,0.49695727,0.00074539275,0.001418829,0.000419808,0.000382855,0.0002486009,0.010963672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978568,0.00073686556,0.00012525167,0.00044834206,0.0006732758,0.00015950082],"domain_scores_gemma":[0.9971884,0.0019246464,0.00022074103,0.0002572448,0.00035548193,0.00005359415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024815518,0.0014009578,0.0013165872,0.0015494225,0.0007915281,0.0030515783,0.0019843914,0.0014301083,0.0041047996],"category_scores_gemma":[0.0070615783,0.0007021697,0.0014624741,0.0014258233,0.0023720304,0.004700663,0.0022259133,0.0035129252,0.0008329168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021834892,0.00003133448,0.00038238394,0.00013546381,0.00006383023,0.000104622435,0.00016145837,0.36561513,0.0010595093,0.6093246,0.0013083168,0.021791635],"study_design_scores_gemma":[0.0000059934814,0.000029277624,0.0001053178,0.00002779343,0.00002096318,0.000053243435,0.000038545168,0.7122641,0.0006020222,0.28149265,0.005333141,0.000026916101],"about_ca_topic_score_codex":0.0036011075,"about_ca_topic_score_gemma":0.0017853999,"teacher_disagreement_score":0.0041047996,"about_ca_system_score_codex":0.001937043,"about_ca_system_score_gemma":0.0015997476,"threshold_uncertainty_score":0.014054298},"labels":[],"label_agreement":null},{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.01933816349824027,"score_gpt":0.2448934649100482,"score_spread":0.22555530141180793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112947567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032772865,0.0008867844,0.9600007,0.0008042809,0.00006991903,0.000052536605,0.00003174786,0.000079519465,0.005301692],"genre_scores_gemma":[0.90382826,0.0013067024,0.086674646,0.0001932218,0.00018564211,0.00016457209,0.000055417713,0.00010347124,0.007488059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841976,0.0008616549,0.00004236696,0.00021449664,0.00026605738,0.00019574672],"domain_scores_gemma":[0.99738044,0.0019589863,0.00024812072,0.00010636779,0.00019510557,0.00011094369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030757324,0.0011325523,0.0012230829,0.0006629185,0.00062146096,0.0019966017,0.0013500577,0.0012366282,0.002097073],"category_scores_gemma":[0.007421045,0.00052103697,0.0006123226,0.001027757,0.0017523093,0.0024340635,0.0010596804,0.001621086,0.00029106575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007007458,0.00005018121,0.00026426133,0.00005291651,0.000019432193,0.00009107099,0.000059639868,0.9076252,0.0009733142,0.07603087,0.0007643093,0.013998708],"study_design_scores_gemma":[0.000008038001,0.000009376114,0.000055157278,0.0000027411972,0.000002344458,0.000010453878,0.00000853036,0.9850091,0.00015469978,0.014506986,0.00022924342,0.0000033853435],"about_ca_topic_score_codex":0.004518956,"about_ca_topic_score_gemma":0.0023981426,"teacher_disagreement_score":0.004518956,"about_ca_system_score_codex":0.0022320896,"about_ca_system_score_gemma":0.0010797314,"threshold_uncertainty_score":0.016266227},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19515382,0.002519751,0.78214484,0.0037193615,0.00014103169,0.0001779122,0.0003830423,0.00029053967,0.015469698],"genre_scores_gemma":[0.9806917,0.0009080208,0.016264321,0.0000790466,0.00009139585,0.00010708925,0.00009151246,0.000045802226,0.0017211516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820936,0.00073318236,0.0000759367,0.00023689307,0.00034605016,0.000398626],"domain_scores_gemma":[0.99400616,0.0045805653,0.0006750499,0.00013197582,0.0002921078,0.00031415164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034932885,0.0011778824,0.0012043467,0.000948568,0.001172015,0.0033655665,0.0015155986,0.002349793,0.0026998895],"category_scores_gemma":[0.012584487,0.00084586383,0.00070801843,0.0012914859,0.0015902315,0.005289449,0.0019554342,0.0021636146,0.00019908382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041076582,0.000014115216,0.00032374283,0.0000394486,0.00002651016,0.000106147396,0.00006139879,0.95962983,0.00034513915,0.034378823,0.00047461526,0.0045592254],"study_design_scores_gemma":[0.000013425194,0.00002608657,0.00019427195,0.000015240808,0.000014033731,0.000031553347,0.00006273643,0.92807794,0.00030583356,0.07061733,0.00062162365,0.000019919453],"about_ca_topic_score_codex":0.0066701034,"about_ca_topic_score_gemma":0.004455673,"teacher_disagreement_score":0.0066701034,"about_ca_system_score_codex":0.003299462,"about_ca_system_score_gemma":0.0021013112,"threshold_uncertainty_score":0.023939371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023544014,0.00048945285,0.9709852,0.00023363688,0.000021198908,0.000054534787,0.000029487452,0.00006881671,0.0045735505],"genre_scores_gemma":[0.7418663,0.0013688721,0.2507763,0.00014137398,0.000094299394,0.00024673252,0.000114626004,0.00008730455,0.005304187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996327,0.00013749313,0.000015204617,0.00006594955,0.00009239695,0.000056249064],"domain_scores_gemma":[0.9994011,0.00036985366,0.00008109713,0.000041008487,0.000081470374,0.00002536863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009414433,0.00070684875,0.00046968582,0.00091010897,0.000550112,0.0008893971,0.0010000094,0.0007306555,0.001545919],"category_scores_gemma":[0.0017537002,0.00036069372,0.0007128895,0.0009536867,0.0007788193,0.0015062002,0.0009503044,0.0007865888,0.0001343366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003226582,0.00003174323,0.00030371392,0.00006857173,0.000020111525,0.00009530834,0.000060229624,0.9021325,0.0016371165,0.06065049,0.00044780486,0.034520097],"study_design_scores_gemma":[0.000004127692,0.000032074495,0.000053754895,0.000009461917,0.0000061788505,0.000023866378,0.000026733,0.96607524,0.0004412534,0.032368574,0.0009535278,0.000005130206],"about_ca_topic_score_codex":0.003068893,"about_ca_topic_score_gemma":0.003253784,"teacher_disagreement_score":0.003068893,"about_ca_system_score_codex":0.0011411156,"about_ca_system_score_gemma":0.0009861017,"threshold_uncertainty_score":0.008279443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43202218,0.0009655174,0.5614418,0.0004011127,0.00004323063,0.000088615045,0.00010005888,0.0003422575,0.0045952215],"genre_scores_gemma":[0.9877566,0.00018947721,0.0105894925,0.00004739406,0.00001298871,0.000037840004,0.00003091942,0.000033051198,0.001302208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912506,0.00020324088,0.00002211886,0.000115591436,0.00034457498,0.00018943773],"domain_scores_gemma":[0.99544275,0.0031026609,0.0005022362,0.00019599717,0.0006539322,0.00010239606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258738,0.0006435068,0.0005771481,0.00079571025,0.0005777648,0.0006180368,0.00095808227,0.00052703946,0.0021563156],"category_scores_gemma":[0.007253992,0.00036078657,0.00041501145,0.00046253102,0.0009734228,0.0015171393,0.00061176496,0.00075027824,0.0002142431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015864323,0.000047302965,0.000955201,0.000051095416,0.000026900187,0.00020665304,0.00016038092,0.95043147,0.012491307,0.028512493,0.0003141391,0.00664436],"study_design_scores_gemma":[0.0000032889375,0.000025168758,0.00022455874,0.0000018735816,0.000006204879,0.000025961213,0.000019446574,0.99677867,0.0011357846,0.0016860637,0.00008656231,0.000006489957],"about_ca_topic_score_codex":0.0083513865,"about_ca_topic_score_gemma":0.0038735508,"teacher_disagreement_score":0.0083513865,"about_ca_system_score_codex":0.0018912174,"about_ca_system_score_gemma":0.0013658779,"threshold_uncertainty_score":0.016605556},"labels":[],"label_agreement":null},{"id":"W2123682542","doi":"10.1109/tnet.2006.876199","title":"Dynamic inter-SLA resource sharing in path-oriented differentiated services networks","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Spare part; Quality of service; Bandwidth (computing); Service-level agreement; Dynamic bandwidth allocation; Differentiated services; Shared resource; Service level; Bandwidth management; Distributed computing; Overhead (engineering); Bandwidth allocation; Operating system","score_opus":0.006542617317342361,"score_gpt":0.2084842481203477,"score_spread":0.2019416308030053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123682542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684854,0.0015823632,0.95738924,0.00023826651,0.00010566067,0.000059740938,0.000025933594,0.00031735573,0.0034330047],"genre_scores_gemma":[0.854667,0.0009191716,0.14278783,0.00012985762,0.00008375671,0.00007874258,0.00006596133,0.00003958267,0.0012280254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987925,0.0003533293,0.00006731049,0.0001615411,0.00045624003,0.00016899213],"domain_scores_gemma":[0.9992052,0.00027217786,0.00010336245,0.00019031091,0.00016115028,0.00006784677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755141,0.00050599355,0.0005959314,0.0005943276,0.00071966945,0.0011740469,0.0018286896,0.0005524102,0.0005881125],"category_scores_gemma":[0.0019394655,0.00034298038,0.00038773127,0.00076220743,0.0008813088,0.00172754,0.0012043793,0.0009942851,0.00017902267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029340546,0.00016369604,0.0014626752,0.0002468593,0.00008383283,0.00041005644,0.00063694845,0.5077136,0.03416755,0.18885663,0.0019561972,0.26400843],"study_design_scores_gemma":[0.000028197539,0.000101409394,0.00024802066,0.000020259646,0.000030859526,0.00010578439,0.000051586234,0.9580214,0.0055390494,0.028702915,0.0071217725,0.000028765067],"about_ca_topic_score_codex":0.0021091658,"about_ca_topic_score_gemma":0.0015817733,"teacher_disagreement_score":0.0021091658,"about_ca_system_score_codex":0.0014874098,"about_ca_system_score_gemma":0.0012145841,"threshold_uncertainty_score":0.010791898},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04555397,0.0011977026,0.9481881,0.00056329323,0.00007026256,0.00018786658,0.00041891268,0.0009792323,0.0028406142],"genre_scores_gemma":[0.38548416,0.0009125089,0.60978454,0.00015003893,0.000108437445,0.00030258272,0.0009813315,0.00021178948,0.0020646376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921584,0.00022328505,0.00006207301,0.00017511076,0.00020467253,0.000119016106],"domain_scores_gemma":[0.9974256,0.0015780833,0.00030428535,0.00032529535,0.00025488035,0.00011175184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015189947,0.0010423795,0.0011662124,0.0011709131,0.0012253609,0.0011346807,0.0022984901,0.0012843687,0.0017243121],"category_scores_gemma":[0.0069544865,0.00048454324,0.0007479435,0.0016352758,0.0005412406,0.0030681153,0.0015786331,0.0010658767,0.00034968735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003417965,0.00019795101,0.0018510782,0.0004638508,0.00010467049,0.00009970531,0.000330456,0.7825409,0.007598386,0.05277767,0.008213057,0.14548045],"study_design_scores_gemma":[0.00006286434,0.00006602423,0.00027672524,0.00002120742,0.000023529925,0.00007750711,0.00008239031,0.94253284,0.0023314452,0.05139268,0.0031218424,0.000010874364],"about_ca_topic_score_codex":0.0021581387,"about_ca_topic_score_gemma":0.0027720807,"teacher_disagreement_score":0.0022984901,"about_ca_system_score_codex":0.0019915625,"about_ca_system_score_gemma":0.0011532508,"threshold_uncertainty_score":0.014449835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10787482,0.0010678947,0.884578,0.00072314485,0.000041740128,0.00007456746,0.000019161267,0.000116719515,0.0055038994],"genre_scores_gemma":[0.9267777,0.00058560463,0.07174613,0.00012360103,0.000040541465,0.000057895573,0.000009684182,0.00004352327,0.0006153546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595404,0.0028248997,0.0000796975,0.00021280575,0.00062685926,0.0003017397],"domain_scores_gemma":[0.98357254,0.013367485,0.001343312,0.0005950749,0.00081395457,0.00030759085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038140772,0.00091992435,0.0009952514,0.0005986625,0.0006673272,0.0016030624,0.0011274435,0.0015369838,0.0012805485],"category_scores_gemma":[0.022137854,0.0007765316,0.0005165908,0.0006733416,0.0013210928,0.0027665459,0.0013276228,0.0012789932,0.00025443788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099219935,0.000034416575,0.00064090965,0.000048876784,0.000022465774,0.00008837673,0.000035411813,0.96910435,0.0027995172,0.014400499,0.0001463033,0.012579634],"study_design_scores_gemma":[0.00001711938,0.00013651735,0.00016625691,0.000010851324,0.000014899627,0.00006561134,0.000018195806,0.9894555,0.0031068495,0.0067358008,0.00026188706,0.000010489248],"about_ca_topic_score_codex":0.0012064058,"about_ca_topic_score_gemma":0.0010120407,"teacher_disagreement_score":0.0038140772,"about_ca_system_score_codex":0.001369495,"about_ca_system_score_gemma":0.00084185705,"threshold_uncertainty_score":0.020170987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090655655,0.00041963786,0.9056165,0.00021839398,0.00002544993,0.00010194584,0.000084751024,0.00038796096,0.0024897219],"genre_scores_gemma":[0.7215974,0.00064554426,0.27547404,0.00009637472,0.000023028642,0.0001869697,0.00022727827,0.00008259688,0.001666619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994893,0.00019564175,0.000021718204,0.00006873425,0.00014118814,0.00008344484],"domain_scores_gemma":[0.9985745,0.0010518188,0.0001407304,0.0001022206,0.000088033994,0.00004271996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093032804,0.000646515,0.00080234586,0.00042424616,0.0005348692,0.0007261775,0.00096483296,0.00077023153,0.0008624212],"category_scores_gemma":[0.004380968,0.00047217248,0.00027028736,0.0008960565,0.0006664212,0.0010751007,0.00062749867,0.00073050515,0.00021751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018196332,0.000046616755,0.00034957318,0.000061504375,0.000011778415,0.00007049031,0.00006335533,0.95812076,0.0034149454,0.008570827,0.000675842,0.028432252],"study_design_scores_gemma":[0.000014829528,0.000022570275,0.0000799863,0.000004511782,0.000003049894,0.000023604027,0.000016134201,0.9938683,0.0012615062,0.0044259774,0.00027645464,0.0000030682238],"about_ca_topic_score_codex":0.0053321826,"about_ca_topic_score_gemma":0.0047549694,"teacher_disagreement_score":0.0053321826,"about_ca_system_score_codex":0.0010768468,"about_ca_system_score_gemma":0.0008257838,"threshold_uncertainty_score":0.010602295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166424,0.010160609,0.7968362,0.0022091367,0.00015935693,0.00011147678,0.00021934517,0.0008345456,0.017805094],"genre_scores_gemma":[0.96646357,0.003920012,0.026289834,0.000119625794,0.00026425457,0.000075930744,0.00012124548,0.000097912576,0.0026475894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997764,0.0008451949,0.00004721412,0.00020911203,0.0007993511,0.00033512292],"domain_scores_gemma":[0.9924055,0.0051075104,0.0008076986,0.00048026213,0.0010669103,0.00013218139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495869,0.0015470335,0.00082941575,0.0013912222,0.0006964055,0.0018680157,0.0010727731,0.0012087425,0.0017737453],"category_scores_gemma":[0.0114670945,0.0005287084,0.00043490177,0.0018814165,0.0014008272,0.0020268008,0.0011933031,0.0015222069,0.00047049508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018340656,0.0000759259,0.0010529356,0.00014433962,0.00006656433,0.00010915638,0.000104587656,0.91256404,0.0069546956,0.042675026,0.0017778154,0.034291584],"study_design_scores_gemma":[0.0000056709027,0.000056128458,0.00030147625,0.000014521652,0.000014877497,0.000069410395,0.000016429205,0.99106795,0.0010404593,0.0070436522,0.00035813282,0.000011283651],"about_ca_topic_score_codex":0.0035457436,"about_ca_topic_score_gemma":0.0019852982,"teacher_disagreement_score":0.0035457436,"about_ca_system_score_codex":0.0028585177,"about_ca_system_score_gemma":0.0013187345,"threshold_uncertainty_score":0.020740092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32708213,0.003048917,0.65759814,0.00046843154,0.000112315916,0.000056993413,0.00005434901,0.0007476187,0.010831144],"genre_scores_gemma":[0.9623207,0.0002653436,0.036062595,0.000045899214,0.000012299425,0.000021019243,0.000022634467,0.00002461874,0.0012249261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.00009894009,0.000017387947,0.000057643527,0.00017596176,0.00007064606],"domain_scores_gemma":[0.9996013,0.00020552424,0.000036443485,0.000053766988,0.00008684536,0.000016140546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831581,0.00026779744,0.00028433165,0.00033279837,0.00029319135,0.0006362789,0.0007852352,0.00030580806,0.0006136096],"category_scores_gemma":[0.0011569407,0.00014714287,0.0001684872,0.0003548578,0.0002976175,0.00085235754,0.00034269996,0.00030655184,0.00013390229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087346847,0.00031144806,0.004482643,0.00013355773,0.00005988585,0.00014788879,0.00012594431,0.6306421,0.06307864,0.039666384,0.0016938522,0.25878417],"study_design_scores_gemma":[0.000014011267,0.00009107281,0.0005732205,0.0000051801762,0.000012611411,0.000030078518,0.000027774553,0.9786552,0.0129441265,0.0062062484,0.001433136,0.0000072854186],"about_ca_topic_score_codex":0.0026789948,"about_ca_topic_score_gemma":0.0032721737,"teacher_disagreement_score":0.0026789948,"about_ca_system_score_codex":0.0009313049,"about_ca_system_score_gemma":0.0008664663,"threshold_uncertainty_score":0.00675714},"labels":[],"label_agreement":null},{"id":"W2140490525","doi":"10.1109/90.842137","title":"Modeling TCP Reno performance: a simple model and its empirical validation","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; H-TCP; TCP acceleration; Flow (mathematics); Communication source; TCP global synchronization; File Transfer Protocol; Zeta-TCP; CUBIC TCP; Transfer (computing); Simple (philosophy); Computer network; Network congestion; Operating system; Mechanics; The Internet; Physics","score_opus":0.04610366903569576,"score_gpt":0.27204982972925246,"score_spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140490525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87391883,0.0010069886,0.11709799,0.00077899056,0.000077972196,0.0003450936,0.0012146827,0.0010664964,0.0044929273],"genre_scores_gemma":[0.9846234,0.00052379415,0.013409124,0.000064632004,0.000035411394,0.00019019695,0.00053673843,0.00005901429,0.0005578068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981817,0.0006854022,0.00011201855,0.00029200185,0.0005393087,0.00018967228],"domain_scores_gemma":[0.98571914,0.00918125,0.00149171,0.0017978766,0.0016209161,0.00018908583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046869824,0.0014167217,0.0011074792,0.0014769933,0.00064498873,0.001190339,0.0027774202,0.002570181,0.0007166117],"category_scores_gemma":[0.026017942,0.00057749613,0.0006435365,0.00193519,0.0011150382,0.0031767148,0.0009052787,0.001941389,0.0003491905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018224312,0.00045631008,0.013864864,0.00014372854,0.00006318356,0.00010445549,0.00023742161,0.9602542,0.0027616874,0.007249598,0.0011627155,0.013519551],"study_design_scores_gemma":[0.000011522823,0.00006139147,0.0018544579,0.000011430492,0.000008653634,0.000025224557,0.000017440509,0.9956956,0.0005045546,0.0015857156,0.00020878087,0.000015274754],"about_ca_topic_score_codex":0.018347545,"about_ca_topic_score_gemma":0.0074615963,"teacher_disagreement_score":0.018347545,"about_ca_system_score_codex":0.0022475487,"about_ca_system_score_gemma":0.0010529873,"threshold_uncertainty_score":0.0364815},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2843762,0.0015130346,0.7020045,0.0008961266,0.00009543681,0.00007566669,0.00012772488,0.001300506,0.009610887],"genre_scores_gemma":[0.9646123,0.0006148074,0.03184645,0.00010731623,0.00004692893,0.000054439544,0.000058448793,0.00007558442,0.002583692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884915,0.00025151085,0.000058375914,0.00014007713,0.00043413762,0.00026678096],"domain_scores_gemma":[0.9968951,0.0017190264,0.00037886013,0.0004089409,0.00043745572,0.0001606813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013227194,0.00071551156,0.00085232256,0.0004683091,0.0008955342,0.0026419268,0.0012597985,0.0011090873,0.0024171234],"category_scores_gemma":[0.005677176,0.00050773675,0.00031446404,0.0005997936,0.0008949601,0.0035087115,0.0015442204,0.0010616579,0.00041025833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005249668,0.00013840605,0.0015475382,0.0001737982,0.000034037854,0.00023410312,0.0002959829,0.8342343,0.021016048,0.10243019,0.0029169968,0.03645364],"study_design_scores_gemma":[0.00001328601,0.00004753789,0.00007913629,0.000007578122,0.0000047350322,0.000026610222,0.000030123898,0.983557,0.0024415085,0.0128514245,0.0009349026,0.000006256701],"about_ca_topic_score_codex":0.002612803,"about_ca_topic_score_gemma":0.0030730944,"teacher_disagreement_score":0.0026419268,"about_ca_system_score_codex":0.0015744398,"about_ca_system_score_gemma":0.0017995421,"threshold_uncertainty_score":0.011423409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028693656,0.0014539293,0.9650643,0.00056490157,0.000052770618,0.00006384186,0.000111429166,0.00038777164,0.0036073162],"genre_scores_gemma":[0.7864277,0.0023311537,0.20736685,0.00034603107,0.00030321418,0.00042961512,0.00030757158,0.0002719572,0.0022159268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99395615,0.002421485,0.00024845926,0.00095967104,0.0017512011,0.00066313444],"domain_scores_gemma":[0.96958435,0.025479116,0.0015763238,0.0019694637,0.0009315809,0.00045914692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004779575,0.0021864718,0.0022328352,0.0020327226,0.0015099957,0.0022495869,0.004358604,0.0017481046,0.0014167993],"category_scores_gemma":[0.03164098,0.0011242812,0.0011361641,0.0036443814,0.0033926794,0.0054152687,0.004267106,0.002493036,0.0005592816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024221983,0.00006911301,0.0015064318,0.00018154943,0.000086990745,0.00016235326,0.00028191748,0.8987394,0.002883643,0.06912838,0.0018728063,0.02484525],"study_design_scores_gemma":[0.000025264755,0.000070300186,0.00023557775,0.000021138401,0.00002427013,0.00010384295,0.000044529985,0.93241763,0.0013465345,0.06460776,0.0010898352,0.000013328262],"about_ca_topic_score_codex":0.0023530181,"about_ca_topic_score_gemma":0.0020615247,"teacher_disagreement_score":0.004779575,"about_ca_system_score_codex":0.0027906508,"about_ca_system_score_gemma":0.0011617407,"threshold_uncertainty_score":0.025277138},"labels":[],"label_agreement":null},{"id":"W2145873975","doi":"10.1109/tnet.2006.876191","title":"Deterministic packet marking for time-varying congestion price estimation","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Explicit Congestion Notification; Header; Network packet; Network congestion; Probabilistic logic; Path (computing); Computer network; Router; Real-time computing","score_opus":0.014281859668981167,"score_gpt":0.23712905641764304,"score_spread":0.22284719674866188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145873975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018122002,0.000052546475,0.98045236,0.000055792018,0.000026541966,0.000030513716,0.000022536318,0.0008192723,0.0004183821],"genre_scores_gemma":[0.6485762,0.0000749096,0.35021976,0.00006586596,0.00002838371,0.00007990901,0.00009601151,0.00007296763,0.00078600773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985796,0.00039963826,0.00008291187,0.00021006883,0.0006195184,0.00010825964],"domain_scores_gemma":[0.9933739,0.0034990439,0.00090139726,0.0013056251,0.0008131277,0.000106936284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021546143,0.00048496737,0.00051992125,0.00090920844,0.00044784017,0.00081269373,0.0016130889,0.0007012031,0.0008847181],"category_scores_gemma":[0.013007751,0.00037159136,0.00026101182,0.00087850227,0.0007294853,0.0015661913,0.0009227532,0.00096281007,0.00025289366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003185138,0.00012222132,0.0031787853,0.000057718342,0.000048264174,0.00009316597,0.00010258572,0.7216735,0.017075762,0.0264926,0.0013282488,0.2295087],"study_design_scores_gemma":[0.00001112375,0.00002559181,0.0002880842,0.00000237321,0.000005431317,0.000032748005,0.0000033426604,0.99197596,0.00458809,0.0027097678,0.00034529873,0.000012322606],"about_ca_topic_score_codex":0.002365793,"about_ca_topic_score_gemma":0.0020591258,"teacher_disagreement_score":0.002365793,"about_ca_system_score_codex":0.0010521084,"about_ca_system_score_gemma":0.0010566914,"threshold_uncertainty_score":0.011394858},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07504954,0.0028814508,0.8489774,0.0015755782,0.0008923253,0.0006468692,0.001107096,0.03100931,0.037860464],"genre_scores_gemma":[0.40842918,0.0014017504,0.5327566,0.0008898782,0.0004528441,0.0008330202,0.0038910988,0.00087491336,0.050470643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998589,0.000117365526,0.00010986572,0.00036662022,0.00061258546,0.00020455816],"domain_scores_gemma":[0.9972844,0.0007873766,0.00015025877,0.0009487351,0.0007220377,0.0001071905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279887,0.0013339517,0.0012513447,0.0019439464,0.0010775647,0.0028515875,0.0034130497,0.0009676749,0.018511822],"category_scores_gemma":[0.0034683053,0.0006314158,0.0008160111,0.0024228273,0.000441478,0.004534547,0.001295045,0.0010458207,0.013992984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006585187,0.00020277507,0.0016797609,0.00022382312,0.00010320612,0.00019807856,0.000065753695,0.012596454,0.027252318,0.004548457,0.02566612,0.92680466],"study_design_scores_gemma":[0.00039312456,0.0005402284,0.005062222,0.00011872857,0.0003925229,0.0013460338,0.00028794238,0.73240936,0.14086616,0.020539818,0.09788821,0.00015564289],"about_ca_topic_score_codex":0.004640172,"about_ca_topic_score_gemma":0.004383175,"teacher_disagreement_score":0.018511822,"about_ca_system_score_codex":0.0012981669,"about_ca_system_score_gemma":0.0017223778,"threshold_uncertainty_score":0.061928272},"labels":[],"label_agreement":null},{"id":"W2153876525","doi":"10.1109/tnet.2004.833125","title":"Design and Stability Analysis of a Rate Control Algorithm Using the Routh–Hurwitz Stability Criterion","year":2004,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Routh–Hurwitz stability criterion; Stability (learning theory); Computer science; Control theory (sociology); Stability criterion; Transfer function; Flow control (data); Control system; Algorithm; Feedback control; Control (management); Mathematics; Control engineering; Artificial intelligence; Telecommunications; Engineering","score_opus":0.042524042390701296,"score_gpt":0.25735752594914296,"score_spread":0.21483348355844167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153876525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058772517,0.00012955659,0.9914569,0.000073441275,0.000028999462,0.000055174984,0.000008367184,0.00016628909,0.002204039],"genre_scores_gemma":[0.65294987,0.0006228247,0.34032404,0.00011309775,0.00011938009,0.00042054104,0.000059630274,0.00015734416,0.0052332566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917537,0.0001995367,0.00004686569,0.00017266702,0.00033666796,0.00006887713],"domain_scores_gemma":[0.9985593,0.0006572614,0.0002044534,0.00007767906,0.00046725152,0.000033997858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017810736,0.0009018948,0.0008405553,0.00063488685,0.00055232726,0.001269633,0.0008363394,0.0010908087,0.0023433196],"category_scores_gemma":[0.0038742318,0.0003904231,0.0006125047,0.00035243054,0.0008604287,0.0009411662,0.00064365525,0.0008967847,0.00070201454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013820668,0.00006212406,0.0004551706,0.00017207483,0.000058803584,0.00016618635,0.00027257638,0.7918897,0.03200982,0.0914039,0.0009170551,0.082454436],"study_design_scores_gemma":[0.000020054455,0.00008077252,0.00006452232,0.000009188965,0.00000970103,0.000035709523,0.0000074349527,0.9909161,0.003619471,0.0043644463,0.0008603662,0.000012342648],"about_ca_topic_score_codex":0.0017753146,"about_ca_topic_score_gemma":0.0009447892,"teacher_disagreement_score":0.0023433196,"about_ca_system_score_codex":0.0008999037,"about_ca_system_score_gemma":0.001209191,"threshold_uncertainty_score":0.009419322},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029107844,0.002586329,0.9439325,0.0021465123,0.00021027305,0.00021099742,0.000057347468,0.00007449082,0.02167375],"genre_scores_gemma":[0.8734734,0.0036444438,0.11078535,0.00039308038,0.00063281436,0.0005115449,0.000048034773,0.000062841784,0.01044839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822253,0.0011400132,0.000036554407,0.0001287253,0.00032787622,0.00014433688],"domain_scores_gemma":[0.9975189,0.0017307475,0.0001935866,0.00009921507,0.00032133912,0.0001362591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029089458,0.00095812295,0.00114283,0.0010324331,0.001168576,0.0023678162,0.0025368386,0.0025802918,0.0033012107],"category_scores_gemma":[0.0054281787,0.0005151397,0.0009635574,0.001390544,0.002721077,0.004220168,0.0017194975,0.0015985956,0.00037757328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032252345,0.00007569374,0.0002463977,0.00010672847,0.000050448292,0.00023115608,0.000111912035,0.5809804,0.00083468587,0.40865517,0.0012004538,0.007474691],"study_design_scores_gemma":[0.00002292433,0.000039910152,0.00005618334,0.000012340735,0.000010315446,0.00004367708,0.000039300772,0.8993962,0.00012302409,0.099100046,0.0011440995,0.000011967417],"about_ca_topic_score_codex":0.002335098,"about_ca_topic_score_gemma":0.0023008182,"teacher_disagreement_score":0.0033012107,"about_ca_system_score_codex":0.0016809313,"about_ca_system_score_gemma":0.0014582805,"threshold_uncertainty_score":0.015384138},"labels":[],"label_agreement":null},{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","score_opus":0.021668590843779242,"score_gpt":0.2531395800328795,"score_spread":0.23147098918910025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159743267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012813689,0.00009893241,0.9846631,0.000103740604,0.000023116905,0.000026940064,0.000009384574,0.00012562134,0.0021354845],"genre_scores_gemma":[0.78657985,0.00022633898,0.20867656,0.00010941772,0.00005951417,0.00012381127,0.00005484616,0.00009107931,0.004078582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819237,0.0005835302,0.0000874695,0.00040151083,0.0005332553,0.00020196292],"domain_scores_gemma":[0.9978573,0.0009876515,0.00021793705,0.00045410395,0.00039718577,0.00008584168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026407044,0.00053005386,0.00094850967,0.0005617319,0.00054753537,0.00146698,0.00187588,0.0008359844,0.0019987111],"category_scores_gemma":[0.0071477885,0.00044117574,0.0004955244,0.00067674264,0.0014542872,0.002038176,0.0017972549,0.0014445212,0.00040417368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101851496,0.000081973696,0.0003233705,0.000046962377,0.000020143483,0.000076579905,0.000121429664,0.75705934,0.0039495463,0.18210083,0.0011646296,0.054953374],"study_design_scores_gemma":[0.000015240033,0.000018171662,0.0000418889,0.0000032282062,0.000003407819,0.000025600406,0.000010709836,0.96531594,0.0008339509,0.03304097,0.00068548205,0.000005456159],"about_ca_topic_score_codex":0.0011945468,"about_ca_topic_score_gemma":0.0009010521,"teacher_disagreement_score":0.0026407044,"about_ca_system_score_codex":0.0014433161,"about_ca_system_score_gemma":0.0012252395,"threshold_uncertainty_score":0.013965547},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5450209,0.0014017518,0.44694874,0.0009771722,0.000119791934,0.00020806071,0.00011902112,0.0019089665,0.0032955762],"genre_scores_gemma":[0.9429071,0.00027711567,0.05597928,0.000052464857,0.00004421495,0.000036358022,0.00006706084,0.00007826566,0.0005582481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986712,0.00048089598,0.00007395817,0.00024813987,0.00037108667,0.00015484086],"domain_scores_gemma":[0.99515224,0.0034210996,0.00021652575,0.0005088035,0.00051672064,0.0001846382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020158333,0.0007818346,0.0008080297,0.0006959076,0.0011403044,0.00090152107,0.0013154311,0.00091757445,0.00057996536],"category_scores_gemma":[0.008354182,0.0003846232,0.0002547729,0.00062304264,0.001027546,0.002116929,0.00075760763,0.00089292816,0.00015626104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052799645,0.000306158,0.004728882,0.00010051707,0.000049253344,0.00023933177,0.00022431588,0.8566793,0.0115910955,0.0043803407,0.0010559066,0.12011686],"study_design_scores_gemma":[0.00000797631,0.00004671261,0.00049030205,0.0000027067729,0.0000056118747,0.0000416705,0.000028851351,0.99526596,0.0027841297,0.0010521369,0.00026641935,0.0000074885647],"about_ca_topic_score_codex":0.007630719,"about_ca_topic_score_gemma":0.0052181254,"teacher_disagreement_score":0.007630719,"about_ca_system_score_codex":0.0009904966,"about_ca_system_score_gemma":0.0009349042,"threshold_uncertainty_score":0.015172601},"labels":[],"label_agreement":null},{"id":"W2162932658","doi":"10.1109/tnet.2005.852881","title":"Load balancing for parallel forwarding","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Scheduling (production processes); Distributed computing; Computer network; The Internet; Network packet; Hash function; Packet forwarding; Workload; Internet traffic; Operating system","score_opus":0.020646405727576714,"score_gpt":0.24991975956255086,"score_spread":0.22927335383497416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162932658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16625848,0.00047107777,0.81887996,0.00038848686,0.00018022927,0.00025929732,0.000112118614,0.0024511844,0.010999048],"genre_scores_gemma":[0.8755483,0.00020459243,0.12034466,0.00011078134,0.0001680162,0.00017155745,0.00016185273,0.00016703509,0.003123154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990165,0.00015399695,0.000058456342,0.0001811115,0.0004512207,0.00013865762],"domain_scores_gemma":[0.99764025,0.0008121562,0.0002734231,0.0006115723,0.0005625515,0.00010004926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014065827,0.000600926,0.0005879071,0.00090332376,0.0014490569,0.0011174163,0.0012061604,0.00058306893,0.0030844177],"category_scores_gemma":[0.0055643576,0.00026878892,0.0003115756,0.0008290131,0.0006525145,0.0017538748,0.0012042302,0.0004902063,0.00069821737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007775638,0.00042167137,0.005211557,0.00024132594,0.00007674074,0.0002530174,0.00040486665,0.34358186,0.093300425,0.07891842,0.007833646,0.4689789],"study_design_scores_gemma":[0.000033222615,0.00009073696,0.00061108044,0.000008564001,0.000018131339,0.00014265499,0.000050015133,0.9459029,0.013121248,0.03536031,0.004645813,0.000015390333],"about_ca_topic_score_codex":0.0013741761,"about_ca_topic_score_gemma":0.0014425678,"teacher_disagreement_score":0.0030844177,"about_ca_system_score_codex":0.0013901977,"about_ca_system_score_gemma":0.0011698741,"threshold_uncertainty_score":0.0103183985},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06439193,0.0011649701,0.92797685,0.0008958125,0.00022147543,0.000086092696,0.000051423693,0.00031834454,0.0048930934],"genre_scores_gemma":[0.9636491,0.00065568625,0.032516457,0.00014303358,0.00020365496,0.000108497334,0.000025863492,0.000058524005,0.002639147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714077,0.0012719873,0.00011348922,0.0003483693,0.00073355564,0.00039189958],"domain_scores_gemma":[0.99003804,0.006882286,0.0013699817,0.00050513796,0.00091755367,0.0002870288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051720007,0.0009580919,0.0012083091,0.0008839239,0.0006369508,0.0020546615,0.0026084995,0.0015529061,0.002004863],"category_scores_gemma":[0.01846684,0.0005647883,0.000660214,0.0009676482,0.002700565,0.003432552,0.0014078444,0.0018088397,0.00042998165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025150515,0.00013713301,0.00055711914,0.000118332784,0.00007012029,0.0002857562,0.00021237653,0.68332726,0.007486766,0.28597465,0.001342976,0.020235948],"study_design_scores_gemma":[0.000044063825,0.000061019124,0.00005646453,0.000005454022,0.000011534487,0.00004886854,0.000009426609,0.9566665,0.00054407545,0.0421708,0.0003646394,0.000017138054],"about_ca_topic_score_codex":0.0014017805,"about_ca_topic_score_gemma":0.00066128897,"teacher_disagreement_score":0.0051720007,"about_ca_system_score_codex":0.001543548,"about_ca_system_score_gemma":0.00081904815,"threshold_uncertainty_score":0.027352452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097289756,0.0005133362,0.8979636,0.00021790763,0.00006741065,0.0001410366,0.00007118001,0.0005574096,0.0031783434],"genre_scores_gemma":[0.9206421,0.00022740343,0.0776651,0.00009157015,0.00003559791,0.000089293986,0.000059824408,0.000020755562,0.0011683961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995572,0.00014749114,0.000018971507,0.00005682836,0.00016172722,0.0000578203],"domain_scores_gemma":[0.99879515,0.0005057849,0.00018839508,0.00019196981,0.000275814,0.00004297837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074594654,0.00044824617,0.00034855874,0.0006155698,0.00044134402,0.00028092493,0.0011461753,0.00043336724,0.00053541956],"category_scores_gemma":[0.003554373,0.00011633626,0.00021262423,0.00045269672,0.0004309519,0.00072321604,0.00065581105,0.00044682936,0.00011990964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085096137,0.00025000426,0.0018598196,0.00026645575,0.00009277988,0.00056645396,0.00038914883,0.42648765,0.07390434,0.06021141,0.0033115556,0.4318095],"study_design_scores_gemma":[0.000030424559,0.00021425786,0.00048217629,0.000011485378,0.000027276845,0.00029396356,0.000028303339,0.9834451,0.008243827,0.0056475326,0.0015461995,0.00002944081],"about_ca_topic_score_codex":0.0018997118,"about_ca_topic_score_gemma":0.0031860296,"teacher_disagreement_score":0.0018997118,"about_ca_system_score_codex":0.00051054737,"about_ca_system_score_gemma":0.0006034404,"threshold_uncertainty_score":0.003944993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883536,0.00032908516,0.40056437,0.00048595437,0.00005571534,0.00006501254,0.00006600158,0.0004999757,0.009580328],"genre_scores_gemma":[0.9481642,0.00020106946,0.050163236,0.000031375857,0.00003396813,0.00004092691,0.000045518405,0.00006160989,0.00125799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960655,0.00008746004,0.000011770711,0.000052280582,0.00010489231,0.00013713191],"domain_scores_gemma":[0.9994861,0.00025688132,0.00007867434,0.00006822444,0.000050049053,0.000060128557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921789,0.0007078025,0.00043789236,0.00034034046,0.0005207448,0.0006899353,0.0005881139,0.00032405718,0.0015308725],"category_scores_gemma":[0.0018158477,0.00021617686,0.00030000965,0.00043969223,0.00065849157,0.0009179915,0.0006797169,0.00047196058,0.000117797594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034360666,0.00010646225,0.0010151885,0.00008417208,0.000019045643,0.00012651413,0.000065454704,0.8987339,0.023729408,0.047805782,0.0007556861,0.027214723],"study_design_scores_gemma":[0.000017858169,0.00005249864,0.00019330758,0.0000024479425,0.000005111091,0.000011750628,0.000009504348,0.9901079,0.0023042383,0.007036943,0.00025636976,0.0000021723088],"about_ca_topic_score_codex":0.0011907751,"about_ca_topic_score_gemma":0.0017341858,"teacher_disagreement_score":0.0015308725,"about_ca_system_score_codex":0.0012661477,"about_ca_system_score_gemma":0.0008038097,"threshold_uncertainty_score":0.0091866255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29946953,0.0016978716,0.68859756,0.001051569,0.00006305236,0.00009787419,0.0001942987,0.00059267983,0.008235446],"genre_scores_gemma":[0.9792296,0.000520739,0.019022709,0.00009922019,0.000038047812,0.00006180047,0.000065482054,0.000073257426,0.0008890658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.0007133698,0.000052591135,0.00024361323,0.00030013733,0.00029907672],"domain_scores_gemma":[0.9694864,0.025439078,0.0022918726,0.0009425056,0.0013378356,0.0005022431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004849042,0.0009910776,0.0010359273,0.0010435788,0.0008834548,0.0013287334,0.0011907727,0.0009234722,0.0019217858],"category_scores_gemma":[0.02345585,0.00049877213,0.0005140469,0.00086080265,0.0025080433,0.0019210177,0.0012338196,0.001383265,0.00028219706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035784254,0.0000694617,0.0005996399,0.00006768246,0.000036682337,0.00004535482,0.00009148646,0.94806105,0.0045650667,0.03726285,0.00052085525,0.008322088],"study_design_scores_gemma":[0.000014466379,0.000057221372,0.00012190171,0.000007679645,0.000009375027,0.000012650212,0.000016750388,0.9899064,0.0015738183,0.008184921,0.00008550681,0.000009397603],"about_ca_topic_score_codex":0.0041849217,"about_ca_topic_score_gemma":0.0021897857,"teacher_disagreement_score":0.004849042,"about_ca_system_score_codex":0.0027481318,"about_ca_system_score_gemma":0.0023070069,"threshold_uncertainty_score":0.02564454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41866413,0.00434186,0.554983,0.0011622407,0.00011912448,0.00022843051,0.0002872813,0.00061153155,0.019602407],"genre_scores_gemma":[0.99290293,0.0005678194,0.0055331104,0.000024923975,0.00002890493,0.00003340853,0.00005766727,0.00002180336,0.00082952576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985355,0.0004896838,0.000047191497,0.00015410788,0.000534831,0.00023878533],"domain_scores_gemma":[0.9932268,0.0045287223,0.0005062363,0.0002120907,0.0013506832,0.00017531801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00191797,0.0009249146,0.000931347,0.00090345455,0.00067476614,0.0010647015,0.00092437846,0.0008157732,0.0011504781],"category_scores_gemma":[0.00749378,0.00025116044,0.00036570855,0.0009772768,0.00091688265,0.0010668829,0.00090952945,0.0007903934,0.000158445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000888286,0.00003081811,0.00064350915,0.00007439567,0.000023912637,0.00009252874,0.000066448454,0.97750264,0.0036957588,0.010294575,0.0004353005,0.0070512155],"study_design_scores_gemma":[0.000001004255,0.000015461545,0.00009110223,0.0000016780523,0.0000032146124,0.000010580189,0.0000070211513,0.9990426,0.00025528524,0.0005298231,0.000039500814,0.000002701129],"about_ca_topic_score_codex":0.008721475,"about_ca_topic_score_gemma":0.0023391552,"teacher_disagreement_score":0.008721475,"about_ca_system_score_codex":0.0022982617,"about_ca_system_score_gemma":0.0013119983,"threshold_uncertainty_score":0.017341435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032099204,0.000099110395,0.9894761,0.00037583555,0.000053347176,0.00019455573,0.00007997125,0.00031236344,0.0061988686],"genre_scores_gemma":[0.14646344,0.00028494463,0.8442499,0.00031041645,0.00016431643,0.0004856471,0.00034354464,0.00027085078,0.007426954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552023,0.0020906078,0.00023427956,0.00052852865,0.001195712,0.00043074708],"domain_scores_gemma":[0.99539465,0.002438463,0.00022998816,0.0008528871,0.0007675599,0.0003163888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044499617,0.0011023307,0.0011436604,0.00156938,0.0022755729,0.002696887,0.003419885,0.0017112152,0.010783123],"category_scores_gemma":[0.009967314,0.0007826814,0.002632663,0.0023757434,0.0027590757,0.004515688,0.005747902,0.004853671,0.0017332184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001986711,0.00016027357,0.0003206658,0.00023417146,0.00008393727,0.0005125322,0.0004891544,0.2183653,0.0023256517,0.6905942,0.007141792,0.07957357],"study_design_scores_gemma":[0.000082059574,0.000049849987,0.000056383233,0.000031298456,0.000037941194,0.00018521145,0.00011710329,0.72223186,0.0015206315,0.26417625,0.011479309,0.00003211759],"about_ca_topic_score_codex":0.005786731,"about_ca_topic_score_gemma":0.009676699,"teacher_disagreement_score":0.010783123,"about_ca_system_score_codex":0.0019730988,"about_ca_system_score_gemma":0.0045163203,"threshold_uncertainty_score":0.036073208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012497626,0.00027181802,0.98434156,0.00018552438,0.000044728942,0.000035497473,0.0000102075,0.00018348031,0.0024295643],"genre_scores_gemma":[0.60984343,0.0007973158,0.38614333,0.00023232264,0.00006967937,0.00012330292,0.000058143614,0.00009195731,0.0026405612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.00023434903,0.000033370266,0.000112482434,0.0002075853,0.00007663602],"domain_scores_gemma":[0.99912614,0.00022725204,0.00013442285,0.00022562617,0.00022420898,0.000062428495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014174565,0.0007616636,0.00042349662,0.00042644216,0.0003618975,0.00079488417,0.0013650073,0.00067496166,0.00092800107],"category_scores_gemma":[0.0024857856,0.00034148755,0.0004052729,0.0002785672,0.0010733523,0.0017238493,0.0013428087,0.001160194,0.0002479167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012066994,0.00008936302,0.0013405625,0.0002513625,0.000042572807,0.0002262268,0.00033734934,0.685446,0.030707823,0.12556644,0.0014427219,0.15442893],"study_design_scores_gemma":[0.000017453205,0.00019297346,0.00016560734,0.00004468651,0.000023239723,0.00016329472,0.000062519444,0.9279178,0.008958239,0.051459204,0.010978664,0.000016215776],"about_ca_topic_score_codex":0.000568703,"about_ca_topic_score_gemma":0.00069892145,"teacher_disagreement_score":0.0014174565,"about_ca_system_score_codex":0.00063546404,"about_ca_system_score_gemma":0.00084480137,"threshold_uncertainty_score":0.0074962974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05903558,0.0019931952,0.93338954,0.00057109643,0.00006214453,0.00010375637,0.00012539564,0.00047432218,0.004244982],"genre_scores_gemma":[0.7595481,0.0026702187,0.2329438,0.00029576308,0.00009912478,0.00013782996,0.00019801951,0.00012395396,0.0039832154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950147,0.00015736138,0.000032074404,0.00007788534,0.00017306517,0.00005816278],"domain_scores_gemma":[0.99907184,0.00040899732,0.00011211823,0.00019339823,0.00017043538,0.00004325937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006639994,0.0005487527,0.00072497124,0.0010143714,0.00064890215,0.0010589422,0.0013576723,0.00062417844,0.0015887794],"category_scores_gemma":[0.002459701,0.00025812353,0.00033332995,0.0014462018,0.0010506616,0.0033155112,0.00155041,0.0004975221,0.00044702494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049266045,0.00016079057,0.0010139284,0.00040322426,0.00005517159,0.00020883538,0.00041747798,0.5989666,0.051291008,0.10802397,0.0052836128,0.2336827],"study_design_scores_gemma":[0.000014035015,0.00009979808,0.00023598506,0.00001292933,0.0000105332465,0.00014246623,0.00007577084,0.97235864,0.006327855,0.018284548,0.0024128957,0.000024475496],"about_ca_topic_score_codex":0.00238876,"about_ca_topic_score_gemma":0.0022738327,"teacher_disagreement_score":0.00238876,"about_ca_system_score_codex":0.0009602783,"about_ca_system_score_gemma":0.00075753545,"threshold_uncertainty_score":0.006967306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02237363,0.004765766,0.9649653,0.00056344323,0.00030914004,0.00013537462,0.000058448553,0.0003974774,0.0064314227],"genre_scores_gemma":[0.9529492,0.0022492355,0.040340133,0.00007529373,0.00020905293,0.000165752,0.00008269784,0.00005041631,0.0038782184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996118,0.00014222882,0.000018398852,0.00007060457,0.0001085975,0.000048513088],"domain_scores_gemma":[0.9995389,0.0002420574,0.000053265634,0.000026660147,0.000112371614,0.00002682843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671297,0.00049714925,0.0005589888,0.00044188873,0.0006158723,0.0009177602,0.0011053644,0.000432754,0.0009804299],"category_scores_gemma":[0.0021268334,0.00026939952,0.00034506546,0.00055585813,0.0006073771,0.0008740461,0.0007685144,0.00066674897,0.00013132524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056239754,0.000030368077,0.00039359002,0.000103176106,0.000031108524,0.000090388065,0.00006906113,0.92028624,0.002222482,0.03493541,0.0019300051,0.03985186],"study_design_scores_gemma":[0.0000062773142,0.000018005358,0.000083986895,0.0000048370775,0.000006633188,0.0000112116195,0.000009836012,0.9915358,0.00014498201,0.0071819783,0.0009913833,0.000005043098],"about_ca_topic_score_codex":0.0074909003,"about_ca_topic_score_gemma":0.0065122396,"teacher_disagreement_score":0.0074909003,"about_ca_system_score_codex":0.0010543057,"about_ca_system_score_gemma":0.0012589475,"threshold_uncertainty_score":0.014894605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3265821,0.00092852575,0.66033924,0.0010240963,0.00007827607,0.00010744581,0.00025023293,0.00028769366,0.010402393],"genre_scores_gemma":[0.9914426,0.00023285537,0.0067190602,0.000023892278,0.000012468813,0.000030174198,0.000031216732,0.000022874245,0.0014849188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.00014441108,0.000015981534,0.00009431214,0.00011074219,0.00014248017],"domain_scores_gemma":[0.9987025,0.0007896002,0.00016014592,0.00006574757,0.00021692677,0.000065088025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965682,0.00087282486,0.000609931,0.00039949405,0.00038590978,0.0010651945,0.0008480302,0.0008029756,0.0011440787],"category_scores_gemma":[0.0030961786,0.00040472852,0.0004296606,0.00057679723,0.00083449885,0.0009299186,0.00059688516,0.0007242164,0.00014010369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027194306,0.000014373204,0.00035479243,0.000015698472,0.000004659133,0.00003547466,0.000021062566,0.99293715,0.0012060474,0.0034830295,0.00013991416,0.0017605919],"study_design_scores_gemma":[0.0000011218265,0.000009035789,0.000096289135,0.0000010998472,0.0000015703343,0.000005070876,0.0000066695907,0.99902356,0.00013296964,0.00066811236,0.000052635496,0.0000019354866],"about_ca_topic_score_codex":0.01425831,"about_ca_topic_score_gemma":0.006042929,"teacher_disagreement_score":0.01425831,"about_ca_system_score_codex":0.002444854,"about_ca_system_score_gemma":0.0013644685,"threshold_uncertainty_score":0.028350651},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019623036,0.00009883393,0.9973174,0.000018500064,0.00002524553,0.000014102751,0.00000902756,0.00029614306,0.00025846047],"genre_scores_gemma":[0.08273959,0.00021036757,0.9146405,0.000041089712,0.000057419442,0.00009079016,0.000067866145,0.00015712976,0.0019952632],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926704,0.000246047,0.000038648224,0.0001325122,0.00026347896,0.00005228147],"domain_scores_gemma":[0.9992212,0.00033670428,0.00008010855,0.00013535818,0.00020201977,0.000024573943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086128345,0.0005514712,0.0005427284,0.0007802827,0.00050961046,0.00045973255,0.0009227619,0.0006270318,0.0018324589],"category_scores_gemma":[0.0032812762,0.000276628,0.0005290845,0.00074516464,0.0004640478,0.00081539975,0.0005613522,0.0009293694,0.0009122347],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021791078,0.00008242118,0.0012092026,0.00018062769,0.000069676506,0.00013697663,0.00026871834,0.18133064,0.047615252,0.05338602,0.003628945,0.71187365],"study_design_scores_gemma":[0.000022926828,0.000050373717,0.00033612744,0.000012198104,0.000019082236,0.000107766275,0.000015175241,0.9802151,0.008068055,0.0047793686,0.006348213,0.000025689369],"about_ca_topic_score_codex":0.004597426,"about_ca_topic_score_gemma":0.0052527483,"teacher_disagreement_score":0.004597426,"about_ca_system_score_codex":0.0005125898,"about_ca_system_score_gemma":0.0009614588,"threshold_uncertainty_score":0.009141326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066102155,0.00070156,0.91895217,0.0003403508,0.000100073165,0.00034718178,0.000110955065,0.0046585524,0.008686969],"genre_scores_gemma":[0.6545174,0.00070924783,0.33926818,0.000174624,0.000051605613,0.00018539642,0.00022442768,0.0003022814,0.00456695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905974,0.0001781101,0.000057426612,0.00014615268,0.00044708562,0.000111483445],"domain_scores_gemma":[0.9988456,0.00025592494,0.0001321322,0.00037099823,0.00030991502,0.00008540042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546222,0.00041540604,0.00023683072,0.0004921284,0.00037493926,0.0013608873,0.0022814777,0.0003830728,0.0027631826],"category_scores_gemma":[0.0023455927,0.00039354933,0.00018121894,0.0009537398,0.00070645736,0.0015234126,0.0009762713,0.0008611411,0.0004158286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008987694,0.00043416946,0.007072673,0.0006893049,0.00008724419,0.00051926676,0.00058017904,0.2998956,0.06872138,0.116135,0.015369052,0.48959735],"study_design_scores_gemma":[0.000105175866,0.0006091569,0.0013058222,0.000056262124,0.000055336743,0.0003846588,0.00013750486,0.87438357,0.06200785,0.021069951,0.03983453,0.000050172264],"about_ca_topic_score_codex":0.0018328914,"about_ca_topic_score_gemma":0.0015478772,"teacher_disagreement_score":0.0027631826,"about_ca_system_score_codex":0.001056498,"about_ca_system_score_gemma":0.00096323574,"threshold_uncertainty_score":0.009243786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023139513,0.000038941478,0.99667007,0.00005103606,0.00002028497,0.000020789099,0.000006820355,0.00009246462,0.0007856405],"genre_scores_gemma":[0.33255842,0.000179053,0.6621141,0.00013659813,0.000076816665,0.00037332476,0.00008854699,0.000102669204,0.004370486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935,0.0002469589,0.000029102936,0.00014117129,0.0001764155,0.00005633434],"domain_scores_gemma":[0.999236,0.00040492485,0.000076096185,0.00007470568,0.00016646189,0.00004185959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001602636,0.000962977,0.0009505194,0.0004515346,0.00055905164,0.0008053696,0.0015716508,0.0011045228,0.0024181919],"category_scores_gemma":[0.002792837,0.0004133061,0.000607631,0.0007210576,0.0007681919,0.0010326398,0.0011409677,0.0015393456,0.00056298566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079287616,0.000049821807,0.00017907795,0.000055111745,0.000032113705,0.000051151375,0.0000792632,0.89472026,0.0020350486,0.03874566,0.0015373728,0.06243594],"study_design_scores_gemma":[0.000017994264,0.000020293699,0.00001353023,0.000002514233,0.00000276016,0.000010135809,0.0000041328235,0.99311596,0.00027625487,0.0060483217,0.00048537468,0.0000027103126],"about_ca_topic_score_codex":0.0020983797,"about_ca_topic_score_gemma":0.002109478,"teacher_disagreement_score":0.0024181919,"about_ca_system_score_codex":0.00073204556,"about_ca_system_score_gemma":0.0015024235,"threshold_uncertainty_score":0.008475661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074314274,0.000035297122,0.9980573,0.000041818705,0.000007774755,0.000049511604,0.000010625614,0.000041812804,0.0010126712],"genre_scores_gemma":[0.14317735,0.0003147506,0.85298246,0.00011343693,0.000041110943,0.0008756051,0.000072647905,0.00006745934,0.0023552775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00034731792,0.00006492673,0.0002072372,0.0003985644,0.00008084194],"domain_scores_gemma":[0.99897695,0.00045343448,0.00014391275,0.00015270742,0.00022353356,0.000049561193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020182098,0.0009225462,0.0009189126,0.0005700885,0.0005948648,0.0012228079,0.0019320669,0.0011788427,0.0022323094],"category_scores_gemma":[0.0033727025,0.00057544943,0.0010678178,0.0006199471,0.0013476394,0.00085997826,0.0012353967,0.0013797719,0.0005000188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020882782,0.000072808245,0.0002534377,0.00015193004,0.00006603094,0.00008963018,0.00012040694,0.7850543,0.0065111713,0.16621469,0.0011067813,0.0403379],"study_design_scores_gemma":[0.000024308936,0.00006166426,0.000042982585,0.000018237466,0.00001802647,0.000030058349,0.000014465433,0.95653975,0.0012808046,0.037900604,0.0040594544,0.000009551207],"about_ca_topic_score_codex":0.0016169377,"about_ca_topic_score_gemma":0.0017212804,"teacher_disagreement_score":0.0022323094,"about_ca_system_score_codex":0.0012229821,"about_ca_system_score_gemma":0.0022458578,"threshold_uncertainty_score":0.010673463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064883656,0.00012753888,0.99256575,0.000088458764,0.000021848586,0.000026589207,0.00007404256,0.0003257385,0.0002815893],"genre_scores_gemma":[0.3904859,0.0008332341,0.6031199,0.0001384703,0.00022890612,0.00021910084,0.0012383001,0.00025968647,0.003476542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990626,0.00023709284,0.000053677883,0.00023025696,0.00029494695,0.000121310164],"domain_scores_gemma":[0.99797374,0.00079324224,0.0002647959,0.00025901812,0.00058204564,0.00012722117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011494401,0.0016807697,0.0010174637,0.0010207036,0.0005267303,0.0009171945,0.0013341836,0.00079870335,0.0016352648],"category_scores_gemma":[0.004927715,0.0005144929,0.0008657579,0.0013722308,0.0006198667,0.0022970594,0.0011179748,0.0022276116,0.0008094284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021910101,0.00015663581,0.0018722378,0.00015734712,0.000088570756,0.00014841385,0.00018426558,0.7616718,0.0110312905,0.010763995,0.0045948853,0.20911153],"study_design_scores_gemma":[0.0000040056416,0.000021903657,0.00015683463,0.0000035398648,0.0000038456465,0.000021239555,0.000017562155,0.9952868,0.0009853718,0.0030212437,0.000469036,0.000008579117],"about_ca_topic_score_codex":0.011787315,"about_ca_topic_score_gemma":0.008189576,"teacher_disagreement_score":0.011787315,"about_ca_system_score_codex":0.0007258229,"about_ca_system_score_gemma":0.0018615685,"threshold_uncertainty_score":0.02343744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038133714,0.0004501774,0.94868535,0.0007399537,0.000073252515,0.00018628087,0.00009186014,0.00020405345,0.011435408],"genre_scores_gemma":[0.8681244,0.0005673068,0.12589529,0.00016986337,0.00011098608,0.00033024114,0.000082624596,0.00014877053,0.0045706076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438936,0.003163324,0.00016686745,0.0005419277,0.0010544417,0.0006840463],"domain_scores_gemma":[0.98906684,0.0076360772,0.00084534794,0.0011649547,0.00082698546,0.00045974558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066847787,0.0016532982,0.0020857381,0.0008697664,0.0014069538,0.005669024,0.0030613714,0.0018321029,0.0031661715],"category_scores_gemma":[0.021329125,0.00090829545,0.0013679882,0.0017282524,0.0032963022,0.006846578,0.0023354958,0.004124517,0.0005101845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022352835,0.00026204076,0.0006446488,0.00015004937,0.00005458487,0.00017719822,0.00018280339,0.59698963,0.0022364957,0.3700564,0.0018545535,0.027168063],"study_design_scores_gemma":[0.000022699054,0.00003707143,0.000092862996,0.0000140559205,0.00001089608,0.000050048173,0.00005070133,0.87242806,0.0006830865,0.12589781,0.00070055336,0.000012149557],"about_ca_topic_score_codex":0.0022414352,"about_ca_topic_score_gemma":0.0013916322,"teacher_disagreement_score":0.0066847787,"about_ca_system_score_codex":0.0036967676,"about_ca_system_score_gemma":0.0043197465,"threshold_uncertainty_score":0.035352945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042916625,0.00012312816,0.9936055,0.000099533136,0.00008009314,0.000042724812,0.00017541161,0.0008554392,0.0007264742],"genre_scores_gemma":[0.2942932,0.0005021415,0.6994698,0.00016214112,0.00022870314,0.00041284753,0.0015571271,0.00019346399,0.0031805374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844235,0.0004975649,0.00007676259,0.00035504988,0.0005266252,0.00010165241],"domain_scores_gemma":[0.99846256,0.00034631358,0.00025842604,0.00038807816,0.0004212842,0.00012346462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012175976,0.001157231,0.0012358769,0.0009836194,0.0006106083,0.0010786251,0.001856163,0.0007013425,0.0018137194],"category_scores_gemma":[0.004871193,0.00036023013,0.00058476557,0.0014928891,0.0011861468,0.001684075,0.002837219,0.0015676171,0.0010733135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006922525,0.00010958029,0.0019569586,0.00020609457,0.00009535567,0.0002116034,0.00025500302,0.5574612,0.018958328,0.0725835,0.019983374,0.32748675],"study_design_scores_gemma":[0.0000465468,0.00010227507,0.00024592,0.000008165374,0.000008540313,0.0000560882,0.000026234065,0.98411036,0.0035178892,0.0067661935,0.0050815293,0.00003028942],"about_ca_topic_score_codex":0.006853342,"about_ca_topic_score_gemma":0.0048155035,"teacher_disagreement_score":0.006853342,"about_ca_system_score_codex":0.0006573046,"about_ca_system_score_gemma":0.001758808,"threshold_uncertainty_score":0.0136268735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03444996,0.00109047,0.9602707,0.00029205004,0.000052504492,0.0000871998,0.00008066924,0.0007562144,0.00292017],"genre_scores_gemma":[0.67321146,0.0007489505,0.32264847,0.00014864001,0.00008619738,0.00021956052,0.00020215908,0.0001672429,0.002567411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987733,0.0005387445,0.00005818224,0.00017333703,0.00028928916,0.00016703698],"domain_scores_gemma":[0.9952093,0.003114255,0.00039618765,0.00060119585,0.0005631265,0.00011600139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023615079,0.0008465367,0.0010240278,0.001016954,0.0008430913,0.0014081756,0.0017315503,0.0010582826,0.0012692581],"category_scores_gemma":[0.0100260675,0.00034495545,0.00044067556,0.0017837095,0.0010942129,0.0021571221,0.0010882792,0.0010713338,0.00028906082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014476733,0.000084736734,0.0008226123,0.00006402648,0.000023996881,0.000037575996,0.00009150358,0.8727988,0.002540196,0.038635463,0.002271924,0.08248437],"study_design_scores_gemma":[0.000016513715,0.000021600623,0.00008296443,0.0000054236334,0.0000044178646,0.000014980489,0.00001177275,0.9864879,0.00057694846,0.012292023,0.00047903406,0.000006409267],"about_ca_topic_score_codex":0.004792044,"about_ca_topic_score_gemma":0.004492128,"teacher_disagreement_score":0.004792044,"about_ca_system_score_codex":0.0024614236,"about_ca_system_score_gemma":0.0012455763,"threshold_uncertainty_score":0.017858922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071505316,0.00016967417,0.9231557,0.00020749816,0.00008133792,0.000079899924,0.000036114525,0.00043814813,0.004326314],"genre_scores_gemma":[0.9507289,0.00007219366,0.047807127,0.000066593406,0.000021707228,0.00005527873,0.0000356679,0.00003344413,0.0011791312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.00010816781,0.000015202195,0.0001010952,0.0001306845,0.00015794829],"domain_scores_gemma":[0.9994135,0.00022544389,0.00007283289,0.00012692797,0.000096586955,0.000064757165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058313645,0.00059199915,0.00055367796,0.00024199969,0.00062831945,0.00066059316,0.0010068738,0.00050429435,0.0009961516],"category_scores_gemma":[0.0013204141,0.00021845837,0.00044865036,0.00038681034,0.0005261613,0.0007893664,0.0009540901,0.0006634997,0.00018549315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021126596,0.00020906566,0.0008741753,0.00007155748,0.00002423136,0.00020179701,0.00009929751,0.88712794,0.022453658,0.03094659,0.0023824475,0.055398054],"study_design_scores_gemma":[0.0000042486427,0.000024418188,0.00005648177,0.0000012693537,0.0000018240435,0.000012694753,0.0000064135766,0.9962542,0.000807418,0.0025445938,0.0002841495,0.00000223873],"about_ca_topic_score_codex":0.0032456734,"about_ca_topic_score_gemma":0.005178364,"teacher_disagreement_score":0.0032456734,"about_ca_system_score_codex":0.00091059465,"about_ca_system_score_gemma":0.0011213421,"threshold_uncertainty_score":0.006606877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34261557,0.0030610638,0.62589574,0.0020871088,0.00027863873,0.0005053938,0.0011677039,0.0013505861,0.023038067],"genre_scores_gemma":[0.8763802,0.0005928818,0.11864374,0.00018015606,0.00006712579,0.00029540618,0.0005619575,0.0002223909,0.0030559862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.000569356,0.000047560545,0.00022999095,0.00015289026,0.00026640974],"domain_scores_gemma":[0.99602807,0.003160904,0.00027207888,0.00020864632,0.00014848202,0.00018178855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978675,0.0013983779,0.0014986015,0.00082426105,0.000776667,0.0016901538,0.0020420768,0.0017973473,0.004555152],"category_scores_gemma":[0.0066044563,0.00074293604,0.0008711145,0.0012619513,0.0010958778,0.0021211668,0.0016315224,0.0014047882,0.0004963138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000996888,0.0001050261,0.00044315748,0.00016379135,0.00003754454,0.00011104535,0.000045603443,0.9761077,0.0006431435,0.0077457237,0.0017245456,0.012772987],"study_design_scores_gemma":[0.00003350693,0.000041583655,0.00015391172,0.000016513724,0.000012075973,0.000045185185,0.000081401005,0.9861339,0.00034636146,0.012466945,0.00066353474,0.0000050806148],"about_ca_topic_score_codex":0.0039347475,"about_ca_topic_score_gemma":0.0036874972,"teacher_disagreement_score":0.004555152,"about_ca_system_score_codex":0.0011029217,"about_ca_system_score_gemma":0.0013650878,"threshold_uncertainty_score":0.0152385235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14686526,0.0007208068,0.8362372,0.001030121,0.00010701654,0.0001006348,0.00011432524,0.00021625317,0.014608365],"genre_scores_gemma":[0.96343255,0.0007048524,0.02674993,0.00015557649,0.00007762555,0.00014895032,0.000059838276,0.00006612032,0.008604621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928635,0.00034464803,0.000028218326,0.00009836755,0.00013250807,0.00010997286],"domain_scores_gemma":[0.99756575,0.0016487137,0.0003592478,0.000109346634,0.00014186569,0.00017511427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613047,0.0009875214,0.0011730442,0.00095003226,0.0007872817,0.0016395827,0.0014810538,0.001960869,0.0023729887],"category_scores_gemma":[0.004523493,0.00056984054,0.0010127737,0.0005848988,0.002300376,0.0018469907,0.0017058298,0.0017350602,0.0002669338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032161293,0.00003439469,0.000259143,0.000028931072,0.000018243833,0.00011029165,0.000068775116,0.9458827,0.001297789,0.049959656,0.0003129608,0.0019950108],"study_design_scores_gemma":[0.000005310614,0.000011830528,0.00003843252,0.0000024638236,0.0000041800045,0.00000839539,0.000009141557,0.9916357,0.000093625786,0.008026873,0.0001596812,0.0000044264025],"about_ca_topic_score_codex":0.004920194,"about_ca_topic_score_gemma":0.0028202771,"teacher_disagreement_score":0.004920194,"about_ca_system_score_codex":0.0013100448,"about_ca_system_score_gemma":0.00068603805,"threshold_uncertainty_score":0.009783089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1329828,0.0013928886,0.83603865,0.00020113192,0.00020147461,0.0003165212,0.0010741245,0.01555936,0.012232909],"genre_scores_gemma":[0.40868473,0.0006239336,0.57863444,0.00012021686,0.000077359044,0.00019540926,0.0038231376,0.0004356917,0.007405075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981266,0.000015215637,0.000014098627,0.000030801075,0.000100097444,0.000027172264],"domain_scores_gemma":[0.9997385,0.000051624083,0.000033276483,0.00007586078,0.00008261914,0.00001819093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023695633,0.00039781505,0.00042839238,0.00071446196,0.00033063244,0.00061853713,0.0008952419,0.00028714165,0.0025965564],"category_scores_gemma":[0.0006938081,0.00024359653,0.00034642153,0.0010525931,0.00025434667,0.0011922773,0.0008131442,0.00040772176,0.0011066645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079755555,0.00024295149,0.0054857526,0.0003805378,0.0001664112,0.00026170275,0.00017286808,0.11258469,0.076903954,0.013571613,0.028823553,0.7606085],"study_design_scores_gemma":[0.00017229204,0.00051702827,0.0024102305,0.000021119016,0.000083177096,0.0006280085,0.00010696826,0.8934041,0.066750154,0.0067876363,0.029061403,0.000057908812],"about_ca_topic_score_codex":0.001536724,"about_ca_topic_score_gemma":0.0025817868,"teacher_disagreement_score":0.0025965564,"about_ca_system_score_codex":0.00039202123,"about_ca_system_score_gemma":0.00095310574,"threshold_uncertainty_score":0.008686364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7281253,0.00094934314,0.2629937,0.00087500055,0.000056662004,0.00022527661,0.00044352873,0.0017034921,0.0046277153],"genre_scores_gemma":[0.9770387,0.00024412143,0.02209548,0.000039200484,0.000012880038,0.00004974117,0.00022224434,0.000031246793,0.0002663727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00019725224,0.000047622823,0.00018344613,0.0004596121,0.00012088691],"domain_scores_gemma":[0.99840754,0.00044345972,0.00022943875,0.0003013598,0.00048842904,0.00012972702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273518,0.0007726932,0.00056967273,0.0009770488,0.00062577415,0.0013996416,0.0014179136,0.00093110703,0.00035648464],"category_scores_gemma":[0.0032428438,0.0003385436,0.00037210365,0.002041784,0.0005102618,0.0012208464,0.00065294746,0.001269217,0.0002444229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036871934,0.0009814664,0.07059897,0.0002121716,0.000092634866,0.0002602309,0.0004027033,0.8223865,0.032353964,0.0117362235,0.0021423872,0.058464013],"study_design_scores_gemma":[0.0000037813186,0.000026679814,0.0028300926,0.0000036409035,0.0000050884078,0.000019334086,0.000030480755,0.9938294,0.0023759264,0.0005511943,0.00031755952,0.000006747476],"about_ca_topic_score_codex":0.02328143,"about_ca_topic_score_gemma":0.008012005,"teacher_disagreement_score":0.02328143,"about_ca_system_score_codex":0.0018057431,"about_ca_system_score_gemma":0.0013166537,"threshold_uncertainty_score":0.04629183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14339074,0.00072452787,0.84425294,0.00047783647,0.00014195967,0.00011279177,0.00025947267,0.00053081627,0.010108865],"genre_scores_gemma":[0.9688496,0.00067329383,0.026213944,0.00006078652,0.00007250349,0.00015694245,0.0001043072,0.00005227328,0.0038163671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968433,0.00006640591,0.000015414202,0.00007348173,0.0000876014,0.00007285935],"domain_scores_gemma":[0.99930716,0.00035151225,0.00010879169,0.000057853264,0.00013508557,0.000039595547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065717346,0.0006139056,0.0005072878,0.00052307243,0.0006917782,0.0011285094,0.0009958626,0.001213834,0.0012999226],"category_scores_gemma":[0.0028593878,0.0003528042,0.0005749905,0.00056785205,0.0007676328,0.0022234356,0.0007621762,0.0008545944,0.00020914676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020532489,0.000021463879,0.00083200133,0.000016632648,0.000009351913,0.00008355891,0.000052852098,0.97011065,0.0010636066,0.022877028,0.00039307878,0.004519218],"study_design_scores_gemma":[0.0000013913324,0.0000049848345,0.000077746256,0.0000020605669,0.0000021735195,0.000012996273,0.000004718349,0.9962077,0.000068424146,0.003388689,0.0002263893,0.000002677698],"about_ca_topic_score_codex":0.012416193,"about_ca_topic_score_gemma":0.0067714727,"teacher_disagreement_score":0.012416193,"about_ca_system_score_codex":0.0013212872,"about_ca_system_score_gemma":0.0012487569,"threshold_uncertainty_score":0.024687827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094132826,0.0009796992,0.8873915,0.00090661866,0.0001655808,0.00023666928,0.00042732104,0.0004993793,0.015260282],"genre_scores_gemma":[0.78784347,0.00070045405,0.20542957,0.00017393929,0.000054428026,0.00021995242,0.0004430417,0.00016671488,0.0049684346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988651,0.00038464472,0.00004427181,0.00021878263,0.00020171546,0.00028548655],"domain_scores_gemma":[0.99770796,0.0014381337,0.00021695413,0.00017751867,0.00026219626,0.00019719622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872104,0.0013246842,0.0015433059,0.0007489788,0.0011009565,0.0015924559,0.0010885306,0.0016471667,0.005832217],"category_scores_gemma":[0.0057617924,0.0009801193,0.00078535086,0.0010430501,0.0009790405,0.0022794323,0.001316502,0.0012438879,0.0005903592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041463612,0.00002079072,0.00016524424,0.000047729696,0.000008730805,0.000027742924,0.000018641336,0.9863724,0.0004619592,0.0062150746,0.00083583564,0.0057843253],"study_design_scores_gemma":[0.000005531417,0.000012230683,0.0000391052,0.0000034025238,0.0000027879812,0.00000806143,0.000016563114,0.9957793,0.00013508502,0.0036939739,0.0003013949,0.0000025519062],"about_ca_topic_score_codex":0.008994783,"about_ca_topic_score_gemma":0.0078016096,"teacher_disagreement_score":0.008994783,"about_ca_system_score_codex":0.0025579932,"about_ca_system_score_gemma":0.0029767868,"threshold_uncertainty_score":0.019510746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15274437,0.0005883414,0.84086806,0.0003667249,0.00012073363,0.00015665377,0.00007617139,0.0027685547,0.0023103678],"genre_scores_gemma":[0.81033206,0.00012975768,0.18732533,0.00017626608,0.000052409043,0.000058130707,0.000104668106,0.00012263042,0.0016986899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985733,0.00026768807,0.000100779675,0.0002625448,0.00046574054,0.00032991386],"domain_scores_gemma":[0.9974728,0.0008460961,0.00037212006,0.00058618514,0.0004468342,0.00027592527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015038843,0.0010254986,0.0011307267,0.0008647058,0.0006519992,0.0010932283,0.0031234303,0.0007883891,0.0013603126],"category_scores_gemma":[0.0033519126,0.00053008646,0.0005395959,0.000768282,0.0005901435,0.0018094358,0.0015340217,0.001037268,0.00023281932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000762604,0.000726388,0.0064540827,0.00021781947,0.00014860863,0.00030818288,0.00047200348,0.56676817,0.045911897,0.008452417,0.0033685968,0.36640924],"study_design_scores_gemma":[0.00006720952,0.000495645,0.0015013388,0.00002018225,0.000053764237,0.00020750755,0.00009038917,0.9748975,0.017093027,0.0030379302,0.0025002465,0.000035265366],"about_ca_topic_score_codex":0.0026164663,"about_ca_topic_score_gemma":0.004196808,"teacher_disagreement_score":0.0031234303,"about_ca_system_score_codex":0.0007728063,"about_ca_system_score_gemma":0.0020511681,"threshold_uncertainty_score":0.007953405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003007686,0.00021063045,0.99120235,0.00031330643,0.00006369069,0.00007761196,0.00003111214,0.00007492854,0.005018691],"genre_scores_gemma":[0.5286312,0.0009589226,0.4584658,0.00037429942,0.00023097631,0.0004981909,0.00009146557,0.00011837947,0.010630683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989197,0.00040803672,0.000039789255,0.00018289972,0.0002674754,0.00018210501],"domain_scores_gemma":[0.99941206,0.00027728392,0.00005335679,0.000058828813,0.000117349846,0.00008113577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022206518,0.00088451116,0.0011526297,0.0007777657,0.0013579088,0.0025462855,0.0029178385,0.0016680992,0.004816557],"category_scores_gemma":[0.0023630755,0.00049919897,0.0011677081,0.0012027622,0.0020748046,0.0034020047,0.0020838818,0.002232491,0.0004729556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038459966,0.00006946105,0.0001361497,0.000081452206,0.00003076119,0.00017209064,0.00012095371,0.29296273,0.001580578,0.686657,0.0027466968,0.015403659],"study_design_scores_gemma":[0.000016648219,0.000026018797,0.0000420588,0.000011020383,0.000008941421,0.000045572357,0.00003184942,0.8848557,0.000275195,0.11125397,0.003419474,0.000013541503],"about_ca_topic_score_codex":0.0043067713,"about_ca_topic_score_gemma":0.006177446,"teacher_disagreement_score":0.004816557,"about_ca_system_score_codex":0.0027179723,"about_ca_system_score_gemma":0.0028786093,"threshold_uncertainty_score":0.019720376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2097997,0.0003967779,0.77566725,0.0011595654,0.0001030426,0.0002734635,0.00024842186,0.0011212515,0.011230399],"genre_scores_gemma":[0.9509924,0.00010849802,0.04689602,0.00012087206,0.000030370762,0.00005836519,0.000054233984,0.00009454093,0.0016447234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969932,0.0013130453,0.00014425401,0.00047662682,0.00046646842,0.0006063133],"domain_scores_gemma":[0.9892463,0.006466269,0.0010920792,0.0016858251,0.0006900712,0.0008193505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058875987,0.00094856665,0.0018759078,0.0006766778,0.0009987131,0.003840254,0.0027762821,0.0015622013,0.0040056715],"category_scores_gemma":[0.017766703,0.00082830596,0.0008091716,0.0011119313,0.0020804836,0.0050425353,0.0024659834,0.002199078,0.00057998364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012864434,0.00031357913,0.0021590376,0.00020594875,0.00010546687,0.0005430562,0.00037343657,0.7520276,0.011030804,0.18740928,0.0036794795,0.04086584],"study_design_scores_gemma":[0.000050327893,0.000055433167,0.0001327688,0.0000094183415,0.000013068106,0.0000663976,0.000039451726,0.95346045,0.0011484551,0.044488773,0.0005203061,0.0000151121685],"about_ca_topic_score_codex":0.0025355178,"about_ca_topic_score_gemma":0.002145549,"teacher_disagreement_score":0.0058875987,"about_ca_system_score_codex":0.0023270382,"about_ca_system_score_gemma":0.0025852988,"threshold_uncertainty_score":0.03113699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03690897,0.00031453793,0.95841527,0.00056144904,0.000041055435,0.00006856928,0.000098362405,0.0002486587,0.003343078],"genre_scores_gemma":[0.813241,0.00041542973,0.18491453,0.00016011012,0.000040916424,0.00009148292,0.0001360284,0.00010297647,0.0008974356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911004,0.00029806243,0.00003999793,0.00017101715,0.00022936404,0.00015149055],"domain_scores_gemma":[0.99835265,0.0009363108,0.00018791405,0.00011858759,0.0003215206,0.00008293462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011595958,0.00091881974,0.0007837382,0.000546226,0.0005078865,0.0012430442,0.0010811734,0.00086962135,0.0013719127],"category_scores_gemma":[0.0047984244,0.0006022029,0.0003101403,0.0008865589,0.0006086044,0.002057819,0.0008489426,0.0012514604,0.00024682799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029746048,0.00004098606,0.0008526061,0.000059040194,0.000011271501,0.000045905013,0.00004181816,0.96735984,0.002813956,0.0058672717,0.0008667102,0.022010885],"study_design_scores_gemma":[0.0000037624218,0.000014105093,0.0000631368,0.000003968138,0.000004250225,0.000017020384,0.000024207298,0.996555,0.00040885032,0.0025855012,0.00031777335,0.0000024159156],"about_ca_topic_score_codex":0.0056813667,"about_ca_topic_score_gemma":0.009797786,"teacher_disagreement_score":0.0056813667,"about_ca_system_score_codex":0.0019928785,"about_ca_system_score_gemma":0.0025935795,"threshold_uncertainty_score":0.014459431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017313661,0.0024576376,0.97292715,0.0004600614,0.00011593462,0.00009181641,0.00027509968,0.0005737344,0.0057849353],"genre_scores_gemma":[0.5952371,0.0036631047,0.38728258,0.0005932956,0.00032171377,0.00034877902,0.0015038383,0.00041054448,0.010639046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998587,0.00043290676,0.00008177611,0.00018471779,0.0004817147,0.00023186528],"domain_scores_gemma":[0.9938444,0.0048643323,0.00025294517,0.00038694905,0.00051396893,0.00013742347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014764961,0.0010417844,0.0019334576,0.0012218155,0.0010595522,0.0017269102,0.0018702771,0.0013847392,0.0052595646],"category_scores_gemma":[0.00872948,0.00059554493,0.00094075245,0.0035603177,0.00091045327,0.0035902509,0.0018711184,0.0014171853,0.0016521605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029740922,0.00009297034,0.0008082609,0.0003331108,0.000051803752,0.00018930566,0.0002020024,0.8376934,0.002469916,0.054344658,0.010398163,0.09311896],"study_design_scores_gemma":[0.000013442208,0.00003636988,0.00008910082,0.000013470402,0.000008129538,0.00004577834,0.00002042556,0.9777575,0.00025876198,0.02052439,0.0012247579,0.000007852736],"about_ca_topic_score_codex":0.0054083257,"about_ca_topic_score_gemma":0.0048613166,"teacher_disagreement_score":0.0054083257,"about_ca_system_score_codex":0.0011710994,"about_ca_system_score_gemma":0.00182319,"threshold_uncertainty_score":0.017595053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015550099,0.0056336103,0.94795454,0.010102246,0.00041940343,0.00006232413,0.00008242162,0.00018672533,0.020008694],"genre_scores_gemma":[0.56250393,0.013601752,0.40475258,0.0014074631,0.0011388574,0.00026351417,0.00010820274,0.00043786186,0.015785815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967734,0.0020331305,0.000085502965,0.00035362615,0.00050712656,0.00024714388],"domain_scores_gemma":[0.99475706,0.0040840297,0.00015937276,0.0006519151,0.00020978141,0.00013787262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004329775,0.0011312341,0.001193646,0.0008210032,0.0013347245,0.00487446,0.0019346311,0.0021614342,0.003394071],"category_scores_gemma":[0.0128606595,0.0009627228,0.0008036068,0.001521541,0.006390528,0.012506066,0.0025786834,0.0051154466,0.0007133785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035157012,0.000014652519,0.00014284684,0.00011105568,0.000017627484,0.00006546507,0.0001638683,0.12942113,0.00027109403,0.8413069,0.002779909,0.025670273],"study_design_scores_gemma":[0.000013140988,0.000015504125,0.00005810586,0.000061376995,0.000009380663,0.00008790867,0.00012044591,0.19749899,0.0002482622,0.7900514,0.011817713,0.0000177529],"about_ca_topic_score_codex":0.0023834808,"about_ca_topic_score_gemma":0.0029161118,"teacher_disagreement_score":0.00487446,"about_ca_system_score_codex":0.0023467713,"about_ca_system_score_gemma":0.0015313225,"threshold_uncertainty_score":0.022898316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102562584,0.010610215,0.8352051,0.0031356977,0.0006809454,0.00009777664,0.00019695335,0.00063938677,0.046871286],"genre_scores_gemma":[0.9503193,0.0051181996,0.03742773,0.00044000286,0.0003882141,0.00010953639,0.00009984917,0.00011728587,0.005979959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00027873964,0.000035765308,0.00014540671,0.000457699,0.00020714053],"domain_scores_gemma":[0.99331915,0.005332369,0.00033171126,0.00052052544,0.00037311023,0.00012322128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454335,0.0009409421,0.000977627,0.0010127269,0.0006424959,0.0014879898,0.0012506988,0.0010067928,0.0028740212],"category_scores_gemma":[0.010248612,0.0004664195,0.00056025345,0.0014435614,0.0014512927,0.003434301,0.0019251811,0.0016914407,0.0005875788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006376201,0.00020929708,0.0019572494,0.00089313916,0.00010547116,0.0007178498,0.0004046336,0.46076027,0.029072508,0.38703713,0.009047055,0.10915777],"study_design_scores_gemma":[0.000049127826,0.00029531508,0.0012187135,0.00014809465,0.000075870536,0.0008959988,0.00016822375,0.8038449,0.008892301,0.17457336,0.009796701,0.000041396383],"about_ca_topic_score_codex":0.0005744986,"about_ca_topic_score_gemma":0.0005858062,"teacher_disagreement_score":0.0028740212,"about_ca_system_score_codex":0.001313824,"about_ca_system_score_gemma":0.0006456028,"threshold_uncertainty_score":0.009614527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021844953,0.00023061043,0.97691333,0.00008128499,0.000029208257,0.000009623689,0.0000086567325,0.00020370135,0.0006787216],"genre_scores_gemma":[0.9579315,0.00023419003,0.04063212,0.000042750857,0.000027870903,0.000018806493,0.000022208947,0.000017636394,0.0010729135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996111,0.000098055716,0.000015774416,0.00009261126,0.00012771007,0.000054863398],"domain_scores_gemma":[0.99957126,0.00020005925,0.00008100256,0.000049734328,0.00007585214,0.000021952386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046885115,0.0004956637,0.00050674315,0.00036613623,0.0003619953,0.0005578944,0.0006978964,0.0005876292,0.00044868756],"category_scores_gemma":[0.001345449,0.00032481467,0.00038504953,0.00040580507,0.0006481206,0.0007878007,0.00081311516,0.0006734039,0.00015141311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004962662,0.00001292784,0.00041196114,0.000034628218,0.000012106259,0.000054432185,0.00005789586,0.9505908,0.004142349,0.009287699,0.00022820734,0.035117373],"study_design_scores_gemma":[0.0000046603163,0.000029028037,0.00010046858,0.00000211866,0.000004388839,0.000018819013,0.0000070399346,0.9966935,0.00074440794,0.002126374,0.00026472114,0.0000045293777],"about_ca_topic_score_codex":0.005407577,"about_ca_topic_score_gemma":0.0034349929,"teacher_disagreement_score":0.005407577,"about_ca_system_score_codex":0.00046535963,"about_ca_system_score_gemma":0.00081148616,"threshold_uncertainty_score":0.010752201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25679338,0.0017031848,0.72865933,0.0008075085,0.00021732593,0.00029098266,0.00043477153,0.0031969778,0.007896569],"genre_scores_gemma":[0.9395615,0.00019140288,0.058579102,0.00017296559,0.00003381069,0.00006059984,0.00015412469,0.00013862648,0.0011078062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.00015831034,0.000029295756,0.00014359878,0.00018415919,0.00025242637],"domain_scores_gemma":[0.9983931,0.00076313823,0.0001669113,0.00016005387,0.0003008377,0.00021593254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011956932,0.0012198729,0.0007035053,0.00047591372,0.00075983634,0.0011206255,0.0014001929,0.00070317695,0.001899474],"category_scores_gemma":[0.0039717928,0.00029810792,0.00030722772,0.00062852487,0.00058740185,0.001362786,0.0010104174,0.0009168639,0.00024437907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036537927,0.00016775505,0.0020437664,0.00012761085,0.00003267331,0.00012537271,0.00008390645,0.8929957,0.013398359,0.0053820587,0.004200712,0.081076786],"study_design_scores_gemma":[0.000019698029,0.000095311094,0.00029461266,0.000006114491,0.0000071143413,0.000030502151,0.00004496299,0.9940644,0.002086646,0.0026197883,0.0007237163,0.0000071284817],"about_ca_topic_score_codex":0.009252915,"about_ca_topic_score_gemma":0.011667925,"teacher_disagreement_score":0.009252915,"about_ca_system_score_codex":0.0016593972,"about_ca_system_score_gemma":0.0024995261,"threshold_uncertainty_score":0.018398106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030041377,0.00054783496,0.9932247,0.00022763317,0.00010090195,0.000053009873,0.000023695184,0.00035804723,0.0024600204],"genre_scores_gemma":[0.45003363,0.0019173544,0.5399132,0.000272761,0.00053298665,0.0005444238,0.00020363266,0.00026910158,0.0063129524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989849,0.00038706776,0.00005014987,0.00021763718,0.00025166236,0.00010866143],"domain_scores_gemma":[0.99776137,0.0014452202,0.00021613945,0.0001864995,0.00029283352,0.00009797793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019915218,0.0012022039,0.0011039906,0.00068265543,0.0008407848,0.0015756419,0.0015154342,0.0011937727,0.002534123],"category_scores_gemma":[0.0068791923,0.00050189235,0.00041105365,0.0014359136,0.0010512703,0.0015160367,0.0013102706,0.0013065123,0.00075819984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007536385,0.00004954696,0.00029930493,0.00006491134,0.000019635421,0.000020776099,0.0000469917,0.90844476,0.00055014365,0.028891869,0.0026097766,0.05892688],"study_design_scores_gemma":[0.000030525352,0.00001465588,0.000029002125,0.0000062649697,0.0000047305452,0.000008696324,0.000008976516,0.98376507,0.00020596512,0.014547036,0.0013753811,0.0000037517348],"about_ca_topic_score_codex":0.0059541445,"about_ca_topic_score_gemma":0.0045076376,"teacher_disagreement_score":0.0059541445,"about_ca_system_score_codex":0.0017397362,"about_ca_system_score_gemma":0.0025419125,"threshold_uncertainty_score":0.012622774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074243275,0.00021679162,0.98885137,0.00019413127,0.000033691034,0.000024540714,0.000032893764,0.000074864256,0.003147441],"genre_scores_gemma":[0.7092581,0.0008030353,0.28191203,0.000327829,0.0001308783,0.0002552961,0.0001304658,0.00014043388,0.0070420178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.0002076162,0.000012390114,0.00006995794,0.00009383734,0.000067075816],"domain_scores_gemma":[0.9992453,0.00052176655,0.00007031439,0.000035142293,0.000092829076,0.00003480164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095113,0.0012509098,0.00095926004,0.0003935418,0.0003884438,0.00097272557,0.00071708474,0.00073441194,0.0018541567],"category_scores_gemma":[0.0018655778,0.0004341131,0.00053448626,0.00066977,0.00079305394,0.0008007704,0.0009663339,0.0009392218,0.00025870698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029714078,0.00001784596,0.00012721673,0.000039100792,0.000014715863,0.000038360646,0.000023120567,0.9714964,0.0010613828,0.016365787,0.000724763,0.0100616],"study_design_scores_gemma":[0.0000030011652,0.000017381353,0.000023260638,0.0000024728192,0.0000024856888,0.000007825965,0.000006260062,0.99485296,0.00019657043,0.0044979374,0.0003877152,0.0000022110705],"about_ca_topic_score_codex":0.0023740635,"about_ca_topic_score_gemma":0.0017584505,"teacher_disagreement_score":0.0023740635,"about_ca_system_score_codex":0.0010083887,"about_ca_system_score_gemma":0.0010569823,"threshold_uncertainty_score":0.0073164105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070209615,0.0007152609,0.91978997,0.00045836653,0.00032011216,0.0003042205,0.0002484058,0.0018844723,0.006069542],"genre_scores_gemma":[0.7227024,0.0004278887,0.2713866,0.00036665096,0.000137053,0.00018103096,0.00042481362,0.00028358717,0.0040899967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.00024207571,0.00007637049,0.00022918655,0.00036889687,0.0004226595],"domain_scores_gemma":[0.9982566,0.0006550816,0.0001733738,0.00028372285,0.00029771155,0.00033345388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018299705,0.0011643902,0.0013453433,0.00055878476,0.0014133804,0.0012708433,0.0032234676,0.00096591737,0.0016818551],"category_scores_gemma":[0.003215362,0.00054561277,0.0006303287,0.0012307169,0.0008976014,0.0015485001,0.0020701892,0.0012865033,0.00042807436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057387236,0.00029286207,0.0010359738,0.0001792721,0.000042349126,0.00019155986,0.00012566277,0.89132917,0.0076257116,0.016729152,0.0062958156,0.0755787],"study_design_scores_gemma":[0.00002012411,0.000029763754,0.000085762986,0.0000037495759,0.0000043919463,0.000021412445,0.000019812493,0.9939067,0.0011748701,0.003868058,0.0008594705,0.000005997871],"about_ca_topic_score_codex":0.011462522,"about_ca_topic_score_gemma":0.0090624215,"teacher_disagreement_score":0.011462522,"about_ca_system_score_codex":0.0018279455,"about_ca_system_score_gemma":0.0037294093,"threshold_uncertainty_score":0.022791564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848681,0.00013800032,0.013499931,0.000045418972,0.00001568617,0.000028462557,0.0001277873,0.0006484804,0.0006281692],"genre_scores_gemma":[0.9967384,0.000037442256,0.0030548526,0.0000071113623,0.0000020126004,0.0000082169445,0.00008137584,0.000015110102,0.00005546128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908364,0.00015245467,0.00004130828,0.00017993881,0.00040436035,0.00013827092],"domain_scores_gemma":[0.9984434,0.00046052336,0.00018340728,0.0002209573,0.00059579447,0.00009590403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538284,0.00066075433,0.00038768875,0.00071532483,0.00030724442,0.00046731846,0.00083681685,0.0004417253,0.0002504001],"category_scores_gemma":[0.0028777295,0.0002386129,0.00020831723,0.0010833204,0.00031954492,0.0006313776,0.00034508028,0.00054391276,0.000070863534],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014549997,0.0009538528,0.1103829,0.0003572669,0.00024228232,0.00047482963,0.0003112545,0.43514812,0.3405935,0.0026191717,0.0022248197,0.10523693],"study_design_scores_gemma":[0.000040309977,0.0006541199,0.04484705,0.000010079637,0.00006626044,0.00015489398,0.000062912906,0.836442,0.11668956,0.0002964109,0.0006895682,0.00004688301],"about_ca_topic_score_codex":0.005531588,"about_ca_topic_score_gemma":0.0032154324,"teacher_disagreement_score":0.005531588,"about_ca_system_score_codex":0.0010012959,"about_ca_system_score_gemma":0.00056549074,"threshold_uncertainty_score":0.0109987855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12384772,0.0005791811,0.8712556,0.00014076261,0.00007769359,0.000078282865,0.000037008125,0.00096764154,0.0030162276],"genre_scores_gemma":[0.6959006,0.0006903477,0.29832545,0.00008315521,0.00006580051,0.00006827426,0.00013516899,0.000067180576,0.0046639373],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984705,0.000026548036,0.000007793883,0.00001960199,0.00008331389,0.000015683894],"domain_scores_gemma":[0.99974626,0.00009046297,0.000038974038,0.000044693374,0.00007130854,0.000008394409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022498067,0.0003668796,0.00025209755,0.0004990715,0.00017742698,0.00021174965,0.0004236959,0.00024371523,0.00079131586],"category_scores_gemma":[0.0006378584,0.00010815295,0.0002747086,0.0003091944,0.00022606463,0.0006479853,0.00029556543,0.0003897623,0.00025792696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003329664,0.000113864284,0.0006056547,0.00017540307,0.000031604894,0.00017609495,0.00015103885,0.02938637,0.6541484,0.008538543,0.0011490413,0.30519107],"study_design_scores_gemma":[0.000030433153,0.00032030517,0.0007570847,0.000022373031,0.00003611797,0.00044596702,0.000041950232,0.46433932,0.52729213,0.0014401539,0.0052531045,0.000020992897],"about_ca_topic_score_codex":0.00026904605,"about_ca_topic_score_gemma":0.0003526436,"teacher_disagreement_score":0.00079131586,"about_ca_system_score_codex":0.00019103289,"about_ca_system_score_gemma":0.00023639623,"threshold_uncertainty_score":0.002647221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04707702,0.0009813373,0.93979526,0.0005223502,0.00008904779,0.00014187302,0.000098288874,0.00019132147,0.011103477],"genre_scores_gemma":[0.9102332,0.0005502779,0.08573716,0.00010123229,0.00004942974,0.00009844763,0.00008372291,0.000037011632,0.0031094481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919504,0.00021632042,0.000027625236,0.00012733448,0.0002338687,0.00019988346],"domain_scores_gemma":[0.99968505,0.0001113587,0.000038123515,0.00006800265,0.00006799267,0.000029402203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008196778,0.0005668584,0.0006226704,0.00042639847,0.0010805905,0.0011880894,0.0013465515,0.0005228442,0.0018376005],"category_scores_gemma":[0.0015420582,0.0002256062,0.0003486905,0.0008513093,0.00060503365,0.0015742247,0.001301193,0.0005349324,0.00029817782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019240491,0.0000928146,0.0006301463,0.00009691211,0.000044969096,0.0002597121,0.0001107995,0.6909346,0.007376177,0.2054446,0.005616216,0.08920064],"study_design_scores_gemma":[0.000005828792,0.00001736156,0.0001315757,0.000005055794,0.0000056029185,0.00003734148,0.00002542139,0.9745714,0.0007016424,0.022305036,0.0021885517,0.000005209034],"about_ca_topic_score_codex":0.0050292728,"about_ca_topic_score_gemma":0.0077389064,"teacher_disagreement_score":0.0050292728,"about_ca_system_score_codex":0.0019396676,"about_ca_system_score_gemma":0.0015672588,"threshold_uncertainty_score":0.014073372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026432857,0.00031954885,0.9668513,0.00036435918,0.000110783236,0.00008286613,0.00009396332,0.0017146224,0.0040297126],"genre_scores_gemma":[0.7606765,0.0002841745,0.23182069,0.00047282552,0.00011224842,0.00017181305,0.00022981106,0.00018945722,0.006042561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.000107059386,0.00001228186,0.00007347475,0.000076840515,0.000068512316],"domain_scores_gemma":[0.999405,0.0002990183,0.00003512794,0.00004848576,0.00013097048,0.000081406004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294132,0.00074408815,0.0008721689,0.00033595366,0.0004641971,0.0009117489,0.0016933082,0.0012444799,0.0021349164],"category_scores_gemma":[0.0025017944,0.00033250346,0.00046945037,0.0002873372,0.000710009,0.0012357079,0.002130707,0.0019164097,0.00049487443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034618235,0.00033391814,0.0013935139,0.00008691606,0.00006825054,0.00012141324,0.00019228025,0.8030715,0.0047335913,0.013880659,0.007972174,0.16779953],"study_design_scores_gemma":[0.000013449337,0.00002039282,0.000039120045,0.000002728654,0.0000028030784,0.000004258422,0.000008938767,0.99653244,0.00040677926,0.0025020535,0.00046391695,0.0000030833862],"about_ca_topic_score_codex":0.0074601737,"about_ca_topic_score_gemma":0.010005552,"teacher_disagreement_score":0.0074601737,"about_ca_system_score_codex":0.0008886899,"about_ca_system_score_gemma":0.0012006338,"threshold_uncertainty_score":0.01483351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30001783,0.00029205272,0.6893034,0.0002857351,0.00013996067,0.00015991741,0.00009033456,0.005915859,0.0037949248],"genre_scores_gemma":[0.97422373,0.00006507577,0.024236713,0.000068943,0.000052914802,0.000044229768,0.00006633896,0.00008190737,0.00116007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991309,0.00011209599,0.000045116754,0.0002136037,0.00029253997,0.00020571708],"domain_scores_gemma":[0.9990754,0.00025122546,0.00015280857,0.00018610331,0.00022637121,0.0001080773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000821132,0.00075668836,0.0007089319,0.00080632715,0.0009979483,0.0012221572,0.0014802768,0.00039663477,0.0018686773],"category_scores_gemma":[0.0019839222,0.0002597341,0.00041763237,0.00091147836,0.00054947997,0.0017154375,0.0010211227,0.0006955618,0.00033474356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015575417,0.00077335845,0.010186852,0.00016124369,0.00019439781,0.00039445361,0.0005187092,0.3406682,0.13046223,0.010440861,0.006755991,0.4978861],"study_design_scores_gemma":[0.000054248478,0.0002201449,0.001487921,0.0000036252482,0.00003519129,0.00009678329,0.00007666658,0.97788656,0.015282334,0.0031976248,0.0016337422,0.000025147607],"about_ca_topic_score_codex":0.00308202,"about_ca_topic_score_gemma":0.002953989,"teacher_disagreement_score":0.00308202,"about_ca_system_score_codex":0.00062745565,"about_ca_system_score_gemma":0.0013415497,"threshold_uncertainty_score":0.006251335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077905473,0.00013468988,0.9875809,0.00015964384,0.000061451414,0.00010890337,0.000039599996,0.00010445565,0.0040198704],"genre_scores_gemma":[0.6846516,0.0003684749,0.30965012,0.00027066743,0.00008106382,0.00030261034,0.00009618584,0.000074330266,0.0045050085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991999,0.0003411452,0.000031070762,0.0001175041,0.00016772588,0.00014259644],"domain_scores_gemma":[0.99947685,0.00026611765,0.000060250146,0.000026290383,0.00008331721,0.00008719994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013279427,0.0011131406,0.0012230775,0.0006824073,0.00077581115,0.0014063838,0.0019337052,0.0011461289,0.0024067848],"category_scores_gemma":[0.0013813897,0.0004824221,0.0013019231,0.0006789662,0.0008587292,0.0012152143,0.0014177151,0.0010843416,0.00023789731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000769938,0.00009943083,0.00042298157,0.000083669845,0.00009763775,0.00014973998,0.000091769594,0.9184474,0.0019182551,0.05384981,0.0016506867,0.023111666],"study_design_scores_gemma":[0.000010755991,0.000028824217,0.000049228947,0.0000051556053,0.000010109368,0.000018543613,0.000016928214,0.9888461,0.00018067268,0.01011985,0.0007067475,0.000007114837],"about_ca_topic_score_codex":0.006929944,"about_ca_topic_score_gemma":0.0065832133,"teacher_disagreement_score":0.006929944,"about_ca_system_score_codex":0.0015649205,"about_ca_system_score_gemma":0.0023231767,"threshold_uncertainty_score":0.013779223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052762304,0.0008538995,0.9409003,0.00015572198,0.00010199436,0.00007957181,0.00004504038,0.002911471,0.002189656],"genre_scores_gemma":[0.8693199,0.00045286358,0.1277715,0.00015271537,0.00009865867,0.00009511112,0.00012728974,0.0001510724,0.0018308889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837613,0.00036785635,0.00009226179,0.0003079123,0.00058971543,0.000266163],"domain_scores_gemma":[0.99752814,0.0008781776,0.00034932388,0.0005950104,0.00055509433,0.00009424924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586573,0.001042025,0.0011040858,0.00083004666,0.0007588142,0.0011193148,0.0012740484,0.000564332,0.0010052857],"category_scores_gemma":[0.004520299,0.00036894155,0.0003264834,0.00069562916,0.0007056601,0.0015593442,0.0016774782,0.0011986454,0.00065160816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008975954,0.00047203255,0.0039618993,0.00023676417,0.00012520961,0.00056772615,0.00046858814,0.3764334,0.21456717,0.017828234,0.005694182,0.37874722],"study_design_scores_gemma":[0.000023388056,0.00019732931,0.00054650946,0.000017121254,0.00002236308,0.00034024863,0.00005892511,0.94742703,0.045214742,0.003747235,0.0023563895,0.0000487701],"about_ca_topic_score_codex":0.0012333691,"about_ca_topic_score_gemma":0.0010102286,"teacher_disagreement_score":0.001586573,"about_ca_system_score_codex":0.00075509644,"about_ca_system_score_gemma":0.00050366647,"threshold_uncertainty_score":0.008390665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01624811,0.00029145126,0.9821957,0.00022601108,0.000037670994,0.000035230823,0.00007530941,0.0003480127,0.00054255675],"genre_scores_gemma":[0.66625774,0.0010183878,0.3290002,0.00022594449,0.00026701845,0.00014565983,0.0006475493,0.00012845098,0.0023090083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00035203344,0.00005671143,0.00018256219,0.000303908,0.00013632093],"domain_scores_gemma":[0.99790597,0.00092140026,0.00027471094,0.0003330679,0.0004244877,0.0001404942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015060474,0.0014111552,0.0009676865,0.0006478266,0.00044566256,0.00073426985,0.0012011153,0.0007220326,0.001054253],"category_scores_gemma":[0.0058326097,0.0004376378,0.0006149597,0.000977837,0.00075614854,0.002092215,0.0014380867,0.00170823,0.0003148213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055589684,0.00017932961,0.0048600323,0.00024780596,0.00014987451,0.0003076623,0.00027744562,0.69048125,0.017390072,0.020588635,0.0048783002,0.2600838],"study_design_scores_gemma":[0.0000062234167,0.000030793595,0.00021272193,0.000005018639,0.000006478066,0.000030187193,0.00001643525,0.9956102,0.0010065541,0.002784536,0.00028309188,0.000007762545],"about_ca_topic_score_codex":0.0068506645,"about_ca_topic_score_gemma":0.007631719,"teacher_disagreement_score":0.0068506645,"about_ca_system_score_codex":0.00059480296,"about_ca_system_score_gemma":0.00127147,"threshold_uncertainty_score":0.013621569},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039435655,0.0014086609,0.95140463,0.000369022,0.00015228504,0.00012056392,0.00011964623,0.000300827,0.0066887694],"genre_scores_gemma":[0.8691412,0.0010135713,0.12649813,0.00014148376,0.00008425096,0.000104926046,0.00014494093,0.000073107956,0.0027983547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.000399679,0.000056778732,0.0001540459,0.0002094333,0.00023280321],"domain_scores_gemma":[0.998536,0.0008661232,0.00016026129,0.00016623712,0.0001471214,0.00012425911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012880063,0.000617103,0.0006887941,0.00039934786,0.0010679007,0.0012338267,0.0012190783,0.0005910514,0.001585435],"category_scores_gemma":[0.0026480148,0.00034329004,0.0003543828,0.0012789122,0.0007922718,0.0011451434,0.0009965654,0.00081368984,0.00025758366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015192982,0.000050671173,0.0006064907,0.00011710906,0.000030060237,0.0001341825,0.00014124783,0.86321354,0.0027909176,0.078369126,0.003665366,0.050729427],"study_design_scores_gemma":[0.000019115769,0.00005349465,0.0001176065,0.000008347248,0.0000088714,0.000056988272,0.000058454047,0.9715589,0.001099444,0.023640636,0.0033677833,0.000010331636],"about_ca_topic_score_codex":0.006581424,"about_ca_topic_score_gemma":0.006986268,"teacher_disagreement_score":0.006581424,"about_ca_system_score_codex":0.0015099907,"about_ca_system_score_gemma":0.002755317,"threshold_uncertainty_score":0.013086259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04861461,0.0003375048,0.94488364,0.00036061983,0.00008509245,0.000052552383,0.000038751175,0.00040257667,0.005224598],"genre_scores_gemma":[0.929847,0.00014825843,0.067167625,0.00009615635,0.000029827448,0.000058712525,0.000047255235,0.0000455019,0.0025596654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999648,0.00007846034,0.000012491148,0.000061936844,0.000077884724,0.000121152836],"domain_scores_gemma":[0.99978024,0.000076578275,0.000034934226,0.000031255437,0.00003502947,0.000041922587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044423767,0.00077201973,0.00089965854,0.00037303116,0.00050229696,0.0008644283,0.0010875532,0.00080604246,0.0015141554],"category_scores_gemma":[0.0008894213,0.00030667288,0.00068658555,0.00045210635,0.00038350542,0.00085196656,0.0011895819,0.000665741,0.00021841067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079149744,0.00007843051,0.00082737,0.000040429975,0.00003570346,0.00012724083,0.0000490668,0.9384336,0.0037282247,0.0060484507,0.0010824379,0.049470022],"study_design_scores_gemma":[0.0000034697584,0.000021400354,0.000102205755,0.0000023430675,0.0000057194093,0.000018874816,0.000012209823,0.9979259,0.00030645228,0.0012547382,0.00034336754,0.0000033311267],"about_ca_topic_score_codex":0.0044964026,"about_ca_topic_score_gemma":0.0044960594,"teacher_disagreement_score":0.0044964026,"about_ca_system_score_codex":0.000539717,"about_ca_system_score_gemma":0.0010192211,"threshold_uncertainty_score":0.008940458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1955888,0.00021766184,0.77869225,0.0002925136,0.00006296377,0.00015800014,0.00019322245,0.021210866,0.003583687],"genre_scores_gemma":[0.84048223,0.00018210942,0.15506244,0.00019477027,0.000019392482,0.00016913239,0.00025341444,0.0014037389,0.0022327476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571675,0.0012240213,0.0003575051,0.0007897628,0.0013900681,0.0005218784],"domain_scores_gemma":[0.9885888,0.0054611196,0.0012792513,0.0036573214,0.00080384524,0.00020966757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004466745,0.000835109,0.00054064865,0.00069189584,0.0008160605,0.0023048501,0.0023004266,0.0009164101,0.0014874757],"category_scores_gemma":[0.0109130535,0.0010199624,0.0008280598,0.00042451822,0.003389387,0.0042267763,0.0029273024,0.0018935025,0.00027590734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018922613,0.0006562605,0.024291348,0.00112418,0.00027111,0.002749292,0.0035434538,0.31921592,0.17414214,0.25158617,0.007114947,0.21341293],"study_design_scores_gemma":[0.00020780742,0.00025762158,0.001364404,0.00012825227,0.00012212816,0.000349419,0.00025084868,0.74863714,0.17886299,0.054050386,0.015691066,0.00007789643],"about_ca_topic_score_codex":0.004177403,"about_ca_topic_score_gemma":0.004168122,"teacher_disagreement_score":0.004466745,"about_ca_system_score_codex":0.0014909322,"about_ca_system_score_gemma":0.0021780834,"threshold_uncertainty_score":0.023622692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8921354,0.0048729004,0.034472153,0.01053292,0.00015465455,0.00026682616,0.0025361555,0.00013780496,0.054891277],"genre_scores_gemma":[0.9885886,0.00076592906,0.0050621373,0.00038722722,0.00009571644,0.00009177743,0.00067691255,0.000050117953,0.004281668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99876153,0.00068776915,0.000036302434,0.00021117741,0.00015258294,0.00015055253],"domain_scores_gemma":[0.9885231,0.009138983,0.000861845,0.00039295293,0.00052688725,0.00055618794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033968254,0.00047811543,0.0007801741,0.0008055269,0.0013996636,0.0030350867,0.0010533414,0.0017340273,0.008490561],"category_scores_gemma":[0.016139533,0.00020879209,0.0006128515,0.0014159981,0.001402047,0.005762052,0.0010771577,0.002011211,0.0007219404],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002076208,0.0018764436,0.13306177,0.0009189968,0.00030004303,0.0022457286,0.0054585417,0.11443812,0.003313567,0.51774764,0.07219982,0.14636315],"study_design_scores_gemma":[0.00029948534,0.0004548011,0.04978017,0.0002882483,0.00008312871,0.00085850974,0.009211717,0.533276,0.0014334747,0.3542968,0.049836308,0.00018131422],"about_ca_topic_score_codex":0.0075841574,"about_ca_topic_score_gemma":0.0068979496,"teacher_disagreement_score":0.008490561,"about_ca_system_score_codex":0.0017076951,"about_ca_system_score_gemma":0.00063475553,"threshold_uncertainty_score":0.028403759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016935319,0.00017494503,0.9743532,0.0002933446,0.00006028964,0.00018235906,0.00010441724,0.003153988,0.0047420715],"genre_scores_gemma":[0.39167485,0.0004602255,0.5978157,0.00019689712,0.000089634115,0.00041833575,0.0005636586,0.0005224025,0.0082584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.0003022573,0.000091944275,0.00018305228,0.0003754288,0.00010253135],"domain_scores_gemma":[0.99765116,0.0005487541,0.0002547304,0.0010255957,0.00035588306,0.0001639139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312244,0.00047116762,0.0005391393,0.0012693645,0.001014962,0.002041724,0.0019201675,0.00082469115,0.002377539],"category_scores_gemma":[0.0033650198,0.00032674716,0.0005725744,0.0015531797,0.0010379737,0.0041296515,0.002416484,0.0009264797,0.0010691029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036838884,0.00029965313,0.0018303103,0.00038556854,0.000098509416,0.00029325488,0.0012417553,0.18208328,0.08088462,0.3375917,0.013719358,0.38120362],"study_design_scores_gemma":[0.00007759191,0.00023119025,0.0009262112,0.000033348322,0.000061780775,0.00031403903,0.00028608623,0.77447915,0.046211824,0.09968436,0.07759471,0.00009973284],"about_ca_topic_score_codex":0.0017258971,"about_ca_topic_score_gemma":0.0026392958,"teacher_disagreement_score":0.002377539,"about_ca_system_score_codex":0.0009510661,"about_ca_system_score_gemma":0.0012221605,"threshold_uncertainty_score":0.007953644},"labels":[],"label_agreement":null},{"id":"W3205923723","doi":"10.1109/tnet.2021.3118006","title":"Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth Tomography","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Bandwidth (computing); Computer science; Inference; Artificial intelligence; Path (computing); Inverse; Algorithm; Mathematics; Computer network","score_opus":0.012964939210906998,"score_gpt":0.2284827704830011,"score_spread":0.21551783127209412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205923723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008638437,0.000104781284,0.9899457,0.0001508767,0.00001366936,0.000028206825,0.000041910098,0.00042698914,0.0006494237],"genre_scores_gemma":[0.56313473,0.00023676959,0.433598,0.00019472875,0.00006685081,0.00022083153,0.0003274222,0.00028537255,0.0019353039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752086,0.0010165187,0.00011167419,0.00068538944,0.00042178654,0.0002437333],"domain_scores_gemma":[0.97823787,0.017270274,0.0013557009,0.0017794962,0.0009306414,0.00042616366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036644586,0.0014414384,0.0017471926,0.0012799315,0.00087756483,0.0014291682,0.0031031272,0.0019873164,0.0030880768],"category_scores_gemma":[0.029533481,0.0010781751,0.0009514001,0.0012366611,0.0023025374,0.0042793746,0.002929455,0.0037765955,0.00048594867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016244428,0.00007770605,0.0015416826,0.00010665006,0.000042230484,0.00008332747,0.00015763676,0.9104083,0.0013642631,0.029937262,0.0011816248,0.054936785],"study_design_scores_gemma":[0.0000123174295,0.000016666085,0.00009569382,0.000009665885,0.0000062166,0.00001869866,0.000011528725,0.9795904,0.00068308756,0.019302562,0.00024632624,0.0000067535725],"about_ca_topic_score_codex":0.007150798,"about_ca_topic_score_gemma":0.006311903,"teacher_disagreement_score":0.007150798,"about_ca_system_score_codex":0.0022160248,"about_ca_system_score_gemma":0.0027042055,"threshold_uncertainty_score":0.019379795},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11113868,0.00039922903,0.8638853,0.00040253755,0.0002561011,0.0002245032,0.00019351851,0.014081975,0.009418163],"genre_scores_gemma":[0.75961655,0.00016711379,0.23053744,0.00023943995,0.00012867355,0.00016015177,0.00042344246,0.0005382084,0.008189033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00015622961,0.00006325456,0.00018297328,0.0004219777,0.00016370037],"domain_scores_gemma":[0.99787664,0.0004948327,0.00019008506,0.0007868925,0.00053998426,0.00011157752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010848809,0.0007053582,0.0005029627,0.00075873075,0.00087770744,0.0013430038,0.0030340957,0.000591756,0.0037957123],"category_scores_gemma":[0.0030804381,0.00034588343,0.00026170383,0.0007155719,0.0005661883,0.0027317384,0.001805804,0.001166233,0.0009238295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013692467,0.0008695361,0.005581936,0.00039040446,0.00017617445,0.0004036082,0.00085900415,0.28274626,0.16653886,0.025236849,0.020385426,0.49544278],"study_design_scores_gemma":[0.00011568173,0.00033197275,0.0006681231,0.000015481335,0.000046126963,0.00015962175,0.00017049401,0.8692998,0.10672082,0.009864369,0.012561571,0.0000458832],"about_ca_topic_score_codex":0.0028505153,"about_ca_topic_score_gemma":0.004717993,"teacher_disagreement_score":0.0037957123,"about_ca_system_score_codex":0.0008549466,"about_ca_system_score_gemma":0.0012846831,"threshold_uncertainty_score":0.012697935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08215876,0.0017219523,0.9043151,0.0005471497,0.000050001727,0.00008751223,0.000042468626,0.0002214937,0.010855485],"genre_scores_gemma":[0.9363848,0.00051115727,0.06212139,0.000086430715,0.00007089142,0.000061011717,0.000013395059,0.000024964243,0.00072586926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.00079678075,0.000024727304,0.00012210303,0.0002956826,0.0002152333],"domain_scores_gemma":[0.9957937,0.0028563654,0.0003568016,0.00062313,0.00026177205,0.00010816011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026076771,0.0009545325,0.0009691235,0.00045637833,0.00079238275,0.0019203722,0.0014154136,0.001090311,0.0011779128],"category_scores_gemma":[0.0059443424,0.0004003778,0.00051831314,0.00081598817,0.0019441794,0.002060602,0.0013702896,0.0012302616,0.00017061083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004804476,0.000054404634,0.0004971713,0.000044694792,0.00002254335,0.000055034074,0.00003842584,0.96069247,0.0016457278,0.026745167,0.00025923012,0.009897059],"study_design_scores_gemma":[0.0000065773115,0.00004225699,0.00011669776,0.0000056449735,0.000006910722,0.000023650304,0.000021394571,0.9900085,0.0007275649,0.00886492,0.00016953486,0.000006408188],"about_ca_topic_score_codex":0.0020994353,"about_ca_topic_score_gemma":0.0031770393,"teacher_disagreement_score":0.0026076771,"about_ca_system_score_codex":0.0019015264,"about_ca_system_score_gemma":0.0010870844,"threshold_uncertainty_score":0.013796568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03951605,0.00044838374,0.8703574,0.0002175886,0.00010125711,0.000309597,0.0003601872,0.08298351,0.0057059475],"genre_scores_gemma":[0.49039498,0.00016474955,0.5016195,0.00021395538,0.00003287778,0.00026754118,0.0007686405,0.0031416088,0.003396241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989178,0.00019016239,0.000055137807,0.000280624,0.00038551007,0.00017086214],"domain_scores_gemma":[0.99870074,0.00054001063,0.00015293756,0.00027749914,0.00021553937,0.000113270384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120819,0.0017814288,0.00074900774,0.0009815436,0.000733518,0.0012041029,0.0028927743,0.0009793959,0.00687845],"category_scores_gemma":[0.00443938,0.00081592245,0.0005733411,0.00066934986,0.00085469615,0.002070876,0.0016959873,0.0014493011,0.0018107815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012348358,0.0005175593,0.0038081899,0.00047869098,0.00015616532,0.0004079016,0.00029934326,0.39172766,0.06921695,0.009882568,0.04428829,0.47798195],"study_design_scores_gemma":[0.000081558,0.00010176469,0.00038377417,0.000012331079,0.000011429164,0.00006288697,0.000033672946,0.97785187,0.014798276,0.0033966773,0.0032337976,0.00003190782],"about_ca_topic_score_codex":0.0048782616,"about_ca_topic_score_gemma":0.00781346,"teacher_disagreement_score":0.00687845,"about_ca_system_score_codex":0.0012898037,"about_ca_system_score_gemma":0.0021997152,"threshold_uncertainty_score":0.023010671},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6570909,0.00088342,0.30870536,0.0010174363,0.0002262351,0.00023607748,0.00053272466,0.0030932731,0.02821452],"genre_scores_gemma":[0.99179935,0.000097185846,0.006636316,0.00007591084,0.000011828824,0.000033097618,0.000056854165,0.000041276737,0.001248113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9963039,0.001142811,0.00015902193,0.0005448322,0.0012053832,0.00064398785],"domain_scores_gemma":[0.994017,0.0019656643,0.0008747269,0.0021416724,0.00079347036,0.00020745026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379837,0.00046270504,0.0006085548,0.0008567105,0.0021986763,0.0019213138,0.0010445039,0.0013699764,0.0017225187],"category_scores_gemma":[0.007284435,0.0002701202,0.0007306858,0.000770621,0.0027856922,0.004082467,0.0031089906,0.0013127527,0.00037627041],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014176572,0.00016507177,0.025905767,0.0007623013,0.00038050054,0.0063085156,0.007951829,0.29565573,0.06652663,0.45195094,0.015994841,0.12698026],"study_design_scores_gemma":[0.000037204994,0.00050527015,0.008815948,0.00016276796,0.0002825973,0.0088799,0.0038751843,0.6831741,0.10397396,0.1315321,0.0584627,0.00029819444],"about_ca_topic_score_codex":0.0016892747,"about_ca_topic_score_gemma":0.00090648024,"teacher_disagreement_score":0.0021986763,"about_ca_system_score_codex":0.0013129171,"about_ca_system_score_gemma":0.0008818766,"threshold_uncertainty_score":0.009525895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137305595,0.00046890308,0.9814966,0.0005589996,0.00007657764,0.0001410005,0.000056585726,0.00032663703,0.0031441015],"genre_scores_gemma":[0.67164296,0.0006335032,0.32221538,0.0005629187,0.00014706141,0.00049550907,0.0002063877,0.00019448182,0.0039016851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931,0.00017209053,0.000032671265,0.00016000206,0.00019304792,0.00013212142],"domain_scores_gemma":[0.99838567,0.0008679237,0.00020781724,0.0001431816,0.00023414148,0.00016134843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014518463,0.001424108,0.0013999515,0.0004681212,0.0005302815,0.0010623478,0.0016399357,0.0016251373,0.0019583139],"category_scores_gemma":[0.0047870846,0.0004507257,0.0004937483,0.0010301243,0.001096799,0.0011719866,0.0018216434,0.00201928,0.00028397646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099062825,0.00007023842,0.0005224776,0.00007921278,0.000021624839,0.00008805957,0.000047148427,0.9544131,0.0010557101,0.011539364,0.0017328304,0.03033115],"study_design_scores_gemma":[0.000008414687,0.000013941953,0.000026236796,0.0000035392998,0.000002341381,0.000013085492,0.000004613226,0.9975719,0.00018655977,0.0019158857,0.00025047208,0.000003023097],"about_ca_topic_score_codex":0.0062165447,"about_ca_topic_score_gemma":0.0046337564,"teacher_disagreement_score":0.0062165447,"about_ca_system_score_codex":0.0011823424,"about_ca_system_score_gemma":0.0023168856,"threshold_uncertainty_score":0.012360752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01037402,0.00069801806,0.9843536,0.00030040342,0.000098128374,0.00006904398,0.00008051976,0.00018898584,0.0038374306],"genre_scores_gemma":[0.83604056,0.002420872,0.14841086,0.00042706565,0.00039444235,0.00050034496,0.0005723841,0.00026665613,0.010966768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00027459604,0.000029383353,0.00017620363,0.00022241028,0.00011412835],"domain_scores_gemma":[0.99770975,0.0015792736,0.00023059893,0.00010422724,0.00028254272,0.00009354477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019466672,0.0013396153,0.0011760361,0.0007326559,0.000615968,0.0011980719,0.0016123925,0.0012626948,0.0028388856],"category_scores_gemma":[0.005656751,0.0004326977,0.0006758561,0.0010547021,0.0010077611,0.0014123914,0.0017032801,0.0013061657,0.00055983255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017749076,0.00005472371,0.00044844198,0.00032596395,0.000057422752,0.0001711326,0.00017448758,0.9197526,0.0032976274,0.040967453,0.004505676,0.030066956],"study_design_scores_gemma":[0.000022211138,0.000038861825,0.00007607761,0.000010958252,0.000014426485,0.000028541295,0.000031942185,0.9863549,0.0003811666,0.01232659,0.00070657703,0.000007769853],"about_ca_topic_score_codex":0.0028071483,"about_ca_topic_score_gemma":0.0026388378,"teacher_disagreement_score":0.0028388856,"about_ca_system_score_codex":0.0012364567,"about_ca_system_score_gemma":0.0011650154,"threshold_uncertainty_score":0.010295093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12665069,0.00021490372,0.86686414,0.00026572443,0.00007565668,0.00008553001,0.00003934108,0.00012651333,0.005677415],"genre_scores_gemma":[0.9579342,0.00007905681,0.038831856,0.000062112966,0.000042166244,0.00005995238,0.000021884282,0.000030657964,0.002938107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974031,0.0010523454,0.00010678877,0.00050311635,0.00044481026,0.0004898301],"domain_scores_gemma":[0.99741566,0.0012951369,0.00022656484,0.0005393448,0.00023472295,0.0002886332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043366565,0.0007322898,0.0011762192,0.0005119509,0.0013641411,0.0025403884,0.0020040276,0.0010891494,0.0014634005],"category_scores_gemma":[0.005260633,0.00039472518,0.00070148584,0.00078712904,0.0020331172,0.0037628175,0.0020257381,0.0010706547,0.00019798968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042235816,0.00012744805,0.0018291771,0.00007086431,0.000110166206,0.00045019406,0.00024557702,0.79511106,0.0077102873,0.16932155,0.0007469714,0.023854394],"study_design_scores_gemma":[0.000024636942,0.000043850494,0.0002773716,0.0000068501013,0.000018960494,0.000056078632,0.00006966949,0.9559471,0.001991523,0.040566213,0.0009834197,0.000014212053],"about_ca_topic_score_codex":0.001954422,"about_ca_topic_score_gemma":0.0015636911,"teacher_disagreement_score":0.0043366565,"about_ca_system_score_codex":0.0017353551,"about_ca_system_score_gemma":0.0014016625,"threshold_uncertainty_score":0.022934675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06878001,0.0014149499,0.8706317,0.0003997605,0.0002881842,0.0003851832,0.001169147,0.041878406,0.015052636],"genre_scores_gemma":[0.47208148,0.0006604938,0.51314324,0.00043760554,0.00010426463,0.0004195826,0.003862178,0.0010213924,0.008269734],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992742,0.00013925268,0.00004925938,0.0001263714,0.0003164132,0.00009444277],"domain_scores_gemma":[0.99867165,0.00036002006,0.000121341014,0.00042451106,0.00033360426,0.00008892182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463197,0.0006924067,0.00090160995,0.0014274605,0.00055673084,0.0010133712,0.00209586,0.0009576985,0.003475437],"category_scores_gemma":[0.0026269648,0.00047370707,0.00051949173,0.0013680591,0.00060819474,0.002680421,0.0020175742,0.0009758552,0.001743021],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018971547,0.0004875857,0.0073531675,0.0005450035,0.00017498345,0.00077535416,0.00042934966,0.06501746,0.13162291,0.036567215,0.050053608,0.7050763],"study_design_scores_gemma":[0.00021764873,0.00064178644,0.0014830348,0.00004610228,0.00009552623,0.0013182838,0.00017254893,0.85902035,0.07821823,0.013597054,0.045030512,0.00015889965],"about_ca_topic_score_codex":0.0011647297,"about_ca_topic_score_gemma":0.0015094703,"teacher_disagreement_score":0.003475437,"about_ca_system_score_codex":0.0005143179,"about_ca_system_score_gemma":0.0010831563,"threshold_uncertainty_score":0.011626482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027183374,0.00037632682,0.97116345,0.000104644794,0.00006902135,0.000058455724,0.00003831628,0.00022493627,0.00078149553],"genre_scores_gemma":[0.8573471,0.0003628785,0.14110789,0.00014554756,0.00006742524,0.00010556665,0.00008200397,0.00005051776,0.00073105795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912053,0.00022817958,0.00005729067,0.00017839737,0.00024150334,0.0001740034],"domain_scores_gemma":[0.9989297,0.00047339426,0.00016492729,0.000099612305,0.00022273182,0.00010964191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713465,0.00074202864,0.00079243374,0.00059297524,0.0005646629,0.0007502478,0.0013960779,0.0005092958,0.00060844293],"category_scores_gemma":[0.002584223,0.00035533714,0.0005333173,0.0007054604,0.0005441518,0.0011188084,0.0008275865,0.000891777,0.000084883286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016460559,0.00007013941,0.00054369785,0.000085691,0.000030882937,0.000100251935,0.00012285315,0.9323431,0.009374335,0.01690405,0.0008903969,0.03936999],"study_design_scores_gemma":[0.0000072424577,0.000028005355,0.000044045122,0.0000028674147,0.0000038244316,0.000012057309,0.00000543747,0.9974251,0.00049814134,0.0017404916,0.00022835289,0.0000045554757],"about_ca_topic_score_codex":0.0069912015,"about_ca_topic_score_gemma":0.004983648,"teacher_disagreement_score":0.0069912015,"about_ca_system_score_codex":0.0013144892,"about_ca_system_score_gemma":0.0020937107,"threshold_uncertainty_score":0.013901055},"labels":[],"label_agreement":null},{"id":"W4376607990","doi":"10.1109/tnet.2023.3268982","title":"Graph-Tensor Neural Networks for Network Traffic Data Imputation","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Imputation (statistics); Artificial neural network; Data mining; Graph; Traffic generation model; Algorithm; Artificial intelligence; Missing data; Theoretical computer science; Machine learning; Computer network","score_opus":0.05153299197999835,"score_gpt":0.28153342578009444,"score_spread":0.2300004338000961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00875048,0.0003208832,0.9883057,0.00036912426,0.00006435634,0.000029676632,0.00029480824,0.0013717449,0.0004933033],"genre_scores_gemma":[0.5311186,0.001039241,0.45973456,0.0003864638,0.00021126201,0.00025774576,0.0033399358,0.00037340974,0.0035388523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986738,0.0004628516,0.00008898072,0.00034743446,0.0002828303,0.00014412616],"domain_scores_gemma":[0.99582833,0.0017259155,0.0004910745,0.0008970919,0.00090815226,0.00014934815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786332,0.001630129,0.001335743,0.001400641,0.0007246041,0.0010913097,0.0022295434,0.0012688218,0.0017300952],"category_scores_gemma":[0.013885615,0.0007125448,0.0011849407,0.0025090503,0.0011987792,0.002962012,0.0015320174,0.0037968464,0.00077855366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018376086,0.00008190595,0.002664954,0.00014421847,0.00010859015,0.00009747466,0.00009363039,0.82295734,0.0018156177,0.022458527,0.005681156,0.14371286],"study_design_scores_gemma":[0.0000022490915,0.0000068005147,0.00011159024,0.000004083811,0.00000399588,0.000007353165,0.0000052002406,0.99073315,0.00034540344,0.008482517,0.00029268017,0.000004991245],"about_ca_topic_score_codex":0.016681112,"about_ca_topic_score_gemma":0.014331957,"teacher_disagreement_score":0.016681112,"about_ca_system_score_codex":0.0017349544,"about_ca_system_score_gemma":0.0023701976,"threshold_uncertainty_score":0.033168018},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0258298,0.00063602545,0.9425706,0.00021038721,0.00022119343,0.00007760067,0.00048544037,0.025657672,0.004311365],"genre_scores_gemma":[0.36668062,0.00047138892,0.6221522,0.00033470296,0.00010998306,0.00010559048,0.001500312,0.00065554876,0.007989642],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992317,0.00009559535,0.000031031832,0.00017150133,0.00038902395,0.000081122365],"domain_scores_gemma":[0.99923754,0.00012231439,0.00010454465,0.00024710188,0.0002390763,0.000049401857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490131,0.0008862979,0.00058213796,0.0009703665,0.0004388265,0.00092598546,0.0012183394,0.0010509879,0.0035551568],"category_scores_gemma":[0.0013740642,0.00045162134,0.00040452255,0.0010179476,0.00041892627,0.0012907677,0.0013181719,0.0009247441,0.0026507478],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059837225,0.000106339096,0.0055157086,0.00047799165,0.000121042176,0.0005845946,0.000545222,0.100640915,0.11192838,0.010896083,0.038612552,0.7299727],"study_design_scores_gemma":[0.00011691351,0.00043102482,0.0055722804,0.000080624515,0.00005374578,0.0011563234,0.00008895668,0.83845526,0.06921075,0.0043223943,0.0803481,0.00016365382],"about_ca_topic_score_codex":0.0050175968,"about_ca_topic_score_gemma":0.0040717716,"teacher_disagreement_score":0.0050175968,"about_ca_system_score_codex":0.000491526,"about_ca_system_score_gemma":0.0005641335,"threshold_uncertainty_score":0.011893153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0779922,0.00027082188,0.9182698,0.00053328375,0.000042245698,0.000060845294,0.00003328976,0.0016010745,0.0011963965],"genre_scores_gemma":[0.9391091,0.00007240135,0.059773836,0.00027668886,0.000019628591,0.00005193012,0.00003187171,0.00006903442,0.000595582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504256,0.0020169278,0.00026781138,0.0008285108,0.0013112988,0.0005328224],"domain_scores_gemma":[0.9880624,0.0043617203,0.0009515109,0.0055526583,0.0007546723,0.0003171435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005706749,0.0009228469,0.0012684852,0.00056915905,0.00091357465,0.0017452128,0.0017826027,0.001635237,0.00078495726],"category_scores_gemma":[0.022753896,0.0004465652,0.00072385627,0.0005240948,0.002499009,0.004050558,0.004604077,0.0031274846,0.00030308924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001495282,0.00043352714,0.0071250456,0.00019596325,0.00022269654,0.0005637281,0.0007594676,0.5404696,0.03830998,0.0864596,0.0033913981,0.32057387],"study_design_scores_gemma":[0.000038331993,0.000180831,0.00057961745,0.00002944781,0.000022924294,0.00028179956,0.000058812588,0.92246085,0.021146609,0.054083012,0.0010902568,0.00002752949],"about_ca_topic_score_codex":0.00052222656,"about_ca_topic_score_gemma":0.00047283256,"teacher_disagreement_score":0.005706749,"about_ca_system_score_codex":0.00089989393,"about_ca_system_score_gemma":0.0011672114,"threshold_uncertainty_score":0.030180514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0775487,0.0014857703,0.89888096,0.00040447243,0.00044311475,0.00044197842,0.00073056994,0.0149349,0.005129426],"genre_scores_gemma":[0.77430177,0.0005043883,0.22038566,0.00021985576,0.00012613989,0.0002501019,0.00083150854,0.00023231517,0.0031481879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.000042241158,0.000022633234,0.000048646547,0.00010457679,0.00006836287],"domain_scores_gemma":[0.99942696,0.000093537565,0.00008324546,0.000092507,0.00019504126,0.00010872746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518892,0.00057990017,0.00054603314,0.00048322428,0.0005677046,0.0006433443,0.0015935656,0.0003596624,0.001710133],"category_scores_gemma":[0.0014488492,0.00024238252,0.00025443643,0.0004409546,0.00026282453,0.0004887317,0.000854583,0.00079773046,0.00049393915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014926626,0.00035293977,0.009088005,0.00041263268,0.00019339722,0.0004732739,0.00038784777,0.41284913,0.0902677,0.032616496,0.034213234,0.41765267],"study_design_scores_gemma":[0.00008420628,0.00017643503,0.00075773406,0.000011345558,0.000026607035,0.000110186375,0.000029503644,0.97335273,0.011311188,0.002219866,0.0118844835,0.000035619734],"about_ca_topic_score_codex":0.00759862,"about_ca_topic_score_gemma":0.00890663,"teacher_disagreement_score":0.00759862,"about_ca_system_score_codex":0.0010609804,"about_ca_system_score_gemma":0.0027986385,"threshold_uncertainty_score":0.015108764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07355661,0.00034534378,0.9223623,0.00027993848,0.000084758714,0.000047785394,0.000091212765,0.001343606,0.0018883834],"genre_scores_gemma":[0.955639,0.00007805471,0.04280492,0.00010963403,0.00001943886,0.00005952468,0.00014265481,0.000038804064,0.0011078432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.000106349195,0.000031578107,0.00020317659,0.00015972703,0.000110875764],"domain_scores_gemma":[0.9986162,0.0004936396,0.00023313506,0.00016729796,0.00036434302,0.00012531497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009825025,0.001120887,0.0011003468,0.0004215781,0.00036113703,0.0008867646,0.00157884,0.0008281983,0.0008643109],"category_scores_gemma":[0.0035935172,0.00046318668,0.00045896586,0.0003766219,0.0007280303,0.0012163358,0.0013819081,0.0016510471,0.0002341883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007383114,0.00006799179,0.0014847098,0.000026196827,0.0000279952,0.00005633595,0.00003439143,0.9583427,0.0013082236,0.0014085218,0.00069381925,0.036475364],"study_design_scores_gemma":[0.000002969217,0.000009086661,0.000049820126,0.0000011546941,0.000001717902,0.0000032540413,0.0000020820462,0.99919325,0.00016852502,0.0005260923,0.00004063622,0.0000014446553],"about_ca_topic_score_codex":0.010876986,"about_ca_topic_score_gemma":0.011467749,"teacher_disagreement_score":0.010876986,"about_ca_system_score_codex":0.0010607591,"about_ca_system_score_gemma":0.0014441472,"threshold_uncertainty_score":0.021627367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103210144,0.00042819884,0.8907638,0.00031789686,0.00009333751,0.0000537812,0.000068274036,0.0017106592,0.0033538535],"genre_scores_gemma":[0.9062456,0.0000861053,0.09150619,0.00016622352,0.00002534421,0.00006314762,0.00013850415,0.0000506766,0.0017181926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995097,0.00011137602,0.000023388826,0.00010921265,0.00014193854,0.00010447563],"domain_scores_gemma":[0.9991623,0.00037469564,0.000073895106,0.00012335193,0.00020164197,0.00006413203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088373275,0.0005917261,0.00085019215,0.00029821962,0.00049650663,0.00065636187,0.0012008842,0.0007595229,0.0013436767],"category_scores_gemma":[0.0022319655,0.00023891247,0.0003348007,0.0003172008,0.0005995067,0.0010253335,0.00095989,0.001104998,0.00021562434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021554373,0.00011316112,0.0008622242,0.000036500256,0.000020269394,0.00010543604,0.000079266654,0.9054291,0.0028681145,0.0036649196,0.0013033323,0.08530217],"study_design_scores_gemma":[0.000006680824,0.00001636895,0.000044398854,0.0000013280192,0.0000015733182,0.000006696535,0.000005370907,0.99868304,0.0004896398,0.00060147094,0.00014151068,0.0000019186864],"about_ca_topic_score_codex":0.007542667,"about_ca_topic_score_gemma":0.0068183313,"teacher_disagreement_score":0.007542667,"about_ca_system_score_codex":0.0006865871,"about_ca_system_score_gemma":0.0014072425,"threshold_uncertainty_score":0.014997542},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033669487,0.00024353259,0.95792156,0.00016345858,0.00006714772,0.0000653126,0.00018578293,0.0062893503,0.0013944767],"genre_scores_gemma":[0.6119901,0.00024892832,0.38205367,0.00032747077,0.000114871735,0.00018349347,0.0012633483,0.0004497151,0.003368371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996624,0.000080022415,0.000013146597,0.00009737913,0.000097292526,0.00004984599],"domain_scores_gemma":[0.9990262,0.00043211068,0.00012263925,0.00017038517,0.00019588316,0.000052719024],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011510125,0.0011470272,0.000951643,0.0008073893,0.00029583834,0.00072473247,0.0015928411,0.0008635959,0.0013543352],"category_scores_gemma":[0.003323949,0.00050186674,0.00051661144,0.00064120063,0.00054164516,0.0014155849,0.0011782909,0.0013463412,0.00048827095],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018520188,0.00016634703,0.005788581,0.00008982679,0.00009725485,0.0000812435,0.00006152106,0.73348147,0.0060369554,0.0031144249,0.0049901064,0.2459072],"study_design_scores_gemma":[0.00000474222,0.000012352907,0.00018532516,0.0000023468394,0.0000027415936,0.000012327934,0.0000035397138,0.998094,0.0007521986,0.0006390448,0.0002880711,0.0000034128016],"about_ca_topic_score_codex":0.006158905,"about_ca_topic_score_gemma":0.0084770275,"teacher_disagreement_score":0.99864566,"about_ca_system_score_codex":0.0006031883,"about_ca_system_score_gemma":0.0014581055,"threshold_uncertainty_score":0.012246132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29979795,0.0006365141,0.6916262,0.0002524799,0.00008980504,0.00007050028,0.00014690676,0.0048254924,0.0025541526],"genre_scores_gemma":[0.9496083,0.00017522258,0.048756957,0.00008325536,0.00004231894,0.000025299792,0.00015595322,0.00006456303,0.0010880627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999705,0.000043866803,0.0000125450815,0.000057987734,0.00014392154,0.000036597183],"domain_scores_gemma":[0.9992884,0.0003049301,0.00007496101,0.00007843323,0.00020989722,0.000043505628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062677485,0.00050063425,0.00047735122,0.00043340048,0.00020497211,0.00047262278,0.0007525298,0.0004218364,0.0005787172],"category_scores_gemma":[0.002231493,0.00019092509,0.00016765673,0.000328438,0.0002798607,0.0013126638,0.00072911166,0.0006634823,0.00018651453],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009355557,0.0006729714,0.0075137457,0.00015283898,0.00007009902,0.0003201384,0.00018767506,0.36971974,0.14765137,0.0025837717,0.003416559,0.46677548],"study_design_scores_gemma":[0.000009287592,0.000065247514,0.0005994176,0.0000035341395,0.0000065935305,0.000040249422,0.000010147458,0.98944443,0.008891358,0.00057133177,0.00035110774,0.00000735194],"about_ca_topic_score_codex":0.0026432767,"about_ca_topic_score_gemma":0.0031616194,"teacher_disagreement_score":0.0026432767,"about_ca_system_score_codex":0.0003359658,"about_ca_system_score_gemma":0.00043349076,"threshold_uncertainty_score":0.0052558184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01673554,0.002142286,0.96917033,0.001007102,0.00016938207,0.000089332,0.00013912993,0.00035615952,0.010190837],"genre_scores_gemma":[0.840534,0.0032176904,0.14050056,0.000931666,0.00049707975,0.0006105777,0.00035760264,0.0003369714,0.013013775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717295,0.0014673434,0.00010245906,0.00035499776,0.0004923221,0.00040989625],"domain_scores_gemma":[0.9877907,0.009800115,0.0008442584,0.00050717936,0.00065570977,0.00040201488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053720814,0.0030081775,0.00318886,0.0011259592,0.0011882631,0.002939799,0.0024157406,0.002635127,0.004967927],"category_scores_gemma":[0.017983826,0.0009964363,0.0012295195,0.0015186043,0.0028296947,0.004316083,0.002641085,0.0047941953,0.00093586056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014017176,0.00010232334,0.0004712358,0.00017115993,0.00007003073,0.00008311644,0.000075306525,0.86635405,0.0004665815,0.11847174,0.0024657717,0.011128481],"study_design_scores_gemma":[0.000014402621,0.000029943387,0.00005663532,0.000018007087,0.000012529239,0.000010984745,0.000011160806,0.95692104,0.00012471355,0.0422826,0.0005109295,0.0000069356806],"about_ca_topic_score_codex":0.0039285123,"about_ca_topic_score_gemma":0.0031751266,"teacher_disagreement_score":0.0053720814,"about_ca_system_score_codex":0.0028233859,"about_ca_system_score_gemma":0.0019807382,"threshold_uncertainty_score":0.028410614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025885701,0.00016010244,0.97273535,0.00008582377,0.000016944274,0.00002482847,0.000013742295,0.00020085521,0.000876582],"genre_scores_gemma":[0.95366716,0.0002420557,0.045111626,0.00004832018,0.000026092946,0.000067799534,0.000044291894,0.000027949258,0.00076459534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993686,0.00015660962,0.000025212963,0.000115322066,0.00024219858,0.00009201197],"domain_scores_gemma":[0.998613,0.00081976526,0.00020374283,0.00009733909,0.0002048069,0.00006145602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085211836,0.00064146164,0.0006353181,0.0005629033,0.00051258365,0.00054109585,0.0010404959,0.00048744873,0.00041824568],"category_scores_gemma":[0.003119089,0.00026067608,0.000489711,0.0005439361,0.0007444215,0.00072337873,0.0009775232,0.00077358464,0.00010982094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008564194,0.000023887764,0.00049063406,0.000057084388,0.000025955009,0.00008837272,0.000098193,0.9637335,0.006578929,0.012124719,0.0003734434,0.016319664],"study_design_scores_gemma":[0.0000051257334,0.000019629972,0.000044623466,0.0000013428602,0.000004788095,0.000016245922,0.000007287221,0.9978617,0.00056632963,0.0014000841,0.00007019112,0.0000025984154],"about_ca_topic_score_codex":0.0026140658,"about_ca_topic_score_gemma":0.0017805166,"teacher_disagreement_score":0.0026140658,"about_ca_system_score_codex":0.0008970914,"about_ca_system_score_gemma":0.0009570846,"threshold_uncertainty_score":0.006508887},"labels":[],"label_agreement":null}]}