{"meta":{"query_hash":"4a138ea53e52","filters":{"venue":"IEEE Transactions on Network Science and Engineering"},"cohort_total":147,"direct_labels_cover":2,"predictions_cover":147,"exported":147,"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/4a138ea53e52","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Network+Science+and+Engineering"},"results":[{"id":"W1651715594","doi":"10.1109/tnse.2015.2500162","title":"The Strategic Formation of Multi-Layer Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enhanced Data Rates for GSM Evolution; Layer (electronics); Nash equilibrium; Computer science; Network layer; Network formation; Mathematical optimization; Game theory; Set (abstract data type); Network topology; Strategy; Topology (electrical circuits); Mathematics; Computer network; Artificial intelligence; Mathematical economics; Combinatorics","score_opus":0.135086230070719,"score_gpt":0.33015150198233567,"score_spread":0.19506527191161668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651715594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1693491,0.00038167406,0.81535673,0.0010434483,0.00005403665,0.00016438047,0.0001098909,0.00007788947,0.013462671],"genre_scores_gemma":[0.9362806,0.00039821508,0.059418514,0.00014699461,0.000028151942,0.00012370941,0.00006891792,0.000022365286,0.0035124535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793506,0.0011553947,0.00006881119,0.00028616478,0.0002380478,0.00031655986],"domain_scores_gemma":[0.9958621,0.0022124674,0.0007258588,0.00034970112,0.0003261428,0.00052372966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022438916,0.00085997017,0.0006855243,0.000574638,0.0009733847,0.0020100428,0.0014986387,0.0012610285,0.0020203632],"category_scores_gemma":[0.0075873164,0.00060526177,0.0006365142,0.0007189791,0.0019977344,0.0043058433,0.0023808007,0.0011272352,0.00025590466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013554936,0.00008056693,0.0017832322,0.00013885912,0.00007592195,0.00035211205,0.00034456144,0.55699,0.0028720726,0.42232695,0.0012546121,0.013645497],"study_design_scores_gemma":[0.000031216066,0.000070203205,0.00032816292,0.000020750722,0.000023089397,0.00011631517,0.00019590644,0.7865838,0.0010183348,0.20907721,0.00251404,0.000020853327],"about_ca_topic_score_codex":0.0020525183,"about_ca_topic_score_gemma":0.002106865,"teacher_disagreement_score":0.0022438916,"about_ca_system_score_codex":0.0014868687,"about_ca_system_score_gemma":0.0010982895,"threshold_uncertainty_score":0.011866987},"labels":[],"label_agreement":null},{"id":"W2792728919","doi":"10.1109/tnse.2018.2816951","title":"Mitigating Bottlenecks in Wide Area Data Analytics via Machine Learning","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Huawei Technologies","keywords":"Bottleneck; Computer science; Scheduling (production processes); Locality; Petabyte; Distributed database; Distributed computing; SPARK (programming language); Exponential growth; Execution time; Analytics; Database; Data mining; Big data; Mathematical optimization; Embedded system","score_opus":0.020292865601223162,"score_gpt":0.22155257365931452,"score_spread":0.20125970805809135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792728919","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.14852105,0.003538145,0.82834715,0.002450182,0.00021199211,0.00023039347,0.00043549424,0.013667239,0.0025982845],"genre_scores_gemma":[0.800414,0.00097166304,0.19497854,0.00054529915,0.00021141718,0.0001767628,0.00086077634,0.0002694278,0.0015719623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975631,0.000792812,0.0001572881,0.0006271817,0.0005284531,0.0003310424],"domain_scores_gemma":[0.9915878,0.0047726086,0.00083807396,0.00094241655,0.0014915732,0.0003675595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004578817,0.0016919305,0.0016768234,0.0018990574,0.0011330487,0.001846248,0.002643005,0.0010396686,0.00094319595],"category_scores_gemma":[0.014285868,0.0007524234,0.0006312486,0.0020199933,0.0012662471,0.004756206,0.0021116312,0.0022910556,0.0005075558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069575105,0.00087482214,0.012921131,0.00031224682,0.00020734112,0.00013248436,0.00026353318,0.67963254,0.008675323,0.0045221215,0.009843971,0.28191873],"study_design_scores_gemma":[0.000011606849,0.000044250493,0.00045924244,0.0000055688893,0.000011331957,0.000009032883,0.000033359873,0.99362355,0.0014923445,0.0037432835,0.00055871194,0.000007765534],"about_ca_topic_score_codex":0.009600896,"about_ca_topic_score_gemma":0.008981621,"teacher_disagreement_score":0.009600896,"about_ca_system_score_codex":0.0013931075,"about_ca_system_score_gemma":0.0034834724,"threshold_uncertainty_score":0.0242154},"labels":[],"label_agreement":null},{"id":"W2796567768","doi":"10.1109/tnse.2018.2825144","title":"Channel Selective Activity Recognition with WiFi: A Deep Learning Approach Exploring Wideband Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Computer science; Activity recognition; Channel (broadcasting); Spectrogram; Feature extraction; Hidden Markov model; Wideband; Context (archaeology); Deep learning; Bandwidth (computing); Artificial intelligence; Speech recognition; Computer network; Engineering; Electronic engineering","score_opus":0.015866780461194246,"score_gpt":0.18254906034636872,"score_spread":0.16668227988517448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796567768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073597185,0.0008491715,0.91946375,0.0003358825,0.00009798099,0.000048386384,0.00062835426,0.0020067738,0.002972454],"genre_scores_gemma":[0.83618087,0.0008772196,0.15509626,0.00034796,0.00008318562,0.000110014436,0.0012586459,0.00010690885,0.0059389705],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982446,0.00002639619,0.000008705826,0.000059420378,0.0000379196,0.000043168402],"domain_scores_gemma":[0.9998148,0.00007721393,0.000027135136,0.000026246153,0.00003870365,0.000015818669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025937107,0.0008560356,0.0004967933,0.0006575997,0.00017103285,0.0004613439,0.0009377791,0.0006072176,0.0011617551],"category_scores_gemma":[0.001037818,0.00029990185,0.00050639984,0.0007512537,0.00028692136,0.000854228,0.00083126395,0.0010170611,0.0005015193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019159845,0.0002110455,0.0063521015,0.00013323504,0.00013491875,0.0002012756,0.00012147372,0.17496893,0.019985262,0.0029570411,0.004535029,0.7902081],"study_design_scores_gemma":[0.0000078015355,0.000063933636,0.0024565049,0.000018171144,0.000027774406,0.00008145404,0.00003558653,0.98628426,0.00540899,0.004148518,0.0014522476,0.0000146954135],"about_ca_topic_score_codex":0.004692106,"about_ca_topic_score_gemma":0.0073132874,"teacher_disagreement_score":0.004692106,"about_ca_system_score_codex":0.00035040418,"about_ca_system_score_gemma":0.00041711057,"threshold_uncertainty_score":0.009329617},"labels":[],"label_agreement":null},{"id":"W2885808274","doi":"10.1109/tnse.2018.2862919","title":"Neuronal Spatial Arrangement Shapes Effective Connectivity Traits of <i>in vitro</i> Cortical Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"H2020 Future and Emerging Technologies; Generalitat de Catalunya; European Commission","keywords":"Metric (unit); Computer science; Artificial intelligence; Homogeneous; Algorithm; Combinatorics; Mathematics","score_opus":0.010156824623070649,"score_gpt":0.2147091838829748,"score_spread":0.20455235925990414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885808274","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.9906322,0.00008378489,0.0084760245,0.000030152582,0.000002655013,0.000005097,0.000092039714,0.000049069356,0.00062902615],"genre_scores_gemma":[0.998027,0.00007821359,0.001640976,0.000007004435,0.0000015704173,0.000009263727,0.00010176936,0.0000127025805,0.00012144103],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986434,0.000028848035,0.00001074289,0.00003075529,0.000029435505,0.000035895864],"domain_scores_gemma":[0.9993962,0.00022335263,0.00015377162,0.00005279763,0.000091702736,0.000082081315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021803596,0.00020335503,0.0001782159,0.00040527407,0.00022485266,0.00053032977,0.00026448662,0.00022327817,0.00048482273],"category_scores_gemma":[0.0010723574,0.00023503765,0.00017997496,0.00027414478,0.00039724223,0.00045321076,0.0002901874,0.0002798623,0.000102231985],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017060335,0.000062224375,0.018751092,0.00016127728,0.00009430421,0.00060662464,0.00039733975,0.1579627,0.8097994,0.003945737,0.0004257718,0.0076229307],"study_design_scores_gemma":[0.000033140357,0.00024588665,0.14758028,0.000038074355,0.00016272385,0.0007554628,0.00048841635,0.458211,0.38648143,0.004319654,0.0016201104,0.0000639459],"about_ca_topic_score_codex":0.0023216289,"about_ca_topic_score_gemma":0.0027154128,"teacher_disagreement_score":0.0023216289,"about_ca_system_score_codex":0.00069993327,"about_ca_system_score_gemma":0.00023392272,"threshold_uncertainty_score":0.005078435},"labels":[],"label_agreement":null},{"id":"W2897411018","doi":"10.1109/tnse.2018.2877441","title":"Learning-Theoretic Multi-Channel Spectrum Sensing and Access in Full-Duplex Cognitive Radio Networks with Unknown Primary User Activities","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Optimization problem; Convex optimization; Wireless; Throughput; Channel (broadcasting); Computer network; Robust optimization; Mathematical optimization; Regular polygon; Algorithm; Mathematics; Telecommunications","score_opus":0.008808122102316235,"score_gpt":0.2136440833952946,"score_spread":0.20483596129297835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897411018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07281282,0.000604116,0.9234165,0.00036118936,0.000025128542,0.0000437477,0.00006482278,0.00011264645,0.002559009],"genre_scores_gemma":[0.9805437,0.00032429097,0.017759312,0.000072844115,0.00002744093,0.00006960007,0.000029609608,0.000020178042,0.0011529796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984573,0.00063636556,0.00005134365,0.00027533495,0.00033334474,0.00024634588],"domain_scores_gemma":[0.994686,0.0040457803,0.00063526677,0.00022023328,0.00027237178,0.00014042149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027435382,0.000925046,0.0012366152,0.0004812367,0.0004007885,0.0013697578,0.001232911,0.0010533886,0.00065186934],"category_scores_gemma":[0.008463915,0.0007258733,0.000647133,0.0006955055,0.002190095,0.0014824098,0.0013339752,0.001054589,0.00013259587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065035754,0.000029658268,0.00028834696,0.000041110114,0.00002075916,0.00008087959,0.000040601844,0.9841024,0.0006921898,0.009388332,0.0001494949,0.0051011285],"study_design_scores_gemma":[0.0000037236805,0.000012249226,0.000081187245,0.0000018507255,0.0000033257984,0.000012192177,0.00000621469,0.9953354,0.00016560759,0.0043446417,0.00003017725,0.000003461758],"about_ca_topic_score_codex":0.0042690025,"about_ca_topic_score_gemma":0.0024744985,"teacher_disagreement_score":0.0042690025,"about_ca_system_score_codex":0.0016477109,"about_ca_system_score_gemma":0.001530082,"threshold_uncertainty_score":0.0145094395},"labels":[],"label_agreement":null},{"id":"W2909294622","doi":"10.1109/tnse.2019.2929155","title":"HO-OTSVD: A Novel Tensor Decomposition and Its Incremental Decomposition for Cyber–Physical–Social Networks (CPSN)","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Singular value decomposition; Orthogonalization; Tensor (intrinsic definition); Lanczos resampling; Computer science; Tensor decomposition; Tucker decomposition; Decomposition; Adjacency matrix; Theoretical computer science; Matrix decomposition; Distributed computing; Mathematics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.019971534297515935,"score_gpt":0.2905657392360518,"score_spread":0.27059420493853586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909294622","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.0032969178,0.00018377134,0.9953301,0.000094097464,0.000064256645,0.000035525878,0.00013838767,0.00036520496,0.0004918346],"genre_scores_gemma":[0.13461527,0.00065685285,0.8597371,0.00012903902,0.00011705652,0.00019473983,0.0014271316,0.00020993776,0.0029127966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.00022138537,0.00007949605,0.00016980212,0.0003132825,0.000097820805],"domain_scores_gemma":[0.9987692,0.00027945425,0.00014249898,0.00024490326,0.000428549,0.0001353416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010532853,0.0012463126,0.0009268819,0.0011926993,0.0006485429,0.0013011892,0.0014318383,0.00079468684,0.0024732135],"category_scores_gemma":[0.0032630153,0.00046179377,0.0013477075,0.001644059,0.0008078395,0.0024335438,0.0016889288,0.0017318273,0.00096695416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023675739,0.00016826023,0.0035829253,0.0005193462,0.0001890275,0.0002780955,0.0003358217,0.3620368,0.017226262,0.050157692,0.013191359,0.5520776],"study_design_scores_gemma":[0.000009023626,0.000029114237,0.00023839579,0.000009499416,0.000011138463,0.000048223978,0.00004180018,0.9865108,0.0015807104,0.008527952,0.0029781577,0.0000152217735],"about_ca_topic_score_codex":0.013542503,"about_ca_topic_score_gemma":0.015912902,"teacher_disagreement_score":0.013542503,"about_ca_system_score_codex":0.0008739022,"about_ca_system_score_gemma":0.002037858,"threshold_uncertainty_score":0.026927352},"labels":[],"label_agreement":null},{"id":"W2914576459","doi":"10.1109/tnse.2018.2865183","title":"Trust-Based Social Networks with Computing, Caching and Communications: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":102,"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; Ministerio de Economía y Competitividad","keywords":"Computer science; Reinforcement learning; Exploit; Leverage (statistics); Mobile edge computing; Distributed computing; Computation; Mobile device; Social network (sociolinguistics); Scheme (mathematics); Mobile social network; Artificial intelligence; Mobile computing; Computer network; Enhanced Data Rates for GSM Evolution; Social media; Computer security; World Wide Web","score_opus":0.01240932805343792,"score_gpt":0.20963964084445558,"score_spread":0.19723031279101766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914576459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078190096,0.00070979376,0.9150102,0.0016709035,0.00008063699,0.00006017734,0.00008975988,0.0003103069,0.003878049],"genre_scores_gemma":[0.96194845,0.00024450177,0.035078097,0.00019335136,0.000053944404,0.00007106951,0.00006184296,0.000024266858,0.00232442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948883,0.00020230199,0.000022098908,0.000105045416,0.000078840996,0.000102841084],"domain_scores_gemma":[0.9978988,0.0013582355,0.00022992384,0.00008579958,0.0002721784,0.00015501547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129131,0.000721864,0.0010667309,0.00054196693,0.00048707137,0.0009282199,0.0014619562,0.0012962136,0.0016041839],"category_scores_gemma":[0.0042712204,0.0004404238,0.0005158569,0.00045012566,0.0012939742,0.0014955207,0.0011281951,0.001650183,0.00014605143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005436008,0.000053906297,0.0015257975,0.00003731282,0.000043363325,0.00006941716,0.000059607744,0.96313995,0.000399851,0.014739594,0.00074721273,0.019129641],"study_design_scores_gemma":[0.000002206162,0.0000056424606,0.000043967193,0.0000018127329,0.000002641866,0.0000029680077,0.0000027901563,0.99728537,0.00003656658,0.002555967,0.000058541442,0.0000015219622],"about_ca_topic_score_codex":0.014765528,"about_ca_topic_score_gemma":0.012769686,"teacher_disagreement_score":0.014765528,"about_ca_system_score_codex":0.001990993,"about_ca_system_score_gemma":0.0013993224,"threshold_uncertainty_score":0.029359162},"labels":[],"label_agreement":null},{"id":"W2949219685","doi":"10.1109/tnse.2019.2959230","title":"B-Ride: Ride Sharing With Privacy-Preservation, Trust and Fair Payment Atop Public Blockchain","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Qatar National Research Fund; National Science Foundation","keywords":"Computer security; Payment; Sybil attack; Anonymity; Service (business); Pseudonym; Service provider; Proof-of-work system; Trusted third party; Computer science; Protocol (science); Blockchain; Smart contract; Internet privacy; Single point of failure; Business; Denial-of-service attack; Computer network; Law; Finance; The Internet","score_opus":0.014004002960859381,"score_gpt":0.21221517907373705,"score_spread":0.19821117611287767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949219685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021578137,0.0004471695,0.9574543,0.0012588138,0.00018844123,0.00061800587,0.0004890088,0.002922373,0.015043818],"genre_scores_gemma":[0.82719624,0.00085274107,0.14925542,0.00038225052,0.00020068006,0.0006595008,0.0011291037,0.0003409247,0.01998321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484235,0.0012558587,0.00038437758,0.0009369098,0.0018138661,0.0007666243],"domain_scores_gemma":[0.9940645,0.001465604,0.0005117883,0.002607493,0.0008476099,0.00050295575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035274252,0.0007468114,0.0014387169,0.0010549471,0.0020857935,0.0037167894,0.0031422907,0.0024928888,0.010063972],"category_scores_gemma":[0.01147909,0.000623541,0.0009838458,0.00240827,0.0029660321,0.00771616,0.008199907,0.0025201628,0.0033570682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000981312,0.00039694086,0.0026662287,0.0007508397,0.0001463108,0.0018003001,0.0010666049,0.17275621,0.014225238,0.5855239,0.018869149,0.20081699],"study_design_scores_gemma":[0.00026407154,0.00017378491,0.000350558,0.000094560026,0.000051816503,0.0007875157,0.00013372059,0.6063929,0.007949415,0.3401901,0.04350087,0.000110657784],"about_ca_topic_score_codex":0.0043586288,"about_ca_topic_score_gemma":0.003630682,"teacher_disagreement_score":0.010063972,"about_ca_system_score_codex":0.0017877001,"about_ca_system_score_gemma":0.005534506,"threshold_uncertainty_score":0.033667326},"labels":[],"label_agreement":null},{"id":"W2956944814","doi":"10.1109/tnse.2019.2928716","title":"Modeling of Bitcoin's Blockchain Delivery Network","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Poisson distribution; Node (physics); Computer network; Partition (number theory); Queue; Distributed computing; Mathematics; Engineering; Statistics","score_opus":0.006569415816294864,"score_gpt":0.1876898200914418,"score_spread":0.18112040427514695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956944814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1277903,0.00057799014,0.85217595,0.0011042344,0.000055406515,0.00018725023,0.00062128267,0.0004615746,0.01702601],"genre_scores_gemma":[0.95388013,0.00085850427,0.029846534,0.00012431013,0.000036657904,0.00026619583,0.000299288,0.00009709029,0.014591329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993949,0.00017088589,0.000025094785,0.00012438379,0.00016716866,0.000117542164],"domain_scores_gemma":[0.99908054,0.00038356928,0.00019668341,0.00006478228,0.00020041197,0.000074017276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958209,0.00056808617,0.0006658444,0.0009323011,0.00073563104,0.0013859873,0.0015121066,0.0012736754,0.0031093513],"category_scores_gemma":[0.0023308631,0.00039517714,0.00038412175,0.0010548518,0.00083521806,0.0029355197,0.00085760886,0.0008353442,0.00058485137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048105732,0.000031108724,0.00077069213,0.000027974003,0.000009316761,0.00017588411,0.000102876904,0.9312841,0.0019153423,0.06131041,0.00060924713,0.003714991],"study_design_scores_gemma":[0.000003130896,0.0000073194183,0.00009189267,0.0000026217183,0.0000020080604,0.000025765657,0.000012517733,0.99206865,0.00014943516,0.007214252,0.00041885016,0.0000035387848],"about_ca_topic_score_codex":0.008818466,"about_ca_topic_score_gemma":0.0048631257,"teacher_disagreement_score":0.008818466,"about_ca_system_score_codex":0.0023413196,"about_ca_system_score_gemma":0.0012907849,"threshold_uncertainty_score":0.017534316},"labels":[],"label_agreement":null},{"id":"W2964421893","doi":"10.1109/tnse.2019.2932727","title":"Repairable Fountain Coded Storage Systems for Multi-Tier Mobile Edge Caching Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Cloud computing; Exploit; Upload; Locality; Enhanced Data Rates for GSM Evolution; Base station; Mobile edge computing; Distributed computing; Server; Operating system; Computer security; Telecommunications","score_opus":0.014328571936968699,"score_gpt":0.21765231862568615,"score_spread":0.20332374668871744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964421893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14072588,0.0024688127,0.8509367,0.0003111187,0.00015140533,0.000107110056,0.000104454986,0.0015989768,0.003595484],"genre_scores_gemma":[0.9600273,0.00025386916,0.038007263,0.000083771716,0.00002437224,0.00004183055,0.000047639594,0.000021315418,0.001492654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.00010254817,0.000028878843,0.00006478855,0.00012794937,0.00010018029],"domain_scores_gemma":[0.9984883,0.0004390014,0.00019947007,0.00028857184,0.000494933,0.000089726105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060388516,0.00050752965,0.00069842703,0.0005620428,0.00090568425,0.0008624882,0.0016106924,0.0007012155,0.0013756349],"category_scores_gemma":[0.0023919311,0.00015387901,0.00023137471,0.00067834754,0.0006384614,0.0013747338,0.0009978713,0.00054441404,0.00027473402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011099812,0.00018991332,0.0027110565,0.00030412961,0.000105990766,0.0008702585,0.0005064126,0.6740475,0.04219955,0.06802203,0.008106134,0.20182699],"study_design_scores_gemma":[0.00001111156,0.00007369941,0.00013405152,0.000011400628,0.000013094989,0.00013011815,0.000033354823,0.9902626,0.0044458066,0.003694931,0.0011686011,0.000021131853],"about_ca_topic_score_codex":0.007000702,"about_ca_topic_score_gemma":0.008309532,"teacher_disagreement_score":0.007000702,"about_ca_system_score_codex":0.0016904379,"about_ca_system_score_gemma":0.0010169196,"threshold_uncertainty_score":0.0139199495},"labels":[],"label_agreement":null},{"id":"W2976075487","doi":"10.1109/tnse.2019.2943816","title":"Informative Path Planning for Location Fingerprint Collection","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Greedy algorithm; Fingerprint (computing); Motion planning; Data mining; Constraint (computer-aided design); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Robot","score_opus":0.006846594532282774,"score_gpt":0.20008909247636741,"score_spread":0.19324249794408463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976075487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014076296,0.00017258196,0.98400116,0.000083265506,0.00001438742,0.000047933878,0.00008334511,0.0004025174,0.0011184228],"genre_scores_gemma":[0.55223966,0.00034318873,0.4445756,0.00008162209,0.000025405549,0.0002245611,0.00042436618,0.00013009147,0.0019555434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.0002429443,0.000024936973,0.00017665778,0.00015208853,0.000102752914],"domain_scores_gemma":[0.9986234,0.0008428146,0.00015886358,0.0001675858,0.0001338101,0.00007362445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007832193,0.0010262658,0.0008004546,0.0009239682,0.00058881077,0.0005657937,0.0011075895,0.00078840303,0.0019263587],"category_scores_gemma":[0.003283323,0.0004262099,0.000548703,0.0014723318,0.0007461395,0.0011805254,0.0010872517,0.0010152651,0.00035284305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090610345,0.00007904004,0.0008341352,0.00008522564,0.00002602239,0.00008328697,0.00009132118,0.8898585,0.0021984112,0.008797159,0.001527423,0.0963289],"study_design_scores_gemma":[0.000011495854,0.000051217794,0.00018912427,0.0000074440577,0.000009330415,0.000046399837,0.000031207783,0.9883663,0.0011519911,0.009148567,0.0009771094,0.000009720574],"about_ca_topic_score_codex":0.00523303,"about_ca_topic_score_gemma":0.0064423345,"teacher_disagreement_score":0.00523303,"about_ca_system_score_codex":0.00080879463,"about_ca_system_score_gemma":0.0014643185,"threshold_uncertainty_score":0.010405123},"labels":[],"label_agreement":null},{"id":"W3000275637","doi":"10.1109/tnse.2020.2966504","title":"Data Collection Versus Data Estimation: A Fundamental Trade-Off in Dynamic Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Mathematical optimization; Markov decision process; Data collection; Convergence (economics); Data quality; Markov process; Mathematics; Statistics","score_opus":0.03471512441312536,"score_gpt":0.255216889700903,"score_spread":0.22050176528777765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000275637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015541979,0.0017749903,0.9761825,0.0036835712,0.00007147858,0.0000877702,0.00006929421,0.00012100336,0.0024674048],"genre_scores_gemma":[0.76089936,0.0029823226,0.23229162,0.00084887154,0.00037279582,0.00040798343,0.0001808626,0.00014753848,0.0018686727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866579,0.0071161855,0.0008646404,0.0025573873,0.0021961208,0.0006077066],"domain_scores_gemma":[0.89187557,0.09570216,0.0038144914,0.005321235,0.0020539553,0.0012324918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020577403,0.0012486249,0.0022374592,0.0013023361,0.0014613604,0.005194183,0.0037604033,0.00386079,0.0017134021],"category_scores_gemma":[0.0819521,0.0013729701,0.00074364303,0.0024519803,0.0044617606,0.0151335765,0.005042782,0.0042962637,0.0003260784],"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.0004926923,0.00014804018,0.0031074593,0.00054255733,0.00017193725,0.00043890474,0.0008688624,0.4365985,0.0031244701,0.40379423,0.0017168026,0.14899547],"study_design_scores_gemma":[0.000043682263,0.0001584908,0.00066684495,0.00011293336,0.000040824827,0.00024313084,0.00021518557,0.6813519,0.0015413087,0.31316262,0.0024003226,0.00006271324],"about_ca_topic_score_codex":0.0020177297,"about_ca_topic_score_gemma":0.0017786938,"teacher_disagreement_score":0.020577403,"about_ca_system_score_codex":0.0025909534,"about_ca_system_score_gemma":0.0027655053,"threshold_uncertainty_score":0.10882503},"labels":[],"label_agreement":null},{"id":"W3007170127","doi":"10.1109/tnse.2020.2974739","title":"Impact of Node Churn in the Bitcoin Network","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Churning; Node (physics); Computer science; Computer network; Synchronization (alternating current); Markov process; Markov chain; Block (permutation group theory); Distributed computing; Real-time computing; Channel (broadcasting); Engineering","score_opus":0.01123995421984287,"score_gpt":0.22304997067837606,"score_spread":0.2118100164585332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007170127","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.98905355,0.00029095274,0.0085870195,0.00016630495,0.000014218815,0.000026808792,0.000074207484,0.000096138916,0.0016907015],"genre_scores_gemma":[0.9990778,0.0000881165,0.0006011142,0.000011570546,0.0000026007488,0.000006210526,0.000030957417,0.000010261518,0.0001714396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849606,0.0005899933,0.0000558657,0.00013358789,0.00037327953,0.00035120687],"domain_scores_gemma":[0.9801192,0.014980121,0.0021722165,0.0008270121,0.0012899508,0.000611627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002286278,0.00041070874,0.0004575841,0.00085757585,0.00065248343,0.0009939938,0.00047341638,0.00053558167,0.0010118348],"category_scores_gemma":[0.014090642,0.00022046779,0.00024002808,0.00073759793,0.0010682711,0.0022660552,0.0008417383,0.000783322,0.00010676319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069670833,0.00017241608,0.049222868,0.00011607404,0.00007241871,0.0005341031,0.00025462717,0.91569424,0.013149784,0.0066264817,0.00045063187,0.013009661],"study_design_scores_gemma":[0.000018437546,0.000427862,0.014690662,0.000027233986,0.000044780958,0.00031901745,0.0002779873,0.9717041,0.009018202,0.003059971,0.00038604173,0.000025686228],"about_ca_topic_score_codex":0.005657193,"about_ca_topic_score_gemma":0.004238853,"teacher_disagreement_score":0.005657193,"about_ca_system_score_codex":0.0013691136,"about_ca_system_score_gemma":0.0005780284,"threshold_uncertainty_score":0.01209116},"labels":[],"label_agreement":null},{"id":"W3010301175","doi":"10.1109/tnse.2020.2978856","title":"Deep Reinforcement Learning Based Resource Management for Multi-Access Edge Computing in Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":213,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Resource allocation; Quality of service; Exploit; Resource management (computing); Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Vehicular ad hoc network; Edge device; Computer network; Artificial intelligence; Wireless","score_opus":0.016956029941592118,"score_gpt":0.2267990846195311,"score_spread":0.20984305467793898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010301175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07113812,0.00092700444,0.9236187,0.00049039774,0.000077000805,0.000034342174,0.000029366462,0.00019272475,0.0034923062],"genre_scores_gemma":[0.9814169,0.0001816319,0.016744545,0.00007353584,0.000018091023,0.000022818369,0.00002024339,0.000012814896,0.001509339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997147,0.00007102476,0.000009954157,0.000058863407,0.00005058437,0.000094898525],"domain_scores_gemma":[0.9996032,0.00021513649,0.00004693524,0.00002088208,0.00007301447,0.000040839142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056956033,0.0005517351,0.0006414653,0.00021292186,0.00030052266,0.0006384091,0.0009007491,0.0005823761,0.0009667391],"category_scores_gemma":[0.0012210511,0.00023330061,0.00023770779,0.00027656893,0.00065360777,0.00081911293,0.00070864585,0.0009317088,0.00010085432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003171793,0.000030704217,0.00042712147,0.000022465054,0.000013632153,0.000039045393,0.000019924359,0.9790238,0.0010761688,0.005168528,0.0003755903,0.013771376],"study_design_scores_gemma":[0.0000011774084,0.0000059984322,0.00002372519,7.1925507e-7,0.0000011586228,0.0000022456293,0.0000025911056,0.99905473,0.00009859576,0.00075494155,0.000053290478,7.862853e-7],"about_ca_topic_score_codex":0.0079197725,"about_ca_topic_score_gemma":0.0073599666,"teacher_disagreement_score":0.0079197725,"about_ca_system_score_codex":0.0010800703,"about_ca_system_score_gemma":0.0010345401,"threshold_uncertainty_score":0.015747309},"labels":[],"label_agreement":null},{"id":"W3012496643","doi":"10.1109/tnse.2020.2981449","title":"Minimizing Financial Cost of DDoS Attack Defense in Clouds With Fine-Grained Resource Management","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Shenzhen Fundamental Research Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Denial-of-service attack; Computer science; Cloud computing; Computer security; Application layer DDoS attack; Resource (disambiguation); Popularity; Competition (biology); Computer network; The Internet","score_opus":0.013864758102319668,"score_gpt":0.20253527631564225,"score_spread":0.1886705182133226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012496643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45805722,0.006012782,0.5141015,0.0024732105,0.00037514683,0.0005805264,0.00027084135,0.0017432884,0.016385451],"genre_scores_gemma":[0.98397344,0.00025187095,0.015194016,0.000060091166,0.000020469846,0.000031631775,0.000024997797,0.00001404558,0.00042931773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998869,0.00022417822,0.000055220247,0.00016710508,0.00027897145,0.0004054306],"domain_scores_gemma":[0.9983668,0.0005194577,0.00034607027,0.00025897485,0.00024313731,0.0002655773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015037432,0.0009887989,0.001083014,0.0010525173,0.001364631,0.0020285288,0.0018384465,0.0008674515,0.001513143],"category_scores_gemma":[0.0028441902,0.00029546797,0.00043739323,0.0009352495,0.000701158,0.0031309668,0.0017276026,0.00076455827,0.00021995505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008847448,0.00051660533,0.007829977,0.0003766769,0.00009445516,0.00040872456,0.00015793467,0.6721545,0.02725913,0.039987523,0.0055761514,0.24475355],"study_design_scores_gemma":[0.000030719326,0.00016900721,0.0013485851,0.000014745802,0.00004210193,0.00016749892,0.00013018494,0.98466706,0.0049317298,0.006831968,0.001640125,0.000026188969],"about_ca_topic_score_codex":0.004736841,"about_ca_topic_score_gemma":0.004491865,"teacher_disagreement_score":0.004736841,"about_ca_system_score_codex":0.0023747764,"about_ca_system_score_gemma":0.0028731893,"threshold_uncertainty_score":0.017230332},"labels":[],"label_agreement":null},{"id":"W3037958117","doi":"10.1109/tnse.2020.3004312","title":"AESMOTE: Adversarial Reinforcement Learning With SMOTE for Anomaly Detection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":135,"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; Reinforcement learning; Intrusion detection system; Anomaly detection; Exploit; Artificial intelligence; Machine learning; Adversarial system; Class (philosophy); Data mining; Computer security","score_opus":0.009213995596423915,"score_gpt":0.18755873854833655,"score_spread":0.17834474295191263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037958117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03855643,0.00041627124,0.956692,0.0003647114,0.000116806004,0.00011166091,0.00007966436,0.0015922785,0.0020701417],"genre_scores_gemma":[0.8575423,0.00018065343,0.13773522,0.00048781867,0.00009824645,0.0002912943,0.00028514193,0.000120004646,0.0032594323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00021220424,0.000027988115,0.00010301345,0.00011534638,0.000077500845],"domain_scores_gemma":[0.9977501,0.0015170128,0.00017100912,0.00012532288,0.00033974892,0.0000968264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018487102,0.0010480124,0.0012311994,0.0005252002,0.0003452325,0.00062005344,0.001680705,0.001145018,0.0013808248],"category_scores_gemma":[0.0045769024,0.00043642675,0.00071866333,0.00030630585,0.00079367845,0.00073363894,0.001321661,0.001936891,0.00033396005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007712099,0.000075774304,0.0009917658,0.000035022764,0.000059659305,0.000028362243,0.000015487078,0.97153544,0.00066692295,0.0014325931,0.00069565885,0.024386182],"study_design_scores_gemma":[0.000004118012,0.000019094248,0.000036777757,0.000001757,0.0000023800087,0.0000031696925,0.0000010235372,0.99936014,0.00012716716,0.00036553256,0.000077512974,0.0000013177682],"about_ca_topic_score_codex":0.0046218187,"about_ca_topic_score_gemma":0.0050843093,"teacher_disagreement_score":0.0046218187,"about_ca_system_score_codex":0.0006350708,"about_ca_system_score_gemma":0.0012746522,"threshold_uncertainty_score":0.009777069},"labels":[],"label_agreement":null},{"id":"W3046373281","doi":"10.1109/tnse.2020.3013064","title":"Toward Efficient Data Trading in AI Enabled Reconfigurable Wireless Sensor Network Using Contract and Game Theories","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Zhejiang University; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Raw data; Nash equilibrium; Incentive; Wireless sensor network; Data collection; Control reconfiguration; Operator (biology); Wireless network; Game theory; Wireless; Distributed computing; Computer network; Mathematical optimization; Embedded system; Telecommunications","score_opus":0.028207885017472487,"score_gpt":0.23135098312679844,"score_spread":0.20314309810932596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046373281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02047424,0.00020768563,0.9739008,0.0003248903,0.000031529697,0.00008461846,0.000037215174,0.000057029618,0.004881907],"genre_scores_gemma":[0.8333895,0.000562233,0.16078071,0.00014497287,0.00005512161,0.0002892503,0.00006393841,0.000050265055,0.004663945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987124,0.0005457255,0.0000558978,0.0001845362,0.0003053545,0.00019597483],"domain_scores_gemma":[0.9978917,0.0013623751,0.00025019157,0.00012724359,0.00021350852,0.00015501585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002235732,0.0008767103,0.0011627056,0.0006184337,0.0008068929,0.0019571623,0.0015966372,0.0011933526,0.0018703252],"category_scores_gemma":[0.0039181514,0.00051866745,0.0008959583,0.0010892054,0.0017587042,0.002436801,0.0019976373,0.0018217849,0.00020003959],"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.00008456811,0.00007508463,0.0005352097,0.000095383366,0.000038970637,0.0001706102,0.0001104771,0.80496013,0.0029797757,0.17305383,0.0009840868,0.01691186],"study_design_scores_gemma":[0.000006251522,0.000016757549,0.000035434212,0.0000035383437,0.000002902579,0.000014777967,0.000014032174,0.9809945,0.00020400704,0.01840911,0.00029382424,0.0000048683182],"about_ca_topic_score_codex":0.0033479931,"about_ca_topic_score_gemma":0.0026428895,"teacher_disagreement_score":0.0033479931,"about_ca_system_score_codex":0.0016813579,"about_ca_system_score_gemma":0.0022956673,"threshold_uncertainty_score":0.012199163},"labels":[],"label_agreement":null},{"id":"W3048295601","doi":"10.1109/tnse.2020.3014385","title":"Learning in the Air: Secure Federated Learning for UAV-Assisted Crowdsensing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":305,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Federated learning; Crowdsensing; Differential privacy; Reinforcement learning; Data sharing; Information privacy; Artificial intelligence; Vulnerability (computing); Computer security; Distributed computing; Machine learning; Data mining","score_opus":0.023622329326258167,"score_gpt":0.23522581122288852,"score_spread":0.21160348189663036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048295601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04060836,0.00022156592,0.9562808,0.0002801128,0.000058557143,0.00007978557,0.00005398664,0.0005923539,0.0018244359],"genre_scores_gemma":[0.9665982,0.00009175363,0.03201533,0.00009171907,0.000017452248,0.000062975574,0.000049043418,0.000016783713,0.0010568717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985998,0.00034424968,0.00007935189,0.0003325483,0.00040468865,0.00023922193],"domain_scores_gemma":[0.9976063,0.0008770218,0.00031194894,0.00068316015,0.00035420762,0.00016742837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018795184,0.00059067184,0.0008906276,0.00037948458,0.0010015058,0.0010172093,0.0016117448,0.0010831765,0.0012287351],"category_scores_gemma":[0.0038713764,0.00022434963,0.000557859,0.0005009297,0.0012407936,0.0020179055,0.003020668,0.0012961081,0.00023992511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042595158,0.00015733688,0.0016750781,0.0001025683,0.0000562244,0.00036267153,0.00028730734,0.86686254,0.007486909,0.031979967,0.0016262687,0.08897717],"study_design_scores_gemma":[0.000014076493,0.000034670116,0.00008113552,0.000004705121,0.000004441179,0.000029887282,0.000015682152,0.9881556,0.0012572533,0.009871109,0.0005253169,0.0000060872185],"about_ca_topic_score_codex":0.0037924536,"about_ca_topic_score_gemma":0.0032577578,"teacher_disagreement_score":0.0037924536,"about_ca_system_score_codex":0.0009467631,"about_ca_system_score_gemma":0.0018608989,"threshold_uncertainty_score":0.009939909},"labels":[],"label_agreement":null},{"id":"W3056202775","doi":"10.1109/tnse.2020.3017389","title":"Transaction Throughput Provisioning Technique for Blockchain-Based Industrial IoT Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Computer science; Transaction processing; Database transaction; Cryptocurrency; Throughput; Distributed transaction; Provisioning; Transaction processing system; Computer network; Distributed computing; Computer security; Database; Telecommunications","score_opus":0.018734682442018733,"score_gpt":0.22069272554295116,"score_spread":0.20195804310093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3056202775","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.11189786,0.00037928077,0.88142174,0.00027402773,0.000067174195,0.00018087147,0.00006909811,0.00078257895,0.0049272897],"genre_scores_gemma":[0.94315434,0.00015424307,0.05479956,0.000029711699,0.000022375483,0.000054398388,0.00005511263,0.000018899094,0.0017113818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.00015032658,0.000056842295,0.00013218056,0.00028052687,0.00011447416],"domain_scores_gemma":[0.9988158,0.00041765065,0.00016301773,0.000225871,0.0002865094,0.00009120063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094454346,0.00031000405,0.00048168207,0.00062532315,0.0010169244,0.0009132635,0.0009046096,0.00041951053,0.0022426697],"category_scores_gemma":[0.0026742865,0.00018366861,0.00021392998,0.00078350934,0.00045254742,0.0017994129,0.0009417506,0.00052873936,0.00029825006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001075092,0.00029038184,0.005132901,0.00022105068,0.00007310986,0.00086528086,0.0005935271,0.47285742,0.06352441,0.056684755,0.0046509723,0.39403117],"study_design_scores_gemma":[0.000021166234,0.00009746594,0.00032533635,0.0000076153983,0.000014654698,0.0001626602,0.000041807674,0.9824492,0.008898299,0.0063725873,0.0015982118,0.000011044722],"about_ca_topic_score_codex":0.0015635549,"about_ca_topic_score_gemma":0.0017548166,"teacher_disagreement_score":0.0022426697,"about_ca_system_score_codex":0.0007873429,"about_ca_system_score_gemma":0.0011414228,"threshold_uncertainty_score":0.007502556},"labels":[],"label_agreement":null},{"id":"W3084688615","doi":"10.1109/tnse.2020.3022869","title":"FAST-ODT: A Lightweight Outlier Detection Scheme for Categorical Data Sets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Categorical variable; Anomaly detection; Computer science; Outlier; Data mining; Data set; Tree (set theory); Pattern recognition (psychology); Artificial intelligence; Intrusion detection system; Local outlier factor; Machine learning; Mathematics","score_opus":0.029524753623604766,"score_gpt":0.24527070003992052,"score_spread":0.21574594641631575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084688615","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.016837073,0.00027582305,0.9772816,0.0002016814,0.000097702046,0.00018366925,0.0007158789,0.004001998,0.00040459237],"genre_scores_gemma":[0.34929627,0.00035823483,0.6436521,0.00029260505,0.00016638284,0.00046819553,0.00376472,0.0002804787,0.0017209946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505794,0.00056922255,0.0006981041,0.00080929266,0.0025112063,0.00035430412],"domain_scores_gemma":[0.99055964,0.0025361816,0.0014944931,0.0022578626,0.002733622,0.00041814387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037781352,0.0011238465,0.002012877,0.004490767,0.0013267872,0.0019478338,0.0030500684,0.0013020304,0.0013466836],"category_scores_gemma":[0.016864097,0.0003691595,0.0014873325,0.00469326,0.0010085073,0.0040960507,0.0034849457,0.002032684,0.0009904192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013635854,0.00036758496,0.022218578,0.00039907973,0.00030080063,0.00065854687,0.00060033926,0.09127229,0.030105423,0.02057654,0.011773346,0.820364],"study_design_scores_gemma":[0.000087926885,0.0003131805,0.0038654637,0.000038395418,0.00006273815,0.0007266327,0.00014119073,0.942124,0.017675247,0.02578995,0.009052397,0.00012286931],"about_ca_topic_score_codex":0.0030723596,"about_ca_topic_score_gemma":0.0028840015,"teacher_disagreement_score":0.004490767,"about_ca_system_score_codex":0.0013342617,"about_ca_system_score_gemma":0.0020617915,"threshold_uncertainty_score":0.019980907},"labels":[],"label_agreement":null},{"id":"W3088246894","doi":"10.1109/tnse.2020.3026637","title":"COVID-19 Networking Demand: An Auction-Based Mechanism for Automated Selection of Edge Computing Services","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Service provider; Cloud computing; Edge computing; Quality of service; Software deployment; Robustness (evolution); Computer security; Enhanced Data Rates for GSM Evolution; Computer network; Service (business); Business; Telecommunications","score_opus":0.013805257993598153,"score_gpt":0.2408957815937302,"score_spread":0.22709052360013204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088246894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04050089,0.00018602019,0.9488244,0.0005997457,0.00013026963,0.00073073496,0.00021670596,0.001255825,0.0075554047],"genre_scores_gemma":[0.8389331,0.00012736206,0.15512338,0.00015203257,0.00007979482,0.0003206644,0.00022183501,0.000105283376,0.004936557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952754,0.0020592993,0.00032359513,0.0005547315,0.0012739389,0.0005131636],"domain_scores_gemma":[0.9922253,0.0036690666,0.0008717777,0.0012774506,0.0011548743,0.00080148305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008583525,0.0007782317,0.0013933099,0.001117509,0.0013095944,0.0028722973,0.0047357553,0.0018443019,0.005787008],"category_scores_gemma":[0.012206528,0.00063856336,0.000892938,0.0012769403,0.0011858327,0.0042966083,0.0030448763,0.0019237751,0.0009642279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028747625,0.0016595917,0.0062003266,0.00042949858,0.0003884147,0.0011916383,0.000768172,0.46066773,0.018385991,0.2677481,0.01951743,0.22016847],"study_design_scores_gemma":[0.00014976424,0.00016153089,0.0002245971,0.000010581523,0.000018845803,0.00013617125,0.000037834456,0.9705067,0.0019478761,0.022993397,0.0037745675,0.00003812487],"about_ca_topic_score_codex":0.0021802327,"about_ca_topic_score_gemma":0.0019424721,"teacher_disagreement_score":0.008583525,"about_ca_system_score_codex":0.001845028,"about_ca_system_score_gemma":0.0023722628,"threshold_uncertainty_score":0.0453946},"labels":[],"label_agreement":null},{"id":"W3091288926","doi":"10.1109/tnse.2020.3027796","title":"Blockchain-Based Smart Advertising Network With Privacy-Preserving Accountability","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Argument (complex analysis); World Wide Web; Computer security","score_opus":0.010024441408319724,"score_gpt":0.20512874316594257,"score_spread":0.19510430175762283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091288926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1081554,0.0003594347,0.8578789,0.0021574968,0.00017365527,0.00056391675,0.0005241488,0.002889533,0.027297575],"genre_scores_gemma":[0.9016304,0.00025926778,0.07941593,0.00024261553,0.00006075363,0.00033652282,0.00046566836,0.0001340364,0.017454896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680305,0.0010515808,0.00022205808,0.00065229286,0.00086548453,0.00040562262],"domain_scores_gemma":[0.9947631,0.002128372,0.00051862077,0.0014015774,0.0007346889,0.00045377712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023957745,0.0005118162,0.00077574095,0.00064890337,0.0016585862,0.0022016608,0.001572784,0.0016029082,0.007680688],"category_scores_gemma":[0.0062254774,0.00042082625,0.0004919108,0.0011612097,0.0018062509,0.0055564316,0.00325873,0.0014629456,0.0020711578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019679908,0.00045409278,0.003035811,0.00033388636,0.00007492763,0.0010944017,0.0012796693,0.31138146,0.021766592,0.4937362,0.0115512125,0.15332365],"study_design_scores_gemma":[0.00017355473,0.00011754426,0.00022057189,0.000026358182,0.000031578158,0.00016984018,0.0000830188,0.83865905,0.009147941,0.13284177,0.01848547,0.00004335501],"about_ca_topic_score_codex":0.0035131858,"about_ca_topic_score_gemma":0.0033470448,"teacher_disagreement_score":0.007680688,"about_ca_system_score_codex":0.0014578203,"about_ca_system_score_gemma":0.0033317935,"threshold_uncertainty_score":0.02569443},"labels":[],"label_agreement":null},{"id":"W3093556640","doi":"10.1109/tnse.2020.3032415","title":"Deep Learning-Enabled Threat Intelligence Scheme in the Internet of Things Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Internet of Things; Computer science; Scheme (mathematics); Computer security; Identification (biology); Deep learning; Artificial intelligence; Extractor; Constant false alarm rate; The Internet; Engineering; World Wide Web","score_opus":0.011742546499975314,"score_gpt":0.20272399418746645,"score_spread":0.19098144768749115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093556640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16824053,0.0011970515,0.81940824,0.0010721697,0.00022024948,0.00024409313,0.00061463023,0.002693569,0.0063095377],"genre_scores_gemma":[0.860493,0.0004431193,0.13430317,0.00040058405,0.0000482963,0.00011104935,0.0009804721,0.000033158823,0.0031871444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941945,0.0000943463,0.000049883518,0.00011869416,0.00020718818,0.000110431676],"domain_scores_gemma":[0.9995722,0.000100696605,0.00006809881,0.00009093572,0.00012924128,0.00003881715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080414687,0.0007053384,0.00055218046,0.00097160257,0.00039015786,0.0005711608,0.0008878113,0.00072547677,0.00064850796],"category_scores_gemma":[0.0017566151,0.00021144116,0.0005843833,0.0009468691,0.00043003596,0.0016771915,0.0012768892,0.0011144154,0.00025977276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050611835,0.00042330785,0.0090899225,0.0002160365,0.00020229322,0.00052460964,0.00016098395,0.27380058,0.022789575,0.014344139,0.008628577,0.66931385],"study_design_scores_gemma":[0.000011379043,0.00008532281,0.0013286954,0.000010672427,0.000026781654,0.00011991605,0.000026141954,0.98144275,0.008100389,0.007243322,0.0015905974,0.000014128277],"about_ca_topic_score_codex":0.0028647901,"about_ca_topic_score_gemma":0.003545688,"teacher_disagreement_score":0.0028647901,"about_ca_system_score_codex":0.00072208623,"about_ca_system_score_gemma":0.00077339483,"threshold_uncertainty_score":0.0056961775},"labels":[],"label_agreement":null},{"id":"W3097637184","doi":"10.1109/tnse.2020.3035964","title":"A Graph-Theoretic Equilibrium Analysis of Attacker-Defender Game on Consensus Dynamics Under $\\mathcal {H}_2$ Performance Metric","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Notation; Network topology; Norm (philosophy); Metric (unit); Discrete mathematics; Game theory; Graph; Computer science; Theoretical computer science; Graph theory; Mathematics; Combinatorics; Mathematical economics; Computer network; Engineering; Arithmetic","score_opus":0.017663726207209733,"score_gpt":0.21923280397010578,"score_spread":0.20156907776289604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097637184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07250437,0.00032401617,0.9148672,0.0009372608,0.00005800803,0.00009777963,0.000111595444,0.00016896657,0.010930725],"genre_scores_gemma":[0.96729827,0.0004030874,0.027475763,0.00014052216,0.000049523438,0.00017221995,0.000075289005,0.00005803022,0.0043273885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984596,0.00066130375,0.00005227027,0.00034749098,0.00023081097,0.00024853466],"domain_scores_gemma":[0.99581605,0.0024114114,0.00070677284,0.00018069803,0.00054360885,0.00034151023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244687,0.0015594497,0.0013027727,0.0012186563,0.0008410604,0.0017680529,0.0015097779,0.0019279153,0.0037893273],"category_scores_gemma":[0.0078078797,0.0003812683,0.0008407548,0.00057097623,0.002250425,0.0031780663,0.0018402262,0.0016073441,0.00034126773],"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.00011306981,0.0000491859,0.0006396373,0.00014026224,0.00007359382,0.0002208614,0.0001953781,0.7267515,0.0037306692,0.2608163,0.0012227248,0.0060467278],"study_design_scores_gemma":[0.000011595977,0.000045134337,0.00012535951,0.000009709189,0.000010356186,0.00002692525,0.00003901684,0.95856804,0.0003363343,0.04055774,0.00025607191,0.000013724913],"about_ca_topic_score_codex":0.003555285,"about_ca_topic_score_gemma":0.0017380203,"teacher_disagreement_score":0.0037893273,"about_ca_system_score_codex":0.0022645579,"about_ca_system_score_gemma":0.0018037998,"threshold_uncertainty_score":0.016430616},"labels":[],"label_agreement":null},{"id":"W3112674834","doi":"10.1109/tnse.2020.3045263","title":"Global Visual and Semantic Observations for Outdoor Robot Localization","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer vision; Computer science; Simultaneous localization and mapping; Robot; Gaussian process; Orb (optics); Landmark; Process (computing); Gaussian; Mobile robot; Image (mathematics)","score_opus":0.0200176156381834,"score_gpt":0.2208409600972479,"score_spread":0.2008233444590645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112674834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043282025,0.00024052484,0.9929859,0.0000646587,0.000038697133,0.000012620051,0.00014740544,0.0012007385,0.0009812884],"genre_scores_gemma":[0.556685,0.0008437661,0.4361738,0.00025700865,0.00016864637,0.00009881963,0.001538999,0.00043062976,0.0038034255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993285,0.000110457644,0.000028502156,0.00021987982,0.00023335518,0.00007938163],"domain_scores_gemma":[0.9993229,0.00014530882,0.00010608902,0.00020314411,0.00018971194,0.000032847984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272664,0.00090191886,0.0008675969,0.0010475587,0.00040682917,0.0009039268,0.0009175617,0.00084569136,0.0021109933],"category_scores_gemma":[0.0024272776,0.00040645374,0.0007068106,0.0016075347,0.00081304694,0.0023198018,0.0014070603,0.0011761166,0.0012866075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003818116,0.0000979123,0.0055717337,0.0004039497,0.0001661543,0.00023464608,0.0003472749,0.17054465,0.03680025,0.036338758,0.009177812,0.739935],"study_design_scores_gemma":[0.000035682944,0.00012877105,0.0049778083,0.000058209906,0.000088130866,0.0002686949,0.00014704686,0.9151986,0.017998008,0.042267174,0.018764453,0.00006743901],"about_ca_topic_score_codex":0.00789777,"about_ca_topic_score_gemma":0.01225138,"teacher_disagreement_score":0.00789777,"about_ca_system_score_codex":0.00051346194,"about_ca_system_score_gemma":0.0009867314,"threshold_uncertainty_score":0.015703559},"labels":[],"label_agreement":null},{"id":"W3115157362","doi":"10.1109/tnse.2020.3047232","title":"Distributed Prescribed-Time Interval Bipartite Consensus of Multi-Agent Systems on Directed Graphs: Theory and Experiment","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Qatar National Research Fund; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Bipartite graph; Multi-agent system; Spanning tree; Laplacian matrix; Interval (graph theory); Protocol (science); Computer science; Consensus; Directed graph; Strongly connected component; Mathematics; Mathematical optimization; Topology (electrical circuits); Theoretical computer science; Discrete mathematics; Algorithm; Combinatorics; Graph; Artificial intelligence","score_opus":0.01787272224156212,"score_gpt":0.22009656368736633,"score_spread":0.20222384144580421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115157362","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.61051977,0.00020256067,0.37900406,0.00029369013,0.00010500314,0.00016457705,0.0000820724,0.00049729017,0.0091309175],"genre_scores_gemma":[0.97958827,0.000048064063,0.019760866,0.000021966564,0.0000031521195,0.00006288285,0.000028817887,0.0000085355305,0.0004775217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934965,0.00022610124,0.000024139,0.00011113041,0.00022319106,0.000065740634],"domain_scores_gemma":[0.9981065,0.0010219321,0.00017555374,0.0003320722,0.00026164867,0.00010240721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623281,0.00026008798,0.00031292712,0.00030453547,0.00032316742,0.00039577903,0.0007020292,0.00049793534,0.00088514347],"category_scores_gemma":[0.0025591175,0.000112255286,0.00023686481,0.00028395833,0.00077172846,0.00082530786,0.0006942506,0.0004971924,0.00009593925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005575334,0.00058814354,0.002993404,0.00027051906,0.0000673006,0.00029311614,0.00038910485,0.7660667,0.10703318,0.07469615,0.0010430315,0.04600184],"study_design_scores_gemma":[0.00004762486,0.00033254773,0.00043968385,0.000005394039,0.000008468164,0.00003958778,0.00008427724,0.9699365,0.017905623,0.010598125,0.00058697216,0.000015225739],"about_ca_topic_score_codex":0.0010138835,"about_ca_topic_score_gemma":0.00047639484,"teacher_disagreement_score":0.0011623281,"about_ca_system_score_codex":0.0005216502,"about_ca_system_score_gemma":0.00051305315,"threshold_uncertainty_score":0.0061470866},"labels":[],"label_agreement":null},{"id":"W3118420191","doi":"10.1109/tnse.2021.3050034","title":"The Impact of Selfish Mining on Bitcoin Network Performance","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block (permutation group theory); Node (physics); Hash function; Computer network; Revenue; Network security; Computer security; Economics; Engineering; Mathematics","score_opus":0.007139335113003661,"score_gpt":0.21216965326307125,"score_spread":0.2050303181500676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118420191","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.9873148,0.00026233526,0.009202394,0.00032725613,0.00001994802,0.000028062675,0.000074724834,0.00020123727,0.0025692042],"genre_scores_gemma":[0.99919647,0.000040517785,0.0005693529,0.000014411929,0.000003943513,0.0000048659494,0.000026692678,0.000010339462,0.00013345908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957743,0.0012582141,0.00023856008,0.0005056785,0.0012715725,0.0009516403],"domain_scores_gemma":[0.9520548,0.030474069,0.0065750154,0.0050727604,0.0042168633,0.001606439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005814028,0.0005108032,0.0005476893,0.0009900815,0.0008933656,0.0014837777,0.0009285406,0.0007676888,0.0009199642],"category_scores_gemma":[0.029104045,0.00017084803,0.00024330105,0.0008210865,0.0014784716,0.0035220578,0.001309953,0.001270233,0.00017124614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032144503,0.0009615855,0.15100616,0.0003160715,0.0003193188,0.0011835366,0.0008236211,0.6898563,0.052606817,0.020398548,0.0024738908,0.07683966],"study_design_scores_gemma":[0.000040712945,0.0010178487,0.019525662,0.00003836353,0.000060726816,0.00073925714,0.00050520553,0.93681544,0.03240046,0.008137885,0.0006619764,0.000056441044],"about_ca_topic_score_codex":0.0015691544,"about_ca_topic_score_gemma":0.0015945535,"teacher_disagreement_score":0.005814028,"about_ca_system_score_codex":0.0011692541,"about_ca_system_score_gemma":0.0011199942,"threshold_uncertainty_score":0.03074789},"labels":[],"label_agreement":null},{"id":"W3118947506","doi":"10.1109/tnse.2021.3050213","title":"Dynamical Control Domain Division for Software-Defined Satellite-Ground Integrated Vehicular Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Rounding; Heuristic; Computer science; Domain (mathematical analysis); Controller (irrigation); Software; Ground segment; Satellite; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.007033073639941094,"score_gpt":0.20228532265323612,"score_spread":0.19525224901329502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118947506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023403363,0.00039614845,0.97009665,0.0002361809,0.00006944732,0.00011425636,0.000068447625,0.0002989661,0.00531656],"genre_scores_gemma":[0.76342684,0.0004428096,0.23281503,0.00017363077,0.00005285208,0.00024109374,0.00025458043,0.000063909814,0.002529307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990132,0.00029764042,0.000042370073,0.00022878585,0.00023324662,0.00018468792],"domain_scores_gemma":[0.99890184,0.0006613611,0.00012784362,0.00011591308,0.00013265986,0.000060356117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010039605,0.0008640856,0.00067983934,0.00048894045,0.0006046463,0.0012102495,0.001240549,0.00057443726,0.004091196],"category_scores_gemma":[0.0029446322,0.00025898067,0.0005477481,0.00080345053,0.0007912544,0.0011044902,0.0009146033,0.0011648374,0.00030046594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001867569,0.0000966561,0.00048514514,0.00012342748,0.000025755311,0.00007944234,0.000082442464,0.8645668,0.0030228114,0.058502138,0.0030381982,0.0697904],"study_design_scores_gemma":[0.000018317456,0.00004548724,0.000060165305,0.000007892046,0.0000050536946,0.000020282132,0.000020267997,0.98769546,0.00089322054,0.010093874,0.0011342155,0.0000058004243],"about_ca_topic_score_codex":0.004385779,"about_ca_topic_score_gemma":0.0046156696,"teacher_disagreement_score":0.004385779,"about_ca_system_score_codex":0.0015682097,"about_ca_system_score_gemma":0.0018090334,"threshold_uncertainty_score":0.0136864185},"labels":[],"label_agreement":null},{"id":"W3118968349","doi":"10.1109/tnse.2021.3049262","title":"Deep Learning-Embedded Social Internet of Things for Ambiguity-Aware Social Recommendations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Japan Society for the Promotion of Science; National Natural Science Foundation of China","keywords":"Ambiguity; Computer science; Robustness (evolution); Machine learning; Benchmark (surveying); Artificial intelligence; The Internet; Deep learning; World Wide Web","score_opus":0.018236233437646285,"score_gpt":0.2534697726517217,"score_spread":0.23523353921407542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118968349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046333876,0.0013712905,0.94575214,0.0007082082,0.00020488587,0.000111036454,0.00035267833,0.0015035265,0.0036624407],"genre_scores_gemma":[0.72888565,0.0007820513,0.26353875,0.0006130104,0.00014458025,0.00012032348,0.0010721309,0.000088194814,0.0047553065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994299,0.00013633033,0.000035504552,0.00014078204,0.00018500087,0.00007240787],"domain_scores_gemma":[0.9994006,0.00023574516,0.00006715546,0.000118822056,0.000138818,0.00003877549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008476025,0.00086237397,0.00084319455,0.00069274363,0.0004235814,0.000585931,0.0012412026,0.0010032677,0.00089079264],"category_scores_gemma":[0.0024326271,0.00037471612,0.00075844233,0.00095448655,0.00030857802,0.0015420509,0.0009972075,0.0013708592,0.0003660015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019228963,0.0004010394,0.005839749,0.00026771732,0.00033490494,0.00024310611,0.00021876387,0.40216365,0.008270346,0.009238802,0.010953979,0.56187564],"study_design_scores_gemma":[0.000006667383,0.000024089662,0.00037163708,0.000007023018,0.000016000491,0.00003057038,0.000018475963,0.9942036,0.0007861954,0.0036811954,0.0008463795,0.000008113937],"about_ca_topic_score_codex":0.010189765,"about_ca_topic_score_gemma":0.021868112,"teacher_disagreement_score":0.010189765,"about_ca_system_score_codex":0.00059815345,"about_ca_system_score_gemma":0.00073553185,"threshold_uncertainty_score":0.02026093},"labels":[],"label_agreement":null},{"id":"W3127026882","doi":"10.1109/tnse.2021.3070476","title":"Actor-Critic Learning Based QoS-Aware Scheduler for Reconfigurable Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); Acceleware (Canada); University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Control reconfiguration; Computer network; Distributed computing; Wireless; Wireless network; Flexibility (engineering); Latency (audio); Telecommunications; Embedded system","score_opus":0.011791753941475537,"score_gpt":0.21747056186987193,"score_spread":0.2056788079283964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127026882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043124363,0.00072114775,0.9472505,0.0005231769,0.00016579905,0.000057207926,0.000048130234,0.00041587575,0.0076937643],"genre_scores_gemma":[0.9707239,0.00031060493,0.023778921,0.00015203243,0.000059999988,0.00009567045,0.000057061334,0.000036955436,0.0047848346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999689,0.00010652618,0.0000132533705,0.000061750485,0.00006742258,0.000062136525],"domain_scores_gemma":[0.9990048,0.0006180024,0.000119153134,0.000035520465,0.00015468607,0.0000678615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009501459,0.00075487414,0.0008495318,0.00024959614,0.0002728829,0.00080366805,0.0009264797,0.00091462623,0.0016640931],"category_scores_gemma":[0.0019026904,0.0003260787,0.00035947264,0.0002916669,0.0007933707,0.00044634432,0.0005339335,0.001199028,0.00024776923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036358255,0.000016107342,0.00018100227,0.00001748247,0.0000132270025,0.000030685238,0.000011153378,0.99346644,0.00040568938,0.001636276,0.0002786311,0.0039070565],"study_design_scores_gemma":[0.0000032638065,0.000007409156,0.000020534915,0.0000012662354,0.0000016714513,0.0000023115906,0.0000013734227,0.99952114,0.000058432404,0.00031834884,0.00006334018,0.0000010411061],"about_ca_topic_score_codex":0.0061420496,"about_ca_topic_score_gemma":0.003905606,"teacher_disagreement_score":0.0061420496,"about_ca_system_score_codex":0.0009096564,"about_ca_system_score_gemma":0.001080832,"threshold_uncertainty_score":0.0122125745},"labels":[],"label_agreement":null},{"id":"W3128646026","doi":"10.1109/tnse.2021.3056655","title":"FLAS: Computation and Communication Efficient Federated Learning via Adaptive Sampling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Correctness; Federated learning; Overhead (engineering); Usability; Convergence (economics); Computation; Distributed computing; Filter (signal processing); Distributed learning; Adaptive sampling; Statistic; Artificial intelligence; Machine learning; Data mining; Human–computer interaction; Algorithm","score_opus":0.023874051280443655,"score_gpt":0.24522081742662136,"score_spread":0.2213467661461777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128646026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012436281,0.00024047265,0.98345274,0.00022801412,0.000062353545,0.000078186946,0.00007458331,0.002540416,0.00088702125],"genre_scores_gemma":[0.69657433,0.0002232407,0.29839072,0.0005714943,0.000115076335,0.00032574922,0.00048323942,0.00020611333,0.0031100628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777126,0.00075594947,0.00012163149,0.00045816606,0.0006028823,0.00029004595],"domain_scores_gemma":[0.9968317,0.0013149539,0.00021125113,0.0009099269,0.0005247913,0.00020733119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034693698,0.0011854159,0.0018328032,0.0009560676,0.0009866252,0.001565484,0.0036553163,0.0017512152,0.0029074],"category_scores_gemma":[0.00892374,0.0004780083,0.0009032858,0.0012925201,0.0015280137,0.003191574,0.003437503,0.002104267,0.0008797265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008244318,0.00046195695,0.0022595625,0.00015646793,0.0001665324,0.00019649502,0.00017714995,0.6241674,0.0057046814,0.023105873,0.008494553,0.33428496],"study_design_scores_gemma":[0.000022180839,0.00003616096,0.000056961766,0.000004009012,0.00000560989,0.00002327744,0.000010017826,0.9917243,0.00083489803,0.0069153463,0.00036161634,0.000005712646],"about_ca_topic_score_codex":0.0043966006,"about_ca_topic_score_gemma":0.0053305947,"teacher_disagreement_score":0.0043966006,"about_ca_system_score_codex":0.0013187526,"about_ca_system_score_gemma":0.0025294723,"threshold_uncertainty_score":0.018347979},"labels":[],"label_agreement":null},{"id":"W3130972810","doi":"10.1109/tnse.2021.3061537","title":"Delay Optimal Concurrent Transmissions With Raptor Codes in Dual Connectivity Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Raptor code; Network packet; Retransmission; Jitter; User equipment; Computer network; Real-time computing; Algorithm; Decoding methods; Block code; Linear code; Base station; Telecommunications","score_opus":0.01733029739127841,"score_gpt":0.2379729130105195,"score_spread":0.2206426156192411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130972810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123645715,0.0012800028,0.87045926,0.0002928166,0.00008578772,0.00006050426,0.00004855658,0.00029012593,0.0038372718],"genre_scores_gemma":[0.92922693,0.0005356191,0.068949506,0.00007637832,0.000037128768,0.0000749597,0.00002636085,0.000016796534,0.0010564789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.00029788548,0.00003700775,0.00013813541,0.00022823429,0.00013025076],"domain_scores_gemma":[0.99795294,0.0011713434,0.0003461692,0.00017333691,0.00028376398,0.00007238986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008785387,0.0007504652,0.00054295966,0.0006441385,0.00068764435,0.00075635215,0.0009110963,0.0006564357,0.00045601738],"category_scores_gemma":[0.0031436414,0.00043573044,0.00036567976,0.00071830733,0.0010849109,0.001023334,0.0010510485,0.0007460916,0.0001493705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000434129,0.00010428908,0.0010348595,0.00019810097,0.00007312219,0.00070104137,0.0004888435,0.8138908,0.024043426,0.079204164,0.001339592,0.07848769],"study_design_scores_gemma":[0.000021040345,0.000106998734,0.000066811,0.000010369431,0.000017324754,0.0001803567,0.000025968426,0.9887466,0.0031800028,0.006999764,0.0006267258,0.000018061444],"about_ca_topic_score_codex":0.0023982862,"about_ca_topic_score_gemma":0.002208249,"teacher_disagreement_score":0.0023982862,"about_ca_system_score_codex":0.00078001025,"about_ca_system_score_gemma":0.00091785204,"threshold_uncertainty_score":0.005659461},"labels":[],"label_agreement":null},{"id":"W3161646632","doi":"10.1109/tnse.2021.3076795","title":"Cooperative Computation Offloading for Multi-Access Edge Computing in 6G Mobile Networks via Soft Actor Critic","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Computation offloading; Computer science; Mobile edge computing; Cloud computing; Server; Edge computing; Distributed computing; Computer network; Computation; Markov decision process; Latency (audio); Edge device; Mobile cloud computing; Mobile computing; Markov process; Algorithm; Telecommunications","score_opus":0.025537983122623842,"score_gpt":0.28470538893436637,"score_spread":0.2591674058117425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161646632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032441016,0.0004451223,0.9616574,0.00042877963,0.00009719078,0.000042502452,0.000028391176,0.00020989445,0.004649612],"genre_scores_gemma":[0.97993016,0.00022100043,0.017279219,0.00014014497,0.00004284027,0.00006216566,0.000032558728,0.00003177104,0.0022600282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.0001649678,0.000024506318,0.00012681386,0.000116783056,0.000118488264],"domain_scores_gemma":[0.9987398,0.000872144,0.00012917428,0.000042115542,0.00014748736,0.00006923981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774859,0.0009914445,0.0010970242,0.0003138318,0.0004108705,0.001192334,0.00076736,0.00082573306,0.0014801543],"category_scores_gemma":[0.0021662628,0.00038647803,0.00052271213,0.00035966703,0.0011529026,0.0007164075,0.0010372777,0.0013543345,0.00020994454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008435043,0.00002716297,0.00044071022,0.00004343409,0.000028086006,0.00007749021,0.00004528451,0.9837915,0.0011655696,0.0055767824,0.00051926053,0.008200301],"study_design_scores_gemma":[0.0000038878757,0.0000065581976,0.000024922812,0.0000019367571,0.0000024561905,0.0000031678037,0.0000032297285,0.9989189,0.00008761677,0.00088022667,0.000065703956,0.0000014442284],"about_ca_topic_score_codex":0.006029514,"about_ca_topic_score_gemma":0.006048898,"teacher_disagreement_score":0.006029514,"about_ca_system_score_codex":0.00078322715,"about_ca_system_score_gemma":0.0010961969,"threshold_uncertainty_score":0.011988819},"labels":[],"label_agreement":null},{"id":"W3163105316","doi":"10.1109/tnse.2022.3146399","title":"Node Selection Toward Faster Convergence for Federated Learning on Non-IID Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Artificial intelligence; Algorithm; Engineering","score_opus":0.034664096157556876,"score_gpt":0.2534197640990523,"score_spread":0.21875566794149542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163105316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038284086,0.00019635595,0.9590548,0.0003936337,0.000060196788,0.000059969985,0.000056073837,0.0008206676,0.0010742762],"genre_scores_gemma":[0.7513832,0.00016005049,0.24394135,0.00041518846,0.00008348855,0.00024210983,0.00024235704,0.00013190277,0.003400283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827504,0.00060590944,0.00010471883,0.0005053273,0.00028665893,0.00022236965],"domain_scores_gemma":[0.9956364,0.0023841753,0.0003364319,0.00056005956,0.00084056373,0.00024229808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571368,0.0011946645,0.0018368416,0.001069812,0.0009525683,0.0010684101,0.0024755558,0.0015252446,0.0014436082],"category_scores_gemma":[0.011679049,0.000565914,0.00096587965,0.00093854836,0.0013304163,0.002058242,0.0020159215,0.0017324308,0.00041380042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023638742,0.0001030524,0.0014874111,0.000049041773,0.00006258891,0.000079041056,0.00012680415,0.9199949,0.001550039,0.008594743,0.0017492631,0.06596676],"study_design_scores_gemma":[0.000008283334,0.000015359636,0.00004488163,0.000001873397,0.0000028335592,0.0000058378046,0.0000057991233,0.99731845,0.00025668723,0.0022322151,0.00010556458,0.0000021720514],"about_ca_topic_score_codex":0.005623552,"about_ca_topic_score_gemma":0.005948991,"teacher_disagreement_score":0.005623552,"about_ca_system_score_codex":0.0013999689,"about_ca_system_score_gemma":0.0021091988,"threshold_uncertainty_score":0.024175942},"labels":[],"label_agreement":null},{"id":"W3171918319","doi":"10.1109/tnse.2021.3089435","title":"PPSF: A Privacy-Preserving and Secure Framework Using Blockchain-Based Machine-Learning for IoT-Driven Smart Cities","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":355,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Smart city; Cloud computing; Blockchain; Scalability; Information privacy; Computer security; Computer network; Internet of Things; Database","score_opus":0.01276890009020294,"score_gpt":0.2268771330773635,"score_spread":0.21410823298716058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171918319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018884866,0.00017789422,0.9764522,0.0004636727,0.0000512416,0.00018152957,0.00017053711,0.0016882435,0.0019297638],"genre_scores_gemma":[0.79465705,0.00034272356,0.20026985,0.00017761326,0.00006875018,0.0003430962,0.00055342383,0.00011701606,0.0034704322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.0003647791,0.00007774861,0.00020674856,0.00045567108,0.000194294],"domain_scores_gemma":[0.9988549,0.00040113548,0.00011677883,0.00034491,0.00017370566,0.00010857293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961262,0.0004303261,0.0008013479,0.00055085676,0.0010183544,0.0012526392,0.001586243,0.0011870419,0.0027844592],"category_scores_gemma":[0.0031117362,0.00028352495,0.00060422573,0.0007670987,0.0011858123,0.002914569,0.0023856494,0.0011901367,0.0005256287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002690706,0.00021566845,0.0021591336,0.00012464638,0.000058733807,0.0005101701,0.00021540925,0.7356761,0.0055733826,0.10991725,0.00470671,0.14057374],"study_design_scores_gemma":[0.000019574505,0.000024568233,0.00009191504,0.0000048203865,0.0000042494676,0.00003992224,0.0000120029945,0.9704934,0.0010131538,0.026347106,0.0019400055,0.000009314962],"about_ca_topic_score_codex":0.0059597385,"about_ca_topic_score_gemma":0.005477134,"teacher_disagreement_score":0.0059597385,"about_ca_system_score_codex":0.0010809442,"about_ca_system_score_gemma":0.003546527,"threshold_uncertainty_score":0.011850119},"labels":[],"label_agreement":null},{"id":"W3187896966","doi":"10.1109/tnse.2021.3103558","title":"On Selfholding Attack Impact on Imperfect PoW Blockchain Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Imperfect; Proof-of-work system; Computer security; Block (permutation group theory)","score_opus":0.007977942728337874,"score_gpt":0.22991450871265692,"score_spread":0.22193656598431905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187896966","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.7663539,0.0012003027,0.2131598,0.0020726558,0.00010680636,0.00013702967,0.00023874818,0.00027811123,0.016452674],"genre_scores_gemma":[0.9979358,0.00019340744,0.0012690668,0.00003351322,0.0000149056905,0.000010380585,0.000020827336,0.000016723332,0.00050542783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719834,0.0012695859,0.0000930344,0.00029265042,0.0005533323,0.0005929538],"domain_scores_gemma":[0.9742157,0.018532187,0.0038048818,0.0014820182,0.001332261,0.00063291297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003444097,0.0007578748,0.0010038811,0.001038451,0.0008335432,0.0016891903,0.0011712131,0.0010695313,0.0032157796],"category_scores_gemma":[0.021760913,0.000402618,0.0006202024,0.0006393769,0.0024893342,0.0055606277,0.0021168885,0.0017745247,0.00015721485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018748846,0.00008241656,0.0024499733,0.000109655346,0.000048716516,0.00038312425,0.0001173218,0.9208239,0.0032029154,0.06670742,0.00076918077,0.0051177926],"study_design_scores_gemma":[0.000007821656,0.00006120934,0.00042016004,0.000015037004,0.000016899465,0.00006596801,0.00005756692,0.98234624,0.0007648822,0.016090106,0.00014013964,0.000013988388],"about_ca_topic_score_codex":0.0037289718,"about_ca_topic_score_gemma":0.002105055,"teacher_disagreement_score":0.0037289718,"about_ca_system_score_codex":0.0022955386,"about_ca_system_score_gemma":0.0011785406,"threshold_uncertainty_score":0.018214285},"labels":[],"label_agreement":null},{"id":"W3189033711","doi":"10.1109/tnse.2021.3103873","title":"Adaptive $ D$-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; China University of Mining and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Notation; Computer science; Wireless ad hoc network; Graph; Algorithm; Hop (telecommunications); Set (abstract data type); Mathematics; Theoretical computer science; Computer network; Programming language","score_opus":0.006737166744006764,"score_gpt":0.19914415305880123,"score_spread":0.19240698631479447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189033711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040497746,0.0012580222,0.9520902,0.0005649321,0.00015125932,0.00015607479,0.00025194944,0.0002733845,0.0047564227],"genre_scores_gemma":[0.8278998,0.0015608097,0.16423604,0.0003103089,0.0001541785,0.00039500272,0.00050183653,0.00008420479,0.0048578777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989054,0.00045507043,0.00005227008,0.00025595614,0.00022547481,0.00010590512],"domain_scores_gemma":[0.99835867,0.0010392162,0.0001634773,0.00013034766,0.00019520309,0.000113055714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014297428,0.00075519725,0.0009591166,0.000764548,0.00084092416,0.0010148634,0.0021712314,0.00084780203,0.00087310723],"category_scores_gemma":[0.004035631,0.00051240367,0.0005178124,0.0012270304,0.0009277707,0.0013937803,0.0012938904,0.0008498884,0.0002704361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108860586,0.000037471113,0.0005660438,0.0001595303,0.00005565498,0.00022068659,0.0001244279,0.92756945,0.0021445216,0.035959158,0.0024706936,0.030583506],"study_design_scores_gemma":[0.0000130586195,0.00004362985,0.00013649167,0.000009569648,0.0000133630065,0.0000594072,0.000029069844,0.97497296,0.0003763066,0.022830227,0.0015064318,0.0000094920615],"about_ca_topic_score_codex":0.0031941663,"about_ca_topic_score_gemma":0.0028098484,"teacher_disagreement_score":0.0031941663,"about_ca_system_score_codex":0.0011664107,"about_ca_system_score_gemma":0.00075319345,"threshold_uncertainty_score":0.008463025},"labels":[],"label_agreement":null},{"id":"W3193468109","doi":"10.1109/tnse.2021.3104499","title":"Fault-Resilience for Bandwidth Management in Industrial Software-Defined Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Testbed; Software-defined networking; Bandwidth (computing); Computer network; Dynamic bandwidth allocation; Distributed computing; Resilience (materials science); Network management; Software; Operating system","score_opus":0.015508538854030949,"score_gpt":0.21975617233296918,"score_spread":0.20424763347893823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193468109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1447665,0.0025588828,0.84473515,0.0006353307,0.00015115186,0.0001492939,0.000059689737,0.0025748175,0.0043691113],"genre_scores_gemma":[0.94058716,0.00039962653,0.058070935,0.00008344781,0.000034165263,0.000068236586,0.00007454726,0.000051891908,0.0006299014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.00039519634,0.000100787074,0.00018061658,0.0005420382,0.00015463328],"domain_scores_gemma":[0.99871874,0.0004386561,0.00019851058,0.00027292472,0.00029752403,0.00007375967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018216921,0.00048387118,0.0003354219,0.000776758,0.0005474049,0.0010603918,0.0011857186,0.0005072854,0.00066902104],"category_scores_gemma":[0.003109953,0.00016100112,0.00024111393,0.00042301085,0.00071843393,0.0013354911,0.00090434327,0.0006981878,0.0001237993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048288723,0.00027776035,0.0056334147,0.00047967408,0.0001111961,0.00041336493,0.0004802433,0.48011628,0.07577666,0.06314705,0.0034341952,0.36964723],"study_design_scores_gemma":[0.000022104172,0.00014614029,0.001075194,0.00004212454,0.000039062106,0.00015284537,0.00008027048,0.95142484,0.028447552,0.010653943,0.007889874,0.000026027277],"about_ca_topic_score_codex":0.0023807883,"about_ca_topic_score_gemma":0.0014834851,"teacher_disagreement_score":0.0023807883,"about_ca_system_score_codex":0.0010875294,"about_ca_system_score_gemma":0.0010834003,"threshold_uncertainty_score":0.009634197},"labels":[],"label_agreement":null},{"id":"W3194685451","doi":"10.1109/tnse.2023.3255819","title":"Partisan Confidence Model for Group Polarization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Air Force Office of Scientific Research","keywords":"Polarization (electrochemistry); Computer science; Group (periodic table); Physics; Quantum mechanics","score_opus":0.015609007403768744,"score_gpt":0.2500729105123763,"score_spread":0.23446390310860754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194685451","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.5024405,0.0011592335,0.39989564,0.0055255275,0.00025662011,0.00009491939,0.00042517876,0.00017473155,0.090027645],"genre_scores_gemma":[0.99001735,0.00022085708,0.00276079,0.00012659132,0.00009489665,0.00003594253,0.000056292,0.000014488284,0.006672768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992508,0.00026104413,0.000016124888,0.00010373888,0.0001513432,0.00021686192],"domain_scores_gemma":[0.9970415,0.0015929401,0.0003728111,0.00028307957,0.00039731205,0.00031230802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015664673,0.00034196448,0.0006299266,0.00073816086,0.0010375136,0.0015092972,0.0012605577,0.0014025904,0.006264643],"category_scores_gemma":[0.0073007355,0.00020066714,0.00072580454,0.0005226461,0.0012897379,0.0021378277,0.0012205667,0.0015394907,0.0007683391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170688,0.00008552678,0.0033962857,0.000063691834,0.00005164217,0.0003154396,0.00059197855,0.11490271,0.001695612,0.86392057,0.0044939057,0.010360986],"study_design_scores_gemma":[0.000023472467,0.00003550702,0.0012935183,0.000015463806,0.000015974396,0.000110389854,0.00013986629,0.7708477,0.00021165107,0.22552684,0.0017581164,0.000021549717],"about_ca_topic_score_codex":0.002489635,"about_ca_topic_score_gemma":0.0010890445,"teacher_disagreement_score":0.006264643,"about_ca_system_score_codex":0.0008154938,"about_ca_system_score_gemma":0.00039606701,"threshold_uncertainty_score":0.02095735},"labels":[],"label_agreement":null},{"id":"W3203176266","doi":"10.1109/tnse.2022.3232397","title":"Algebraic Connectivity: Local and Global Maximizer Graphs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algebraic connectivity; Conjecture; Bipartite graph; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Algebraic number; Laplacian matrix; Laplace operator; Discrete mathematics; Vertex (graph theory); Algebraic graph theory; Graph theory; Graph","score_opus":0.019640821576302554,"score_gpt":0.254019951444218,"score_spread":0.23437912986791545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203176266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3095462,0.0005126605,0.65725523,0.0011926014,0.000026136571,0.00010530087,0.00031773734,0.00025712242,0.030786984],"genre_scores_gemma":[0.952822,0.00043652556,0.041972913,0.00015951788,0.00009364086,0.0001768184,0.00026058874,0.00012532779,0.0039526126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878484,0.0004122469,0.00003901194,0.00039731924,0.00022344218,0.00014304173],"domain_scores_gemma":[0.99543035,0.0025669578,0.00082428847,0.00038914543,0.00038855485,0.00040084898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014281865,0.0009187208,0.00092059997,0.0012478068,0.00082685344,0.0017338918,0.00085604173,0.0010042756,0.004071207],"category_scores_gemma":[0.00806386,0.00051786273,0.0006977784,0.0009584534,0.0023926925,0.0038231304,0.0018382347,0.0011831513,0.000378917],"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.0000865562,0.00005580526,0.0033211457,0.00017692609,0.000079920734,0.00024319287,0.0004554139,0.101115376,0.008465037,0.8645153,0.0020214692,0.019463986],"study_design_scores_gemma":[0.000029400151,0.00013655407,0.003559431,0.00004708663,0.00006357323,0.0003605143,0.00036957592,0.24228653,0.0046406914,0.7447507,0.0037136632,0.000042238986],"about_ca_topic_score_codex":0.00062085147,"about_ca_topic_score_gemma":0.0008257126,"teacher_disagreement_score":0.004071207,"about_ca_system_score_codex":0.0010034561,"about_ca_system_score_gemma":0.00040547113,"threshold_uncertainty_score":0.013619542},"labels":[],"label_agreement":null},{"id":"W3203858545","doi":"10.1109/tnse.2021.3115054","title":"Deadline-Aware Task Offloading With Partially-Observable Deep Reinforcement Learning for Multi-Access Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Markov decision process; Computation offloading; Partially observable Markov decision process; Mobile edge computing; Mobile device; Distributed computing; Server; Energy consumption; Edge computing; Task (project management); Computation; Enhanced Data Rates for GSM Evolution; Markov process; Real-time computing; Artificial intelligence; Markov chain; Computer network; Markov model; Machine learning; Algorithm","score_opus":0.02970066944453142,"score_gpt":0.25394588690802894,"score_spread":0.22424521746349751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203858545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08937344,0.0007542063,0.9052208,0.00036747265,0.000110104156,0.00007145958,0.00006457282,0.001309298,0.0027286578],"genre_scores_gemma":[0.95595145,0.00013080667,0.042036574,0.00015301602,0.00002608244,0.00007271412,0.000077031815,0.00005316987,0.0014991168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964285,0.00006566491,0.000017583747,0.00008570741,0.000078541685,0.0001096456],"domain_scores_gemma":[0.99937314,0.00030051792,0.00009329226,0.00006291928,0.00008503874,0.00008515397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054207933,0.0007516806,0.0006940333,0.00021157447,0.00030294337,0.00046394274,0.001095343,0.0005861751,0.0011729805],"category_scores_gemma":[0.0018192441,0.00032260592,0.00031211015,0.00022950232,0.0005224932,0.0007599584,0.00088348385,0.0012814068,0.00016887707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021612333,0.0002127684,0.0010899539,0.00009140169,0.000028346047,0.0000934786,0.000071852046,0.9066171,0.0053966315,0.0028570332,0.0015953111,0.08172992],"study_design_scores_gemma":[0.0000065774143,0.000017581706,0.000058392685,0.0000016937785,0.0000017090616,0.000004492372,0.000003222849,0.99856937,0.0003818755,0.0008410026,0.000112283386,0.0000018524656],"about_ca_topic_score_codex":0.005551983,"about_ca_topic_score_gemma":0.0062145037,"teacher_disagreement_score":0.005551983,"about_ca_system_score_codex":0.0006301521,"about_ca_system_score_gemma":0.0015192146,"threshold_uncertainty_score":0.011039376},"labels":[],"label_agreement":null},{"id":"W3207498650","doi":"10.1109/tnse.2021.3119324","title":"Tensor Train-Based Multiple Clusterings for Big Data in Cyber-Physical-Social Systems and Its Efficient Implementations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Big data; Tensor (intrinsic definition); Overhead (engineering); Implementation; Parallel computing; Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.08272881589556075,"score_gpt":0.3230384472093226,"score_spread":0.24030963131376187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207498650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037667323,0.00021336866,0.99416625,0.00020640345,0.000057063593,0.000038402057,0.0000884486,0.0006718382,0.0007914403],"genre_scores_gemma":[0.20820005,0.0007950111,0.7859383,0.00016152817,0.0001522149,0.00025106932,0.0008210786,0.00033730117,0.0033434145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00040759408,0.00011965201,0.00029995918,0.0005180058,0.00013945407],"domain_scores_gemma":[0.99793017,0.0004552993,0.00021395377,0.00042944858,0.0007921316,0.00017901858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645339,0.001409814,0.0011508864,0.0017077057,0.001788386,0.0017582102,0.00226295,0.0010131665,0.0034168812],"category_scores_gemma":[0.005514415,0.00061682693,0.001670181,0.0029424531,0.0014141478,0.0031271756,0.002158229,0.0022321746,0.0014727764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020581804,0.000109433095,0.0025065555,0.00029271562,0.00016766936,0.00017946625,0.0003969784,0.5969105,0.006270538,0.11924497,0.010637217,0.2630782],"study_design_scores_gemma":[0.000004143463,0.000011853895,0.00012887453,0.0000047295334,0.000005620495,0.000020616797,0.00002717058,0.98422194,0.0007819906,0.013463363,0.0013188783,0.000010920049],"about_ca_topic_score_codex":0.02701889,"about_ca_topic_score_gemma":0.02109856,"teacher_disagreement_score":0.02701889,"about_ca_system_score_codex":0.0023704558,"about_ca_system_score_gemma":0.003272656,"threshold_uncertainty_score":0.053723276},"labels":[],"label_agreement":null},{"id":"W3210013687","doi":"10.1109/tnse.2021.3123280","title":"Deadline-Aware Deep-Recurrent-Q-Network Governor for Smart Energy Saving","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Green IT and Sustainability","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Governor; Embedded system; Energy consumption; Distributed computing; Real-time computing; Operating system; Engineering","score_opus":0.007161934768661161,"score_gpt":0.19760476471129382,"score_spread":0.19044282994263265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210013687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082773216,0.00069673586,0.9058757,0.0005402837,0.00014673398,0.00008128397,0.00019837305,0.0057489015,0.0039387755],"genre_scores_gemma":[0.9474706,0.00012857474,0.04882039,0.00025304168,0.000022389397,0.00006403487,0.0002003025,0.000114400915,0.0029262486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.00003066316,0.0000098716855,0.000067825196,0.000045173787,0.000046810346],"domain_scores_gemma":[0.9997334,0.000092616494,0.00003740029,0.000032058637,0.00007249212,0.000032090018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068416,0.0006095181,0.0005592118,0.00019325408,0.00032268313,0.00042908307,0.0015877314,0.00053051533,0.0025590262],"category_scores_gemma":[0.0013102444,0.00024833684,0.00032491036,0.00020700293,0.00038310638,0.0011205487,0.0007999022,0.0010341052,0.0003711674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039143968,0.00041081136,0.0038141978,0.00014957131,0.000071243914,0.00021126801,0.00016207735,0.7228061,0.016489148,0.0077821696,0.008445841,0.2392661],"study_design_scores_gemma":[0.000009872879,0.000030438778,0.00010661163,0.0000022866802,0.000005448636,0.000010265004,0.0000055636983,0.9968375,0.0014948347,0.0010560638,0.00043694157,0.0000041079225],"about_ca_topic_score_codex":0.00838795,"about_ca_topic_score_gemma":0.016779628,"teacher_disagreement_score":0.00838795,"about_ca_system_score_codex":0.00084437843,"about_ca_system_score_gemma":0.0009895434,"threshold_uncertainty_score":0.016678274},"labels":[],"label_agreement":null},{"id":"W3215007906","doi":"10.1109/tnse.2021.3131246","title":"Federated Learning and Proactive Computation Reuse at the Edge of Smart Homes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Edge device; Edge computing; Computation; Enhanced Data Rates for GSM Evolution; Inference; Distributed computing; Information privacy; Server; Computer network; Artificial intelligence; Machine learning; Computer security; Algorithm","score_opus":0.0158659023581913,"score_gpt":0.23457836346439637,"score_spread":0.21871246110620507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215007906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11317497,0.00039049293,0.8808699,0.000337612,0.000063892105,0.00006582948,0.0000648792,0.0019540656,0.0030783517],"genre_scores_gemma":[0.93048364,0.00010376769,0.067226075,0.00012872524,0.000023571625,0.000039103947,0.00007041149,0.00003245488,0.0018921775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00017594492,0.00004420883,0.0001919154,0.00014282903,0.000149957],"domain_scores_gemma":[0.9989409,0.00026595898,0.0000864052,0.00046089035,0.00018028889,0.00006549076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319558,0.0005545248,0.0007367156,0.0003733889,0.00075666135,0.0010123387,0.001900389,0.00065959356,0.0014266403],"category_scores_gemma":[0.0018860023,0.00024767054,0.00038067176,0.00070368167,0.0006914664,0.0030737503,0.0016706184,0.00080783066,0.00036446273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011900924,0.00064800755,0.005380457,0.00017454782,0.00012047411,0.0005486582,0.00050405506,0.41616207,0.023554979,0.03105066,0.0067951004,0.513871],"study_design_scores_gemma":[0.000021643727,0.00010782378,0.000515885,0.000010481225,0.000024017267,0.00013778578,0.00007942735,0.96909124,0.012600529,0.01537819,0.002017432,0.000015510675],"about_ca_topic_score_codex":0.002116374,"about_ca_topic_score_gemma":0.0029674624,"teacher_disagreement_score":0.002116374,"about_ca_system_score_codex":0.00063803955,"about_ca_system_score_gemma":0.000744596,"threshold_uncertainty_score":0.0047726035},"labels":[],"label_agreement":null},{"id":"W3215475368","doi":"10.1109/tnse.2021.3130948","title":"Efficient Allocation of Resource-Intensive Mobile Cyber–Physical Social System Applications on a Heterogeneous Mobile Ad Hoc Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Hankuk University of Foreign Studies","keywords":"Computer science; Resource allocation; Distributed computing; Cloud computing; Computer network; Wireless ad hoc network; Resource management (computing); Key (lock); Mobile computing; Latency (audio); Wireless; Computer security; Telecommunications","score_opus":0.008915757605798961,"score_gpt":0.21762097491286891,"score_spread":0.20870521730706995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215475368","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.69863945,0.00040126426,0.29374626,0.00025145308,0.00006168341,0.00032153013,0.00004712619,0.00035406265,0.006177103],"genre_scores_gemma":[0.9848437,0.00006323601,0.014538264,0.000023715947,0.0000075859016,0.000032529326,0.000014939839,0.000009286589,0.00046664325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.000120183795,0.000023312694,0.000081093356,0.000115076335,0.00022365943],"domain_scores_gemma":[0.9990225,0.00031181495,0.0001409038,0.00013407478,0.00016498887,0.0002257532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008604984,0.00045274766,0.00065490504,0.00048277265,0.0009066154,0.0009515125,0.0010525003,0.00030861187,0.0008934609],"category_scores_gemma":[0.0016270215,0.00025454708,0.00031808898,0.0005135542,0.00044213078,0.0009792253,0.0013008057,0.00037717234,0.00014030101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005331493,0.00039890385,0.005012531,0.000063209365,0.00007126618,0.00032285,0.00016839843,0.8868223,0.019905508,0.010019036,0.0014307213,0.07525212],"study_design_scores_gemma":[0.000007969636,0.000034729193,0.0003833189,0.0000013445682,0.0000064563283,0.000013350396,0.000033596487,0.9976427,0.000998662,0.00067445054,0.00019938822,0.0000040128994],"about_ca_topic_score_codex":0.007202886,"about_ca_topic_score_gemma":0.00857813,"teacher_disagreement_score":0.007202886,"about_ca_system_score_codex":0.0012827634,"about_ca_system_score_gemma":0.0018597346,"threshold_uncertainty_score":0.014321923},"labels":[],"label_agreement":null},{"id":"W4205668919","doi":"10.1109/tnse.2021.3137829","title":"High-Capacity Steganography Using Object Addition-Based Cover Enhancement for Secure Communication in Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; Priority Academic Program Development of Jiangsu Higher Education Institutions; National Natural Science Foundation of China","keywords":"Steganography; Cover (algebra); Embedding; Computer science; Object (grammar); Image (mathematics); Theoretical computer science; Artificial intelligence; Steganography tools; Computer vision; Pattern recognition (psychology); Data mining; Engineering","score_opus":0.013791164339552029,"score_gpt":0.22453069436329043,"score_spread":0.2107395300237384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205668919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09598559,0.0006609427,0.89849776,0.00022363185,0.000046891037,0.000048825965,0.00003309987,0.0005989204,0.003904355],"genre_scores_gemma":[0.90471655,0.00070527114,0.09168505,0.000066983346,0.00004071519,0.00003766778,0.00007040967,0.0000393108,0.0026380299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997917,0.00004329479,0.000008352307,0.000034683264,0.000092328395,0.000029648802],"domain_scores_gemma":[0.99973196,0.00011666043,0.000043483782,0.0000616173,0.00003377783,0.0000125139695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029604544,0.00037877905,0.00031952208,0.000336992,0.0002140771,0.0003430193,0.00038804926,0.00042030486,0.0011541409],"category_scores_gemma":[0.000603366,0.00017539835,0.00036507123,0.0003225229,0.0005443795,0.00085405295,0.0007496997,0.00045917064,0.00030901964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041992636,0.000106087675,0.0011092606,0.0001926733,0.00007646661,0.00050116476,0.00016949116,0.42394242,0.35906434,0.035936486,0.0013615029,0.17712027],"study_design_scores_gemma":[0.000009573083,0.00008350624,0.00053208065,0.0000109977855,0.000022695613,0.00024749868,0.000010377579,0.9205578,0.072566494,0.003929509,0.002012104,0.00001735433],"about_ca_topic_score_codex":0.00065147126,"about_ca_topic_score_gemma":0.0007008901,"teacher_disagreement_score":0.0011541409,"about_ca_system_score_codex":0.00037213005,"about_ca_system_score_gemma":0.00021371285,"threshold_uncertainty_score":0.00386101},"labels":[],"label_agreement":null},{"id":"W4206275890","doi":"10.1109/tnse.2021.3132556","title":"Ensuring Profit and QoS When Dynamically Embedding Delay-Constrained ICN and IP Slices for Content Delivery","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Quality of service; Computer network; Profit maximization; The Internet; Embedding; Integer programming; Profit (economics); Content delivery; Distributed computing; Algorithm","score_opus":0.018528268708078836,"score_gpt":0.2103121408699017,"score_spread":0.19178387216182285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206275890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24643202,0.00073088333,0.7393293,0.0006040513,0.00007464236,0.00024344302,0.0001246365,0.00046815738,0.011992963],"genre_scores_gemma":[0.9073463,0.0002997195,0.0910711,0.00004888579,0.000015815622,0.000040030227,0.000050442886,0.000053117583,0.0010746191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00015601014,0.000018347258,0.00006025032,0.00010044771,0.0001890418],"domain_scores_gemma":[0.9991561,0.000428575,0.00012189513,0.00007622781,0.00011309693,0.00010411348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271797,0.00089790515,0.0005178257,0.0003907262,0.0007152474,0.0011787361,0.0007342656,0.0006962061,0.0011256321],"category_scores_gemma":[0.002135836,0.0002657862,0.00022772845,0.00047738766,0.0005318928,0.0014030186,0.00080284604,0.0005722203,0.00014917407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016431836,0.00012195858,0.0014205449,0.000111153895,0.00002383864,0.00033469216,0.0001082397,0.89380467,0.018188119,0.019353397,0.0015487487,0.06482034],"study_design_scores_gemma":[0.0000139009535,0.00011637517,0.00035231354,0.000014043395,0.000021257012,0.00015449864,0.00017192066,0.98073375,0.0073216604,0.009430993,0.0016578757,0.000011485016],"about_ca_topic_score_codex":0.0039878455,"about_ca_topic_score_gemma":0.005864624,"teacher_disagreement_score":0.0039878455,"about_ca_system_score_codex":0.0016443447,"about_ca_system_score_gemma":0.0020132698,"threshold_uncertainty_score":0.011930585},"labels":[],"label_agreement":null},{"id":"W4213024557","doi":"10.1109/tnse.2022.3150755","title":"Workload Balancing in Mobile Edge Computing for Internet of Things: A Population Game Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mobile edge computing; Cloud computing; Computation offloading; Edge computing; Distributed computing; Workload; Computer network; Latency (audio); Population; Cloudlet; Server; Operating system","score_opus":0.009444402188863206,"score_gpt":0.21158430441296583,"score_spread":0.20213990222410264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213024557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11625649,0.00046157298,0.8697533,0.0011046993,0.0001246917,0.00023597559,0.00009504236,0.00009551677,0.0118726455],"genre_scores_gemma":[0.9571206,0.00037440113,0.036846004,0.00029243197,0.000060384344,0.00029227085,0.000056605226,0.00003301121,0.0049243374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.00033427123,0.00002194531,0.00012196358,0.00012349967,0.0001672186],"domain_scores_gemma":[0.9986228,0.0008960427,0.00013014956,0.00003333941,0.00016114608,0.00015659322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400906,0.0010822053,0.0011309561,0.00058063853,0.00086394936,0.0014351836,0.0014311663,0.0014993252,0.0023452044],"category_scores_gemma":[0.0033577974,0.0004112096,0.00082720804,0.0004919837,0.0012680116,0.0015473099,0.0012649063,0.0011786562,0.00017721833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006609847,0.000074996875,0.0010350418,0.000056358193,0.000059377227,0.00021447668,0.00014201726,0.94832265,0.0018981035,0.038189,0.0011365776,0.008805371],"study_design_scores_gemma":[0.000009121944,0.000021824197,0.000108930195,0.0000041848025,0.0000072748458,0.000017381008,0.000031360974,0.9931166,0.00007104011,0.0063582426,0.00024839505,0.000005529537],"about_ca_topic_score_codex":0.005782864,"about_ca_topic_score_gemma":0.0043386994,"teacher_disagreement_score":0.005782864,"about_ca_system_score_codex":0.0016064607,"about_ca_system_score_gemma":0.0013444512,"threshold_uncertainty_score":0.011655748},"labels":[],"label_agreement":null},{"id":"W4225926344","doi":"10.1109/tnse.2022.3169117","title":"Federated Learning Meets Multi-Objective Optimization","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hyperparameter; Robustness (evolution); Artificial intelligence; Convergence (economics); Pareto principle; Machine learning; Information retrieval; Mathematics; Mathematical optimization","score_opus":0.015864241134683606,"score_gpt":0.22645905966344693,"score_spread":0.21059481852876333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225926344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011816724,0.00021143619,0.9838148,0.00060703844,0.00005829631,0.00007110317,0.00008375397,0.0008653499,0.0024715096],"genre_scores_gemma":[0.634765,0.00027151083,0.35675794,0.0006958118,0.00014142579,0.00041619947,0.00037965353,0.0002762246,0.0062961313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978219,0.0007590879,0.000109405286,0.0006007082,0.00039525746,0.00031357142],"domain_scores_gemma":[0.99554765,0.0026372978,0.00036598026,0.0005829941,0.00064116874,0.00022485085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004053928,0.002180689,0.0021705776,0.00093922863,0.0009288874,0.0021752175,0.0024165725,0.003453681,0.0035236713],"category_scores_gemma":[0.0098250955,0.00081182225,0.0011074012,0.0010389086,0.0020002534,0.002692549,0.0030383016,0.0037884333,0.0010049413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009170552,0.00008343547,0.00035837438,0.000058631387,0.000041704272,0.000048511272,0.000021732276,0.9575537,0.000432288,0.008968234,0.0015807629,0.030760888],"study_design_scores_gemma":[0.0000072163925,0.000014845776,0.000022987493,0.0000030190752,0.000002367332,0.0000062413255,0.00000340327,0.9930547,0.0002112661,0.0065190727,0.00015279863,0.00000208949],"about_ca_topic_score_codex":0.0045602093,"about_ca_topic_score_gemma":0.0041444483,"teacher_disagreement_score":0.0045602093,"about_ca_system_score_codex":0.0023320941,"about_ca_system_score_gemma":0.002996414,"threshold_uncertainty_score":0.021439493},"labels":[],"label_agreement":null},{"id":"W4226248369","doi":"10.1109/tnse.2022.3157730","title":"ASTREAM: Data-Stream-Driven Scalable Anomaly Detection With Accuracy Guarantee in IIoT Environment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Anomaly detection; Computer science; Scalability; Data mining; Data modeling; Database","score_opus":0.011404615246309943,"score_gpt":0.20474007062846655,"score_spread":0.1933354553821566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226248369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030467851,0.00033022507,0.91958994,0.00029123173,0.00015512935,0.00030030624,0.0005657235,0.0466009,0.0016987154],"genre_scores_gemma":[0.5055635,0.00023846624,0.48807353,0.00032359696,0.0001514127,0.00030415753,0.00210239,0.0009822296,0.002260695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981439,0.00021641707,0.00016415885,0.00044332715,0.000831208,0.00020092285],"domain_scores_gemma":[0.9971169,0.0007963583,0.0003392045,0.0008492325,0.00063739164,0.00026087125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882235,0.0013905618,0.0014513466,0.0016679879,0.00061399775,0.0017836373,0.0030820344,0.0009239326,0.0014731825],"category_scores_gemma":[0.0066703344,0.00047285194,0.00077818683,0.001213248,0.0007410425,0.0033585746,0.002897523,0.0014515076,0.00080856425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018479528,0.0005954962,0.013256733,0.00040762578,0.0002980582,0.0010876969,0.00041614065,0.21116886,0.056214795,0.013451204,0.032313436,0.6689419],"study_design_scores_gemma":[0.000037011545,0.00007089737,0.0005792584,0.0000062408876,0.000015740905,0.000084702006,0.000028153032,0.98602074,0.008400801,0.0026834328,0.0020538901,0.00001913089],"about_ca_topic_score_codex":0.0042810063,"about_ca_topic_score_gemma":0.0036479395,"teacher_disagreement_score":0.0042810063,"about_ca_system_score_codex":0.00070431334,"about_ca_system_score_gemma":0.0016127818,"threshold_uncertainty_score":0.009954333},"labels":[],"label_agreement":null},{"id":"W4226445422","doi":"10.1109/tnse.2022.3163927","title":"Joint VNF Placement and Scheduling for Latency-Sensitive Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Scheduling (production processes); Provisioning; Computer network; Integer programming; Heuristics; Network Functions Virtualization; Virtual network; Cloud computing; Mathematical optimization","score_opus":0.011451707460705382,"score_gpt":0.20033188947330544,"score_spread":0.18888018201260004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226445422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08115551,0.001091008,0.91102785,0.00037583316,0.00021371912,0.0002191557,0.00021931354,0.00049587013,0.005201819],"genre_scores_gemma":[0.79408115,0.0005870369,0.20236242,0.000096003016,0.000098276105,0.00010275152,0.00029165467,0.0001228052,0.0022579602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876803,0.00037654515,0.000057921232,0.0002144614,0.0001836868,0.00039932734],"domain_scores_gemma":[0.9987482,0.0006058039,0.00020515504,0.00011200113,0.0001547707,0.00017407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013913328,0.00137321,0.0013382407,0.00076681434,0.0011227091,0.001034763,0.001317279,0.0010282663,0.002407513],"category_scores_gemma":[0.0027341074,0.0005479092,0.00073297817,0.001211749,0.00060005946,0.0012549429,0.00079921645,0.00077633216,0.00031736292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001731806,0.000099621444,0.0008057372,0.00011216102,0.000032409258,0.00016051283,0.000067127934,0.9362347,0.004281833,0.0060766116,0.0021037373,0.049852345],"study_design_scores_gemma":[0.000015441077,0.000065900815,0.00023099424,0.0000075307653,0.000011860127,0.00006906906,0.0000560973,0.9928282,0.0013171072,0.0043798983,0.0010081147,0.000009707687],"about_ca_topic_score_codex":0.008932474,"about_ca_topic_score_gemma":0.012170794,"teacher_disagreement_score":0.008932474,"about_ca_system_score_codex":0.0015651725,"about_ca_system_score_gemma":0.0026533713,"threshold_uncertainty_score":0.017760932},"labels":[],"label_agreement":null},{"id":"W4285121953","doi":"10.1109/tnse.2022.3185717","title":"Temporal-Spatial Analysis of the Essentiality of Hub Proteins in Protein-Protein Interaction Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Training Program for Excellent Young Innovators of Changsha; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Centrality; Leverage (statistics); Computer science; Construct (python library); Network analysis; Identification (biology); Data mining; Biological network; Computational biology; Artificial intelligence; Biology; Computer network; Mathematics","score_opus":0.005785514114959971,"score_gpt":0.20763668368423308,"score_spread":0.2018511695692731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285121953","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.5463002,0.0012942457,0.44828296,0.00024366759,0.0000250029,0.000053366744,0.00084233156,0.00037165536,0.0025866237],"genre_scores_gemma":[0.9793714,0.00035137314,0.019408971,0.000018054092,0.000015485017,0.000025820016,0.00046092764,0.00002203395,0.00032586485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939764,0.00012953667,0.000043028827,0.0001709866,0.00017941592,0.00007936842],"domain_scores_gemma":[0.99697435,0.001599619,0.00060538406,0.0001923236,0.00045939034,0.00016888796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948437,0.00036346551,0.0003644714,0.0028466037,0.00046868334,0.0005772672,0.00046257052,0.00036918643,0.0005837924],"category_scores_gemma":[0.005472855,0.00018704365,0.00046957636,0.0023635726,0.0006782855,0.0011753915,0.00069563376,0.00043796207,0.00008218731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005058573,0.00011019575,0.083924785,0.00051682815,0.00031256911,0.0010787784,0.0004752516,0.69444877,0.065126024,0.06572641,0.0017496824,0.08602475],"study_design_scores_gemma":[0.000008304384,0.000036835743,0.02031729,0.000013147059,0.000065673325,0.0003427631,0.00010597223,0.9549402,0.006040503,0.016817432,0.0012895877,0.000022413415],"about_ca_topic_score_codex":0.0043400303,"about_ca_topic_score_gemma":0.0039212606,"teacher_disagreement_score":0.0043400303,"about_ca_system_score_codex":0.000978742,"about_ca_system_score_gemma":0.0006349988,"threshold_uncertainty_score":0.008629501},"labels":[],"label_agreement":null},{"id":"W4285126844","doi":"10.1109/tnse.2022.3176924","title":"Hybrid NOMA-FDMA Assisted Dual Computation Offloading: A Latency Minimization Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Noma; Computer science; Minification; Dual (grammatical number); Computation; Computer network; Latency (audio); Telecommunications link; Algorithm; Telecommunications","score_opus":0.014845897807780808,"score_gpt":0.20292691059290763,"score_spread":0.18808101278512682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285126844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015809221,0.00026822722,0.9802484,0.0001684821,0.000051071172,0.000042706662,0.000031209478,0.00014353648,0.0032371709],"genre_scores_gemma":[0.7695251,0.00037383186,0.2237474,0.00016366963,0.00008751568,0.0001735915,0.00009368097,0.0000620146,0.0057731494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956864,0.000093836665,0.000015789035,0.00008351229,0.00011609902,0.00012205133],"domain_scores_gemma":[0.9995283,0.00023755494,0.000055525103,0.000053123633,0.00007780296,0.00004767179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054132444,0.0010327051,0.0008260262,0.00034322767,0.00047455786,0.0010312137,0.0014070851,0.0007378096,0.0019683056],"category_scores_gemma":[0.0009179242,0.00035503358,0.00053522625,0.00059933873,0.0006413351,0.0008097351,0.0013057976,0.00082252704,0.00041438246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014963456,0.00011147493,0.00054460665,0.00008774468,0.000041552295,0.00014156743,0.00009972746,0.9135899,0.010531154,0.016234122,0.0017316769,0.056736875],"study_design_scores_gemma":[0.0000069784887,0.00002579694,0.000037653965,0.0000026768416,0.0000044754465,0.000018799918,0.000014156265,0.9970866,0.00058438024,0.0018748962,0.00034005343,0.0000035087635],"about_ca_topic_score_codex":0.0031212796,"about_ca_topic_score_gemma":0.0041970112,"teacher_disagreement_score":0.0031212796,"about_ca_system_score_codex":0.00070133543,"about_ca_system_score_gemma":0.0010956147,"threshold_uncertainty_score":0.0065845847},"labels":[],"label_agreement":null},{"id":"W4285202992","doi":"10.1109/tnse.2022.3171600","title":"Trajectory Design and Resource Allocation for Multi-UAV Networks: Deep Reinforcement Learning Approaches","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Government of Jiangsu Province; China Institute of Communications","keywords":"Reinforcement learning; Computer science; Resource allocation; Flexibility (engineering); Trajectory; Distributed computing; Base station; A priori and a posteriori; Resource management (computing); Artificial intelligence; Curse of dimensionality; Resource (disambiguation); Computer network","score_opus":0.027946062520504966,"score_gpt":0.20143507782797115,"score_spread":0.1734890153074662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285202992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022337187,0.00038988708,0.9742606,0.0003449566,0.000034363227,0.000032027907,0.000024718443,0.00013536074,0.002440946],"genre_scores_gemma":[0.93050295,0.0002283112,0.06633029,0.00015697884,0.000031361866,0.00009719925,0.000056742225,0.000040950574,0.0025551931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996673,0.00011925557,0.000014941568,0.000063563246,0.000058939368,0.00007600933],"domain_scores_gemma":[0.9989416,0.0006387621,0.00014154827,0.0000447375,0.00015484248,0.000078549565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010214273,0.0007647087,0.00092818675,0.00035978912,0.00036740126,0.0006515265,0.0008851848,0.0010480992,0.0015038857],"category_scores_gemma":[0.0022440057,0.00042145333,0.00038109167,0.00033889076,0.00076638587,0.0007643324,0.00092177786,0.0012886057,0.00018748558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001720032,0.000015983867,0.00021817759,0.000012587623,0.00000816341,0.00002004635,0.000017320996,0.98871684,0.00027464773,0.002817012,0.00021572625,0.007666285],"study_design_scores_gemma":[0.0000017821781,0.000004892647,0.0000130981225,0.0000012048565,8.4072775e-7,0.0000015338682,0.0000018625376,0.9991635,0.00003729871,0.0007182911,0.000055045646,7.167681e-7],"about_ca_topic_score_codex":0.009817008,"about_ca_topic_score_gemma":0.0067721503,"teacher_disagreement_score":0.009817008,"about_ca_system_score_codex":0.0013141062,"about_ca_system_score_gemma":0.0013297347,"threshold_uncertainty_score":0.019519746},"labels":[],"label_agreement":null},{"id":"W4285268932","doi":"10.1109/tnse.2022.3188921","title":"6G-Empowered Offloading for Realtime Applications in Multi-Access Edge Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile edge computing; Server; Edge computing; Computation offloading; Mobile device; Markov decision process; Distributed computing; Mobile computing; Wireless; Edge device; Reinforcement learning; Enhanced Data Rates for GSM Evolution; Computer network; Artificial intelligence; Markov process; Cloud computing; Operating system","score_opus":0.02650655660859465,"score_gpt":0.2725154155000941,"score_spread":0.24600885889149945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285268932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08490739,0.0014235778,0.8985816,0.0007133426,0.0003410255,0.0001136583,0.00013164415,0.0018477977,0.011939983],"genre_scores_gemma":[0.9540645,0.00040297408,0.041735712,0.0003348616,0.000106391446,0.00006750056,0.00010303074,0.000057568148,0.003127572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960214,0.00006847355,0.000018331402,0.00008645209,0.00009252021,0.00013209488],"domain_scores_gemma":[0.9996649,0.00010340991,0.000035300036,0.000075080075,0.00007477082,0.00004660245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033938704,0.000739253,0.0006930848,0.00028779422,0.00054219813,0.0006892853,0.0010394383,0.0005931524,0.0020610765],"category_scores_gemma":[0.00097028114,0.00019584829,0.00026906046,0.00035577762,0.0005131662,0.0011714302,0.0012303155,0.0009134249,0.0005725618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007840807,0.00035510515,0.002855254,0.0002839851,0.0000565706,0.0006859651,0.00030432668,0.46815655,0.052210893,0.035715893,0.01097758,0.42761385],"study_design_scores_gemma":[0.00001974076,0.000101456615,0.00037513344,0.000015900769,0.000011396532,0.00012079495,0.000041756648,0.98111546,0.004657296,0.009195611,0.004329369,0.000016111555],"about_ca_topic_score_codex":0.0017160175,"about_ca_topic_score_gemma":0.0031527425,"teacher_disagreement_score":0.0020610765,"about_ca_system_score_codex":0.00040575536,"about_ca_system_score_gemma":0.00060374476,"threshold_uncertainty_score":0.006894946},"labels":[],"label_agreement":null},{"id":"W4285307446","doi":"10.1109/tnse.2022.3185253","title":"Pareto: Fair Congestion Control With Online Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Pareto principle; Heuristics; Network congestion; Variety (cybernetics); Artificial intelligence; Flow control (data); Machine learning; Distributed computing; Memetics; Mathematical optimization; Computer network; Network packet","score_opus":0.005640305181627298,"score_gpt":0.18160569013900518,"score_spread":0.17596538495737787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285307446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017397564,0.00027913242,0.9735757,0.000356863,0.00016716264,0.0001287448,0.00008030095,0.0034588957,0.004555554],"genre_scores_gemma":[0.7694269,0.00025522217,0.22325273,0.0004916806,0.000102068465,0.00041470543,0.00024029239,0.0003465448,0.0054698274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.00025859446,0.0000405853,0.00016617325,0.00023232333,0.00017276482],"domain_scores_gemma":[0.9976337,0.0013592253,0.00017025968,0.00022295705,0.000426458,0.0001873607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943879,0.0013343234,0.0010442621,0.0006701659,0.0009016667,0.0010823229,0.0028447001,0.0013216862,0.00350363],"category_scores_gemma":[0.007191629,0.00053978205,0.00062096596,0.00042551348,0.0014531644,0.0017736945,0.0018419595,0.0025604018,0.0006423781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011712497,0.000107720334,0.0005872574,0.00003943075,0.000029959994,0.000038178576,0.000049309874,0.935714,0.00060772384,0.009197374,0.0027851101,0.05072671],"study_design_scores_gemma":[0.000014682134,0.00002370165,0.000027020937,0.0000029817559,0.0000032664339,0.0000040322843,0.0000028946397,0.99630797,0.00026441418,0.0030391556,0.00030679576,0.0000032499934],"about_ca_topic_score_codex":0.010715563,"about_ca_topic_score_gemma":0.008662811,"teacher_disagreement_score":0.010715563,"about_ca_system_score_codex":0.0014023762,"about_ca_system_score_gemma":0.0030807059,"threshold_uncertainty_score":0.021306396},"labels":[],"label_agreement":null},{"id":"W4285818425","doi":"10.1109/tnse.2022.3191601","title":"Retracted: Blockchain and Deep Learning for Secure Communication in Digital Twin Empowered Industrial IoT Network","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":109,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Autoencoder; Server; Cloud computing; Distributed computing; Deep learning; Data integrity; Scheme (mathematics); Artificial intelligence; Computer network; Data mining; Computer security","score_opus":0.013514646000085208,"score_gpt":0.20711389684196718,"score_spread":0.19359925084188198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285818425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0965388,0.0005393475,0.8925218,0.0010730529,0.00015359378,0.000115394076,0.0002142447,0.001378813,0.007464997],"genre_scores_gemma":[0.95661676,0.00022164798,0.036470413,0.00013531712,0.00003155971,0.00009211165,0.00022276603,0.000051633655,0.0061577167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993156,0.0001715964,0.00003736003,0.00014119902,0.00018002608,0.00015415151],"domain_scores_gemma":[0.99919206,0.00026358536,0.000075865966,0.00018261524,0.00020119101,0.000084682964],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013045832,0.00050066505,0.0006471793,0.00039560534,0.00069512875,0.0008515461,0.001382563,0.0009898188,0.003954983],"category_scores_gemma":[0.0024970414,0.0002739731,0.00038995518,0.0004085092,0.0011111192,0.0022587434,0.0023910382,0.001341418,0.00056309864],"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.00024716623,0.00009730126,0.0014646901,0.0000803688,0.000032716656,0.00025519653,0.000120771605,0.87642884,0.0040328945,0.04012327,0.0023375233,0.07477927],"study_design_scores_gemma":[0.00000503024,0.000020332762,0.00004428197,0.0000027705016,0.0000020547036,0.000009216924,0.0000060293837,0.99266464,0.00061577867,0.006262675,0.00036444937,0.0000027064623],"about_ca_topic_score_codex":0.008262806,"about_ca_topic_score_gemma":0.0081647355,"teacher_disagreement_score":0.9990102,"about_ca_system_score_codex":0.0012704391,"about_ca_system_score_gemma":0.0022941509,"threshold_uncertainty_score":0.016429424},"labels":[],"label_agreement":null},{"id":"W4293198140","doi":"10.1109/tnse.2022.3161479","title":"Detection and Prediction of FDI Attacks in IoT Systems via Hidden Markov Model","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hidden Markov model; Benchmark (surveying); Internet of Things; Reputation; Process (computing); Latency (audio); Computer security; Markov process; Artificial intelligence; Machine learning; Distributed computing; Telecommunications","score_opus":0.008920826916470097,"score_gpt":0.19005981706105146,"score_spread":0.18113899014458137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293198140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21429825,0.0003799849,0.7821037,0.0006187424,0.00006762915,0.000057538284,0.00012512588,0.0008064575,0.0015426169],"genre_scores_gemma":[0.98993886,0.000082608494,0.00938212,0.000033680706,0.000012711591,0.000023143712,0.000061894505,0.000011169986,0.00045384135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992508,0.00018356295,0.000057428177,0.00016930347,0.00020794931,0.0001309363],"domain_scores_gemma":[0.99489224,0.003419627,0.0007727347,0.00023800872,0.00051501306,0.0001624813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016941926,0.0008336493,0.0008934146,0.0005347986,0.00040017997,0.00080606673,0.0008491793,0.0007391851,0.0006284329],"category_scores_gemma":[0.00661801,0.0004610979,0.0005893203,0.00032264774,0.0006675209,0.00111375,0.00083920645,0.0016030585,0.00015996728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011256271,0.00005126707,0.0058019073,0.0000284446,0.000033384942,0.00007111466,0.000044914068,0.9780189,0.0010847409,0.0034985354,0.0003428578,0.010911316],"study_design_scores_gemma":[0.0000013942594,0.000005452445,0.00016682851,9.128336e-7,0.00000235447,0.000002754104,0.0000014998872,0.999111,0.00012821007,0.00056661264,0.000011468486,0.0000014401511],"about_ca_topic_score_codex":0.00974419,"about_ca_topic_score_gemma":0.006973553,"teacher_disagreement_score":0.00974419,"about_ca_system_score_codex":0.0009960547,"about_ca_system_score_gemma":0.0010794968,"threshold_uncertainty_score":0.019374967},"labels":[],"label_agreement":null},{"id":"W4295037719","doi":"10.1109/tnse.2022.3195370","title":"Guest Editorial Introduction to the Special Section on Collaborative Machine Learning for Next-Generation Intelligent Applications","year":2022,"lang":"en","type":"editorial","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Software deployment; Special section; Computer science; Collaborative learning; Open research; Focus (optics); Artificial intelligence; Data science; Engineering management; Knowledge management; Engineering; Software engineering; World Wide Web","score_opus":0.011828871351036507,"score_gpt":0.2295967274689162,"score_spread":0.21776785611787972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295037719","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.000033906206,0.0028354416,0.00025541213,0.018228373,0.97674996,0.000019742922,0.00003983558,0.00005842744,0.0017789046],"genre_scores_gemma":[0.0003104052,0.0023400532,0.00010797007,0.0069459667,0.98418945,0.000017527604,0.000027833285,0.0000383686,0.0060222847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99653304,0.0003442425,0.00032143082,0.00054433965,0.0019655232,0.0002913664],"domain_scores_gemma":[0.9853101,0.003898327,0.0008875074,0.0003805817,0.006597062,0.0029264975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048142853,0.0026806963,0.0027825984,0.0030979954,0.0024397713,0.0070365695,0.0023791783,0.008894327,0.018434875],"category_scores_gemma":[0.013233166,0.0007744827,0.0021987988,0.001174557,0.0017406571,0.0042458447,0.0016238078,0.015765512,0.015270297],"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.00002297752,0.000013237896,0.000024133338,0.00012630914,0.0000090747635,0.000085722815,0.0000087087155,0.000035398654,0.000073670824,0.00037604076,0.99355006,0.0056745033],"study_design_scores_gemma":[0.00003147057,0.000034323708,0.00019059627,0.00023298309,0.000025506848,0.0002566373,0.000026929529,0.00023095714,0.00014931422,0.0010631011,0.99774265,0.000015722466],"about_ca_topic_score_codex":0.0006457212,"about_ca_topic_score_gemma":0.0017012431,"teacher_disagreement_score":0.018434875,"about_ca_system_score_codex":0.0018041572,"about_ca_system_score_gemma":0.0021617531,"threshold_uncertainty_score":0.06167084},"labels":[],"label_agreement":null},{"id":"W4312361566","doi":"10.1109/tnse.2022.3217460","title":"Flocks, Mobs, and Figure Eights: Swarming as a Lemniscatic Arch","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Swarm behaviour; Arch; Swarming (honey bee); Computer science; Mathematics; Artificial intelligence; Geometry; Mathematical optimization; Algorithm; Structural engineering; Engineering","score_opus":0.007847835142662553,"score_gpt":0.20089226501244603,"score_spread":0.19304442986978348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312361566","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.52636427,0.00030142252,0.44752264,0.00039967961,0.00007096255,0.00009345367,0.00006474155,0.0004368438,0.024745896],"genre_scores_gemma":[0.9451091,0.00011708776,0.048860926,0.000070276736,0.000011164374,0.00004988246,0.0000536869,0.000039810213,0.005688089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992883,0.000016309164,0.0000029797995,0.0000182475,0.000022169233,0.000011462483],"domain_scores_gemma":[0.99987876,0.000019590147,0.000024661884,0.000025615216,0.00001944244,0.000031889478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012365454,0.00027066877,0.00021839609,0.0003182719,0.0005284003,0.00044988032,0.00039455076,0.00043043806,0.0017749022],"category_scores_gemma":[0.00035422068,0.00016456601,0.00018918922,0.00015232744,0.0009875834,0.0005648144,0.00074994937,0.00030005112,0.00036065676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003806243,0.00011059762,0.0058176094,0.00018132965,0.00008184064,0.0010864739,0.0015138809,0.524059,0.21854377,0.1477445,0.0035549311,0.09692542],"study_design_scores_gemma":[0.000046993704,0.0003848006,0.002242295,0.00003601782,0.000019098297,0.00044992726,0.00043685222,0.94174904,0.011911203,0.02912724,0.013552813,0.000043731197],"about_ca_topic_score_codex":0.002004841,"about_ca_topic_score_gemma":0.001706538,"teacher_disagreement_score":0.002004841,"about_ca_system_score_codex":0.00030884764,"about_ca_system_score_gemma":0.00029445475,"threshold_uncertainty_score":0.005937636},"labels":[],"label_agreement":null},{"id":"W4312595421","doi":"10.1109/tnse.2022.3211192","title":"When Collaborative Federated Learning Meets Blockchain to Preserve Privacy in Healthcare","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Notation; Health care; Service provider; Artificial intelligence; Service (business); Machine learning; Mathematics","score_opus":0.01625646702471899,"score_gpt":0.2454283165302232,"score_spread":0.2291718495055042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312595421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077120736,0.0009706115,0.8716606,0.022671439,0.00054147176,0.0006340149,0.0010914907,0.0016087004,0.023701029],"genre_scores_gemma":[0.8879149,0.0005628731,0.09720691,0.0026419112,0.0002968872,0.000471387,0.0008950221,0.0002997757,0.009710209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9849978,0.006205981,0.0010639294,0.0034189716,0.002253705,0.0020596033],"domain_scores_gemma":[0.95876926,0.019237284,0.0021209228,0.014486912,0.0029707286,0.002414871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023279307,0.00085009413,0.0022576184,0.0011063309,0.003074756,0.0071053943,0.0034592655,0.0054773237,0.014206181],"category_scores_gemma":[0.07178413,0.00095036224,0.0012370935,0.0017903501,0.0036487544,0.01795019,0.012919445,0.0051838816,0.0028218317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018648045,0.0004215871,0.0066308174,0.00039503706,0.00019147467,0.0016433646,0.0013966679,0.17172787,0.0030746702,0.64400035,0.025224652,0.14342874],"study_design_scores_gemma":[0.00013216042,0.0001252564,0.000330394,0.00010418898,0.000030153702,0.0003069928,0.00033133556,0.27526703,0.0016449647,0.70852673,0.013160025,0.00004076338],"about_ca_topic_score_codex":0.0025313161,"about_ca_topic_score_gemma":0.0021877373,"teacher_disagreement_score":0.023279307,"about_ca_system_score_codex":0.002108031,"about_ca_system_score_gemma":0.008436859,"threshold_uncertainty_score":0.12311423},"labels":[],"label_agreement":null},{"id":"W4312737157","doi":"10.1109/tnse.2022.3227317","title":"Blockchain-Powered Tensor Meta-Learning-Driven Intelligent Healthcare System With IoT Assistance","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Big data; Upload; Blockchain; Edge computing; Data modeling; Node (physics); Differential privacy; Health care; Artificial intelligence; Distributed computing; Computer security; Internet of Things; Data science; Database; Data mining; World Wide Web; Engineering","score_opus":0.024160977404488682,"score_gpt":0.22889867870826594,"score_spread":0.20473770130377725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312737157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06852895,0.00027519086,0.9229916,0.0009542703,0.00008496956,0.00013370559,0.00023488764,0.0015993287,0.0051970338],"genre_scores_gemma":[0.94868517,0.00016389116,0.04776799,0.00016011082,0.000028841574,0.000102102575,0.0002265111,0.000037049136,0.0028284835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.00015103482,0.00005492146,0.00017424166,0.0001837129,0.000118480995],"domain_scores_gemma":[0.9991129,0.00024267408,0.00010551687,0.0001891116,0.00023336048,0.00011646706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011052728,0.00043587544,0.00074060546,0.0003514929,0.00074939,0.0008741319,0.0012639005,0.00072335906,0.0028052814],"category_scores_gemma":[0.0018319826,0.0002395434,0.0004764791,0.0005618254,0.0006411056,0.0021523447,0.0018495569,0.00075404055,0.00044681598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053404167,0.00019657558,0.0032465965,0.000109964356,0.00007071775,0.0004378389,0.00022373247,0.82142395,0.008958667,0.030178241,0.0041740155,0.13044572],"study_design_scores_gemma":[0.000012109415,0.000028295664,0.00008264487,0.0000024785766,0.0000060200327,0.00003701151,0.000008408491,0.9925287,0.0010860086,0.005578207,0.0006242602,0.0000058582],"about_ca_topic_score_codex":0.0051275906,"about_ca_topic_score_gemma":0.004112881,"teacher_disagreement_score":0.0051275906,"about_ca_system_score_codex":0.0010536672,"about_ca_system_score_gemma":0.0022198576,"threshold_uncertainty_score":0.010195494},"labels":[],"label_agreement":null},{"id":"W4312864044","doi":"10.1109/tnse.2022.3218313","title":"Retracted: A DQN-Based Frame Aggregation and Task Offloading Approach for Edge-Enabled IoMT","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":58,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; Zhejiang University; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Energy consumption; Computer network; Frame (networking); Node (physics); Throughput; Body area network; Wearable computer; Enhanced Data Rates for GSM Evolution; Distributed computing; Edge computing; Wireless; Wireless sensor network; Embedded system; Telecommunications","score_opus":0.010305534303243317,"score_gpt":0.1992648163560464,"score_spread":0.18895928205280307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312864044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07201587,0.00058880384,0.9219425,0.00030433454,0.00028551547,0.00010964384,0.00009484243,0.001056617,0.003601865],"genre_scores_gemma":[0.90252656,0.00021585848,0.09261161,0.0002895373,0.0000884421,0.00007161652,0.00018376594,0.000060190174,0.0039524212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996674,0.000039923074,0.000022923225,0.000097378324,0.00007306018,0.00009936222],"domain_scores_gemma":[0.9995732,0.00007955629,0.000035102337,0.00006866584,0.00017459849,0.000068829824],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006118985,0.0005463858,0.0005373447,0.00037790893,0.00076191005,0.0005638081,0.0012415845,0.00046378735,0.0016531621],"category_scores_gemma":[0.0012795177,0.00016588844,0.00031122143,0.00039515586,0.00044194626,0.0012466362,0.0011030766,0.00069133425,0.00033112644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001156529,0.0004786263,0.0061031985,0.00021708063,0.00007737244,0.00051372324,0.0006501305,0.21945432,0.055835884,0.012007388,0.008799659,0.69470614],"study_design_scores_gemma":[0.000026333697,0.00015923017,0.00073316257,0.000010177488,0.000021591612,0.00010962909,0.00006951437,0.98766035,0.0049444577,0.0036465446,0.0026025784,0.000016404225],"about_ca_topic_score_codex":0.010360884,"about_ca_topic_score_gemma":0.012245825,"teacher_disagreement_score":0.9995362,"about_ca_system_score_codex":0.0008212067,"about_ca_system_score_gemma":0.0013269754,"threshold_uncertainty_score":0.020601153},"labels":[],"label_agreement":null},{"id":"W4313643885","doi":"10.1109/tnse.2023.3234720","title":"Connectivity Preservation and Collision Avoidance in Multi-Agent Systems Using Model Predictive Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Model predictive control; Collision avoidance; Computer science; Position (finance); Control theory (sociology); Distributed computing; Controller (irrigation); Multi-agent system; Field (mathematics); Scheme (mathematics); Topology (electrical circuits); Control (management); Collision; Artificial intelligence; Engineering; Mathematics; Computer security","score_opus":0.03265230708582384,"score_gpt":0.244379077081941,"score_spread":0.21172676999611717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313643885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048182346,0.00056339946,0.94796854,0.00014754527,0.000049678158,0.000025978617,0.000012974533,0.00030109627,0.0027484132],"genre_scores_gemma":[0.98158664,0.00022504722,0.017414417,0.00002211886,0.000020944373,0.000033359363,0.000014595741,0.000009947784,0.0006729185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981433,0.000046893783,0.0000074932013,0.000032947297,0.00007331684,0.000025098925],"domain_scores_gemma":[0.9997211,0.00012859338,0.000056353863,0.000026372954,0.000049047823,0.000018435854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003050885,0.00044906707,0.00041066628,0.00035674236,0.00039649886,0.00053810305,0.0007869251,0.00047188342,0.0003665237],"category_scores_gemma":[0.0009156705,0.0002084595,0.00030325633,0.00035304105,0.0005761456,0.0007128824,0.0006549004,0.0004973519,0.000067499364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036685367,0.000019872617,0.00036400382,0.000039721264,0.00001658721,0.000114985975,0.000074329575,0.96074396,0.0035625922,0.0077870665,0.00021270642,0.027027512],"study_design_scores_gemma":[0.000005299557,0.000031967185,0.00007732464,0.0000029565365,0.000004253837,0.000014068789,0.0000062715408,0.997145,0.0003910603,0.0020828196,0.00023625983,0.0000027361673],"about_ca_topic_score_codex":0.004070905,"about_ca_topic_score_gemma":0.0022253299,"teacher_disagreement_score":0.004070905,"about_ca_system_score_codex":0.00034552554,"about_ca_system_score_gemma":0.0004570161,"threshold_uncertainty_score":0.00809443},"labels":[],"label_agreement":null},{"id":"W4316660683","doi":"10.1109/tnse.2023.3237367","title":"MiTFed: A Privacy Preserving Collaborative Network Attack Mitigation Framework Based on Federated Learning Using SDN and Blockchain","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Intrusion detection system; Denial-of-service attack; Computer security; Field (mathematics); Artificial intelligence; Machine learning; The Internet; World Wide Web","score_opus":0.01519421414649342,"score_gpt":0.2447492574588251,"score_spread":0.22955504331233167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316660683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007532841,0.00008395828,0.98856133,0.00019741237,0.000028918712,0.000119711534,0.00006294094,0.0017436366,0.0016693748],"genre_scores_gemma":[0.5106703,0.00020729752,0.48352844,0.0001853444,0.00004922194,0.00032995208,0.00034055318,0.00013822787,0.004550723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980901,0.00057873223,0.00010887016,0.00036354348,0.0006495336,0.000209256],"domain_scores_gemma":[0.9981185,0.0005761857,0.0002098275,0.0005931223,0.000271341,0.0002311592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033137645,0.0006181393,0.00097452564,0.00083627517,0.0012479626,0.001671358,0.0030492132,0.0015415715,0.0021781984],"category_scores_gemma":[0.0038176393,0.0003406532,0.00088337535,0.00070322177,0.0014495896,0.0038567649,0.0042233514,0.0016337904,0.00038649794],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035268563,0.00045570606,0.002324736,0.000118843105,0.00014783975,0.00055123825,0.00033217203,0.62697285,0.007071471,0.15089847,0.005504463,0.20526956],"study_design_scores_gemma":[0.000027035565,0.00004700378,0.00009837379,0.000008783511,0.000009912903,0.00006971895,0.00001837995,0.9626504,0.0018460529,0.031020496,0.004189763,0.000014109084],"about_ca_topic_score_codex":0.004586517,"about_ca_topic_score_gemma":0.0045780367,"teacher_disagreement_score":0.004586517,"about_ca_system_score_codex":0.00121977,"about_ca_system_score_gemma":0.002898769,"threshold_uncertainty_score":0.017525077},"labels":[],"label_agreement":null},{"id":"W4321609790","doi":"10.1109/tnse.2022.3226422","title":"Intelligent Task Allocation for Mobile Crowdsensing With Graph Attention Network and Deep Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Reinforcement learning; Task (project management); Solver; Task analysis; Artificial intelligence; Distributed computing; Machine learning; Engineering","score_opus":0.008987983892442675,"score_gpt":0.2096274687898367,"score_spread":0.20063948489739403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321609790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028168978,0.0005412574,0.96551937,0.00052877236,0.000110363064,0.000081609076,0.00008231435,0.0009880563,0.0039793192],"genre_scores_gemma":[0.8694349,0.00027878428,0.12488733,0.0005226463,0.000085083215,0.00021796575,0.00019914299,0.00012118035,0.004252806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954396,0.00012281473,0.000016690708,0.00013060014,0.00008369728,0.00010225674],"domain_scores_gemma":[0.99907494,0.0005586742,0.000086746826,0.000055430355,0.0001293666,0.00009484215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008154662,0.0012211831,0.0011987796,0.00054996624,0.000492678,0.00068715826,0.0018696444,0.0014128521,0.0021159227],"category_scores_gemma":[0.0027259067,0.0005481581,0.0006223014,0.0005211691,0.0009344518,0.0010519566,0.0015435279,0.0014442084,0.00030557287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060730326,0.00006402167,0.00066965737,0.00007099398,0.000026035807,0.00007278194,0.00005250622,0.95337635,0.0013431963,0.0046721185,0.001574375,0.038017243],"study_design_scores_gemma":[0.000005195014,0.0000089229225,0.000037054986,0.000002229163,0.0000026678802,0.000004929153,0.0000043684036,0.9976675,0.00012012653,0.0019645938,0.00018045705,0.0000019620338],"about_ca_topic_score_codex":0.015576384,"about_ca_topic_score_gemma":0.014859975,"teacher_disagreement_score":0.015576384,"about_ca_system_score_codex":0.0016707829,"about_ca_system_score_gemma":0.0020178151,"threshold_uncertainty_score":0.030971467},"labels":[],"label_agreement":null},{"id":"W4352977279","doi":"10.1109/tnse.2023.3257034","title":"Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy Perspective","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipath TCP; Computer science; Network congestion; Energy consumption; Multipath propagation; Efficient energy use; Computer network; Throughput; Energy (signal processing); Distributed computing; Exploit; The Internet; Wireless; Engineering; Channel (broadcasting); Telecommunications; Network packet","score_opus":0.010976283743876167,"score_gpt":0.19715817908179847,"score_spread":0.18618189533792232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4352977279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2307016,0.0027021135,0.7617742,0.00050097314,0.000042945234,0.00009583524,0.00018145292,0.0009785496,0.0030223527],"genre_scores_gemma":[0.9576301,0.00086414587,0.040959854,0.000014550767,0.00002177891,0.00004565981,0.00008015564,0.00003068941,0.00035302335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993179,0.000151542,0.000029707331,0.0000961269,0.0003386605,0.00006609296],"domain_scores_gemma":[0.9989736,0.00049964804,0.00014792664,0.00013744376,0.00021223327,0.000029190522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093600684,0.00077079353,0.00048874965,0.0010529166,0.00025274904,0.0006442797,0.00076079054,0.0004828502,0.00033094655],"category_scores_gemma":[0.0030329393,0.00027122573,0.00026392538,0.001284759,0.00047089174,0.0012670212,0.0005314524,0.00065162766,0.000073057825],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002173466,0.00020468512,0.013158797,0.00017911875,0.00007498529,0.00010551451,0.00007821433,0.78619456,0.03483071,0.012899133,0.0008671263,0.15118976],"study_design_scores_gemma":[0.0000037595878,0.00008358142,0.0023916971,0.00000649079,0.000013499589,0.00004611431,0.000014436404,0.9859352,0.009481681,0.0015401033,0.00046833296,0.000015138618],"about_ca_topic_score_codex":0.004700047,"about_ca_topic_score_gemma":0.0026164749,"teacher_disagreement_score":0.004700047,"about_ca_system_score_codex":0.0010274687,"about_ca_system_score_gemma":0.00068759354,"threshold_uncertainty_score":0.009345353},"labels":[],"label_agreement":null},{"id":"W4376607524","doi":"10.1109/tnse.2023.3275971","title":"Remote State Estimation in Networked Systems: Data Pre-Processing or Not?","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Estimation; State (computer science); Algorithm; Engineering; Systems engineering","score_opus":0.022600852696794942,"score_gpt":0.25157812811378133,"score_spread":0.2289772754169864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047362536,0.008287757,0.9215657,0.010413875,0.0010669513,0.00010718594,0.00029523217,0.0015698044,0.009330913],"genre_scores_gemma":[0.8244758,0.007465995,0.15825915,0.0013011858,0.0015691787,0.00013863841,0.0006337147,0.00024726853,0.005909029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.00014864943,0.0000530397,0.00011515123,0.00021317146,0.00008279136],"domain_scores_gemma":[0.9952069,0.0026471522,0.0002909273,0.001033817,0.00071515783,0.000106100975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015275382,0.0006677181,0.0009874151,0.00046626193,0.00032206968,0.0014444855,0.0009852711,0.0010209958,0.0029824504],"category_scores_gemma":[0.009520988,0.00050007313,0.00038007164,0.0006275169,0.0010368421,0.0047774934,0.0007430823,0.0018214736,0.0011794425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007940738,0.0003551848,0.0067546144,0.0010470045,0.00016783566,0.00022726493,0.00025754236,0.053816326,0.024367336,0.035446435,0.012727482,0.8640389],"study_design_scores_gemma":[0.0001885311,0.00066460896,0.023882821,0.0008991949,0.00028121128,0.0006293232,0.0007486133,0.71841234,0.082683146,0.13434833,0.037048027,0.00021384124],"about_ca_topic_score_codex":0.0023539045,"about_ca_topic_score_gemma":0.00362507,"teacher_disagreement_score":0.0029824504,"about_ca_system_score_codex":0.00027783116,"about_ca_system_score_gemma":0.0011523212,"threshold_uncertainty_score":0.0099772215},"labels":[],"label_agreement":null},{"id":"W4376607588","doi":"10.1109/tnse.2023.3276166","title":"Patient-centric fine-grained access control for electronic medical record sharing with security via dual-blockchain","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Blockchain; Computer science; Access control; Dual (grammatical number); Computer security; Computer network","score_opus":0.00644647725320229,"score_gpt":0.2186550930677321,"score_spread":0.2122086158145298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082131885,0.00032915693,0.908511,0.0008967955,0.00012432813,0.00035670152,0.00028514222,0.0009111802,0.0064538303],"genre_scores_gemma":[0.96398497,0.000095114345,0.03310451,0.00008230675,0.000033379936,0.000101513804,0.00014367428,0.000026389791,0.0024282187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563545,0.0015731049,0.0003116416,0.0007021024,0.00108452,0.0006931586],"domain_scores_gemma":[0.9922522,0.0028847444,0.0006115528,0.002626785,0.0009255877,0.00069917686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005297445,0.00045405142,0.0012311079,0.0008121313,0.0012818767,0.0026558936,0.0024155546,0.0016096084,0.005680553],"category_scores_gemma":[0.008855813,0.00045653214,0.00048954296,0.0013016453,0.0019470878,0.0037413286,0.0055820583,0.0015516314,0.0009593643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027922902,0.0008173368,0.005566685,0.00037658674,0.00022900665,0.0011161473,0.001408016,0.38138,0.034723103,0.32680812,0.009313837,0.23546885],"study_design_scores_gemma":[0.0001308521,0.00021054602,0.00038329515,0.00003007326,0.00002844139,0.00023791668,0.00009540716,0.85379016,0.0054866257,0.13587095,0.0036950796,0.000040704526],"about_ca_topic_score_codex":0.0016871692,"about_ca_topic_score_gemma":0.0028840676,"teacher_disagreement_score":0.005680553,"about_ca_system_score_codex":0.0010822172,"about_ca_system_score_gemma":0.003919998,"threshold_uncertainty_score":0.028015912},"labels":[],"label_agreement":null},{"id":"W4379382325","doi":"10.1109/tnse.2023.3282870","title":"Quasi-Optimization of Resource Allocation and Positioning for Solar-Powered UAVs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Software deployment; Benchmark (surveying); Coordinate descent; Resource allocation; Throughput; Real-time computing; Optimization problem; Distributed computing; Communications system; Wireless; Computer network; Algorithm; Telecommunications","score_opus":0.007299010370804264,"score_gpt":0.199898038563292,"score_spread":0.19259902819248773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379382325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09285522,0.0008686589,0.8956646,0.00050609285,0.000104209284,0.00008881029,0.0001717721,0.00026374846,0.009476866],"genre_scores_gemma":[0.9139096,0.0003119699,0.08114723,0.00012080759,0.000029955521,0.00012188161,0.00010516927,0.000055091066,0.004198248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997273,0.00010714464,0.0000075617777,0.000053913544,0.000046226316,0.000057872898],"domain_scores_gemma":[0.99930036,0.00046649764,0.00008405679,0.0000301402,0.00008496907,0.000033991888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065083266,0.000754862,0.00080271205,0.00027522873,0.00034682284,0.0007981205,0.00058902096,0.00088684366,0.0019729799],"category_scores_gemma":[0.0017919281,0.00036619484,0.0003754289,0.0005070137,0.0006754336,0.0005176646,0.0005669208,0.00055148796,0.0002571817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003816588,0.000012297928,0.00022399182,0.000022870929,0.000011785931,0.000025633748,0.000012498814,0.99273115,0.0005341477,0.0025501119,0.0004551966,0.0033821983],"study_design_scores_gemma":[0.0000061525116,0.000012871282,0.00006858771,0.0000017528087,0.000002143375,0.000004034508,0.000005239317,0.99921405,0.00010816882,0.0004610953,0.00011437518,0.0000015133417],"about_ca_topic_score_codex":0.011150294,"about_ca_topic_score_gemma":0.005764571,"teacher_disagreement_score":0.011150294,"about_ca_system_score_codex":0.0010119564,"about_ca_system_score_gemma":0.0011148693,"threshold_uncertainty_score":0.022170782},"labels":[],"label_agreement":null},{"id":"W4383340492","doi":"10.1109/tnse.2023.3293053","title":"Software Defined Networking Assisted Electric Vehicle Charging: Towards Smart Charge Scheduling and Management","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Electric Vehicles and Infrastructure","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":"Brandon University","funders":"","keywords":"Scheduling (production processes); Computer science; Software; Electric vehicle; Electrical engineering; Embedded system; Engineering; Power (physics); Operating system; Physics","score_opus":0.010383504853184235,"score_gpt":0.19918456884344046,"score_spread":0.18880106399025623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383340492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04513136,0.0014655059,0.9453302,0.00063572015,0.0002365615,0.0000671041,0.000066112465,0.0016412622,0.005426185],"genre_scores_gemma":[0.8752298,0.0008615162,0.12103762,0.00024790427,0.00009053837,0.000062559324,0.0002330129,0.00006406462,0.0021729923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996313,0.00008154931,0.00002265305,0.00007061308,0.0001417218,0.000052206244],"domain_scores_gemma":[0.9997018,0.00006178543,0.0000369076,0.00004957999,0.00012392865,0.000025868525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056887564,0.0003993046,0.0002887694,0.00030844184,0.00023589638,0.0007401137,0.0008952505,0.0003411921,0.00047456898],"category_scores_gemma":[0.00085420435,0.00011394818,0.00019986133,0.00043464813,0.00021244207,0.0008894899,0.0006108356,0.0005974,0.00014529053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030069798,0.00025861934,0.0039677816,0.00021274015,0.00007778694,0.00014238512,0.00015907583,0.35462016,0.02835643,0.031051569,0.0087582925,0.5720945],"study_design_scores_gemma":[0.000012777922,0.00004607048,0.0003223173,0.000008712173,0.000009088805,0.00004560414,0.000029187766,0.9826187,0.005224299,0.005732667,0.00594217,0.00000834365],"about_ca_topic_score_codex":0.0032378247,"about_ca_topic_score_gemma":0.0027082865,"teacher_disagreement_score":0.0032378247,"about_ca_system_score_codex":0.0005026066,"about_ca_system_score_gemma":0.0008558317,"threshold_uncertainty_score":0.0064379573},"labels":[],"label_agreement":null},{"id":"W4384789936","doi":"10.1109/tnse.2023.3296511","title":"Delay-Optimized Multi-User VR Streaming via End-Edge Collaborative Neural Frame Interpolation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor; Memorial University of Newfoundland; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Interpolation (computer graphics); Frame (networking); Frame rate; Enhanced Data Rates for GSM Evolution; Motion interpolation; Queueing theory; Real-time computing; Virtual reality; Computer vision; Artificial intelligence; Computer network; Video processing; Video tracking","score_opus":0.017820136289594817,"score_gpt":0.27167293791619335,"score_spread":0.2538528016265985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384789936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05302594,0.0001661599,0.94424677,0.00007100761,0.00003769877,0.000046567842,0.00002749015,0.0004996238,0.0018787561],"genre_scores_gemma":[0.8759768,0.0001444007,0.12156038,0.000049585466,0.0000376271,0.000047746904,0.00006644076,0.00003732139,0.0020796917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995431,0.00008334149,0.000024704488,0.00011753055,0.00015905507,0.00007240136],"domain_scores_gemma":[0.9995296,0.00017903981,0.00005186865,0.00005788099,0.0001360143,0.00004563566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047597048,0.0006088124,0.0005969529,0.00032946287,0.00048487174,0.0005784164,0.0011549697,0.00050694146,0.0015032493],"category_scores_gemma":[0.0011537739,0.00023192665,0.00034249094,0.00030793413,0.00026128496,0.001037218,0.0009251138,0.0006072564,0.00023111499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013456491,0.00044794162,0.0020625258,0.00018712756,0.00007976529,0.0006167409,0.00030908454,0.5355562,0.1279398,0.011426388,0.0024907833,0.31753802],"study_design_scores_gemma":[0.00001167977,0.0000792299,0.0001598168,0.000002180534,0.000008156438,0.0000585988,0.000014967687,0.99184,0.0067458553,0.0007299753,0.00034068493,0.000008872231],"about_ca_topic_score_codex":0.002967382,"about_ca_topic_score_gemma":0.0031903805,"teacher_disagreement_score":0.002967382,"about_ca_system_score_codex":0.0005245818,"about_ca_system_score_gemma":0.00055330945,"threshold_uncertainty_score":0.005900204},"labels":[],"label_agreement":null},{"id":"W4385327002","doi":"10.1109/tnse.2023.3299462","title":"Game Theoretical Incentive for USV Fleet-Assisted Data Sharing in Maritime Communication Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Bidding; Computer science; Data sharing; Incentive; Computer network; Network packet; Game theory; Data modeling; Operations research; Database; Engineering; Business; Economics","score_opus":0.022124644202420548,"score_gpt":0.24924678555034502,"score_spread":0.22712214134792447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385327002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035693128,0.00041763647,0.9517991,0.0006607654,0.000122003665,0.00016854821,0.00012522166,0.00012195051,0.010891568],"genre_scores_gemma":[0.93943524,0.00041630762,0.053938102,0.00016686069,0.000059087022,0.00025461498,0.00009815813,0.000031553856,0.005600037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998285,0.0007917409,0.000064988744,0.00026012835,0.00033566746,0.0002624733],"domain_scores_gemma":[0.9982116,0.0010245136,0.0002079731,0.000107166015,0.00025064108,0.0001980472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019415997,0.000971733,0.00117337,0.00082963903,0.00095548516,0.0016304532,0.0024371766,0.0016556911,0.0033081938],"category_scores_gemma":[0.004463205,0.00048460005,0.0008126318,0.0010907546,0.0014972579,0.0024296064,0.002075414,0.0017733402,0.00031787617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013653135,0.00009127307,0.0005264368,0.0001088145,0.000035654324,0.00026724572,0.00014711192,0.78896767,0.0019864729,0.18803816,0.0025142906,0.01718036],"study_design_scores_gemma":[0.000014775609,0.000025005338,0.000060495582,0.000005600081,0.0000048501092,0.000033419798,0.00001977772,0.9768053,0.00013272896,0.022027245,0.00086174434,0.000009025656],"about_ca_topic_score_codex":0.006195256,"about_ca_topic_score_gemma":0.004358693,"teacher_disagreement_score":0.006195256,"about_ca_system_score_codex":0.002701175,"about_ca_system_score_gemma":0.0024042,"threshold_uncertainty_score":0.019598484},"labels":[],"label_agreement":null},{"id":"W4385486134","doi":"10.1109/tnse.2023.3301402","title":"A Quantum-Inspired Sensor Consolidation Measurement Approach for Cyber-Physical Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Scalability; Node (physics); Distributed computing; Real-time computing; Computer network; Engineering","score_opus":0.0330769608544508,"score_gpt":0.2292855689021431,"score_spread":0.1962086080476923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385486134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01717742,0.0001745458,0.97936743,0.00017865369,0.000037972615,0.000040184103,0.000020842648,0.00025790193,0.002745107],"genre_scores_gemma":[0.87213826,0.00020127499,0.12534636,0.0001512764,0.000029186482,0.00012122488,0.000045636818,0.00005540074,0.0019113502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.000096989475,0.000017927463,0.00009281865,0.0001273177,0.00005259575],"domain_scores_gemma":[0.9994968,0.00019226375,0.00008113212,0.00008855235,0.000099379286,0.000041854866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504091,0.0004295777,0.00054338214,0.00035923216,0.00054113095,0.0007482059,0.0013140824,0.0005683635,0.0016350959],"category_scores_gemma":[0.0015568918,0.0002566619,0.0005125737,0.00041413092,0.0010773429,0.0015718709,0.0014142353,0.0008587599,0.00019114149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007457334,0.0000664773,0.0012937417,0.00008365139,0.000033597775,0.0000921218,0.000121330864,0.87460405,0.012484887,0.0640688,0.0009509244,0.046125874],"study_design_scores_gemma":[0.0000040339614,0.000023895202,0.000095064366,0.0000027767217,0.000004813129,0.000013516223,0.000008097496,0.9921948,0.001006865,0.006153542,0.00048731966,0.000005240756],"about_ca_topic_score_codex":0.002858042,"about_ca_topic_score_gemma":0.0027902487,"teacher_disagreement_score":0.002858042,"about_ca_system_score_codex":0.0010605641,"about_ca_system_score_gemma":0.0011996215,"threshold_uncertainty_score":0.0076949596},"labels":[],"label_agreement":null},{"id":"W4386025640","doi":"10.1109/tnse.2023.3306202","title":"To Compute or Not to Compute? Adaptive Smart Sensing in Resource-Constrained Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Agencia Estatal de Investigación; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Dipartimenti di Eccellenza","keywords":"Computer science; Wireless sensor network; Computation; Edge computing; Signal processing; Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Algorithm; Computer hardware; Computer network; Digital signal processing","score_opus":0.018368153339251715,"score_gpt":0.2298125842803477,"score_spread":0.211444430941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386025640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056145757,0.0010371,0.9315742,0.0024206624,0.00013254044,0.00006200037,0.0001120304,0.00016646775,0.00834915],"genre_scores_gemma":[0.93548864,0.0010025378,0.058401633,0.00032476074,0.00014095486,0.00008632864,0.000052272062,0.000059743383,0.0044431016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991086,0.00032336338,0.000029595221,0.000215569,0.00015159568,0.00017126922],"domain_scores_gemma":[0.9980572,0.0013741291,0.00017526171,0.00013246667,0.00015269945,0.0001083363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013490167,0.00077352236,0.00075574254,0.0002887105,0.00058600336,0.0015091541,0.0014799724,0.0015262935,0.0019560365],"category_scores_gemma":[0.004655525,0.0004558192,0.00043166894,0.0006449331,0.0017517162,0.002668911,0.0012852191,0.0013234932,0.00018835925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013026784,0.000047439004,0.00059864385,0.00007296967,0.000023964483,0.00017694493,0.00008453578,0.85791165,0.0013011104,0.12611783,0.0013106101,0.012224066],"study_design_scores_gemma":[0.000008081795,0.000017780689,0.00010179434,0.000005304378,0.0000058229257,0.000016013619,0.000023694396,0.9753981,0.00025451026,0.02360793,0.00055377436,0.000007257378],"about_ca_topic_score_codex":0.0066428715,"about_ca_topic_score_gemma":0.0055203624,"teacher_disagreement_score":0.0066428715,"about_ca_system_score_codex":0.0012549297,"about_ca_system_score_gemma":0.0010354621,"threshold_uncertainty_score":0.013208449},"labels":[],"label_agreement":null},{"id":"W4386321977","doi":"10.1109/tnse.2023.3310811","title":"Block and Transaction Delivery in Ethereum Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Peer-to-Peer Network Technologies","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Block (permutation group theory); Node (physics); Database transaction; Computer network; Eclipse; Hash function; Computer security; Database; Engineering; Mathematics","score_opus":0.012077493174440347,"score_gpt":0.21203694930377123,"score_spread":0.1999594561293309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386321977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1663985,0.0008951106,0.8132913,0.0009917982,0.0000572421,0.0002119436,0.00054221455,0.0005619121,0.017049916],"genre_scores_gemma":[0.9412773,0.00084836216,0.04158221,0.0001578292,0.000035414152,0.00023338906,0.00024463815,0.00008047546,0.015540408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990018,0.00027158993,0.000038058937,0.00017714052,0.00032884863,0.00018262399],"domain_scores_gemma":[0.9985965,0.00068316393,0.00023467316,0.00013925727,0.00026960275,0.00007680344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015714759,0.0006185206,0.0007629836,0.0011871199,0.0007191885,0.0012340477,0.0021857342,0.0011335188,0.003322406],"category_scores_gemma":[0.0048237504,0.0004253981,0.0004381817,0.0011408487,0.00096026954,0.0038367184,0.0011711947,0.0007369144,0.00068256276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013798378,0.000044541262,0.0012403497,0.000049128128,0.000017032848,0.00030306287,0.00014985813,0.85243404,0.0025628132,0.13047081,0.0017354123,0.010855029],"study_design_scores_gemma":[0.000007117241,0.000016709168,0.00010111777,0.0000043191394,0.0000034835844,0.000047029553,0.000018172588,0.99101394,0.00035881117,0.007510122,0.0009135386,0.000005565297],"about_ca_topic_score_codex":0.00997323,"about_ca_topic_score_gemma":0.005144453,"teacher_disagreement_score":0.00997323,"about_ca_system_score_codex":0.002989017,"about_ca_system_score_gemma":0.001406795,"threshold_uncertainty_score":0.021686971},"labels":[],"label_agreement":null},{"id":"W4386473147","doi":"10.1109/tnse.2023.3312369","title":"Intelligent Content Caching and User Association in Mobile Edge Computing Networks for Smart Cities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University","funders":"Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Computer science; Latency (audio); Computer network; Association (psychology); Enhanced Data Rates for GSM Evolution; Handover; Frame (networking); Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.0219091136189821,"score_gpt":0.22182303068734469,"score_spread":0.1999139170683626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24757889,0.00075918675,0.7493868,0.0005608516,0.000030005596,0.000058681413,0.000048387865,0.0002302078,0.0013470133],"genre_scores_gemma":[0.9747679,0.0001859732,0.024305316,0.000042314106,0.000011760853,0.00001796527,0.000028805065,0.000016377451,0.00062364014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991264,0.00033699902,0.00003457336,0.00016753882,0.00012450154,0.00021007784],"domain_scores_gemma":[0.9987935,0.00063674164,0.00020542182,0.000116851195,0.00015617297,0.00009126053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012240887,0.00045457826,0.00087449147,0.0003675461,0.0006827576,0.0010425345,0.0011048396,0.00101725,0.00048706002],"category_scores_gemma":[0.0034408777,0.00042109212,0.00041171737,0.0010010866,0.00072241185,0.002147316,0.0008855171,0.0007100219,0.00008840217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001334855,0.000106672975,0.00371825,0.000048290363,0.000043248747,0.00014916684,0.00012414422,0.9391298,0.0050187325,0.019896017,0.00087757845,0.03075457],"study_design_scores_gemma":[0.000003413946,0.000013284921,0.00020504853,0.0000011875757,0.0000067226347,0.000015368332,0.000020090112,0.9968712,0.00040220094,0.0023325172,0.00012488726,0.000004175588],"about_ca_topic_score_codex":0.01481955,"about_ca_topic_score_gemma":0.015863977,"teacher_disagreement_score":0.01481955,"about_ca_system_score_codex":0.002247968,"about_ca_system_score_gemma":0.0016169355,"threshold_uncertainty_score":0.029466629},"labels":[],"label_agreement":null},{"id":"W4386885153","doi":"10.1109/tnse.2023.3293694","title":"Guest Editorial Introduction to the Special Section on AI-Driven Cybersecurity for Healthcare Cyber Physical Systems","year":2023,"lang":"en","type":"editorial","venue":"IEEE Transactions on Network Science and Engineering","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Health care; Cyber-physical system; Wearable computer; Internet of Things; Computer science; Special section; Healthcare service; Healthcare industry; Computer security; Wearable technology; Healthcare system; System integration; Embedded system; Engineering","score_opus":0.033010978026091674,"score_gpt":0.3422426832102449,"score_spread":0.30923170518415327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386885153","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.000018729976,0.0044074636,0.00013295666,0.019113204,0.97508174,0.000013771924,0.000029985382,0.000041398933,0.0011607513],"genre_scores_gemma":[0.00020834254,0.003542021,0.000069554524,0.010592779,0.98157805,0.000013500744,0.000020304122,0.000026248037,0.0039492664],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996897,0.00038377446,0.0003374083,0.00048712848,0.0016290928,0.00026568884],"domain_scores_gemma":[0.98419106,0.00547332,0.0008305933,0.00034629446,0.0062483232,0.0029104282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988865,0.003347188,0.0032326046,0.0033885608,0.0025440787,0.008281399,0.003011401,0.012858378,0.02260415],"category_scores_gemma":[0.016586846,0.00094043475,0.0025205908,0.0011971764,0.002292715,0.0047445176,0.0017791511,0.020081576,0.017233787],"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.000025772786,0.000010652567,0.00002107274,0.00018448135,0.000010386763,0.000122821,0.000009905819,0.000024450286,0.000050320483,0.0003462643,0.9942946,0.004899181],"study_design_scores_gemma":[0.000053276213,0.000038936916,0.00018426513,0.00042711198,0.00003851938,0.0005177406,0.00003052916,0.00019451107,0.000103945116,0.001396713,0.9969934,0.000021086578],"about_ca_topic_score_codex":0.0010015325,"about_ca_topic_score_gemma":0.0024817819,"teacher_disagreement_score":0.02260415,"about_ca_system_score_codex":0.0022867443,"about_ca_system_score_gemma":0.0021620987,"threshold_uncertainty_score":0.075618386},"labels":[],"label_agreement":null},{"id":"W4387319234","doi":"10.1109/tnse.2023.3321764","title":"Age of Information Minimization for UAV-Assisted Internet of Things Networks: A Safe Actor-Critic With Policy Distillation Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leverage (statistics); Computer science; Markov decision process; Lyapunov optimization; Network packet; Real-time computing; Mathematical optimization; Markov process; Computer network; Artificial intelligence","score_opus":0.009114273383029723,"score_gpt":0.20600705112653353,"score_spread":0.1968927777435038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019945702,0.0005596211,0.97456115,0.00061336346,0.00009839784,0.000050755116,0.00006234788,0.00025806026,0.003850521],"genre_scores_gemma":[0.9456868,0.0003292279,0.04960603,0.00030693534,0.00008341692,0.00013183084,0.000119606884,0.00009264353,0.0036435155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00021835731,0.00002998274,0.00015249453,0.00012616611,0.00010804596],"domain_scores_gemma":[0.99776304,0.0015554581,0.00025356765,0.00007565877,0.00023419237,0.0001180188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557855,0.0015836254,0.0013369501,0.00050203106,0.00039128796,0.0011081015,0.0010443949,0.0013265661,0.0014602628],"category_scores_gemma":[0.0033729975,0.0006650238,0.0006109556,0.00040921097,0.0011919502,0.0010893279,0.0014994629,0.0020288485,0.00022479135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059691956,0.000021340835,0.0003293416,0.00004309298,0.000025671108,0.00006622128,0.000033158845,0.9842753,0.0006188924,0.0068590916,0.00046783054,0.0072003207],"study_design_scores_gemma":[0.0000047700837,0.000011491513,0.000025508141,0.000004073374,0.000003932485,0.0000047103044,0.0000035376218,0.99758685,0.00013056576,0.0020975803,0.00012467812,0.0000022242348],"about_ca_topic_score_codex":0.0052538826,"about_ca_topic_score_gemma":0.0043238853,"teacher_disagreement_score":0.0052538826,"about_ca_system_score_codex":0.0011303384,"about_ca_system_score_gemma":0.001744105,"threshold_uncertainty_score":0.010446608},"labels":[],"label_agreement":null},{"id":"W4387448582","doi":"10.1109/tnse.2023.3322495","title":"Locational Marginal Carbon Emission of Power Grids Approach: Optimal Scheduling of Recycling Electricity/Heat Rural Supply System Based on Waste Feedstock","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Integrated Energy Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Renewable energy; Waste heat; Electricity generation; Energy supply; Environmental science; Waste management; Electricity; Process engineering; Environmental engineering; Heat exchanger; Engineering; Power (physics); Energy (signal processing); Electrical engineering","score_opus":0.005863149553416595,"score_gpt":0.18328133068721333,"score_spread":0.17741818113379673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387448582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15635459,0.00042379758,0.82491547,0.00047000218,0.00006978002,0.00011679402,0.00018346823,0.0003057963,0.017160373],"genre_scores_gemma":[0.98242086,0.00010683813,0.015196814,0.000024985598,0.000012026926,0.00003879216,0.000038710263,0.00003310338,0.0021277939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998104,0.00007222835,0.0000058345863,0.0000356182,0.000034665096,0.0000412583],"domain_scores_gemma":[0.99980754,0.00007781207,0.000035831137,0.000010464533,0.0000457229,0.000022595073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039737576,0.00067789777,0.0006660888,0.00037945074,0.00037533874,0.0008451967,0.0006498682,0.00047180042,0.002360221],"category_scores_gemma":[0.00065412157,0.0003477706,0.00039166652,0.00048017615,0.00041539557,0.0005595418,0.0004582738,0.00045444217,0.00013487748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028251734,0.000011004851,0.00017004844,0.000014890571,0.000008061594,0.000021228354,0.000010024667,0.99456465,0.00035803876,0.0021694105,0.00016778354,0.0024765157],"study_design_scores_gemma":[0.0000034193142,0.00001187502,0.00006687071,0.0000011170087,0.0000035395897,0.0000030230012,0.0000083421355,0.99888545,0.00010782555,0.0008065105,0.00010052948,0.00000155827],"about_ca_topic_score_codex":0.013213238,"about_ca_topic_score_gemma":0.012407461,"teacher_disagreement_score":0.013213238,"about_ca_system_score_codex":0.0013884571,"about_ca_system_score_gemma":0.0012914699,"threshold_uncertainty_score":0.026272655},"labels":[],"label_agreement":null},{"id":"W4387546305","doi":"10.1109/tnse.2023.3321833","title":"Controlling Networks of Imitative Agents","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"European Research Council","keywords":"Stochastic game; Incentive; Computer science; Convergence (economics); Imitation; Mathematical optimization; Asynchronous communication; Range (aeronautics); Mathematical economics; Mathematics; Economics; Microeconomics; Engineering","score_opus":0.0193124270948694,"score_gpt":0.26670468567532846,"score_spread":0.24739225858045905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387546305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14345367,0.000313377,0.84319204,0.0004279587,0.00007849787,0.00008127137,0.000051578838,0.0005043048,0.011897286],"genre_scores_gemma":[0.95833457,0.00019196002,0.03771691,0.000058313082,0.000031605105,0.0001259206,0.000028431185,0.00003699447,0.0034752823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938536,0.00020901205,0.00002686891,0.00017313041,0.00012299167,0.00008263793],"domain_scores_gemma":[0.9971765,0.0015150683,0.00061515946,0.00027641736,0.00019681283,0.00022001794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872912,0.0005482595,0.0004974161,0.0005164519,0.0005610155,0.0011698322,0.0013797008,0.0007788208,0.0018152731],"category_scores_gemma":[0.0071238168,0.00031927574,0.00032767706,0.00039365233,0.0012438139,0.0017387411,0.0015377334,0.0007709952,0.00033962153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010228629,0.00004673683,0.0013623607,0.000068740235,0.000042651754,0.000118844546,0.00018200885,0.8760016,0.0084441025,0.08696327,0.00087294204,0.025794452],"study_design_scores_gemma":[0.000014334526,0.000030810203,0.00018453764,0.000006235402,0.000008125807,0.000023368726,0.000022076165,0.9783101,0.0011129113,0.01928726,0.00099358,0.00000660248],"about_ca_topic_score_codex":0.001652753,"about_ca_topic_score_gemma":0.0013259067,"teacher_disagreement_score":0.0018152731,"about_ca_system_score_codex":0.0009092916,"about_ca_system_score_gemma":0.00050315016,"threshold_uncertainty_score":0.0065974593},"labels":[],"label_agreement":null},{"id":"W4387623823","doi":"10.1109/tnse.2023.3321644","title":"Online Service Deployment on Mega-LEO Satellite Constellations for End-to-End Delay Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China","keywords":"End-to-end principle; Constellation; Software deployment; Satellite; Computer science; Computer network; Mega-; Satellite constellation; Service (business); Telecommunications; Engineering; Aerospace engineering; Business; Physics","score_opus":0.0312483785605829,"score_gpt":0.25290611280023406,"score_spread":0.22165773423965116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387623823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17352828,0.00055928156,0.8218301,0.00045469485,0.00010920129,0.0000746292,0.000081677,0.00029246617,0.0030696176],"genre_scores_gemma":[0.97454417,0.00019346422,0.024120295,0.00005098973,0.000024160217,0.000027213613,0.0000403907,0.000017213866,0.0009819716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994375,0.0001748322,0.00001747321,0.000097703145,0.00009863401,0.00017381742],"domain_scores_gemma":[0.99874806,0.0007182636,0.0001671196,0.00007393536,0.00012746605,0.00016505056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008707681,0.00072085176,0.0008368842,0.00032058818,0.00057868025,0.00068328454,0.00078495767,0.00064867456,0.0016886356],"category_scores_gemma":[0.0022262924,0.0002592408,0.0003908959,0.0006551738,0.0006687428,0.00091817084,0.0010406198,0.0009351603,0.00017520682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014059803,0.000060037026,0.0006986066,0.000041150175,0.000017017564,0.00013246287,0.00004509969,0.9717781,0.002785229,0.0066385698,0.0008281551,0.016835006],"study_design_scores_gemma":[0.0000034760956,0.000027701895,0.00007950389,0.0000012664873,0.0000035187886,0.00001579295,0.000012132488,0.99856704,0.0003004371,0.00085925066,0.0001279211,0.0000019358258],"about_ca_topic_score_codex":0.0064764274,"about_ca_topic_score_gemma":0.0062529524,"teacher_disagreement_score":0.0064764274,"about_ca_system_score_codex":0.0013155199,"about_ca_system_score_gemma":0.0011986637,"threshold_uncertainty_score":0.012877464},"labels":[],"label_agreement":null},{"id":"W4388430426","doi":"10.1109/tnse.2023.3330437","title":"Event-Triggered Stochastic Model Predictive Control for Constrained Queueing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Layered queueing network; Mathematical optimization; Model predictive control; Queue; Scheduling (production processes); Markov chain; Discrete event simulation; Network packet; Network topology; Mathematics; Computer network; Control (management); Simulation","score_opus":0.007123635811867821,"score_gpt":0.2074047608708064,"score_spread":0.20028112505893858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388430426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015160797,0.00027730732,0.98166865,0.00015126004,0.00007543816,0.000036736987,0.00004675609,0.00028502013,0.002297981],"genre_scores_gemma":[0.97403246,0.0002770991,0.023834618,0.00006160816,0.00004369981,0.00010726777,0.00007118144,0.000025058793,0.0015469417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950254,0.00014498054,0.00002045637,0.00009430035,0.00016423374,0.0000735041],"domain_scores_gemma":[0.99939275,0.0003313505,0.00009558751,0.000030951232,0.00011746615,0.000031879812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007159935,0.0008345335,0.000906986,0.000307233,0.00045666684,0.0009945101,0.0011394074,0.0007210541,0.0010470429],"category_scores_gemma":[0.0014609527,0.00031988387,0.0005258146,0.00052693393,0.0006740379,0.00051796495,0.0007335096,0.0010986971,0.000090905145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022416822,0.00001222102,0.000067351975,0.000022241928,0.0000084806225,0.000028038723,0.000013382237,0.98912865,0.00071989215,0.0049118935,0.00018929254,0.004876272],"study_design_scores_gemma":[0.0000019107874,0.000004664813,0.000012644869,6.409003e-7,9.726463e-7,0.0000011959055,6.3657774e-7,0.99937207,0.00007125575,0.0004789819,0.00005405869,9.546573e-7],"about_ca_topic_score_codex":0.013264529,"about_ca_topic_score_gemma":0.0071571926,"teacher_disagreement_score":0.013264529,"about_ca_system_score_codex":0.0009964748,"about_ca_system_score_gemma":0.0014228311,"threshold_uncertainty_score":0.026374638},"labels":[],"label_agreement":null},{"id":"W4388692222","doi":"10.1109/tnse.2023.3332949","title":"Computation Offloading for Edge Intelligence in Two-Tier Heterogeneous Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Beijing Municipality; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Computation offloading; Computation; Enhanced Data Rates for GSM Evolution; Heterogeneous network; Edge computing; Distributed computing; Computer network; Artificial intelligence; Wireless network; Wireless; Algorithm; Telecommunications","score_opus":0.018310496507113787,"score_gpt":0.26056536094053606,"score_spread":0.24225486443342228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388692222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12025223,0.0006924726,0.8730586,0.00026696816,0.0001045959,0.000061659695,0.000058012265,0.0005603521,0.004945135],"genre_scores_gemma":[0.9726335,0.00016085361,0.025928188,0.00009849941,0.000028520577,0.000030784766,0.000046248504,0.000032061136,0.0010413707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940753,0.00010828205,0.000023842234,0.00014224614,0.00011971793,0.00019836807],"domain_scores_gemma":[0.9994423,0.0002171417,0.000053483065,0.00010016481,0.00010911949,0.00007780115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259106,0.00075866166,0.00070105045,0.0003561983,0.0008254597,0.0011944221,0.0011015199,0.00045262728,0.0011428108],"category_scores_gemma":[0.0013951468,0.00022980012,0.0003547786,0.00054055796,0.0005172503,0.0016982438,0.0012709759,0.00065035926,0.0001712726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005572686,0.0002805211,0.0031171034,0.00014968174,0.000057643705,0.0004995619,0.00026141256,0.81224257,0.01619536,0.018922655,0.0038069,0.14390935],"study_design_scores_gemma":[0.000005046635,0.000029941259,0.0001713707,0.0000023357902,0.0000063251255,0.000030355477,0.000024981955,0.9946898,0.001182772,0.0035702405,0.00028231277,0.000004553714],"about_ca_topic_score_codex":0.004088557,"about_ca_topic_score_gemma":0.0053533292,"teacher_disagreement_score":0.004088557,"about_ca_system_score_codex":0.0006993532,"about_ca_system_score_gemma":0.0007916654,"threshold_uncertainty_score":0.0081294775},"labels":[],"label_agreement":null},{"id":"W4390075422","doi":"10.1109/tnse.2023.3344158","title":"Delay Impact on Stubborn Mining Attack Severity in Imperfect Bitcoin Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Imperfect; Computer science; Computer security; Revenue; Throughput; Block (permutation group theory); Blockchain; Proof-of-work system; Business; Telecommunications; Mathematics","score_opus":0.01214556537060496,"score_gpt":0.24766181966256426,"score_spread":0.2355162542919593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075422","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.93908966,0.0007831909,0.054506935,0.00047017116,0.000067923465,0.00006349835,0.00021917016,0.00026626457,0.0045330836],"genre_scores_gemma":[0.99902225,0.00009130468,0.00064002775,0.000013776258,0.000004535361,0.0000069562134,0.000028011733,0.000008159827,0.00018503866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976292,0.00069393497,0.00013465187,0.00034035696,0.0005108956,0.0006909376],"domain_scores_gemma":[0.97426796,0.016538544,0.004216275,0.0015072216,0.0023954897,0.0010744418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033398708,0.0006257855,0.0006070455,0.0011296866,0.00077671104,0.0014263543,0.0008451351,0.00069814286,0.0018855185],"category_scores_gemma":[0.020516708,0.00022336355,0.0003100454,0.00093149266,0.001384461,0.0037802446,0.0013896418,0.0011853786,0.00015593061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012314855,0.00018539984,0.02350551,0.00021988763,0.00010033527,0.0008923366,0.0003716272,0.90258586,0.013107477,0.03320817,0.001595306,0.02299654],"study_design_scores_gemma":[0.000031768006,0.00040013195,0.0054863133,0.000035042154,0.00006751319,0.00035492773,0.0004406853,0.9730982,0.0072029354,0.012384179,0.00044908572,0.00004915916],"about_ca_topic_score_codex":0.003860718,"about_ca_topic_score_gemma":0.0023245898,"teacher_disagreement_score":0.003860718,"about_ca_system_score_codex":0.002214108,"about_ca_system_score_gemma":0.0012894056,"threshold_uncertainty_score":0.017663121},"labels":[],"label_agreement":null},{"id":"W4390284921","doi":"10.1109/tnse.2023.3347512","title":"HCAAC: Hybrid Channel Access by Admission and Contention in Wi-Fi Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":0,"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":"Jiangsu Provincial Key Research and Development Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Retransmission; Network packet; Computer science; Computer network; Latency (audio); Channel (broadcasting); Low latency (capital markets); Telecommunications","score_opus":0.017311819245880874,"score_gpt":0.24900422363901903,"score_spread":0.23169240439313815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390284921","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.19371167,0.002035605,0.7969664,0.00047661856,0.00025849327,0.00032912267,0.000063706786,0.0014317537,0.0047266535],"genre_scores_gemma":[0.97542715,0.0001914697,0.023468837,0.00006319688,0.000052845335,0.000070514725,0.000017244982,0.000013611961,0.0006951786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815494,0.00046941606,0.0000644746,0.00015886282,0.0005768863,0.0005753847],"domain_scores_gemma":[0.9974113,0.0011926393,0.00031718283,0.00031904524,0.00050357607,0.00025627157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017034537,0.00064338045,0.0007191042,0.0010794053,0.001482822,0.0014304072,0.0017599628,0.0007450819,0.0008353585],"category_scores_gemma":[0.0037036163,0.00024717653,0.0003641439,0.0011499105,0.0016153875,0.0010428549,0.0016310883,0.0009206824,0.00011885947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064731075,0.00041579007,0.004453739,0.000162242,0.00015157442,0.0006547812,0.00035795334,0.69160175,0.0722992,0.04694341,0.003245403,0.17906691],"study_design_scores_gemma":[0.00002975393,0.00014119844,0.0005156537,0.0000075307958,0.000024477064,0.00013632706,0.000042867076,0.98801696,0.0061621075,0.003757044,0.0011258638,0.0000401316],"about_ca_topic_score_codex":0.01173524,"about_ca_topic_score_gemma":0.008811479,"teacher_disagreement_score":0.01173524,"about_ca_system_score_codex":0.001523032,"about_ca_system_score_gemma":0.0023691412,"threshold_uncertainty_score":0.023333848},"labels":[],"label_agreement":null},{"id":"W4391020482","doi":"10.1109/tnse.2024.3354792","title":"Distributed Learning of Unknown Games for HetNet Selection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Selection (genetic algorithm); Heterogeneous network; Computer science; A priori and a posteriori; Artificial intelligence; Wireless network; Wireless","score_opus":0.007659775598852182,"score_gpt":0.21711672986158737,"score_spread":0.2094569542627352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391020482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023212835,0.0007995746,0.9624897,0.001355785,0.00020506808,0.00019177531,0.00031345073,0.00036856465,0.011063221],"genre_scores_gemma":[0.8654294,0.0011373986,0.105216,0.00092944765,0.00044655605,0.0009237102,0.0008941352,0.00018132625,0.024842095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783415,0.00088424317,0.00009256838,0.0005560439,0.00024672993,0.00038636],"domain_scores_gemma":[0.98198503,0.01512087,0.0008840953,0.00048078777,0.0008196418,0.0007096636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038431226,0.0019415295,0.0033348256,0.0010775211,0.0011121999,0.0023840386,0.0028571207,0.002785124,0.008556942],"category_scores_gemma":[0.01714883,0.0010827106,0.0013456495,0.0009817998,0.0026194656,0.0026818246,0.003242465,0.003764394,0.00094531407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017214622,0.00009933164,0.0011113822,0.00014315861,0.00007559895,0.00013874681,0.00012589023,0.8974861,0.00028789064,0.08035082,0.003906329,0.016102573],"study_design_scores_gemma":[0.000036216737,0.000021127677,0.00008479132,0.000010844008,0.0000099762965,0.000011759334,0.000018513867,0.97028226,0.000061516046,0.028964788,0.00048933766,0.000008977353],"about_ca_topic_score_codex":0.007444545,"about_ca_topic_score_gemma":0.008847251,"teacher_disagreement_score":0.008556942,"about_ca_system_score_codex":0.0028404465,"about_ca_system_score_gemma":0.002709205,"threshold_uncertainty_score":0.028625786},"labels":[],"label_agreement":null},{"id":"W4392979805","doi":"10.1109/tnse.2024.3379552","title":"Packet Routing and Energy Cooperation for RTU Satellite-Terrestrial Multi-Hop Network in Remote Cyber-Physical Power System","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Network packet; Relay; Routing protocol; Communications satellite; Throughput; Real-time computing; Wireless; Satellite; Telecommunications; Engineering; Power (physics)","score_opus":0.01859291573768701,"score_gpt":0.24176938848879168,"score_spread":0.22317647275110467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392979805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06799024,0.0004652227,0.9282653,0.00032818667,0.00004581278,0.000050371094,0.000026150701,0.00024914855,0.0025795829],"genre_scores_gemma":[0.9501629,0.00024212355,0.04761807,0.00008592194,0.00003273419,0.000075717246,0.00003622598,0.000022034386,0.0017242396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954516,0.00018633255,0.000014371056,0.00009628283,0.00008998517,0.00006778512],"domain_scores_gemma":[0.99937564,0.0003384634,0.00008694872,0.00005446106,0.00010263174,0.000041948326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941896,0.0005737071,0.0006510451,0.00033658295,0.00048471944,0.0005488183,0.0009727547,0.0005375991,0.0007509757],"category_scores_gemma":[0.0014613229,0.00023866388,0.00029322604,0.00042471374,0.0005092101,0.0008930687,0.0008946344,0.0006066429,0.00011658913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050029008,0.000042732376,0.00040337225,0.000032778735,0.000018257098,0.00005600547,0.000052205927,0.9676732,0.0018406197,0.004707264,0.00063428725,0.024489239],"study_design_scores_gemma":[0.0000026210357,0.000021642672,0.00004861147,0.0000010008586,0.000004212763,0.000009892242,0.000006786361,0.99859065,0.00033110884,0.00086644816,0.00011516285,0.0000019045649],"about_ca_topic_score_codex":0.002301462,"about_ca_topic_score_gemma":0.002670667,"teacher_disagreement_score":0.002301462,"about_ca_system_score_codex":0.0006801825,"about_ca_system_score_gemma":0.0009220778,"threshold_uncertainty_score":0.004935086},"labels":[],"label_agreement":null},{"id":"W4394804896","doi":"10.1109/tnse.2024.3386623","title":"Privacy-Preserving Heterogeneous Personalized Federated Learning With Knowledge","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Federated learning; Privacy protection; Internet privacy; Artificial intelligence","score_opus":0.01640289378817495,"score_gpt":0.24022134325714758,"score_spread":0.22381844946897264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394804896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036006413,0.00014577145,0.96091586,0.00038147147,0.000025725774,0.00007474475,0.00016627077,0.0011575004,0.0011262413],"genre_scores_gemma":[0.8925698,0.000109340304,0.10408391,0.0003210538,0.000042892007,0.00014451706,0.0004447277,0.000089250316,0.002194602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936801,0.0018814241,0.00038676301,0.0019886652,0.0013395491,0.0007234737],"domain_scores_gemma":[0.9906343,0.0022215026,0.0005895458,0.0055303215,0.0007022749,0.00032204288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395478,0.0009564155,0.0018427864,0.00079074904,0.001661174,0.002566283,0.0035759723,0.0020027794,0.0014046304],"category_scores_gemma":[0.0134483455,0.00060235814,0.0015065775,0.0014976755,0.0015607561,0.007264369,0.006800529,0.002649476,0.00049100997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014039677,0.00060093123,0.0077489815,0.00023283898,0.0003297678,0.00085909746,0.0011529301,0.53754526,0.009414236,0.11761466,0.0072606127,0.31583676],"study_design_scores_gemma":[0.000030014506,0.00006390028,0.00029957385,0.000010980112,0.000030253346,0.00015405203,0.000079652316,0.92148584,0.003897584,0.07284628,0.0010808335,0.000021096384],"about_ca_topic_score_codex":0.002221548,"about_ca_topic_score_gemma":0.0022202726,"teacher_disagreement_score":0.005395478,"about_ca_system_score_codex":0.0016782673,"about_ca_system_score_gemma":0.0023623933,"threshold_uncertainty_score":0.028534353},"labels":[],"label_agreement":null},{"id":"W4399995120","doi":"10.1109/tnse.2024.3418781","title":"Towards Easy-to-Monitor Networks: Network Design and Measurement Path Construction","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Path (computing); Computer network; Real-time computing","score_opus":0.01769644000317526,"score_gpt":0.2107308984929977,"score_spread":0.19303445848982242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399995120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009755155,0.000070175985,0.9978388,0.0001884949,0.000012000396,0.000040324478,0.000029627034,0.00009381723,0.00075130083],"genre_scores_gemma":[0.058648374,0.0005146964,0.93836546,0.00010856324,0.00005967446,0.00032224113,0.00017438526,0.00015004147,0.0016564933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404955,0.0031403538,0.00031829515,0.0009756752,0.0013127504,0.00020338026],"domain_scores_gemma":[0.99070054,0.0047532963,0.0011289886,0.0015955787,0.001535688,0.00028585427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006510552,0.0012974185,0.00077654934,0.0017769801,0.00093713065,0.0037576,0.0028132338,0.0021732326,0.0034869649],"category_scores_gemma":[0.020073725,0.0012595281,0.0010963394,0.0018457,0.0033289776,0.006588081,0.0040061795,0.0030108613,0.0011812842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009096731,0.00008505107,0.0017120442,0.00024625132,0.000036819158,0.0001427883,0.00050754263,0.23891906,0.00403737,0.6352021,0.00243888,0.11658109],"study_design_scores_gemma":[0.000020580077,0.00007924206,0.00032182527,0.00008439883,0.00002012465,0.0001398806,0.00011418203,0.6322207,0.0033879436,0.3475909,0.015981516,0.00003870363],"about_ca_topic_score_codex":0.0021634034,"about_ca_topic_score_gemma":0.0021518029,"teacher_disagreement_score":0.006510552,"about_ca_system_score_codex":0.002840483,"about_ca_system_score_gemma":0.002688681,"threshold_uncertainty_score":0.034431517},"labels":[],"label_agreement":null},{"id":"W4400646754","doi":"10.1109/tnse.2024.3427672","title":"Deep Reinforcement Learning-Assisted Federated Learning for Robust Short-Term Load Forecasting in Electricity Wholesale Markets","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Term (time); Electricity; Computer science; Artificial intelligence; Q-learning; Machine learning; Engineering; Electrical engineering","score_opus":0.017290220078683437,"score_gpt":0.21258778726764177,"score_spread":0.19529756718895833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08752565,0.00040757004,0.9087521,0.000567843,0.000058464644,0.00004321289,0.00009567872,0.0007846302,0.0017648676],"genre_scores_gemma":[0.97894794,0.000076623786,0.01959089,0.00014487888,0.000019243304,0.00003717616,0.00008409861,0.000032135842,0.001067016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.00023400744,0.000031391348,0.00015588792,0.00010706389,0.00014051331],"domain_scores_gemma":[0.9975879,0.0015212056,0.0002896339,0.00017870018,0.00029533374,0.00012730705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022283886,0.00077136455,0.0010939555,0.00035193146,0.00036786983,0.000851898,0.0012942047,0.0010893886,0.0011811722],"category_scores_gemma":[0.0055862023,0.00042082305,0.00052370405,0.00037993453,0.00086783007,0.0013718957,0.0012842702,0.0018585037,0.00018762758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008209887,0.00005446899,0.0007608343,0.000021448575,0.000024395027,0.000046838522,0.000024975254,0.9807694,0.0004795697,0.00253722,0.00040098146,0.014797802],"study_design_scores_gemma":[0.0000028647878,0.000008599672,0.000034620243,0.0000012411234,0.0000017253409,0.0000023634511,0.0000017890629,0.99868244,0.000087863926,0.0011415413,0.000033497217,0.0000013553002],"about_ca_topic_score_codex":0.00717605,"about_ca_topic_score_gemma":0.006287736,"teacher_disagreement_score":0.00717605,"about_ca_system_score_codex":0.0010189934,"about_ca_system_score_gemma":0.0015193837,"threshold_uncertainty_score":0.0142685175},"labels":[],"label_agreement":null},{"id":"W4400905299","doi":"10.1109/tnse.2024.3432746","title":"Enhanced Emergency Communication Services for Post–Disaster Rescue: Multi-IRS Assisted Air-Ground Integrated Data Collection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Emergency rescue; Computer science; Data collection; Ground station; Emergency management; Telecommunications; Engineering; Aerospace engineering; Medical emergency; Medicine","score_opus":0.03920028446327126,"score_gpt":0.2803340776113997,"score_spread":0.24113379314812847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400905299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12877557,0.0014035989,0.8522873,0.0008700262,0.00028061002,0.00025317277,0.0002832846,0.0013745329,0.014471924],"genre_scores_gemma":[0.9400354,0.00038841798,0.0551893,0.00020047027,0.000053705524,0.000091817434,0.00024283964,0.000022650527,0.0037753545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953556,0.0001393,0.000017833392,0.0000963621,0.00009490089,0.00011603972],"domain_scores_gemma":[0.99975437,0.00005698123,0.00003605907,0.0000425221,0.00006470584,0.000045295892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036794663,0.00058530085,0.000509098,0.0004949511,0.0006447152,0.00076183927,0.001091464,0.0007324231,0.0015891682],"category_scores_gemma":[0.00058564154,0.00014102488,0.00036094326,0.0006390215,0.0002466673,0.0011711301,0.0015583016,0.00064746983,0.0004799517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086146325,0.00060203264,0.005291081,0.00036253652,0.00018993934,0.0010242288,0.00032902215,0.35212177,0.048393372,0.01936853,0.01590314,0.5555529],"study_design_scores_gemma":[0.000028478324,0.00021073179,0.001240138,0.000016228503,0.00003572309,0.00028738016,0.00021703435,0.9831777,0.004892895,0.0037497475,0.0061226054,0.000021431391],"about_ca_topic_score_codex":0.0029254688,"about_ca_topic_score_gemma":0.0043124743,"teacher_disagreement_score":0.0029254688,"about_ca_system_score_codex":0.0004150603,"about_ca_system_score_gemma":0.0008590582,"threshold_uncertainty_score":0.005816877},"labels":[],"label_agreement":null},{"id":"W4400905308","doi":"10.1109/tnse.2024.3432836","title":"LURK-T: Limited Use of Remote Keys With Added Trust in TLS 1.3","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.02142975175309364,"score_gpt":0.2212832210649008,"score_spread":0.19985346931180717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400905308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0392226,0.0005942989,0.92346346,0.0020494778,0.0003330527,0.00060004886,0.00028531335,0.015458537,0.017993156],"genre_scores_gemma":[0.8186172,0.0004277651,0.16316268,0.0010533785,0.000362321,0.0005583711,0.0005715165,0.0014504738,0.01379622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986938,0.0040583927,0.0012102558,0.0019959246,0.003508085,0.0022892924],"domain_scores_gemma":[0.9771275,0.0039830804,0.0019719277,0.014067856,0.0016419275,0.001207751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008820446,0.001166439,0.002177215,0.0009750532,0.0027998446,0.0061440817,0.0044910084,0.0031120072,0.007093449],"category_scores_gemma":[0.019643292,0.0010726991,0.0019234502,0.0009804543,0.0054845857,0.019527016,0.017701028,0.005746442,0.005595661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035385527,0.0004951974,0.0039411685,0.0010180473,0.0001932457,0.0027877819,0.0021326665,0.030752769,0.04275153,0.6934543,0.038216546,0.18071829],"study_design_scores_gemma":[0.0006731496,0.0009087949,0.0011606046,0.0002554319,0.0002881258,0.0032091667,0.0006397229,0.40570545,0.07616768,0.40990385,0.100608096,0.00047988765],"about_ca_topic_score_codex":0.0019520536,"about_ca_topic_score_gemma":0.0016315264,"teacher_disagreement_score":0.008820446,"about_ca_system_score_codex":0.0024188843,"about_ca_system_score_gemma":0.0044193515,"threshold_uncertainty_score":0.04664755},"labels":[],"label_agreement":null},{"id":"W4401114094","doi":"10.1109/tnse.2024.3435839","title":"GAXG: A Global and Self-Adaptive Optimal Graph Topology Generation Framework for Explaining Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Topology (electrical circuits); Graph; Topological graph theory; Artificial neural network; Mathematics; Theoretical computer science; Voltage graph; Artificial intelligence; Line graph; Combinatorics","score_opus":0.014399628574331453,"score_gpt":0.2477316796725518,"score_spread":0.23333205109822036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401114094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077029103,0.0002584151,0.98812824,0.0003364892,0.000028370343,0.00008766477,0.0002836522,0.0019645053,0.0012097998],"genre_scores_gemma":[0.2444977,0.0005545271,0.74802583,0.00038357486,0.00007788494,0.000452444,0.002005152,0.00082617364,0.0031767543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999559,0.00017309791,0.000014563722,0.00013350163,0.000090694266,0.000029218714],"domain_scores_gemma":[0.9985209,0.0009592182,0.0001218611,0.00018598084,0.00014869573,0.00006329321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354575,0.0014322121,0.0007445861,0.0017852361,0.00071755913,0.0010470335,0.0022321832,0.0017333885,0.0052521257],"category_scores_gemma":[0.0054888865,0.00058188837,0.0015654655,0.0009882799,0.0009700177,0.0020405634,0.0015778773,0.001998844,0.00083365245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000661077,0.000076527656,0.0025832385,0.0002756006,0.00011696817,0.00027922427,0.00034876965,0.76424694,0.0024379028,0.07111593,0.009212372,0.14924042],"study_design_scores_gemma":[0.000012734799,0.00001951836,0.00013832323,0.000018485216,0.000013406523,0.000046810233,0.000029979641,0.94711274,0.00045844732,0.05037422,0.001767943,0.000007318233],"about_ca_topic_score_codex":0.004981395,"about_ca_topic_score_gemma":0.011347641,"teacher_disagreement_score":0.0052521257,"about_ca_system_score_codex":0.001154131,"about_ca_system_score_gemma":0.0014082319,"threshold_uncertainty_score":0.017570078},"labels":[],"label_agreement":null},{"id":"W4402450494","doi":"10.1109/tnse.2024.3456103","title":"Hide and Recognize Your Privacy Image","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Computer vision; Image (mathematics); Artificial intelligence; Internet privacy","score_opus":0.010717953762778567,"score_gpt":0.21071068406132415,"score_spread":0.19999273029854558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402450494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26463357,0.008440583,0.6292539,0.00941462,0.0014656306,0.00044598294,0.00343652,0.010957514,0.07195168],"genre_scores_gemma":[0.8083392,0.004608961,0.14579609,0.0019781261,0.00044699977,0.00011192598,0.0024980211,0.0002878307,0.035932757],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993617,0.00007564194,0.000029437406,0.00012507623,0.00029616934,0.00011199589],"domain_scores_gemma":[0.99920696,0.00012358789,0.0000919834,0.00041338668,0.00012252956,0.00004156639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005018081,0.0006354455,0.00046783144,0.00063163764,0.0005447878,0.0013728399,0.00051286985,0.0011233044,0.006928795],"category_scores_gemma":[0.0019514498,0.0002498335,0.0007578503,0.00047274787,0.0007207978,0.0026175217,0.0014588971,0.0011804755,0.0039130854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087165314,0.00019679392,0.0047188667,0.0005419704,0.00015146699,0.0011516393,0.0003507759,0.008852539,0.103166685,0.011494943,0.040352754,0.8281499],"study_design_scores_gemma":[0.00010197519,0.00057431165,0.0129192285,0.0003053914,0.00026053764,0.008371079,0.00089024066,0.33558205,0.45009,0.04124056,0.14950067,0.0001638721],"about_ca_topic_score_codex":0.0012947478,"about_ca_topic_score_gemma":0.001470317,"teacher_disagreement_score":0.006928795,"about_ca_system_score_codex":0.00038958993,"about_ca_system_score_gemma":0.0005182928,"threshold_uncertainty_score":0.023179173},"labels":[],"label_agreement":null},{"id":"W4402508517","doi":"10.1109/tnse.2024.3460479","title":"Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo; Queen's University","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Wireless; Distributed computing; Wireless network; Dynamic Source Routing; Routing (electronic design automation); Wireless Routing Protocol; Routing protocol; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.006654377918144828,"score_gpt":0.2111918904406165,"score_spread":0.20453751252247168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402508517","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.046431452,0.0007483383,0.9469899,0.00048242364,0.00019257923,0.00005759954,0.000021302583,0.0004758073,0.004600633],"genre_scores_gemma":[0.9216918,0.0004861253,0.07614893,0.0001029373,0.00011345545,0.000042891344,0.000024382089,0.000034921002,0.0013546884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995958,0.00011975168,0.000015718071,0.000053281266,0.00014637677,0.00006913854],"domain_scores_gemma":[0.9990895,0.00055695715,0.0001042336,0.00008917044,0.000102186845,0.000058046397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008662628,0.0005498205,0.0004616331,0.00031959458,0.0005057368,0.000711844,0.00091821456,0.00056933425,0.00075711147],"category_scores_gemma":[0.0030733019,0.00019812562,0.0002387688,0.00037424685,0.0006825022,0.000962665,0.0007923937,0.00087335974,0.00013645101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012332763,0.000085967324,0.0003987672,0.000061967025,0.000016700418,0.00009630272,0.00007124244,0.8898049,0.009599518,0.03225422,0.0012321094,0.066255026],"study_design_scores_gemma":[0.0000041071416,0.000014804017,0.000017823297,0.0000012622149,0.00000213876,0.000009093445,0.0000026839775,0.9963648,0.0004951459,0.0027950893,0.00029164884,0.0000014600371],"about_ca_topic_score_codex":0.0023523779,"about_ca_topic_score_gemma":0.002608173,"teacher_disagreement_score":0.0023523779,"about_ca_system_score_codex":0.0007899894,"about_ca_system_score_gemma":0.0010408434,"threshold_uncertainty_score":0.0057317615},"labels":[],"label_agreement":null},{"id":"W4404469503","doi":"10.1109/tnse.2024.3498864","title":"An Enhanced Multi-Factor Device Authentication Protocol in IoLT Healthcare Environment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Canada West","funders":"","keywords":"Authentication protocol; Protocol (science); Computer science; Health care; Authentication (law); Computer network; Computer security; Medicine","score_opus":0.02039185876002711,"score_gpt":0.30136591102540045,"score_spread":0.2809740522653733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404469503","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.018150935,0.0016453005,0.9690409,0.0009570502,0.0005547636,0.0008919894,0.00008413216,0.0027514617,0.0059235254],"genre_scores_gemma":[0.78508425,0.001488637,0.2021055,0.0010229609,0.0003558021,0.0011240037,0.000257175,0.00011608656,0.008445461],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956505,0.0013107993,0.0007005031,0.00058827625,0.0011883558,0.0005615972],"domain_scores_gemma":[0.99639267,0.00076684717,0.00054408103,0.000982523,0.0011453865,0.00016843567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031757413,0.00077352824,0.0009089715,0.0013767809,0.0012262296,0.0017372791,0.0017436194,0.002382653,0.002129287],"category_scores_gemma":[0.0058646486,0.0004961565,0.0008886238,0.0010482471,0.0013093705,0.0049857553,0.0039298446,0.0020300585,0.0012409053],"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.002450444,0.00044031898,0.0041342727,0.0015351877,0.00022795006,0.005255351,0.0023041624,0.031262144,0.20168245,0.27420405,0.017433802,0.45906985],"study_design_scores_gemma":[0.0004523463,0.0021935771,0.0023855409,0.00050395285,0.00039508095,0.0096772285,0.00047185353,0.5863609,0.16327791,0.039487496,0.19424886,0.0005452247],"about_ca_topic_score_codex":0.0008073105,"about_ca_topic_score_gemma":0.0004465775,"teacher_disagreement_score":0.0031757413,"about_ca_system_score_codex":0.0011063362,"about_ca_system_score_gemma":0.0014293581,"threshold_uncertainty_score":0.016795099},"labels":[],"label_agreement":null},{"id":"W4404787921","doi":"10.1109/tnse.2024.3507545","title":"QPoS: Decentralized Stake-Based Leader and Voter Selection in a PBFT System With Mobile Voters","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Selection (genetic algorithm); Voter model; Computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.006583386807191674,"score_gpt":0.1948719971657569,"score_spread":0.18828861035856523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404787921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23430128,0.00010479666,0.7611124,0.00035882127,0.00006146628,0.0002634153,0.0001064494,0.00035064993,0.0033407041],"genre_scores_gemma":[0.9847483,0.000024898829,0.013933884,0.000025128671,0.000013294606,0.00006842528,0.000026836053,0.00000928608,0.0011500181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818796,0.0007265209,0.00007496128,0.00033989348,0.0003320433,0.0003386134],"domain_scores_gemma":[0.9959377,0.0021217165,0.0005826538,0.000552578,0.0004057463,0.0003995318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481272,0.00041628373,0.00086609204,0.00038253888,0.0010003375,0.001076234,0.0015803507,0.0008683623,0.0026945125],"category_scores_gemma":[0.0062139262,0.0002699909,0.00046290708,0.0003826649,0.0014074751,0.0015852631,0.0021357494,0.00085434393,0.00034758946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020875796,0.00023721825,0.0066648005,0.00027088771,0.0001325649,0.0015161451,0.0012828399,0.72631073,0.031825367,0.1519507,0.002113519,0.07560768],"study_design_scores_gemma":[0.00011054073,0.00018507252,0.00030672335,0.000010621381,0.000015505006,0.00011977714,0.00007446436,0.9705273,0.0026260635,0.025240395,0.0007659763,0.000017468728],"about_ca_topic_score_codex":0.0019503707,"about_ca_topic_score_gemma":0.0019211199,"teacher_disagreement_score":0.0026945125,"about_ca_system_score_codex":0.00085740583,"about_ca_system_score_gemma":0.0013775247,"threshold_uncertainty_score":0.01312238},"labels":[],"label_agreement":null},{"id":"W4405778888","doi":"10.1109/tnse.2024.3520967","title":"Self-Liking Group in Networks With Multi-Class Nodes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Class (philosophy); Group (periodic table); Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.0070051974199761375,"score_gpt":0.21998365669412767,"score_spread":0.21297845927415154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405778888","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.59110457,0.0004997905,0.3986064,0.00099778,0.000052281524,0.00021162348,0.0002598492,0.00028446005,0.007983229],"genre_scores_gemma":[0.96144384,0.00014338999,0.035562057,0.00013469397,0.00008772539,0.0001669876,0.00019797956,0.000035737656,0.002227646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976509,0.001066219,0.000083998035,0.0006995332,0.0003008349,0.00019849358],"domain_scores_gemma":[0.9867199,0.008087691,0.0023326215,0.0010806705,0.00071210647,0.0010669818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030611982,0.0004811805,0.00071452564,0.0028756985,0.0017037805,0.0018076202,0.0010820837,0.0013039259,0.0025815733],"category_scores_gemma":[0.013436444,0.0003919011,0.00069136755,0.0011444542,0.0029916626,0.0041294084,0.0022499335,0.000687588,0.00036054038],"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.0010853681,0.0004187205,0.08554304,0.0006152574,0.0004964128,0.0018221429,0.011857045,0.1659818,0.013221986,0.5404112,0.006617903,0.17192921],"study_design_scores_gemma":[0.00006140924,0.0002542103,0.01896867,0.00007843942,0.00008662463,0.00070998963,0.002359467,0.5480762,0.0021919687,0.4210583,0.0060577723,0.000096889606],"about_ca_topic_score_codex":0.001563315,"about_ca_topic_score_gemma":0.0016036028,"teacher_disagreement_score":0.0030611982,"about_ca_system_score_codex":0.0012414319,"about_ca_system_score_gemma":0.0003728557,"threshold_uncertainty_score":0.016189396},"labels":[],"label_agreement":null},{"id":"W4406258621","doi":"10.1109/tnse.2025.3528190","title":"AI-Based E2E Resilient and Proactive Resource Management in Slice-Enabled 6G Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Bundesministerium für Bildung und Forschung","keywords":"Proactivity; Computer science; Provisioning; Flexibility (engineering); Quality of service; Distributed computing; Resilience (materials science); Robustness (evolution); Network packet; Slicing; Computer network","score_opus":0.005126238672153439,"score_gpt":0.2052570043845928,"score_spread":0.20013076571243935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406258621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08539577,0.0009870973,0.90673757,0.00052990677,0.00011528582,0.000043440315,0.000060611772,0.0003665189,0.0057638655],"genre_scores_gemma":[0.97671974,0.00024259191,0.02159129,0.00007397069,0.000023552322,0.000018950432,0.000026797128,0.000011572286,0.0012915989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997478,0.00006692416,0.000009008538,0.00005860668,0.000054141976,0.000063463034],"domain_scores_gemma":[0.99972683,0.00011271218,0.000044334938,0.000024410963,0.000053663753,0.0000380855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050544256,0.00054491166,0.00043775153,0.0002454205,0.00040357327,0.00071085186,0.000743304,0.00046918064,0.0008659546],"category_scores_gemma":[0.00077702495,0.00019303971,0.00028166163,0.0002685046,0.0004917451,0.0009550875,0.00073092885,0.0006801621,0.000103514496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011596193,0.00004695565,0.00064189243,0.00005055085,0.00003267511,0.00016959073,0.00006012739,0.9396691,0.0066600386,0.0153070055,0.0010796597,0.036166437],"study_design_scores_gemma":[0.0000021286783,0.00002125764,0.00008124505,0.0000021401995,0.000005240327,0.000017401037,0.000011166162,0.9970458,0.0005401545,0.002011264,0.00025889993,0.000003348491],"about_ca_topic_score_codex":0.0052011088,"about_ca_topic_score_gemma":0.004687047,"teacher_disagreement_score":0.0052011088,"about_ca_system_score_codex":0.0007102353,"about_ca_system_score_gemma":0.0007244539,"threshold_uncertainty_score":0.010341644},"labels":[],"label_agreement":null},{"id":"W4408323756","doi":"10.1109/tnse.2025.3550290","title":"Self-Tallying E-Voting Using Homomorphic Time-Lock Puzzles and ZK-SNARKs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Internet Traffic Analysis and Secure E-voting","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":"Concordia University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Lock (firearm); Scalability; Computer science; Voting; Mathematics; Discrete mathematics; Encryption; Computer security; Engineering; Operating system","score_opus":0.007183898816568459,"score_gpt":0.20625542438882014,"score_spread":0.1990715255722517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408323756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08899706,0.0001382648,0.9021758,0.0005485044,0.00007130143,0.00027412878,0.00014203045,0.0014647477,0.0061881654],"genre_scores_gemma":[0.888528,0.00013771608,0.1059214,0.00013319493,0.000038551356,0.00020614648,0.00019605235,0.00009909957,0.0047396943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963766,0.0010704274,0.0003130112,0.00055629405,0.0012387936,0.00044483284],"domain_scores_gemma":[0.99408615,0.0021781959,0.00074509747,0.0022747521,0.00044705358,0.00026868595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003072748,0.00042133484,0.0007907456,0.0007069989,0.0013165026,0.0025915662,0.0019060094,0.0012547127,0.003954352],"category_scores_gemma":[0.008994929,0.0004185925,0.0008302302,0.0008089707,0.002336764,0.006913329,0.0055715684,0.0021638656,0.0008908372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012204552,0.00023719006,0.0019548624,0.00026804354,0.00009117358,0.000547625,0.00080827984,0.06709344,0.04542012,0.74731475,0.0021733623,0.13287081],"study_design_scores_gemma":[0.000346884,0.00041524653,0.00053265045,0.000059346035,0.00008373077,0.00042471194,0.00022472885,0.5082376,0.07463704,0.400532,0.014389551,0.000116557385],"about_ca_topic_score_codex":0.0008231943,"about_ca_topic_score_gemma":0.00076357496,"teacher_disagreement_score":0.003954352,"about_ca_system_score_codex":0.001056701,"about_ca_system_score_gemma":0.0018478286,"threshold_uncertainty_score":0.016250491},"labels":[],"label_agreement":null},{"id":"W4409049973","doi":"10.1109/tnse.2025.3556390","title":"An Adaptive Service Function Chains Mapping With Multi-Task Deep Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Function (biology); Service (business); Reinforcement; Artificial intelligence; Engineering; Systems engineering","score_opus":0.007758406686522491,"score_gpt":0.19829007016169672,"score_spread":0.19053166347517422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409049973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072731264,0.00069520954,0.9203837,0.0006849178,0.00015669319,0.00008586808,0.00012517214,0.002047542,0.0030897006],"genre_scores_gemma":[0.90331143,0.00018277345,0.09226046,0.0004406941,0.000042751843,0.00013442725,0.00023222293,0.00009091943,0.0033042084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996588,0.00006723216,0.000016002212,0.00010554432,0.000066605724,0.00008578074],"domain_scores_gemma":[0.9995029,0.00021258702,0.000055621367,0.000043024247,0.00011638881,0.00006943653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000690028,0.0010102638,0.000940433,0.0003939074,0.00034706676,0.00072376314,0.0015769273,0.0011457053,0.002114554],"category_scores_gemma":[0.0018352413,0.00050775515,0.0005728203,0.00036205832,0.0006398497,0.0011721763,0.0011467465,0.0020992076,0.00036212665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011593449,0.0001973128,0.0011550674,0.000060003193,0.000066005465,0.0001005079,0.000069639784,0.8851448,0.0032036698,0.0030522249,0.002531926,0.104302794],"study_design_scores_gemma":[0.0000054994157,0.000013550402,0.00003276926,0.0000018879848,0.0000024284736,0.0000045617026,0.000002222556,0.9989371,0.0002535839,0.0006480486,0.00009608258,0.000002339089],"about_ca_topic_score_codex":0.012345852,"about_ca_topic_score_gemma":0.0104558505,"teacher_disagreement_score":0.012345852,"about_ca_system_score_codex":0.0012162976,"about_ca_system_score_gemma":0.0019347961,"threshold_uncertainty_score":0.024547994},"labels":[],"label_agreement":null},{"id":"W4409129190","doi":"10.1109/tnse.2025.3557385","title":"Priority-Aware Task Scheduling in Computing Power Network-Enabled Edge Computing Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Distributed computing; Scheduling (production processes); Edge device; Computer network; Processor scheduling; Embedded system; Internet of Things; Cloud computing; Operating system; Mathematical optimization","score_opus":0.007025028438510143,"score_gpt":0.21828794205450106,"score_spread":0.21126291361599092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409129190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11756095,0.0011179084,0.8747807,0.00042791181,0.00017698391,0.000100062876,0.00006742589,0.00055613904,0.0052119046],"genre_scores_gemma":[0.95377994,0.00019159599,0.04441574,0.00008384102,0.000036352096,0.000036415036,0.00003949612,0.00004203554,0.0013746301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958533,0.00009229236,0.000022736223,0.00010021517,0.00008915099,0.00011027602],"domain_scores_gemma":[0.99925023,0.0002932207,0.0000951527,0.00007364074,0.00017418705,0.0001135271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000854616,0.00048199442,0.00057143223,0.0003309276,0.00055730744,0.000677415,0.001122839,0.00033851425,0.0011143761],"category_scores_gemma":[0.0020674083,0.00022808526,0.00016371459,0.00041765187,0.0003668764,0.0008903337,0.0006580994,0.0006722619,0.00017849276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026715134,0.00011616555,0.0011527061,0.00008787698,0.000023841612,0.00009249557,0.00008727173,0.90188664,0.0061885747,0.009656346,0.0020638413,0.078377105],"study_design_scores_gemma":[0.0000066740395,0.000021716181,0.00009063134,0.0000019201739,0.000002886533,0.000011154955,0.0000075354783,0.996754,0.00058701285,0.002199326,0.00031456287,0.0000025969994],"about_ca_topic_score_codex":0.0050553,"about_ca_topic_score_gemma":0.0060140505,"teacher_disagreement_score":0.0050553,"about_ca_system_score_codex":0.0009083105,"about_ca_system_score_gemma":0.001491594,"threshold_uncertainty_score":0.010051787},"labels":[],"label_agreement":null},{"id":"W4409723334","doi":"10.1109/tnse.2025.3563901","title":"A Probabilistic Model for Information Diffusion in Social Networks: Insights From Twitter Data","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Probabilistic logic; Social media; Computer science; Diffusion; Microblogging; Data science; World Wide Web; Artificial intelligence","score_opus":0.018758181238722624,"score_gpt":0.2567785706425606,"score_spread":0.23802038940383796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409723334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12046786,0.0011104926,0.8688916,0.002454149,0.00010420275,0.00022084982,0.0035408125,0.00073421135,0.0024758906],"genre_scores_gemma":[0.89982146,0.0017098046,0.08962838,0.00022421157,0.00024463504,0.0005158777,0.004044945,0.00011349181,0.0036972058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.0002798603,0.00007308018,0.00023627607,0.00023846759,0.00010735495],"domain_scores_gemma":[0.994718,0.0037745151,0.00060627796,0.00029774092,0.0005053396,0.000098103104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030196845,0.0008173489,0.0011041594,0.0020968337,0.0008694958,0.0015721739,0.0017144073,0.001543647,0.0015086081],"category_scores_gemma":[0.012499037,0.0005787285,0.00094609533,0.0023442307,0.0007485767,0.0041426243,0.0009596966,0.0014793581,0.00070252514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016238498,0.000092557704,0.014943379,0.00017639133,0.00009353584,0.0002460713,0.00030612852,0.89695996,0.002361542,0.045569126,0.0045504207,0.03453848],"study_design_scores_gemma":[0.000005657454,0.000009664784,0.0007587275,0.000005065465,0.000006820613,0.0000322279,0.000014326216,0.992396,0.0001201594,0.0061137164,0.00052951626,0.0000080883165],"about_ca_topic_score_codex":0.014628284,"about_ca_topic_score_gemma":0.013818713,"teacher_disagreement_score":0.014628284,"about_ca_system_score_codex":0.0013351878,"about_ca_system_score_gemma":0.00085890514,"threshold_uncertainty_score":0.029086292},"labels":[],"label_agreement":null},{"id":"W4410118203","doi":"10.1109/tnse.2025.3567348","title":"On the Design of Resilient Distributed Single Time-Scale Estimators: A Graph-Theoretic Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Estimator; Graph; Distributed computing; Mathematics; Theoretical computer science; Statistics","score_opus":0.00786012365765941,"score_gpt":0.20845579276119727,"score_spread":0.20059566910353788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410118203","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.0013019901,0.00011763297,0.9980355,0.00007124173,0.0000139890235,0.000016634665,0.000010594723,0.000047579713,0.00038484312],"genre_scores_gemma":[0.5759105,0.001857487,0.4177852,0.00042227568,0.00031151154,0.0004867219,0.00018201716,0.00018676766,0.002857458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984675,0.00059138983,0.00008120935,0.00045017173,0.00031900895,0.000090751746],"domain_scores_gemma":[0.9939803,0.004265284,0.0006931275,0.00037883758,0.0005679294,0.00011451557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002587183,0.0018777039,0.0013394635,0.0013758425,0.00045174232,0.0010745003,0.0015578585,0.0017077301,0.0014282906],"category_scores_gemma":[0.011717601,0.0007190915,0.001314155,0.0011657547,0.001923776,0.0019461421,0.0018523028,0.0013964283,0.0003844709],"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.00004353452,0.000026672033,0.0003273031,0.00018015773,0.00006390604,0.00007624387,0.0000989145,0.91171265,0.0032146329,0.0509561,0.0006794474,0.032620456],"study_design_scores_gemma":[0.000009984896,0.000057855115,0.00007661875,0.000014454596,0.000016762346,0.000024235604,0.000009312237,0.97966343,0.0005824136,0.018885344,0.0006485561,0.00001106364],"about_ca_topic_score_codex":0.0016381002,"about_ca_topic_score_gemma":0.0010569994,"teacher_disagreement_score":0.002587183,"about_ca_system_score_codex":0.00096563896,"about_ca_system_score_gemma":0.0010589502,"threshold_uncertainty_score":0.013682485},"labels":[],"label_agreement":null},{"id":"W4410226734","doi":"10.1109/tnse.2025.3568824","title":"Concealing Radio Frequency Fingerprints via Active Adversarial Perturbation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Adversarial system; Radio frequency; Perturbation (astronomy); Computer science; Physics; Control theory (sociology); Telecommunications; Artificial intelligence","score_opus":0.008827533102215441,"score_gpt":0.21463368715724815,"score_spread":0.20580615405503272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410226734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06569383,0.00016027139,0.9318286,0.00022326685,0.000038565482,0.00004074158,0.000033816956,0.00025696412,0.0017239691],"genre_scores_gemma":[0.9715276,0.0001017488,0.026855782,0.00008312609,0.000018010653,0.000043256394,0.00002867768,0.000019868048,0.0013219187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00024698398,0.000031342657,0.00013484481,0.00019168493,0.00009999975],"domain_scores_gemma":[0.9976441,0.0014469547,0.00034946212,0.0003331174,0.00016389367,0.00006244763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291032,0.0010506405,0.0005889556,0.00033502994,0.0002938235,0.0005425572,0.00074978295,0.0008431218,0.000774565],"category_scores_gemma":[0.0046894588,0.00029135117,0.0005217442,0.00019659086,0.0011723097,0.0011223846,0.0013627737,0.0012122679,0.00016663547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011818444,0.000029503875,0.0007076738,0.000032561064,0.000034078985,0.0001229396,0.000046165977,0.9605159,0.009461588,0.010079328,0.0003111976,0.018540833],"study_design_scores_gemma":[0.0000035341352,0.000039264163,0.000106053485,0.0000040564523,0.0000063195275,0.000036755522,0.000006070224,0.994494,0.0023838335,0.0027569204,0.00015798504,0.0000052018518],"about_ca_topic_score_codex":0.0008577989,"about_ca_topic_score_gemma":0.00059474545,"teacher_disagreement_score":0.0010506405,"about_ca_system_score_codex":0.00051993586,"about_ca_system_score_gemma":0.00046545835,"threshold_uncertainty_score":0.0054425},"labels":[],"label_agreement":null},{"id":"W4410294627","doi":"10.1109/tnse.2025.3569515","title":"Multiplayer Pursuit-Evasion Games With Distributed Nash Equilibrium Solution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Guidance and Control Systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Nash equilibrium; Pursuit-evasion; Computer science; Epsilon-equilibrium; Mathematical economics; Best response; Game theory; Mathematical optimization; Equilibrium selection; Mathematics; Repeated game","score_opus":0.005739051510369887,"score_gpt":0.1890418780414379,"score_spread":0.18330282653106802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410294627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029402716,0.00026626952,0.95565504,0.00031010498,0.000049703085,0.00010609029,0.000045553385,0.00010117531,0.014063295],"genre_scores_gemma":[0.92370313,0.0002643758,0.06725174,0.00012771474,0.000033019045,0.00030963978,0.000051336017,0.000019226274,0.008239818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991762,0.00028039078,0.00004114124,0.00018082735,0.00018162392,0.00013984399],"domain_scores_gemma":[0.99940467,0.00030566994,0.00010382157,0.000029136798,0.00010346278,0.000053376243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008432,0.001211221,0.0012098505,0.0005471545,0.0007445311,0.0013985537,0.0013133954,0.001512409,0.0023702618],"category_scores_gemma":[0.0019681193,0.00036350466,0.00065259787,0.00060085615,0.00091638573,0.0012057245,0.0023084295,0.0013607338,0.00025819492],"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.00012642588,0.00007382806,0.00045519366,0.0001358257,0.000057125853,0.00029915414,0.00014990753,0.8651032,0.0025620486,0.11254442,0.0010711176,0.017421784],"study_design_scores_gemma":[0.000024246834,0.000054382665,0.000056153815,0.0000059373992,0.0000082602055,0.00004005798,0.000030035679,0.97856516,0.00029654897,0.02030105,0.00060879876,0.000009450875],"about_ca_topic_score_codex":0.0033046422,"about_ca_topic_score_gemma":0.002145829,"teacher_disagreement_score":0.0033046422,"about_ca_system_score_codex":0.0010565147,"about_ca_system_score_gemma":0.0011032006,"threshold_uncertainty_score":0.007929325},"labels":[],"label_agreement":null},{"id":"W4411086466","doi":"10.1109/tnse.2025.3577910","title":"Straggler-resilient Federated Learning: Tackling Computation Heterogeneity with Layer-wise Partial Model Training in Mobile Edge Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","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":"York University","funders":"","keywords":"Computer science; Layer (electronics); Enhanced Data Rates for GSM Evolution; Computation; Training (meteorology); Computer network; Distributed computing; Artificial intelligence; Edge device; Algorithm","score_opus":0.02328220899817998,"score_gpt":0.2607421179768852,"score_spread":0.2374599089787052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411086466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08923611,0.00030155267,0.9066888,0.00048496685,0.000048162226,0.000046793066,0.00007884226,0.0018915216,0.0012232175],"genre_scores_gemma":[0.92344594,0.00008234551,0.07385766,0.0002859372,0.000024168081,0.00007228238,0.00016427352,0.00007996629,0.0019873534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922085,0.00024953502,0.00004085468,0.00020841481,0.00011735571,0.00016303128],"domain_scores_gemma":[0.9980987,0.0010266991,0.00011737124,0.0003948437,0.00024730992,0.00011517684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021447244,0.0010919814,0.0014456263,0.00046274866,0.0007458953,0.0008771744,0.002435276,0.0014724707,0.0011056588],"category_scores_gemma":[0.005309243,0.0005883816,0.00057871384,0.0005705835,0.0010159793,0.002595044,0.0021788948,0.0015630338,0.00023896262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022483993,0.000090409594,0.0008489344,0.000023580837,0.000038566443,0.00007668331,0.00006741243,0.9446821,0.000932124,0.0024635112,0.0010670356,0.049484853],"study_design_scores_gemma":[0.0000034144944,0.000013786251,0.000026226906,0.000001174541,0.0000024398755,0.0000042657744,0.0000045929346,0.9984463,0.00024742034,0.001199692,0.000049394715,0.0000013383012],"about_ca_topic_score_codex":0.009491064,"about_ca_topic_score_gemma":0.009987186,"teacher_disagreement_score":0.009491064,"about_ca_system_score_codex":0.0011725293,"about_ca_system_score_gemma":0.0014683428,"threshold_uncertainty_score":0.018871605},"labels":[],"label_agreement":null},{"id":"W4411406701","doi":"10.1109/tnse.2025.3580705","title":"Quantum Deep Deterministic Policy Gradient for Digital Twin-Enabled Semantic IoV Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Memory and Neural Computing","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Computer science; Theoretical computer science; Algorithm","score_opus":0.008278547988853852,"score_gpt":0.22789446833811122,"score_spread":0.21961592034925737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411406701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05087453,0.0005364136,0.9390004,0.0006875899,0.00012220623,0.000044760363,0.000084358355,0.00023776502,0.00841192],"genre_scores_gemma":[0.9581199,0.00022826274,0.038328353,0.00020120444,0.00002505691,0.000061413884,0.00006357801,0.000046775203,0.0029255133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997677,0.000075255186,0.000007918514,0.00004164012,0.000054246117,0.000053251566],"domain_scores_gemma":[0.9995432,0.0002571681,0.000041478786,0.0000325576,0.00007083624,0.000054915312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074191124,0.00047759656,0.0006663373,0.00026686714,0.00047249917,0.0008548215,0.00087593455,0.00066981534,0.0023123468],"category_scores_gemma":[0.0019673447,0.0002843078,0.0003309074,0.0003100732,0.0010853296,0.0013687108,0.0013973895,0.001037478,0.00018046987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073910516,0.000025406645,0.00035621913,0.00004205447,0.000016636475,0.000053702068,0.000031572737,0.9304372,0.0010363656,0.056998897,0.0010185309,0.009909458],"study_design_scores_gemma":[0.0000027915235,0.000005832696,0.000016948014,0.0000014079053,0.0000012111927,0.000003201734,0.000003192955,0.99353915,0.00008612093,0.0061878436,0.00015046923,0.0000019213162],"about_ca_topic_score_codex":0.004971988,"about_ca_topic_score_gemma":0.0048919283,"teacher_disagreement_score":0.004971988,"about_ca_system_score_codex":0.0014968701,"about_ca_system_score_gemma":0.001585427,"threshold_uncertainty_score":0.010860562},"labels":[],"label_agreement":null},{"id":"W4411550952","doi":"10.1109/tnse.2025.3582063","title":"Retraction Notice: A DQN-Based Frame Aggregation and Task Offloading Approach for Edge-Enabled IoMT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Notice; Task (project management); Enhanced Data Rates for GSM Evolution; Edge computing; Frame (networking); Distributed computing; Computer network; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.008431222463482737,"score_gpt":0.21757578811341205,"score_spread":0.2091445656499293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411550952","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023603537,0.005484672,0.023122964,0.21073873,0.74564445,0.00015971056,0.001055627,0.0010689269,0.0103645455],"genre_scores_gemma":[0.07193436,0.014866755,0.046183534,0.1426085,0.40034452,0.00053725677,0.0029967662,0.0010926537,0.31943563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812096,0.0002967284,0.00023019774,0.0002641224,0.0008656979,0.00022224631],"domain_scores_gemma":[0.9922517,0.002252003,0.00030078235,0.00039480766,0.004208299,0.0005924131],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028457134,0.0010206223,0.0006281326,0.0006745707,0.0013643886,0.0015080114,0.0023252103,0.0039896076,0.016577203],"category_scores_gemma":[0.021242931,0.00032706378,0.0007439091,0.0006612814,0.001226976,0.0017462359,0.0013689246,0.008653627,0.008764002],"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.00012628347,0.00001780907,0.00023006188,0.0001983195,0.000014906653,0.00050832384,0.00007329171,0.0003011983,0.0011374404,0.0049612112,0.950704,0.041727178],"study_design_scores_gemma":[0.000048970454,0.00007322488,0.00063096406,0.00009899553,0.000024645884,0.0006577292,0.0000671907,0.0030858018,0.001411917,0.0016579857,0.99220496,0.00003773275],"about_ca_topic_score_codex":0.008235755,"about_ca_topic_score_gemma":0.009996582,"teacher_disagreement_score":0.99601036,"about_ca_system_score_codex":0.0023659945,"about_ca_system_score_gemma":0.0030489652,"threshold_uncertainty_score":0.05545628},"labels":[{"model":"gemma","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4411725464","doi":"10.1109/tnse.2025.3583800","title":"Retraction Notice: Blockchain and Deep Learning for Secure Communication in Digital Twin Empowered Industrial IoT Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Communications Research Centre Canada","funders":"","keywords":"Blockchain; Notice; Internet of Things; Computer science; Computer security; Computer network; Law","score_opus":0.020133467447602638,"score_gpt":0.24597134204376261,"score_spread":0.22583787459615998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411725464","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007679508,0.003026457,0.0051303594,0.33300376,0.64826274,0.00008588542,0.00085789524,0.0005283737,0.008336579],"genre_scores_gemma":[0.03727246,0.009787302,0.010776902,0.20616852,0.50681126,0.0006229964,0.0015172063,0.0008426907,0.22620061],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99601835,0.00067156414,0.00055202865,0.0006727295,0.0016200455,0.0004653457],"domain_scores_gemma":[0.98451644,0.0062049776,0.00074766413,0.00091033074,0.0064713857,0.0011491487],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0043637515,0.0013771428,0.00089574873,0.0011263175,0.0025586307,0.002753597,0.0036236595,0.009889758,0.020604985],"category_scores_gemma":[0.045363545,0.00048756073,0.0010912286,0.0009850393,0.002840329,0.0037194388,0.0019629437,0.019020585,0.013756176],"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.000024802364,0.0000056857457,0.000059401398,0.00007259059,0.0000064849646,0.00015593748,0.000040053787,0.00010648636,0.000106408814,0.005216835,0.9869075,0.0072979317],"study_design_scores_gemma":[0.000029135974,0.000034861554,0.0003512422,0.00016120049,0.000015015989,0.00023498795,0.0000504941,0.0014528723,0.00050294626,0.0050691883,0.99206173,0.00003633577],"about_ca_topic_score_codex":0.006958999,"about_ca_topic_score_gemma":0.0066387225,"teacher_disagreement_score":0.9901102,"about_ca_system_score_codex":0.0041356096,"about_ca_system_score_gemma":0.0044804616,"threshold_uncertainty_score":0.06893057},"labels":[{"model":"gemma","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4412081721","doi":"10.1109/tnse.2025.3586602","title":"Non-Cooperative Multi-Agent Reinforcement Learning Exploiting Population Dynamics","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Population; Multi-agent system; Dynamics (music); Artificial intelligence; Physics","score_opus":0.016871480215006132,"score_gpt":0.27110635325018856,"score_spread":0.25423487303518244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412081721","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.03665355,0.00011382019,0.96091056,0.00016796608,0.00002577718,0.000057425055,0.000015831187,0.0002095709,0.0018455022],"genre_scores_gemma":[0.9420219,0.000073002644,0.05604996,0.00012396679,0.000017168959,0.00013664323,0.000036840178,0.000025320727,0.0015152387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.00018127509,0.000020938996,0.00010452579,0.00011106855,0.00008370607],"domain_scores_gemma":[0.9979134,0.0012956669,0.00026307488,0.00010623967,0.0002897339,0.00013180006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013669475,0.00071484025,0.0009951305,0.00038179095,0.0004927983,0.0007414077,0.0015758789,0.00085096253,0.00095035054],"category_scores_gemma":[0.0037591548,0.00031309543,0.00040431667,0.0003171518,0.000987942,0.00082773325,0.0011949781,0.00103622,0.00018426288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025297371,0.000040785995,0.0007486873,0.0000225769,0.000024735125,0.00005310216,0.000036102905,0.9793576,0.0007695569,0.005675204,0.0002925054,0.012953805],"study_design_scores_gemma":[0.00000486761,0.000010937031,0.000029940198,0.0000010559453,0.0000017926484,0.0000046237665,0.00000265854,0.9985933,0.00008769812,0.0011940869,0.00006764497,0.000001340569],"about_ca_topic_score_codex":0.005044703,"about_ca_topic_score_gemma":0.003502861,"teacher_disagreement_score":0.005044703,"about_ca_system_score_codex":0.0008188421,"about_ca_system_score_gemma":0.0012735649,"threshold_uncertainty_score":0.010030687},"labels":[],"label_agreement":null},{"id":"W4412444461","doi":"10.1109/tnse.2025.3589296","title":"Controlled Quantum Semantic Communication for Industrial CPS Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea","keywords":"Computer science; Quantum; Computer network; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010727406985459894,"score_gpt":0.2244002337364654,"score_spread":0.2136728267510055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412444461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031861708,0.00023100684,0.95525455,0.00079608103,0.00008044332,0.00007134221,0.000105155574,0.0004984801,0.011101317],"genre_scores_gemma":[0.8583407,0.0002732698,0.1371506,0.00019980191,0.00005193651,0.00018358842,0.00014372154,0.00007640422,0.00358006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993349,0.0002111816,0.00002646441,0.000109033914,0.000266669,0.000051877687],"domain_scores_gemma":[0.9992957,0.00035479615,0.00007709771,0.0001495415,0.00009922861,0.000023646106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007612486,0.00026147286,0.0002918363,0.00037042156,0.00062347297,0.00094792247,0.00076009345,0.00071370386,0.0022650203],"category_scores_gemma":[0.0020272802,0.0001662116,0.0003244003,0.0004394955,0.0016660914,0.0020708703,0.0011959843,0.0010240414,0.00028546923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012937521,0.000061544044,0.00036227264,0.00007931388,0.000016348298,0.00013091748,0.00018450267,0.19544348,0.015271985,0.7451676,0.0023271432,0.040825523],"study_design_scores_gemma":[0.000022116323,0.00003972553,0.00012008284,0.000011323157,0.000005986897,0.0000365486,0.000033291846,0.7859366,0.0062690508,0.2011495,0.0063575613,0.00001817838],"about_ca_topic_score_codex":0.001804164,"about_ca_topic_score_gemma":0.0010784499,"teacher_disagreement_score":0.0022650203,"about_ca_system_score_codex":0.0014418076,"about_ca_system_score_gemma":0.0010421651,"threshold_uncertainty_score":0.010461092},"labels":[],"label_agreement":null},{"id":"W4412623196","doi":"10.1109/tnse.2025.3592574","title":"EMForecaster: A Deep Learning Framework for Time Series Forecasting in Wireless Networks With Distribution-Free Uncertainty Quantification","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","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":"York University","funders":"","keywords":"Computer science; Series (stratigraphy); Time series; Wireless; Artificial intelligence; Wireless network; Distribution (mathematics); Deep learning; Machine learning; Telecommunications; Mathematics; Geology","score_opus":0.008104629607450278,"score_gpt":0.21361182121287559,"score_spread":0.2055071916054253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623196","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.0046613365,0.00027406268,0.9927239,0.00024182163,0.000040942552,0.000019643832,0.00021847202,0.0013750511,0.00044477615],"genre_scores_gemma":[0.37015995,0.0010835133,0.6188797,0.00059184845,0.00026324048,0.00029866345,0.0023714409,0.0004643131,0.0058873175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996375,0.000121929435,0.000027277501,0.000103367536,0.000069968126,0.00004000092],"domain_scores_gemma":[0.9988368,0.0007124523,0.0000967264,0.00012807152,0.00017835743,0.000047624457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018328418,0.0010783729,0.0010203404,0.00077555585,0.00029038943,0.0008986643,0.0021958558,0.0013074229,0.0024792925],"category_scores_gemma":[0.0049379454,0.00049645384,0.0009477526,0.0009097808,0.0005076772,0.0015510574,0.0011530619,0.0028356307,0.0007944382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007604177,0.000048117774,0.0007709644,0.000048371287,0.00006852409,0.000050198454,0.000030264351,0.8587769,0.00079708494,0.009952408,0.0038224682,0.12555856],"study_design_scores_gemma":[0.0000021082185,0.0000031874372,0.000024194933,0.0000021731375,0.000001781869,0.00000282373,9.312206e-7,0.996944,0.00016690715,0.0026127354,0.00023760191,0.0000014925661],"about_ca_topic_score_codex":0.010376742,"about_ca_topic_score_gemma":0.011570991,"teacher_disagreement_score":0.010376742,"about_ca_system_score_codex":0.001082918,"about_ca_system_score_gemma":0.0011608895,"threshold_uncertainty_score":0.020632684},"labels":[],"label_agreement":null},{"id":"W4412719086","doi":"10.1109/tnse.2025.3592859","title":"Networked Physical Computing: A New Paradigm for Effective Task Completion via Hypergraph Aided Trusted Task-Resource Matching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Task (project management); Computer science; Matching (statistics); Resource (disambiguation); Human–computer interaction; Distributed computing; Theoretical computer science; Computer network; Mathematics; Engineering","score_opus":0.005885943865195673,"score_gpt":0.21646663738476263,"score_spread":0.21058069351956696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412719086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077466667,0.00019097113,0.98972076,0.00015042008,0.000025618729,0.00007070671,0.000037359765,0.000487773,0.0015697273],"genre_scores_gemma":[0.51879376,0.0005274816,0.4751652,0.00022199727,0.000078306824,0.00037342455,0.00030548067,0.0003364533,0.0041979626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970246,0.0010957432,0.0001781211,0.000687161,0.0007574469,0.0002569096],"domain_scores_gemma":[0.9964785,0.0012354986,0.0003705992,0.0012576332,0.0003628994,0.0002948292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021037362,0.00087842904,0.0009615715,0.00113963,0.0012312967,0.0021457828,0.0025717046,0.001087103,0.0034415363],"category_scores_gemma":[0.007949545,0.000534726,0.00078747835,0.0017694868,0.0016796035,0.0049426663,0.0044050496,0.0020254327,0.0008311796],"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.00051346637,0.00029206378,0.0023477497,0.00042291326,0.00014998476,0.00045970897,0.0012447699,0.48622397,0.02328533,0.20694841,0.0068009133,0.27131066],"study_design_scores_gemma":[0.000024514922,0.000077253775,0.0003510407,0.00002432447,0.000029265764,0.00012238119,0.00012692143,0.86725926,0.006388066,0.11758826,0.00797692,0.000031864663],"about_ca_topic_score_codex":0.0036393984,"about_ca_topic_score_gemma":0.0034352755,"teacher_disagreement_score":0.0036393984,"about_ca_system_score_codex":0.0014093716,"about_ca_system_score_gemma":0.0025900344,"threshold_uncertainty_score":0.011513114},"labels":[],"label_agreement":null},{"id":"W4412722190","doi":"10.1109/tnse.2025.3593299","title":"Hierarchical Forwarding Resource Allocation With Proactive Frame Dropping for VR Video Streaming","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Video streaming; Frame (networking); Resource allocation; Real-time computing","score_opus":0.010914537677143014,"score_gpt":0.252467645770228,"score_spread":0.241553108093085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030137097,0.00042758556,0.967672,0.000096645716,0.000055468325,0.00008608129,0.000022695527,0.00043761483,0.001064903],"genre_scores_gemma":[0.87773097,0.0002649201,0.12097086,0.00009833268,0.00007144535,0.0000758754,0.000052653275,0.00003412303,0.00070079544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914575,0.00020182718,0.000055006985,0.00017445427,0.00025422729,0.00016876483],"domain_scores_gemma":[0.99918526,0.00030108588,0.00012100441,0.00012503234,0.00019267568,0.0000748789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002986,0.0008012196,0.00064697204,0.0007350491,0.00081316783,0.0005881271,0.0018772341,0.0005083806,0.00080759206],"category_scores_gemma":[0.0022409512,0.00025677818,0.00044623943,0.0005627681,0.0005090616,0.0012885144,0.0007033857,0.00072993065,0.00014133491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036935814,0.00037734758,0.002401126,0.0002083966,0.00009290955,0.00041024963,0.0005293173,0.5374589,0.07855885,0.026595494,0.0037800637,0.34921798],"study_design_scores_gemma":[0.000013618315,0.00009301878,0.0003672055,0.000006416104,0.000021527598,0.00009109244,0.00003242047,0.9927054,0.0036345723,0.0021181186,0.00089382846,0.000022846922],"about_ca_topic_score_codex":0.0077289087,"about_ca_topic_score_gemma":0.0075631477,"teacher_disagreement_score":0.0077289087,"about_ca_system_score_codex":0.0010113732,"about_ca_system_score_gemma":0.001368742,"threshold_uncertainty_score":0.015367806},"labels":[],"label_agreement":null},{"id":"W4412984921","doi":"10.1109/tnse.2025.3596028","title":"Harnessing the Power of LLMs, Informers and Decision Transformers for Intent-Driven RAN Management in 6G","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","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":"Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ran; Transformer; Power (physics); Computer science; Electrical engineering; Telecommunications; Business; Engineering; Computer network; Physics","score_opus":0.008094078721917669,"score_gpt":0.22717910677845043,"score_spread":0.21908502805653277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412984921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026804466,0.0003047532,0.96809053,0.0005845062,0.00005933573,0.00009816302,0.00016649229,0.0016247078,0.0022670813],"genre_scores_gemma":[0.72397757,0.00027622294,0.27230448,0.000489393,0.00009113331,0.00013771155,0.0005455095,0.00013214197,0.0020457278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906725,0.00032871214,0.00006261919,0.00019107257,0.0002478345,0.000102523976],"domain_scores_gemma":[0.9980952,0.001007578,0.00020995391,0.00030059743,0.00027201843,0.00011466003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929639,0.0009801507,0.0006568325,0.00087526464,0.0005369119,0.0016580415,0.0013917034,0.0007821196,0.0016411087],"category_scores_gemma":[0.0055375486,0.00042778498,0.0007242796,0.00064629223,0.00095255295,0.0027664406,0.0016718609,0.0023693137,0.0007476427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031050356,0.00031722733,0.0077186553,0.00018990859,0.00012042568,0.00027337216,0.00045193385,0.6031006,0.0147431,0.04313464,0.004286713,0.325353],"study_design_scores_gemma":[0.00000985214,0.00004546672,0.0002485634,0.000009875223,0.000012144462,0.00003144271,0.000041702642,0.9804419,0.0023112467,0.01574248,0.0010933081,0.000011984422],"about_ca_topic_score_codex":0.004749891,"about_ca_topic_score_gemma":0.0073254826,"teacher_disagreement_score":0.004749891,"about_ca_system_score_codex":0.0009313067,"about_ca_system_score_gemma":0.0015018851,"threshold_uncertainty_score":0.01020503},"labels":[],"label_agreement":null},{"id":"W4412985034","doi":"10.1109/tnse.2025.3595949","title":"Multi-Authorized, Privacy-Protected, and Traceable Driverless Taxi Data Sharing in Internet of Vehicles","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Information privacy; The Internet; Computer security; Computer science; Internet of Things; Internet privacy; Privacy software; Business; World Wide Web","score_opus":0.02178830265999545,"score_gpt":0.24950608956094747,"score_spread":0.227717786900952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412985034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081953675,0.0004771472,0.90682626,0.001089731,0.00011782434,0.00035257245,0.00020556594,0.001505715,0.00747148],"genre_scores_gemma":[0.91241324,0.0003583146,0.08133044,0.00018250427,0.00007453456,0.00015976113,0.0003553394,0.000085387735,0.005040561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580353,0.000959565,0.00040746637,0.0010286425,0.0011538123,0.0006469652],"domain_scores_gemma":[0.9967955,0.0005564483,0.00041712876,0.0014542016,0.0005339576,0.00024273543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026704115,0.00048328855,0.000764304,0.0009416057,0.002164668,0.003732532,0.003347861,0.0016723832,0.0012703091],"category_scores_gemma":[0.0042534843,0.00053120556,0.00071841414,0.0011537931,0.0018342695,0.008147994,0.0042790375,0.0015109566,0.0005777387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012437457,0.0007445374,0.0077013043,0.00048653618,0.00018521259,0.0021088587,0.0024951284,0.23656799,0.04499142,0.3768452,0.01226118,0.314369],"study_design_scores_gemma":[0.000040792827,0.00014355926,0.00081567484,0.00003956775,0.00006843491,0.00062224973,0.00074261846,0.868342,0.025667133,0.07793432,0.02548349,0.000100152],"about_ca_topic_score_codex":0.0059153493,"about_ca_topic_score_gemma":0.0048516835,"teacher_disagreement_score":0.0059153493,"about_ca_system_score_codex":0.0019511563,"about_ca_system_score_gemma":0.0032094745,"threshold_uncertainty_score":0.014156699},"labels":[],"label_agreement":null},{"id":"W4413074920","doi":"10.1109/tnse.2025.3589594","title":"Intent-Driven Cognitive xDFC Bridge in Endogenous Intelligent IIoT: A Systematic Review and S$^{2}$Croft Architecture With Bayesian-CRO-Fuzzy Synergy","year":2025,"lang":"en","type":"review","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Bridge (graph theory); Bayesian probability; Fuzzy logic; Computer science; Cognitive architecture; Architecture; Fuzzy cognitive map; Fuzzy control system; Artificial intelligence; Cognition; Neuroscience; Neuro-fuzzy; Biology; Geography","score_opus":0.021383090031484427,"score_gpt":0.2507659565607459,"score_spread":0.2293828665292615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413074920","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020591712,0.9913378,0.003620908,0.00083675503,0.00009425424,0.0004285436,0.00013279244,0.000021760146,0.0014680587],"genre_scores_gemma":[0.034882486,0.9525721,0.010019513,0.0008729541,0.00010741046,0.00084073923,0.00025340603,0.000013430515,0.0004378754],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99629456,0.0016592757,0.0008343207,0.00035344952,0.00072590075,0.00013250591],"domain_scores_gemma":[0.9802507,0.014980136,0.0018049015,0.0005141894,0.0022229364,0.00022709322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010699434,0.0011476967,0.0037034878,0.007690005,0.00074037333,0.0029232383,0.002727507,0.0017158485,0.0051267077],"category_scores_gemma":[0.025677167,0.0008694259,0.0050379923,0.0067740423,0.0012161661,0.005021007,0.0018233401,0.0014439786,0.00049411645],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041309063,0.00017403021,0.0021487004,0.2845309,0.003568817,0.00022760333,0.0009530733,0.0014308738,0.0002684814,0.005948204,0.0030121345,0.697324],"study_design_scores_gemma":[0.0006387721,0.0019568088,0.015214514,0.6641667,0.04541896,0.0017199402,0.004443499,0.005790081,0.0018171258,0.026799621,0.23172073,0.00031326426],"about_ca_topic_score_codex":0.013484714,"about_ca_topic_score_gemma":0.035985637,"teacher_disagreement_score":0.013484714,"about_ca_system_score_codex":0.003862483,"about_ca_system_score_gemma":0.017339164,"threshold_uncertainty_score":0.056584716},"labels":[],"label_agreement":null},{"id":"W4413212194","doi":"10.1109/tnse.2025.3597541","title":"A Two-Level Dirichlet Framework for Heterogeneous Federated Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.03232322381614552,"score_gpt":0.2968801529724322,"score_spread":0.2645569291562867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212194","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.0041770367,0.00015581372,0.99417406,0.00022340046,0.00002716158,0.00003577528,0.000094156654,0.00032794054,0.0007846586],"genre_scores_gemma":[0.45464444,0.00048640408,0.5350954,0.0004720099,0.00018607955,0.0004816069,0.0009089452,0.00042665075,0.0072984276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971059,0.0014182606,0.000112620466,0.0006088396,0.0004447833,0.00030963527],"domain_scores_gemma":[0.9964367,0.0020261924,0.00021454193,0.0005605153,0.00047074028,0.00029133877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047442517,0.0009947082,0.0015256099,0.0013420717,0.0012913309,0.0027028492,0.0037626387,0.001959398,0.0028985692],"category_scores_gemma":[0.009792407,0.0007832928,0.0018436235,0.0015831203,0.0018311397,0.0034134067,0.0034412341,0.0024599957,0.0010239708],"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.00014936311,0.00006600126,0.0009415046,0.000071643684,0.000053041542,0.00010293791,0.00021680165,0.88166213,0.0008436221,0.07957209,0.0025777319,0.0337431],"study_design_scores_gemma":[0.0000061220053,0.000008729691,0.000047089805,0.000004868248,0.000003896207,0.000014159907,0.000021181178,0.96617883,0.00019817175,0.032743167,0.0007675058,0.000006264908],"about_ca_topic_score_codex":0.008793199,"about_ca_topic_score_gemma":0.01093428,"teacher_disagreement_score":0.008793199,"about_ca_system_score_codex":0.0030700527,"about_ca_system_score_gemma":0.0021701357,"threshold_uncertainty_score":0.025090277},"labels":[],"label_agreement":null},{"id":"W4413344225","doi":"10.1109/tnse.2025.3600480","title":"Cost Minimization Resource Allocation with Service Instance Caching and Task Migration for UAV Mobile Edge Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Resource allocation; Task (project management); Minification; Edge computing; Distributed computing; Enhanced Data Rates for GSM Evolution; Service (business); Resource management (computing); Mobile computing; Computer network; Resource (disambiguation); Mobile telephony; Server; Mobile radio; Telecommunications; Engineering; Business; World Wide Web","score_opus":0.008862454812937463,"score_gpt":0.2191240592672707,"score_spread":0.21026160445433323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413344225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050547794,0.00071756245,0.9433986,0.00046256382,0.000089429624,0.00006404439,0.000057771398,0.00039994778,0.004262234],"genre_scores_gemma":[0.9321944,0.00023120352,0.065228015,0.00013527228,0.000030028941,0.00009923023,0.0000868295,0.00006572079,0.0019292234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996549,0.00010191436,0.000016277912,0.00007309112,0.000064669846,0.00008901768],"domain_scores_gemma":[0.9995413,0.0002463477,0.0000643835,0.00003375696,0.00006488513,0.00004938451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057484617,0.0008379723,0.0007823604,0.0002806136,0.00036598998,0.00082348345,0.00095345185,0.00073306484,0.0015058797],"category_scores_gemma":[0.0013732382,0.00030692676,0.0005177055,0.00039187924,0.0004932663,0.0005875021,0.0007036106,0.0008374091,0.00018781533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061719744,0.000025282983,0.00037641334,0.000035310244,0.000014147575,0.000051531508,0.000019780768,0.9849855,0.0011233898,0.0024886806,0.00058252603,0.010235694],"study_design_scores_gemma":[0.0000034225811,0.0000074122595,0.00003372472,0.0000016567196,0.0000023401958,0.0000036592876,0.0000031322209,0.99931824,0.00014144157,0.0003953912,0.00008835113,0.0000011519203],"about_ca_topic_score_codex":0.009765088,"about_ca_topic_score_gemma":0.008146799,"teacher_disagreement_score":0.009765088,"about_ca_system_score_codex":0.00091859483,"about_ca_system_score_gemma":0.0014977747,"threshold_uncertainty_score":0.019416511},"labels":[],"label_agreement":null},{"id":"W4413887263","doi":"10.1109/tnse.2025.3604633","title":"TOAST: Task-Oriented Adaptive Semantic Transmission Over Dynamic Wireless Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Task (project management); Wireless transmission; Wireless; Transmission (telecommunications); Distributed computing; Computer network; Telecommunications; Engineering; Systems engineering","score_opus":0.003366876116025351,"score_gpt":0.19159172180419165,"score_spread":0.1882248456881663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413887263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151378475,0.00026646283,0.98152035,0.00016605786,0.0000630118,0.0000325784,0.00008764406,0.0009591784,0.0017667708],"genre_scores_gemma":[0.7554645,0.00072044675,0.23636769,0.00038351468,0.00012963028,0.00014998477,0.0005963192,0.00037286108,0.00581515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996315,0.000108913286,0.000017236101,0.00006352765,0.00012108893,0.000057653073],"domain_scores_gemma":[0.99947935,0.00020564756,0.00005811026,0.00009078084,0.00012219696,0.000043870703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000784084,0.0007722802,0.00059616513,0.00035910873,0.00029661728,0.0007571663,0.0011571595,0.0005724622,0.0016072616],"category_scores_gemma":[0.002250802,0.00018615529,0.00042681285,0.00044657112,0.00055599585,0.0016189449,0.0013981828,0.0010842883,0.0005317017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045081982,0.00022297923,0.0012681031,0.00021277418,0.00010122905,0.00029541613,0.0003017447,0.54981893,0.04523653,0.034348626,0.010366223,0.3573767],"study_design_scores_gemma":[0.000015852227,0.00009035037,0.0001701933,0.000010836074,0.000014481681,0.00009284311,0.00003930516,0.9789276,0.0054295906,0.01229459,0.0028965825,0.000017753213],"about_ca_topic_score_codex":0.0016672306,"about_ca_topic_score_gemma":0.002626294,"teacher_disagreement_score":0.0016672306,"about_ca_system_score_codex":0.000391705,"about_ca_system_score_gemma":0.0006759192,"threshold_uncertainty_score":0.0053768754},"labels":[],"label_agreement":null},{"id":"W4413966964","doi":"10.1109/tnse.2025.3605822","title":"Joint Deterministic and Probabilistic Edge Caching Minimized Service Time for Cooperative Video Transmission in VANETs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Foundation for Science and Technology Development","keywords":"Computer science; Probabilistic logic; Computer network; Joint (building); Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Service (business); Real-time computing; Distributed computing; Telecommunications; Engineering; Artificial intelligence","score_opus":0.011236819168433821,"score_gpt":0.21549381182947838,"score_spread":0.20425699266104455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06347188,0.000596283,0.9328131,0.00024096033,0.000045405952,0.00005402946,0.00007538921,0.0001758063,0.00252717],"genre_scores_gemma":[0.96779925,0.00026764764,0.030547407,0.000059264043,0.000022389715,0.00006529685,0.000058701884,0.000034652185,0.0011454076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991015,0.0002842979,0.00003869463,0.00017125446,0.00020455544,0.00019978949],"domain_scores_gemma":[0.9980539,0.0012013651,0.00021816781,0.000084680294,0.00034344158,0.00009840601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013226942,0.00091605395,0.0012393473,0.0006553802,0.00053456315,0.001106585,0.0013402265,0.0009339672,0.0008487821],"category_scores_gemma":[0.004821199,0.00054277806,0.0005979967,0.0011982943,0.0007907923,0.001025589,0.0008775147,0.00066883944,0.00010883619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029210705,0.0000109440425,0.00020283346,0.000024237963,0.00001103778,0.000027800203,0.000018713383,0.99148667,0.00053880486,0.0030061023,0.00020337694,0.004440317],"study_design_scores_gemma":[0.0000026216387,0.000015256829,0.000053089203,0.0000014941395,0.00000450391,0.0000076542665,0.000008235805,0.99886143,0.00013274941,0.00085071503,0.000059556172,0.0000026831772],"about_ca_topic_score_codex":0.0157719,"about_ca_topic_score_gemma":0.012652738,"teacher_disagreement_score":0.0157719,"about_ca_system_score_codex":0.0019458474,"about_ca_system_score_gemma":0.0021845482,"threshold_uncertainty_score":0.03136021},"labels":[],"label_agreement":null},{"id":"W4414153664","doi":"10.1109/tnse.2025.3609198","title":"Quantum Deep Reinforcement Learning for Digital Twin-Enabled 6G Networks and Semantic Communications: Considerations for Adoption and Security","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; National Research Foundation of Korea; Royal Academy of Engineering","keywords":"Reinforcement learning; Wireless network; Leverage (statistics); Wireless; Context (archaeology); Deep learning","score_opus":0.012453191073503794,"score_gpt":0.22750337126005823,"score_spread":0.21505018018655445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414153664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031057006,0.003386335,0.93859226,0.006585503,0.00033573702,0.00006091248,0.00011474674,0.0003954738,0.019471904],"genre_scores_gemma":[0.873369,0.0025629657,0.11486471,0.001084722,0.00015872656,0.00009495277,0.00010854997,0.00007878883,0.007677558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995029,0.00018233962,0.000019434538,0.0000867547,0.00013837063,0.00007020827],"domain_scores_gemma":[0.9987961,0.0006550445,0.00008909538,0.00015626858,0.00019638866,0.00010712819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018637459,0.00045193316,0.00066841877,0.00027599602,0.00045814688,0.0016408751,0.0011908171,0.0011976063,0.0033912335],"category_scores_gemma":[0.0046443935,0.0002639712,0.0002981574,0.0003639707,0.0018392621,0.0030869963,0.0016179264,0.0024713154,0.0004485999],"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.0001732199,0.000077666766,0.0011204239,0.0001878768,0.000056375236,0.00016604547,0.00014120927,0.30452594,0.0035220638,0.5940834,0.0058044987,0.09014121],"study_design_scores_gemma":[0.000010553515,0.000041241798,0.00009909398,0.000033604956,0.000008441756,0.00003314488,0.000029630175,0.871979,0.000838939,0.12255815,0.0043559065,0.0000122781985],"about_ca_topic_score_codex":0.00254457,"about_ca_topic_score_gemma":0.0036800243,"teacher_disagreement_score":0.0033912335,"about_ca_system_score_codex":0.0015646712,"about_ca_system_score_gemma":0.001270375,"threshold_uncertainty_score":0.011352479},"labels":[],"label_agreement":null},{"id":"W4414270564","doi":"10.1109/tnse.2025.3611109","title":"Teleportation Links: Mitigating Catastrophic Forgetting in Decentralized Federated Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","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 Calgary; Memorial University of Newfoundland; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Forgetting; Reliability (semiconductor); Resilience (materials science); Key (lock); Stability (learning theory); Convergence (economics); Dependency (UML); Focus (optics)","score_opus":0.009706725128198496,"score_gpt":0.23684827012355947,"score_spread":0.22714154499536096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414270564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21214533,0.00043258723,0.78388727,0.00045309062,0.00008075434,0.00008298145,0.00005160633,0.0012883375,0.0015780443],"genre_scores_gemma":[0.9816968,0.00006560892,0.017576035,0.00010632279,0.000022971166,0.000052367985,0.000032837936,0.000026394402,0.00042075667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987191,0.0004050716,0.00008916391,0.0002723045,0.0003026141,0.00021179345],"domain_scores_gemma":[0.987832,0.006846245,0.0014149963,0.0021646232,0.0012360499,0.0005061438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036179721,0.000824005,0.0012472715,0.00071683124,0.0011255741,0.0011202535,0.0023644362,0.0014372735,0.0011075685],"category_scores_gemma":[0.019334381,0.00040951028,0.0004907638,0.00062221003,0.0015977406,0.003458082,0.0030684131,0.0015286817,0.00021695945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053678924,0.00029100972,0.0036442066,0.000120780576,0.00009883456,0.00037315054,0.0004613517,0.88598466,0.0053638094,0.008900237,0.0014557516,0.09276947],"study_design_scores_gemma":[0.000032087144,0.0001333988,0.0002680341,0.000010082802,0.000016870821,0.00007570797,0.000042118587,0.9904231,0.0021172871,0.006617489,0.00025280914,0.000011106759],"about_ca_topic_score_codex":0.0018979089,"about_ca_topic_score_gemma":0.001977379,"teacher_disagreement_score":0.0036179721,"about_ca_system_score_codex":0.0007202197,"about_ca_system_score_gemma":0.0010605868,"threshold_uncertainty_score":0.019133866},"labels":[],"label_agreement":null},{"id":"W4414270633","doi":"10.1109/tnse.2025.3611273","title":"Channel Estimation for Reconfigurable Intelligent Surface-Aided 6G NOMA Systems: A Quantum Machine Learning Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Canada Excellence Research Chairs, Government of Canada","keywords":"Mean squared error; Convolutional neural network; Channel (broadcasting); Artificial neural network; Quantum; Feature (linguistics); Recurrent neural network; Wireless; Deep learning","score_opus":0.017434516589577304,"score_gpt":0.2295099038537741,"score_spread":0.21207538726419678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414270633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09368083,0.001078112,0.89646226,0.00080167403,0.00012234712,0.000042393385,0.00013596062,0.0008477134,0.006828762],"genre_scores_gemma":[0.9557787,0.00032711212,0.041075107,0.00015972792,0.000038440427,0.000036710313,0.0000809898,0.000036961028,0.0024663338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998654,0.000033883098,0.0000057264933,0.000030497335,0.000039149832,0.000025374608],"domain_scores_gemma":[0.99970835,0.00014137728,0.000042423864,0.000027307104,0.000068333386,0.000012235131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035232506,0.00044341118,0.00039441936,0.0002183324,0.0002950235,0.0005981087,0.00067635835,0.00053447986,0.0013554824],"category_scores_gemma":[0.00084850675,0.0002117444,0.00032872055,0.00022590024,0.0005043266,0.0010609577,0.00045015055,0.0007480772,0.00022487815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010502171,0.000060303944,0.0014278723,0.00010790657,0.000049222213,0.00011060475,0.000069503076,0.9086256,0.010756813,0.014037338,0.0013238685,0.06332602],"study_design_scores_gemma":[0.0000011887288,0.000009077031,0.00007091809,0.0000026630973,0.0000029404378,0.00000682039,0.0000036741596,0.9979049,0.0007430846,0.0010641713,0.00018792188,0.0000027320339],"about_ca_topic_score_codex":0.004082969,"about_ca_topic_score_gemma":0.005883179,"teacher_disagreement_score":0.004082969,"about_ca_system_score_codex":0.0007366268,"about_ca_system_score_gemma":0.00062753365,"threshold_uncertainty_score":0.008118451},"labels":[],"label_agreement":null},{"id":"W4414322240","doi":"10.1109/tnse.2025.3611954","title":"Blockchain Meets Adaptive Honeypots: A Trust-Aware Approach to Next-Gen IoT Security","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Algoma University","funders":"","keywords":"Intrusion detection system; Anomaly detection; Provisioning; Authentication (law); Bandwidth (computing); Network security; Server; Quality of service; Denial-of-service attack","score_opus":0.00991212933407285,"score_gpt":0.2097880754535438,"score_spread":0.19987594611947096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414322240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06840976,0.00080474507,0.9205005,0.0007718844,0.00016849475,0.0002921767,0.00015788876,0.002853054,0.006041451],"genre_scores_gemma":[0.9349536,0.0002835238,0.061305106,0.00010196203,0.000042188378,0.00012410466,0.00018957496,0.00005459446,0.002945281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990677,0.00021061735,0.00006080479,0.00015810656,0.00033484155,0.00016793016],"domain_scores_gemma":[0.9988123,0.00030945076,0.00016930551,0.00027574247,0.00024321822,0.00018991741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295143,0.0005105,0.0007220629,0.00059449667,0.00072692934,0.0010787505,0.0015743604,0.0007859142,0.0026515862],"category_scores_gemma":[0.0025471614,0.0002361671,0.00039086648,0.00053319935,0.0007339274,0.002605499,0.0020727708,0.00078475603,0.0005483506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006970959,0.0004802955,0.008699111,0.00034047628,0.0001579656,0.00117087,0.00050804066,0.508518,0.026542336,0.07494088,0.00953801,0.36840695],"study_design_scores_gemma":[0.000021576752,0.00008503995,0.00031201425,0.000012056435,0.000014299277,0.00011734618,0.000037065103,0.9777713,0.0025753295,0.015530826,0.0035073434,0.000015776137],"about_ca_topic_score_codex":0.0023903672,"about_ca_topic_score_gemma":0.0034723699,"teacher_disagreement_score":0.0026515862,"about_ca_system_score_codex":0.0007056261,"about_ca_system_score_gemma":0.0016825076,"threshold_uncertainty_score":0.008870363},"labels":[],"label_agreement":null},{"id":"W4414798846","doi":"10.1109/tnse.2025.3617381","title":"Energy-Efficient Multi-User Adaptive 360$^{\\circ }$ Video Streaming: A Two-Step Approach With Device Video Super-Resolution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","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 Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Benchmark (surveying); Video quality; Bandwidth (computing); Scheme (mathematics); Energy (signal processing); Quality of experience; Video tracking","score_opus":0.01743302987910434,"score_gpt":0.24567343955417914,"score_spread":0.2282404096750748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414798846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023635328,0.00038624715,0.97318596,0.00009372871,0.0000522473,0.00007198832,0.000023968876,0.0003615058,0.002188955],"genre_scores_gemma":[0.50607324,0.0005068718,0.48993918,0.000114166665,0.00008481631,0.000116892115,0.00009187865,0.00006724268,0.0030056792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.000059858576,0.000017801705,0.00007934845,0.0001345855,0.00003447323],"domain_scores_gemma":[0.9996917,0.00010911498,0.000031847194,0.00005906021,0.00007929582,0.000029047382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003307863,0.0006151631,0.0006506894,0.0003447375,0.00032608522,0.0005048949,0.0013452992,0.00040106828,0.0011545726],"category_scores_gemma":[0.0007595175,0.00026436333,0.00038299992,0.0004296635,0.0003280581,0.0008934908,0.00074433634,0.0006013738,0.00033330038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006199673,0.00032147154,0.0015911415,0.000307871,0.00010759248,0.00053241244,0.0005033046,0.2779969,0.21590942,0.01831236,0.003489284,0.4803082],"study_design_scores_gemma":[0.000013659051,0.00011649088,0.00024832552,0.000007497673,0.000014517704,0.00013978292,0.000030849445,0.98319304,0.013011614,0.0010856114,0.002119389,0.000019262643],"about_ca_topic_score_codex":0.001539858,"about_ca_topic_score_gemma":0.0017222671,"teacher_disagreement_score":0.001539858,"about_ca_system_score_codex":0.00032379714,"about_ca_system_score_gemma":0.00043690376,"threshold_uncertainty_score":0.0038624406},"labels":[],"label_agreement":null},{"id":"W4414798884","doi":"10.1109/tnse.2025.3617881","title":"Semantic Edge–Cloud Communication for Real-Time Urban Traffic Surveillance With ViT and LLMs Over Mobile Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Process (computing); Intelligent transportation system; Wireless; Edge computing; Smart city; Software deployment; Mobile device","score_opus":0.004150613597961992,"score_gpt":0.20146961355246193,"score_spread":0.19731899995449995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414798884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09363699,0.0005062706,0.89050466,0.00046218393,0.00014271877,0.00014954702,0.00046435677,0.007900128,0.0062331916],"genre_scores_gemma":[0.89833033,0.00014559216,0.09867916,0.00020727619,0.000047039,0.00009203879,0.00054770854,0.00014059318,0.0018103427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996531,0.00007829749,0.000017215578,0.00007482228,0.000102427584,0.000074155105],"domain_scores_gemma":[0.9996408,0.000109044944,0.000038449416,0.00010364822,0.00007903405,0.000028956265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036511495,0.00063421915,0.00045954634,0.00048492276,0.00048184232,0.0007893641,0.0009914077,0.0006085876,0.0028708756],"category_scores_gemma":[0.0016481236,0.0001611581,0.00026640625,0.0004689774,0.00033351494,0.0018908872,0.0016932028,0.00059344113,0.0008159034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018298685,0.0004239923,0.0043144003,0.00025311628,0.000096243595,0.0011464957,0.0006569452,0.12429396,0.11061063,0.019098045,0.023625681,0.71365064],"study_design_scores_gemma":[0.000025776013,0.000081869526,0.00061292393,0.000012643364,0.00001651385,0.00017013645,0.0001381391,0.96536946,0.0226174,0.0062922286,0.0046414835,0.000021444908],"about_ca_topic_score_codex":0.003027023,"about_ca_topic_score_gemma":0.003874106,"teacher_disagreement_score":0.003027023,"about_ca_system_score_codex":0.0005871475,"about_ca_system_score_gemma":0.0004453653,"threshold_uncertainty_score":0.009604096},"labels":[],"label_agreement":null},{"id":"W4414871454","doi":"10.1109/tnse.2025.3617102","title":"RadioMamba: Breaking the Accuracy-Efficiency Trade-Off in Radio Map Construction via a Hybrid Mamba-UNet","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Block (permutation group theory); Context (archaeology); Channel (broadcasting); Wireless; Architecture; Feature (linguistics); Global optimization","score_opus":0.004994350136934099,"score_gpt":0.2012223092473511,"score_spread":0.196227959110417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022986362,0.000406538,0.9692653,0.0002989835,0.000091658665,0.000043576765,0.00012552795,0.0031642695,0.0036178383],"genre_scores_gemma":[0.5428732,0.00033219284,0.44688833,0.00047838985,0.000058121044,0.00017644498,0.00062284764,0.00035411117,0.0082163345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982625,0.000030673862,0.000007761575,0.000046437737,0.000059253725,0.000029657971],"domain_scores_gemma":[0.9997185,0.00008302654,0.000026352147,0.0000737658,0.00007390903,0.000024494197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045349516,0.0006602542,0.00056237343,0.000342161,0.0003168209,0.00071555324,0.0016320507,0.00068821077,0.002809397],"category_scores_gemma":[0.001420393,0.00036111413,0.00040390948,0.00031047166,0.0004892486,0.0012369716,0.0013920624,0.0012219686,0.0011423401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002967643,0.00012559885,0.0016700407,0.00015149984,0.00011463936,0.00013805114,0.00008628629,0.5103886,0.034008138,0.017243933,0.0077850493,0.4279914],"study_design_scores_gemma":[0.0000070819633,0.00003332719,0.00012807995,0.00000503055,0.000008096183,0.000030340236,0.0000057677903,0.9919516,0.0038713717,0.0019969274,0.0019567742,0.0000055982778],"about_ca_topic_score_codex":0.004282186,"about_ca_topic_score_gemma":0.008236339,"teacher_disagreement_score":0.004282186,"about_ca_system_score_codex":0.00049566117,"about_ca_system_score_gemma":0.00091541355,"threshold_uncertainty_score":0.009398401},"labels":[],"label_agreement":null},{"id":"W4414871532","doi":"10.1109/tnse.2025.3617848","title":"Location-Aware Anti-Jamming Game: An Intelligent Approach for Reliable Wireless Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Stochastic game; Wireless; Jamming; Residual; Transmitter; Key (lock); Interference (communication); Game theory","score_opus":0.01659383210616466,"score_gpt":0.24820799494981027,"score_spread":0.2316141628436456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023615686,0.00016933272,0.9713387,0.0003048204,0.00004885594,0.00007829115,0.000052661588,0.00033537985,0.0040562684],"genre_scores_gemma":[0.75728226,0.00022860157,0.23610201,0.00032360535,0.000071714785,0.00024876473,0.00017287277,0.00011496211,0.0054552737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.000115809205,0.000017092729,0.00009277663,0.00010789018,0.00009100994],"domain_scores_gemma":[0.9992537,0.0004224501,0.00008385766,0.000049666778,0.00011681253,0.0000734019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007896112,0.0011116845,0.001346452,0.0006057382,0.0005224979,0.0009468249,0.0024560671,0.0014264766,0.003379486],"category_scores_gemma":[0.0019584442,0.0005509048,0.00080020213,0.00044118648,0.0011464488,0.0014949242,0.0013903494,0.002006478,0.00040741733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045261462,0.00004284048,0.00031692616,0.0000421975,0.000024959596,0.00006406808,0.000040329312,0.9683178,0.0013180729,0.012995217,0.00082184165,0.01597045],"study_design_scores_gemma":[0.0000030928106,0.000007884787,0.000017102559,0.000001379782,0.0000019316235,0.0000044321732,0.000002730799,0.9978325,0.0000912303,0.0019457184,0.000090281195,0.0000016587255],"about_ca_topic_score_codex":0.009198964,"about_ca_topic_score_gemma":0.010428589,"teacher_disagreement_score":0.009198964,"about_ca_system_score_codex":0.0013223893,"about_ca_system_score_gemma":0.0018575718,"threshold_uncertainty_score":0.018290818},"labels":[],"label_agreement":null},{"id":"W4415003132","doi":"10.1109/tnse.2025.3620231","title":"A Generative Model-Guided Distributed DRL Framework for Scalable and Efficient SFC Orchestration in Future Network Architectures","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Embedded Systems Design Techniques","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":"Ciena (Canada); Terry Fox Research Institute; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Provisioning; Scalability; Orchestration; Generative grammar; Virtual network; Generative model; Workload; Reinforcement learning","score_opus":0.013380991079037188,"score_gpt":0.2548339935950841,"score_spread":0.2414530025160469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415003132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007566589,0.00015712007,0.9890454,0.00016755071,0.000024002738,0.00002428637,0.00003778895,0.0006337578,0.0023435291],"genre_scores_gemma":[0.8049903,0.00021697662,0.18916531,0.00026067655,0.000040595085,0.00014714172,0.00018694853,0.00023601089,0.0047560465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00011310006,0.000017353077,0.00010251716,0.00011805213,0.000083808794],"domain_scores_gemma":[0.99950767,0.00019298724,0.00006808058,0.00005822941,0.0001171571,0.000055960023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008988592,0.0007483317,0.0007080019,0.00036383746,0.00043004684,0.0010753486,0.0017557223,0.0009454213,0.0029741672],"category_scores_gemma":[0.0013447892,0.00045583092,0.00067595043,0.00035667876,0.00091663026,0.0010941676,0.0014837718,0.0014265779,0.0005394231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022618107,0.00001822955,0.00023250216,0.00001949548,0.000011174065,0.000048551443,0.00003872771,0.9740457,0.0014025312,0.007268167,0.0006549861,0.01623732],"study_design_scores_gemma":[0.0000022306078,0.0000049031573,0.000013215681,0.0000011173388,0.0000015801999,0.0000050839985,0.0000034730615,0.99821883,0.00012296767,0.0014022064,0.0002229064,0.0000014827738],"about_ca_topic_score_codex":0.009367569,"about_ca_topic_score_gemma":0.012115746,"teacher_disagreement_score":0.009367569,"about_ca_system_score_codex":0.0013446528,"about_ca_system_score_gemma":0.0014671016,"threshold_uncertainty_score":0.018626034},"labels":[],"label_agreement":null},{"id":"W4415178829","doi":"10.1109/tnse.2025.3621342","title":"RobGenX: Uncertainty-Aware Inference in eXtreme Computing Power Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar University","keywords":"Inference; Integer programming; Enhanced Data Rates for GSM Evolution; Edge computing; Probabilistic logic; Linear programming; Approximate inference; Task (project management); Cloud computing; Stochastic programming","score_opus":0.011463482233228198,"score_gpt":0.21315950802231107,"score_spread":0.20169602578908286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415178829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009762178,0.0003172595,0.9861921,0.0003114681,0.00004241089,0.00003537701,0.00011983214,0.0007962139,0.00242316],"genre_scores_gemma":[0.6607146,0.00046810877,0.33311537,0.0004507317,0.00012863627,0.00024020813,0.0005865478,0.00044262834,0.003853195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00021872927,0.000022671473,0.00014332829,0.00013117192,0.000079439706],"domain_scores_gemma":[0.9988827,0.0007394396,0.00010666789,0.00008863029,0.00011807915,0.00006440935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600475,0.0010213198,0.0010921073,0.00034070076,0.00050308806,0.00132197,0.0018947022,0.0010688966,0.0027533458],"category_scores_gemma":[0.0037452194,0.0006923282,0.00078505895,0.0004773094,0.0010241293,0.0013926048,0.0018989553,0.0022574905,0.0003883296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027424343,0.00000927134,0.00019149596,0.000033199252,0.000014518667,0.000030547944,0.000018651548,0.9830651,0.0002936267,0.0052351765,0.0007656968,0.010315282],"study_design_scores_gemma":[0.0000044115354,0.000004891775,0.000024852652,0.0000036557535,0.0000017337829,0.000004639499,0.000003461158,0.9953727,0.00012758451,0.0041603968,0.0002897734,0.0000017699459],"about_ca_topic_score_codex":0.007319116,"about_ca_topic_score_gemma":0.008134872,"teacher_disagreement_score":0.007319116,"about_ca_system_score_codex":0.00097258884,"about_ca_system_score_gemma":0.0016772003,"threshold_uncertainty_score":0.01455307},"labels":[],"label_agreement":null},{"id":"W4415178863","doi":"10.1109/tnse.2025.3620950","title":"Resilience and Failure Analysis in Next-Generation Communication Networks: A Contemporary Survey","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Resilience (materials science); Adaptability; Relevance (law); Telecommunications network; Key (lock); Cascading failure; Network science; Network topology; Standardization","score_opus":0.018761729947281043,"score_gpt":0.22304379815637435,"score_spread":0.2042820682090933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415178863","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012861884,0.7178924,0.22591363,0.010654821,0.0011672389,0.00007387456,0.0002077413,0.0003370855,0.030891323],"genre_scores_gemma":[0.17206678,0.79613966,0.022886256,0.0011036271,0.003510825,0.000093134426,0.00026155295,0.000085847176,0.0038524615],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999178,0.00021671194,0.000060632738,0.00015416645,0.00032217085,0.00006828372],"domain_scores_gemma":[0.99614257,0.0029631443,0.00022090103,0.00018085969,0.00042639417,0.00006616024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062735,0.00096375996,0.0010860328,0.004124838,0.0008466988,0.0020717366,0.0013060159,0.0017804132,0.0022583136],"category_scores_gemma":[0.0045625065,0.0004802984,0.0006665508,0.0051530655,0.0021021874,0.004945477,0.0013132408,0.0017677391,0.00053218286],"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.00006539605,0.0001013937,0.0042641,0.004996356,0.00014623922,0.00026011525,0.00062400365,0.10551772,0.00093505264,0.29816788,0.019986235,0.5649355],"study_design_scores_gemma":[0.000011709791,0.00014680318,0.004339618,0.0027783832,0.00011527814,0.0012406671,0.0013106456,0.1171954,0.0013316,0.5289045,0.3424871,0.00013833403],"about_ca_topic_score_codex":0.0024639375,"about_ca_topic_score_gemma":0.0010775478,"teacher_disagreement_score":0.004124838,"about_ca_system_score_codex":0.0013297783,"about_ca_system_score_gemma":0.0010802113,"threshold_uncertainty_score":0.009648263},"labels":[],"label_agreement":null},{"id":"W4415624250","doi":"10.1109/tnse.2025.3626216","title":"Joint Uplink-Downlink Transmission Design and Full-Loop Control for Latency-Critical Cyber-Physical Systems","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Stability and Control of Uncertain Systems","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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Telecommunications link; Transmission (telecommunications); Multicast; Wireless; Resource allocation; Integer programming; Scheme (mathematics); Wireless network","score_opus":0.014349464122757255,"score_gpt":0.23373383428335168,"score_spread":0.21938437016059442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01804811,0.00025625178,0.9790669,0.0001182957,0.000030977724,0.00003600748,0.000016433218,0.000112998314,0.0023139825],"genre_scores_gemma":[0.9636413,0.00021683061,0.034745913,0.00005940247,0.00004465264,0.00011077445,0.000032281936,0.000025075204,0.0011238639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990357,0.00026099864,0.00004984421,0.00021022573,0.0002829711,0.0001602704],"domain_scores_gemma":[0.99936706,0.000238288,0.0001450696,0.00004106442,0.00017077116,0.000037797465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012648177,0.0011132668,0.0008320383,0.00040812834,0.00069862977,0.0012556884,0.0010321543,0.00077199546,0.0017341849],"category_scores_gemma":[0.0015968241,0.00038183737,0.0005054715,0.00043153975,0.0007708028,0.001246112,0.0011177033,0.00083354005,0.00019294182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013946876,0.00006306597,0.00038351736,0.00014628137,0.000032521402,0.000102653205,0.00014190454,0.9433601,0.0077168057,0.012909533,0.0006824292,0.03432162],"study_design_scores_gemma":[0.000007512833,0.000061039675,0.000047352736,0.0000031084326,0.0000056775425,0.000012021398,0.000009502746,0.997511,0.0007228012,0.0014632189,0.00015260176,0.0000041211315],"about_ca_topic_score_codex":0.002690396,"about_ca_topic_score_gemma":0.0018749749,"teacher_disagreement_score":0.002690396,"about_ca_system_score_codex":0.00076780806,"about_ca_system_score_gemma":0.0011734975,"threshold_uncertainty_score":0.006689012},"labels":[],"label_agreement":null},{"id":"W4415624267","doi":"10.1109/tnse.2025.3626049","title":"Model Predictive Congestion Control for Data Center Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Model predictive control; Network congestion; Data center; Flow control (data); Ranging; Queueing theory; Control (management); Flow (mathematics); Online algorithm","score_opus":0.017283859195113105,"score_gpt":0.23165786906578817,"score_spread":0.21437400987067506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023113525,0.0007880706,0.97117156,0.00035951426,0.00012925206,0.00004520033,0.000059605005,0.00052577734,0.0038075275],"genre_scores_gemma":[0.9818507,0.0003524629,0.015994806,0.0000678443,0.000050657094,0.00006742196,0.00005204776,0.00003199925,0.0015320961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.00007959968,0.00001140718,0.00007750057,0.00010437,0.00006926843],"domain_scores_gemma":[0.99923503,0.0003949812,0.00009867856,0.00004607573,0.00018580724,0.000039470837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075118785,0.00077921606,0.0008470087,0.00034876217,0.00052941666,0.0010360616,0.001057745,0.00049155735,0.000965565],"category_scores_gemma":[0.0020851367,0.0003458635,0.00032692598,0.00048674812,0.00081326853,0.0008585251,0.00075639214,0.0015808692,0.00009751583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022701139,0.00001532663,0.00014976395,0.000027561005,0.000008180676,0.0000141120145,0.000019268171,0.98620087,0.00052035955,0.0052114646,0.00045878056,0.007351642],"study_design_scores_gemma":[0.0000020221157,0.000004872451,0.000022255337,0.0000011820367,0.0000013120765,9.969859e-7,0.0000016805994,0.99862397,0.0001000976,0.0011149046,0.00012544723,0.0000011601495],"about_ca_topic_score_codex":0.02316694,"about_ca_topic_score_gemma":0.011763937,"teacher_disagreement_score":0.02316694,"about_ca_system_score_codex":0.0014701525,"about_ca_system_score_gemma":0.0017546304,"threshold_uncertainty_score":0.046064198},"labels":[],"label_agreement":null},{"id":"W4415821109","doi":"10.1109/tnse.2025.3628214","title":"Metaverse Hierarchical T/Key-Based Lightweight Authentication Protocol","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Authentication Protocols Security","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 Victoria; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Protocol (science); Password; Authentication (law); Otway–Rees protocol; Cryptographic protocol; Authentication protocol; Anonymity; Universal composability; Hash function","score_opus":0.010704943069454968,"score_gpt":0.26749460772937916,"score_spread":0.2567896646599242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415821109","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.042611796,0.00041308563,0.93693763,0.00049297686,0.00023667642,0.0007112074,0.0004996325,0.0067138844,0.011383074],"genre_scores_gemma":[0.81801707,0.00034256422,0.16711302,0.00037054793,0.00011497414,0.00077407714,0.0009933613,0.00031469687,0.011959683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964399,0.0009064635,0.0005618797,0.00046286784,0.0009878315,0.000641088],"domain_scores_gemma":[0.9946695,0.0011293944,0.0006739708,0.002138297,0.0010446123,0.0003442313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026155307,0.00071207236,0.0009569757,0.0015432193,0.0018234799,0.0023752078,0.0024879575,0.0020484875,0.007355941],"category_scores_gemma":[0.004837874,0.0005441134,0.0011271841,0.0010848406,0.0015728791,0.0066624144,0.0058679273,0.0020984225,0.002850346],"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.0037374005,0.000577281,0.0028476606,0.0011896598,0.00024545277,0.0021824257,0.0020222566,0.057962213,0.140259,0.54848605,0.020827835,0.21966287],"study_design_scores_gemma":[0.00055356114,0.001187578,0.0010587821,0.00015008476,0.0002632013,0.002488011,0.00040738736,0.6388472,0.1520572,0.14464357,0.057987187,0.00035623397],"about_ca_topic_score_codex":0.0009782279,"about_ca_topic_score_gemma":0.0007683654,"teacher_disagreement_score":0.007355941,"about_ca_system_score_codex":0.0011505219,"about_ca_system_score_gemma":0.0031339538,"threshold_uncertainty_score":0.024608016},"labels":[],"label_agreement":null},{"id":"W4415821121","doi":"10.1109/tnse.2025.3628244","title":"Adaptive Resilient Control Against False Data Injection Attacks for a Multi-Energy Microgrid Integrating Power and Hydrogen Energy Systems Using Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"Brock University","funders":"Japan Science and Technology Agency; Natural Sciences and Engineering Research Council of Canada","keywords":"Microgrid; Reinforcement learning; Resilience (materials science); Electric power system; Electricity; Automatic frequency control; Energy (signal processing); Power (physics)","score_opus":0.01691439725399992,"score_gpt":0.2408900165718036,"score_spread":0.22397561931780366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415821121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21578681,0.00039327258,0.77693933,0.0006844891,0.000090112684,0.000099440105,0.00004472927,0.001202322,0.004759416],"genre_scores_gemma":[0.9903526,0.0000355268,0.008702802,0.000046838566,0.00000740208,0.000030059815,0.000013550843,0.0000077845325,0.00080348016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997198,0.0000637731,0.000015887981,0.00006597543,0.000057588706,0.00007701004],"domain_scores_gemma":[0.9992538,0.00035230396,0.00013541707,0.00004811997,0.00015484892,0.000055454348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092151,0.0008440386,0.000607867,0.00022807244,0.00035334274,0.00054733217,0.0007998789,0.0006724973,0.0011324249],"category_scores_gemma":[0.0015391638,0.00027820675,0.00040929214,0.00015637431,0.00068136625,0.000448722,0.00081585214,0.0010264599,0.00011460112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006484237,0.000041934865,0.0004136323,0.000017893864,0.000021256115,0.000050974533,0.000021358144,0.9841055,0.0016576659,0.00084317237,0.00021138877,0.012550323],"study_design_scores_gemma":[0.0000037049906,0.000016498527,0.000035172194,8.273403e-7,0.0000019345334,0.0000019923173,0.0000012924099,0.99956626,0.00018138111,0.00016452027,0.000025158593,0.0000011587684],"about_ca_topic_score_codex":0.011183039,"about_ca_topic_score_gemma":0.00798728,"teacher_disagreement_score":0.011183039,"about_ca_system_score_codex":0.0010089667,"about_ca_system_score_gemma":0.0011450311,"threshold_uncertainty_score":0.02223593},"labels":[],"label_agreement":null},{"id":"W4416582895","doi":"10.1109/tnse.2025.3636073","title":"To Trust or Not to Trust: On Calibration in ML-Based Resource Allocation for Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Communication Security Techniques","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calibration; Resource allocation; Channel (broadcasting); Reliability (semiconductor); Rayleigh fading; Key (lock); Function (biology); Monotonic function; Fading","score_opus":0.013879365993826989,"score_gpt":0.25560358837288655,"score_spread":0.24172422237905955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045384094,0.00085349503,0.94813174,0.0019178364,0.000059331367,0.000051678082,0.0000321918,0.00032862325,0.0032409527],"genre_scores_gemma":[0.94514394,0.0006938021,0.05232321,0.0005109433,0.00011496668,0.0000734022,0.000036030193,0.00013811377,0.0009656546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906873,0.005390345,0.00032354362,0.001098866,0.0017182659,0.0007816696],"domain_scores_gemma":[0.92504084,0.06271124,0.004068074,0.003927885,0.0035859104,0.00066605024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01387349,0.0013457566,0.0015831083,0.0008457123,0.0009857443,0.0022966254,0.0020694367,0.002180905,0.0016141967],"category_scores_gemma":[0.12036679,0.00090608303,0.00063860015,0.0010471595,0.005069922,0.007339862,0.004297098,0.0044930954,0.00032295767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017790654,0.000053635507,0.0020039382,0.000090631926,0.000043410506,0.00013779802,0.00039429884,0.90287644,0.0016011284,0.059424665,0.0007446201,0.03245149],"study_design_scores_gemma":[0.000009111597,0.000058765054,0.0003336724,0.00003206854,0.000010284952,0.000055287852,0.000044985416,0.9741746,0.0012768935,0.023701077,0.00028156405,0.000021641828],"about_ca_topic_score_codex":0.0036328337,"about_ca_topic_score_gemma":0.0018184928,"teacher_disagreement_score":0.01387349,"about_ca_system_score_codex":0.0021991618,"about_ca_system_score_gemma":0.0020805716,"threshold_uncertainty_score":0.073370874},"labels":[],"label_agreement":null},{"id":"W4416649891","doi":"10.1109/tnse.2025.3637123","title":"Intelligent Edge Caching Strategies for Optimized Content Delivery","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cache; Enhanced Data Rates for GSM Evolution; Wireless; Content delivery; Volume (thermodynamics); Edge computing; Mobile device; Wireless network; Edge device; Graph","score_opus":0.02930854887855782,"score_gpt":0.23578528440124447,"score_spread":0.20647673552268664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416649891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07477096,0.0006760558,0.91739476,0.00036102795,0.00007302161,0.000056242934,0.00008460668,0.0011698784,0.005413403],"genre_scores_gemma":[0.90562785,0.00029955953,0.09001673,0.00019776294,0.00003629044,0.000046182737,0.00013647457,0.00009681965,0.0035423953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.000114935414,0.00001554841,0.000078392375,0.00007746002,0.000067309345],"domain_scores_gemma":[0.999154,0.0004240497,0.00007790788,0.00007837812,0.00020549183,0.000060212307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000654925,0.00067298074,0.00063610845,0.00048125113,0.00039458202,0.00069731736,0.0012474266,0.00076805544,0.0013303307],"category_scores_gemma":[0.002362734,0.00027750395,0.0002566805,0.0004745176,0.00046894274,0.001117913,0.00073671626,0.0007107919,0.00037476706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027838317,0.000131194,0.0014052738,0.00010658982,0.000049011185,0.00016752211,0.00012106992,0.86809945,0.016505593,0.018257545,0.0058171595,0.08906115],"study_design_scores_gemma":[0.000005406994,0.00001583511,0.00006597453,0.0000020943562,0.000005443818,0.000017370052,0.000007702754,0.99664587,0.0010920179,0.0018145724,0.00032485204,0.000002891995],"about_ca_topic_score_codex":0.004421601,"about_ca_topic_score_gemma":0.0072192415,"teacher_disagreement_score":0.004421601,"about_ca_system_score_codex":0.0011074677,"about_ca_system_score_gemma":0.0009809359,"threshold_uncertainty_score":0.008791685},"labels":[],"label_agreement":null},{"id":"W4416922232","doi":"10.1109/tnse.2025.3639401","title":"Integration of Generative AI and Mobile Networking: A Comprehensive Survey","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","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":"Toronto Metropolitan University; University of Calgary; University of Waterloo","funders":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Orchestration; Transformative learning; Resource (disambiguation); Cellular network; Generative grammar; Mobile computing; Data-driven","score_opus":0.019967101787092986,"score_gpt":0.2532521960462328,"score_spread":0.2332850942591398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922232","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002727661,0.9279928,0.035068065,0.0026033535,0.00053223973,0.0000416851,0.00009378361,0.00013491724,0.030805336],"genre_scores_gemma":[0.023101665,0.9556407,0.015477747,0.0008859644,0.0013508325,0.000059256367,0.00018544117,0.000059303464,0.0032391425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943227,0.00016287492,0.000059280104,0.00010029132,0.00019924075,0.00004599893],"domain_scores_gemma":[0.9979487,0.0016049563,0.00007476741,0.0001108717,0.00020724704,0.000053488362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010051013,0.00088945136,0.00088206533,0.0029822206,0.0005590778,0.0029668475,0.001016428,0.0013950187,0.0036353595],"category_scores_gemma":[0.0022509198,0.00060801534,0.00060341746,0.0043326747,0.0012849793,0.0038850247,0.0013880756,0.0018387598,0.0010596389],"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.000035745026,0.00011580108,0.0018149047,0.0075297854,0.00009719601,0.00018991943,0.0008140687,0.0057359105,0.0009050808,0.19334316,0.015945408,0.7734731],"study_design_scores_gemma":[0.000009185009,0.00014100493,0.0021735681,0.0047154883,0.000088262364,0.001012843,0.0008215549,0.012442283,0.0010296773,0.13857545,0.8389125,0.00007825401],"about_ca_topic_score_codex":0.001659854,"about_ca_topic_score_gemma":0.0016791654,"teacher_disagreement_score":0.0036353595,"about_ca_system_score_codex":0.0009921844,"about_ca_system_score_gemma":0.0014214213,"threshold_uncertainty_score":0.012161434},"labels":[],"label_agreement":null},{"id":"W4417469950","doi":"10.1109/tnse.2025.3645564","title":"TinyML-Enabled Resource-Efficient Framework for Real-Time Network Securiy in Electric Vehicle Charging Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intrusion detection system; Inference; Reduction (mathematics); Boosting (machine learning); Dimensionality reduction; Pruning; Feature selection; Malware; Memory footprint","score_opus":0.004954531876031727,"score_gpt":0.211009996634062,"score_spread":0.20605546475803027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417469950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046115484,0.00075898325,0.86077654,0.00073672074,0.00021194988,0.00017737842,0.0020499527,0.08605959,0.003113308],"genre_scores_gemma":[0.6788786,0.00059429876,0.3069269,0.0004304429,0.000058171587,0.00040932826,0.006448367,0.0020999429,0.004153983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967945,0.00007683088,0.000025916046,0.000072228955,0.0001094172,0.000036287907],"domain_scores_gemma":[0.9997036,0.00011750572,0.000033216405,0.00006116725,0.000056735844,0.000027716027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908216,0.0008730947,0.0005493082,0.00057248655,0.00027993968,0.00091901154,0.001639073,0.00073303794,0.002431773],"category_scores_gemma":[0.0023466395,0.00043949866,0.00079834944,0.0002605705,0.0004625908,0.0018100291,0.0012177599,0.00091983366,0.00068958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003328512,0.00011034338,0.0036489277,0.00025241263,0.00010141141,0.00045711102,0.00014692085,0.8486845,0.009461155,0.010864988,0.016352545,0.109586865],"study_design_scores_gemma":[0.000008461126,0.000012146605,0.00014361877,0.000005218538,0.000005937514,0.000024798836,0.0000074017535,0.9931757,0.0020010942,0.0024036497,0.0022044957,0.00000741621],"about_ca_topic_score_codex":0.008267097,"about_ca_topic_score_gemma":0.0105869295,"teacher_disagreement_score":0.008267097,"about_ca_system_score_codex":0.0008678516,"about_ca_system_score_gemma":0.0009881924,"threshold_uncertainty_score":0.016437948},"labels":[],"label_agreement":null},{"id":"W4417469957","doi":"10.1109/tnse.2025.3645991","title":"Subversion-Resistant Autonomous Path Proxy Re-Encryption With Secure Deduplication for IoMT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Data deduplication; Plaintext; Server; Cryptography; Cloud computing; Encryption; Delegate; The Internet; Homomorphic encryption; Information sensitivity","score_opus":0.005978692494523218,"score_gpt":0.20994368591357399,"score_spread":0.20396499341905078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417469957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14480457,0.0024375492,0.8435418,0.00059305475,0.0002821422,0.0003531944,0.00020847873,0.0016325898,0.0061465986],"genre_scores_gemma":[0.94993293,0.00028459053,0.047797818,0.00011580393,0.000053086245,0.00007162868,0.00012968894,0.00004229346,0.001572146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980292,0.00054191635,0.0002486899,0.0002655921,0.00064840965,0.00026623142],"domain_scores_gemma":[0.9962979,0.00072937773,0.00045838478,0.0019735983,0.0004141691,0.00012668032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948274,0.0004279681,0.0007664081,0.00060768833,0.0006815903,0.0010619442,0.0012509718,0.00061019324,0.0011088395],"category_scores_gemma":[0.0038721103,0.00020518016,0.0005558454,0.000829911,0.0008134112,0.002968909,0.0020405196,0.0009601914,0.00045055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002349444,0.00048495285,0.0059409873,0.0010814648,0.00033326316,0.0035359503,0.0016791334,0.12269624,0.19395997,0.20473386,0.011102844,0.45210192],"study_design_scores_gemma":[0.00025301886,0.0012832995,0.0021548977,0.00013121525,0.00016203849,0.0067372792,0.00042262103,0.72295606,0.17844598,0.05999855,0.027261771,0.0001932744],"about_ca_topic_score_codex":0.00024976252,"about_ca_topic_score_gemma":0.00025869143,"teacher_disagreement_score":0.0013948274,"about_ca_system_score_codex":0.000519729,"about_ca_system_score_gemma":0.00082531216,"threshold_uncertainty_score":0.007376611},"labels":[],"label_agreement":null},{"id":"W4417537637","doi":"10.1109/tnse.2025.3622688","title":"Split Federated Learning-Driven Resource-Efficient MEC Framework for UAV-Based Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Context (archaeology); Distributed learning; Power consumption; Resource management (computing); Deep learning; Resource (disambiguation); Resource allocation; Data modeling; Context model","score_opus":0.00564680664529088,"score_gpt":0.2099827501966357,"score_spread":0.20433594355134482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417537637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021677708,0.0003080935,0.9738601,0.00021211176,0.000044234264,0.000034801484,0.0000725012,0.00069541537,0.0030949144],"genre_scores_gemma":[0.87523365,0.00020836978,0.11973199,0.00013054106,0.000027016342,0.000079126425,0.0001721102,0.0000650453,0.004352134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972075,0.000062675455,0.000011176288,0.00006738603,0.00007082485,0.0000671356],"domain_scores_gemma":[0.9996271,0.0001399494,0.000032601227,0.00006804691,0.00009452082,0.000037675312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066819397,0.00051090936,0.00062793604,0.0002906936,0.00039598343,0.0008633458,0.0015356613,0.00070118206,0.0021103043],"category_scores_gemma":[0.0011337559,0.00019415631,0.00036748304,0.00034838883,0.000475745,0.0011955234,0.0012347713,0.00077782763,0.00027410427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007860088,0.00003968208,0.00043907666,0.000029556508,0.000021152557,0.000092739356,0.000029268967,0.94533056,0.0018911144,0.00977248,0.001598989,0.040676907],"study_design_scores_gemma":[0.0000022605027,0.000008425421,0.000033418026,0.0000015002292,0.0000019498855,0.000011250732,0.0000055054543,0.99736613,0.0003279178,0.0019447202,0.00029543735,0.0000014923767],"about_ca_topic_score_codex":0.005342906,"about_ca_topic_score_gemma":0.008234926,"teacher_disagreement_score":0.005342906,"about_ca_system_score_codex":0.0009751154,"about_ca_system_score_gemma":0.0011418528,"threshold_uncertainty_score":0.010623574},"labels":[],"label_agreement":null},{"id":"W6921858860","doi":"10.1109/tnse.2025.3590545","title":"RadioDiff-3D: A 3D× 3D Radio Map Dataset and Generative Diffusion Based Benchmark for 6G Environment-Aware Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmark (surveying); Generalization; Focus (optics); Transmitter; Key (lock); Wireless; Shadow mapping; Channel (broadcasting)","score_opus":0.011313643130390618,"score_gpt":0.21095707815003426,"score_spread":0.19964343501964363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921858860","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24989736,0.008055678,0.24508128,0.0041241506,0.0024180806,0.0011485553,0.41281393,0.045958783,0.030502124],"genre_scores_gemma":[0.34630165,0.0016181782,0.099502966,0.0010139089,0.00023519063,0.0006089127,0.5427621,0.0012589513,0.006698156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.00020836022,0.000053824566,0.00025322844,0.00028855514,0.00012153347],"domain_scores_gemma":[0.99910384,0.00028223658,0.000065411055,0.0002724988,0.00018369529,0.000092309674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308216,0.002309985,0.0009917052,0.0016583753,0.00064604287,0.0012457471,0.0029958282,0.0016220099,0.0033732492],"category_scores_gemma":[0.0026484418,0.00040056332,0.0014527722,0.0019868237,0.00070415257,0.0010356185,0.0016474592,0.001868543,0.0027372753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086532626,0.0010039124,0.01673537,0.0017412795,0.00062202953,0.0013217956,0.00026087978,0.37622496,0.012151756,0.007913856,0.36392578,0.21723309],"study_design_scores_gemma":[0.00031666586,0.00046095884,0.016645515,0.00024758343,0.00015517893,0.0017864776,0.0004237259,0.8164367,0.014534242,0.009383265,0.13935488,0.0002547954],"about_ca_topic_score_codex":0.022895562,"about_ca_topic_score_gemma":0.042790923,"teacher_disagreement_score":0.022895562,"about_ca_system_score_codex":0.0011148719,"about_ca_system_score_gemma":0.0011051696,"threshold_uncertainty_score":0.045524597},"labels":[],"label_agreement":null},{"id":"W7117101366","doi":"10.1109/tnse.2025.3647916","title":"GenAI-Enabled Residual Motion Estimation for Energy-Efficient Semantic Video Communication","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Video Coding and Compression Technologies","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":"Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Residual; Bandwidth (computing); Convolutional neural network; Motion estimation; Semantic similarity; Video tracking; Semantics (computer science); Channel (broadcasting)","score_opus":0.012200723959078364,"score_gpt":0.23249171466389676,"score_spread":0.2202909907048184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117101366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058779612,0.002233675,0.92831266,0.00030658089,0.00015941866,0.00007196637,0.0006450923,0.003557739,0.005933388],"genre_scores_gemma":[0.72182727,0.00088913564,0.26759562,0.0002646702,0.0000821897,0.00010570025,0.002204809,0.0002909704,0.0067395703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.000048912105,0.00001423984,0.00006422112,0.00010823925,0.000038067476],"domain_scores_gemma":[0.9997352,0.00008739149,0.00002964345,0.000066332635,0.00006808887,0.000013395593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044080222,0.00075062615,0.0004793354,0.000543036,0.00022580569,0.00045510175,0.000985966,0.0004677017,0.0017514935],"category_scores_gemma":[0.0016720832,0.00016131275,0.00033120063,0.0005660006,0.00032264594,0.0011161515,0.00089435314,0.00079906074,0.00050029485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058408437,0.00014787696,0.0022374555,0.00026180377,0.000117127325,0.00024281499,0.00022354918,0.2518605,0.04869661,0.013318625,0.011254293,0.67105526],"study_design_scores_gemma":[0.000021172946,0.000081358005,0.00060367695,0.000017227983,0.000028130578,0.00011366989,0.000043970213,0.9711685,0.017684637,0.0050694887,0.005150095,0.000018108436],"about_ca_topic_score_codex":0.0051444336,"about_ca_topic_score_gemma":0.010271912,"teacher_disagreement_score":0.0051444336,"about_ca_system_score_codex":0.00045494517,"about_ca_system_score_gemma":0.0007161272,"threshold_uncertainty_score":0.0102289915},"labels":[],"label_agreement":null},{"id":"W7117455090","doi":"10.1109/tnse.2025.3649013","title":"Revisiting Scalability of Distributed Wireless Networks: A Multi-Hop Communication Perspective","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Wireless network; Network topology; Software deployment; Wireless; Heterogeneous network; Perspective (graphical); Topology (electrical circuits)","score_opus":0.010211272528814881,"score_gpt":0.24424795693739076,"score_spread":0.2340366844085759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117455090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06572919,0.025559064,0.8557714,0.02234147,0.00061314995,0.00013478973,0.0004413322,0.00053085573,0.028878687],"genre_scores_gemma":[0.9379423,0.015158677,0.04104385,0.0012424334,0.0020937743,0.00020043447,0.0001420854,0.00017069266,0.0020056362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959693,0.0017663422,0.00016276566,0.00056955154,0.0012509055,0.00028112176],"domain_scores_gemma":[0.96796465,0.024955695,0.0019564752,0.0021162773,0.0024376386,0.0005693393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057870434,0.0013403747,0.0014108185,0.0025965972,0.0011240344,0.0030113338,0.0028713278,0.0017669365,0.0014944345],"category_scores_gemma":[0.029234411,0.0006893171,0.0009759059,0.0030362413,0.004497829,0.012931102,0.002905605,0.0037187643,0.00027348663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006874841,0.00008111814,0.005130023,0.0006927001,0.00012377324,0.00085056864,0.0008914418,0.43858278,0.0028653794,0.47073343,0.0061247833,0.07385534],"study_design_scores_gemma":[0.000013122265,0.00006911707,0.0016785226,0.0001699741,0.000037502155,0.0002960245,0.00040540914,0.67237383,0.00085894874,0.31707606,0.0069762114,0.00004522743],"about_ca_topic_score_codex":0.005486477,"about_ca_topic_score_gemma":0.0031682537,"teacher_disagreement_score":0.0057870434,"about_ca_system_score_codex":0.002794786,"about_ca_system_score_gemma":0.0016503251,"threshold_uncertainty_score":0.030605197},"labels":[],"label_agreement":null}]}