{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":41,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":41,"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":"541fb6ba9b96","filters":{"venue":"Journal of Communications and Networks"}},"results":[{"id":"W2124297703","doi":"10.1109/jcn.2002.6596934","title":"On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":370,"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; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Routing protocol; Telecommunications","authors":[{"name":"Jie Wu","is_ca":false},{"name":"Fei Dai","is_ca":false},{"name":"Ming Gao","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02377303206741777,"gpt":0.2757971317582326,"spread":0.2520240996908149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416487,0.0002003153,0.0004059101,0.0001719929,0.0004642,0.0002085893,0.001349631,0.0001584643,0.000006731411],"category_scores_gemma":[0.0001113039,0.0001849383,0.0001281738,0.0006322447,0.00008273725,0.0002258849,0.0004458381,0.0008509772,5.721819e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062505,"about_ca_system_score_gemma":0.00002354577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003191037,"about_ca_topic_score_gemma":0.00002944666,"domain_scores_codex":[0.9978953,0.0003169363,0.0009075671,0.00023143,0.0002197261,0.0004290605],"domain_scores_gemma":[0.9950463,0.002738512,0.0008175584,0.0009827316,0.0002753138,0.0001395474],"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.00003581385,0.0002784494,0.0004932178,0.000009790734,0.00004691481,0.00001285527,0.00144064,0.618372,0.00001191329,0.01855848,0.0005273728,0.3602126],"study_design_scores_gemma":[0.00111035,0.0002655113,0.0007965596,0.0005521766,0.00001340821,0.00006128227,0.0001415539,0.9963445,0.000002352599,0.0002438579,0.0002793456,0.0001890709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1254165,0.007925099,0.8645272,0.001050622,0.0003270493,0.0004001042,0.000001247613,0.00003997837,0.0003122202],"genre_scores_gemma":[0.980278,0.0013582,0.01799609,0.0002367778,0.00007422382,0.00002309405,0.000002662001,0.0000210032,0.00001000636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8548614,"threshold_uncertainty_score":0.7541565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166955633","doi":"10.1109/jcn.2011.6157413","title":"IEEE 802.15.6 under saturation: Some problems to be expected","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":53,"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 Manitoba","funders":"","keywords":"Computer science; Markov chain; IEEE 802.15; Distributed coordination function; IEEE 802.11; Wireless; Channel (broadcasting); Body area network; Computer network; Inter-Access Point Protocol; IEEE 802.11b-1999; Wireless network; Wi-Fi; Wireless sensor network; Telecommunications; Machine learning","authors":[{"name":"Saeed Rashwand","is_ca":true},{"name":"Jelena Mišić","is_ca":true},{"name":"Hamzeh Khazaei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04977944791952341,"gpt":0.2406443396206263,"spread":0.1908648917011029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002265219,0.0001273178,0.0002090438,0.0001162453,0.0001432339,0.00005041611,0.000495195,0.0001084227,0.00003093939],"category_scores_gemma":[0.000005847207,0.0001161062,0.00005749714,0.0002487969,0.00006125395,0.0003198076,0.00008051651,0.0004709808,0.000002742979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004296744,"about_ca_system_score_gemma":0.00001752267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005591644,"about_ca_topic_score_gemma":0.00006939894,"domain_scores_codex":[0.9991373,0.0000618483,0.0004369291,0.00006677312,0.0001141989,0.0001829828],"domain_scores_gemma":[0.9988789,0.0001073299,0.0001249307,0.0005980326,0.0001394894,0.0001513342],"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.0001225835,0.0004117746,0.001390876,0.00005438377,0.0008266103,0.00001674041,0.01225802,0.8262968,0.002381795,0.02151285,0.06879986,0.06592768],"study_design_scores_gemma":[0.002425899,0.0008341186,0.03237864,0.0009915717,0.0002731548,0.000551213,0.00204401,0.8539723,0.0006728,0.009255464,0.09509071,0.001510153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4142916,0.1027892,0.4511847,0.006988174,0.003233738,0.001137686,0.00001110306,0.0005572601,0.01980646],"genre_scores_gemma":[0.9840792,0.007368533,0.007916803,0.0002640114,0.0002907888,0.00001271996,0.000004044641,0.00002813883,0.0000357733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5697876,"threshold_uncertainty_score":0.4734675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157635692","doi":"10.1109/jcn.2002.6596933","title":"Multipath routing for mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":50,"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; Computer network; Multipath routing; Wireless ad hoc network; Mobile ad hoc network; Multipath propagation; Routing (electronic design automation); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless Routing Protocol; Routing protocol; Telecommunications; Wireless","authors":[{"name":"Kui Wu","is_ca":true},{"name":"Janelle Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03099292896093242,"gpt":0.270579468854835,"spread":0.2395865398939026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946717,0.0001617596,0.0003212473,0.00008741152,0.000451786,0.0002248005,0.001952514,0.0001349256,0.00001138669],"category_scores_gemma":[0.00003428978,0.0001433411,0.0001628813,0.0003535481,0.0001064211,0.0005198243,0.0005396552,0.0005770564,0.000001409675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004041748,"about_ca_system_score_gemma":0.00001840401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.066098e-7,"about_ca_topic_score_gemma":0.0000105609,"domain_scores_codex":[0.9984862,0.0001645368,0.0006764396,0.000173336,0.0001575888,0.0003418487],"domain_scores_gemma":[0.9965765,0.0009788171,0.000628295,0.001350896,0.0002917286,0.0001737577],"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.00001275087,0.0001673839,0.0002798421,0.000004808111,0.0000620865,0.000003281117,0.0005643468,0.05385524,0.000006526393,0.004879497,0.006119762,0.9340445],"study_design_scores_gemma":[0.0005707564,0.0002851072,0.0001764018,0.0000842598,0.00002437065,0.00008988221,0.00005040587,0.894609,0.000001393543,0.0003251632,0.1036432,0.0001400458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00139742,0.124648,0.8721491,0.0007543857,0.0003491098,0.0002976433,8.908157e-7,0.00003759839,0.0003658673],"genre_scores_gemma":[0.8238038,0.06248939,0.1129125,0.0003112111,0.0002999398,0.00005346859,0.000002091115,0.00001808665,0.0001094998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9339044,"threshold_uncertainty_score":0.5845279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2199985122","doi":"10.1109/jcn.2011.6157410","title":"Wireless three-pad ECG system: Challenges, design, and evaluations","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":31,"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":"Dalhousie University","keywords":"Computer science; Electrocardiography; Lead (geology); Wireless; Data mining; Artificial intelligence; Medicine; Telecommunications; Cardiology","authors":[{"name":"Huasong Cao","is_ca":true},{"name":"Haoming Li","is_ca":true},{"name":"Leo Stocco","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07770571878270267,"gpt":0.2551535694948426,"spread":0.17744785071214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000861517,0.0001354244,0.0002591244,0.0001021039,0.0001939939,0.00003703381,0.0004089928,0.0001208808,0.000006245681],"category_scores_gemma":[0.000007550023,0.0001228835,0.0000446588,0.0001268352,0.0001214727,0.0002162831,0.000108513,0.0004287661,0.000001075492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004171273,"about_ca_system_score_gemma":0.00002151575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005505493,"about_ca_topic_score_gemma":0.00005267305,"domain_scores_codex":[0.9990412,0.0001583964,0.0004373452,0.00007464481,0.0001193347,0.0001690766],"domain_scores_gemma":[0.9986779,0.00029416,0.0001675352,0.0005729783,0.0001623564,0.0001250657],"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.00008281219,0.0002059483,0.002415069,0.0002146023,0.0007751514,0.0000210038,0.004046011,0.07934315,0.0001455987,0.03337228,0.001662846,0.8777155],"study_design_scores_gemma":[0.0003475788,0.00009126931,0.006502494,0.0003324175,0.0001134011,0.0001919986,0.0003112712,0.990433,0.00001257699,0.0006819226,0.0008331355,0.0001489275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02642591,0.1951517,0.7722321,0.0003183569,0.0003691979,0.0003327133,0.000001637122,0.0001287676,0.005039693],"genre_scores_gemma":[0.9173571,0.06209841,0.02038487,0.000009779465,0.0001023682,0.00001457022,0.000001507991,0.00002628799,0.000005075135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9110898,"threshold_uncertainty_score":0.5011044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080191567","doi":"10.1109/jcn.2014.000088","title":"HDRE: Coverage hole detection with residual energy in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":30,"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":"Computer science; Wireless sensor network; Residual; Energy (signal processing); Computer network; Key distribution in wireless sensor networks; Wireless; Quality of service; Real-time computing; Wireless network; Telecommunications; Algorithm; Statistics","authors":[{"name":"Yunzhou Zhang","is_ca":false},{"name":"Xiaohua Zhang","is_ca":false},{"name":"Wenyan Fu","is_ca":false},{"name":"Zeyu Wang","is_ca":true},{"name":"Honglei Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007946799263076766,"gpt":0.2114718371504416,"spread":0.2035250378873648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008856499,0.0001869863,0.0003453422,0.0002257862,0.000264149,0.000193579,0.001200097,0.0001626468,0.000001296531],"category_scores_gemma":[0.00001678382,0.000156233,0.00005592963,0.0007100697,0.0001573516,0.0004026596,0.0003340786,0.0006871046,3.342989e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005684277,"about_ca_system_score_gemma":0.00003657186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000477464,"about_ca_topic_score_gemma":0.0005367635,"domain_scores_codex":[0.9980916,0.0005432704,0.0005750913,0.0002068928,0.000259242,0.0003238637],"domain_scores_gemma":[0.9972734,0.0006822211,0.0005356665,0.001154994,0.0002150956,0.0001386639],"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.00005512788,0.0001161686,0.0009544477,0.000002659022,0.00003012211,0.00001062091,0.00009839272,0.843091,0.00007925243,0.01121699,0.0001080409,0.1442372],"study_design_scores_gemma":[0.0008126119,0.0003140949,0.002191187,0.0001498061,0.00001615185,0.0001633729,0.00002554221,0.9916109,0.00007459318,0.0001688028,0.004275614,0.0001973185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07118509,0.001919359,0.9253081,0.0006146298,0.0001942227,0.00005262209,2.144721e-7,0.00003295227,0.0006928028],"genre_scores_gemma":[0.9824435,0.005204819,0.01174102,0.0002925456,0.000245898,0.000005411086,0.00000250005,0.00001977685,0.00004455258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9135671,"threshold_uncertainty_score":0.6370996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139677063","doi":"10.23919/jcn.2020.000031","title":"5G NR mmWave indoor coverage with massive antenna system","year":2021,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Kyungpook National University","keywords":"Computer science; Relay; Architecture; Antenna (radio); Radio frequency; Computer network; Embedded system; Telecommunications; Power (physics)","authors":[{"name":"Syed Hassan Raza Naqvi","is_ca":true},{"name":"P.-H. Ho","is_ca":true},{"name":"Limei Peng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0148952902162222,"gpt":0.212042235727927,"spread":0.1971469455117048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820603,0.00007883489,0.0001721845,0.00005412169,0.0001072462,0.00007286288,0.0001557638,0.00004861841,0.00001367412],"category_scores_gemma":[0.000007093517,0.00006369426,0.00004235162,0.0001060143,0.00002843685,0.0001136164,0.00004197295,0.000319866,9.28435e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003541752,"about_ca_system_score_gemma":0.00002929637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.744373e-7,"about_ca_topic_score_gemma":0.000007885562,"domain_scores_codex":[0.9994099,0.00006293231,0.0002937346,0.00004619963,0.00009010811,0.00009719509],"domain_scores_gemma":[0.999132,0.00008735894,0.0001184987,0.0003470516,0.0002421027,0.00007294283],"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.0002429692,0.000360837,0.004755357,0.0006129395,0.002211321,0.0003248402,0.004299764,0.7253518,0.03109571,0.01196375,0.002677701,0.2161031],"study_design_scores_gemma":[0.0006813768,0.00007148228,0.0003802101,0.0005247815,0.00007678591,0.0004451594,0.000724718,0.9935049,0.0006198479,0.00008851137,0.002736958,0.0001452316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06302703,0.01677478,0.9157607,0.0003597447,0.0001492793,0.00007062362,0.000004340024,0.00003408983,0.003819423],"genre_scores_gemma":[0.9845784,0.009152477,0.006085312,0.00006357591,0.00007043972,0.000002464696,0.000004794292,0.0000147144,0.00002778067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215514,"threshold_uncertainty_score":0.2597377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786118779","doi":"10.1109/jcn.2017.000094","title":"Software defined multihop wireless networks: Promises and challenges","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":26,"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; Software-defined networking; Computer network; Wireless network; Distributed computing; Node (physics); Forwarding plane; Network topology; Wireless; Telecommunications","authors":[{"name":"Afsane Zahmatkesh","is_ca":true},{"name":"Thomas Kunz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05447947907822185,"gpt":0.2760178994619249,"spread":0.2215384203837031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570435,0.000180162,0.0003647666,0.00008051367,0.001112332,0.0005760618,0.00226765,0.0001412312,0.000001781595],"category_scores_gemma":[0.0001209581,0.000147399,0.00008470595,0.00008439879,0.0002940681,0.0007884009,0.001223345,0.0004836733,5.293293e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000156842,"about_ca_system_score_gemma":0.00004535566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001386882,"about_ca_topic_score_gemma":0.0000606051,"domain_scores_codex":[0.9987913,0.0001362692,0.0004514404,0.0001964246,0.0001598192,0.0002646952],"domain_scores_gemma":[0.9961289,0.0007404707,0.000775177,0.001915346,0.0002477217,0.0001924425],"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.00002971173,0.0001163672,0.008297195,0.00002067391,0.00009477838,0.00001156592,0.0003509188,0.001044077,0.000002264629,0.01638957,0.0008610433,0.9727818],"study_design_scores_gemma":[0.002315589,0.0005024425,0.1143042,0.0007845059,0.0001099085,0.0005254576,0.0001297404,0.8295614,0.00000436808,0.006923601,0.04423932,0.0005995092],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01698536,0.2843661,0.6819406,0.01509208,0.0006860149,0.0002737334,0.000001806147,0.0001079052,0.0005463207],"genre_scores_gemma":[0.7298307,0.2215996,0.04817556,0.0001384884,0.0002102891,0.000007877953,0.000001012611,0.00001329848,0.00002316703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721823,"threshold_uncertainty_score":0.8555275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085267507","doi":"10.1109/jcn.2014.000092","title":"Enhancing network service survivability in large-scale failure scenarios","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Optical Network Technologies","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":"Ontario Tech University","funders":"","keywords":"Survivability; Computer science; Probabilistic logic; Scale (ratio); Service (business); Network service; Service provider; Computer network; Telecommunications network; Computer security; Risk analysis (engineering); Reliability engineering; Distributed computing; Engineering","authors":[{"name":"Alireza Izaddoost","is_ca":true},{"name":"Shahram Shah Heydari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008043594305962977,"gpt":0.2295303546000209,"spread":0.221486760294058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009366262,0.0001202977,0.0002946723,0.00006252941,0.0001104167,0.00003068695,0.0005481526,0.0001502066,0.000006109833],"category_scores_gemma":[0.00005765089,0.0001105744,0.00004383074,0.0004708591,0.00006859735,0.0001869811,0.000223757,0.0008447372,0.000001204671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004478099,"about_ca_system_score_gemma":0.000008570059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002954876,"about_ca_topic_score_gemma":0.002269114,"domain_scores_codex":[0.9989476,0.000102261,0.0005021392,0.00007693703,0.00008704428,0.0002839709],"domain_scores_gemma":[0.998459,0.0005625695,0.0001123595,0.0006892403,0.000107937,0.00006888037],"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.00001233951,0.00005428936,0.01172916,0.00003085448,0.00002682205,9.375389e-7,0.0001960108,0.9633204,0.00007491276,0.001773628,0.0003377708,0.02244291],"study_design_scores_gemma":[0.0003842974,0.00004859292,0.007814701,0.0002335971,0.00001657255,0.0000180882,0.0002804498,0.9662702,0.000009766629,0.004612513,0.0201473,0.0001639238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2709672,0.01288004,0.7114486,0.002752443,0.0003148901,0.0002036272,0.000001602484,0.0002111253,0.001220473],"genre_scores_gemma":[0.8905469,0.00341747,0.1057806,0.0001005242,0.0001283896,0.000004424068,0.000002010241,0.00001685908,0.000002854055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6195797,"threshold_uncertainty_score":0.4509092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2328058829","doi":"10.1109/jcn.2016.000013","title":"Impact of trust-based security association and mobility on the delay metric in MANET","year":2016,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Metric (unit); Mobile ad hoc network; Computer network; Computer security; Association (psychology); Telecommunications; Business; Network packet","authors":[{"name":"Dang Quan Nguyen","is_ca":true},{"name":"Mylène Toulgoat","is_ca":true},{"name":"Louise Lamont","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01539669572079831,"gpt":0.2757027107149135,"spread":0.2603060149941152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221107,0.00007780275,0.0001945051,0.0001239235,0.00008343047,0.00004430464,0.0007769865,0.00007841006,0.000006998046],"category_scores_gemma":[0.0001460293,0.00004111117,0.00007423026,0.0004734703,0.0000750941,0.0002014719,0.0001763613,0.0003127395,2.40523e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371088,"about_ca_system_score_gemma":0.00005957653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002935931,"about_ca_topic_score_gemma":0.00005379823,"domain_scores_codex":[0.9987455,0.0004665319,0.0004049884,0.00008373737,0.0001687772,0.0001304466],"domain_scores_gemma":[0.9955999,0.002822215,0.0005641843,0.0007971801,0.0001599498,0.00005655854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001880695,0.001356669,0.5947182,0.00001439772,0.0002710299,0.000005322908,0.0009729784,0.01802836,0.00007562603,0.02732022,0.004333129,0.352716],"study_design_scores_gemma":[0.001017111,0.0006000033,0.4074297,0.0001614663,0.00002348875,0.00001574252,0.00001701901,0.5841264,0.00001543405,0.005624948,0.0008554169,0.0001132869],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9167925,0.005373666,0.07295799,0.004250876,0.0000750082,0.0002194826,0.00000387927,0.00000874893,0.0003178974],"genre_scores_gemma":[0.9950624,0.003619087,0.001199021,0.00008186825,0.00002499551,0.000004777065,3.37977e-7,0.000003279168,0.000004285168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.566098,"threshold_uncertainty_score":0.1676465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2280203714","doi":"10.1109/jcn.2007.6182854","title":"Performance and energy consumption analysis of 802.11 with FEC codes over wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Energy consumption; Forward error correction; Wireless sensor network; Computer network; Wireless; Telecommunications; Decoding methods; Electrical engineering","authors":[{"name":"Jong-Suk Ahn","is_ca":false},{"name":"Jong-Hyuk Yoon","is_ca":false},{"name":"Kang‐Woo Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01262164300752909,"gpt":0.242734154081111,"spread":0.2301125110735819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017489,0.0001750351,0.0004884088,0.0004230474,0.0002513663,0.00009127626,0.0007737555,0.0001356051,0.000003706857],"category_scores_gemma":[0.000005774356,0.0001403077,0.00009642867,0.001118177,0.0003687939,0.0003422893,0.0002880773,0.000332206,5.502989e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000319422,"about_ca_system_score_gemma":0.00002670013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003937225,"about_ca_topic_score_gemma":0.0004700929,"domain_scores_codex":[0.998439,0.000165579,0.0006717005,0.0001771779,0.0002705875,0.0002759759],"domain_scores_gemma":[0.996959,0.0007901395,0.0008395083,0.000920222,0.0003355003,0.0001556802],"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.00009430159,0.000154774,0.1816856,0.00001131378,0.0006323573,0.000007879075,0.0002503801,0.742844,0.00007380176,0.007627054,0.00007607962,0.06654251],"study_design_scores_gemma":[0.0003854269,0.0001495142,0.112162,0.0001332689,0.0002906121,0.00007380477,0.00003667369,0.8860477,0.0000328638,0.000003789645,0.0005384855,0.0001458796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5091172,0.003068349,0.4875054,0.0000664768,0.00005524775,0.00002378473,6.127567e-7,0.00001259705,0.000150309],"genre_scores_gemma":[0.9608811,0.01991287,0.01899769,0.0001016681,0.00006019435,0.000001358528,0.000005862689,0.00001134653,0.00002788546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4685077,"threshold_uncertainty_score":0.5721581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907758373","doi":"10.1109/jcn.2019.000005","title":"Coverage protocols for wireless sensor networks: Review and future directions","year":2019,"lang":"en","type":"preprint","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","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":"Carleton University; Fisheries and Oceans Canada","funders":"","keywords":"Computer science; Wireless sensor network; Software deployment; Computer network; Open research; Scheduling (production processes); Energy consumption; Distributed computing; Engineering","authors":[{"name":"Riham Elhabyan","is_ca":true},{"name":"Marc St‐Hilaire","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02424992602582755,"gpt":0.301829857882434,"spread":0.2775799318566065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001278418,0.0003861724,0.001038753,0.0001690261,0.0004262486,0.0004256258,0.002257172,0.0004505466,0.000003038304],"category_scores_gemma":[0.0000276052,0.0003356169,0.000292578,0.0003698458,0.0001560245,0.0002824545,0.001972268,0.001744799,3.957516e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007136447,"about_ca_system_score_gemma":0.0001514347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004869468,"about_ca_topic_score_gemma":0.00001182147,"domain_scores_codex":[0.9974496,0.0004634087,0.001079726,0.000402345,0.0002437794,0.0003611044],"domain_scores_gemma":[0.9939839,0.0009054469,0.00165704,0.002524656,0.0007248009,0.000204106],"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.00008152651,0.0005522128,0.0004944229,0.002237688,0.0007745663,0.00000959495,0.0003936382,0.4841899,0.000004844394,0.02110051,0.02086949,0.4692916],"study_design_scores_gemma":[0.0004790339,0.0001550349,0.000219838,0.003603447,0.000211308,0.0001529982,0.00001341117,0.6643589,7.289342e-7,0.000269468,0.3301927,0.0003431425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.000155417,0.2776707,0.7060266,0.008311695,0.0009673019,0.006451357,0.00001210294,0.0000605034,0.0003443763],"genre_scores_gemma":[0.02132477,0.9067163,0.06716494,0.001382941,0.001461557,0.001658071,0.00003703967,0.00006087127,0.0001934671],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.6388616,"threshold_uncertainty_score":0.9999096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964624053","doi":"10.1109/jcn.2009.6388407","title":"Build-in wiretap channel I with feedback and LDPC codes","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Computer science; Channel (broadcasting); Computer network; Randomness; Binary erasure channel; Information-theoretic security; Decoding methods; Theoretical computer science; Binary symmetric channel; Transmission (telecommunications); Parity bit; Computer security; Telecommunications; Algorithm; Channel capacity; Cryptography; Mathematics; Statistics","authors":[{"name":"Hong Wen","is_ca":true},{"name":"Guang Gong","is_ca":true},{"name":"Pin‐Han Ho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00975721931005988,"gpt":0.2339487165640312,"spread":0.2241914972539714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060307,0.00009277165,0.0002050744,0.0001192578,0.00007538603,0.0000494352,0.0004072847,0.00006744584,0.000001683352],"category_scores_gemma":[0.000005766686,0.00008004037,0.00002078468,0.0001769715,0.00009211146,0.0002004523,0.00006230388,0.0004460544,1.48432e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002209802,"about_ca_system_score_gemma":0.000009284204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005367292,"about_ca_topic_score_gemma":0.00006750265,"domain_scores_codex":[0.999419,0.00006068073,0.000296566,0.00004437121,0.00007212774,0.0001072967],"domain_scores_gemma":[0.9990887,0.0001289765,0.000103195,0.0005418112,0.0000759578,0.00006134739],"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.0003498003,0.001112274,0.02231929,0.0001537431,0.0005076366,0.00003733683,0.01273957,0.07991058,0.002413168,0.05611371,0.008669326,0.8156736],"study_design_scores_gemma":[0.00201402,0.000793964,0.1087399,0.001452591,0.00009011515,0.0006121612,0.0008036318,0.8520623,0.0003455041,0.008792167,0.0236187,0.0006749263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7390093,0.1656068,0.07414946,0.01033835,0.00007603427,0.0004666271,0.000004853621,0.000289114,0.01005955],"genre_scores_gemma":[0.9327145,0.05594068,0.01121929,0.00008508521,0.00002108361,0.00000302506,0.000001786626,0.00000990927,0.000004691157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8149986,"threshold_uncertainty_score":0.3263952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049091044","doi":"10.1109/jcn.2007.6182815","title":"Dual diversity over correlated Ricean fading channels","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Medical Research Council; University of Ottawa","keywords":"Fading; Computer science; Probability density function; Algorithm; Signal-to-noise ratio (imaging); Bit error rate; Maximal-ratio combining; Convergence (economics); Diversity combining; Statistics; Diversity scheme; Mathematics; Telecommunications; Decoding methods","authors":[{"name":"Petros S. Bithas","is_ca":false},{"name":"Nikos C. Sagias","is_ca":false},{"name":"P. Takis Mathiopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01756772059990494,"gpt":0.2598982957517262,"spread":0.2423305751518212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564222,0.00008588364,0.0001552767,0.0001363105,0.0002929491,0.00002277332,0.000495648,0.00008708413,0.000008309138],"category_scores_gemma":[0.00001317339,0.00008583453,0.00004855631,0.0002199592,0.00008399582,0.0002518967,0.0004432926,0.0005528301,6.106481e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006528433,"about_ca_system_score_gemma":0.00000493192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004621731,"about_ca_topic_score_gemma":0.0000108545,"domain_scores_codex":[0.9993467,0.00003879622,0.0003452548,0.00003884768,0.00009476788,0.0001356709],"domain_scores_gemma":[0.9988075,0.0002965166,0.0001695363,0.0005346021,0.0001102716,0.00008151436],"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.0001846404,0.0004922894,0.03447578,0.00007069251,0.0008900331,0.00005048513,0.00907981,0.3464986,0.003328739,0.02094887,0.01331275,0.5706673],"study_design_scores_gemma":[0.001623378,0.000248109,0.03808204,0.0005101059,0.0001636949,0.000347228,0.0008541688,0.8883932,0.0009311301,0.004697284,0.06340426,0.0007454518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1983821,0.01586735,0.7812032,0.0001993456,0.0003015554,0.0001198835,0.00000176053,0.0001996646,0.003725164],"genre_scores_gemma":[0.973269,0.01636015,0.01023505,0.00003899829,0.00005892801,6.917468e-7,0.000003112342,0.00001374609,0.00002029156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7748869,"threshold_uncertainty_score":0.3500231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2273990441","doi":"10.1109/jcn.2001.6596962","title":"SELFCON: An architecture for self-configuration of networks","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Agent-Based Network Management","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":"University of Waterloo","funders":"","keywords":"Configuration Management (ITSM); Computer science; Network management application; Network management station; Element management system; Provisioning; Distributed computing; Directory service; Structure of Management Information; Network management; Computer network; Network architecture; Directory; Operating system","authors":[{"name":"Raouf Boutaba","is_ca":true},{"name":"Samira El Omari","is_ca":true},{"name":"Ajay Pal Singh Virk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01842326331975024,"gpt":0.2650816353277214,"spread":0.2466583720079712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350264,0.0001203163,0.0002443269,0.0001308372,0.0001998496,0.0001057353,0.001409905,0.00007793576,0.00000526072],"category_scores_gemma":[0.00001033377,0.0001046416,0.0001004263,0.000352374,0.0000753377,0.0003887815,0.0002177683,0.0002730134,1.917769e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003241974,"about_ca_system_score_gemma":0.00004688094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003932679,"about_ca_topic_score_gemma":0.00002617016,"domain_scores_codex":[0.9987427,0.0002065445,0.0005771861,0.0001307585,0.0001516057,0.0001911807],"domain_scores_gemma":[0.997467,0.0003559737,0.0006332549,0.001143772,0.0002858031,0.000114236],"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.00007742905,0.0003555718,0.0006526101,0.00002149647,0.0001908255,0.000004909083,0.0006755869,0.3374933,0.00003512531,0.05505846,0.003287223,0.6021475],"study_design_scores_gemma":[0.0005876677,0.0005020925,0.0007556122,0.00006056908,0.00005679087,0.00006455791,0.0000463386,0.9296056,0.00001280227,0.002037864,0.06615021,0.0001198894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003469168,0.004251836,0.9896863,0.001660604,0.000172343,0.0002835422,5.369398e-7,0.00002892034,0.0004467114],"genre_scores_gemma":[0.8789788,0.006976516,0.1133993,0.0003461798,0.0002378631,0.00001885404,0.00000742878,0.0000104702,0.00002452995],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.876287,"threshold_uncertainty_score":0.4267162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","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 Victoria","funders":"","keywords":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","authors":[{"name":"Fulu Li","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Andrew Lippman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05751421122980483,"gpt":0.2881687901388061,"spread":0.2306545789090013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890815,0.0002049251,0.0004437178,0.0001783292,0.0006273963,0.0001671143,0.001491029,0.00009982893,0.00000325268],"category_scores_gemma":[0.00004525313,0.0001831594,0.00006338172,0.0006290984,0.0002886013,0.0005088869,0.001034406,0.0006254145,3.083893e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005259424,"about_ca_system_score_gemma":0.00008538205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002445713,"about_ca_topic_score_gemma":0.0001084908,"domain_scores_codex":[0.9978377,0.0006960342,0.0007891063,0.0002090447,0.0001737019,0.0002943894],"domain_scores_gemma":[0.9970809,0.0009444762,0.0004485796,0.0009817049,0.0003769559,0.000167407],"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.0001213752,0.001036788,0.01771807,0.00001816583,0.0003873808,0.0001941277,0.01071538,0.02858932,0.0003157935,0.2665061,0.004523051,0.6698745],"study_design_scores_gemma":[0.000735197,0.0001337972,0.004742329,0.0001586841,0.00001328455,0.0004736348,0.0001138842,0.9876091,0.000004395396,0.0002180804,0.005579403,0.0002182153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02581264,0.0298619,0.9407778,0.002713199,0.0002062955,0.0001305064,0.00000110498,0.00003259875,0.0004639053],"genre_scores_gemma":[0.8644776,0.1253514,0.00937402,0.0006392876,0.00009804095,0.00001008914,0.000004858028,0.00001220101,0.00003254608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9590198,"threshold_uncertainty_score":0.7469023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015629629","doi":"10.1109/jcn.2001.6596800","title":"Capacity improvement in cellular systems with reuse partitioning","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","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 British Columbia","funders":"","keywords":"Blocking (statistics); Computer science; Markov chain; Channel (broadcasting); Reuse; Channel capacity; Call blocking; Markov process; Product (mathematics); Algorithm; Mathematics; Telecommunications; Computer network; Statistics; Quality of service","authors":[{"name":"Peter Han Joo Chong","is_ca":true},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03840167273524295,"gpt":0.2655561828666617,"spread":0.2271545101314188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305835,0.0000898758,0.0001990367,0.0001695334,0.0002269302,0.0002390925,0.002592782,0.00005606497,0.000002251247],"category_scores_gemma":[0.00002632975,0.00007248938,0.0000313215,0.0006074999,0.0001259813,0.000536727,0.000787487,0.0006152373,7.862591e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007411274,"about_ca_system_score_gemma":0.00006009076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007099193,"about_ca_topic_score_gemma":0.0001117923,"domain_scores_codex":[0.9986108,0.0003374336,0.000493478,0.000101261,0.0002452818,0.0002117266],"domain_scores_gemma":[0.9967428,0.0003349671,0.0003448154,0.002178601,0.0002879405,0.0001108212],"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.0002342704,0.001921376,0.1123883,0.00007454328,0.0003670247,0.0001458129,0.005050288,0.438652,0.001450672,0.1801115,0.003334816,0.2562695],"study_design_scores_gemma":[0.0006581318,0.0002625502,0.004371165,0.0002848029,0.000007696167,0.0001486157,0.0001398823,0.9807335,0.00001985378,0.0006922082,0.01255085,0.0001307246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1987043,0.01537234,0.7758915,0.008274794,0.0001152627,0.0002798598,4.355718e-7,0.00003008206,0.001331387],"genre_scores_gemma":[0.9661724,0.01280347,0.02086359,0.00005677161,0.00004779304,0.00001746633,0.00000124803,0.000006933024,0.00003035598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.767468,"threshold_uncertainty_score":0.4818077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2284453291","doi":"10.1109/jcn.2005.6389819","title":"Interactive conflict detection and resolution for personalized features","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec en Outaouais; Institut national de psychiatrie légale Philippe-Pinel; University of Ottawa","funders":"","keywords":"Computer science; Telephony; Terminology; Feature (linguistics); Set (abstract data type); Voice over IP; User Friendly; Order (exchange); The Internet; Human–computer interaction; World Wide Web; Telecommunications; Programming language","authors":[{"name":"Daniel Amyot","is_ca":true},{"name":"Tom Gray","is_ca":true},{"name":"Ramiro Liscano","is_ca":true},{"name":"Luigi Logrippo","is_ca":true},{"name":"Jacques Sincennes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01487163193563447,"gpt":0.2788566731562638,"spread":0.2639850412206294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768328,0.00006445352,0.0001127813,0.0000862699,0.00024008,0.00009925941,0.000406694,0.00004527522,8.628298e-7],"category_scores_gemma":[0.000007118947,0.00005148991,0.00004382576,0.0001138653,0.00004832673,0.000376764,0.0001470079,0.0002167806,1.297055e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001542978,"about_ca_system_score_gemma":0.0000136773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001269785,"about_ca_topic_score_gemma":0.000175279,"domain_scores_codex":[0.9995046,0.00007919817,0.0001866109,0.00007478392,0.00006755575,0.00008724011],"domain_scores_gemma":[0.998937,0.0003382603,0.0002177754,0.0002790206,0.0001729408,0.00005500057],"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.0002780312,0.0001189514,0.0001483131,0.00002000306,0.0001509904,7.000186e-7,0.009990283,0.001327734,0.001274152,0.03505883,0.000516577,0.9511154],"study_design_scores_gemma":[0.001312938,0.0004075363,0.004539437,0.0001215974,0.00005636067,0.0003338645,0.0005904197,0.5568024,0.0002898871,0.001894934,0.4334989,0.0001517235],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02066739,0.02767782,0.9410784,0.009704504,0.0001696712,0.0001634345,0.000001393809,0.00002195272,0.0005154401],"genre_scores_gemma":[0.9494107,0.003943113,0.04570886,0.0007164088,0.0001777519,0.0000058964,0.000001301429,0.000003896037,0.00003208976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9509637,"threshold_uncertainty_score":0.2099698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105553752","doi":"10.1109/jcn.2008.6389854","title":"A family of concatenated network codes for improved performance with generations","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"","keywords":"Computer science; Linear network coding; Erasure; Decoding methods; Concatenated error correction code; Network packet; Erasure code; Coding (social sciences); Code rate; Algorithm; Theoretical computer science; Block code; Computer network; Mathematics; Statistics","authors":[{"name":"Jean-Pierre Thibault","is_ca":false},{"name":"Wai-Yip Chan","is_ca":true},{"name":"Shahram Yousefi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04821867966487738,"gpt":0.2678179520135813,"spread":0.2195992723487039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005346324,0.0001071595,0.0002786614,0.00007803231,0.0006253585,0.00004443806,0.001150382,0.00005051185,0.000001307893],"category_scores_gemma":[0.00001864008,0.00008222021,0.0000612209,0.0004480494,0.000234469,0.0003637479,0.0002539486,0.0002428274,1.320877e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001974056,"about_ca_system_score_gemma":0.0001301285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002060078,"about_ca_topic_score_gemma":0.00001980954,"domain_scores_codex":[0.9990142,0.0001372414,0.0005101847,0.00009128521,0.00008886466,0.0001582108],"domain_scores_gemma":[0.9973352,0.0004101847,0.0005143535,0.0008650423,0.0007996763,0.00007552172],"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.0007350549,0.001325816,0.02251283,0.00008708621,0.001341102,0.00000589603,0.005707315,0.1291903,0.01046382,0.2399636,0.02556783,0.5630994],"study_design_scores_gemma":[0.0009345632,0.0005630541,0.007739695,0.0001135029,0.00003006966,0.0001148974,0.00002717594,0.975354,0.0001004174,0.0001387591,0.01474648,0.0001373664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05267267,0.01475431,0.9299637,0.001776624,0.00009220515,0.0002545083,0.000002037235,0.00002234495,0.0004616092],"genre_scores_gemma":[0.8139329,0.05197776,0.1337393,0.0002193106,0.00006209756,0.00001514918,0.000005213506,0.000007108502,0.00004121051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8461637,"threshold_uncertainty_score":0.4809815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945709631","doi":"10.1109/jcn.2019.000021","title":"Error detection algorithm for Lempel-Ziv-77 compressed data","year":2019,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Parity bit; Algorithm; Checksum; Hamming code; Error detection and correction; Cyclic redundancy check; Bit error rate; Data compression; Redundancy (engineering); Decoding methods; Block code","authors":[{"name":"Beom Kwon","is_ca":false},{"name":"Sanghoon Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0480410243959005,"gpt":0.3115429713521448,"spread":0.2635019469562442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007040199,0.00009276431,0.0002023441,0.00007961236,0.0002407084,0.0001748272,0.00280187,0.00007347702,0.000005170891],"category_scores_gemma":[0.00001383854,0.00007491885,0.00004523874,0.0001584338,0.00004397421,0.001041534,0.001355797,0.0003086586,0.000002253544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439314,"about_ca_system_score_gemma":0.00003991601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001140453,"about_ca_topic_score_gemma":0.000009139552,"domain_scores_codex":[0.9990827,0.00009947636,0.0003708472,0.000158559,0.0001459436,0.0001424125],"domain_scores_gemma":[0.9967127,0.0004005202,0.0003798852,0.002230115,0.000194273,0.00008252607],"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.00001256019,0.00008857156,0.00006323167,0.000006143225,0.00003858003,6.390345e-7,0.00006637169,0.000506449,0.0001766092,0.0009676685,0.002760317,0.9953129],"study_design_scores_gemma":[0.0005222247,0.0001499898,0.0004155233,0.00004881712,0.00001544491,0.00004996911,0.00002892332,0.872525,0.00002432569,0.0005075153,0.12563,0.00008231024],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006586123,0.0043152,0.9936522,0.0006009746,0.000443374,0.0001703343,0.00001993397,0.00001846893,0.0001208629],"genre_scores_gemma":[0.393639,0.003246224,0.6024775,0.0002057989,0.0002556299,0.000006163455,0.0000708605,0.000013343,0.00008543557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9952306,"threshold_uncertainty_score":0.5206619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081975130","doi":"10.1109/jcn.2013.000068","title":"Low complexity zero-forcing beamforming for distributed massive MIMO systems in large public venues","year":2013,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":9,"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":"University of British Columbia","keywords":"Precoding; MIMO; Computer science; Beamforming; Algorithm; Computational complexity theory; Diagonal; Matrix decomposition; Matrix (chemical analysis); Control theory (sociology); Telecommunications; Topology (electrical circuits); Mathematics; Physics","authors":[{"name":"Haoming Li","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02730512272847006,"gpt":0.2539606991249963,"spread":0.2266555763965263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033029,0.00008444178,0.0002175208,0.00009781972,0.0001347742,0.00008609587,0.0002441793,0.00006737511,0.000001695056],"category_scores_gemma":[0.00003927514,0.00008147944,0.00003854186,0.0001652719,0.00003412714,0.0004724334,0.00005333413,0.0002286492,4.688123e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009095389,"about_ca_system_score_gemma":0.00001168621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027471,"about_ca_topic_score_gemma":0.00003163991,"domain_scores_codex":[0.9992156,0.00004619276,0.0004580994,0.00004547409,0.00005198616,0.0001826271],"domain_scores_gemma":[0.9990435,0.0001839769,0.000226455,0.0002824529,0.0002011812,0.00006246431],"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.000005407719,0.00004690273,0.001506882,0.0001050046,0.00004120602,5.320461e-7,0.0002650701,0.9892176,0.0001497223,0.003055498,0.0007971167,0.004809002],"study_design_scores_gemma":[0.0004822559,0.00002586752,0.0006131203,0.0002929944,0.000009724497,0.0000146693,0.0003426094,0.994653,0.000007286741,0.0005177258,0.002954252,0.00008644719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01188618,0.007621362,0.9797122,0.0001808269,0.0001828491,0.0003116054,0.00002051072,0.00002267747,0.00006180412],"genre_scores_gemma":[0.9842468,0.001448374,0.01410565,0.000008283958,0.00007190509,0.00004476593,0.00005280121,0.00001699622,0.000004452025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9723606,"threshold_uncertainty_score":0.3322635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313886758","doi":"10.23919/jcn.2022.000054","title":"Slicing-based resource optimization in multi-access edge network using ensemble learning aided DDPG algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Mobile edge computing; Wireless network; Distributed computing; Virtual network; Resource allocation; Wireless; Edge computing; Computer network; Server; Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence","authors":[{"name":"Yu Gong","is_ca":false},{"name":"Yifei Wei","is_ca":false},{"name":"F. Richard Yu","is_ca":true},{"name":"Zhu Han","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07294231477596194,"gpt":0.31744040555547,"spread":0.2444980907795081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207501,0.00009680008,0.0002034261,0.0002484728,0.0003953261,0.0002615486,0.0009946097,0.00006946694,0.000001014505],"category_scores_gemma":[0.0000416009,0.00009412627,0.0000659471,0.0009961794,0.00004235752,0.0004175777,0.0004557374,0.0005510601,4.921581e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524645,"about_ca_system_score_gemma":0.00006032084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006185498,"about_ca_topic_score_gemma":0.00003067412,"domain_scores_codex":[0.9987339,0.0003642811,0.0004282114,0.0001168607,0.0001409636,0.0002158243],"domain_scores_gemma":[0.9985106,0.0004345284,0.0003514951,0.0004964434,0.0001351584,0.00007176853],"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.000008198445,0.00002958676,0.001887876,0.00000237683,0.00001051313,0.000006692811,0.0001296041,0.9625944,0.00001771613,0.00006534226,0.0001909603,0.03505677],"study_design_scores_gemma":[0.000534345,0.00004550776,0.001277092,0.0002197558,0.00001127921,0.00002368856,0.00006580645,0.9965685,0.000002343187,0.00004787075,0.001105242,0.00009857227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0109118,0.002455983,0.9856687,0.0006390153,0.0001405249,0.00006683441,2.040443e-7,0.00004818189,0.00006880198],"genre_scores_gemma":[0.8573427,0.001921447,0.1402747,0.0002656752,0.0001287006,0.000003087242,0.00000701821,0.00001397542,0.00004270832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8464309,"threshold_uncertainty_score":0.3838358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774231546","doi":"10.1109/jcn.2017.000082","title":"Risk-adaptive strategic network protection in disaster scenarios","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer security; Risk analysis (engineering); Computer network","authors":[{"name":"Alireza Izaddoost","is_ca":false},{"name":"Shahram Shah Heydari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04411965910938542,"gpt":0.300355317562984,"spread":0.2562356584535986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727381,0.0001078031,0.0002549164,0.00006581714,0.0006122073,0.0001919129,0.000659022,0.00004514851,0.00002725475],"category_scores_gemma":[0.000005089133,0.00009220618,0.0001058004,0.0001046417,0.0001417779,0.0002607806,0.0002572444,0.0006630985,7.335967e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002210654,"about_ca_system_score_gemma":0.00002772833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002801234,"about_ca_topic_score_gemma":0.0003358338,"domain_scores_codex":[0.9990488,0.0001985097,0.0004163678,0.0000867331,0.00008610701,0.0001634262],"domain_scores_gemma":[0.9978082,0.00009293864,0.001012434,0.000909212,0.0001187801,0.00005842855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002139392,0.0005438264,0.5214112,0.000005451699,0.0005441763,0.000004070547,0.0006093914,0.0656971,0.00002652977,0.05072222,0.001336827,0.3588853],"study_design_scores_gemma":[0.001011252,0.0002552704,0.09551509,0.0003748774,0.000195386,0.00001122818,0.0006495863,0.7838357,0.000004934829,0.1136053,0.004222147,0.0003192078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5392663,0.005617101,0.429033,0.001684151,0.0002692676,0.0007663513,0.00000697424,0.00003306393,0.02332368],"genre_scores_gemma":[0.9943165,0.0008109225,0.004370078,0.00001074865,0.0004341583,0.00001356111,0.0000022726,0.000009716494,0.00003201979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7181386,"threshold_uncertainty_score":0.4708666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036170814","doi":"10.1109/jcn.2003.6596557","title":"Approaching near-capacity on a multi-antenna channel using successive decoding and interference cancellation receivers","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Computer science; Transmitter; Decoding methods; Rayleigh fading; Minimum mean square error; Channel (broadcasting); Antenna (radio); Single antenna interference cancellation; 3G MIMO; Multi-user MIMO; Channel capacity; Interference (communication); Fading; Precoding; Telecommunications; Algorithm; Electronic engineering; Mathematics; Statistics; Engineering","authors":[{"name":"Mathini Sellathurai","is_ca":true},{"name":"Paul Guinand","is_ca":true},{"name":"J. Lodge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06800085096254285,"gpt":0.2890891873091119,"spread":0.2210883363465691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562529,0.0001084734,0.0001784546,0.00009513282,0.000293062,0.00006624978,0.0002781287,0.00006835265,0.00000151158],"category_scores_gemma":[0.00005825117,0.0001055612,0.00003020161,0.0001417214,0.0001211318,0.000282222,0.00006818146,0.0005348043,9.282553e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008801953,"about_ca_system_score_gemma":0.00001378706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001084624,"about_ca_topic_score_gemma":0.00002619987,"domain_scores_codex":[0.9993031,0.0001425317,0.0003124356,0.00006594951,0.00006003845,0.0001159376],"domain_scores_gemma":[0.9989219,0.0002710212,0.0002296249,0.0004089091,0.0001036832,0.00006481653],"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.00007639129,0.0002314657,0.005423687,0.0001100432,0.0002775833,0.000003377019,0.007274901,0.8131642,0.007435259,0.01137405,0.0001024399,0.1545267],"study_design_scores_gemma":[0.0002218248,0.00003457569,0.0002660362,0.0002984069,0.00001640168,0.00002583181,0.00026905,0.9978127,0.0002159877,0.0003656893,0.0003619665,0.0001115174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1169813,0.005351168,0.8769408,0.00006193681,0.00007527727,0.00009793427,0.000001235147,0.00004025047,0.0004501727],"genre_scores_gemma":[0.8807753,0.01355718,0.1056125,0.0000212547,0.00001174932,0.000003435117,0.000001030435,0.00001419889,0.000003283136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7713283,"threshold_uncertainty_score":0.4304661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038489696","doi":"10.1109/jcn.2014.000091","title":"Composite differential evolution aided channel allocation in OFDMA systems with proportional rate constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"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; Telecommunications link; Differential evolution; Orthogonal frequency-division multiple access; Code (set theory); Mathematical optimization; Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Set (abstract data type); Telecommunications; Mathematics","authors":[{"name":"Nitin Sharma","is_ca":false},{"name":"Alagan Anpalagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007230176125641113,"gpt":0.2043708895328796,"spread":0.1971407134072385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839432,0.0001022348,0.0001994539,0.0001216958,0.00008987663,0.00003869518,0.0001685926,0.0000672341,0.000002715888],"category_scores_gemma":[0.000007118887,0.00008867953,0.00002181079,0.0001893257,0.0001132858,0.0002287865,0.00002804564,0.0002489777,2.310207e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007118113,"about_ca_system_score_gemma":0.00001705405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003524042,"about_ca_topic_score_gemma":0.00002674149,"domain_scores_codex":[0.9991573,0.0001298957,0.0004271826,0.00006111727,0.0001012074,0.0001232603],"domain_scores_gemma":[0.9991954,0.0001146533,0.0002442331,0.0002206181,0.0001701382,0.00005498497],"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.00002912005,0.00003542848,0.001497689,0.00001571912,0.00003235896,4.100388e-7,0.00005001634,0.9919229,0.0002356373,0.002065648,0.0000390962,0.004076046],"study_design_scores_gemma":[0.0006398311,0.00005362031,0.0114322,0.0003176848,0.00002454275,0.00003661952,0.00004426531,0.9870563,0.00001042353,0.0001860293,0.0001012249,0.00009730877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08270854,0.002238254,0.9144178,0.00015492,0.000155605,0.0001494139,0.000001488626,0.00002632031,0.0001476379],"genre_scores_gemma":[0.994113,0.002824075,0.002866595,0.000009002051,0.0001234762,0.0000168665,0.00002422828,0.00001659917,0.000006210711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9115512,"threshold_uncertainty_score":0.3616246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313887358","doi":"10.23919/jcn.2022.000051","title":"HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Heuristic; Clique; Network topology; Algorithm; Theoretical computer science; Genetic algorithm; Computer network; Mathematics; Artificial intelligence","authors":[{"name":"Saber Gholami","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.051666683221327,"gpt":0.2925630287049558,"spread":0.2408963454836288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060321,0.0000655944,0.0001321525,0.0001292688,0.0003359829,0.0001257225,0.0007336831,0.00003578986,4.347832e-7],"category_scores_gemma":[0.00003129917,0.00006200914,0.00007402109,0.0003025856,0.00004558637,0.0001814279,0.0003212737,0.0001946105,5.329956e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002593839,"about_ca_system_score_gemma":0.00005233807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001879335,"about_ca_topic_score_gemma":0.000002705591,"domain_scores_codex":[0.9993502,0.000079593,0.0002549501,0.00007836398,0.00009304858,0.0001438682],"domain_scores_gemma":[0.9986769,0.0004397736,0.0002130868,0.0004243456,0.0001782439,0.00006763907],"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.00001899208,0.00008636394,0.0005534315,0.0000226188,0.0001030869,0.00004022673,0.0008797699,0.05608859,0.0002271371,0.003398016,0.002084571,0.9364972],"study_design_scores_gemma":[0.0002780364,0.00007212628,0.0008463758,0.00008676365,0.00002639632,0.0001505921,0.00009201874,0.995994,9.661273e-7,0.0006240944,0.001760321,0.00006834899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02176051,0.00380769,0.97353,0.0005405172,0.0002243483,0.00005937687,0.000001652206,0.00002941687,0.00004648915],"genre_scores_gemma":[0.8192228,0.002586135,0.1778585,0.00008363353,0.000171479,0.000001608959,0.000001907793,0.000008268633,0.00006567495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9399053,"threshold_uncertainty_score":0.2584143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070943779","doi":"10.1109/jcn.2014.000009","title":"An opportunistic channel access scheme for interweave cognitive radio systems","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"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; Cognitive radio; Channel (broadcasting); Idle; Throughput; Computer network; Cognition; Scheme (mathematics); Telecommunications; Wireless; Mathematics","authors":[{"name":"S. Senthuran","is_ca":true},{"name":"Alagan Anpalagan","is_ca":true},{"name":"Hyung Yun Kong","is_ca":false},{"name":"Ashok Karmokar","is_ca":true},{"name":"Olivia Das","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05070808993274047,"gpt":0.3213247911527626,"spread":0.2706167012200222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063247,0.0001252852,0.0003009675,0.0001311538,0.0003427105,0.0005543686,0.00122567,0.00006810666,8.726931e-7],"category_scores_gemma":[0.00006760971,0.00010914,0.00008338915,0.0001939268,0.0001087808,0.0006890202,0.0002460245,0.0002988971,2.46407e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002565562,"about_ca_system_score_gemma":0.00004834287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006791448,"about_ca_topic_score_gemma":0.00001229392,"domain_scores_codex":[0.9988356,0.000248463,0.0004430738,0.0001451789,0.0001192402,0.000208492],"domain_scores_gemma":[0.9972618,0.0009744335,0.0004736854,0.0005904266,0.0005121912,0.0001874867],"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.0002233788,0.00064551,0.0007845297,0.00007193637,0.0005313878,0.000029053,0.00143749,0.004888116,0.0001657878,0.2145473,0.001920977,0.7747546],"study_design_scores_gemma":[0.0005556868,0.0004112557,0.000433416,0.0002906639,0.00004029928,0.0002963151,0.000123792,0.9925326,0.000003881994,0.002030119,0.003144736,0.0001373066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00303075,0.003027675,0.9920455,0.0008192993,0.0003534691,0.0001775394,0.000003263686,0.00002092759,0.0005215837],"genre_scores_gemma":[0.9874303,0.002154177,0.009687719,0.0002297174,0.0004533825,0.000007780584,0.000009992271,0.00001212421,0.00001477798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9876444,"threshold_uncertainty_score":0.5345789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032301438","doi":"10.1109/jcn.2014.000008","title":"Robust relay design for two-way multi-antenna relay systems with imperfect CSI","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"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":"Relay; Computer science; Robustness (evolution); Relay channel; Mathematical optimization; Channel state information; Semidefinite programming; Upper and lower bounds; Optimization problem; Beamforming; Convex optimization; Transmitter power output; Control theory (sociology); Channel (broadcasting); Algorithm; Wireless; Telecommunications; Power (physics); Regular polygon; Mathematics; Transmitter","authors":[{"name":"Chenyuan Wang","is_ca":false},{"name":"Xiaodai Dong","is_ca":true},{"name":"Yi Shi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08228219557442572,"gpt":0.2903345700520073,"spread":0.2080523744775816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002613395,0.0001772795,0.0003607766,0.0001393976,0.0007032723,0.0003262126,0.002018256,0.00007726977,0.000001598372],"category_scores_gemma":[0.00009963157,0.0001301609,0.00009345407,0.0003913486,0.0001371047,0.0004803049,0.0004169276,0.0005212304,0.000001163406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004703275,"about_ca_system_score_gemma":0.00006907239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004289531,"about_ca_topic_score_gemma":0.00003222208,"domain_scores_codex":[0.9979655,0.0008698471,0.0005920089,0.0001709745,0.0001576596,0.0002439966],"domain_scores_gemma":[0.9952081,0.001672772,0.000591781,0.001679561,0.000694004,0.0001537682],"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.000252678,0.0006331365,0.001716521,0.0000462077,0.0004816511,0.000005207854,0.002298414,0.6538215,0.0009356781,0.1482795,0.00664337,0.1848861],"study_design_scores_gemma":[0.001307192,0.0004775928,0.0003571393,0.0002631205,0.0000389456,0.000128381,0.00005268497,0.9842055,0.00001031066,0.00004429169,0.01293853,0.000176347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008246277,0.01304595,0.9837976,0.001544237,0.0002299432,0.0003210002,5.981203e-7,0.00003654326,0.0001995795],"genre_scores_gemma":[0.7219841,0.008886623,0.2687085,0.0001646194,0.0001064389,0.00003190344,0.000002178474,0.00001595174,0.00009960785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7211596,"threshold_uncertainty_score":0.5409073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091421129","doi":"10.1109/jcn.2005.6389815","title":"Performance of convolutionally-coded MIMO systems with antenna selection","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Space–time block code; Computer science; Fading; Coding gain; Algorithm; MIMO; Diversity gain; Antenna diversity; Convolutional code; Block code; Coding (social sciences); Diversity combining; Telecommunications; Antenna (radio); Electronic engineering; Channel (broadcasting); Statistics; Decoding methods; Mathematics; Engineering","authors":[{"name":"Walaa Hamouda","is_ca":true},{"name":"Ali Ghrayeb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0100264706348921,"gpt":0.2258442583731344,"spread":0.2158177877382423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000224778,0.00007597292,0.0001787988,0.00009754516,0.00008908274,0.00001317253,0.0003528395,0.00005155423,0.000002575762],"category_scores_gemma":[0.000004537768,0.0000645199,0.00002593772,0.0001852067,0.0001018604,0.0002743316,0.00004321885,0.0002969104,2.79649e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005187469,"about_ca_system_score_gemma":0.00001812772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002693567,"about_ca_topic_score_gemma":0.00001287542,"domain_scores_codex":[0.9993482,0.00004607526,0.0003942067,0.00003345676,0.0000944401,0.00008362435],"domain_scores_gemma":[0.998926,0.0001113056,0.0002417658,0.0003955988,0.0002870151,0.00003828902],"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.00009760648,0.0001465328,0.01070974,0.00008825761,0.0002045356,2.568716e-7,0.000292728,0.9339467,0.00542353,0.004067357,0.0006108315,0.04441188],"study_design_scores_gemma":[0.0002320518,0.0001222323,0.002424417,0.0002356051,0.00002058836,0.00008778575,0.0000492329,0.9903774,0.0003385614,0.0000171158,0.006016538,0.00007850302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4030497,0.04301891,0.5512332,0.0004231246,0.00007329132,0.0002408453,0.000003525869,0.0001460222,0.001811289],"genre_scores_gemma":[0.931519,0.03229265,0.03609322,0.00001001703,0.0000421207,0.00000763922,0.000002716975,0.00001268001,0.00001998659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5284692,"threshold_uncertainty_score":0.2631045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010444331","doi":"10.1109/jcn.2014.000094","title":"Power allocation framework for OFDMA-based decode-and-forward cellular relay networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"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; Relay; Telecommunications link; Orthogonal frequency-division multiple access; Cellular network; Computer network; Power (physics); Resource allocation; Base station; Knapsack problem; Scheme (mathematics); Mathematical optimization; Orthogonal frequency-division multiplexing; Algorithm; Mathematics","authors":[{"name":"Yalda Farazmand","is_ca":true},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0236229432684266,"gpt":0.2850686972271793,"spread":0.2614457539587527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732339,0.0001706123,0.0003173655,0.0001401848,0.0006158922,0.0002512752,0.001590135,0.0001636152,0.000009017434],"category_scores_gemma":[0.000168553,0.0001514881,0.0001202241,0.0003664216,0.0001492786,0.0003529948,0.0003681746,0.0006000855,6.041387e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003217228,"about_ca_system_score_gemma":0.00005587846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001059555,"about_ca_topic_score_gemma":0.000009307239,"domain_scores_codex":[0.9984033,0.0004172523,0.0006183477,0.0001787843,0.0001508792,0.0002314272],"domain_scores_gemma":[0.9954251,0.001899882,0.0005654084,0.001422405,0.0005138859,0.0001733173],"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.00005352055,0.0002066257,0.001367708,0.00001654665,0.0001164151,5.216888e-7,0.0006577192,0.03738908,0.0001112085,0.6386412,0.001954944,0.3194845],"study_design_scores_gemma":[0.0004942511,0.0002108452,0.0008225383,0.0001955089,0.00003017557,0.000009071632,0.00002626794,0.9383979,0.00002772671,0.003785906,0.05582705,0.000172735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001962748,0.01715146,0.9708945,0.009299691,0.0002403977,0.0001873894,6.458682e-7,0.00003282332,0.0002304057],"genre_scores_gemma":[0.7812031,0.01374311,0.2038088,0.001055378,0.000117521,0.00002500955,0.00000424686,0.00001431617,0.00002855222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9010088,"threshold_uncertainty_score":0.6177506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013592174","doi":"10.1109/jcn.2008.6388356","title":"Delay-margin based traffic engineering for MPLS-DiffServ networks","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Quality of service; Computer network; Traffic engineering; Heuristic; Margin (machine learning); Distributed computing","authors":[{"name":"Mohamed Ashour","is_ca":false},{"name":"Tho Le‐Ngoc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01899451083958551,"gpt":0.2289055349453513,"spread":0.2099110241057658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002081082,0.0001582928,0.0002880454,0.0001173635,0.0001835197,0.00002234424,0.0005208993,0.0001655141,0.000003033374],"category_scores_gemma":[0.00004308608,0.0001478696,0.0001114467,0.0002629648,0.0001186426,0.0001553545,0.00007052616,0.0005911183,3.243495e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004579833,"about_ca_system_score_gemma":0.00001355343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.345666e-7,"about_ca_topic_score_gemma":0.000003319137,"domain_scores_codex":[0.9991025,0.0000184009,0.00045416,0.00007421959,0.00008356688,0.0002671119],"domain_scores_gemma":[0.9984732,0.0006883835,0.0001094344,0.000521858,0.0001120296,0.00009510051],"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.00001380704,0.0000239342,0.00007415476,0.000009733287,0.00003962202,0.000003400401,0.00001669455,0.9776245,0.00001462849,0.0005696326,0.0009531262,0.02065671],"study_design_scores_gemma":[0.0004499084,0.00009196541,0.0003357102,0.00008499272,0.00002983317,0.00009264013,0.00001812023,0.9791729,0.000005104424,0.00008266124,0.01948491,0.0001512509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04413516,0.02476332,0.9300733,0.0003770312,0.0002103032,0.0001627317,0.000002058356,0.0002026898,0.00007338106],"genre_scores_gemma":[0.8114139,0.01460791,0.1737317,0.00004342291,0.0001386712,0.00001900609,0.00000582501,0.00003349724,0.000006097402],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7672787,"threshold_uncertainty_score":0.6029946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2286495892","doi":"10.1109/jcn.2011.6157479","title":"Recent advances in filter topologies and realizations for satellite communications","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Microwave Engineering and Waveguides","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network topology; Communications satellite; Implementation; Electronic engineering; Filter (signal processing); Microwave transmission; Waveguide filter; Modular design; Transfer function; Microwave; Satellite; Telecommunications; Topology (electrical circuits); Filter design; Electrical engineering; Prototype filter; Computer network; Aerospace engineering; Engineering","authors":[{"name":"Mohamed M. Fahmi","is_ca":true},{"name":"Jorge A. Ruiz‐Cruz","is_ca":false},{"name":"R.R. Mansour","is_ca":true},{"name":"K.A. Zaki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04621030248702551,"gpt":0.2730182243535175,"spread":0.226807921866492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395438,0.00006532773,0.0001299216,0.00008783656,0.0000782538,0.00001705454,0.0002851254,0.00004777815,0.000003268842],"category_scores_gemma":[0.00002855182,0.00005950054,0.00002185997,0.0001047032,0.00009731226,0.0001500236,0.0000743991,0.000167713,1.051115e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000143477,"about_ca_system_score_gemma":0.00000615211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000212703,"about_ca_topic_score_gemma":0.00008101838,"domain_scores_codex":[0.9995254,0.00003179376,0.0002921701,0.00003617542,0.0000238662,0.00009060508],"domain_scores_gemma":[0.9991785,0.0002168579,0.00006180287,0.0004304973,0.00007500876,0.0000373089],"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.00002526666,0.000102811,0.004703361,0.00006556926,0.00007884589,8.10974e-7,0.003153012,0.009202869,0.0001159945,0.02542838,0.0008938045,0.9562293],"study_design_scores_gemma":[0.0004246001,0.00009643476,0.006742457,0.0001927536,0.00003663975,0.00004290801,0.0004696495,0.1412743,0.00004601908,0.005315896,0.8451848,0.0001735216],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.004440599,0.8749537,0.1133194,0.0007534425,0.0001720845,0.0001827755,0.00000903312,0.00004892449,0.006119923],"genre_scores_gemma":[0.4139646,0.5604834,0.02549642,0.00001538641,0.00001353908,0.000007012294,0.000004632268,0.000006721546,0.00000832511],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9560558,"threshold_uncertainty_score":0.2426362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972245690","doi":"10.1109/jcn.2000.6596716","title":"On higher layer protocol performance in CDMA S-ALOHA networks with packet combining in Rayleigh fading channels","year":2000,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"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; Computer network; Physical layer; Aloha; Media access control; Retransmission; Rayleigh fading; Data link layer; Protocol stack; Network packet; Fading; Network layer; Throughput; Link layer; Channel (broadcasting); Wireless; Layer (electronics); Wireless sensor network; Telecommunications","authors":[{"name":"Ekram Hossain","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03814669962710386,"gpt":0.308141098815762,"spread":0.2699943991886581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001628498,0.0001995654,0.0003789729,0.0003518108,0.0002791739,0.0002540628,0.002650298,0.0001392208,0.00004381264],"category_scores_gemma":[0.00001062479,0.0001610387,0.00004957844,0.001278951,0.0001649659,0.0007857394,0.0004502751,0.001623352,0.000003190185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074459,"about_ca_system_score_gemma":0.00007967489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145369,"about_ca_topic_score_gemma":0.00005604094,"domain_scores_codex":[0.9976332,0.0006282159,0.0007554642,0.0002022605,0.0003407119,0.0004401084],"domain_scores_gemma":[0.9969102,0.0008046046,0.0003302603,0.001655474,0.0001585451,0.0001409807],"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.0003079899,0.0004544487,0.01491402,0.00001440954,0.00003214207,0.00001798865,0.0006721008,0.8156056,0.000003169989,0.007777861,0.0004300373,0.1597702],"study_design_scores_gemma":[0.002104374,0.0004868357,0.02502378,0.00094202,0.000003445548,0.00005140547,0.0000238519,0.9612921,0.00000464575,0.0003721326,0.009482183,0.000213175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7101618,0.008728013,0.159203,0.02428683,0.0006887215,0.04698696,0.000002288268,0.0002978646,0.04964454],"genre_scores_gemma":[0.9889302,0.002845833,0.005797264,0.000239237,0.00007448889,0.001960739,0.000001827539,0.00002081371,0.0001295797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2787684,"threshold_uncertainty_score":0.7052749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027478935","doi":"10.1109/jcn.2005.6387857","title":"Towards the next generation mobile communications","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Interoperation; Computer science; Software deployment; Mobile telephony; Telecommunications; Communications system; Mobile computing; Computer network; Distributed computing; Mobile radio; Interoperability; World Wide Web","authors":[{"name":"Davide Grillo","is_ca":false},{"name":"Yong–Hwan Lee","is_ca":false},{"name":"Edward Tiedemann","is_ca":false},{"name":"John Visser","is_ca":true},{"name":"Bernhard Walke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1411461511776464,"gpt":0.3474151161976295,"spread":0.2062689650199831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001909304,0.0001267544,0.0002072536,0.0001365821,0.0009902307,0.0005319872,0.008270875,0.00008925426,0.00001141413],"category_scores_gemma":[0.0000495379,0.00009059355,0.0001055387,0.000629719,0.0004227456,0.001099209,0.002663746,0.0009415961,0.00000716967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007506307,"about_ca_system_score_gemma":0.0001498131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000135383,"about_ca_topic_score_gemma":0.0001077802,"domain_scores_codex":[0.9978533,0.0008117963,0.0006762863,0.0001158972,0.000319499,0.0002232637],"domain_scores_gemma":[0.9927723,0.0008066516,0.000473677,0.005235625,0.0005817603,0.0001299506],"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.000004675277,0.0001902277,0.00009543217,0.000001932387,0.00005746325,3.774495e-7,0.0009546123,0.008525954,0.0002011097,0.08557291,0.006786628,0.8976087],"study_design_scores_gemma":[0.0001858955,0.00006488292,0.0003008408,0.00002183723,0.00001139943,0.00007102909,0.00008991054,0.7324108,0.00001920238,0.0004112465,0.2663326,0.00008034254],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005819078,0.1435819,0.7267783,0.1176101,0.0002359025,0.0005295504,0.000001713028,0.00007539029,0.005367937],"genre_scores_gemma":[0.8085011,0.0823307,0.1081891,0.0005883379,0.0002603242,0.00004437344,0.000005350791,0.00001007139,0.00007064141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8975284,"threshold_uncertainty_score":0.9970949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2601455897","doi":"10.1109/jcn.2017.000007","title":"Competition-based distributed BS power activation and user scheduling algorithm","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Scheduling (production processes); Base station; Computer network; Throughput; Distributed computing; Cellular network; Enhanced Data Rates for GSM Evolution; Maximum throughput scheduling; Algorithm; Fair-share scheduling; Quality of service; Round-robin scheduling; Telecommunications; Mathematical optimization; Wireless","authors":[{"name":"Chang-Sik Lee","is_ca":false},{"name":"Jihwan Kim","is_ca":false},{"name":"Jeongho Kwak","is_ca":true},{"name":"Eunkyung Kim","is_ca":false},{"name":"Song Chong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0120571798361943,"gpt":0.2514851949822896,"spread":0.2394280151460953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001740217,0.0000699001,0.0001283994,0.0000477131,0.0003532707,0.0001149063,0.0002075202,0.00005795964,0.000003976981],"category_scores_gemma":[0.00003224273,0.00006751904,0.00002267794,0.00004113674,0.00007125809,0.0003726509,0.00004563986,0.0002127248,2.229839e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002905162,"about_ca_system_score_gemma":0.00001030276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002765358,"about_ca_topic_score_gemma":0.000004168664,"domain_scores_codex":[0.999569,0.00002847543,0.0002365689,0.00004028339,0.00005181961,0.00007388052],"domain_scores_gemma":[0.9990177,0.0001169631,0.0002362853,0.0004315445,0.0001463563,0.00005113728],"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.00001248976,0.0000395514,0.00235474,0.00001860621,0.00007064423,0.000001112327,0.00008482982,0.9710077,0.0003362215,0.001535073,0.0001703509,0.02436869],"study_design_scores_gemma":[0.000449871,0.00002456471,0.004395199,0.0001959034,0.00001637427,0.0000122838,0.000059493,0.9916351,0.00006520245,0.0001148533,0.00294962,0.00008155417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005985105,0.001543976,0.9917174,0.0003813384,0.00009650532,0.00006232405,0.00000527922,0.00001937019,0.0001886782],"genre_scores_gemma":[0.9096658,0.001526082,0.08870495,0.00001653294,0.00005094866,0.00000269651,0.00001739758,0.0000113536,0.000004203481],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9036807,"threshold_uncertainty_score":0.2753346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392392437","doi":"10.23919/jcn.2024.000001","title":"Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation","year":2024,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"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":"","keywords":"Nakagami distribution; Fading; Computer science; Statistical analysis; Algorithm; Fading distribution; Telecommunications; Correlation; Statistics; Mathematics; Channel (broadcasting); Rayleigh fading","authors":[{"name":"Ibrahim Ghareeb","is_ca":false},{"name":"Osama Al-Shalali","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01494058463600054,"gpt":0.2781283553238455,"spread":0.2631877706878449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002753946,0.00008626814,0.0002785965,0.0003667979,0.00006256111,0.00003961962,0.0002949738,0.00006105304,0.00001224054],"category_scores_gemma":[0.000009270541,0.00007153858,0.00006199773,0.0007326938,0.0001002732,0.0001905418,0.00005660384,0.0003518071,1.905727e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004303617,"about_ca_system_score_gemma":0.00001510806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005199682,"about_ca_topic_score_gemma":0.00001427952,"domain_scores_codex":[0.9992428,0.00007790066,0.0004388021,0.00005047164,0.0001054383,0.00008463121],"domain_scores_gemma":[0.9987521,0.0004692583,0.0001302936,0.0004742084,0.0001249718,0.00004914305],"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.00001956779,0.00002695862,0.0006495095,0.00003122699,0.001140589,0.000003021545,0.0006242155,0.9288135,0.0003854636,0.02023959,0.0003152033,0.04775121],"study_design_scores_gemma":[0.0001117646,0.00004924496,0.001093698,0.0001504307,0.0004587267,0.00002132005,0.00005237334,0.9949045,0.00009621901,0.0005104632,0.00247102,0.00008021809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0264215,0.01956829,0.9533762,0.0001274731,0.00005582243,0.00006364323,0.000007510689,0.00007048255,0.0003090463],"genre_scores_gemma":[0.9254577,0.01889875,0.05555379,0.000009269385,0.00002163395,0.000006177132,0.00002403008,0.00001640331,0.0000123087],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8990361,"threshold_uncertainty_score":0.2917259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036786089","doi":"10.1109/jcn.2009.6391334","title":"End-to-end quality of service constrained routing and admission control for MPLS networks","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","authors":[{"name":"Desire Oulai","is_ca":true},{"name":"Steven Chamberland","is_ca":true},{"name":"Samuel Pierre","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02909580154859932,"gpt":0.3049047324052127,"spread":0.2758089308566134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724452,0.0001302299,0.0004158764,0.00007824919,0.0002640321,0.000101783,0.0007913624,0.00009756356,0.000003145806],"category_scores_gemma":[0.00008098553,0.0001108038,0.0000889587,0.0002769787,0.00007264515,0.0002423737,0.0001157428,0.0002922544,1.059069e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001459056,"about_ca_system_score_gemma":0.00007235137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007199684,"about_ca_topic_score_gemma":0.00002313054,"domain_scores_codex":[0.9984637,0.0002590775,0.0007756964,0.0001389804,0.0001496458,0.000212868],"domain_scores_gemma":[0.9966258,0.001445768,0.0006629364,0.0005875417,0.0004522184,0.0002256877],"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.0001671903,0.0001049976,0.0005179335,0.000008085102,0.00007060201,7.662386e-7,0.0003011098,0.01981331,0.0001578577,0.07979301,0.0003268316,0.8987383],"study_design_scores_gemma":[0.00189771,0.0003755786,0.006934087,0.0001652517,0.00004932102,0.00004060617,0.00007699303,0.986667,0.000003475315,0.001486197,0.002168831,0.0001349114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008023646,0.005340065,0.9692096,0.01686154,0.0001096342,0.0002557327,0.000003223597,0.00001971451,0.0001768721],"genre_scores_gemma":[0.9675365,0.0009330919,0.029083,0.002277247,0.0001466572,0.000005020941,0.000002059584,0.000005023569,0.00001139989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9668537,"threshold_uncertainty_score":0.4518448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123762323","doi":"10.1109/jcn.2007.6182882","title":"Performance of SC-FDE system in UWB communications with imperfect channel estimation","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":1,"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; SC-FDE; Equalization (audio); Bit error rate; Channel (broadcasting); Transmission (telecommunications); Frequency domain; Ultra-wideband; Algorithm; Minimum mean square error; Mean squared error; Block (permutation group theory); Electronic engineering; Telecommunications; Mathematics; Statistics","authors":[{"name":"Yue Wang","is_ca":false},{"name":"Xiaodai Dong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00898655779881579,"gpt":0.2253021739021883,"spread":0.2163156161033725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079749,0.0001189359,0.000285979,0.0003728907,0.0001608625,0.00001649445,0.001236731,0.0001213536,0.000001107449],"category_scores_gemma":[0.00001608413,0.0001056396,0.00004066561,0.0005971842,0.0002530178,0.000230509,0.0001841218,0.0006280906,6.373614e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009829768,"about_ca_system_score_gemma":0.00002948497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001809543,"about_ca_topic_score_gemma":0.0002035168,"domain_scores_codex":[0.9988622,0.00007712923,0.0007123761,0.00005440527,0.0001055448,0.0001883114],"domain_scores_gemma":[0.9972231,0.0004818967,0.0003029122,0.00175428,0.0001853388,0.00005245496],"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.000346175,0.0009029077,0.07217854,0.0004951364,0.0006296785,0.000007282211,0.003973183,0.4315981,0.002987802,0.02328961,0.0003523573,0.4632392],"study_design_scores_gemma":[0.0005950921,0.000226785,0.01602585,0.0006461029,0.00005477022,0.0002218885,0.0007063928,0.9802056,0.0003069381,0.00006495533,0.0007981423,0.0001474864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8911209,0.02173741,0.08126731,0.0005047841,0.00007772695,0.0002921967,0.00000309714,0.0001116406,0.004884972],"genre_scores_gemma":[0.960392,0.01470149,0.02484195,0.000009377213,0.00001228079,0.00001273932,0.00000758909,0.0000189327,0.000003621707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5486075,"threshold_uncertainty_score":0.4307858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055168151","doi":"10.1109/jcn.2003.6596561","title":"Performance of multicarrier-CDMA uplink with antenna arrays and multiuser detection","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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":"Telecommunications link; Computer science; Multipath propagation; Rayleigh fading; Fading; Asynchronous communication; Multiuser detection; Code division multiple access; Antenna (radio); Channel (broadcasting); Electronic engineering; Antenna array; Algorithm; Telecommunications; Engineering","authors":[{"name":"Shreeram Sigdel","is_ca":true},{"name":"Kazi M. Ahmed","is_ca":false},{"name":"Anil Fernando","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01894300850536085,"gpt":0.2568081394470939,"spread":0.2378651309417331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009526821,0.0001045965,0.0002264202,0.0001478295,0.0002930966,0.00008151432,0.00105657,0.00007169379,0.000001958114],"category_scores_gemma":[0.00004659143,0.00008062189,0.0000359465,0.0004375308,0.0003058754,0.0004977408,0.0003049765,0.0005315747,2.721797e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002040325,"about_ca_system_score_gemma":0.00006060634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005532127,"about_ca_topic_score_gemma":0.00002098408,"domain_scores_codex":[0.9988068,0.0002914972,0.0004317747,0.0001063939,0.0001936419,0.0001698685],"domain_scores_gemma":[0.9972478,0.0004818672,0.0004030366,0.001261693,0.0004830616,0.0001225606],"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.0003764709,0.0008582429,0.08661939,0.000119037,0.0004832048,0.000007698507,0.003773889,0.0236952,0.006639936,0.02660896,0.0001277668,0.8506902],"study_design_scores_gemma":[0.0006546146,0.0003481626,0.01029756,0.0001401065,0.00001614264,0.0001635418,0.00008963365,0.9860194,0.0002944279,0.00008671899,0.00178461,0.0001050773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3401299,0.0070809,0.6514002,0.0007153128,0.00005798958,0.000156963,3.107593e-7,0.00001619425,0.0004421923],"genre_scores_gemma":[0.9009159,0.01736491,0.08164379,0.00002922792,0.00001594072,0.000005439506,3.661809e-7,0.000008277327,0.00001614618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623242,"threshold_uncertainty_score":0.3287665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040608916","doi":"10.1109/jcn.2004.6596576","title":"Turbo decoding for precoded systems over multipath fading channels","year":2004,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Advantech AMT (Canada)","funders":"","keywords":"Computer science; Rician fading; Precoding; Fading; Turbo equalizer; Turbo code; Rayleigh fading; Channel state information; Algorithm; Decoding methods; Multipath propagation; Turbo; Serial concatenated convolutional codes; Channel (broadcasting); Electronic engineering; MIMO; Telecommunications; Concatenated error correction code; Block code; Wireless; Engineering","authors":[{"name":"Qing Zhang","is_ca":true},{"name":"Tho Le‐Ngoc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0249805130440982,"gpt":0.2825244252757525,"spread":0.2575439122316543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544592,0.0001058928,0.0002217918,0.0001148644,0.0001794353,0.00006405179,0.0005466954,0.00008306636,9.87839e-7],"category_scores_gemma":[0.00003458486,0.0001017057,0.00006750175,0.0001200951,0.00004682922,0.0002877783,0.0000945647,0.0003157121,1.957646e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039868,"about_ca_system_score_gemma":0.00001304097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004012886,"about_ca_topic_score_gemma":0.0000061537,"domain_scores_codex":[0.9992524,0.00003659253,0.0004501482,0.00005131615,0.00006718568,0.0001423578],"domain_scores_gemma":[0.9985834,0.0003984777,0.0002144821,0.0006004735,0.0001364642,0.00006670581],"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.00001046776,0.00003479138,0.00008548469,0.00003470215,0.00006453376,3.632313e-7,0.0004629825,0.9642511,0.0006103808,0.004253943,0.0001815611,0.03000971],"study_design_scores_gemma":[0.0007164112,0.00006839964,0.00007980183,0.000467491,0.0000288435,0.00003380452,0.0001352126,0.9870912,0.0005747728,0.002102112,0.008535608,0.0001663002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.020378,0.02379162,0.9548312,0.0001538118,0.0002377478,0.000263877,0.000003525169,0.0001107478,0.0002295196],"genre_scores_gemma":[0.8955019,0.02133784,0.08296878,0.00001815892,0.00009370675,0.00004021899,0.000004576324,0.00002646782,0.0000083216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8751239,"threshold_uncertainty_score":0.414744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220873601","doi":"10.23919/jcn.2022.9737071","title":"Inside front cover","year":2022,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Front cover; Cover (algebra); Front (military); Geology","authors":[{"name":"Anthony Ephremides","is_ca":false},{"name":"Inkyu Co","is_ca":false},{"name":"Advisors Byeong","is_ca":false},{"name":"Ga Eun Lee","is_ca":false},{"name":"E. Biglieri","is_ca":false},{"name":"Davide Grillo","is_ca":false},{"name":"R.L. Pickholtz","is_ca":false},{"name":"H. Vincent Poor","is_ca":false},{"name":"Henning Schulzrinne","is_ca":false},{"name":"Mischa Schwartz","is_ca":false},{"name":"Stephen B. Weinstein","is_ca":false},{"name":"D.P. Taylor","is_ca":false},{"name":"Jinho Choi","is_ca":false},{"name":"Marco Luise","is_ca":false},{"name":"Hee Jung","is_ca":false},{"name":"Sang‐Hyo Kim","is_ca":false},{"name":"Yun‐Hee Kim","is_ca":false},{"name":"Kyung Hee","is_ca":false},{"name":"Taekyoung Kwon","is_ca":false},{"name":"Kyoung‐Jae Lee","is_ca":false},{"name":"Gonghua Song","is_ca":false},{"name":"Yik Wu","is_ca":false},{"name":"Caijun Zhong","is_ca":false},{"name":"Wonjun Lee","is_ca":false},{"name":"Andy Molisch","is_ca":false},{"name":"Fumiyuki Adachi","is_ca":false},{"name":"Jalel Ben‐Othman","is_ca":false},{"name":"Lin Cai","is_ca":true},{"name":"Jiming Chen","is_ca":true},{"name":"Ji‐Woong Choi","is_ca":false},{"name":"Dgist Choi","is_ca":false},{"name":"Berkan Dülek","is_ca":false},{"name":"Abbas Jamalipour","is_ca":false},{"name":"Zhiyuan Jiang","is_ca":false},{"name":"Soon Kwang","is_ca":false},{"name":"Jang-Won Lee","is_ca":false},{"name":"Daji Qiao","is_ca":false},{"name":"Istd Pillar","is_ca":false},{"name":"Kyung‐Joon Park","is_ca":false},{"name":"Dgist Homayoun Yousefi'zadeh","is_ca":false},{"name":"Ruonan Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05562962457323,"gpt":0.2438927766473666,"spread":0.1882631520741366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008375096,0.000138744,0.0006276346,0.0002427495,0.0003543818,0.000113042,0.0008181708,0.0001093233,0.04516803],"category_scores_gemma":[0.00002135469,0.0001487234,0.0001855447,0.00009482197,0.0001642101,0.0001571722,0.0006971162,0.0006558768,0.005269818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191982,"about_ca_system_score_gemma":0.00003932494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000415212,"about_ca_topic_score_gemma":0.000005016514,"domain_scores_codex":[0.9987267,0.00003662051,0.0008834124,0.0001595993,0.0000331075,0.0001605828],"domain_scores_gemma":[0.9975714,0.0001402375,0.001449434,0.000714178,0.00005405591,0.00007069315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009240266,0.00004600901,0.0001176563,0.000006872823,0.0002048092,9.134608e-7,0.0002358046,0.001216341,4.175994e-8,0.004476116,0.9926198,0.001066399],"study_design_scores_gemma":[0.0002729732,0.00005109331,0.00009718633,0.00002946545,0.00002243302,0.00001440878,0.0002069793,0.002295438,5.361729e-8,0.000653071,0.9962067,0.0001501939],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00007706054,0.1932635,0.0008706868,0.00051613,0.005028519,0.0000779175,0.0003209733,0.000002702162,0.7998425],"genre_scores_gemma":[0.01642903,0.2508453,0.0008059829,0.0004394255,0.0003783355,0.00001087199,0.00005854888,0.00002473517,0.7310078],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06883465,"threshold_uncertainty_score":0.9955047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206341533","doi":"10.23919/jcn.2021.100036","title":"Inside front cover","year":2021,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Front cover; Front (military); Cover (algebra); Telecommunications; Geology; Mechanical engineering","authors":[{"name":"Anthony Ephremides","is_ca":false},{"name":"Inkyu Co","is_ca":false},{"name":"Advisors Byeong","is_ca":false},{"name":"Ga Eun Lee","is_ca":false},{"name":"E. Biglieri","is_ca":false},{"name":"Davide Grillo","is_ca":false},{"name":"R.L. Pickholtz","is_ca":false},{"name":"H. Vincent Poor","is_ca":false},{"name":"Henning Schulzrinne","is_ca":false},{"name":"Mischa Schwartz","is_ca":false},{"name":"Stephen B. Weinstein","is_ca":false},{"name":"D.P. Taylor","is_ca":false},{"name":"Jinho Choi","is_ca":false},{"name":"Marco Luise","is_ca":false},{"name":"Hee Jung","is_ca":false},{"name":"Sang‐Hyo Kim","is_ca":false},{"name":"Yun‐Hee Kim","is_ca":false},{"name":"Kyung Hee","is_ca":false},{"name":"Taekyoung Kwon","is_ca":false},{"name":"Kyoung‐Jae Lee","is_ca":false},{"name":"Gonghua Song","is_ca":false},{"name":"Yik Wu","is_ca":false},{"name":"Caijun Zhong","is_ca":false},{"name":"Wonjun Lee","is_ca":false},{"name":"Andy Molisch","is_ca":false},{"name":"Fumiyuki Adachi","is_ca":false},{"name":"Jalel Ben‐Othman","is_ca":false},{"name":"Lin Cai","is_ca":true},{"name":"Jiming Chen","is_ca":true},{"name":"Ji‐Woong Choi","is_ca":false},{"name":"Dgist Choi","is_ca":false},{"name":"Berkan Dülek","is_ca":false},{"name":"Abbas Jamalipour","is_ca":false},{"name":"Zhiyuan Jiang","is_ca":false},{"name":"Soon Kwang","is_ca":false},{"name":"Jang-Won Lee","is_ca":false},{"name":"Daji Qiao","is_ca":false},{"name":"Istd Pillar","is_ca":false},{"name":"Kyung‐Joon Park","is_ca":false},{"name":"Dgist Homayoun Yousefi'zadeh","is_ca":false},{"name":"Ruonan Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05698833462839843,"gpt":0.2464076569589739,"spread":0.1894193223305755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006158578,0.0001429664,0.0007054131,0.0001788334,0.0002019986,0.0001685097,0.000598337,0.0001700101,0.01151986],"category_scores_gemma":[0.00003089507,0.0001495447,0.0001989033,0.0000907766,0.0001727815,0.0001611234,0.0004542235,0.000514249,0.004765871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007430623,"about_ca_system_score_gemma":0.00005035654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298249,"about_ca_topic_score_gemma":0.000009735229,"domain_scores_codex":[0.9987183,0.00003080807,0.0008987034,0.0001662593,0.00002680882,0.0001591439],"domain_scores_gemma":[0.9976696,0.000132113,0.001262421,0.0007427332,0.0001138925,0.00007925637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005192275,0.00004522015,0.0001252476,0.00001019143,0.000253488,0.000001585158,0.0001980349,0.0004752274,1.103612e-7,0.003824174,0.9939497,0.001111842],"study_design_scores_gemma":[0.0002633222,0.00002705902,0.0001245665,0.0001029667,0.00002528802,0.0000178871,0.0001854933,0.00196923,2.548096e-7,0.0004798195,0.9966528,0.0001513563],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00009068478,0.2954714,0.001889399,0.0005429771,0.004246573,0.00005349068,0.0001672641,0.000002020548,0.6975362],"genre_scores_gemma":[0.01650202,0.3367235,0.001549424,0.0003929069,0.0004890347,0.000004314976,0.00005307862,0.00002069797,0.644265],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.05327119,"threshold_uncertainty_score":0.9960091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}