{"meta":{"query_hash":"122e5326179e","filters":{"venue":"International Journal of Communications Network and System Sciences"},"cohort_total":20,"direct_labels_cover":0,"predictions_cover":20,"exported":20,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/122e5326179e","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Communications+Network+and+System+Sciences"},"results":[{"id":"W1980672065","doi":"10.4236/ijcns.2009.28090","title":"Subcarrier Availability in Downlink OFDM Systems with Imperfect Carrier Synchronization in Deep Fading Noisy Doppler Channels","year":2009,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Fading; Subcarrier; Additive white Gaussian noise; Computer science; Frequency offset; Electronic engineering; Telecommunications link; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.013907711520215155,"score_gpt":0.2691124109258519,"score_spread":0.2552046994056368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980672065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634388,0.00020250071,0.035322808,0.000073148876,0.000007054918,0.000009033426,0.00004263295,0.000046487254,0.00085763296],"genre_scores_gemma":[0.9982578,0.000050608633,0.0015513249,0.0000058108994,0.0000034095358,0.0000045398806,0.000011950855,0.000003551813,0.00011095903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934036,0.00018372809,0.00004469138,0.000075569806,0.00018046217,0.00017517201],"domain_scores_gemma":[0.99150276,0.005674964,0.001550545,0.00048570748,0.000576191,0.00020987248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388588,0.00027266314,0.00065360527,0.0004635299,0.0004902469,0.000694599,0.00031428123,0.00044192348,0.00050227996],"category_scores_gemma":[0.01044142,0.0003275056,0.00015423067,0.00047061083,0.0010150592,0.0010437618,0.00064765743,0.00037778303,0.0001100245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071790715,0.000075528114,0.022818128,0.00009243878,0.000042761054,0.0007026405,0.00025604668,0.93785316,0.020630991,0.0054269996,0.00015175891,0.0112316655],"study_design_scores_gemma":[0.000019734473,0.0001905567,0.008685785,0.000011596441,0.000030435009,0.00029857233,0.00016299039,0.9772335,0.011102627,0.002113362,0.00012970694,0.000020992657],"about_ca_topic_score_codex":0.0026223562,"about_ca_topic_score_gemma":0.0019548621,"teacher_disagreement_score":0.0026223562,"about_ca_system_score_codex":0.00064749975,"about_ca_system_score_gemma":0.0005754546,"threshold_uncertainty_score":0.00734365},"labels":[],"label_agreement":null},{"id":"W1981374951","doi":"10.4236/ijcns.2011.432097","title":"Towards Cloud Management by Autonomic Manager Collaboration","year":2011,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cloud computing; Computer science; Hierarchy; Virtual machine; Autonomic computing; Service (business); Cloud management; Knowledge management; Process management; Business","score_opus":0.026562540460742762,"score_gpt":0.269111263754054,"score_spread":0.2425487232933112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981374951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828277,0.0022956044,0.8578065,0.016775986,0.00035364323,0.0003587046,0.000045474102,0.0020923843,0.037444036],"genre_scores_gemma":[0.60385823,0.0009754024,0.3881044,0.0018254415,0.0003074731,0.0002784322,0.00008520736,0.00014855184,0.004416838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948826,0.0026184553,0.00020356078,0.0005407294,0.0011724782,0.00058225694],"domain_scores_gemma":[0.9958625,0.00095589965,0.00051247,0.0011160263,0.00066691963,0.0008861324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070055136,0.00046864737,0.000493938,0.0008353856,0.0017916057,0.0051003336,0.0016777737,0.0021897242,0.001667241],"category_scores_gemma":[0.0076997485,0.000501154,0.00051732326,0.00094542274,0.0016660024,0.0063671744,0.0057691564,0.002726297,0.0007023307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037205347,0.00061214395,0.0137686385,0.00048035049,0.00021260434,0.0012264746,0.007877059,0.06583214,0.021949183,0.58148503,0.025935436,0.2802489],"study_design_scores_gemma":[0.00018785568,0.0002645827,0.002676702,0.0002522456,0.00010033063,0.0007160355,0.0031537532,0.31872088,0.008748591,0.49590412,0.16916771,0.00010716605],"about_ca_topic_score_codex":0.0015395853,"about_ca_topic_score_gemma":0.0014718167,"teacher_disagreement_score":0.0070055136,"about_ca_system_score_codex":0.00087942183,"about_ca_system_score_gemma":0.003830898,"threshold_uncertainty_score":0.037049115},"labels":[],"label_agreement":null},{"id":"W1982530805","doi":"10.4236/ijcns.2010.36070","title":"Nonlinear Blind Equalizers: NCMA and NMCMA","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Nonlinear system; Quadrature amplitude modulation; Constant (computer programming); Mathematics; Algorithm; Mean squared error; Modulus; Square (algebra); Control theory (sociology); Mathematical optimization; Applied mathematics; Computer science; Bit error rate; Statistics; Geometry; Artificial intelligence; Physics","score_opus":0.04025263552881538,"score_gpt":0.3457636567280029,"score_spread":0.30551102119918755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982530805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011032041,0.0007288032,0.9838573,0.00020258062,0.00012860926,0.000044329758,0.000016677537,0.00023526356,0.0037544332],"genre_scores_gemma":[0.41483486,0.0010732467,0.5718082,0.0003655062,0.0002808086,0.0002339129,0.000064475666,0.00006458348,0.01127443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.00014782925,0.000044946537,0.00015284555,0.0003015527,0.000047228077],"domain_scores_gemma":[0.9988317,0.0005073402,0.00013024497,0.00018347388,0.0003139525,0.000033282206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095560396,0.00069610064,0.0004778561,0.0005026634,0.00042810434,0.0007990618,0.0007750892,0.0010792814,0.0017774447],"category_scores_gemma":[0.003932044,0.00021079421,0.0003214206,0.0004775763,0.0010779457,0.0014368992,0.0007566816,0.0009656731,0.0006823585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086890097,0.00012901143,0.0015116597,0.0003785021,0.00013517807,0.00014226828,0.0002278072,0.16992389,0.10733424,0.12748283,0.0032994829,0.5885663],"study_design_scores_gemma":[0.00007545937,0.00017533338,0.00062509143,0.00004521795,0.0000667939,0.0003098999,0.000035340458,0.9121361,0.061752897,0.0122981565,0.012424192,0.000055452987],"about_ca_topic_score_codex":0.0013514555,"about_ca_topic_score_gemma":0.0017714073,"teacher_disagreement_score":0.0017774447,"about_ca_system_score_codex":0.00060032407,"about_ca_system_score_gemma":0.00088312576,"threshold_uncertainty_score":0.0059461594},"labels":[],"label_agreement":null},{"id":"W1985331271","doi":"10.4236/ijcns.2011.47055","title":"A Framework for Security-Enhanced Peer-to-Peer Applications in Mobile Cellular Networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Cellular network; Session Initiation Protocol; Computer security; Server","score_opus":0.03674613265191875,"score_gpt":0.31610515957498053,"score_spread":0.2793590269230618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985331271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016216539,0.0005358301,0.99081576,0.00053826673,0.00018221176,0.00028820368,0.000037770293,0.0013311594,0.004649104],"genre_scores_gemma":[0.116751924,0.0013354319,0.8719372,0.00027310668,0.00035870122,0.0009843637,0.00017545378,0.00025316645,0.007930624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727976,0.00081169506,0.00024866106,0.00031240826,0.0011141793,0.0002332482],"domain_scores_gemma":[0.99872583,0.000369231,0.000089497866,0.0003149535,0.00030052758,0.000199956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004247198,0.0010257268,0.000977066,0.0009786339,0.0022427058,0.0040364075,0.004192508,0.0030692166,0.0023662364],"category_scores_gemma":[0.0038751664,0.0006935301,0.0013393097,0.0007888956,0.0026649095,0.0045678676,0.0038644632,0.003619714,0.001529645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046824098,0.00007032469,0.0001599425,0.00016946788,0.000032368163,0.00060326507,0.00056719093,0.03154392,0.0049491725,0.91631526,0.006077189,0.039464984],"study_design_scores_gemma":[0.00011373275,0.00018132772,0.00015828262,0.00017051196,0.000076297016,0.0010253896,0.00018596576,0.45249873,0.0049918485,0.30349386,0.23698413,0.000119849734],"about_ca_topic_score_codex":0.002723818,"about_ca_topic_score_gemma":0.0028028814,"teacher_disagreement_score":0.004247198,"about_ca_system_score_codex":0.0013834962,"about_ca_system_score_gemma":0.0028144498,"threshold_uncertainty_score":0.022461653},"labels":[],"label_agreement":null},{"id":"W2000551636","doi":"10.4236/ijcns.2012.511082","title":"AZR-LEACH: An Energy Efficient Routing Protocol for Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer network; Wireless Routing Protocol; Zone Routing Protocol; Computer science; Routing protocol; Wireless sensor network; Dynamic Source Routing; Protocol (science); Routing (electronic design automation); Medicine","score_opus":0.049973493307540445,"score_gpt":0.33463975822475694,"score_spread":0.28466626491721647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000551636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013163747,0.013261104,0.9340832,0.0023025516,0.0010648298,0.0011545486,0.0026315132,0.0086593535,0.02367913],"genre_scores_gemma":[0.1894168,0.017835014,0.73725367,0.0016214475,0.0004320321,0.0019467131,0.0062363297,0.00058233517,0.044675674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989843,0.00026869334,0.00010362411,0.00008945617,0.00049545424,0.000058564376],"domain_scores_gemma":[0.9996629,0.000057905716,0.000060672806,0.00004420292,0.00015201574,0.000022245073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000979998,0.0006975909,0.0007814096,0.00091810786,0.00066110113,0.00085618737,0.0016833256,0.0008043438,0.0017827326],"category_scores_gemma":[0.0008176659,0.00035564808,0.0006688387,0.0013310962,0.0003825584,0.0013678337,0.0011172901,0.0010481018,0.0013274052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006019164,0.000247654,0.0016546714,0.0031598373,0.00054938765,0.00090466475,0.0003855729,0.1469912,0.071710296,0.045577183,0.104328535,0.6238891],"study_design_scores_gemma":[0.00038767274,0.0006487036,0.0014051306,0.0002816197,0.00031829296,0.0016868885,0.00023635416,0.29095888,0.073435724,0.02714076,0.60323197,0.00026801394],"about_ca_topic_score_codex":0.00160618,"about_ca_topic_score_gemma":0.0027879926,"teacher_disagreement_score":0.0017827326,"about_ca_system_score_codex":0.0006663987,"about_ca_system_score_gemma":0.0010723098,"threshold_uncertainty_score":0.005963862},"labels":[],"label_agreement":null},{"id":"W2002089960","doi":"10.4236/ijcns.2010.35059","title":"Analysis and Comparison of Time Replica and Time Linear Interpolation for Pilot Aided Channel Estimation in OFDM Systems","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Orthogonal frequency-division multiplexing; Estimator; Channel (broadcasting); Replica; Computer science; Mean squared error; Algorithm; Interpolation (computer graphics); LTI system theory; Mathematics; Statistics; Telecommunications; Linear system","score_opus":0.02852190327583398,"score_gpt":0.33331675682796474,"score_spread":0.30479485355213076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002089960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06442295,0.0011250273,0.93187994,0.00009709266,0.00004195075,0.000020740921,0.000020034006,0.00020482975,0.0021874255],"genre_scores_gemma":[0.8661924,0.0009985497,0.13123071,0.000034398374,0.00008250238,0.000036527,0.000052899908,0.000053955915,0.0013181323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989888,0.00032898958,0.000032225533,0.00006340554,0.0005320285,0.0000545819],"domain_scores_gemma":[0.9960943,0.0029343078,0.000185554,0.00024427392,0.0005118202,0.000029811576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017346803,0.0003961405,0.00040211072,0.00050711376,0.00018171014,0.00050721917,0.00047547006,0.00056050427,0.0010722609],"category_scores_gemma":[0.008367668,0.00016145571,0.0002887325,0.00044789724,0.00037606456,0.0010100626,0.00045483134,0.00040372295,0.00012926954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498873,0.000036708745,0.002022634,0.0001544762,0.000080908525,0.00017915333,0.00011092674,0.7831036,0.020040046,0.034597497,0.0003532859,0.1587709],"study_design_scores_gemma":[0.000005500933,0.000079379315,0.0003582188,0.000005552083,0.000011316812,0.00006499341,0.000009162003,0.9929053,0.004826566,0.0013292198,0.00039607403,0.000008600218],"about_ca_topic_score_codex":0.0008903298,"about_ca_topic_score_gemma":0.00072223076,"teacher_disagreement_score":0.0017346803,"about_ca_system_score_codex":0.00044160092,"about_ca_system_score_gemma":0.00039374013,"threshold_uncertainty_score":0.00917393},"labels":[],"label_agreement":null},{"id":"W2028442460","doi":"10.4236/ijcns.2010.32019","title":"Selection of Design Parameters for Generalized Sphere Decoding Algorithms","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Algorithm; Underdetermined system; Set (abstract data type); Selection (genetic algorithm); Transformation (genetics); Rank (graph theory); Computer science; Matrix (chemical analysis); Design matrix; Mathematical optimization; Mathematics; Artificial intelligence; Linear model; Machine learning","score_opus":0.04928457619863136,"score_gpt":0.3233563669788593,"score_spread":0.2740717907802279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028442460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035604204,0.00024798562,0.9952311,0.00006056424,0.000013178727,0.000041523894,0.000019122012,0.00016624278,0.00065987464],"genre_scores_gemma":[0.2041692,0.0009821347,0.79319334,0.00012887154,0.00006487568,0.00040276776,0.00016597217,0.00015434735,0.0007384311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970381,0.0018005664,0.00021223718,0.00031521596,0.00052917126,0.00010472949],"domain_scores_gemma":[0.99625707,0.002000419,0.00046529746,0.00042516037,0.00076888135,0.000083164596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002447707,0.0022622042,0.0011236009,0.0011167608,0.0004619184,0.0010141651,0.0007618774,0.0012184121,0.0015661535],"category_scores_gemma":[0.013759264,0.00062218186,0.0005411126,0.0012640746,0.001060647,0.0014692401,0.0011788158,0.0013992145,0.0011769123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004628045,0.00012840089,0.0013939055,0.0005644827,0.00015433137,0.00012373869,0.00039926366,0.34820372,0.04680185,0.072251774,0.0032956144,0.5262201],"study_design_scores_gemma":[0.00018863422,0.00028540942,0.00059925707,0.00016717071,0.00007855709,0.0003717109,0.00009650255,0.9134362,0.038786765,0.03632672,0.009548456,0.00011461764],"about_ca_topic_score_codex":0.0005823225,"about_ca_topic_score_gemma":0.00065491383,"teacher_disagreement_score":0.002447707,"about_ca_system_score_codex":0.00055991235,"about_ca_system_score_gemma":0.0011246327,"threshold_uncertainty_score":0.012944877},"labels":[],"label_agreement":null},{"id":"W2058261656","doi":"10.4236/ijcns.2010.39101","title":"A New Effective and Efficient Measure of PAPR in OFDM","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Orthogonal frequency-division multiplexing; Variance (accounting); Inefficiency; SIGNAL (programming language); Autocorrelation; Computer science; Power (physics); Aperiodic graph; Wireless; Mathematics; Electronic engineering; Telecommunications; Statistics; Channel (broadcasting); Physics; Data mining; Engineering","score_opus":0.011424835664073518,"score_gpt":0.26816148847717974,"score_spread":0.2567366528131062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058261656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014862247,0.0011747719,0.98148066,0.0001005137,0.000100166726,0.00005813848,0.00008995403,0.00040472735,0.0017287859],"genre_scores_gemma":[0.33916077,0.0017724945,0.6558801,0.00014821246,0.000330016,0.00022072069,0.0003583638,0.00016590432,0.0019634457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973779,0.0006546573,0.00014419771,0.00029123403,0.001443412,0.00008864315],"domain_scores_gemma":[0.99642986,0.0020942078,0.00043943498,0.00032977728,0.0006446728,0.000062139254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014692338,0.0010571415,0.0009249922,0.002024263,0.00043460773,0.0011578938,0.0009938172,0.00076501264,0.0009766318],"category_scores_gemma":[0.008942484,0.0002956711,0.00053260993,0.001974228,0.000931166,0.0019396648,0.0009392604,0.00091881887,0.00043891894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038859475,0.00019428514,0.0054560713,0.00060231925,0.00019332461,0.00046313685,0.00025240434,0.10827067,0.07999179,0.039576467,0.003364801,0.76124614],"study_design_scores_gemma":[0.000051801795,0.000913904,0.01134998,0.00012538777,0.00017658802,0.0028647652,0.00013926775,0.8810053,0.062987916,0.023713686,0.016469033,0.00020236919],"about_ca_topic_score_codex":0.00041371325,"about_ca_topic_score_gemma":0.0004267148,"teacher_disagreement_score":0.002024263,"about_ca_system_score_codex":0.0005459787,"about_ca_system_score_gemma":0.0006600913,"threshold_uncertainty_score":0.0077701807},"labels":[],"label_agreement":null},{"id":"W2081605040","doi":"10.4236/ijcns.2012.512084","title":"A Scalable and Robust DHT Protocol for Structured P2P Network","year":2012,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Distributed hash table; Computer science; Latency (audio); Computer network; Hash table; Scalability; Liveness; Routing protocol; Routing table; Distributed computing; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Lookup table; Peer-to-peer; Dynamic Source Routing; Routing (electronic design automation); Hash function; Computer security; Operating system","score_opus":0.06644405462662982,"score_gpt":0.34436077077511823,"score_spread":0.2779167161484884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081605040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019572455,0.0011857256,0.9689095,0.00040660627,0.00026927062,0.000670862,0.000664416,0.004914515,0.0034066942],"genre_scores_gemma":[0.4469866,0.0015235409,0.5405499,0.00026121922,0.0002383378,0.0007629698,0.0028610793,0.00038632215,0.0064300657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991148,0.00015766712,0.00007957709,0.0001181068,0.0004783308,0.0000515754],"domain_scores_gemma":[0.99870527,0.0003125536,0.00013097044,0.00043259974,0.00033730126,0.000081345745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011494615,0.00038438936,0.00064855587,0.0007676087,0.00081269647,0.0010221578,0.0016977369,0.0006419824,0.0018419834],"category_scores_gemma":[0.0032572483,0.0003212203,0.00038991802,0.0009807845,0.00062946905,0.0021390743,0.0014559596,0.000872068,0.0007143809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082303135,0.00028374538,0.0022367812,0.0013035476,0.00022880686,0.0012805498,0.0006002363,0.11333995,0.13587525,0.054888837,0.031651866,0.65748745],"study_design_scores_gemma":[0.00048331605,0.001095891,0.0019481224,0.00009242574,0.00022968778,0.002750002,0.00042704795,0.7089117,0.10538159,0.039538275,0.13892284,0.00021911673],"about_ca_topic_score_codex":0.0012583548,"about_ca_topic_score_gemma":0.0011943039,"teacher_disagreement_score":0.0018419834,"about_ca_system_score_codex":0.00069481716,"about_ca_system_score_gemma":0.0009009216,"threshold_uncertainty_score":0.006162107},"labels":[],"label_agreement":null},{"id":"W2094956980","doi":"10.4236/ijcns.2012.53021","title":"Formal Verification of Secrecy in Group Key Protocols Using Event-B","year":2012,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Secrecy; Forward secrecy; Computer science; Group key; Key (lock); Computer security; Group (periodic table); Key distribution; Communication in small groups; Cryptographic protocol; Theoretical computer science; Cryptography; Public-key cryptography; Computer network; Encryption","score_opus":0.07281051400307641,"score_gpt":0.3853297354276244,"score_spread":0.31251922142454797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094956980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006159768,0.000030322224,0.99173534,0.0001086552,0.000022200216,0.00011260543,0.00006230493,0.00090299547,0.00086579536],"genre_scores_gemma":[0.25973257,0.0001816682,0.73727536,0.00015273565,0.000039769715,0.00040768797,0.00028245995,0.0003098951,0.0016178004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98932475,0.0046653654,0.0010779105,0.001097985,0.0032294274,0.00060458184],"domain_scores_gemma":[0.97410923,0.019274982,0.0016177888,0.003347801,0.0013721787,0.00027791286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011758611,0.0010430242,0.0008046746,0.0016000088,0.0014928046,0.0038138074,0.0027162174,0.001859962,0.0027691675],"category_scores_gemma":[0.021229412,0.0012192468,0.0026116662,0.0012881781,0.005714871,0.0065297033,0.0037224211,0.0030050757,0.0006940065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034352276,0.00026201314,0.0017247491,0.00041839082,0.00012896128,0.0010466515,0.0014535913,0.114398085,0.016743157,0.8181433,0.001190838,0.044146743],"study_design_scores_gemma":[0.00032033512,0.00015515195,0.00032257783,0.00013394031,0.00011731976,0.00031268952,0.00020663436,0.6247622,0.040519025,0.3194298,0.013634634,0.00008570847],"about_ca_topic_score_codex":0.005871147,"about_ca_topic_score_gemma":0.003722041,"teacher_disagreement_score":0.011758611,"about_ca_system_score_codex":0.0018075592,"about_ca_system_score_gemma":0.0031617605,"threshold_uncertainty_score":0.06218624},"labels":[],"label_agreement":null},{"id":"W2131404560","doi":"10.4236/ijcns.2010.34043","title":"User Selection and Precoding Schemes Based on Partial Channel Information for Broadcast MIMO Systems","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; MIMO; Zero-forcing precoding; Computer science; Channel (broadcasting); Transmitter; Multi-user MIMO; Computer network; Selection (genetic algorithm); Ergodic theory; Channel state information; Channel capacity; Base station; Limit (mathematics); Wireless; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.017683224400369055,"score_gpt":0.2696997994614554,"score_spread":0.2520165750610863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131404560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10180483,0.0006387248,0.89373904,0.00016782043,0.00004633721,0.000051179795,0.000059904793,0.00014597687,0.003346154],"genre_scores_gemma":[0.9492115,0.00038589584,0.049170468,0.000042016483,0.000045947898,0.000053585296,0.000045196604,0.000007869706,0.0010374727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993631,0.0002961613,0.000023676404,0.000060479426,0.00017017011,0.00008641246],"domain_scores_gemma":[0.99826235,0.0011750052,0.00012745631,0.00020068814,0.00018129952,0.0000532826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080468535,0.0004902955,0.0007353598,0.0002947258,0.00036596696,0.00046868937,0.0005494624,0.00044321042,0.0009135907],"category_scores_gemma":[0.0029064156,0.00029435818,0.00032838227,0.000500385,0.0008460702,0.00047789118,0.00054321333,0.00039821156,0.00017450622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005861675,0.0001160096,0.0017643652,0.00023616492,0.00014618128,0.000381149,0.00041418363,0.7733252,0.044541933,0.06574008,0.0017268764,0.11102174],"study_design_scores_gemma":[0.000027465614,0.00016723645,0.00044832623,0.000013953851,0.00003673837,0.00015247946,0.000031928073,0.9868401,0.003746828,0.007970697,0.0005480141,0.000016308259],"about_ca_topic_score_codex":0.0009567345,"about_ca_topic_score_gemma":0.0015264939,"teacher_disagreement_score":0.0009567345,"about_ca_system_score_codex":0.00032844866,"about_ca_system_score_gemma":0.00057885563,"threshold_uncertainty_score":0.0042556524},"labels":[],"label_agreement":null},{"id":"W2168723448","doi":"10.4236/ijcns.2014.710042","title":"Network Coding and Quality of Service for Mobile <i>Ad Hoc</i> Networks","year":2014,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Computer network; Computer science; Linear network coding; Mobile ad hoc network; Bottleneck; Network packet; Wireless ad hoc network; Routing protocol; Packet forwarding; Distributed computing; Wireless; Telecommunications","score_opus":0.12126478296474787,"score_gpt":0.36687537512770735,"score_spread":0.2456105921629595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168723448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07798395,0.0095974095,0.87957186,0.0021118096,0.00040010206,0.0001475657,0.0001901234,0.0005050048,0.029492239],"genre_scores_gemma":[0.9187344,0.0050763073,0.07171245,0.00021543288,0.0001617505,0.00015403697,0.00018612239,0.000050468137,0.0037090264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.000342296,0.00003783049,0.00006640211,0.00045654416,0.00010164092],"domain_scores_gemma":[0.9961618,0.002051619,0.00040462686,0.0003076425,0.000997319,0.0000770136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013968905,0.00037243738,0.00034494084,0.0009668363,0.00042507684,0.0012768077,0.0006788724,0.0006423735,0.001915662],"category_scores_gemma":[0.0075408644,0.00012559965,0.00015214164,0.0018875926,0.0009933709,0.0016066793,0.0006883728,0.00064268673,0.00032101915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024966817,0.000096076175,0.0033361265,0.00036662148,0.000046822403,0.000254362,0.0003206657,0.39093918,0.014211709,0.29022494,0.007965914,0.2919879],"study_design_scores_gemma":[0.000021175414,0.00024834,0.0012279403,0.00009878942,0.000023265295,0.0002149263,0.0001695445,0.9050709,0.005242033,0.07365519,0.013991812,0.000036041656],"about_ca_topic_score_codex":0.0037603925,"about_ca_topic_score_gemma":0.0033072678,"teacher_disagreement_score":0.0037603925,"about_ca_system_score_codex":0.0014668229,"about_ca_system_score_gemma":0.0013185147,"threshold_uncertainty_score":0.010642588},"labels":[],"label_agreement":null},{"id":"W2171007278","doi":"10.4236/ijcns.2010.31001","title":"Achievable Rate Regions for Orthogonally Multiplexed MIMO Broadcast Channels with Multi-Dimensional Modulation","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transmitter; MIMO; Multiplexing; Computer science; Channel (broadcasting); Multipath propagation; Transmitter power output; Spatial multiplexing; Antenna (radio); Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Engineering","score_opus":0.02843825083418203,"score_gpt":0.2797449019868585,"score_spread":0.2513066511526764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171007278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13252716,0.0061427853,0.8207971,0.0008971846,0.000054526532,0.00020684916,0.00082289864,0.0007536924,0.037797783],"genre_scores_gemma":[0.93382126,0.0025441546,0.059506815,0.0002061404,0.00007303417,0.00044196082,0.00039219597,0.0001731351,0.0028411788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964038,0.0014908394,0.00013713112,0.0003002369,0.0008647923,0.0008031921],"domain_scores_gemma":[0.973032,0.021614585,0.0022870656,0.00078557216,0.0019121892,0.00036861378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055993716,0.0022535587,0.0020090358,0.0019728746,0.0010110177,0.0033409502,0.001817309,0.0012963526,0.0033770264],"category_scores_gemma":[0.024179636,0.0008537003,0.0012148093,0.0017781031,0.0027040448,0.002062828,0.0025750813,0.001525601,0.0010023677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005738781,0.00007196352,0.0006159345,0.00052817934,0.00013899656,0.0003535107,0.0005051635,0.84584504,0.008438057,0.12875387,0.0012833254,0.012892153],"study_design_scores_gemma":[0.00006870893,0.00018529166,0.0005070046,0.00021157907,0.000065739514,0.00032470087,0.0002625541,0.9185403,0.008125414,0.069839366,0.001788118,0.00008115393],"about_ca_topic_score_codex":0.002139896,"about_ca_topic_score_gemma":0.00096261373,"teacher_disagreement_score":0.0055993716,"about_ca_system_score_codex":0.0029908519,"about_ca_system_score_gemma":0.0014045648,"threshold_uncertainty_score":0.0296126},"labels":[],"label_agreement":null},{"id":"W2343659612","doi":"10.4236/ijcns.2016.94007","title":"Optimization of Leaky Feeder Slot Spacing for Better Beam Forming in Mines and Tunnels","year":2016,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bent molecular geometry; Broadband; Side lobe; Beam (structure); Radius of curvature; Channel (broadcasting); Curvature; Antenna (radio); RADIUS; Wireless; Power (physics); Main lobe; Computer science; Genetic algorithm; Acoustics; Engineering; Physics; Optics; Telecommunications; Mathematics; Structural engineering; Geometry; Computer network","score_opus":0.026249533792037004,"score_gpt":0.26359212431647144,"score_spread":0.23734259052443443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343659612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5576912,0.00025434495,0.43769437,0.00014281849,0.000026183538,0.00003037526,0.000055838824,0.00036034157,0.003744463],"genre_scores_gemma":[0.9137078,0.00009352257,0.08558208,0.000025269053,0.0000038990975,0.000021569576,0.000031105665,0.000041065585,0.0004935955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979776,0.0000642648,0.000011268669,0.00003631339,0.00004186627,0.00004857392],"domain_scores_gemma":[0.99940753,0.0002535756,0.00014886723,0.00005841445,0.00009710488,0.00003447409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897565,0.0004979278,0.00042247912,0.0003227465,0.00019911172,0.000448783,0.0003433684,0.0004506009,0.0007500709],"category_scores_gemma":[0.0011144801,0.0002568112,0.00035883512,0.00039341184,0.00029714627,0.00046754212,0.00034792145,0.0002931461,0.00020117864],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001857177,0.00012346783,0.0043870173,0.000088886285,0.00003888283,0.00014257977,0.00013170134,0.88505834,0.063707076,0.0023698444,0.00041455918,0.043351896],"study_design_scores_gemma":[0.000050403018,0.00038949194,0.0030914277,0.00001734591,0.000038919545,0.00024574203,0.00015014419,0.96275204,0.03009407,0.0016695667,0.0014697444,0.00003113293],"about_ca_topic_score_codex":0.0006929041,"about_ca_topic_score_gemma":0.0010700139,"teacher_disagreement_score":0.0007500709,"about_ca_system_score_codex":0.00029840847,"about_ca_system_score_gemma":0.0004090495,"threshold_uncertainty_score":0.0025901198},"labels":[],"label_agreement":null},{"id":"W2492859653","doi":"10.4236/ijcns.2016.98028","title":"Joint Routing and Admission Control in Wireless Mesh Network","year":2016,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Handover; Admission control; Quality of service; Call Admission Control; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Wireless mesh network; Static routing; Distributed computing; Routing (electronic design automation); Wireless network; Wireless; Routing protocol","score_opus":0.02519573474975544,"score_gpt":0.2776487129300832,"score_spread":0.25245297818032775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492859653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04849854,0.0015043569,0.9463277,0.00059274834,0.000143708,0.00006645241,0.000039241077,0.00073420955,0.002093064],"genre_scores_gemma":[0.95526576,0.00040872337,0.042468864,0.00007086897,0.00011932782,0.00007784985,0.000048136215,0.000025985524,0.0015145548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982451,0.0006109267,0.00010057193,0.00025622273,0.0005313344,0.00025586112],"domain_scores_gemma":[0.99842715,0.0008714238,0.00023180827,0.00017181195,0.00017885953,0.000118914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018867555,0.00044532111,0.00081892207,0.00071572507,0.00067792035,0.0011784716,0.0012292138,0.0007983354,0.0006650695],"category_scores_gemma":[0.004434889,0.0002958189,0.00043493722,0.0007437865,0.0009300015,0.0012817498,0.0015962943,0.00088976504,0.00012900023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002624693,0.00011189636,0.0020735227,0.000089266105,0.000091207214,0.00015186632,0.00018684866,0.76676697,0.009471157,0.04281473,0.001845549,0.17613447],"study_design_scores_gemma":[0.000008257441,0.000023512626,0.00012561679,0.000002554598,0.000007763231,0.00001953909,0.000009677192,0.9908199,0.0005828982,0.00800075,0.00039214164,0.0000074324084],"about_ca_topic_score_codex":0.00391464,"about_ca_topic_score_gemma":0.0025333504,"teacher_disagreement_score":0.00391464,"about_ca_system_score_codex":0.0009826752,"about_ca_system_score_gemma":0.0012887715,"threshold_uncertainty_score":0.009978235},"labels":[],"label_agreement":null},{"id":"W2526663563","doi":"10.4236/ijcns.2016.910033","title":"A Receiver Structure for Frequency-Flat Time-Varying Rayleigh Channels and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Frequency-shift keying; Fading; Rayleigh fading; Channel (broadcasting); Algorithm; Computer science; Keying; Modulation (music); Electronic engineering; Mathematics; Telecommunications; Topology (electrical circuits); Acoustics; Engineering; Physics; Demodulation","score_opus":0.0174899448523057,"score_gpt":0.269842297256151,"score_spread":0.2523523524038453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526663563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00768311,0.00015852717,0.99100727,0.000052474414,0.000017453753,0.000019527582,0.000019530245,0.00018307127,0.00085901335],"genre_scores_gemma":[0.4592723,0.00065515813,0.53502476,0.00014588206,0.00013629187,0.00010679456,0.00014608115,0.00008357481,0.004429309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943155,0.00015108258,0.000022653408,0.00007140965,0.00026386458,0.00005940043],"domain_scores_gemma":[0.9994356,0.00017904482,0.00006109904,0.0001027762,0.00020164943,0.000019730678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069757056,0.00066266744,0.00059912825,0.0003826275,0.00034837902,0.00062934397,0.00062488794,0.0008782809,0.0012528887],"category_scores_gemma":[0.0012444918,0.00026475886,0.00046681892,0.00030237462,0.0004745348,0.00075412425,0.0005373532,0.0009065251,0.00089580845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005271978,0.0001416094,0.0015048246,0.00033032187,0.00014743597,0.00042118164,0.0002159231,0.3968752,0.31605828,0.07366557,0.002591385,0.20752105],"study_design_scores_gemma":[0.00002023827,0.00030402996,0.00050656125,0.000015197599,0.00004159766,0.00043764303,0.000020498423,0.95210385,0.039241064,0.0043464582,0.0029308528,0.000032082746],"about_ca_topic_score_codex":0.0006649687,"about_ca_topic_score_gemma":0.000699053,"teacher_disagreement_score":0.0012528887,"about_ca_system_score_codex":0.00042309673,"about_ca_system_score_gemma":0.0005898381,"threshold_uncertainty_score":0.004191339},"labels":[],"label_agreement":null},{"id":"W2888511005","doi":"10.4236/ijcns.2018.117009","title":"P2P Overlay Performance in Large-Scale MANETs","year":2018,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Army Research Laboratory; Research, Development and Engineering Command","keywords":"Computer network; Computer science; Overlay network; Mobile ad hoc network; Chord (peer-to-peer); Bottleneck; Overlay; Distributed computing; Flooding (psychology); Routing protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing (electronic design automation); Network packet; Wireless; The Internet; Embedded system","score_opus":0.01918824986636469,"score_gpt":0.28550747417733097,"score_spread":0.2663192243109663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888511005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93162453,0.0013894684,0.058363482,0.00046065057,0.00013545454,0.00011613442,0.00021844132,0.0013065253,0.006385307],"genre_scores_gemma":[0.9916433,0.00030519834,0.0074773496,0.000019879008,0.00001234696,0.000019374136,0.00011035434,0.000038588172,0.00037372808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869627,0.00043917994,0.00006944735,0.00017066093,0.00042246116,0.00020210649],"domain_scores_gemma":[0.9954491,0.0029350598,0.00024898292,0.0004480723,0.0006644353,0.00025434495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020834932,0.00067204534,0.0006138983,0.00067583355,0.0010170281,0.0009809032,0.000761122,0.00083134836,0.00075981097],"category_scores_gemma":[0.00840526,0.0003042441,0.00020933848,0.0009952304,0.0007343884,0.002835009,0.0010543374,0.00057707797,0.00024526002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522698,0.00025909353,0.008474748,0.00038035208,0.00015133906,0.000876972,0.00065274467,0.9018136,0.034292843,0.006421087,0.0028896683,0.0431352],"study_design_scores_gemma":[0.000054832926,0.0007392424,0.004607762,0.00002200219,0.000055352124,0.00037865367,0.0006436507,0.96545327,0.020379124,0.005769637,0.001852023,0.00004447087],"about_ca_topic_score_codex":0.0049254447,"about_ca_topic_score_gemma":0.0027076064,"teacher_disagreement_score":0.0049254447,"about_ca_system_score_codex":0.00072531943,"about_ca_system_score_gemma":0.00048131513,"threshold_uncertainty_score":0.011018693},"labels":[],"label_agreement":null},{"id":"W2917562760","doi":"10.4236/ijcns.2019.122003","title":"Analysis and Design of Different Methods to Reach Optimum Power in Butler Matrix","year":2019,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced Antenna and Metasurface Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Matrix (chemical analysis); Computer science; Power (physics); Reflection coefficient; Wireless; Electronic engineering; Beam (structure); Electrical engineering; Telecommunications; Acoustics; Engineering; Optics; Physics; Materials science","score_opus":0.03275474164154978,"score_gpt":0.3515587636807181,"score_spread":0.3188040220391683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917562760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058819253,0.001164164,0.92825574,0.00012019532,0.000028880238,0.00007655045,0.000039954244,0.00025431617,0.01124097],"genre_scores_gemma":[0.4071278,0.0011130084,0.5867451,0.00003661979,0.000025585608,0.00015253764,0.00006150043,0.00012789656,0.004609995],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971765,0.000055498607,0.000010227308,0.00004474204,0.00014524123,0.00002660677],"domain_scores_gemma":[0.9997017,0.00012116986,0.000066286215,0.000026387437,0.00007538446,0.000009061897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030650158,0.0005890858,0.0002771013,0.0005203161,0.00019181114,0.0005479178,0.0004299339,0.00037550015,0.0016970146],"category_scores_gemma":[0.0006717767,0.00028927007,0.00035526993,0.0006927823,0.00032961523,0.0004966626,0.00023217646,0.00026788452,0.00047741042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023659931,0.00014098018,0.0013412563,0.00070473383,0.000120513956,0.0001854003,0.00039500458,0.22939977,0.4808119,0.07780026,0.0013602736,0.20750332],"study_design_scores_gemma":[0.000084393294,0.0006053719,0.00087431073,0.00005020363,0.00007763775,0.00054965937,0.00011228229,0.70944136,0.25668997,0.0070136827,0.024457023,0.000044084587],"about_ca_topic_score_codex":0.00032395712,"about_ca_topic_score_gemma":0.00064741675,"teacher_disagreement_score":0.0016970146,"about_ca_system_score_codex":0.00046818546,"about_ca_system_score_gemma":0.00026408976,"threshold_uncertainty_score":0.0056770444},"labels":[],"label_agreement":null},{"id":"W2955535680","doi":"10.4236/ijcns.2019.126007","title":"Balancing D2D Communication Relayed Traffic Offloading in Multi-Tier HetNets","year":2019,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Canadian Institute for International Peace and Security","funders":"","keywords":"Computer science; Computer network; Relay; Macro; Quality of service; Load balancing (electrical power); Heterogeneous network; Interference (communication); Scheme (mathematics); Handover; Wireless; Telecommunications; Wireless network","score_opus":0.020302779547856874,"score_gpt":0.2778287048815806,"score_spread":0.25752592533372376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955535680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1772101,0.000929146,0.8161996,0.00017933003,0.00008586225,0.000071597475,0.00007439409,0.00027195492,0.004978011],"genre_scores_gemma":[0.98444647,0.00018520418,0.014495223,0.000044162734,0.000017752467,0.000023822056,0.000020988875,0.000009681228,0.00075676304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00018853568,0.000019110705,0.00010767383,0.00007843724,0.000110612964],"domain_scores_gemma":[0.99950504,0.00024135402,0.000068279885,0.000066984656,0.00006929392,0.00004901515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581495,0.0006971758,0.0006882154,0.00048228464,0.0006565477,0.00090468855,0.0008665267,0.0006134941,0.0008090783],"category_scores_gemma":[0.0010119278,0.0002064965,0.00036649156,0.00052593136,0.0005934898,0.00080732396,0.0010662026,0.00027630935,0.00015395135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023394261,0.00013919124,0.0026241601,0.00013158494,0.000091118585,0.0005723628,0.0001600835,0.86509436,0.032100618,0.018276101,0.0014256334,0.079150826],"study_design_scores_gemma":[0.000011810586,0.000082747094,0.0005472262,0.0000050980775,0.000018399407,0.00014325723,0.00006222635,0.9911082,0.003260636,0.004075801,0.0006702917,0.000014304651],"about_ca_topic_score_codex":0.003160841,"about_ca_topic_score_gemma":0.0034995468,"teacher_disagreement_score":0.003160841,"about_ca_system_score_codex":0.0007414017,"about_ca_system_score_gemma":0.00047409354,"threshold_uncertainty_score":0.0062848926},"labels":[],"label_agreement":null},{"id":"W4289537693","doi":"10.4236/ijcns.2022.158009","title":"Addressing the Security Challenges of Big Data Analytics in Healthcare Research","year":2022,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Big data; Data science; Analytics; Exploit; Computer science; Health care; Pipeline (software); Data analysis; Obstacle; Computer security; Domain (mathematical analysis); Data mining; Political science","score_opus":0.6352491616986136,"score_gpt":0.47874211800827216,"score_spread":0.1565070436903414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289537693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03256108,0.016521918,0.6743447,0.24395797,0.0021165495,0.000543037,0.00029598558,0.000559625,0.029099125],"genre_scores_gemma":[0.6439317,0.020731986,0.3051064,0.01991275,0.0034527017,0.00071249914,0.00041941524,0.00019750226,0.0055351597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96582264,0.018793346,0.002437804,0.00221031,0.009263896,0.0014720267],"domain_scores_gemma":[0.93270427,0.040931083,0.0054287664,0.012678075,0.0062668496,0.0019908783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04115545,0.0007423621,0.0010071765,0.0023916878,0.0041242307,0.013821151,0.00241205,0.0050934907,0.0016974467],"category_scores_gemma":[0.052781783,0.0010114758,0.0011206378,0.0024852564,0.009922698,0.020376671,0.015959691,0.010622175,0.0008062403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016436455,0.00007032584,0.0045169895,0.00054439896,0.00008281123,0.00044973887,0.0026232887,0.0063683363,0.002461775,0.866466,0.012186903,0.104065105],"study_design_scores_gemma":[0.00003318936,0.00013851987,0.0012420317,0.0012382495,0.00005133478,0.0012681282,0.0026246712,0.026961967,0.005350072,0.84421283,0.11677942,0.00009959225],"about_ca_topic_score_codex":0.0013664471,"about_ca_topic_score_gemma":0.0011578265,"teacher_disagreement_score":0.04115545,"about_ca_system_score_codex":0.0035829043,"about_ca_system_score_gemma":0.010238576,"threshold_uncertainty_score":0.2176534},"labels":[],"label_agreement":null}]}