{"meta":{"query_hash":"461722c1686f","filters":{"venue":"IEEE Networking Letters"},"cohort_total":36,"direct_labels_cover":0,"predictions_cover":36,"exported":36,"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/461722c1686f","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Networking+Letters"},"results":[{"id":"W2787650301","doi":"10.1109/lnet.2019.2908351","title":"Optimal Slice Allocation in 5G Core Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Core (optical fiber); Computer science; Computer network; Telecommunications","score_opus":0.016727899406843508,"score_gpt":0.22497585626844094,"score_spread":0.20824795686159742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787650301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099363774,0.0019319424,0.88714576,0.00062806165,0.00016204629,0.00006667143,0.00022493264,0.00021293819,0.01026389],"genre_scores_gemma":[0.939319,0.00092275365,0.05746058,0.0001333981,0.00004987571,0.000045915684,0.00007616911,0.000048776415,0.0019436141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00015299098,0.000012978797,0.00006472908,0.000068837144,0.00011616097],"domain_scores_gemma":[0.99948066,0.00024793047,0.00006880206,0.000050247734,0.00009132027,0.00006120257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944615,0.00076646515,0.00072982284,0.00029975976,0.00040631252,0.00086754066,0.0007354155,0.00062989903,0.0015519623],"category_scores_gemma":[0.0018418413,0.00042476918,0.00024384703,0.00047578083,0.0006922932,0.0012233701,0.0008621649,0.00060225656,0.0001809732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018200328,0.000024777204,0.00039362733,0.00008019803,0.000023273167,0.0001247395,0.00005590615,0.9055481,0.00495059,0.068231516,0.0027501928,0.017635064],"study_design_scores_gemma":[0.000010279659,0.000036867437,0.0001640821,0.0000138843125,0.000009878011,0.000049070895,0.00003632481,0.96409345,0.0009317732,0.033257656,0.0013887769,0.000007934919],"about_ca_topic_score_codex":0.0033587902,"about_ca_topic_score_gemma":0.0036717746,"teacher_disagreement_score":0.0033587902,"about_ca_system_score_codex":0.0014800344,"about_ca_system_score_gemma":0.00091144576,"threshold_uncertainty_score":0.010738432},"labels":[],"label_agreement":null},{"id":"W2915969651","doi":"10.1109/lnet.2019.2901792","title":"On the Feasibility of Deep Learning in Sensor Network Intrusion Detection","year":2019,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intrusion detection system; Computer science; Artificial intelligence; Deep learning; Boltzmann machine; Machine learning; Wireless sensor network; Computer network","score_opus":0.01680206702167992,"score_gpt":0.2265132101709739,"score_spread":0.20971114314929398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915969651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052364804,0.0022534563,0.9365444,0.0018746288,0.000120503995,0.000045508652,0.00006255184,0.0005190668,0.0062150354],"genre_scores_gemma":[0.8872441,0.0015315565,0.10741529,0.00057212077,0.00014321241,0.000071765186,0.00008093902,0.000051594143,0.002889466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991837,0.00034251667,0.000030778585,0.00015200158,0.00021390854,0.00007713775],"domain_scores_gemma":[0.9956518,0.0033053716,0.00017413143,0.00031181859,0.00048458952,0.00007227793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027181054,0.00076208985,0.0006159815,0.000487278,0.00028933265,0.00094131555,0.0009881251,0.0010028506,0.0011236946],"category_scores_gemma":[0.010206876,0.00036198512,0.0003689739,0.0005655998,0.0011477481,0.0022396499,0.0009836864,0.0017919817,0.00022824974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001974402,0.00012291885,0.0031734754,0.000155905,0.0001062373,0.00007036671,0.00008012057,0.75056446,0.0037169612,0.08589037,0.0016119251,0.15430987],"study_design_scores_gemma":[0.0000037479185,0.000032475073,0.00013355703,0.000007539876,0.0000057720335,0.000011898963,0.0000052719615,0.9872951,0.00080130826,0.011265492,0.00043440296,0.0000033609458],"about_ca_topic_score_codex":0.0022102566,"about_ca_topic_score_gemma":0.0016328256,"teacher_disagreement_score":0.0027181054,"about_ca_system_score_codex":0.00091878563,"about_ca_system_score_gemma":0.0007421202,"threshold_uncertainty_score":0.014374912},"labels":[],"label_agreement":null},{"id":"W2995177052","doi":"10.1109/lnet.2019.2959733","title":"Admission Control and Network Slicing for Multi-Numerology 5G Wireless Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Cooperative Communication and Network Coding","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de l'Enseignement Supérieur et de la Recherche","keywords":"Slicing; Computer science; Blocking (statistics); Computer network; Mobile broadband; Wireless network; Bandwidth (computing); Constraint (computer-aided design); Admission control; Latency (audio); Broadband networks; Wireless; Wireless broadband; Broadband; Distributed computing; Quality of service; Telecommunications; Engineering","score_opus":0.02945138797379666,"score_gpt":0.2698974765411785,"score_spread":0.24044608856738187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995177052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015960453,0.00096655684,0.9800765,0.00032706463,0.000070876245,0.000042652813,0.000016286385,0.00007327137,0.0024663906],"genre_scores_gemma":[0.93139446,0.0012558518,0.065012075,0.00012251765,0.00017571916,0.000074789255,0.000027202019,0.00003998236,0.0018973415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980724,0.00069775316,0.000074797936,0.00023215612,0.0005884531,0.00033438802],"domain_scores_gemma":[0.9979006,0.0013305782,0.0003014045,0.00009011402,0.0002694264,0.00010786604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023241409,0.0011693873,0.0010672392,0.0007226546,0.00084855367,0.0016360763,0.0011861998,0.0007927264,0.0013852977],"category_scores_gemma":[0.005097305,0.00051088794,0.0006144178,0.0008115747,0.0021926558,0.0019019978,0.0013632067,0.0015876724,0.0001336227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009687337,0.000038235958,0.0003824608,0.00007826461,0.000033745753,0.000094787734,0.00016056556,0.86322516,0.0049999505,0.10425767,0.00075109734,0.025881149],"study_design_scores_gemma":[0.0000048581883,0.000016498592,0.000040904913,0.000005052777,0.00000627378,0.000011476636,0.000009849111,0.99062693,0.0005981438,0.00842487,0.0002491148,0.0000059258577],"about_ca_topic_score_codex":0.008223274,"about_ca_topic_score_gemma":0.0053413254,"teacher_disagreement_score":0.008223274,"about_ca_system_score_codex":0.0038033992,"about_ca_system_score_gemma":0.0028048893,"threshold_uncertainty_score":0.027595758},"labels":[],"label_agreement":null},{"id":"W3015106737","doi":"10.1109/lnet.2020.2984008","title":"Performance Analysis for H-CRANs Under Constrained Capacity Fronthaul","year":2020,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Photonic Communication Systems","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Monte Carlo method; High data rate; Millimeter; Extremely high frequency; Electronic engineering; Stochastic geometry; Space (punctuation); Telecommunications; Engineering; Wireless; Physics; Optics; Mathematics; Statistics","score_opus":0.047838126294545945,"score_gpt":0.2254242170637358,"score_spread":0.17758609076918985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015106737","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.6377801,0.0022553126,0.33620507,0.0009144575,0.00013628633,0.0001898596,0.0004992807,0.0007424656,0.021277165],"genre_scores_gemma":[0.99290425,0.00022325199,0.0060299397,0.00006707544,0.000016267342,0.000021812953,0.000052920295,0.000022617794,0.0006619496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871695,0.0003469783,0.00002463243,0.0001452775,0.00026629068,0.0004997862],"domain_scores_gemma":[0.9951879,0.0027682132,0.0005170576,0.00027788873,0.0010039716,0.00024494098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965433,0.0009695354,0.0008026727,0.00079194346,0.0010001966,0.0014035206,0.0011472212,0.0007849019,0.0025049844],"category_scores_gemma":[0.007233401,0.00030341017,0.00037476435,0.00093515194,0.0016419784,0.0011911426,0.0014229801,0.00072763977,0.00024768044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014297242,0.000022617813,0.0006215638,0.000032741744,0.000021586719,0.000078515426,0.000020727934,0.9883712,0.0016209153,0.0052158427,0.00045146907,0.0033997702],"study_design_scores_gemma":[0.0000049341415,0.00003492648,0.0001605379,0.0000034774475,0.0000062954387,0.000023027233,0.000024781397,0.99835914,0.0004896106,0.0008121313,0.00007448915,0.0000066732077],"about_ca_topic_score_codex":0.022854988,"about_ca_topic_score_gemma":0.01493512,"teacher_disagreement_score":0.022854988,"about_ca_system_score_codex":0.0026859115,"about_ca_system_score_gemma":0.002117476,"threshold_uncertainty_score":0.045443892},"labels":[],"label_agreement":null},{"id":"W3112166140","doi":"10.1109/lnet.2020.3045070","title":"Power Allocation in CoMP-Empowered C-NOMA Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Concordia University","keywords":"Noma; Computer science; Single antenna interference cancellation; Mathematical optimization; Quality of service; Interference (communication); Power (physics); Heuristic; Computational complexity theory; Optimization problem; Power control; Scheme (mathematics); Transmission (telecommunications); Cellular network; Power optimization; Channel (broadcasting); Computer network; Telecommunications link; Mathematics; Algorithm; Telecommunications","score_opus":0.016052853626976463,"score_gpt":0.2115908036866127,"score_spread":0.19553795005963626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112166140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054109678,0.0013052749,0.9353899,0.00025936528,0.000110632864,0.00004371258,0.000052819334,0.00014754066,0.00858104],"genre_scores_gemma":[0.9508292,0.00046635617,0.045583267,0.00013151769,0.00006092291,0.000060363946,0.00002986665,0.000020735548,0.0028177723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.00021978,0.000014289011,0.00010025737,0.00009883226,0.00009346557],"domain_scores_gemma":[0.999579,0.00023192988,0.000060395705,0.00003264084,0.00006772784,0.00002836919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055733026,0.00070828496,0.00056168245,0.00032263147,0.00070904876,0.0009875557,0.0007798058,0.00077636144,0.0008159042],"category_scores_gemma":[0.0010475757,0.0003864279,0.00027800896,0.0007994133,0.0008419517,0.00060853537,0.00074865157,0.0005586388,0.00022997502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011859173,0.00004725353,0.0004783309,0.00006884691,0.0000346361,0.00027890367,0.00007671958,0.9378204,0.0065141567,0.019818062,0.0013124442,0.033431645],"study_design_scores_gemma":[0.000007259945,0.000037192425,0.0001200822,0.0000038786966,0.000006345137,0.000066694134,0.000024346255,0.9938035,0.00069337315,0.004396211,0.0008344619,0.0000066365888],"about_ca_topic_score_codex":0.0037408203,"about_ca_topic_score_gemma":0.004716415,"teacher_disagreement_score":0.0037408203,"about_ca_system_score_codex":0.00069519336,"about_ca_system_score_gemma":0.0008001236,"threshold_uncertainty_score":0.0074380636},"labels":[],"label_agreement":null},{"id":"W3118507373","doi":"10.1109/lnet.2021.3050096","title":"Profit Maximization Model for the Task Assignment Problem in 2-Tier Fog/Cloud Network Environments","year":2021,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cloud computing; Computer science; Profit maximization; Fog computing; Distributed computing; Benchmark (surveying); Profit (economics); Maximization; Mathematical optimization; Task (project management); Mathematics; Engineering","score_opus":0.023346068479382753,"score_gpt":0.21829420546244505,"score_spread":0.1949481369830623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118507373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01065185,0.0005911718,0.97106385,0.0007299339,0.000097861826,0.000113394235,0.0002981742,0.0001491102,0.01630459],"genre_scores_gemma":[0.79301846,0.0019466974,0.17522457,0.00058415567,0.0002168534,0.00061240594,0.0004182419,0.00024189119,0.027736742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920493,0.00022465839,0.000023242343,0.00013816524,0.00019571595,0.00021331354],"domain_scores_gemma":[0.9993167,0.00042719187,0.00006877503,0.000029809547,0.000119420045,0.000038206417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013454548,0.001608311,0.0014247836,0.00066391117,0.000622243,0.002040669,0.0020719958,0.001933258,0.0059975316],"category_scores_gemma":[0.0027369498,0.00075762713,0.0010217626,0.0010636906,0.0010901801,0.0022604042,0.0012504577,0.001849145,0.0010306264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030120473,0.000027718075,0.0001293756,0.000058473866,0.000013254885,0.00006490287,0.00003731675,0.9555577,0.0005385841,0.037034012,0.0015351481,0.004973377],"study_design_scores_gemma":[0.0000043236846,0.0000072721027,0.000040733576,0.0000049905225,0.0000029852333,0.000011580086,0.000008826409,0.99132675,0.00007004991,0.008143822,0.00037527693,0.0000032898788],"about_ca_topic_score_codex":0.009818728,"about_ca_topic_score_gemma":0.008516065,"teacher_disagreement_score":0.009818728,"about_ca_system_score_codex":0.0028456212,"about_ca_system_score_gemma":0.0024588385,"threshold_uncertainty_score":0.020646453},"labels":[],"label_agreement":null},{"id":"W3126726356","doi":"10.1109/lnet.2021.3058292","title":"Securing the Internet of Vehicles: A Deep Learning-Based Classification Framework","year":2021,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; The Internet; Identification (biology); Authentication (law); Deep learning; Computer security; Artificial intelligence; Computer network; Machine learning; World Wide Web","score_opus":0.011695999966250757,"score_gpt":0.20945572289108072,"score_spread":0.19775972292482996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126726356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08089649,0.0013298894,0.91041595,0.0016145048,0.00016646693,0.00009005929,0.00022704624,0.0007192273,0.00454028],"genre_scores_gemma":[0.907499,0.0007120476,0.085253075,0.00031302214,0.00012932117,0.000093980205,0.00054031867,0.000027577029,0.0054316977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00010544733,0.000018954499,0.000072896975,0.00008243877,0.00009863995],"domain_scores_gemma":[0.9994455,0.00020365557,0.0000723268,0.00004563165,0.00019124646,0.000041698855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009312273,0.00065262924,0.0005854682,0.00079162355,0.00037328905,0.0008451105,0.0013928289,0.0011800808,0.0007412879],"category_scores_gemma":[0.0013454157,0.00021160411,0.00040709393,0.0006161589,0.0005485527,0.0011802971,0.0007747004,0.0015432318,0.000282588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001469962,0.00031947455,0.0051638233,0.000059496713,0.00007808711,0.00010383726,0.00008342325,0.6765887,0.002884671,0.019168593,0.0051511824,0.29025164],"study_design_scores_gemma":[0.0000011816383,0.000016350248,0.00011013083,0.0000030438357,0.000003216897,0.000004574143,0.0000055433716,0.9974841,0.00022604858,0.0019556412,0.00018799353,0.0000022406155],"about_ca_topic_score_codex":0.0128493495,"about_ca_topic_score_gemma":0.008184546,"teacher_disagreement_score":0.0128493495,"about_ca_system_score_codex":0.0011136137,"about_ca_system_score_gemma":0.0010168905,"threshold_uncertainty_score":0.025549114},"labels":[],"label_agreement":null},{"id":"W3139652545","doi":"10.1109/lnet.2021.3070270","title":"IoT-Based Smart Home Device Monitor Using Private Blockchain Technology and Localization","year":2021,"lang":"en","type":"preprint","venue":"IEEE Networking Letters","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Trilateration; Popularity; Internet of Things; Computer security; Computer science; Wireless; Computer network; Home automation; Cryptography; Telecommunications; Engineering","score_opus":0.01803599304061034,"score_gpt":0.24274625669883598,"score_spread":0.22471026365822563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139652545","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.18434317,0.00019797042,0.8042766,0.00034322208,0.00006687006,0.00017738288,0.000112326205,0.0014261607,0.009056251],"genre_scores_gemma":[0.9488422,0.00006175799,0.047564488,0.0000353953,0.000013503697,0.0000738904,0.00005791814,0.000022783373,0.0033280135],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930394,0.00020378525,0.000038986305,0.00014223886,0.00023173718,0.00007935114],"domain_scores_gemma":[0.9991042,0.00023234294,0.00011955565,0.00028046363,0.0001992388,0.000064131484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006170992,0.0003020335,0.00039996332,0.00029473813,0.00064397184,0.0008085712,0.0008364657,0.0006594386,0.0026607101],"category_scores_gemma":[0.0013120652,0.00021249859,0.00020533477,0.0003607013,0.0005474996,0.0015840869,0.0008607789,0.00046303263,0.0006196771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001599795,0.0005941032,0.0096623255,0.00036076663,0.00013236482,0.0011541218,0.0007432982,0.26431623,0.33640352,0.08677693,0.0044048163,0.29385185],"study_design_scores_gemma":[0.00011033374,0.00047207563,0.0008503904,0.000022609831,0.00004465238,0.00045990988,0.000057114208,0.8903611,0.08448398,0.014661083,0.008444932,0.000031841155],"about_ca_topic_score_codex":0.00090553146,"about_ca_topic_score_gemma":0.0014586041,"teacher_disagreement_score":0.0026607101,"about_ca_system_score_codex":0.00054925244,"about_ca_system_score_gemma":0.00066006114,"threshold_uncertainty_score":0.008901},"labels":[],"label_agreement":null},{"id":"W3159437800","doi":"10.1109/lnet.2021.3076409","title":"Carrier Aggregation With Optimized UE Power Consumption in 5G","year":2021,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Ericsson (Canada); University of Ottawa","funders":"","keywords":"Throughput; Computer science; User equipment; Quality of service; Power consumption; Constraint (computer-aided design); Computer network; Power (physics); Reduction (mathematics); Real-time computing; Reliability engineering; Telecommunications; Base station; Engineering; Wireless; Mathematics","score_opus":0.009660941306359935,"score_gpt":0.20696225215506678,"score_spread":0.19730131084870683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159437800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2645874,0.0031420295,0.71820104,0.0007001078,0.00013830447,0.00007596927,0.00012250879,0.00020280722,0.012829907],"genre_scores_gemma":[0.9846095,0.00033540963,0.013809297,0.000057557645,0.000027667731,0.000019907406,0.000018853598,0.000009328598,0.0011124711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993787,0.00024666707,0.000016312879,0.000080588165,0.00012266077,0.00015498661],"domain_scores_gemma":[0.9997887,0.00010306697,0.00003464012,0.00001835328,0.000043196465,0.000012054456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006843852,0.0009392384,0.0006743029,0.00026753024,0.00039982703,0.001034109,0.0005128691,0.00069361896,0.0008291657],"category_scores_gemma":[0.0010220342,0.00023348488,0.0002668333,0.0008158447,0.00057463086,0.00087645516,0.00055027346,0.0003520157,0.00010898126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745009,0.000034774526,0.0005907592,0.00003967121,0.000027814925,0.00014214084,0.000033912784,0.96884614,0.004106074,0.011602238,0.00053604296,0.013952999],"study_design_scores_gemma":[0.000006739182,0.000050471615,0.00031518211,0.000006201071,0.000017432581,0.000029409586,0.000021494014,0.9954964,0.0009649071,0.0026723319,0.00041362026,0.0000058299797],"about_ca_topic_score_codex":0.006100577,"about_ca_topic_score_gemma":0.0067569385,"teacher_disagreement_score":0.006100577,"about_ca_system_score_codex":0.001153804,"about_ca_system_score_gemma":0.00097101904,"threshold_uncertainty_score":0.012130141},"labels":[],"label_agreement":null},{"id":"W3180101895","doi":"10.1109/lnet.2021.3096481","title":"Resource Allocation, Trajectory Optimization, and Admission Control in UAV-Based Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"UAV Applications and Optimization","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Maximization; Mathematical optimization; Admission control; Resource allocation; Trajectory optimization; Trajectory; Integer programming; Linear programming; Integer (computer science); Optimization problem; Block (permutation group theory); Iterative method; Wireless; Nonlinear programming; Nonlinear system; Algorithm; Optimal control; Computer network; Mathematics","score_opus":0.00499777197560826,"score_gpt":0.17845365251552933,"score_spread":0.17345588053992106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180101895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049392026,0.0009987303,0.94666576,0.00032519636,0.000050974282,0.00002979838,0.000027034155,0.000087633285,0.00242282],"genre_scores_gemma":[0.95899713,0.00064476515,0.03791279,0.00004735848,0.00004896265,0.000055142456,0.000024803554,0.000023365357,0.002245692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994894,0.00022443601,0.00001697006,0.000068135974,0.00011247316,0.000088599],"domain_scores_gemma":[0.9994498,0.00033206347,0.0000989082,0.000023474124,0.000058267808,0.00003749788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068296026,0.00072479504,0.0006866182,0.000382697,0.00045948,0.00091747515,0.00069555454,0.0006766591,0.000745236],"category_scores_gemma":[0.0016466595,0.000289768,0.0002588913,0.00071950903,0.00090245786,0.0009914237,0.0008493387,0.00065776554,0.00010406417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028878894,0.00001281828,0.00023190407,0.000023002467,0.000009738056,0.000042240445,0.000023862458,0.9803775,0.0011480424,0.009362889,0.00023390622,0.008505166],"study_design_scores_gemma":[0.0000018291563,0.000007577912,0.000039651233,0.0000015256117,0.0000012502142,0.000004793475,0.000006853128,0.9981201,0.00019238991,0.0015031679,0.00011920223,0.0000016731246],"about_ca_topic_score_codex":0.007831735,"about_ca_topic_score_gemma":0.0038640387,"teacher_disagreement_score":0.007831735,"about_ca_system_score_codex":0.001164986,"about_ca_system_score_gemma":0.00079267204,"threshold_uncertainty_score":0.01557225},"labels":[],"label_agreement":null},{"id":"W4220693821","doi":"10.1109/lnet.2022.3161981","title":"Sum Rate Maximization for RIS-Aided NOMA With Direct Links","year":2022,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Université Laval","funders":"Henan Provincial Science and Technology Research Project; Henan Polytechnic University","keywords":"Noma; Telecommunications link; Maximization; Computer science; Wireless; Power (physics); Mathematical optimization; Phase (matter); Semidefinite programming; Transmitter power output; Minification; Spectral efficiency; Function (biology); Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Electrical engineering; Beamforming; Engineering; Physics; Channel (broadcasting)","score_opus":0.013553287886976226,"score_gpt":0.2017357764805162,"score_spread":0.18818248859353998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220693821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027395146,0.0012960858,0.95403343,0.00065361965,0.0001536193,0.00009515653,0.00027127538,0.00027316326,0.015828492],"genre_scores_gemma":[0.85403025,0.0015345598,0.13224848,0.0003849962,0.0002973541,0.00033475077,0.00029721574,0.0001052599,0.010767013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836785,0.0007937625,0.00005430806,0.00023770334,0.00027236168,0.00027414493],"domain_scores_gemma":[0.998594,0.00090215437,0.000139056,0.00009943904,0.00020224562,0.00006312013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015559433,0.0025748706,0.0013648513,0.00066394405,0.0006984873,0.0017726574,0.001337322,0.0010868806,0.0033490337],"category_scores_gemma":[0.0030270705,0.0006300831,0.0008288682,0.0014498851,0.0014617034,0.0011392604,0.0019056594,0.00151913,0.0010751283],"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.00034886767,0.00013413963,0.00057978695,0.00045562716,0.0001305456,0.00056163536,0.00021783811,0.89467126,0.009576385,0.05005951,0.0058517773,0.037412632],"study_design_scores_gemma":[0.000027505266,0.000098242715,0.00012842346,0.00001769522,0.000020170877,0.00014373448,0.00004626442,0.9868794,0.0017535746,0.009838412,0.0010284366,0.000018104867],"about_ca_topic_score_codex":0.0019729834,"about_ca_topic_score_gemma":0.0024912509,"teacher_disagreement_score":0.0033490337,"about_ca_system_score_codex":0.0011361256,"about_ca_system_score_gemma":0.001473804,"threshold_uncertainty_score":0.011203647},"labels":[],"label_agreement":null},{"id":"W4285198896","doi":"10.1109/lnet.2022.3185553","title":"A New Realistic Benchmark for Advanced Persistent Threats in Network Traffic","year":2022,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); University of Ottawa","funders":"Ontario Centres of Excellence","keywords":"Benchmark (surveying); Baseline (sea); Computer science; Macro; Artificial intelligence; Machine learning","score_opus":0.019995891806986188,"score_gpt":0.23564531410585848,"score_spread":0.2156494222988723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285198896","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.7356014,0.0067018666,0.082682855,0.003007281,0.002871139,0.0015215015,0.13323087,0.008611007,0.02577208],"genre_scores_gemma":[0.66589457,0.0014394049,0.0441889,0.0007775293,0.00055466575,0.0009062907,0.28113475,0.0003291734,0.004774756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969952,0.0007924128,0.0002458217,0.0006656824,0.0010019526,0.00029902364],"domain_scores_gemma":[0.9966,0.0009613101,0.00040772307,0.00074364955,0.0009551805,0.00033218978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234113,0.001662735,0.0006844218,0.0036748985,0.0010631765,0.0016089373,0.0017872526,0.0018899929,0.0015246107],"category_scores_gemma":[0.007046008,0.00021691126,0.00080225366,0.0024323666,0.0007722821,0.002001435,0.001588222,0.0017346224,0.0012011016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016518327,0.004259367,0.07511455,0.0023255665,0.00061628106,0.0012534822,0.00042063528,0.3217998,0.02848754,0.013189053,0.2685829,0.28229892],"study_design_scores_gemma":[0.00027102826,0.002405758,0.08029609,0.00044457807,0.00016009832,0.003689311,0.0008821959,0.70909667,0.03266406,0.012876211,0.1569659,0.00024808059],"about_ca_topic_score_codex":0.0060230764,"about_ca_topic_score_gemma":0.0080960775,"teacher_disagreement_score":0.0060230764,"about_ca_system_score_codex":0.0017264787,"about_ca_system_score_gemma":0.0012938984,"threshold_uncertainty_score":0.012526512},"labels":[],"label_agreement":null},{"id":"W4319338764","doi":"10.1109/lnet.2023.3242680","title":"Short-Term Multivariate KPI Forecasting in Rural Fixed Wireless LTE Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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 New Brunswick","funders":"Mitacs","keywords":"Computer science; Recurrent neural network; Performance indicator; Wireless network; Anomaly detection; Term (time); Wireless; Multivariate statistics; Univariate; Artificial neural network; Computer network; Real-time computing; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.051810850255383636,"score_gpt":0.30404025860747236,"score_spread":0.25222940835208874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319338764","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.9397115,0.00032719545,0.05710756,0.0004237128,0.000030806703,0.000011150331,0.0004547882,0.00021095731,0.0017223918],"genre_scores_gemma":[0.9977319,0.00010607224,0.0017682005,0.0000093431345,0.0000074978248,0.0000022275176,0.00014555588,0.000005055638,0.00022411444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990726,0.000021183692,0.000004717705,0.000024785833,0.000021779917,0.000020171696],"domain_scores_gemma":[0.99956435,0.00020183549,0.000094088246,0.000036604386,0.00007782698,0.00002531129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043884804,0.00039548185,0.00022718022,0.00039618203,0.00018437591,0.00035815194,0.000352689,0.00028533317,0.0004159553],"category_scores_gemma":[0.0020735187,0.00012517472,0.00016423853,0.0007748127,0.00019825678,0.0007408042,0.00022370135,0.00044962755,0.0001460428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013804756,0.000033202137,0.03830738,0.000029444092,0.000028458779,0.00017735007,0.00006727477,0.91530097,0.003112275,0.0021021683,0.0010513077,0.039652094],"study_design_scores_gemma":[7.581456e-7,0.000008304463,0.005820082,0.0000022370286,0.0000025670197,0.000011025605,0.000025240486,0.9930848,0.00032463545,0.00058470696,0.00013233042,0.0000033390647],"about_ca_topic_score_codex":0.029073851,"about_ca_topic_score_gemma":0.025148662,"teacher_disagreement_score":0.029073851,"about_ca_system_score_codex":0.000587033,"about_ca_system_score_gemma":0.0002760779,"threshold_uncertainty_score":0.057809293},"labels":[],"label_agreement":null},{"id":"W4319663698","doi":"10.1109/lnet.2023.3243605","title":"Optimizing Information Freshness in RIS-Assisted Non-Orthogonal Multiple Access-Based IoT Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University","keywords":"Cluster analysis; Telecommunications link; Mathematical optimization; Computer science; Convex optimization; Matching (statistics); Regular polygon; Optimization problem; Internet of Things; Power (physics); Matching pursuit; Mathematics; Algorithm; Artificial intelligence; Compressed sensing; Computer network","score_opus":0.022615050117362017,"score_gpt":0.2504521002623397,"score_spread":0.2278370501449777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319663698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12386781,0.0005272402,0.87157285,0.00027843498,0.00006659117,0.000034431265,0.000052385578,0.00022774276,0.0033725065],"genre_scores_gemma":[0.97353023,0.00017770493,0.02498093,0.000056419623,0.00002615335,0.000022577053,0.00002813602,0.00002513045,0.0011529218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944156,0.00019804535,0.000016519973,0.00010007022,0.00012389709,0.0001198751],"domain_scores_gemma":[0.9988644,0.0006775743,0.00016900622,0.00011251952,0.00011516148,0.00006146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010850535,0.00089573127,0.000853671,0.00035843835,0.0004055419,0.0009312708,0.0011165172,0.00065226614,0.0006496354],"category_scores_gemma":[0.002454271,0.00039378685,0.00033587276,0.00079475384,0.0010067755,0.0016527371,0.0012388952,0.00067427184,0.00016503995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011743972,0.00004169391,0.00039430978,0.00004149062,0.00002622887,0.0000945486,0.00004400971,0.96463645,0.0058673318,0.010584247,0.0003892171,0.017762974],"study_design_scores_gemma":[0.0000035828875,0.00003285938,0.00008716693,0.0000017255564,0.000005144598,0.000013454274,0.000011767795,0.9962263,0.0008879008,0.0026171005,0.000109297434,0.0000037755597],"about_ca_topic_score_codex":0.0011810131,"about_ca_topic_score_gemma":0.0015050933,"teacher_disagreement_score":0.0011810131,"about_ca_system_score_codex":0.00085373485,"about_ca_system_score_gemma":0.00066537503,"threshold_uncertainty_score":0.0061942935},"labels":[],"label_agreement":null},{"id":"W4361759623","doi":"10.1109/lnet.2023.3262704","title":"EDI-Driven Multi-Dimensional Resource Allocation for Inclusive 6G Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Provisioning; Quality of service; Resource distribution; Resource allocation; Equity (law); Scheme (mathematics); Computer network; Distributed computing; Mathematics","score_opus":0.04026365936516587,"score_gpt":0.2876351666356952,"score_spread":0.24737150727052934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361759623","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.0401692,0.0005481448,0.95133924,0.00023704415,0.00008776391,0.000053514712,0.000039522656,0.00012107526,0.007404494],"genre_scores_gemma":[0.9160013,0.00030959916,0.08083709,0.00021546167,0.00006712686,0.000081115446,0.000042492193,0.000022926883,0.002422786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991054,0.00023914158,0.000048365757,0.00013866308,0.00027206374,0.0001963577],"domain_scores_gemma":[0.9994741,0.00017265046,0.00006077409,0.000090661495,0.00013684071,0.00006494367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008079943,0.0006252394,0.0007179049,0.0005055686,0.0009898253,0.0010957192,0.0010794958,0.00042492227,0.0017937758],"category_scores_gemma":[0.0015813044,0.0002443786,0.0003440741,0.0006579725,0.0006994668,0.0013861419,0.0023647984,0.000913146,0.0002898368],"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.0005944692,0.00036000976,0.0030139124,0.00021686098,0.00015441806,0.0007730732,0.000655719,0.37775797,0.065246545,0.26890582,0.004842664,0.27747867],"study_design_scores_gemma":[0.000019604022,0.00013984978,0.00047080443,0.000021136644,0.0000283332,0.00043481667,0.00012992491,0.94530433,0.007432987,0.041011218,0.00496331,0.00004361471],"about_ca_topic_score_codex":0.0004893743,"about_ca_topic_score_gemma":0.0006654832,"teacher_disagreement_score":0.0017937758,"about_ca_system_score_codex":0.0006902704,"about_ca_system_score_gemma":0.00051349885,"threshold_uncertainty_score":0.006000757},"labels":[],"label_agreement":null},{"id":"W4362653628","doi":"10.1109/lnet.2023.3264622","title":"Federated Kalman Filter for Secure IoT-Based Device Monitoring Services","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kalman filter; Popularity; Computer science; Internet of Things; Transmission (telecommunications); Filter (signal processing); Real-time computing; Computer security; Telecommunications; Artificial intelligence; Computer vision","score_opus":0.04659622169689746,"score_gpt":0.2845817658667153,"score_spread":0.23798554416981785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362653628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010633595,0.00011763611,0.9869802,0.00014816437,0.00005203063,0.000032092335,0.000041225732,0.0008962116,0.0010989567],"genre_scores_gemma":[0.9125169,0.00016833491,0.084758535,0.00012564503,0.000036158137,0.000082354614,0.00009301755,0.000029408106,0.0021897196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985886,0.00030118003,0.000108303575,0.00032182978,0.0005109533,0.00016908723],"domain_scores_gemma":[0.99846566,0.0005061982,0.00020661691,0.0003959721,0.00037775456,0.00004778511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014633107,0.0004903301,0.00074614666,0.0004586385,0.0006831852,0.0010119843,0.0009737612,0.0011514714,0.002000658],"category_scores_gemma":[0.0042978716,0.00023802667,0.0005061566,0.00043105648,0.0006548314,0.0018868515,0.0009844501,0.000996228,0.0006619851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008318108,0.0002167015,0.0032899354,0.00019679916,0.00011043495,0.0004782315,0.00025266316,0.5953045,0.03311266,0.073612005,0.0036905769,0.28890362],"study_design_scores_gemma":[0.000021637668,0.0000703389,0.00025914874,0.000014427259,0.000012417757,0.00006787075,0.000013414202,0.98113704,0.0074451813,0.009042295,0.0019021729,0.000014126126],"about_ca_topic_score_codex":0.003187193,"about_ca_topic_score_gemma":0.0027988262,"teacher_disagreement_score":0.003187193,"about_ca_system_score_codex":0.0009610508,"about_ca_system_score_gemma":0.001387925,"threshold_uncertainty_score":0.0077388287},"labels":[],"label_agreement":null},{"id":"W4379745810","doi":"10.1109/lnet.2023.3283936","title":"Heterogeneous GNN-RL-Based Task Offloading for UAV-Aided Smart Agriculture","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Nokia","keywords":"Computer science; Reinforcement learning; Robustness (evolution); Internet of Things; Task (project management); Edge computing; Distributed computing; Network topology; Enhanced Data Rates for GSM Evolution; Embedded system; Real-time computing; Computer network; Artificial intelligence; Engineering","score_opus":0.012457973208129244,"score_gpt":0.20315500926234487,"score_spread":0.19069703605421562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379745810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1321964,0.00043359987,0.8561401,0.00031302441,0.00015707377,0.00006975812,0.00006842714,0.0008325026,0.009789196],"genre_scores_gemma":[0.9837256,0.000039472314,0.014468146,0.000062380306,0.000011768717,0.000028634975,0.000034196422,0.00002474882,0.0016050655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998472,0.000027313552,0.0000054701286,0.000040233605,0.000032207612,0.000047618738],"domain_scores_gemma":[0.9997532,0.00009946983,0.000039493567,0.000022073744,0.00005637631,0.000029416322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032764865,0.00058452145,0.00046429335,0.00019603157,0.00030218615,0.00038349666,0.0007356205,0.0004891351,0.0014522515],"category_scores_gemma":[0.000668826,0.0001703168,0.00021696278,0.00017185627,0.00039291728,0.00045642073,0.0006151942,0.00048525757,0.0002145712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007950959,0.000054651562,0.00040171872,0.000022807053,0.000012713069,0.00005297092,0.00001827549,0.9737309,0.004344371,0.0008182032,0.00061105017,0.019852825],"study_design_scores_gemma":[0.0000044101853,0.000016223028,0.00006661878,0.0000012710967,0.0000019108338,0.000003922029,0.000003994577,0.9990885,0.00035089283,0.00034353687,0.00011717164,0.0000014966499],"about_ca_topic_score_codex":0.0053514782,"about_ca_topic_score_gemma":0.0075469194,"teacher_disagreement_score":0.0053514782,"about_ca_system_score_codex":0.00053222093,"about_ca_system_score_gemma":0.0006213809,"threshold_uncertainty_score":0.010640681},"labels":[],"label_agreement":null},{"id":"W4380551774","doi":"10.1109/lnet.2023.3286104","title":"Resilient and Robust QoS-Preserving Post-Fault VNF Placement","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Software-Defined Networks and 5G","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":"Western University","funders":"","keywords":"Computer science; Quality of service; Distributed computing; Computer network; Reliability engineering; Engineering","score_opus":0.024524929802406156,"score_gpt":0.2299818354192171,"score_spread":0.20545690561681096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380551774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032724414,0.00015059461,0.96428376,0.00019443578,0.000048419664,0.000025647743,0.00006169367,0.00020298413,0.0023080627],"genre_scores_gemma":[0.9644983,0.00012648645,0.03381027,0.000039266044,0.000020755944,0.000029636512,0.000047688914,0.000048943406,0.0013786065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993924,0.00014087453,0.000021746024,0.00014336042,0.00016372463,0.00013787889],"domain_scores_gemma":[0.9993325,0.00027353608,0.00020689848,0.000066718225,0.00009279743,0.0000275366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055936,0.0010479306,0.0006930101,0.00031817844,0.00045842846,0.0009189888,0.0009575987,0.0009648583,0.0009345467],"category_scores_gemma":[0.0025298968,0.00035099915,0.0004942135,0.00032239655,0.00067420944,0.00088159647,0.0006499763,0.00074256305,0.00016487211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016593553,0.0000044482626,0.00007826755,0.0000076565575,0.000004242239,0.00002273334,0.000006774968,0.9944661,0.0011143228,0.0017096777,0.000098095654,0.0024711287],"study_design_scores_gemma":[0.0000017479235,0.000018360013,0.000050380542,0.0000015378604,0.0000020522107,0.000011556304,0.000005102911,0.99813074,0.00041214394,0.0012590316,0.000104972336,0.0000023751795],"about_ca_topic_score_codex":0.0048755216,"about_ca_topic_score_gemma":0.003475272,"teacher_disagreement_score":0.0048755216,"about_ca_system_score_codex":0.0013663535,"about_ca_system_score_gemma":0.0010521124,"threshold_uncertainty_score":0.009913564},"labels":[],"label_agreement":null},{"id":"W4386951303","doi":"10.1109/lnet.2023.3307246","title":"Guest Editorial Networking Enablers for 6G Use Cases","year":2023,"lang":"en","type":"editorial","venue":"IEEE Networking Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Broadband; Low latency (capital markets); Latency (audio); Computer science; Robotics; Penetration rate; Mobile broadband; Telecommunications; Augmented reality; Engineering; Computer network; Wireless; Artificial intelligence; Robot","score_opus":0.04299005391793897,"score_gpt":0.27187491988879364,"score_spread":0.22888486597085467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386951303","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060987084,0.0065466114,0.00021996986,0.05235297,0.93473923,0.000024463412,0.000039345596,0.0000678918,0.005948494],"genre_scores_gemma":[0.0007282399,0.006004826,0.00010915001,0.023055624,0.9546056,0.000022772207,0.000024286424,0.00003367183,0.015415766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777216,0.00027567684,0.00018379228,0.00026882355,0.0013057134,0.00019380184],"domain_scores_gemma":[0.99126714,0.0032586672,0.0004758045,0.00022188477,0.0033809019,0.0013955228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028663476,0.0018198625,0.0013796831,0.0017505918,0.002476663,0.005905051,0.0016855636,0.010926016,0.013911672],"category_scores_gemma":[0.011165857,0.0005278262,0.0011268373,0.000684442,0.0018270671,0.0034125699,0.0012293374,0.017021876,0.013506025],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011258185,0.0000061178525,0.000009618841,0.00008022091,0.0000025594811,0.000119983124,0.000010359426,0.000019491337,0.000055690372,0.00077569176,0.9936893,0.0052196966],"study_design_scores_gemma":[0.000010279325,0.000012462265,0.00005643383,0.00015678129,0.0000065577456,0.00022090187,0.000024291063,0.00006639322,0.000069806,0.0009194809,0.9984491,0.0000075075873],"about_ca_topic_score_codex":0.00090834557,"about_ca_topic_score_gemma":0.0019467727,"teacher_disagreement_score":0.013911672,"about_ca_system_score_codex":0.0018794207,"about_ca_system_score_gemma":0.0018525443,"threshold_uncertainty_score":0.046539128},"labels":[],"label_agreement":null},{"id":"W4388145604","doi":"10.1109/lnet.2023.3328918","title":"Energy Sustainability in Dense Radio Access Networks via High Altitude Platform Stations","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Opportunistic and Delay-Tolerant 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":"Carleton University","funders":"","keywords":"Computer science; Base station; Efficient energy use; Computer network; Energy consumption; Quality of service; Scalability; Radio access network; Heterogeneous network; Wireless network; Wireless; Telecommunications; Mobile station; Engineering; Database","score_opus":0.024869310640625322,"score_gpt":0.26370565361794096,"score_spread":0.23883634297731565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388145604","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.5685551,0.0005957874,0.42203182,0.00019963013,0.000034308385,0.000061735904,0.000051575735,0.0001469595,0.008323069],"genre_scores_gemma":[0.98431754,0.00013151424,0.014542711,0.000016092277,0.000006312744,0.000011642548,0.000020261692,0.000004928594,0.00094902894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998977,0.00003296048,0.0000022524766,0.00002001205,0.00001925177,0.00002771948],"domain_scores_gemma":[0.9998888,0.00005541296,0.000019404846,0.000010288651,0.000012466792,0.000013545964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023615743,0.00037408294,0.00021939896,0.00023740361,0.0003685424,0.0006238251,0.00042711242,0.00028918017,0.0006645021],"category_scores_gemma":[0.00043895203,0.00016598575,0.00018244697,0.00028653155,0.00031073965,0.0005768674,0.0006480702,0.00017548585,0.00005810113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643797,0.000054428612,0.0028232469,0.000054463708,0.000026389527,0.00031614836,0.00006136288,0.92656696,0.011265735,0.009977756,0.0003390149,0.04841816],"study_design_scores_gemma":[0.000008225931,0.000065367945,0.00085992593,0.0000049063756,0.000012573852,0.000056658984,0.000088546214,0.9914807,0.0019318049,0.0048631015,0.0006238099,0.0000043401633],"about_ca_topic_score_codex":0.0030882792,"about_ca_topic_score_gemma":0.0061661215,"teacher_disagreement_score":0.0030882792,"about_ca_system_score_codex":0.0004864072,"about_ca_system_score_gemma":0.0003834241,"threshold_uncertainty_score":0.0061405897},"labels":[],"label_agreement":null},{"id":"W4393252848","doi":"10.1109/lnet.2024.3382955","title":"Necessary and Sufficient Condition for Triggering ECN Before PFC in Shared Memory Switches","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":0,"is_retracted":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":"Huawei Technologies","keywords":"Computer science; Computer network","score_opus":0.01446804937160483,"score_gpt":0.24086520517354745,"score_spread":0.2263971558019426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393252848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34807554,0.0012751499,0.6096591,0.0020198403,0.0005646008,0.00047824692,0.0010825092,0.0029670768,0.033877954],"genre_scores_gemma":[0.97020006,0.00030130282,0.027206335,0.00026221338,0.00015142541,0.00017218382,0.00027505527,0.00010288971,0.0013285667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974063,0.00023075711,0.00019872995,0.00063812104,0.0004956446,0.0010303911],"domain_scores_gemma":[0.98322195,0.009689726,0.0020838687,0.00067832565,0.0031388605,0.0011872416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023833367,0.0007984058,0.0013112862,0.0013760751,0.0011207205,0.0018346711,0.001305629,0.0011847476,0.005640181],"category_scores_gemma":[0.020463297,0.0006229262,0.0006671285,0.00058161304,0.0019097251,0.0029629385,0.0017001106,0.0017253303,0.000735317],"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.0030219122,0.0013774479,0.01865603,0.0016885125,0.00021332824,0.0063494197,0.0009838042,0.41698694,0.2060075,0.26188725,0.015863538,0.06696436],"study_design_scores_gemma":[0.00035818352,0.0005862213,0.0035686316,0.0001829274,0.00012282853,0.0011309398,0.0003926163,0.8612596,0.058304053,0.069038205,0.004926924,0.00012887808],"about_ca_topic_score_codex":0.0042637982,"about_ca_topic_score_gemma":0.0032335417,"teacher_disagreement_score":0.005640181,"about_ca_system_score_codex":0.0016158657,"about_ca_system_score_gemma":0.0036689043,"threshold_uncertainty_score":0.018868268},"labels":[],"label_agreement":null},{"id":"W4394674214","doi":"10.1109/lnet.2024.3386974","title":"Secure Private Blockchain-Based Instant Messaging Platform for Social Media Services","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Data and IoT Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Instant messaging; Internet privacy; Social media; Computer security; Instant; Computer science; World Wide Web; Business","score_opus":0.01793941004294834,"score_gpt":0.23163200685418084,"score_spread":0.2136925968112325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394674214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1714452,0.0004933099,0.76948035,0.0015873185,0.00041706068,0.0009209898,0.00071443105,0.010924287,0.044017132],"genre_scores_gemma":[0.93979204,0.00016409889,0.043940883,0.0001508009,0.00006265966,0.0002321431,0.00038591772,0.0001347618,0.015136751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00015342174,0.000059099115,0.00011760517,0.00038967736,0.00017798795],"domain_scores_gemma":[0.99865025,0.00017536501,0.0001440116,0.00055456674,0.0002677861,0.0002080514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308989,0.0003446601,0.0003484843,0.0003913564,0.0010840032,0.0012179149,0.0012649954,0.0009344123,0.00919982],"category_scores_gemma":[0.0014706021,0.00022618944,0.00023944977,0.0004521335,0.0007340694,0.0026993912,0.0022311555,0.0011311484,0.0031179045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030594585,0.0013096815,0.0061726547,0.0007599514,0.00012310661,0.0027646893,0.0012414547,0.13282338,0.19823238,0.30985934,0.03896914,0.30468476],"study_design_scores_gemma":[0.00037307275,0.0008912576,0.0013217726,0.00008388195,0.00005940802,0.0007613983,0.00019462984,0.7025377,0.13976063,0.0681502,0.08574166,0.00012440521],"about_ca_topic_score_codex":0.001288577,"about_ca_topic_score_gemma":0.001657886,"teacher_disagreement_score":0.00919982,"about_ca_system_score_codex":0.0007075088,"about_ca_system_score_gemma":0.0016080796,"threshold_uncertainty_score":0.0307765},"labels":[],"label_agreement":null},{"id":"W4396852896","doi":"10.1109/lnet.2024.3400764","title":"Unlocking Reconfigurability for Deep Reinforcement Learning in SFC Provisioning","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Reconfigurability; Provisioning; Reinforcement learning; Computer science; Artificial intelligence; Computer network; Telecommunications","score_opus":0.011823037553017574,"score_gpt":0.21930405309042278,"score_spread":0.2074810155374052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396852896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115211256,0.0008333016,0.8753764,0.00059220695,0.000096926924,0.000046951503,0.00004807327,0.00064980856,0.007145073],"genre_scores_gemma":[0.9821478,0.000110243476,0.016361777,0.00010034441,0.000013691612,0.00003053615,0.000024191217,0.000014451601,0.0011969225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974793,0.00006421859,0.000010533757,0.000059523023,0.00005030011,0.000067539695],"domain_scores_gemma":[0.999503,0.0002569744,0.000078037585,0.000035385827,0.000094141884,0.000032383567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058645144,0.00065262953,0.00050843874,0.00020118536,0.00026469803,0.00061061356,0.0008399924,0.00072465173,0.0012705439],"category_scores_gemma":[0.0016051495,0.00027924552,0.00029496668,0.00019966818,0.00065586105,0.00065878755,0.00056474225,0.001015867,0.00015045288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043462118,0.000035625642,0.0005293772,0.000025811229,0.000012190384,0.000043179443,0.000018892832,0.973751,0.0013863364,0.002085588,0.00039337858,0.021675177],"study_design_scores_gemma":[0.0000014357901,0.0000081044855,0.000030413612,0.0000012579778,0.0000015123428,0.0000028415336,0.0000012892956,0.9994578,0.00012620298,0.00031270678,0.000055623736,9.086072e-7],"about_ca_topic_score_codex":0.007054881,"about_ca_topic_score_gemma":0.0072267335,"teacher_disagreement_score":0.007054881,"about_ca_system_score_codex":0.00090647023,"about_ca_system_score_gemma":0.0009969766,"threshold_uncertainty_score":0.014027655},"labels":[],"label_agreement":null},{"id":"W4401536986","doi":"10.1109/lnet.2024.3442833","title":"Introducing Adaptive Continuous Adversarial Training (ACAT) to Enhance Machine Learning Robustness","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robustness (evolution); Adversarial system; Computer science; Artificial intelligence; Training (meteorology); Machine learning; Geography; Biology","score_opus":0.015515503359315534,"score_gpt":0.26177603512276487,"score_spread":0.24626053176344934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401536986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020916479,0.00027170693,0.9758614,0.00024143975,0.00009555727,0.00005545292,0.000026050315,0.0010498477,0.0014821353],"genre_scores_gemma":[0.78003806,0.0002550942,0.21673839,0.0003730506,0.00016050675,0.0001096177,0.000115309944,0.00019762617,0.0020123841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983998,0.00052314793,0.00008456548,0.00034610034,0.0004820864,0.00016418136],"domain_scores_gemma":[0.99468154,0.0033138231,0.00039179393,0.0008944656,0.0005723532,0.0001460349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023925467,0.0011501713,0.000887511,0.0005958277,0.00040104208,0.0007741654,0.0012997672,0.0010106296,0.0016790369],"category_scores_gemma":[0.011078646,0.00037090442,0.00062947144,0.0004251184,0.0012384363,0.0015828469,0.0020970101,0.0024465735,0.00052734296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002514959,0.00021441006,0.0027508368,0.00013332156,0.00011949466,0.00025549863,0.00017749435,0.7195323,0.038644046,0.011638494,0.0029142457,0.22336832],"study_design_scores_gemma":[0.000004819422,0.000060563096,0.00021048395,0.0000054903644,0.0000058076644,0.000051925468,0.0000054616107,0.9926085,0.0046165683,0.0017728457,0.00064888643,0.000008641749],"about_ca_topic_score_codex":0.0011188202,"about_ca_topic_score_gemma":0.001217648,"teacher_disagreement_score":0.0023925467,"about_ca_system_score_codex":0.00045949247,"about_ca_system_score_gemma":0.0006037413,"threshold_uncertainty_score":0.012653112},"labels":[],"label_agreement":null},{"id":"W4401567521","doi":"10.1109/lnet.2024.3444495","title":"Channel Aging-Aware LSTM-Based Channel Prediction for Satellite Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Telecommunications and Broadcasting 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":"Carleton University","funders":"","keywords":"Channel (broadcasting); Computer science; Communications satellite; Satellite; Telecommunications; Artificial intelligence; Speech recognition; Engineering; Aerospace engineering","score_opus":0.037409683449459274,"score_gpt":0.2514589548388386,"score_spread":0.21404927138937935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401567521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1152405,0.0016442792,0.87634414,0.00048229794,0.00034851825,0.000036794314,0.00021210226,0.0026844665,0.003006959],"genre_scores_gemma":[0.9469046,0.00037661125,0.050629277,0.00017050863,0.00009317813,0.000028040777,0.00020679354,0.000045127756,0.0015458887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998659,0.000026122734,0.0000072488488,0.000032852924,0.000033783057,0.000034123084],"domain_scores_gemma":[0.99965525,0.0001310545,0.00003971089,0.000042173855,0.00011157787,0.000020299387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003692181,0.00049818505,0.00037432785,0.0002716973,0.00033840953,0.00028453558,0.0007018509,0.00042310517,0.00088691845],"category_scores_gemma":[0.0009949958,0.00019114111,0.00020579636,0.00040200725,0.0002982748,0.00087097264,0.00040455032,0.00089533324,0.0002467287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034017797,0.0001411506,0.0028254942,0.000114891605,0.00007610561,0.00017695506,0.00012820557,0.6371319,0.029522989,0.0030780782,0.005323268,0.32114068],"study_design_scores_gemma":[0.0000026880007,0.00002129778,0.00015984871,0.000003114373,0.000007874252,0.000015885795,0.000006280548,0.99623895,0.0027500489,0.0005182949,0.0002713124,0.0000044363987],"about_ca_topic_score_codex":0.008293849,"about_ca_topic_score_gemma":0.013174226,"teacher_disagreement_score":0.008293849,"about_ca_system_score_codex":0.0004619208,"about_ca_system_score_gemma":0.0007917725,"threshold_uncertainty_score":0.016491115},"labels":[],"label_agreement":null},{"id":"W4403094413","doi":"10.1109/lnet.2024.3472034","title":"An eBPF-Based Trace-Driven Emulation Method for Satellite Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Emulation; TRACE (psycholinguistics); Satellite; Computer science; Remote sensing; Geology; Engineering; Aerospace engineering; Psychology","score_opus":0.023441375791189906,"score_gpt":0.3000713561349446,"score_spread":0.27662998034375474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403094413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044570146,0.0000143371435,0.9930005,0.000021112035,0.000009685402,0.000025793695,0.000020159023,0.001877917,0.00057348935],"genre_scores_gemma":[0.41818067,0.000096037045,0.5779827,0.000084574036,0.000024609395,0.00021865248,0.00023390065,0.00076127227,0.0024175358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991297,0.00027218406,0.000051097257,0.00010389759,0.00038541132,0.000057706293],"domain_scores_gemma":[0.99842995,0.0006014945,0.00012349036,0.0003728048,0.00042086162,0.00005137359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503904,0.0006329263,0.00031081817,0.00068283535,0.00040381038,0.00060321245,0.0014005116,0.0005113415,0.002227901],"category_scores_gemma":[0.0054291263,0.00026138214,0.00028959868,0.0003495957,0.0004983608,0.0013963617,0.000774282,0.00094271475,0.00052380917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039121896,0.00024455346,0.0035881991,0.0001611811,0.00007800335,0.00030693042,0.0004970066,0.5063694,0.06260667,0.05258571,0.0049558175,0.36821535],"study_design_scores_gemma":[0.000019188332,0.000059582104,0.00016114808,0.000010357156,0.0000074014597,0.000095427284,0.000015799043,0.9667573,0.023685152,0.0047323196,0.0044403975,0.000015938469],"about_ca_topic_score_codex":0.0017681296,"about_ca_topic_score_gemma":0.0011966223,"teacher_disagreement_score":0.002227901,"about_ca_system_score_codex":0.0005607853,"about_ca_system_score_gemma":0.0008387583,"threshold_uncertainty_score":0.007453084},"labels":[],"label_agreement":null},{"id":"W4403758818","doi":"10.1109/lnet.2024.3486260","title":"Multi-Modal Transformer and Reinforcement Learning-Based Beam Management","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"Mitacs","keywords":"Transformer; Modal; Reinforcement; Reinforcement learning; Computer science; Structural engineering; Engineering; Artificial intelligence; Materials science; Electrical engineering; Voltage; Composite material","score_opus":0.009480679318488065,"score_gpt":0.21098469262954486,"score_spread":0.2015040133110568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403758818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00933926,0.00023351244,0.9887692,0.000119980294,0.000033623077,0.00003543247,0.000045017805,0.00055189774,0.00087208976],"genre_scores_gemma":[0.7558857,0.00029957786,0.24026424,0.00030402665,0.00009075835,0.00012100474,0.00022418179,0.00010945376,0.0027011344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944407,0.00015301594,0.0000296251,0.00014656155,0.00015629527,0.00007032704],"domain_scores_gemma":[0.99910825,0.0004081217,0.00012525493,0.000105655534,0.00019611308,0.000056433888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011913696,0.00074553577,0.000713004,0.0005456632,0.0002691528,0.0006255577,0.0012476803,0.0006197149,0.001623174],"category_scores_gemma":[0.0027509297,0.0002849045,0.00059898524,0.0005601464,0.0006582155,0.0011434206,0.00082903326,0.0011197787,0.0004130473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028388805,0.00018906723,0.003093053,0.000112105714,0.00009714533,0.00012465121,0.000121718615,0.59678185,0.01797578,0.00828432,0.0036071416,0.3693293],"study_design_scores_gemma":[0.0000069491234,0.000020388587,0.00013105471,0.0000028326178,0.0000051207867,0.000017031663,0.000005276314,0.99616027,0.0018137599,0.0015142412,0.00031807763,0.000004953737],"about_ca_topic_score_codex":0.0034004627,"about_ca_topic_score_gemma":0.00391292,"teacher_disagreement_score":0.0034004627,"about_ca_system_score_codex":0.0005858224,"about_ca_system_score_gemma":0.0007456846,"threshold_uncertainty_score":0.006761372},"labels":[],"label_agreement":null},{"id":"W4404787656","doi":"10.1109/lnet.2024.3507792","title":"Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Network Time Synchronization Technologies","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Computer science; Clock synchronization; Scheduling (production processes); Synchronization (alternating current); Parallel computing; Real-time computing; Computer network; Mathematics; Telecommunications; Mathematical optimization","score_opus":0.016100702500308667,"score_gpt":0.250570308121127,"score_spread":0.23446960562081834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404787656","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.031895638,0.0029601038,0.9457755,0.00084965804,0.0002647443,0.000101768856,0.00023853281,0.00046019946,0.017453868],"genre_scores_gemma":[0.90463185,0.0033287827,0.085748315,0.00035004597,0.0003469756,0.00022446227,0.0002653361,0.0003124602,0.004791843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694794,0.0006953325,0.00014634672,0.0003506613,0.0011744848,0.0006853846],"domain_scores_gemma":[0.9848192,0.011289627,0.0011780963,0.00064494205,0.0016385857,0.00042956645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004837867,0.001554868,0.00095136603,0.0015711796,0.0012152368,0.0033481456,0.0011459875,0.00073599326,0.004063137],"category_scores_gemma":[0.026281852,0.00048698034,0.0005518211,0.0015565013,0.0013613189,0.003622902,0.002069411,0.0021827747,0.0005160932],"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.00019191662,0.000052344738,0.00069306075,0.00019683086,0.000027418768,0.00010688952,0.00019180134,0.8899574,0.0056102355,0.07869746,0.0016752736,0.022599302],"study_design_scores_gemma":[0.0000047496483,0.000034011784,0.00011868143,0.000032928023,0.000009668264,0.000022530425,0.000057585225,0.980312,0.0016155798,0.016862702,0.00091927417,0.000010330144],"about_ca_topic_score_codex":0.006790215,"about_ca_topic_score_gemma":0.0068770265,"teacher_disagreement_score":0.006790215,"about_ca_system_score_codex":0.004541007,"about_ca_system_score_gemma":0.0040323953,"threshold_uncertainty_score":0.03294748},"labels":[],"label_agreement":null},{"id":"W4404914317","doi":"10.1109/lnet.2024.3509792","title":"Serve Yourself! Federated Power Control for AI-Native 5G and Beyond","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Power (physics); Control (management); Power control; Artificial intelligence; Physics","score_opus":0.012094564173233062,"score_gpt":0.2254152256678428,"score_spread":0.21332066149460974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404914317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04038986,0.005874231,0.7836968,0.01974048,0.003315029,0.00017691623,0.00042803262,0.010160153,0.1362185],"genre_scores_gemma":[0.7309715,0.003017786,0.09518057,0.005608931,0.0009402159,0.00014653675,0.0005467369,0.0005910789,0.16299656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999044,0.000026066155,0.0000031198929,0.00001822799,0.000031822092,0.00001639136],"domain_scores_gemma":[0.9998555,0.000033177446,0.000007280754,0.000027200962,0.00004582458,0.000031008887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034139867,0.0003292145,0.00021833698,0.00023572527,0.0003861041,0.00066037884,0.00061630184,0.0006337201,0.025544459],"category_scores_gemma":[0.00086449954,0.00008710705,0.00017455782,0.00023052342,0.00030899726,0.0009761727,0.00081437523,0.00061484106,0.007009641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031043845,0.00016798629,0.0012408097,0.00015529155,0.00003102415,0.00036483162,0.0002358124,0.015250683,0.010306386,0.047295533,0.18519293,0.73944825],"study_design_scores_gemma":[0.000084044295,0.00040795468,0.0012000315,0.00012334475,0.000028543274,0.00093312137,0.00034039305,0.3676924,0.011497251,0.13138632,0.4862521,0.000054574048],"about_ca_topic_score_codex":0.0008969419,"about_ca_topic_score_gemma":0.0013845554,"teacher_disagreement_score":0.025544459,"about_ca_system_score_codex":0.00022389938,"about_ca_system_score_gemma":0.00018601547,"threshold_uncertainty_score":0.08545476},"labels":[],"label_agreement":null},{"id":"W4405178972","doi":"10.1109/lnet.2024.3514357","title":"Zero Trust Security Architecture for 6G Open Radio Access Networks (ORAN)","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec en Outaouais; Université du Québec à Montréal","funders":"","keywords":"Architecture; Zero (linguistics); Zero-knowledge proof; Computer science; Computer security; Computer network; Telecommunications; Cryptography; Geography","score_opus":0.05075982727646133,"score_gpt":0.3208102305122604,"score_spread":0.27005040323579904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405178972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07707316,0.0002543785,0.90842056,0.00088534097,0.000118448275,0.00023753372,0.00004667958,0.0019436522,0.01102026],"genre_scores_gemma":[0.9103115,0.00015958157,0.08421654,0.00016364694,0.000035463298,0.00011627857,0.00007347837,0.000056215133,0.004867244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883455,0.00025880677,0.00009044463,0.00021133086,0.00039555522,0.00020933262],"domain_scores_gemma":[0.9987557,0.00018250816,0.00020911756,0.0002872259,0.00039688422,0.0001686335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014951762,0.0004360853,0.00036011921,0.00042328532,0.0009999103,0.0016477854,0.0013641384,0.0008256284,0.0018070362],"category_scores_gemma":[0.0021153179,0.00021506463,0.00047630354,0.00019051957,0.0014639663,0.0023173818,0.0030373456,0.0012860701,0.0005247396],"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.0006439044,0.0003294975,0.006162759,0.00035711675,0.00017203,0.0009288672,0.0015142942,0.29761904,0.057475325,0.47550705,0.007025306,0.15226473],"study_design_scores_gemma":[0.000036999827,0.00018620917,0.0004997355,0.00003212744,0.000054790104,0.00021143693,0.00010417026,0.919538,0.010642328,0.055498123,0.013155239,0.000040781095],"about_ca_topic_score_codex":0.0023518407,"about_ca_topic_score_gemma":0.0025980116,"teacher_disagreement_score":0.0023518407,"about_ca_system_score_codex":0.0013044942,"about_ca_system_score_gemma":0.0019966718,"threshold_uncertainty_score":0.0094648},"labels":[],"label_agreement":null},{"id":"W4405811815","doi":"10.1109/lnet.2024.3522966","title":"Quantum-Safe Blockchain in Hyperledger Fabric","year":2024,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Algoma University","funders":"Algoma University","keywords":"Blockchain; Quantum; Computer science; Computer security; Physics","score_opus":0.015196688907093282,"score_gpt":0.22423976343598212,"score_spread":0.20904307452888884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405811815","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.5026062,0.00046243134,0.4590148,0.00069663156,0.00018864364,0.0002705546,0.00031903884,0.0026684352,0.033773165],"genre_scores_gemma":[0.9499363,0.00015673527,0.043262172,0.00006570609,0.00001937547,0.00011316156,0.00010651672,0.00009838437,0.0062417067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908674,0.00031224062,0.000038556438,0.0001361192,0.00029258005,0.0001336715],"domain_scores_gemma":[0.9987698,0.0003502068,0.000102056874,0.0005076003,0.00013281597,0.00013739029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925393,0.00026253,0.00041837033,0.0003674347,0.0008117012,0.0015597311,0.0007888701,0.0008721274,0.006378135],"category_scores_gemma":[0.0022380275,0.00023872736,0.00031306173,0.0003215009,0.0012421323,0.0026527466,0.0018112237,0.0008349129,0.0009993388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010040295,0.00030217454,0.003085661,0.00021920244,0.000050936087,0.0011488739,0.0007637561,0.26764676,0.054752015,0.6049342,0.002346234,0.063746154],"study_design_scores_gemma":[0.00012398584,0.00038195352,0.0006843558,0.000065573404,0.00002757395,0.0002607018,0.00014660045,0.77567214,0.04562283,0.15930839,0.01765232,0.00005350383],"about_ca_topic_score_codex":0.0009923707,"about_ca_topic_score_gemma":0.0010878117,"teacher_disagreement_score":0.006378135,"about_ca_system_score_codex":0.0007669963,"about_ca_system_score_gemma":0.0010756591,"threshold_uncertainty_score":0.021337032},"labels":[],"label_agreement":null},{"id":"W4407900084","doi":"10.1109/lnet.2025.3545286","title":"Network Resource Optimization for ML-Based UAV Condition Monitoring With Vibration Analysis","year":2025,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Advanced Measurement and Detection Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Vibration; Resource (disambiguation); Acoustics; Computer network; Physics","score_opus":0.017900709189520456,"score_gpt":0.25723851493386696,"score_spread":0.2393378057443465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407900084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053104326,0.0003698645,0.9424807,0.0002968619,0.0000302208,0.000057710226,0.00011231967,0.000584215,0.0029636817],"genre_scores_gemma":[0.90926445,0.00018610935,0.08897008,0.0000667332,0.000030025958,0.000109082896,0.00014990332,0.00005784068,0.0011657211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.00012871121,0.000014565854,0.0000739304,0.0000892637,0.000054994245],"domain_scores_gemma":[0.9995252,0.0002860454,0.000052335436,0.000043025906,0.000069753805,0.000023769026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060389814,0.0007973645,0.0005628301,0.00032682627,0.00028031625,0.0006752341,0.0006166221,0.0004291154,0.001304157],"category_scores_gemma":[0.0019875246,0.00022570431,0.00028891148,0.00028693615,0.00037548674,0.0009770222,0.0008014548,0.0005734007,0.00025068008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010511259,0.00004567544,0.0009031417,0.00004318282,0.000019320049,0.0000574048,0.000026398437,0.944977,0.004878784,0.0027140079,0.0008244714,0.045405637],"study_design_scores_gemma":[0.0000022980194,0.0000115524945,0.00013832033,0.0000016872709,0.0000021775372,0.000007472315,0.000005891064,0.99828714,0.00071874604,0.0006850256,0.00013797081,0.0000018088539],"about_ca_topic_score_codex":0.004283424,"about_ca_topic_score_gemma":0.0041036904,"teacher_disagreement_score":0.004283424,"about_ca_system_score_codex":0.00072862854,"about_ca_system_score_gemma":0.00067771494,"threshold_uncertainty_score":0.008516967},"labels":[],"label_agreement":null},{"id":"W4408519585","doi":"10.1109/lnet.2025.3551989","title":"Comprehensive Advanced Persistent Threats Dataset","year":2025,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Network Security and Intrusion Detection","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science","score_opus":0.023166460672643573,"score_gpt":0.2621675295900745,"score_spread":0.23900106891743092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408519585","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026303103,0.0011208917,0.0033836286,0.0011942525,0.0002566559,0.000440792,0.95090497,0.0021268863,0.01426881],"genre_scores_gemma":[0.026859095,0.0002998491,0.0038481324,0.00034609257,0.00005712616,0.0003135109,0.966409,0.000084276566,0.0017829911],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978369,0.00040410363,0.0002643849,0.00041853814,0.0007720386,0.00030406783],"domain_scores_gemma":[0.9966078,0.00069322746,0.0004886318,0.0010399558,0.0008661555,0.0003041472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015710704,0.0012952616,0.0008299312,0.0030170614,0.0010306234,0.0014355575,0.002121503,0.0026253485,0.0060853506],"category_scores_gemma":[0.005543397,0.000313254,0.0008228363,0.0027365854,0.0005846939,0.0020483453,0.0019789801,0.0021635466,0.009308733],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003048055,0.0004048764,0.02574204,0.0008239321,0.00013828097,0.0005389008,0.00017560655,0.0066545145,0.0016557897,0.005052077,0.9259467,0.032562327],"study_design_scores_gemma":[0.0001854232,0.00021834527,0.04368768,0.00044531943,0.00007721352,0.0011105494,0.0006372586,0.015573986,0.0028470373,0.00507223,0.9300239,0.00012101004],"about_ca_topic_score_codex":0.008137731,"about_ca_topic_score_gemma":0.014832235,"teacher_disagreement_score":0.008137731,"about_ca_system_score_codex":0.0011235725,"about_ca_system_score_gemma":0.0015823292,"threshold_uncertainty_score":0.02035749},"labels":[],"label_agreement":null},{"id":"W4414311131","doi":"10.1109/lnet.2025.3611236","title":"FLARE: Flying Learning Agents for Resource Efficiency in Next-Gen UAV Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Research Foundation","keywords":"Reinforcement learning; Software deployment; Bandwidth (computing); Resource allocation; Bandwidth allocation; Dynamic bandwidth allocation; Wireless; Base station; Wireless network; Resource management (computing)","score_opus":0.01264134274796679,"score_gpt":0.22423235525584886,"score_spread":0.21159101250788206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414311131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167189,0.00042613415,0.96381545,0.0004075003,0.000074325886,0.000036280657,0.000032630258,0.0003756832,0.003160102],"genre_scores_gemma":[0.89396095,0.00024427933,0.10232033,0.0003012868,0.000055779776,0.00007204636,0.000055585046,0.00005420202,0.0029355164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.000051578474,0.000006865956,0.000029642422,0.00004656377,0.000040841638],"domain_scores_gemma":[0.999684,0.00015664619,0.00004501341,0.000024095916,0.000057257468,0.000033082284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064899767,0.0005569203,0.00057345076,0.00020958453,0.00036430362,0.0005355163,0.0008777647,0.00070707337,0.0012668823],"category_scores_gemma":[0.0014154994,0.00019102452,0.00024310045,0.00019577192,0.00058362604,0.00075872644,0.00090684864,0.0008255419,0.00017808867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027662676,0.000024028684,0.00043689102,0.000018568955,0.000014254253,0.00003574477,0.00002537504,0.9649416,0.0008285668,0.0067275045,0.0009485813,0.02597127],"study_design_scores_gemma":[0.000003622776,0.000012285146,0.000025260379,0.0000016774798,0.0000014670808,0.000004542263,0.0000031157515,0.9982304,0.00013383056,0.0012865666,0.0002960455,0.0000011982656],"about_ca_topic_score_codex":0.0055776825,"about_ca_topic_score_gemma":0.005691574,"teacher_disagreement_score":0.0055776825,"about_ca_system_score_codex":0.00061056175,"about_ca_system_score_gemma":0.0008187754,"threshold_uncertainty_score":0.011090457},"labels":[],"label_agreement":null},{"id":"W4414458973","doi":"10.1109/lnet.2025.3614549","title":"DRL-Driven Edge-Aware Utility Optimization for Multi-Slice 6G Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Software-Defined Networks and 5G","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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Provisioning; Latency (audio); Resource allocation; Bandwidth (computing); Edge device; Edge computing; Enhanced Data Rates for GSM Evolution; Virtual reality; Bandwidth allocation","score_opus":0.0339492793363138,"score_gpt":0.273324640407439,"score_spread":0.23937536107112517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414458973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052417208,0.00058149296,0.9432809,0.00031781924,0.00004112408,0.000042081007,0.000050214974,0.00023300157,0.0030361933],"genre_scores_gemma":[0.9621464,0.00015749376,0.03605842,0.0001103428,0.000021615766,0.000025922698,0.000043083957,0.0000401065,0.0013966208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.00011908979,0.000010601216,0.000067804605,0.00006459591,0.00009797143],"domain_scores_gemma":[0.9995098,0.00023547318,0.00006119104,0.000027204216,0.00011286173,0.00005342968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462647,0.00062466704,0.000798969,0.00027072092,0.00034311952,0.0007931749,0.0010414028,0.0005452096,0.0013593037],"category_scores_gemma":[0.00168813,0.00032231942,0.00023978058,0.000305848,0.00055964635,0.0010007579,0.0009959674,0.00069263077,0.00016647189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072979994,0.00003546028,0.00044429503,0.000023931489,0.000015370511,0.000047029458,0.000027609776,0.975323,0.0019071471,0.004441667,0.0007769973,0.016884387],"study_design_scores_gemma":[0.0000020960063,0.000008595486,0.000024961113,9.821536e-7,0.0000014913044,0.000004632621,0.0000040263994,0.99897337,0.0001408528,0.0007605352,0.000077308934,0.0000012807865],"about_ca_topic_score_codex":0.0058800485,"about_ca_topic_score_gemma":0.0072724554,"teacher_disagreement_score":0.0058800485,"about_ca_system_score_codex":0.0013307654,"about_ca_system_score_gemma":0.0009390697,"threshold_uncertainty_score":0.0116916895},"labels":[],"label_agreement":null},{"id":"W7083448444","doi":"10.1109/lnet.2025.3614653","title":"Edge-Based Platform for Large Language Models Deployment in Internet of Things Applications","year":2025,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software deployment; Scalability; Internet of Things; The Internet; Web of Things; Work (physics)","score_opus":0.01731110751086024,"score_gpt":0.24310186679240595,"score_spread":0.2257907592815457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083448444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21292542,0.00036216428,0.7327756,0.0009212674,0.0002999485,0.00038272204,0.0007406842,0.031359855,0.020232359],"genre_scores_gemma":[0.78117955,0.00017494227,0.21056643,0.00034775035,0.000039243772,0.00023504892,0.0013251426,0.00067296356,0.0054591075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996364,0.00010904539,0.000025896155,0.00006563031,0.000108946435,0.00005412531],"domain_scores_gemma":[0.99948066,0.00016049492,0.0000335805,0.00015317075,0.00011994006,0.000052065086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046912336,0.00047521695,0.00027777237,0.00030000307,0.00038959176,0.0007077613,0.0012957026,0.0005294174,0.003766795],"category_scores_gemma":[0.0014511744,0.00019806065,0.00036488683,0.00026966704,0.00022804657,0.0017535908,0.001312662,0.00066006393,0.0013050068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029884188,0.001542737,0.00919891,0.0006280339,0.0002187206,0.004131714,0.0012757477,0.12931234,0.17532937,0.06332191,0.06284883,0.5492033],"study_design_scores_gemma":[0.00007252916,0.0002648863,0.0010711575,0.000024479306,0.0000305718,0.00027354868,0.00018126024,0.93489885,0.03533534,0.008714119,0.01908855,0.000044718025],"about_ca_topic_score_codex":0.0012829658,"about_ca_topic_score_gemma":0.0017725561,"teacher_disagreement_score":0.003766795,"about_ca_system_score_codex":0.00026464806,"about_ca_system_score_gemma":0.00041092667,"threshold_uncertainty_score":0.012601197},"labels":[],"label_agreement":null}]}