{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":166,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":166,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"da50516e2911","filters":{"venue":"International Journal of Communication Systems"}},"results":[{"id":"W2128124921","doi":"10.1002/dac.596","title":"In‐building power lines as high‐speed communication channels: channel characterization and a test channel ensemble","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":208,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Power-line communication; Channel (broadcasting); Computer science; Power (physics); Line (geometry); Telecommunications; Measure (data warehouse); Noise (video); Electric power transmission; Electronic engineering; Electrical engineering; Physics; Engineering","authors":[{"name":"T. Esmailian","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true},{"name":"P.G. Gulak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01718680845017628,"gpt":0.2675837275731772,"spread":0.2503969191230009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007440669,0.0006364129,0.0004304685,0.0003663632,0.000440554,0.0007828574,0.0006811452,0.0006570253,0.0009392974],"category_scores_gemma":[0.002614544,0.0001626112,0.0002638585,0.0003784218,0.0008960073,0.00115554,0.0003976539,0.0005459561,0.0001529018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004316202,"about_ca_system_score_gemma":0.000391124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002276402,"about_ca_topic_score_gemma":0.001340622,"domain_scores_codex":[0.999353,0.0002994814,0.00001447339,0.00007550866,0.0001732151,0.00008434831],"domain_scores_gemma":[0.9968792,0.001478674,0.0004537915,0.0005975909,0.000460299,0.0001304009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002558444,0.0001597736,0.006023785,0.00003344041,0.00003484529,0.0001899043,0.00007960566,0.9488841,0.01971155,0.01496904,0.0005976355,0.009060547],"study_design_scores_gemma":[0.000006535963,0.0000452086,0.0003712187,0.000001294626,0.00000550587,0.00003597805,0.00001180653,0.9928954,0.00452347,0.001980014,0.0001177483,0.000005763954],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949713,0.00007231603,0.3013881,0.0001318932,0.00001667366,0.00004491138,0.0001338757,0.0003392843,0.002901816],"genre_scores_gemma":[0.9941614,0.000042534,0.005187448,0.00001273726,0.00001011637,0.00002328818,0.00007557787,0.00001430058,0.0004724698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002276402,"threshold_uncertainty_score":0.004526317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107812461","doi":"10.1002/dac.843","title":"An energy‐efficient multipath routing protocol for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Multipath routing; Wireless Routing Protocol; Dynamic Source Routing; Routing protocol; Link-state routing protocol; Distributed computing; Zone Routing Protocol; Static routing; Geographic routing; Routing (electronic design automation)","authors":[{"name":"Ye Ming Lu","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01916217413206823,"gpt":0.3030994055959982,"spread":0.28393723146393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004584641,0.0003533296,0.0003398998,0.0004721288,0.0003797544,0.0004515208,0.000631933,0.0003807685,0.0006629874],"category_scores_gemma":[0.001015269,0.00014939,0.0002515062,0.0007166069,0.0002551185,0.0008435028,0.0007601315,0.0004119361,0.0001807442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002749777,"about_ca_system_score_gemma":0.0003976408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003546329,"about_ca_topic_score_gemma":0.0006214349,"domain_scores_codex":[0.9997687,0.00005550181,0.00001833535,0.00003015542,0.0001059484,0.00002138288],"domain_scores_gemma":[0.9997407,0.00008184287,0.00005509971,0.00003620123,0.00006788391,0.00001827245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003684115,0.00008773,0.001071177,0.0006449232,0.0002208521,0.0006914963,0.0002251437,0.2518806,0.1108828,0.06779519,0.01197992,0.5541518],"study_design_scores_gemma":[0.0001323053,0.0005672126,0.0009524786,0.00008557604,0.0002008186,0.001270288,0.00009066404,0.7909783,0.04263094,0.06896275,0.09401857,0.0001100447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04410677,0.005074146,0.9437925,0.0007073098,0.0004173423,0.0001933157,0.0001877218,0.001656162,0.003864728],"genre_scores_gemma":[0.6637773,0.003163619,0.3266711,0.0001948439,0.0002074985,0.0003630792,0.0003115323,0.00007414071,0.005236977],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0006629874,"threshold_uncertainty_score":0.002424598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955555619","doi":"10.1002/dac.4068","title":"Multiobjective virtual machine placement mechanisms using nature‐inspired metaheuristic algorithms in cloud environments: A comprehensive review","year":2019,"lang":"en","type":"review","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Virtual machine; Distributed computing; Data center; Server; Virtualization; Metaheuristic; Live migration; Algorithm; Operating system","authors":[{"name":"Nasim Donyagard Vahed","is_ca":true},{"name":"Mostafa Ghobaei‐Arani","is_ca":false},{"name":"Alireza Souri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05492322179682044,"gpt":0.3513142969743593,"spread":0.2963910751775388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008285843,0.001045255,0.001226138,0.002224849,0.0002834339,0.001265813,0.001217703,0.0009732015,0.001606024],"category_scores_gemma":[0.001606827,0.000435195,0.001254136,0.003870358,0.0003151441,0.001060751,0.0005108629,0.0008268188,0.0005725807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006066452,"about_ca_system_score_gemma":0.00104134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00192769,"about_ca_topic_score_gemma":0.001690885,"domain_scores_codex":[0.9996359,0.00007272331,0.00004702289,0.00006873431,0.0001434499,0.00003199101],"domain_scores_gemma":[0.9992718,0.0004461282,0.00008417247,0.0000209889,0.0001540522,0.00002285638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006563257,0.0001495673,0.0006536538,0.01737019,0.0002764945,0.0001444547,0.00007163775,0.0231179,0.00156416,0.01075085,0.008323387,0.937512],"study_design_scores_gemma":[0.00007660284,0.0007777507,0.00448979,0.01741806,0.001333183,0.002179162,0.0003868625,0.08073094,0.006293356,0.02573221,0.860357,0.000225051],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001381839,0.9881148,0.007328542,0.0003009069,0.0001596572,0.00002343569,0.00002925079,0.00003131586,0.002630231],"genre_scores_gemma":[0.01291173,0.9781247,0.00776639,0.0001501228,0.0002061657,0.00003117663,0.00007542922,0.00001428422,0.0007199772],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002224849,"threshold_uncertainty_score":0.005372643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153965103","doi":"10.1002/dac.2315","title":"DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Wireless Routing Protocol; Wireless sensor network; Source routing; Distributed computing; Triangular routing; Sink (geography); Packet forwarding","authors":[{"name":"Lei Shi","is_ca":false},{"name":"Baoxian Zhang","is_ca":false},{"name":"Hussein T. Mouftah","is_ca":true},{"name":"Jian Ma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05096756473966507,"gpt":0.3443068581358728,"spread":0.2933392933962077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079735,0.0004374295,0.0006641001,0.0007684409,0.0003891234,0.0007054402,0.001281609,0.0006621144,0.0007367883],"category_scores_gemma":[0.001676795,0.0003556868,0.0004004563,0.0005301499,0.0004862714,0.001206204,0.001166495,0.0007211074,0.0004148172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003287466,"about_ca_system_score_gemma":0.0005350456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003573633,"about_ca_topic_score_gemma":0.00050521,"domain_scores_codex":[0.9994236,0.0001782744,0.00006923841,0.00006509689,0.0002277207,0.00003615538],"domain_scores_gemma":[0.9994748,0.0001661443,0.00007985471,0.00009057107,0.0001510584,0.00003755758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006905897,0.0002061443,0.001393467,0.001143513,0.000257688,0.0008316445,0.0005058442,0.1971311,0.1252265,0.06103051,0.02145036,0.5901325],"study_design_scores_gemma":[0.000226909,0.0005660784,0.0006351226,0.00008076689,0.0001201694,0.0009302859,0.00006688177,0.8430287,0.05119049,0.02054924,0.08246926,0.0001361775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01300854,0.001234471,0.9808121,0.0003427249,0.0002442061,0.0001972998,0.0001076675,0.002101761,0.001951164],"genre_scores_gemma":[0.4493748,0.002608471,0.5367816,0.0005123959,0.0001903763,0.0008772789,0.001009109,0.0003190257,0.008326796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001281609,"threshold_uncertainty_score":0.005710244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109348731","doi":"10.1002/dac.801","title":"VoIP over WLAN: voice capacity, admission control, QoS, and MAC","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Voice over IP; Computer science; Computer network; Quality of service; Telecommunications; Wireless Multimedia Extensions; The Internet; Wireless; Telephony; Call Admission Control; Wi-Fi; Wireless network; Wi-Fi array; World Wide Web","authors":[{"name":"Lin Cai","is_ca":true},{"name":"Yang Xiao","is_ca":false},{"name":"Xuemin Shen","is_ca":true},{"name":"J.W. Mark","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01709050806673384,"gpt":0.279890593338548,"spread":0.2628000852718142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002822926,0.00076659,0.0008718167,0.001790076,0.0007025904,0.002920462,0.001084785,0.001066799,0.0009501061],"category_scores_gemma":[0.008091873,0.0005001682,0.0003111505,0.001825985,0.001391769,0.003299581,0.001219844,0.001887701,0.0003361512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002030398,"about_ca_system_score_gemma":0.0008809277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003420613,"about_ca_topic_score_gemma":0.001490146,"domain_scores_codex":[0.998508,0.0004951012,0.00006868557,0.0001631519,0.0005720416,0.0001929885],"domain_scores_gemma":[0.9952531,0.002923135,0.0004726761,0.0002569694,0.0009188741,0.0001752139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007091783,0.0003563285,0.0102817,0.0005359012,0.0002195578,0.0005969396,0.0004623986,0.2289353,0.0284964,0.1424443,0.005571935,0.5813901],"study_design_scores_gemma":[0.00001530299,0.0001222904,0.001965872,0.00008544926,0.00009269434,0.0003920509,0.000142463,0.9604352,0.006201434,0.02515001,0.0053296,0.00006761392],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410344,0.1025604,0.7182375,0.00372703,0.0007782839,0.000143059,0.00009425775,0.001193254,0.03223182],"genre_scores_gemma":[0.9632054,0.0120549,0.02069734,0.0002026323,0.001188777,0.00005708054,0.00004692309,0.00005034564,0.002496553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003420613,"threshold_uncertainty_score":0.01492923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576057564","doi":"10.1002/dac.3259","title":"Authorship verification using deep belief network systems","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Victoria","funders":"","keywords":"Computer science; Merge (version control); Bernoulli's principle; Gaussian; Word error rate; Basis (linear algebra); Artificial intelligence; Block (permutation group theory); Natural language processing; Data mining; Theoretical computer science; Algorithm; Information retrieval; Mathematics","authors":[{"name":"Marcelo Luiz Brocardo","is_ca":true},{"name":"Issa Traoré","is_ca":true},{"name":"Isaac Woungang","is_ca":true},{"name":"Mohammad S. Obaidat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09828633259928508,"gpt":0.3644836674045816,"spread":0.2661973348052965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002607798,0.0006136798,0.000853806,0.001411948,0.0005266399,0.001761263,0.001153409,0.0012975,0.00189863],"category_scores_gemma":[0.0102581,0.0004407985,0.0006242468,0.0007919673,0.00090871,0.002495167,0.001386208,0.001701346,0.000489743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001666809,"about_ca_system_score_gemma":0.001121508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007227893,"about_ca_topic_score_gemma":0.005414616,"domain_scores_codex":[0.998419,0.0006802437,0.00009098513,0.0003175042,0.0003115574,0.0001806998],"domain_scores_gemma":[0.9938079,0.003823316,0.0006513781,0.0006360002,0.0009458056,0.0001357623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002897356,0.000112359,0.003666638,0.00008467699,0.0001033956,0.00009855064,0.0001170372,0.8429381,0.001568035,0.01346111,0.001244742,0.1363156],"study_design_scores_gemma":[0.000002524149,0.000006067558,0.0001058602,0.00000394804,0.000003032959,0.000004756045,0.000004199157,0.9949734,0.0003631443,0.004453633,0.00007667381,0.000002700094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1082774,0.0007803927,0.8843976,0.001164168,0.00009561376,0.00006991197,0.0002344416,0.001458696,0.003521834],"genre_scores_gemma":[0.9554681,0.0001370455,0.04245707,0.00009533272,0.00003706071,0.00003253576,0.0001524606,0.00002257193,0.001597747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007227893,"threshold_uncertainty_score":0.01437163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048767501","doi":"10.1002/dac.505","title":"IP router architectures: an overview","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Router; Terabit; Computer network; Next-generation network; Throughput; The Internet; Core router; Interconnection; IP forwarding; Telecommunications; Routing (electronic design automation); Routing protocol; World Wide Web; Wireless; Wavelength-division multiplexing","authors":[{"name":"James Aweya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06361439239088819,"gpt":0.3388287412525275,"spread":0.2752143488616394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009621122,0.0008494504,0.0004825822,0.0025904,0.0004566166,0.002830109,0.001132609,0.001943308,0.003448951],"category_scores_gemma":[0.0008383197,0.0008468396,0.0003124939,0.002796905,0.0003455257,0.004492859,0.0007831664,0.001232302,0.002953239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005395864,"about_ca_system_score_gemma":0.0004941169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006385098,"about_ca_topic_score_gemma":0.0005195244,"domain_scores_codex":[0.9993648,0.0001016986,0.00007010819,0.0001223353,0.0002663753,0.00007474024],"domain_scores_gemma":[0.9994401,0.0001319755,0.00003837555,0.00003117557,0.0003027811,0.00005555929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001607856,0.000177571,0.002206278,0.002822892,0.00006838429,0.0003705542,0.0001972623,0.01426391,0.008197174,0.08219907,0.03181081,0.8575252],"study_design_scores_gemma":[0.00005324539,0.0006169659,0.00200554,0.001615867,0.0001621643,0.002652057,0.0002069936,0.05438425,0.006150965,0.04113543,0.8909412,0.00007538637],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01613564,0.6937252,0.2038153,0.002485989,0.001251768,0.0002071879,0.0001962023,0.002090407,0.08009231],"genre_scores_gemma":[0.1057275,0.6865731,0.1666493,0.0012306,0.002458554,0.000323183,0.0009024568,0.0002197784,0.03591559],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003448951,"threshold_uncertainty_score":0.01153791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045365184","doi":"10.1002/dac.700","title":"On the design of bandwidth efficient signalling for indoor wireless optical channels","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Optical wireless; Computer science; Bandwidth (computing); Multipath propagation; Wireless; Optical wireless communications; Electronic engineering; Channel (broadcasting); Telecommunications; Computer network; Engineering","authors":[{"name":"Steve Hranilovic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03486985614496433,"gpt":0.2702440108190248,"spread":0.2353741546740605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001496747,0.0006641038,0.0007023812,0.000497068,0.0004813271,0.001231483,0.0009470946,0.0007837054,0.002216191],"category_scores_gemma":[0.004934924,0.0004405367,0.0002949369,0.0007518281,0.001059868,0.001106416,0.001132025,0.0008940502,0.000523465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009513175,"about_ca_system_score_gemma":0.000808503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006535471,"about_ca_topic_score_gemma":0.0007137355,"domain_scores_codex":[0.9987275,0.0005640149,0.00005544311,0.000119158,0.0003687829,0.0001650344],"domain_scores_gemma":[0.9973577,0.001802821,0.0003119711,0.0001392264,0.0003181333,0.00007008545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002240842,0.00006479335,0.000335246,0.0003498329,0.0000331809,0.000163456,0.0002050739,0.6588725,0.02639333,0.2051813,0.001746633,0.1064306],"study_design_scores_gemma":[0.00002854017,0.0001112328,0.00007133391,0.00003837369,0.00001236095,0.0001174964,0.00004314091,0.9542504,0.006140689,0.03548167,0.003685074,0.00001970544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01713699,0.000552039,0.9752584,0.0002127188,0.00004265458,0.00005082714,0.00002800153,0.00009815153,0.006620217],"genre_scores_gemma":[0.7239783,0.00226515,0.2676081,0.0001938198,0.0001325177,0.0002623022,0.00008459336,0.00006954705,0.005405823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002216191,"threshold_uncertainty_score":0.007915676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017280665","doi":"10.1002/dac.853","title":"Integration of mobility and intrusion detection for wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobility model; Metric (unit); Mobile ad hoc network; Wireless ad hoc network; Waypoint; Intrusion detection system; Obstacle; Markov chain; Scheme (mathematics); Vehicular ad hoc network; Computer network; Wireless; Distributed computing; Network packet; Real-time computing; Data mining; Machine learning; Telecommunications","authors":[{"name":"Bo Sun","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Yang Xiao","is_ca":false},{"name":"Ruhai Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01300115501186895,"gpt":0.2634335626835559,"spread":0.250432407671687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136832,0.000479241,0.0005712425,0.0007558218,0.0003234824,0.0007186503,0.0007146251,0.0004056579,0.0003618409],"category_scores_gemma":[0.006174856,0.0002647826,0.0004243772,0.0005080655,0.0008976728,0.001525995,0.0009506041,0.0005802889,0.0001011201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.0004369083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015745,"about_ca_topic_score_gemma":0.001075902,"domain_scores_codex":[0.998929,0.0004428606,0.00007390237,0.0001562183,0.0002976638,0.0001003209],"domain_scores_gemma":[0.9960802,0.002143991,0.0005492303,0.000471941,0.0005978761,0.0001568229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006290759,0.0002296443,0.04278331,0.0001851659,0.0003232442,0.0005895003,0.0002897284,0.4909026,0.04240058,0.03075464,0.001768176,0.3891442],"study_design_scores_gemma":[0.000008909922,0.0001869928,0.002281142,0.00001214498,0.0000518157,0.0002686465,0.00003300747,0.9822612,0.008717486,0.00531659,0.0008433164,0.00001880092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1877571,0.0007996748,0.807161,0.0005322564,0.0001091236,0.00007416664,0.00002427978,0.001059731,0.002482615],"genre_scores_gemma":[0.9601816,0.0002346051,0.03903037,0.00004652921,0.00004336611,0.00002110607,0.00002411635,0.00002042715,0.0003978845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0015745,"threshold_uncertainty_score":0.007236421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978258815","doi":"10.1002/dac.684","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Mathematical optimization; Path (computing); Average path length; Convergence (economics); Routing (electronic design automation); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","authors":[{"name":"Sudip Misra","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02630559418688871,"gpt":0.273776655301145,"spread":0.2474710611142563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556531,0.0006432373,0.0008700216,0.0007249892,0.0004789088,0.0009321443,0.001618644,0.001308733,0.001422742],"category_scores_gemma":[0.002895276,0.0003545124,0.0005115043,0.0009647309,0.000861414,0.001458515,0.001581233,0.001225615,0.0004832324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005803704,"about_ca_system_score_gemma":0.001197942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00315745,"about_ca_topic_score_gemma":0.002288473,"domain_scores_codex":[0.9994397,0.000158546,0.00002943931,0.0001140275,0.0002015795,0.00005668253],"domain_scores_gemma":[0.9993266,0.0003204353,0.00008598611,0.00007800253,0.0001407714,0.00004811888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000129649,0.00004318442,0.000454473,0.00007740388,0.00005603107,0.0000716058,0.00009612145,0.7551075,0.005662392,0.02380883,0.003448136,0.2110447],"study_design_scores_gemma":[0.0000147386,0.0000249355,0.00003581423,0.000002883329,0.000003582282,0.00001843646,0.000005211886,0.9938698,0.0004174968,0.004641321,0.0009619869,0.00000392887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006048582,0.0001176824,0.9928088,0.00009074608,0.00003502418,0.00002920614,0.00002175315,0.0003270785,0.0005210947],"genre_scores_gemma":[0.2304986,0.0003133701,0.7658866,0.00017884,0.00009290145,0.0002321742,0.0002199291,0.0001296439,0.002447947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00315745,"threshold_uncertainty_score":0.006278098,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W1582930193","doi":"10.1002/dac.2902","title":"Energy efficiency and traffic offloading in wireless mesh networks with delay bounds","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Quality of service; Efficient energy use; Wireless mesh network; Computer network; Wireless; Wireless network; Integer programming; Bounded function; Bandwidth (computing); Mathematical optimization; Telecommunications; Algorithm","authors":[{"name":"Rosario G. Garroppo","is_ca":false},{"name":"Bernard Gendron","is_ca":true},{"name":"Gianfranco Nencioni","is_ca":false},{"name":"Luca Tavanti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01017368377834638,"gpt":0.2284265357600941,"spread":0.2182528519817477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247164,0.0005023887,0.0005538487,0.0005973433,0.0003958521,0.001084397,0.0006558807,0.0006827107,0.001037048],"category_scores_gemma":[0.00465055,0.0002462319,0.0003918906,0.0006767455,0.0006888456,0.001395308,0.0006566563,0.0005945151,0.00007851722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001542273,"about_ca_system_score_gemma":0.0004911674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0023434,"about_ca_topic_score_gemma":0.001707304,"domain_scores_codex":[0.9995418,0.0002116514,0.00001441229,0.00004499593,0.00008219323,0.000104964],"domain_scores_gemma":[0.9972307,0.002307946,0.0001958758,0.00006681809,0.0001421656,0.00005645384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007916983,0.00003341033,0.0009049522,0.00005620485,0.00002482378,0.0001062958,0.00003934034,0.9471875,0.00288692,0.04191704,0.0003854819,0.006378846],"study_design_scores_gemma":[0.000002999025,0.00001632402,0.0001723106,0.000004544006,0.00000665512,0.00001827424,0.0000148863,0.9915359,0.0003081142,0.007746946,0.000170416,0.00000254133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3921965,0.00335208,0.586936,0.00165378,0.0001249432,0.00005690178,0.0001303108,0.0001092578,0.01544022],"genre_scores_gemma":[0.9909911,0.0005573519,0.006329384,0.00003688253,0.00004430071,0.00002040996,0.00001941961,0.00002049129,0.001980696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0023434,"threshold_uncertainty_score":0.01119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766207463","doi":"10.1002/dac.3443","title":"A survey of overlay and underlay paradigms in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Underlay; Cognitive radio; Computer science; Computer network; Overlay; Throughput; Wireless; Transmission (telecommunications); Overlay network; Software-defined radio; Wireless network; Telecommunications; The Internet; Signal-to-noise ratio (imaging); World Wide Web","authors":[{"name":"Bhoopendra Kumar","is_ca":false},{"name":"Isaac Woungang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05036733424563223,"gpt":0.3269766796008684,"spread":0.2766093453552362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001744645,0.0007374546,0.0009053879,0.001992597,0.0007199483,0.002386768,0.00135998,0.001109595,0.001409468],"category_scores_gemma":[0.002078062,0.0005312276,0.0006051176,0.00293631,0.0009535213,0.003528057,0.001293003,0.00122186,0.000391889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123282,"about_ca_system_score_gemma":0.0009508368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001987814,"about_ca_topic_score_gemma":0.001378422,"domain_scores_codex":[0.9987257,0.000414942,0.00009705631,0.00022324,0.000416638,0.0001225288],"domain_scores_gemma":[0.9985447,0.0009229775,0.0001137744,0.0001160189,0.0002359862,0.0000665669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001935931,0.0001789721,0.003074376,0.003399569,0.0001636357,0.00036352,0.0006314327,0.03853843,0.004209132,0.2153607,0.006266895,0.7276198],"study_design_scores_gemma":[0.00004659956,0.0008857298,0.005306542,0.002923541,0.000265879,0.003139035,0.001412544,0.2709583,0.005079052,0.2767138,0.4330396,0.0002294737],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02575112,0.5954682,0.3300458,0.002197478,0.0008109892,0.0001690194,0.0001288454,0.0003100531,0.04511853],"genre_scores_gemma":[0.396471,0.4847606,0.1101564,0.0008688203,0.001867692,0.000289489,0.0001976242,0.00007178508,0.005316554],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002386768,"threshold_uncertainty_score":0.00922668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311508997","doi":"10.1002/dac.5412","title":"A hybrid technique for the PAPR reduction of NOMA waveform","year":2022,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Companding; Computer science; Waveform; Reduction (mathematics); Transmission (telecommunications); Transmitter; Algorithm; Noma; Orthogonal frequency-division multiplexing; Real-time computing; Electronic engineering; Telecommunications; Mathematics; Channel (broadcasting); Telecommunications link","authors":[{"name":"Арун Кумар","is_ca":true},{"name":"Nidhi Gour","is_ca":false},{"name":"Himanshu Sharma","is_ca":false},{"name":"Rajneesh Pareek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01977069109204243,"gpt":0.272631272604304,"spread":0.2528605815122615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003139506,0.0003828767,0.0002695491,0.0005959503,0.0002449256,0.0004198393,0.0004568937,0.0003704971,0.00149772],"category_scores_gemma":[0.0008434497,0.00013107,0.0003309286,0.0004744687,0.0002698707,0.0004339867,0.0003367044,0.0003839563,0.0005006805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710523,"about_ca_system_score_gemma":0.0003807899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005840679,"about_ca_topic_score_gemma":0.0008656572,"domain_scores_codex":[0.9997601,0.00003860878,0.00001471221,0.00004174537,0.0001286667,0.00001612514],"domain_scores_gemma":[0.9996496,0.0001125076,0.00005512371,0.00006823866,0.00009514383,0.00001928797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003370042,0.0001039038,0.001620545,0.0001911873,0.00007360992,0.000220712,0.0001678281,0.06360838,0.1859512,0.008197262,0.00202378,0.7375047],"study_design_scores_gemma":[0.00005457907,0.0006368662,0.002142216,0.00002300519,0.00004583128,0.0009817546,0.00007026689,0.8935671,0.09076895,0.002268807,0.009406283,0.00003433312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07008486,0.0005864586,0.9239116,0.0001329817,0.00009740337,0.00005702703,0.00003625909,0.0009832046,0.004110205],"genre_scores_gemma":[0.4882938,0.0003379926,0.5062365,0.0000993502,0.00006332356,0.00006793821,0.0001039472,0.00005543316,0.00474172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00149772,"threshold_uncertainty_score":0.005010366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497574042","doi":"10.1002/dac.2428","title":"Cryptanalysis of a dynamic ID‐based remote user authentication with key agreement scheme","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Computer science; Forward secrecy; Spoofing attack; Anonymity; Password; Computer security; Scheme (mathematics); Cryptanalysis; Key (lock); Authentication (law); Secrecy; Computer network; Cryptography; Public-key cryptography; Encryption","authors":[{"name":"Hong‐bin Tang","is_ca":true},{"name":"Liu Xin-song","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01907552836826399,"gpt":0.3180970421640217,"spread":0.2990215137957577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001923585,0.0004183878,0.0007018985,0.0009859444,0.001333309,0.001599438,0.001254692,0.00117203,0.004580262],"category_scores_gemma":[0.004129142,0.0003496759,0.0008547406,0.001048202,0.002195462,0.002879377,0.002896679,0.002022395,0.001093663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279448,"about_ca_system_score_gemma":0.001454728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007291433,"about_ca_topic_score_gemma":0.000298386,"domain_scores_codex":[0.9965786,0.0008259869,0.0001532033,0.0002872387,0.001613521,0.0005413234],"domain_scores_gemma":[0.997421,0.001041948,0.0002736124,0.0008198189,0.000328972,0.0001146101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009848931,0.0001309114,0.001459303,0.0002045816,0.0001098758,0.001343085,0.0006437152,0.04822354,0.02604457,0.8668995,0.005106611,0.04884939],"study_design_scores_gemma":[0.0004075717,0.0003176523,0.001051791,0.0001083269,0.000130322,0.002419221,0.0001489234,0.6041194,0.04773431,0.3070276,0.03636487,0.0001700309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1835646,0.0009661397,0.7595707,0.002579313,0.0003500141,0.000559625,0.0003237916,0.001272444,0.05081336],"genre_scores_gemma":[0.9538641,0.0002256133,0.037732,0.0001465711,0.00005035299,0.0001137463,0.00009739052,0.00004267339,0.007727459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004580262,"threshold_uncertainty_score":0.01653862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526373655","doi":"10.1002/dac.2338","title":"Dynamic channel selection with reinforcement learning for cognitive WLAN over fiber","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cognitive radio; Reinforcement learning; Computer network; Throughput; Cognitive network; Wireless; Radio resource management; Wireless network; Channel (broadcasting); Wi-Fi; Telecommunications; Artificial intelligence","authors":[{"name":"Yi Li","is_ca":false},{"name":"Hong Ji","is_ca":false},{"name":"Xi Li","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01259768634059497,"gpt":0.2761848124745014,"spread":0.2635871261339064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178488,0.000485553,0.0005494551,0.0003514878,0.0003364317,0.0004667684,0.0008054632,0.0006217382,0.0009082585],"category_scores_gemma":[0.002334926,0.000214101,0.0002795066,0.0002085581,0.0008965369,0.0003716826,0.0005890642,0.0006492563,0.0001068803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009266572,"about_ca_system_score_gemma":0.0008347915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008550614,"about_ca_topic_score_gemma":0.004643382,"domain_scores_codex":[0.9995725,0.0001456746,0.0000131781,0.00005655414,0.0001062422,0.0001057596],"domain_scores_gemma":[0.9985329,0.0008679031,0.0002262817,0.0000551134,0.0002180031,0.00009983918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007142746,0.00007188312,0.0005468116,0.00001354552,0.00001817563,0.00004940186,0.00002221609,0.984368,0.0009397966,0.001672446,0.0001666043,0.0120597],"study_design_scores_gemma":[0.000008105074,0.00002253977,0.00005841327,8.924449e-7,0.000002643536,0.000004580026,0.00000222829,0.9993082,0.0001179064,0.0004354522,0.0000370924,0.000002002146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654469,0.0002886752,0.8291447,0.0003155073,0.00004451655,0.00009351458,0.00001723121,0.0002601872,0.004388741],"genre_scores_gemma":[0.989213,0.00004197452,0.01001833,0.00003643521,0.00001042726,0.00003589357,0.00000584875,0.000004665076,0.0006334097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008550614,"threshold_uncertainty_score":0.01700169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512221035","doi":"10.1002/dac.2779","title":"A nodes scheduling model based on Markov chain prediction for big streaming data analysis","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Streaming data; Big data; Markov chain; Scheduling (production processes); Distributed computing; Real Time Streaming Protocol; Construct (python library); Data stream mining; Data mining; Computer network; The Internet; Mathematical optimization; Machine learning","authors":[{"name":"Qingchen Zhang","is_ca":false},{"name":"Zhikui Chen","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04481012434678847,"gpt":0.2989505884247519,"spread":0.2541404640779634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516183,0.0006731976,0.000864161,0.000580542,0.0006993068,0.0009813228,0.001620821,0.0005653112,0.002319954],"category_scores_gemma":[0.003305136,0.0005054337,0.0007956412,0.0008584796,0.0006851188,0.001374919,0.0006859328,0.001228176,0.0003587043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622499,"about_ca_system_score_gemma":0.002469816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02164086,"about_ca_topic_score_gemma":0.01727321,"domain_scores_codex":[0.9992844,0.0001868915,0.00003521748,0.0002003518,0.0001737971,0.0001193287],"domain_scores_gemma":[0.9979026,0.001331706,0.0002054914,0.000123982,0.0002839584,0.0001522641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004471007,0.00002012406,0.0006884732,0.00001707759,0.00001323039,0.00003494879,0.00002997881,0.986068,0.0005560932,0.00679559,0.0005440777,0.005187809],"study_design_scores_gemma":[0.00000159999,0.000002771823,0.00003670652,5.564106e-7,0.000001815424,0.000001527762,0.000001951804,0.9984895,0.00005745835,0.001361759,0.00004274664,0.000001562012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03690704,0.0001549506,0.9601663,0.0003221573,0.00006737982,0.00006454038,0.0001483525,0.0004324901,0.001736747],"genre_scores_gemma":[0.9193299,0.0003289624,0.07671636,0.00008631701,0.000072656,0.0001771483,0.0003738131,0.00009607335,0.002818729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02164086,"threshold_uncertainty_score":0.04302979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","authors":[{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Deepak Kumar Sharma","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Aakanksha Saini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09001436105111163,"gpt":0.3074328118247264,"spread":0.2174184507736148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005582907,0.0003821685,0.0004432345,0.0007901163,0.000735847,0.0004816892,0.001527309,0.0004521174,0.001287942],"category_scores_gemma":[0.001409423,0.0002001325,0.000294655,0.0005233266,0.0003994771,0.001138366,0.001241171,0.0004187466,0.0002099888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005134022,"about_ca_system_score_gemma":0.0008092591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002533023,"about_ca_topic_score_gemma":0.00350783,"domain_scores_codex":[0.9997041,0.00006705987,0.0000234681,0.00005347336,0.0001058717,0.00004603115],"domain_scores_gemma":[0.9994164,0.0001994701,0.00008932917,0.0001259629,0.0001137629,0.00005511989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008346321,0.0002811791,0.004044315,0.00042249,0.0001475813,0.0008889045,0.000601151,0.3379263,0.05945435,0.08438591,0.01079522,0.500218],"study_design_scores_gemma":[0.00005406261,0.0002113948,0.001042531,0.00003212826,0.00005290472,0.0003572051,0.00009520851,0.9630519,0.009011274,0.01747119,0.008554678,0.00006544072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1228339,0.001615244,0.8619597,0.0006389106,0.0002803786,0.0002397968,0.0002352109,0.001371415,0.01082544],"genre_scores_gemma":[0.943289,0.0004057896,0.05221555,0.0001094255,0.00005894389,0.00009032906,0.0001950442,0.00003118689,0.003604785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002533023,"threshold_uncertainty_score":0.005036533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485150649","doi":"10.1002/dac.2997","title":"Localization in terrestrial and underwater sensor‐based m2m communication networks: architecture,classification and challenges","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; Ontario Tech University; Seneca Polytechnic","funders":"","keywords":"Computer science; Underwater; Architecture; Wireless sensor network; Underwater acoustic communication; Artificial intelligence; Telecommunications; Computer network; Geology; Oceanography","authors":[{"name":"Lutful Karim","is_ca":true},{"name":"Qusay H. Mahmoud","is_ca":true},{"name":"Nidal Nasser","is_ca":false},{"name":"Alagan Anpalagan","is_ca":true},{"name":"Nargis Khan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07475452456771559,"gpt":0.268197250278016,"spread":0.1934427257103004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006106598,0.0003133134,0.0003845416,0.001132511,0.0004309905,0.001066601,0.0007399314,0.001138208,0.00123378],"category_scores_gemma":[0.001288729,0.0002744931,0.0002863521,0.001815033,0.0006770907,0.002127865,0.0009530485,0.0005277238,0.0004453112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007407194,"about_ca_system_score_gemma":0.0005165184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002275984,"about_ca_topic_score_gemma":0.00210495,"domain_scores_codex":[0.9996698,0.00008494861,0.00002614764,0.00006495638,0.0001095508,0.00004474424],"domain_scores_gemma":[0.9992889,0.0002572456,0.000108753,0.00005906851,0.000249163,0.00003680373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008383318,0.00006557721,0.01036485,0.001301229,0.00004857883,0.0003664107,0.0003560674,0.1060327,0.008245429,0.07806005,0.01394106,0.7811342],"study_design_scores_gemma":[0.00001176702,0.0002919835,0.01026511,0.0005568238,0.00005601796,0.001597721,0.001100428,0.7361275,0.008111297,0.07980953,0.1619776,0.00009421266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.08220935,0.2058473,0.6506377,0.01237885,0.0007920736,0.00025264,0.0002006048,0.0009115129,0.04676994],"genre_scores_gemma":[0.7520062,0.10609,0.1259062,0.001018797,0.001134249,0.0002506851,0.0004074723,0.00006269174,0.01312369],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.002275984,"threshold_uncertainty_score":0.005374312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1811925492","doi":"10.1002/dac.2587","title":"Design and performance of an efficient rectenna incorporating a fractal structure","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Rectenna; Fractal antenna; HFSS; Fractal; Antenna (radio); Rectifier (neural networks); Energy harvesting; Computer science; Return loss; Patch antenna; Topology (electrical circuits); Electrical engineering; Electronic engineering; Telecommunications; Power (physics); Microstrip antenna; Physics; Antenna efficiency; Mathematics; Engineering; Mathematical analysis","authors":[{"name":"Dong‐You Choi","is_ca":false},{"name":"Sika Shrestha","is_ca":false},{"name":"Jungjin Park","is_ca":false},{"name":"Sun‐Kuk Noh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01265279160354151,"gpt":0.2295742786721043,"spread":0.2169214870685627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621409,0.0002327399,0.0002850284,0.0001336546,0.000122157,0.0002925907,0.0003849702,0.0004819388,0.0006556889],"category_scores_gemma":[0.0002459159,0.0001546863,0.0002601217,0.0001523414,0.0001818982,0.0002944295,0.0001864127,0.0001580683,0.0004628455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002758353,"about_ca_system_score_gemma":0.0001354855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001463551,"about_ca_topic_score_gemma":0.0001429092,"domain_scores_codex":[0.9998723,0.00001803183,0.0000101606,0.00003742711,0.00004429253,0.00001775271],"domain_scores_gemma":[0.9997848,0.00003549143,0.0000643248,0.00005374487,0.00004653112,0.00001522094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002372754,0.00003796765,0.0007318062,0.0001651736,0.00005300383,0.0002504073,0.0001015918,0.03079701,0.9418942,0.003685881,0.0006036276,0.02144211],"study_design_scores_gemma":[0.00009828511,0.001551135,0.004439133,0.00004751625,0.0001024044,0.001317957,0.00004695872,0.3309035,0.6354243,0.001539318,0.02444003,0.00008935401],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7488499,0.001102071,0.2327795,0.0002855363,0.0001451189,0.0000773105,0.0002043417,0.0007540403,0.01580209],"genre_scores_gemma":[0.9453037,0.0001852669,0.05210306,0.00004518777,0.00001732265,0.00003156673,0.000077775,0.00002290302,0.002213188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0006556889,"threshold_uncertainty_score":0.002193451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498617973","doi":"10.1002/dac.2785","title":"An efficient distributed routing protocol for wireless sensor networks with mobile sinks","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Network packet; Distributed computing; Overhead (engineering)","authors":[{"name":"Lei Shi","is_ca":false},{"name":"Baoxian Zhang","is_ca":false},{"name":"Cheng Li","is_ca":true},{"name":"Jian Ma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01458987321632121,"gpt":0.2971124017599049,"spread":0.2825225285435837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213171,0.0003909628,0.0004618395,0.000643673,0.0003699602,0.000675202,0.001016835,0.0005242609,0.0005569237],"category_scores_gemma":[0.002169912,0.0002551372,0.0003300076,0.0005476429,0.0003645577,0.001272644,0.001187584,0.0006268967,0.0002227056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003386293,"about_ca_system_score_gemma":0.0005595973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004069944,"about_ca_topic_score_gemma":0.0006726271,"domain_scores_codex":[0.9994067,0.0002076987,0.00006733222,0.00005998072,0.0002322407,0.00002617536],"domain_scores_gemma":[0.9994619,0.0001984651,0.00006838466,0.00008099199,0.0001644023,0.00002584555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002920089,0.0001230428,0.0008315252,0.0004843125,0.0001819685,0.0006859115,0.0003469063,0.4032766,0.1054575,0.08991262,0.007175373,0.3912322],"study_design_scores_gemma":[0.00008296005,0.0002218211,0.0002693371,0.00003944676,0.00006918225,0.0003730186,0.00004340075,0.9337117,0.0171488,0.02084102,0.02715068,0.00004859671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01391482,0.0008189921,0.982762,0.0002570813,0.0001423116,0.0001241953,0.00005429698,0.0004981693,0.0014282],"genre_scores_gemma":[0.4500763,0.001156984,0.5426779,0.0001535489,0.00009142195,0.0004783074,0.0002970278,0.00007715074,0.00499154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001213171,"threshold_uncertainty_score":0.006415963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021763947","doi":"10.1002/dac.670","title":"Token bank fair queuing: a new scheduling algorithm for wireless multimedia services","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Fair queuing; Quality of service; Scheduling (production processes); Token bucket; Proportionally fair; Wireless network; Wireless; Network packet; Algorithm; Distributed computing; Round-robin scheduling; Dynamic priority scheduling; Telecommunications","authors":[{"name":"William K. Wong","is_ca":true},{"name":"Helen Tang","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01175003844050699,"gpt":0.2636861099291047,"spread":0.2519360714885978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002557549,0.0006152804,0.0008068763,0.0008568595,0.0008756142,0.001388441,0.002089716,0.0009289648,0.001975541],"category_scores_gemma":[0.004047803,0.0002822732,0.0003647088,0.0009509026,0.0009343369,0.00180339,0.0008641445,0.0009540001,0.0004016709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001949754,"about_ca_system_score_gemma":0.002304158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004443131,"about_ca_topic_score_gemma":0.00322329,"domain_scores_codex":[0.9990689,0.0002666547,0.00005948441,0.0001250346,0.0003400815,0.0001399337],"domain_scores_gemma":[0.9989812,0.0004477118,0.0001234613,0.0001072681,0.0002588196,0.00008159933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004478166,0.0001597446,0.0008018919,0.0001273182,0.00006197933,0.0001217266,0.0001452093,0.6083077,0.01147926,0.1275499,0.008031582,0.2427659],"study_design_scores_gemma":[0.00003229821,0.00002757622,0.00003935382,0.000003882079,0.000008319283,0.00002046279,0.00000522225,0.9882962,0.001054499,0.008373561,0.002130909,0.000007672975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006665917,0.0002174335,0.991193,0.0001365066,0.0001296949,0.00006502814,0.00003160721,0.0006109789,0.0009498338],"genre_scores_gemma":[0.3761535,0.000424664,0.6193507,0.0002086578,0.0002379635,0.0002459472,0.0001190557,0.0001476149,0.003111789],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004443131,"threshold_uncertainty_score":0.01414657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009134105","doi":"10.1002/dac.506","title":"Virtual base stations for wireless mobile<i>ad hoc</i>communications: an infrastructure for the infrastructure‐less","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Base station; Wireless ad hoc network; Quality of service; Wireless Routing Protocol; Mobile ad hoc network; Routing protocol; Ad hoc wireless distribution service; Wireless network; Distributed computing; Protocol (science); Node (physics); Mobile IP; Correctness; Optimized Link State Routing Protocol; Wireless; Mobile computing; Routing (electronic design automation); Telecommunications; Network packet","authors":[{"name":"Hossam Hassanein","is_ca":true},{"name":"Ahmed Safwat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02599835202788226,"gpt":0.3130457417607179,"spread":0.2870473897328357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401162,0.0003873779,0.0002892709,0.0003955152,0.0006370668,0.001784805,0.001382027,0.0006245497,0.002286664],"category_scores_gemma":[0.001742374,0.0002862792,0.0002841495,0.0003964903,0.001022108,0.002023119,0.001037552,0.001112225,0.0006062767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000546151,"about_ca_system_score_gemma":0.0005921455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009277455,"about_ca_topic_score_gemma":0.0008059323,"domain_scores_codex":[0.9996146,0.0001450039,0.00001973146,0.00003662299,0.0001248285,0.00005911911],"domain_scores_gemma":[0.9992712,0.0002344328,0.0001073926,0.0001551338,0.0001471887,0.00008451781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003101418,0.0001189885,0.001635392,0.0004173275,0.00008059743,0.0004349118,0.0004085317,0.09067985,0.04921227,0.6328302,0.01098363,0.2128882],"study_design_scores_gemma":[0.0001919889,0.000913331,0.001170014,0.0001971927,0.0002294331,0.0009348679,0.0003480301,0.5859348,0.03312384,0.1474152,0.2294365,0.000104864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04091825,0.00371678,0.9380861,0.001062044,0.0006884307,0.0001369089,0.00005616684,0.000824007,0.01451136],"genre_scores_gemma":[0.7886713,0.004576812,0.1977743,0.0003858013,0.0005035721,0.0002401395,0.00020664,0.00009036711,0.007551024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002286664,"threshold_uncertainty_score":0.00764966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3107066755","doi":"10.1002/dac.4658","title":"Modified spider monkey optimization—An enhanced optimization of spectrum sharing in cognitive radio networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Cognitive radio; Network packet; Scheduling (production processes); Optimization problem; Throughput; False alarm; Computer network; Handover; Radio spectrum; Real-time computing; Quality of service; Wireless; Algorithm; Mathematical optimization; Telecommunications; Artificial intelligence","authors":[{"name":"G. Dinesh","is_ca":true},{"name":"P. Venkatakrishnan","is_ca":false},{"name":"K. Meena Alias Jeyanthi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03602974748164497,"gpt":0.2872658492612096,"spread":0.2512361017795647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194592,0.0005175637,0.0007371598,0.0004853395,0.0003000205,0.0005380128,0.0006144543,0.000727444,0.001415519],"category_scores_gemma":[0.001361355,0.0002364787,0.0005414516,0.0004415195,0.0004835535,0.0004372878,0.0006821745,0.0004479506,0.0001334066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005126091,"about_ca_system_score_gemma":0.0007505196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003015321,"about_ca_topic_score_gemma":0.00151325,"domain_scores_codex":[0.9996855,0.0001431807,0.000008920395,0.00004122189,0.00007260094,0.00004858492],"domain_scores_gemma":[0.9995731,0.0002378784,0.00004749898,0.00002101668,0.00008610613,0.00003440938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003987809,0.00002875956,0.0003765234,0.00003060061,0.00003020862,0.00005139753,0.00001715773,0.9833338,0.001034526,0.004380503,0.0004820215,0.01019458],"study_design_scores_gemma":[0.000003479342,0.00002121627,0.00005469758,0.000001987194,0.000002375576,0.000007816188,0.000003262728,0.9983736,0.00007652466,0.001269295,0.0001840991,0.000001578601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1167134,0.0009582668,0.8668911,0.0005487101,0.0001096831,0.000086174,0.00006518977,0.0002464832,0.01438096],"genre_scores_gemma":[0.9277977,0.0002536546,0.06807386,0.0001666389,0.00004204995,0.0001247741,0.00005677823,0.00004522716,0.003439254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003015321,"threshold_uncertainty_score":0.005995512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972481902","doi":"10.1002/dac.4174","title":"Energy consumption optimization for self‐powered IoT networks with non‐orthogonal multiple access","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Time division multiple access; Data transmission; Computer network; Wireless; Transmission (telecommunications); Node (physics); Energy consumption; Energy harvesting; Internet of Things; Software deployment; Wireless network; Noma; Energy (signal processing); Telecommunications; Electrical engineering; Embedded system","authors":[{"name":"Xi Li","is_ca":false},{"name":"Changqing Luo","is_ca":false},{"name":"Hong Ji","is_ca":false},{"name":"Yuandong Zhuang","is_ca":false},{"name":"Heli Zhang","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01288679973913524,"gpt":0.2472382280049695,"spread":0.2343514282658343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954858,0.000529743,0.0006298027,0.0003790662,0.0002935824,0.0007708236,0.0005789989,0.0005159992,0.001151152],"category_scores_gemma":[0.001053471,0.0002544665,0.0003638566,0.0006408338,0.0004222053,0.0007221606,0.0006253845,0.0003696187,0.0001035483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007767988,"about_ca_system_score_gemma":0.0005364246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001715269,"about_ca_topic_score_gemma":0.001701356,"domain_scores_codex":[0.9996045,0.0001653965,0.00001199407,0.00005618068,0.00009083308,0.00007109866],"domain_scores_gemma":[0.9992569,0.0004785174,0.00009000264,0.00003858523,0.0001066215,0.00002924729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004448268,0.0000308538,0.0004364999,0.00004671371,0.00002738377,0.00006231933,0.00002093153,0.9815902,0.002282309,0.007146292,0.0003707939,0.007941195],"study_design_scores_gemma":[0.000002605399,0.00001912888,0.000131849,0.00000174497,0.000003672793,0.000009673642,0.000009858531,0.9977507,0.0001877895,0.00176391,0.0001170228,0.000002025251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1983629,0.001139386,0.7896535,0.0005176548,0.00007285673,0.00006900148,0.0001409761,0.0001034691,0.009940345],"genre_scores_gemma":[0.978905,0.0002913051,0.01829561,0.00004146343,0.00002056515,0.00005313865,0.00003458009,0.00001468809,0.002343679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001715269,"threshold_uncertainty_score":0.005636096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1894410978","doi":"10.1002/dac.2931","title":"QoS‐aware energy‐efficient resource allocation in OFDM‐based heterogenous cellular networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Fractional programming; Quality of service; Telecommunications link; Scheduling (production processes); Subgradient method; Efficient energy use; Iterative method; Nonlinear programming; Computer network; Nonlinear system; Algorithm; Mathematics","authors":[{"name":"Li Zhou","is_ca":false},{"name":"Chunsheng Zhu","is_ca":true},{"name":"Rukhsana Ruby","is_ca":true},{"name":"Xiaofei Wang","is_ca":true},{"name":"Xiaoting Ji","is_ca":false},{"name":"Shan Wang","is_ca":false},{"name":"Jibo Wei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01921073358640745,"gpt":0.2424243628971997,"spread":0.2232136293107923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638972,0.0002653186,0.0003019563,0.0002444658,0.0003478223,0.0004531248,0.0004230897,0.0003261484,0.0004552176],"category_scores_gemma":[0.0006985332,0.00013107,0.0001493788,0.0004522749,0.0004614156,0.0003515841,0.000403831,0.0002862315,0.00008184553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004863759,"about_ca_system_score_gemma":0.0004252622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003173287,"about_ca_topic_score_gemma":0.003672179,"domain_scores_codex":[0.9998254,0.00006455369,0.000004109914,0.00002742783,0.00004180073,0.00003675697],"domain_scores_gemma":[0.9997523,0.0001439318,0.00003661476,0.00001816691,0.00003435881,0.0000146044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002607294,0.00001723639,0.0004973179,0.00001597124,0.00001270794,0.00008035705,0.00002374843,0.9755269,0.003344158,0.005847539,0.0003920653,0.01421595],"study_design_scores_gemma":[0.000001830674,0.000005408163,0.0001101525,9.831514e-7,0.000002007395,0.00001052422,0.000007347578,0.9978437,0.0003175271,0.001531867,0.0001669078,0.000001650939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2060909,0.0008230631,0.7838748,0.0002775423,0.00004546324,0.00002327845,0.00005008555,0.000106019,0.008708937],"genre_scores_gemma":[0.9803447,0.0002029661,0.01864132,0.00003217178,0.00001722092,0.00001347206,0.00001579651,0.000006567297,0.0007260045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003173287,"threshold_uncertainty_score":0.006309628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1776285172","doi":"10.1002/dac.2625","title":"Phased arrays in communication system based on Taguchi‐neural networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Taguchi methods; Computer science; Artificial neural network; Antenna (radio); Antenna array; Perceptron; Phased array; Radiation pattern; Multilayer perceptron; Artificial intelligence; Electronic engineering; Machine learning; Telecommunications; Engineering","authors":[{"name":"Amor Smida","is_ca":false},{"name":"Ridha Ghayoula","is_ca":true},{"name":"Nadhem Nemri","is_ca":false},{"name":"H. Trabelsi","is_ca":false},{"name":"Ali Gharsallah","is_ca":false},{"name":"Dominic Grenier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01237202710849414,"gpt":0.2296950857194196,"spread":0.2173230586109255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038808,0.0002973293,0.0002991277,0.0001534681,0.00016189,0.0004488974,0.0003676307,0.0003775724,0.0008001095],"category_scores_gemma":[0.0006819863,0.0002543787,0.0002800993,0.0002402529,0.0002925573,0.0004029269,0.000231652,0.0003950133,0.0001899535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00047943,"about_ca_system_score_gemma":0.0002643747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296039,"about_ca_topic_score_gemma":0.001425715,"domain_scores_codex":[0.9997448,0.00009570338,0.00001019694,0.00003607414,0.00009396659,0.00001927429],"domain_scores_gemma":[0.9997832,0.0001098189,0.00002748481,0.00001776901,0.00005623441,0.000005365831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006766549,0.00003202867,0.0005428881,0.00006598037,0.00003283709,0.00002895965,0.00005714298,0.8889781,0.02187174,0.006897665,0.0003253384,0.08109968],"study_design_scores_gemma":[0.000002788683,0.00002352944,0.00009272435,0.000003252208,0.000005196157,0.000006929111,0.000003003049,0.9959331,0.002820709,0.000735505,0.0003701838,0.000003067154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03986787,0.0003502106,0.9552784,0.0001201254,0.0000448299,0.0000330793,0.0000108543,0.0002850594,0.004009658],"genre_scores_gemma":[0.8055663,0.0003643132,0.1901666,0.00006436839,0.00002577174,0.0000906175,0.00002026591,0.00002454341,0.003677221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001296039,"threshold_uncertainty_score":0.003478527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3113300757","doi":"10.1002/dac.4702","title":"Design of quantum‐dot cellular automata‐based communication system using modular N‐bit binary to gray and gray to binary converters","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Cancer Research Society","keywords":"Converters; Computer science; Gray code; Quantum dot cellular automaton; Binary number; Electronic engineering; Modular design; CMOS; Dissipation; Power (physics); Algorithm; Cellular automaton; Arithmetic; Mathematics; Engineering","authors":[{"name":"Suhaib Ahmed","is_ca":false},{"name":"Syed Farah Naz","is_ca":false},{"name":"Sparsh Sharma","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05313985511986732,"gpt":0.2824824556838798,"spread":0.2293426005640124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006943306,0.0001525808,0.0002241666,0.0001401242,0.0003648957,0.0004252106,0.000455381,0.0003316597,0.002006426],"category_scores_gemma":[0.0001516083,0.0001104268,0.000220705,0.0001696469,0.0001976125,0.0002690002,0.0001561647,0.0001516277,0.0003478034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004662921,"about_ca_system_score_gemma":0.0003779078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001768438,"about_ca_topic_score_gemma":0.001946669,"domain_scores_codex":[0.999912,0.00001255773,0.000007443647,0.00002609561,0.0000273478,0.00001465174],"domain_scores_gemma":[0.9999186,0.00001458128,0.00001526139,0.00001299736,0.00002961876,0.00000900452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002953412,0.000177685,0.00258689,0.0003698858,0.0001063891,0.0007189254,0.0002943238,0.1541902,0.7076173,0.05687179,0.003907995,0.07286344],"study_design_scores_gemma":[0.00005508242,0.0003664191,0.0008917975,0.00002541273,0.0000424587,0.0002125216,0.00004879478,0.8291097,0.1551439,0.003471644,0.01058988,0.00004248398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6786286,0.0008125749,0.2822773,0.0007010775,0.0003051287,0.000227021,0.0002519433,0.001376181,0.03542006],"genre_scores_gemma":[0.9658478,0.00008961556,0.03127335,0.00005244566,0.000007389618,0.0000658362,0.00003713964,0.000007881556,0.002618412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002006426,"threshold_uncertainty_score":0.006712139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995096481","doi":"10.1002/dac.765","title":"Performance analysis of hierarchical cellular networks with queueing and user retrials","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Macrocell; Computer science; Computer network; Queueing theory; Handover; Call blocking; Cellular network; Blocking (statistics); Layered queueing network; Wireless network; Wireless; Distributed computing; Telecommunications; Base station","authors":[{"name":"Xiao Liu","is_ca":true},{"name":"Abraham O. Fapojuwo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02066187238396677,"gpt":0.2886400604757122,"spread":0.2679781880917454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001741654,0.000629356,0.0004351635,0.0006313373,0.0005440338,0.0007415017,0.0008133868,0.0005999362,0.001056407],"category_scores_gemma":[0.005867864,0.0002728348,0.0003063792,0.0006368752,0.0009489517,0.0005990997,0.0008221685,0.0004788517,0.0001400062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002915293,"about_ca_system_score_gemma":0.001155639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02437205,"about_ca_topic_score_gemma":0.009865634,"domain_scores_codex":[0.9989455,0.0003646151,0.00003058623,0.0001071084,0.0002655978,0.0002866543],"domain_scores_gemma":[0.9948114,0.003093471,0.0006334514,0.0003302609,0.0008657643,0.0002657839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009382161,0.00002507546,0.001766506,0.00001822626,0.00001457769,0.00005176703,0.00004279344,0.9869673,0.00277089,0.004582834,0.0001744139,0.003491865],"study_design_scores_gemma":[0.000002536562,0.0000230401,0.0002775637,0.000001163289,0.000004041171,0.000006844806,0.00000933616,0.9987742,0.0002707549,0.0005994805,0.00002805008,0.000002877817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8268839,0.0005875892,0.1666466,0.0002632507,0.00003055924,0.00006318763,0.0001349143,0.0003538221,0.005036215],"genre_scores_gemma":[0.9972036,0.00005531271,0.002378984,0.0000136819,0.000005568524,0.000008938511,0.00002360563,0.000004562994,0.0003057647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02437205,"threshold_uncertainty_score":0.04846036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2510377198","doi":"","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Path (computing); Mathematical optimization; Average path length; Routing (electronic design automation); Convergence (economics); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","authors":[{"name":"Sudip Misra","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06935098984981178,"gpt":0.3724407295829069,"spread":0.3030897397330951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008821078,0.000759549,0.0009256031,0.0007310992,0.0004833835,0.0009894571,0.001428857,0.001336708,0.001600679],"category_scores_gemma":[0.002596311,0.0003751874,0.0006015151,0.001233663,0.0008478271,0.001739845,0.001400167,0.001537261,0.0007099244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005743998,"about_ca_system_score_gemma":0.001108706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002973733,"about_ca_topic_score_gemma":0.002122902,"domain_scores_codex":[0.9994658,0.0001294577,0.00003164628,0.0001151547,0.0002113255,0.00004661903],"domain_scores_gemma":[0.9994298,0.0002772539,0.00006117821,0.00006875093,0.0001237235,0.00003939031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001193464,0.00005875081,0.000540072,0.0001545491,0.00008185645,0.00007511391,0.0001036113,0.5706481,0.007117783,0.03404572,0.005647789,0.3814073],"study_design_scores_gemma":[0.00001666454,0.00004099138,0.00007489448,0.000007567761,0.000007650259,0.00004238841,0.000008017105,0.985611,0.0008440605,0.00918368,0.004154098,0.000008949981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003480625,0.0003862823,0.9949489,0.0001255267,0.00006309242,0.00002546234,0.00002304534,0.0002685705,0.0006785647],"genre_scores_gemma":[0.135076,0.001284634,0.8587724,0.0002260256,0.0002105191,0.0001963098,0.0002711852,0.0001739516,0.003789046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002973733,"threshold_uncertainty_score":0.00591284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237504221","doi":"10.1002/dac.1095","title":"An energy‐efficient scheme in next‐generation sensor networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Computer network; Node (physics); Quality of service; Next-generation network; Efficient energy use; Scheme (mathematics); Broadband; Exploit; Wireless; Key distribution in wireless sensor networks; Wireless network; Telecommunications; Electrical engineering; Computer security; The Internet","authors":[{"name":"Naixue Xiong","is_ca":false},{"name":"Ming Cao","is_ca":false},{"name":"Athanasios V. Vasilakos","is_ca":false},{"name":"Laurence T. Yang","is_ca":true},{"name":"Fan Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02649959064042883,"gpt":0.2793116255992595,"spread":0.2528120349588306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253896,0.0003281745,0.0003087876,0.0003687473,0.0003919276,0.0003417585,0.0009855818,0.0005542936,0.0008579133],"category_scores_gemma":[0.001351449,0.0001522473,0.0001965702,0.0005637699,0.0004654899,0.0009273805,0.000771958,0.0003613233,0.0001557655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004515753,"about_ca_system_score_gemma":0.0003542393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005609762,"about_ca_topic_score_gemma":0.0008431342,"domain_scores_codex":[0.9996219,0.0001500886,0.00001978882,0.00006312512,0.0001004618,0.00004468172],"domain_scores_gemma":[0.9995595,0.0001618876,0.00006248125,0.00009031333,0.0001002861,0.00002557155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003294638,0.0001333534,0.0009140337,0.0001901261,0.0000602793,0.0002425816,0.0001736859,0.6765103,0.05127279,0.0641984,0.002251988,0.2037231],"study_design_scores_gemma":[0.00001918924,0.000118229,0.0002322351,0.0000103333,0.00001043411,0.0001276271,0.00003485462,0.9764674,0.009136009,0.01146202,0.002370019,0.00001158294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0954737,0.001175705,0.8980672,0.0003828109,0.0001192319,0.00007748248,0.000029668,0.0003171481,0.004357025],"genre_scores_gemma":[0.9041807,0.0003223825,0.09384209,0.0001046829,0.00002396697,0.00004054403,0.00003246837,0.00001256345,0.001440566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009855818,"threshold_uncertainty_score":0.003836274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006990595","doi":"10.1002/dac.1183","title":"Analytical modeling of bidirectional multi‐channel IEEE 802.11 MAC protocols","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Mount Royal University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Distributed coordination function; Computer network; IEEE 802.11; Network allocation vector; Queue; Channel (broadcasting); Media access control; Scheduling (production processes); Wireless ad hoc network; Inter-Access Point Protocol; Throughput; Wireless network; Distributed computing; Wireless; Wi-Fi; Mathematical optimization; Telecommunications","authors":[{"name":"Vandana Gupta","is_ca":false},{"name":"Mingwei Gong","is_ca":true},{"name":"Carey Williamson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07426398559003639,"gpt":0.3692407673341473,"spread":0.294976781744111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150484,0.0005642411,0.0003322157,0.0007279553,0.000540182,0.001067531,0.001261484,0.0008117626,0.001956957],"category_scores_gemma":[0.002973172,0.000361152,0.0003662743,0.0006412037,0.0006514663,0.001176553,0.0007538103,0.0007076787,0.0005296557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001560951,"about_ca_system_score_gemma":0.001651649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006596686,"about_ca_topic_score_gemma":0.003554219,"domain_scores_codex":[0.999182,0.0002473588,0.00002647493,0.00006054047,0.0003696301,0.0001139532],"domain_scores_gemma":[0.9988134,0.0005381075,0.0001670481,0.00008524258,0.0003534433,0.00004281217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001923515,0.00004072539,0.000417766,0.00003835031,0.00001029611,0.00007925572,0.0000777396,0.8867633,0.001553283,0.1033639,0.0009145937,0.006721495],"study_design_scores_gemma":[0.000001584248,0.000005013484,0.0000395457,0.000003455442,0.000001685122,0.000009022672,0.00000638592,0.9952519,0.0001146101,0.003918852,0.0006457241,0.000002196381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04552817,0.001191176,0.9192332,0.0007104431,0.0001420526,0.0001206469,0.0001427226,0.0003549159,0.03257675],"genre_scores_gemma":[0.899725,0.001779717,0.08427879,0.0001765358,0.0001179036,0.0003584554,0.0001176113,0.00008817959,0.01335788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006596686,"threshold_uncertainty_score":0.0131166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2884096875","doi":"10.1002/dac.3773","title":"On optimizing firewall performance in dynamic networks by invoking a novel<i>swapping window</i>–based paradigm","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Firewall (physics); Computer science; Stateful firewall; The Internet; Distributed computing; Application firewall; Computer network; Network packet; Entropy (arrow of time); World Wide Web","authors":[{"name":"Ratish Mohan","is_ca":false},{"name":"Anis Yazidi","is_ca":false},{"name":"Boning Feng","is_ca":false},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01418633484215256,"gpt":0.2638186931382118,"spread":0.2496323582960593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002873911,0.0007272239,0.0006794552,0.0004508808,0.0004378571,0.0011575,0.001692415,0.001053983,0.00128719],"category_scores_gemma":[0.006254368,0.0003051342,0.000391243,0.0003696083,0.0009200475,0.002115619,0.0009947066,0.001557921,0.0002420241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000103,"about_ca_system_score_gemma":0.001419596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001901215,"about_ca_topic_score_gemma":0.001711933,"domain_scores_codex":[0.99905,0.0003276345,0.00004546922,0.0001594554,0.0002783647,0.0001390772],"domain_scores_gemma":[0.9965506,0.002009961,0.0004531321,0.000431692,0.0003960389,0.0001585557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002031405,0.000228064,0.001432577,0.00004146263,0.00003831519,0.00003530905,0.00003768902,0.9013097,0.01446085,0.02347915,0.000873522,0.05786027],"study_design_scores_gemma":[0.000005479224,0.00004293793,0.00006323896,0.000001918213,0.000002454923,0.000006665306,0.000003880241,0.9958475,0.001690374,0.002197106,0.0001353641,0.000003137028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06917334,0.0001444636,0.927075,0.0003082338,0.00004208504,0.00005269317,0.00002429237,0.0004769481,0.002702875],"genre_scores_gemma":[0.8370638,0.0001049478,0.1613651,0.0001437658,0.00004062897,0.0000637519,0.00004403962,0.00009192171,0.001081844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002873911,"threshold_uncertainty_score":0.01519889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009032439","doi":"10.1002/dac.4364","title":"Message trust‐based secure multipath routing protocol for opportunistic networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Communication source; Encryption; Latency (audio); Routing protocol; Multipath propagation; Routing (electronic design automation); Multipath routing; Disjoint sets; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","authors":[{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Jagdeep Singh","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Raghav Kumar","is_ca":false},{"name":"Geetanshu Gupta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08319818159866635,"gpt":0.3402505668820672,"spread":0.2570523852834009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276706,0.0003934145,0.0004350836,0.0006263942,0.000601199,0.0006799803,0.0007643951,0.0004984739,0.0007537632],"category_scores_gemma":[0.002720936,0.0001730323,0.0003400022,0.0005220615,0.0004303587,0.001085477,0.001410107,0.0006886465,0.0001985076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007734303,"about_ca_system_score_gemma":0.001229413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00177295,"about_ca_topic_score_gemma":0.001599988,"domain_scores_codex":[0.9992637,0.0001907978,0.00007235828,0.0000758155,0.0002877649,0.0001095139],"domain_scores_gemma":[0.998727,0.0004310032,0.0002824125,0.0002090183,0.0002808242,0.00006973494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001153111,0.0002234577,0.003549658,0.0007511019,0.0002953616,0.0016287,0.001050343,0.3541025,0.0907475,0.150736,0.01498374,0.3807785],"study_design_scores_gemma":[0.0001036492,0.0003954353,0.0007144419,0.0000454641,0.00008454771,0.0006382486,0.0001412462,0.9169161,0.02058702,0.03104616,0.0292485,0.00007919823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0751924,0.001185457,0.9138253,0.0007160259,0.000287777,0.0003705292,0.0002271347,0.00177567,0.006419778],"genre_scores_gemma":[0.9278319,0.0003591253,0.06860209,0.0001081458,0.00004762746,0.0002465535,0.0002089322,0.00003119689,0.002564432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00177295,"threshold_uncertainty_score":0.005611658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991640524","doi":"10.1002/dac.1209","title":"On the design of algorithms for mobile multimedia systems: A survey","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless broadband; WiMAX; Multimedia; Quality of service; The Internet; Wireless; Multicast; Bandwidth (computing); IMT Advanced; Mobile broadband; IP Multimedia Subsystem; Mobile QoS; Telecommunications; Multimedia Broadcast Multicast Service; Broadband networks; Wireless network; Internet access; Broadband; Service provider; Service (business); Mobile computing; Mobile technology; Mobile Web; World Wide Web","authors":[{"name":"Xiaoqiang Ma","is_ca":false},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Hongbo Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08563129976662025,"gpt":0.2928997678773895,"spread":0.2072684681107692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594277,0.001867027,0.001726263,0.001851883,0.0006421091,0.002969955,0.002350483,0.0023706,0.006720907],"category_scores_gemma":[0.008247994,0.00100169,0.0010045,0.003576866,0.001344837,0.004071077,0.001861396,0.002372035,0.003538952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056019,"about_ca_system_score_gemma":0.001083855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009605121,"about_ca_topic_score_gemma":0.0006127569,"domain_scores_codex":[0.9977622,0.0008893253,0.0001912106,0.0002375297,0.0008015863,0.0001181476],"domain_scores_gemma":[0.9967866,0.002136829,0.0001359325,0.0003195078,0.000554797,0.00006634142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001465744,0.0001687696,0.001041946,0.002136957,0.0001195685,0.0001467138,0.0002083773,0.1194258,0.002028954,0.1858807,0.02391491,0.6647809],"study_design_scores_gemma":[0.0000874183,0.0002103169,0.0004453686,0.0008877839,0.00007169018,0.0005119661,0.0001160293,0.5939688,0.001839748,0.224116,0.1776876,0.00005713073],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002000916,0.08821484,0.8917608,0.001269867,0.0006569917,0.0001134303,0.0000868028,0.0005000046,0.01539634],"genre_scores_gemma":[0.1319767,0.234238,0.6085951,0.001330528,0.004150435,0.0009666912,0.0007667725,0.0007361384,0.01723961],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006720907,"threshold_uncertainty_score":0.02248365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001985868","doi":"10.1002/dac.4325","title":"Distributed parallel algorithms for online virtual network embedding applications","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Scalability; Embedding; Distributed computing; Latency (audio); Virtualization; Algorithm; Parallel computing; Cloud computing","authors":[{"name":"Qiao Lu","is_ca":true},{"name":"Khoa Nguyen","is_ca":true},{"name":"Changcheng Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05047591075901323,"gpt":0.326580362996954,"spread":0.2761044522379407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411859,0.0009154301,0.0008102634,0.0005911514,0.0006863183,0.0009221498,0.001194367,0.0009455375,0.003182112],"category_scores_gemma":[0.002255191,0.000358553,0.0006365384,0.0007789443,0.0007039097,0.000827997,0.001024748,0.001258309,0.0005588697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001092621,"about_ca_system_score_gemma":0.001574871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00433824,"about_ca_topic_score_gemma":0.003799484,"domain_scores_codex":[0.9993634,0.000175656,0.00003313582,0.000152345,0.0001621675,0.0001134231],"domain_scores_gemma":[0.9989531,0.0005329525,0.00009969809,0.0001105891,0.0002413109,0.000062347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008827032,0.00008921506,0.0004072697,0.00005327015,0.00002029443,0.00005264125,0.00004001394,0.9275873,0.001912122,0.01318378,0.001381777,0.05518407],"study_design_scores_gemma":[0.00001309703,0.00000980281,0.00002210773,0.000001554461,0.000002014893,0.000007151195,0.000005813969,0.9955461,0.0002699176,0.003818846,0.0003019981,0.000001558622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02325975,0.0002484473,0.9716207,0.0003440918,0.00008436869,0.00007534037,0.00003362445,0.0005667437,0.003766946],"genre_scores_gemma":[0.5030901,0.000231474,0.4906562,0.0001534487,0.00007941952,0.0002805971,0.0001430322,0.0001609764,0.00520475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00433824,"threshold_uncertainty_score":0.01064521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998854585","doi":"10.1002/dac.4309","title":"An SDN approach to route massive data flows of sensor networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Distributed computing; Scalability; Routing protocol; Network packet; Network architecture; Software-defined networking; Node (physics)","authors":[{"name":"Olivier Flauzac","is_ca":false},{"name":"Carlos Javier Gonzalez Santamaria","is_ca":false},{"name":"Florent Nolot","is_ca":false},{"name":"Isaac Woungang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07304946422371607,"gpt":0.3090730002540853,"spread":0.2360235360303692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217062,0.0003309267,0.0003160745,0.0007827004,0.0005894601,0.001107875,0.001086811,0.0005444465,0.001545458],"category_scores_gemma":[0.00123692,0.0002404897,0.0004352974,0.0005190008,0.0005554497,0.00113605,0.0007854166,0.0008980759,0.0002627028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008374039,"about_ca_system_score_gemma":0.0009965503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003563347,"about_ca_topic_score_gemma":0.004726776,"domain_scores_codex":[0.9994776,0.0001436982,0.00005559492,0.00008637588,0.0001986591,0.00003808806],"domain_scores_gemma":[0.9995135,0.0001347966,0.00003248462,0.00007395648,0.0002113086,0.00003398028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001738048,0.0001160668,0.001546264,0.0002214811,0.0001424971,0.0002808159,0.000253525,0.5335808,0.01641988,0.2033532,0.006675974,0.2372356],"study_design_scores_gemma":[0.0000168816,0.00003458531,0.00009441317,0.00001797237,0.00001611528,0.0000385784,0.00002530115,0.9615081,0.002540575,0.02504501,0.01065377,0.000008753806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005089949,0.0003285785,0.9903746,0.0002623947,0.0001832418,0.00007773879,0.00003995217,0.0003707345,0.003272791],"genre_scores_gemma":[0.3407798,0.0009097863,0.6493149,0.0002324534,0.0001767814,0.0002790493,0.0003028094,0.00008903989,0.007915363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003563347,"threshold_uncertainty_score":0.007085204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993274576","doi":"10.1002/dac.496","title":"A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Computation; Controller (irrigation); Simple (philosophy); Flow control (data); Process (computing); Scheme (mathematics); Control (management); Algorithm; Control theory (sociology); Computer network; Mathematics","authors":[{"name":"James Aweya","is_ca":true},{"name":"Michel Ouellette","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0164899866431664,"gpt":0.2715358232506895,"spread":0.2550458366075231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526503,0.0005208352,0.0005444833,0.0005173553,0.000537738,0.001071391,0.001329562,0.0006545241,0.001399496],"category_scores_gemma":[0.004731606,0.0002581565,0.0002850164,0.0003192085,0.00108657,0.001371913,0.0009736935,0.001030504,0.0002820615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006639804,"about_ca_system_score_gemma":0.0009387952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001119467,"about_ca_topic_score_gemma":0.0009777388,"domain_scores_codex":[0.9990878,0.000215282,0.00006155869,0.0001329384,0.0004162218,0.00008610661],"domain_scores_gemma":[0.9981184,0.0008030583,0.0002189091,0.0004646586,0.0003225033,0.00007252156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005875383,0.0002649642,0.0008730742,0.000231452,0.00006064458,0.0002568116,0.0003154155,0.3663364,0.1272384,0.1575145,0.003601024,0.3427197],"study_design_scores_gemma":[0.00007968268,0.000133416,0.0001209182,0.00001202452,0.00001241456,0.00007415826,0.000007200567,0.9704363,0.01663965,0.009908096,0.00255396,0.00002218271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02353492,0.0002525985,0.9735144,0.00008800672,0.0000800187,0.0001148739,0.00001594915,0.001148292,0.001251006],"genre_scores_gemma":[0.675701,0.0001958109,0.3210145,0.00009906616,0.00009864071,0.0001689153,0.00005337226,0.00009511205,0.002573455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001526503,"threshold_uncertainty_score":0.008073032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250203847","doi":"10.1002/dac.976","title":"An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; Graph; K shortest path routing; Theoretical computer science","authors":[{"name":"Sudip Misra","is_ca":false},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04909891223916364,"gpt":0.3075747939105659,"spread":0.2584758816714023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721626,0.0007771082,0.001429734,0.001258105,0.0005532222,0.001360384,0.001936733,0.001309361,0.001895422],"category_scores_gemma":[0.008936211,0.0006174036,0.0008902929,0.0009589284,0.001164135,0.00189206,0.002060262,0.001616,0.0003546294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073697,"about_ca_system_score_gemma":0.001477515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005692359,"about_ca_topic_score_gemma":0.003515754,"domain_scores_codex":[0.9991054,0.0002863788,0.00006484112,0.0002444919,0.0002108279,0.00008810936],"domain_scores_gemma":[0.9956142,0.003096272,0.0002622073,0.0002774206,0.0005961829,0.0001537599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006204416,0.00003230042,0.0008445581,0.00004561844,0.00003731754,0.00003235224,0.00005872503,0.9407874,0.000880152,0.01261318,0.0003930104,0.04421343],"study_design_scores_gemma":[0.000001929857,0.00000754855,0.00002243085,0.000001652349,0.000001309669,0.000002975034,0.000003290614,0.9972907,0.0001132175,0.002491931,0.00006124676,0.000001789277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246742,0.00007815519,0.9865621,0.0001022938,0.00001836085,0.00002647613,0.00003112035,0.0001894684,0.0005246273],"genre_scores_gemma":[0.6420262,0.000213672,0.3543856,0.0001596674,0.0000639331,0.0003030058,0.0002653921,0.0001042545,0.002478335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005692359,"threshold_uncertainty_score":0.01131845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2555769812","doi":"10.1002/dac.3232","title":"An altruism‐based trust‐dependent message forwarding protocol for opportunistic networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Routing protocol; Overhead (engineering); Routing (electronic design automation); Altruism (biology); Protocol (science); Computer security; Distributed computing","authors":[{"name":"Arun Kumar","is_ca":false},{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Mohammad S. Obaidat","is_ca":false},{"name":"Sahil Gupta","is_ca":false},{"name":"Joel J. P. C. Rodrigues","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05598276550066567,"gpt":0.3529024678468463,"spread":0.2969197023461806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359729,0.0003300448,0.000394532,0.0004585085,0.0008081698,0.0006043242,0.001155644,0.0004633627,0.0006838249],"category_scores_gemma":[0.003763842,0.000171435,0.0003366178,0.0003508583,0.000530534,0.0007875477,0.001665031,0.0005439576,0.0001417579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007993212,"about_ca_system_score_gemma":0.001195377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002003761,"about_ca_topic_score_gemma":0.002200484,"domain_scores_codex":[0.9991996,0.0002657188,0.00006739279,0.00008955236,0.0002781505,0.00009968428],"domain_scores_gemma":[0.9979887,0.0008632041,0.0003432175,0.0002658918,0.0003646871,0.0001743222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001347877,0.0004259616,0.007208609,0.0004653384,0.0002568991,0.001615329,0.002718484,0.4079498,0.06789957,0.2215534,0.01049123,0.2780674],"study_design_scores_gemma":[0.00005714467,0.0001869491,0.0005743645,0.00002240072,0.00005986117,0.0003355684,0.0001527182,0.9528642,0.008663595,0.02805168,0.008983399,0.00004800389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.100593,0.0001942933,0.8921022,0.0003849221,0.0001007975,0.0002243155,0.000103902,0.0005086616,0.005787923],"genre_scores_gemma":[0.9190159,0.0000940605,0.07722404,0.00007348599,0.00002006512,0.0001679713,0.000109634,0.00002447605,0.003270366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002003761,"threshold_uncertainty_score":0.007191002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1942242957","doi":"10.1002/dac.2329","title":"Performance analysis of decision directed maximum likelihood MIMO channel tracking algorithm","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Channel (broadcasting); Computer science; Algorithm; MIMO; Tracking (education); Mode (computer interface); Doppler effect; Bit error rate; Word error rate; Telecommunications; Speech recognition","authors":[{"name":"Ebrahim Karami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01581395111622862,"gpt":0.2699696193771431,"spread":0.2541556682609145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00261261,0.0007097973,0.0006902086,0.0006633824,0.0005166339,0.001486988,0.0007402368,0.0009593839,0.002714171],"category_scores_gemma":[0.01320951,0.0003032387,0.0003660928,0.0007078821,0.0007057945,0.0011985,0.001348369,0.0007779533,0.0008567655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009099919,"about_ca_system_score_gemma":0.001677077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00192286,"about_ca_topic_score_gemma":0.001088426,"domain_scores_codex":[0.9973956,0.001038416,0.0001153614,0.0002725595,0.0009445028,0.000233574],"domain_scores_gemma":[0.9924906,0.004949677,0.00046794,0.0005702255,0.001381528,0.000139957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006302817,0.00006124793,0.00251046,0.000131471,0.00007937592,0.00009411616,0.0001274185,0.8683174,0.008361132,0.01561435,0.001524731,0.102548],"study_design_scores_gemma":[0.00001198986,0.00004844628,0.0002929072,0.000009258364,0.00000833316,0.00005590009,0.00001202917,0.9940269,0.003269307,0.001988222,0.0002647065,0.00001212116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03402566,0.0005387303,0.9598794,0.0002319172,0.00003929078,0.00004351939,0.00006831247,0.0005765188,0.00459655],"genre_scores_gemma":[0.8443541,0.0004580389,0.1516746,0.0002190848,0.00004120306,0.0001026606,0.0002814822,0.0001077859,0.00276103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002714171,"threshold_uncertainty_score":0.01381695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159329951","doi":"10.1002/dac.678","title":"Effects of control loop delay on the stability of a rate control algorithm","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Stability (learning theory); Control theory (sociology); Loop (graph theory); Computer science; Upper and lower bounds; Control (management); Control system; Domain (mathematical analysis); Process (computing); Mathematics; Mathematical analysis; Engineering","authors":[{"name":"James Aweya","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true},{"name":"Michel Ouellette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0106927413827747,"gpt":0.2410676361364338,"spread":0.2303748947536591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002057246,0.0004938622,0.0006553286,0.000493075,0.000460375,0.001168003,0.0004113972,0.000702781,0.001678245],"category_scores_gemma":[0.01340699,0.000228731,0.0003430679,0.0001687842,0.001179471,0.0008985607,0.0008628194,0.0007875027,0.000137911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008485015,"about_ca_system_score_gemma":0.0006830765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001767656,"about_ca_topic_score_gemma":0.0006189918,"domain_scores_codex":[0.9990476,0.0002822139,0.00004008467,0.0001342399,0.0003372129,0.00015863],"domain_scores_gemma":[0.9895254,0.008519799,0.0006498454,0.000424271,0.0007783274,0.0001022983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000630842,0.00005620682,0.001286191,0.0001253895,0.00003520702,0.0002345297,0.000215235,0.9280931,0.02920412,0.02222661,0.0001564471,0.01773616],"study_design_scores_gemma":[0.00001861219,0.0001104765,0.0002032224,0.000008659743,0.000007759546,0.00003800412,0.00001490941,0.9920511,0.005501807,0.00189241,0.0001443577,0.000008821669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5425333,0.0009674297,0.4451416,0.0004104313,0.00008520672,0.00007656097,0.00003573397,0.0003570418,0.01039275],"genre_scores_gemma":[0.9957419,0.00008623936,0.003779411,0.00001672445,0.000007289891,0.00001170288,0.00000510174,0.00001319757,0.0003383745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002057246,"threshold_uncertainty_score":0.01087987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237498632","doi":"10.1002/dac.949","title":"Symbol detection in spatial multiplexing system using particle swarm optimization meta‐heuristics","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MIMO; Particle swarm optimization; Detector; Spatial multiplexing; Algorithm; Bit error rate; Reduction (mathematics); Computational complexity theory; Heuristics; Convergence (economics); Multiplexing; Swarm intelligence; Communications system; Channel (broadcasting); Mathematics; Telecommunications; Decoding methods","authors":[{"name":"Adnan Ahmed Khan","is_ca":false},{"name":"Sajid Bashir","is_ca":false},{"name":"Muhammad Naeem","is_ca":true},{"name":"Syed Ismail Shah","is_ca":false},{"name":"Xiaodong Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05320433408325118,"gpt":0.2888840682822194,"spread":0.2356797341989682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354489,0.0007252386,0.001075984,0.0007610828,0.0003483604,0.0009812715,0.0006284749,0.0009619637,0.0006366097],"category_scores_gemma":[0.002893279,0.0004367037,0.0004818251,0.0005593571,0.0006517441,0.0005950707,0.0006298868,0.0005956364,0.0001219594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009594014,"about_ca_system_score_gemma":0.0009595836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004290872,"about_ca_topic_score_gemma":0.002910517,"domain_scores_codex":[0.9995914,0.0001869141,0.00002008512,0.00004546801,0.00009003767,0.00006594531],"domain_scores_gemma":[0.9977342,0.001725511,0.0001931054,0.00005931103,0.0002198336,0.00006805421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004576476,0.00002070851,0.0003088428,0.00002053525,0.00004111366,0.00001728575,0.00002010857,0.9842897,0.0004328066,0.002430093,0.0001900567,0.01218309],"study_design_scores_gemma":[0.000005981488,0.00001412434,0.00002991785,0.000001643282,0.000003379112,0.00000279694,0.000002290885,0.9993699,0.0001102657,0.0004248057,0.00003320976,0.000001654842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1174167,0.0008700002,0.8768594,0.0003492425,0.00006701905,0.00007014506,0.00003467012,0.0002611094,0.004071631],"genre_scores_gemma":[0.9010901,0.0002030448,0.09690132,0.0001289243,0.00002805896,0.00008941765,0.00003766496,0.00002014192,0.001501413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004290872,"threshold_uncertainty_score":0.008531809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3114904922","doi":"10.1002/dac.4691","title":"Distributed parallel genetic algorithm for online virtual network embedding","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Distributed computing; Virtual network; Embedding; Node (physics); Virtualization; Computer network; The Internet; Heterogeneous network; Orchestration; Cloud computing; Wireless network; Operating system; Artificial intelligence","authors":[{"name":"Khoa Nguyen","is_ca":true},{"name":"Changcheng Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03433580126525338,"gpt":0.3005300169221476,"spread":0.2661942156568942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006300884,0.0007403966,0.0008939238,0.0007923541,0.0005484772,0.0007508883,0.0009140683,0.001122575,0.002506271],"category_scores_gemma":[0.001686901,0.0003395639,0.0006657864,0.0006751994,0.0005680859,0.0005267976,0.0006774499,0.0009154895,0.0003116433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044042,"about_ca_system_score_gemma":0.001771326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01192311,"about_ca_topic_score_gemma":0.00791621,"domain_scores_codex":[0.9996718,0.0001073543,0.00001336529,0.0000692702,0.00007510666,0.00006318466],"domain_scores_gemma":[0.9993375,0.0003997852,0.00004300351,0.00003387994,0.0001540764,0.00003183515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002846591,0.00003348613,0.0003391549,0.00002199503,0.00001806096,0.00003566423,0.00002609026,0.9656472,0.0006033722,0.004174731,0.0006321421,0.02843959],"study_design_scores_gemma":[0.000006767158,0.00000733851,0.00002856649,0.000001553479,0.000002407411,0.000004357188,0.000003896405,0.998755,0.00009698365,0.0009113252,0.0001802471,0.000001533234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0412052,0.0004112538,0.949731,0.0003907949,0.0001121002,0.0001116164,0.00005985228,0.0006064334,0.007371804],"genre_scores_gemma":[0.6489512,0.000224406,0.3437102,0.000199762,0.00003351875,0.0003301635,0.000160704,0.00008881911,0.00630115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01192311,"threshold_uncertainty_score":0.02370739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245964686","doi":"10.1002/dac.947","title":"An energy‐efficient localized topology control algorithm for wireless<i>ad hoc</i>and sensor networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Topology control; Computer science; Wireless sensor network; Wireless ad hoc network; Computer network; Topology (electrical circuits); Network topology; Mobile wireless sensor network; Wireless network; Distributed computing; Optimized Link State Routing Protocol; Logical topology; Overhead (engineering); Mobile ad hoc network; Algorithm; Routing protocol; Key distribution in wireless sensor networks; Wireless; Routing (electronic design automation); Network packet; Mathematics; Telecommunications","authors":[{"name":"Haitao Liu","is_ca":false},{"name":"Baoxian Zhang","is_ca":false},{"name":"Jun Zheng","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01351140436214524,"gpt":0.2666373892939119,"spread":0.2531259849317666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827295,0.0003537836,0.0003717078,0.000590407,0.0004349613,0.0004925963,0.00066559,0.0003919153,0.0006610712],"category_scores_gemma":[0.001126426,0.0001410791,0.000219797,0.0003430437,0.0004740154,0.0008018559,0.000494261,0.0004002774,0.0001137326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003995397,"about_ca_system_score_gemma":0.000453259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009987744,"about_ca_topic_score_gemma":0.0009145801,"domain_scores_codex":[0.9998494,0.00004412978,0.0000100845,0.00003595481,0.00004272908,0.00001759404],"domain_scores_gemma":[0.9995837,0.0001693781,0.0001003425,0.00004199349,0.00007458215,0.0000300668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002404853,0.0001373084,0.001269629,0.0001253596,0.00005096678,0.0002109195,0.0002623156,0.5970277,0.04829625,0.03232438,0.00335634,0.3166984],"study_design_scores_gemma":[0.0000362616,0.0001243039,0.0001432306,0.000006648062,0.00001287807,0.0000773139,0.0000223608,0.9877121,0.006417113,0.004109434,0.001329262,0.000009077676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04674507,0.0002624446,0.9509132,0.0001517113,0.00002982807,0.0000542154,0.00001199353,0.0005061541,0.001325431],"genre_scores_gemma":[0.8214117,0.0001918437,0.1765374,0.00007795956,0.00003169685,0.000120326,0.00005232246,0.00004178135,0.001535009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009987744,"threshold_uncertainty_score":0.002898932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1914281590","doi":"10.1002/dac.2940","title":"A novel energy‐efficient cross‐application‐layer platform with QoS‐security support","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Layer (electronics); Computer network; Energy (signal processing); Efficient energy use; Chemistry","authors":[{"name":"Sasan Adibi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03488672699328982,"gpt":0.2949185769487648,"spread":0.260031849955475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000449911,0.0003903167,0.0003841703,0.0003840377,0.000445748,0.001016189,0.001725599,0.0005939974,0.002747552],"category_scores_gemma":[0.0005397738,0.0002319684,0.0002848314,0.0002566438,0.0003002695,0.001338572,0.001686251,0.0009001876,0.001030174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003241134,"about_ca_system_score_gemma":0.0005823541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000349946,"about_ca_topic_score_gemma":0.0004304051,"domain_scores_codex":[0.9995129,0.0000549476,0.00003609047,0.00009747922,0.0001842751,0.000114188],"domain_scores_gemma":[0.9996207,0.00004057258,0.0000606879,0.00009540819,0.000109253,0.00007343558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000713989,0.0006594194,0.001996194,0.0002982222,0.0001391025,0.001419946,0.0002223,0.04719589,0.7286607,0.06346605,0.009491009,0.1457372],"study_design_scores_gemma":[0.0001135297,0.0007706078,0.001093163,0.00003192122,0.0000833381,0.001041081,0.00006773078,0.7716135,0.1791612,0.008157529,0.03778207,0.00008421398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2267717,0.001010687,0.7442718,0.0009223917,0.0006085332,0.0003149753,0.0001070744,0.005075567,0.02091723],"genre_scores_gemma":[0.8555707,0.0002403109,0.1339559,0.0003386895,0.00008720509,0.0001129877,0.00009823899,0.00009036358,0.009505642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002747552,"threshold_uncertainty_score":0.009191513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062371900","doi":"10.1002/dac.640","title":"QoS routing through alternate paths in wireless<i>ad hoc</i>networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","authors":[{"name":"Baoxian Zhang","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02008044055838785,"gpt":0.2835944523336849,"spread":0.263514011775297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396463,0.0003487401,0.0002981884,0.0007260307,0.0004719239,0.0008835151,0.000544981,0.0004472547,0.000658229],"category_scores_gemma":[0.0017378,0.0002088014,0.0001692285,0.0005438513,0.0005610315,0.0009625939,0.0005678816,0.0003123659,0.0001624798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003711869,"about_ca_system_score_gemma":0.0003334759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006621062,"about_ca_topic_score_gemma":0.0006594895,"domain_scores_codex":[0.9996498,0.0001320198,0.00002997393,0.00004220324,0.0001060669,0.00003995833],"domain_scores_gemma":[0.9990494,0.0004943608,0.000172209,0.00006911808,0.0001599048,0.00005492819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006602674,0.0001660229,0.005393344,0.0005600478,0.00009197146,0.000989761,0.0007422433,0.4322291,0.1028599,0.1146974,0.005299808,0.3363103],"study_design_scores_gemma":[0.00005678834,0.0003426016,0.0006905448,0.00004618603,0.00005699821,0.0009223351,0.0001611874,0.9215101,0.01701518,0.04446451,0.01470021,0.00003333791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2737066,0.005635521,0.7107013,0.0009869268,0.0002086776,0.0001038022,0.000107016,0.0007184573,0.007831705],"genre_scores_gemma":[0.8906305,0.001994564,0.1052135,0.0001035343,0.00006705362,0.00005713847,0.00009606592,0.00003036327,0.001807275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008835151,"threshold_uncertainty_score":0.003911674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481821562","doi":"10.1002/dac.2359","title":"Performance of transmitted reference pulse cluster ultra‐wideband systems with forward error correction","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Forward error correction; Convolutional code; Bit error rate; Ultra-wideband; TRPC; Electronic engineering; Error detection and correction; Wireless; Coding (social sciences); Interleaving; Computer network; Real-time computing; Algorithm; Telecommunications; Decoding methods","authors":[{"name":"Zhonghua Liang","is_ca":true},{"name":"Xiaodai Dong","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Xuewen Liao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01670067573893484,"gpt":0.2492470602067021,"spread":0.2325463844677673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266183,0.000516088,0.0006652048,0.0004213256,0.0005604543,0.0006737387,0.0006376122,0.001166935,0.001395015],"category_scores_gemma":[0.002380981,0.0001546878,0.0002578835,0.0004539817,0.0004736712,0.000539025,0.0006934488,0.0007324116,0.0003904348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005923186,"about_ca_system_score_gemma":0.000787991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002283045,"about_ca_topic_score_gemma":0.001114487,"domain_scores_codex":[0.9991741,0.0002103082,0.00003569493,0.0001312831,0.0002744176,0.0001741462],"domain_scores_gemma":[0.9973691,0.001020065,0.00022442,0.0002918337,0.001001758,0.00009271718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006329678,0.0004163051,0.01017256,0.0005354024,0.0004827819,0.0008351869,0.0008522875,0.4821686,0.2810177,0.01127814,0.002919897,0.2029915],"study_design_scores_gemma":[0.0001471295,0.001683707,0.003182002,0.00004064892,0.0001414953,0.0006505775,0.0001116418,0.8896478,0.101212,0.001506957,0.001598121,0.00007787401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8738173,0.0009011679,0.1150641,0.0002704793,0.0001316746,0.00006040702,0.0001298876,0.0009377046,0.008687187],"genre_scores_gemma":[0.993158,0.00007452766,0.005854443,0.00004392459,0.00001357718,0.00001401784,0.00006879371,0.0000109634,0.0007616882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002283045,"threshold_uncertainty_score":0.006696284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2566309962","doi":"10.1002/dac.3247","title":"Resource allocation in heterogeneous cooperative cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Cognitive radio; Cooperative diversity; Resource allocation; Relay; Computer network; Diversity (politics); Wireless; Channel (broadcasting); Resource (disambiguation); Interference (communication); Wireless network; Constraint (computer-aided design); Harm; Transmission (telecommunications); Telecommunications","authors":[{"name":"Babatunde Seun Awoyemi","is_ca":false},{"name":"B. T. Maharaj","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01823933163246986,"gpt":0.2698964932296766,"spread":0.2516571615972067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051091,0.0004964917,0.0006450683,0.0004568184,0.0004185225,0.001081858,0.000924782,0.0006485349,0.001172124],"category_scores_gemma":[0.00230343,0.0002559254,0.0004081085,0.0005636702,0.0008447475,0.0008839028,0.0008289819,0.000427088,0.0001952434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00128382,"about_ca_system_score_gemma":0.0008410709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006454661,"about_ca_topic_score_gemma":0.004256522,"domain_scores_codex":[0.99925,0.0002716506,0.00001812996,0.0001169677,0.0001718255,0.0001715423],"domain_scores_gemma":[0.9990079,0.0005732875,0.0001229786,0.00008090658,0.0001566576,0.00005837194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003396327,0.0000255898,0.0002236308,0.00001653417,0.00001662152,0.00007688446,0.00002596087,0.9797084,0.001253827,0.01286121,0.0003353279,0.005422067],"study_design_scores_gemma":[0.00000310408,0.0000141967,0.0000679393,0.000001994086,0.000004274358,0.000009953528,0.00001317694,0.9938368,0.0001422701,0.005741856,0.0001612876,0.000003078872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1219817,0.0007058099,0.8643622,0.0003611704,0.00006191637,0.00005189668,0.00005313781,0.0001458482,0.01227622],"genre_scores_gemma":[0.9894493,0.0001591207,0.008256544,0.0000486604,0.00001890325,0.00003411393,0.00001544546,0.000009992919,0.00200788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006454661,"threshold_uncertainty_score":0.01283413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018278884","doi":"10.1002/dac.1051","title":"An application of univariate marginal distribution algorithm in MIMO communication systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"MIMO; Computer science; Algorithm; Detector; Computational complexity theory; Bit error rate; Transmitter power output; Optimization problem; Mathematical optimization; Mathematics; Channel (broadcasting); Decoding methods; Telecommunications","authors":[{"name":"Sajid Bashir","is_ca":false},{"name":"Muhammad Naeem","is_ca":true},{"name":"Adnan Ahmed Khan","is_ca":false},{"name":"Syed Ismail Shah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008874788257901774,"gpt":0.2857819306395729,"spread":0.2769071423816711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463941,0.0003845695,0.0005924016,0.0004367074,0.0002269055,0.0005905013,0.0005073347,0.0004991619,0.00141212],"category_scores_gemma":[0.003921471,0.0002084404,0.0003437076,0.0005094896,0.0007367841,0.0006748697,0.0006905958,0.0006785215,0.0003451183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005855522,"about_ca_system_score_gemma":0.0009514065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001283826,"about_ca_topic_score_gemma":0.001006806,"domain_scores_codex":[0.9992625,0.0003934409,0.00002272793,0.00008479246,0.0001893227,0.00004724576],"domain_scores_gemma":[0.9982362,0.001251831,0.00008999898,0.0001397136,0.0002375079,0.00004477648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003595931,0.00006714211,0.003199887,0.0001130429,0.00009017012,0.000195384,0.00013282,0.5627071,0.01346348,0.1380175,0.001869332,0.2797846],"study_design_scores_gemma":[0.000006367822,0.00002994644,0.0001858081,0.000002996868,0.000004073844,0.00007265394,0.00000483435,0.9879288,0.002301833,0.008824938,0.0006306014,0.000007083361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007800597,0.0001650416,0.9910484,0.00008305762,0.00001310011,0.000008909367,0.00001332586,0.0001702071,0.0006974029],"genre_scores_gemma":[0.6137036,0.0003905823,0.3830256,0.0001052862,0.00007044128,0.00005016857,0.00007450669,0.0000565064,0.002523176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001463941,"threshold_uncertainty_score":0.007742107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2393582145","doi":"10.1002/dac.3146","title":"The offloading model for green base stations in hybrid energy networks with multiple objectives","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Base station; Base (topology); Computer network; Energy consumption; Distributed computing; Telecommunications; Electrical engineering","authors":[{"name":"Yifei Wei","is_ca":false},{"name":"Chenying Ren","is_ca":false},{"name":"Mei Song","is_ca":false},{"name":"F. Richard Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01463846047788904,"gpt":0.2349744516533772,"spread":0.2203359911754882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006678346,0.0009212392,0.0007005649,0.0004646812,0.000561767,0.001149352,0.001236411,0.001056333,0.002279566],"category_scores_gemma":[0.0009661517,0.0003904298,0.0008164809,0.000454062,0.0007675351,0.001120094,0.0009677689,0.0008712137,0.0002151807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001326724,"about_ca_system_score_gemma":0.0007150856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009570548,"about_ca_topic_score_gemma":0.006433416,"domain_scores_codex":[0.999727,0.00006854097,0.000009016077,0.00005862827,0.0000574984,0.0000793842],"domain_scores_gemma":[0.9996969,0.000153955,0.00004184285,0.00001409026,0.00006880749,0.00002448694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001808788,0.000008592182,0.0002192147,0.00001464286,0.000007034457,0.00004164995,0.00002303898,0.992215,0.0004559126,0.004729998,0.0001652574,0.00210162],"study_design_scores_gemma":[0.000001460723,0.000004709429,0.00003527322,0.000001391919,0.000002203823,0.00000290973,0.000006678973,0.9988177,0.0000538054,0.001014794,0.00005751962,0.000001428445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115651,0.0003863611,0.8690571,0.0005201368,0.00005652629,0.00007345196,0.0001483076,0.0001606963,0.01394646],"genre_scores_gemma":[0.9805272,0.0002086009,0.01250872,0.00005799698,0.00001849891,0.0001083063,0.00006441304,0.00002740838,0.006478854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009570548,"threshold_uncertainty_score":0.01902968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}