{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75429547,0.031382505,0.1996783,0.0019287887,0.001398195,0.001080977,0.000016093234,0.00029447154,0.009925202],"genre_scores_gemma":[0.99254584,0.0018537488,0.0054492024,0.000020393076,0.000096217256,0.000015347912,0.0000050969343,0.000009170584,0.0000049547407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982995,0.00023426308,0.0007766064,0.00012879679,0.0003675847,0.00019329802],"domain_scores_gemma":[0.99861,0.0002696975,0.00028885272,0.00044924434,0.0003222451,0.00005994989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015180262,0.0001388958,0.0002911541,0.00038767024,0.00013487187,0.00016015308,0.0013094359,0.00006979949,0.0000028565355],"category_scores_gemma":[0.00004132689,0.00011583912,0.000034849425,0.00066017086,0.00018838007,0.00065375987,0.000085525215,0.00031037777,6.805837e-7],"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.000025849244,0.000043609798,0.03823876,0.00002843606,0.000033887914,0.000007680622,0.0011931123,0.93819517,0.00012607464,0.012672189,0.000060000668,0.009375207],"study_design_scores_gemma":[0.00068510143,0.00016899596,0.012570445,0.0016085928,0.000012842914,0.00035376023,0.0021050388,0.9802601,0.00009385157,0.0008671763,0.0009732191,0.0003008725],"about_ca_topic_score_codex":0.000041512343,"about_ca_topic_score_gemma":0.00015635714,"teacher_disagreement_score":0.23825039,"about_ca_system_score_codex":0.00035996994,"about_ca_system_score_gemma":0.00006564637,"threshold_uncertainty_score":0.4723782},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09303258,0.0089860065,0.51880145,0.014593552,0.0077008735,0.00050860253,0.000005181958,0.00021816668,0.35615358],"genre_scores_gemma":[0.93494445,0.00028356045,0.064250864,0.00015200295,0.00015314163,0.00000429939,6.538569e-7,0.0000032577843,0.00020775318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859595,0.00017122774,0.000489431,0.00015808745,0.00043863503,0.00014668057],"domain_scores_gemma":[0.9987283,0.00006650148,0.0004654173,0.00044668233,0.00022878998,0.00006432072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014878736,0.00009297377,0.00014009017,0.0001815016,0.00033553533,0.00034895414,0.0036451025,0.000026475565,0.0000035068495],"category_scores_gemma":[0.000006690537,0.00007494497,0.0000550134,0.00039226553,0.00016619351,0.00015158353,0.00091090566,0.00009484182,0.000006321476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001115474,0.00009543091,0.00093720196,0.000011809781,0.00020630097,0.000016723512,0.0017639317,0.0033439065,0.0000059904073,0.90227467,0.011024091,0.08030877],"study_design_scores_gemma":[0.0018249705,0.000574444,0.0143442005,0.0011514226,0.00013067778,0.0006128974,0.011834559,0.6721696,0.00009269086,0.024547445,0.27191484,0.00080224656],"about_ca_topic_score_codex":0.000026130532,"about_ca_topic_score_gemma":0.000004807246,"teacher_disagreement_score":0.8777272,"about_ca_system_score_codex":0.000084316394,"about_ca_system_score_gemma":0.000046798315,"threshold_uncertainty_score":0.67735684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28022572,0.004864387,0.6314419,0.043546557,0.0034540754,0.00039331784,0.000007457822,0.00023396446,0.035832614],"genre_scores_gemma":[0.77542764,0.00035471222,0.22380537,0.00022244072,0.00016167195,0.0000026155928,6.300133e-7,0.000002435987,0.000022482165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868464,0.00018090791,0.0004587599,0.00012799137,0.00043771745,0.00011000298],"domain_scores_gemma":[0.9981981,0.00041091387,0.00044259746,0.0003986082,0.00046566813,0.00008412112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024964463,0.000079901874,0.0001426912,0.00019964881,0.00029182466,0.00063403416,0.0025832492,0.00005186019,0.000002657825],"category_scores_gemma":[0.00007482257,0.00006330211,0.000042219417,0.00027148685,0.00035966624,0.000872324,0.000522129,0.00027039635,0.0000020854136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327798,0.000052170348,0.002291989,0.0000041726826,0.000038207116,0.000003976456,0.0011244115,0.00009915351,0.00031494052,0.9723507,0.0005360608,0.023174888],"study_design_scores_gemma":[0.002604636,0.0008295381,0.007885812,0.0008270696,0.00005135557,0.004996105,0.0031457513,0.68575466,0.00077897275,0.061560493,0.23073575,0.000829865],"about_ca_topic_score_codex":0.00001522851,"about_ca_topic_score_gemma":0.000040133396,"teacher_disagreement_score":0.9107902,"about_ca_system_score_codex":0.0000135557275,"about_ca_system_score_gemma":0.00012631423,"threshold_uncertainty_score":0.6114006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007253077,0.0023335791,0.98671436,0.0010251603,0.00061561016,0.00039576882,0.000012046658,0.000026744921,0.0016236342],"genre_scores_gemma":[0.7483921,0.00019758812,0.25103524,0.0000900937,0.00017037275,0.00010229681,0.0000052312357,0.0000035178848,0.0000035492267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981933,0.00015974884,0.00062959624,0.0002252761,0.00056306605,0.00022900604],"domain_scores_gemma":[0.99713314,0.00070073555,0.00041118634,0.0006507991,0.000975513,0.00012865337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026644242,0.00011811988,0.00022371816,0.00031512056,0.00037351262,0.00028445254,0.004337571,0.00007438886,0.000003757007],"category_scores_gemma":[0.00009120277,0.00010134658,0.00010705756,0.00091207115,0.00019824447,0.0006053282,0.0005219055,0.00026142746,0.0000017853636],"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.000017576045,0.00012113328,0.0019099093,0.0000069613393,0.000032611108,0.0000014276761,0.004272883,0.0016453223,0.000008679365,0.9858033,0.00037164456,0.005808573],"study_design_scores_gemma":[0.0013952904,0.0009589614,0.005676277,0.0013583013,0.00006252699,0.00016699612,0.012226317,0.19535269,0.0003021715,0.65983146,0.121761225,0.0009077667],"about_ca_topic_score_codex":0.000027550084,"about_ca_topic_score_gemma":0.00005967055,"teacher_disagreement_score":0.741139,"about_ca_system_score_codex":0.00004309316,"about_ca_system_score_gemma":0.00008453648,"threshold_uncertainty_score":0.8060358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004091781,0.00046507345,0.98683196,0.00083669287,0.0017002147,0.004011789,0.0000017503221,0.000080192876,0.001980525],"genre_scores_gemma":[0.91394573,0.000028171145,0.08221666,0.0001369476,0.001253114,0.002380052,0.0000024672577,0.000012335659,0.000024522067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971195,0.00050705724,0.0009011289,0.00024503082,0.00072013383,0.000507151],"domain_scores_gemma":[0.99641645,0.00085984974,0.0010349097,0.0006978888,0.0007473797,0.00024350143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003396608,0.00019600081,0.00030230163,0.00022108037,0.0007869077,0.0005420882,0.004018872,0.000094984316,0.0000016440289],"category_scores_gemma":[0.00004111482,0.00015701227,0.00013218945,0.0005055127,0.0003097779,0.000843866,0.0005810825,0.0002107193,8.189296e-7],"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.000026835374,0.00017324135,0.0021024274,0.000006989928,0.000047917256,0.0000017838547,0.00038443142,0.53977245,0.000020047484,0.4401789,0.00022391904,0.017061073],"study_design_scores_gemma":[0.000518756,0.00013794874,0.00037048853,0.000301485,0.000011019463,0.00030947634,0.00044905566,0.9881969,0.000029667644,0.00009030603,0.009399561,0.00018533958],"about_ca_topic_score_codex":0.000020850926,"about_ca_topic_score_gemma":0.000012523654,"teacher_disagreement_score":0.90985394,"about_ca_system_score_codex":0.000116452065,"about_ca_system_score_gemma":0.00011024643,"threshold_uncertainty_score":0.7468131},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53502,0.005570353,0.4563579,0.00067297457,0.00033267058,0.0006119043,0.0000289871,0.00010260595,0.0013026461],"genre_scores_gemma":[0.95339835,0.00042722412,0.04609482,0.0000036927636,0.00003448418,0.000017955941,0.000010583895,0.000006164086,0.0000067352667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988416,0.00008715322,0.0007189657,0.00008877035,0.00018240562,0.000081126906],"domain_scores_gemma":[0.99829346,0.0006222162,0.0004629568,0.0002922893,0.0002893254,0.000039762657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012254902,0.00008419797,0.00030577873,0.00043036617,0.00010859844,0.00007045701,0.00058990513,0.00004689983,0.0000011886585],"category_scores_gemma":[0.00007900166,0.000077391014,0.000034316214,0.0003413136,0.00021396755,0.00032650374,0.00011547511,0.00016281976,3.0786222e-7],"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.00020923815,0.00028651638,0.072403096,0.00029690543,0.0011091796,9.728469e-7,0.003355473,0.801475,0.023994906,0.05874449,0.00038337475,0.037740868],"study_design_scores_gemma":[0.0001860374,0.00008450486,0.002632679,0.00021532382,0.000040240135,0.000020907872,0.00021717293,0.99580365,0.00013755495,0.00049214007,0.00010179971,0.00006797211],"about_ca_topic_score_codex":0.000028593939,"about_ca_topic_score_gemma":0.00004963927,"teacher_disagreement_score":0.41837838,"about_ca_system_score_codex":0.000027029402,"about_ca_system_score_gemma":0.00001776994,"threshold_uncertainty_score":0.3155914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044206172,0.0012736134,0.9524718,0.00028521547,0.00070004544,0.0001992126,0.0000044701983,0.00007083425,0.00078867277],"genre_scores_gemma":[0.5521348,0.0006197281,0.44717035,0.000005542159,0.00004952735,0.000011797416,9.474529e-7,0.00000466416,0.0000026191856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990847,0.00008133361,0.00049107947,0.000057401005,0.00019230491,0.00009317339],"domain_scores_gemma":[0.99839973,0.0005782037,0.00033227637,0.00022913437,0.00042438688,0.000036275374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870596,0.000072632996,0.00016337141,0.00012732283,0.00015988821,0.000059997805,0.0011619744,0.000045711917,0.000003000234],"category_scores_gemma":[0.000055664554,0.00006468654,0.000058352398,0.0001865777,0.0001851737,0.00027174153,0.00006802779,0.00015930676,2.0263317e-7],"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.00008402951,0.000097014956,0.004285418,0.00009612956,0.0004361533,9.440241e-7,0.00075312296,0.49313572,0.034876116,0.20333499,0.0022339246,0.26066643],"study_design_scores_gemma":[0.00035698764,0.00009623626,0.00022686092,0.00023443,0.000027539298,0.00013274155,0.00035624154,0.98209023,0.008212639,0.0048074275,0.0033262616,0.00013237448],"about_ca_topic_score_codex":0.000006140524,"about_ca_topic_score_gemma":0.000020053492,"teacher_disagreement_score":0.50792867,"about_ca_system_score_codex":0.00003590872,"about_ca_system_score_gemma":0.000041538784,"threshold_uncertainty_score":0.26378405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797254,0.005378748,0.0040046773,0.00064728176,0.0018817544,0.00012769033,0.0000022628847,0.000017321569,0.00821484],"genre_scores_gemma":[0.9939266,0.00020479543,0.0057182666,0.0000039844585,0.00013509065,0.0000026152936,1.9398146e-7,0.0000030330477,0.0000054569264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.0000630413,0.00033415022,0.000050559345,0.00025160355,0.00007024369],"domain_scores_gemma":[0.99926215,0.00024410998,0.00015082167,0.0001382606,0.00015545914,0.000049172726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000936077,0.000054213815,0.0001307024,0.00017096454,0.000057745194,0.00004305307,0.0005487945,0.00003198756,0.0000031509094],"category_scores_gemma":[0.000045938123,0.000044832253,0.000026463482,0.00020321309,0.0001785291,0.000108731794,0.00006871841,0.0001892912,4.921848e-7],"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.00008813609,0.00015646884,0.10958091,0.0001223135,0.00043062813,0.000011170455,0.0069918414,0.4614049,0.016893875,0.20198044,0.0021149896,0.20022434],"study_design_scores_gemma":[0.0038980776,0.00044001726,0.35167277,0.0041725915,0.000110064764,0.0031481495,0.0073029827,0.6030498,0.0021263605,0.005839588,0.017493475,0.00074612244],"about_ca_topic_score_codex":0.000026511481,"about_ca_topic_score_gemma":0.000058799826,"teacher_disagreement_score":0.24209186,"about_ca_system_score_codex":0.000026862659,"about_ca_system_score_gemma":0.000044821092,"threshold_uncertainty_score":0.18282063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005232208,0.00397036,0.9354361,0.021266079,0.0029693672,0.025457086,0.000009685379,0.00026036025,0.0053987233],"genre_scores_gemma":[0.52349675,0.000039739316,0.47160253,0.00018967081,0.00067949883,0.003945902,6.8111564e-7,0.000006205832,0.000039038394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982832,0.000145219,0.0005569124,0.00017154645,0.00047500676,0.00036811442],"domain_scores_gemma":[0.9978239,0.00052093895,0.0005060363,0.0005190216,0.0004787893,0.00015134219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025385285,0.00013397964,0.00023871771,0.00018140861,0.0005561068,0.00050029886,0.0036784823,0.00006724529,0.0000016191623],"category_scores_gemma":[0.00010163829,0.00010249171,0.000057456542,0.0005533178,0.00028548887,0.0009378407,0.0010864349,0.00016745101,0.0000014295164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069089045,0.000094558105,0.03905994,0.000043535172,0.000168145,0.0000027306808,0.00083017914,0.041970346,0.00003682317,0.81144017,0.03476659,0.07151789],"study_design_scores_gemma":[0.003046003,0.0010723047,0.035238773,0.0025197107,0.000069062866,0.002467346,0.0016178832,0.43108055,0.00010977796,0.05012968,0.4716026,0.0010463133],"about_ca_topic_score_codex":0.00000793467,"about_ca_topic_score_gemma":0.000020759315,"teacher_disagreement_score":0.7613105,"about_ca_system_score_codex":0.00006707307,"about_ca_system_score_gemma":0.00009787043,"threshold_uncertainty_score":0.68355966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02843155,0.00078342593,0.96602297,0.00041440027,0.00036384555,0.0031268306,0.0000018768,0.000014307125,0.00084081996],"genre_scores_gemma":[0.88994217,0.000032556018,0.10953751,0.000017680708,0.00008945395,0.00037530658,7.4163637e-7,0.000002571332,0.0000019907527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813634,0.00028171772,0.0008011049,0.00009801091,0.0004938437,0.0001889925],"domain_scores_gemma":[0.99797976,0.00018231665,0.0009853663,0.00041584554,0.0003692661,0.00006746393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029565596,0.00007821516,0.00017299107,0.00022262287,0.00016666592,0.00010207154,0.0023829537,0.000035842513,0.0000020159816],"category_scores_gemma":[0.000059526516,0.000066969755,0.000051315317,0.0004880864,0.00019660177,0.0023726367,0.00040027822,0.00013161075,9.901793e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013224393,0.00014519108,0.033589955,0.000019446155,0.00001562638,3.4686238e-7,0.0013164091,0.0018087241,0.00037560824,0.95475996,0.000004267843,0.00795126],"study_design_scores_gemma":[0.002487883,0.00047886343,0.095859736,0.0035795548,0.00002922112,0.00091435306,0.0032732815,0.80668736,0.0011177375,0.078761354,0.0062264977,0.0005841299],"about_ca_topic_score_codex":0.000012288848,"about_ca_topic_score_gemma":0.0000068729046,"teacher_disagreement_score":0.87599856,"about_ca_system_score_codex":0.000095928066,"about_ca_system_score_gemma":0.000106887615,"threshold_uncertainty_score":0.44281605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04362852,0.0010224247,0.9484501,0.0004250131,0.0039843135,0.0004935057,0.000018563032,0.000094330295,0.0018832287],"genre_scores_gemma":[0.9813799,0.00012613153,0.018083332,0.000015426907,0.00034511706,0.000030214209,0.0000068776317,0.0000065629624,0.000006403762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911445,0.00004286551,0.00046185157,0.0000642096,0.00020558343,0.00011105184],"domain_scores_gemma":[0.99890065,0.0002403276,0.00029218206,0.00012728976,0.00038812653,0.00005140594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084486336,0.000088210116,0.00013652454,0.00020510341,0.00026470723,0.00026556215,0.00037238526,0.000055959234,9.769791e-7],"category_scores_gemma":[0.000064389096,0.00007702611,0.000031030704,0.00015093514,0.000070489805,0.0008347382,0.000030790354,0.00014294063,7.800557e-7],"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.000023469054,0.000010667856,0.0010648494,0.000053635056,0.0000353655,1.270465e-7,0.00017804702,0.9758802,0.00018736307,0.01760274,0.00025365115,0.0047099027],"study_design_scores_gemma":[0.00032102634,0.000059751597,0.00013149793,0.00027072674,0.000010616721,0.00006954294,0.0003405111,0.986826,0.00007804655,0.00004606191,0.011767036,0.00007918023],"about_ca_topic_score_codex":0.000005906363,"about_ca_topic_score_gemma":0.000011256552,"teacher_disagreement_score":0.9377514,"about_ca_system_score_codex":0.00004602705,"about_ca_system_score_gemma":0.00003533917,"threshold_uncertainty_score":0.31410336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034803744,0.039358843,0.9148906,0.0057464256,0.0015960983,0.0005183428,0.000011450181,0.00007795821,0.0029965742],"genre_scores_gemma":[0.85140514,0.0080459025,0.13924459,0.0005688477,0.00051396864,0.00004430718,0.00002107951,0.000014076449,0.00014209482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553144,0.0012747409,0.0016060204,0.00038486242,0.00077310146,0.00042984684],"domain_scores_gemma":[0.99119556,0.0034754407,0.0017301948,0.0014373552,0.0019491544,0.00021227899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008056923,0.00028022128,0.00065518514,0.0002394435,0.0012539858,0.0006498,0.0049943603,0.00012671783,0.000012502864],"category_scores_gemma":[0.0002540501,0.00024451563,0.00017394849,0.0010306243,0.0005292218,0.0008266553,0.0015150794,0.000362236,0.000005317488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017766838,0.00026238424,0.008119064,0.00013825284,0.0004300193,4.983874e-7,0.003913793,0.11535956,0.0009536376,0.73951536,0.008949329,0.12218044],"study_design_scores_gemma":[0.002087739,0.00032421979,0.0078026736,0.002737502,0.00011708005,0.00026354668,0.00033586612,0.3231631,0.000009464909,0.0066342354,0.6556328,0.00089178653],"about_ca_topic_score_codex":0.000012840645,"about_ca_topic_score_gemma":0.0010686978,"teacher_disagreement_score":0.8166014,"about_ca_system_score_codex":0.00009643471,"about_ca_system_score_gemma":0.00014869803,"threshold_uncertainty_score":0.9971057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060098764,0.0011467782,0.9336812,0.0010201286,0.002729053,0.000540193,0.000023105473,0.00010370836,0.00065705733],"genre_scores_gemma":[0.8148591,0.0000847141,0.18464766,0.000018131315,0.00028384145,0.000024910143,0.000015583735,0.000013912113,0.000052151703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988571,0.00007413242,0.0005262568,0.0001234564,0.0002530492,0.00016604637],"domain_scores_gemma":[0.99811757,0.00039281772,0.00036371758,0.00026233,0.000782596,0.00008097758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098097,0.00012931324,0.00019901354,0.00018418614,0.00037367333,0.00014472741,0.00072689523,0.000061660416,0.0000024988751],"category_scores_gemma":[0.000060615523,0.00010312514,0.00005729845,0.00022856946,0.00019858203,0.00055813027,0.00006439293,0.00019639432,0.0000012875244],"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.000034841632,0.000026636006,0.0007913482,0.000014727204,0.00007653422,0.0000012529758,0.00017995243,0.97891295,0.0022598759,0.016385544,0.00018100235,0.0011353227],"study_design_scores_gemma":[0.00080498226,0.00006759758,0.0007194093,0.000269019,0.000019653295,0.00026535988,0.0002743095,0.99387926,0.00006684978,0.00032650243,0.003166753,0.00014027693],"about_ca_topic_score_codex":0.000007711185,"about_ca_topic_score_gemma":0.000106634994,"teacher_disagreement_score":0.7547603,"about_ca_system_score_codex":0.000044824814,"about_ca_system_score_gemma":0.00007288335,"threshold_uncertainty_score":0.4205321},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17433736,0.0037154257,0.8192497,0.0017763169,0.00025611205,0.00009229914,0.0000052120654,0.000011925599,0.00055564183],"genre_scores_gemma":[0.9816106,0.0009054576,0.017367147,0.000013152534,0.000081975,0.0000030377,6.070947e-7,0.0000035828734,0.000014440539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936235,0.000025321402,0.0003597825,0.00004737635,0.00013005946,0.00007508871],"domain_scores_gemma":[0.9992828,0.00029121197,0.00015778937,0.00007933669,0.00016566114,0.000023231138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966515,0.000051114555,0.0001386215,0.00017860997,0.000069565496,0.000041925632,0.00031261923,0.000021655496,0.0000017417951],"category_scores_gemma":[0.000027674725,0.00003396613,0.000036360427,0.00012739764,0.00010955066,0.00029314824,0.00003910055,0.00002823653,8.5219824e-8],"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.0001027151,0.0001056644,0.16854215,0.00024668925,0.0007516474,0.0000065243476,0.0030156577,0.67643464,0.02740157,0.038911164,0.0007404265,0.08374113],"study_design_scores_gemma":[0.00051334704,0.000052096464,0.0017987951,0.001251734,0.000029764933,0.000075165575,0.0012925861,0.9937738,0.00015243074,0.00059136224,0.0003677952,0.000101121375],"about_ca_topic_score_codex":0.0000065739137,"about_ca_topic_score_gemma":0.000019235766,"teacher_disagreement_score":0.80727327,"about_ca_system_score_codex":0.000022794986,"about_ca_system_score_gemma":0.000012628316,"threshold_uncertainty_score":0.13850987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093029246,0.00782886,0.8664262,0.024597965,0.0025839817,0.00038596801,0.0000028763864,0.00007103862,0.0050738226],"genre_scores_gemma":[0.98624337,0.0012614172,0.011934042,0.0001749368,0.00035541397,0.0000067569954,1.8089041e-7,0.000004038762,0.00001984887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997938,0.000417649,0.0007364218,0.00019092012,0.00047029444,0.00024674204],"domain_scores_gemma":[0.99768364,0.0009034298,0.0006287065,0.00039767224,0.00026372465,0.00012284123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033526984,0.00011067561,0.00026091578,0.00013757077,0.0002888376,0.00028670713,0.0022170783,0.000052061216,0.0000027533254],"category_scores_gemma":[0.00006128497,0.00007082847,0.000051005358,0.00034669603,0.00026135484,0.0007608786,0.0005924114,0.00016155594,0.0000014466225],"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.00002599051,0.000041743584,0.0585827,0.0000065679747,0.000060324845,0.000022030126,0.00035315673,0.0025911776,0.00017068424,0.8128786,0.000980849,0.12428615],"study_design_scores_gemma":[0.0022924736,0.00026098426,0.035032764,0.0044427575,0.000020325782,0.0011219529,0.00041213087,0.93824077,0.000019797992,0.013389356,0.004409859,0.00035681212],"about_ca_topic_score_codex":0.00001673177,"about_ca_topic_score_gemma":0.00003972008,"teacher_disagreement_score":0.93564963,"about_ca_system_score_codex":0.000083723404,"about_ca_system_score_gemma":0.00012992336,"threshold_uncertainty_score":0.411992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64387727,0.016503233,0.33078402,0.003080747,0.0008960765,0.00047084634,0.00007070705,0.00024257842,0.0040745228],"genre_scores_gemma":[0.94514596,0.0039948155,0.050702475,0.000016509379,0.00009801224,0.000010379786,0.000002908583,0.0000068152385,0.000022119928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912953,0.00006430148,0.0004032601,0.00008581339,0.00020125658,0.00011583292],"domain_scores_gemma":[0.99862856,0.00045119095,0.00024462573,0.00030882022,0.00031854195,0.000048272814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055123155,0.00009216333,0.00020260626,0.0002584643,0.0002407543,0.00008685501,0.001065281,0.000043548167,0.000007366781],"category_scores_gemma":[0.000029222665,0.00006343626,0.000056408757,0.00030846297,0.00022724169,0.00051929033,0.00012119718,0.000086604916,5.8350236e-7],"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.00020821662,0.00007712358,0.10715971,0.00025911705,0.005302651,0.0000058960695,0.003473547,0.17102882,0.03508032,0.13997608,0.0026172127,0.5348113],"study_design_scores_gemma":[0.0016356764,0.00039156238,0.008644889,0.0026276598,0.00046388176,0.00043386084,0.00053793046,0.9542381,0.0048485645,0.015212491,0.010112385,0.0008529519],"about_ca_topic_score_codex":0.0000022561776,"about_ca_topic_score_gemma":0.0000051601232,"teacher_disagreement_score":0.7832093,"about_ca_system_score_codex":0.000067736,"about_ca_system_score_gemma":0.00002203816,"threshold_uncertainty_score":0.25868556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49911612,0.010634488,0.34052104,0.0119689945,0.008936312,0.0005287249,0.0000061061905,0.00013700499,0.12815121],"genre_scores_gemma":[0.966531,0.000610046,0.032215867,0.00015533702,0.00043796838,0.000004598025,5.440494e-7,0.000003072515,0.000041572534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983521,0.00018829487,0.0005594733,0.00015509906,0.00052119646,0.00022384258],"domain_scores_gemma":[0.99838334,0.00023117784,0.0004151026,0.00051038794,0.00038993763,0.00007005913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023066576,0.00008842666,0.00017015093,0.00019229011,0.00030925195,0.00027520797,0.004088681,0.000041695614,0.0000071372256],"category_scores_gemma":[0.000017770324,0.000072220086,0.000043013628,0.0005316117,0.0003152554,0.00088597886,0.00070041564,0.00018491136,0.000011142331],"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.000055459877,0.00028469085,0.29380864,0.0000251992,0.00011095345,0.00003373991,0.005060749,0.013636958,0.000040354906,0.58191025,0.004297302,0.10073571],"study_design_scores_gemma":[0.000558117,0.00026575377,0.07355817,0.00064241,0.000005853239,0.00060720736,0.00053404004,0.88584876,0.000018830931,0.0013356201,0.03645192,0.00017334237],"about_ca_topic_score_codex":0.000009695837,"about_ca_topic_score_gemma":0.00013055399,"teacher_disagreement_score":0.87221175,"about_ca_system_score_codex":0.00007071711,"about_ca_system_score_gemma":0.00010947212,"threshold_uncertainty_score":0.7597855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5245227,0.006026236,0.4679333,0.0004314563,0.0002881261,0.00011900944,0.000002201633,0.000021725928,0.0006552291],"genre_scores_gemma":[0.8277133,0.0008916268,0.17136842,0.0000052106266,0.0000059913577,0.000001920341,2.4575348e-7,0.0000022024954,0.0000110779165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992577,0.00010139846,0.00034603203,0.00006007883,0.00015553618,0.00007925093],"domain_scores_gemma":[0.99922955,0.00032723736,0.0001269238,0.0001814098,0.000107996355,0.000026908747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009909172,0.000059076545,0.00022966563,0.00035646264,0.000029096027,0.000030718697,0.0005996506,0.000026707587,0.000002961154],"category_scores_gemma":[0.000029779547,0.00004320409,0.000036889953,0.00042122274,0.000082302766,0.00011893838,0.0001137945,0.00008804861,4.65332e-7],"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.000025174824,0.000032108346,0.07643933,0.000020320562,0.000443419,0.0000017645349,0.0006873074,0.8852097,0.008642309,0.015100142,0.00004262372,0.0133558465],"study_design_scores_gemma":[0.0007654775,0.0003765534,0.09037791,0.0009668949,0.00021343362,0.00011437129,0.0090144435,0.8908514,0.0015291026,0.0038289404,0.0015747239,0.00038678563],"about_ca_topic_score_codex":0.0000052324103,"about_ca_topic_score_gemma":0.0000066354683,"teacher_disagreement_score":0.3031906,"about_ca_system_score_codex":0.000028495167,"about_ca_system_score_gemma":0.000009438634,"threshold_uncertainty_score":0.17618117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81944966,0.03321405,0.12514502,0.0009810831,0.0037769827,0.0007612665,0.00000831612,0.00020474118,0.016458848],"genre_scores_gemma":[0.9673694,0.0013843396,0.031119915,0.00001582648,0.00005693126,0.0000066415378,0.0000044789726,0.00001133957,0.00003117823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861395,0.00017369512,0.00070623186,0.00009530496,0.00025912077,0.0001516904],"domain_scores_gemma":[0.9987619,0.0002949863,0.00031700375,0.000360044,0.000219872,0.000046199413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013094445,0.00010400837,0.0002232229,0.00026846566,0.00012579553,0.000110451016,0.0011524564,0.000057491987,0.0000052529863],"category_scores_gemma":[0.00002667033,0.00009705302,0.00004523328,0.00035266578,0.00009608706,0.00062470895,0.00011658904,0.00023074722,0.0000076167235],"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.000006558151,0.00001659199,0.009913787,0.000018220977,0.00003299344,0.0000013651016,0.00070573227,0.98342156,0.00014501874,0.0024887347,0.000078259,0.0031711701],"study_design_scores_gemma":[0.00054891227,0.000026352105,0.0019858864,0.00096633733,0.0000071982586,0.00013405582,0.0018753249,0.9932643,0.000013523715,0.000060964623,0.0009968405,0.00012031171],"about_ca_topic_score_codex":0.000012220689,"about_ca_topic_score_gemma":0.000076264594,"teacher_disagreement_score":0.14791965,"about_ca_system_score_codex":0.00019354727,"about_ca_system_score_gemma":0.000039983417,"threshold_uncertainty_score":0.39577076},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15973231,0.30228648,0.028135369,0.44488913,0.0406219,0.0008492045,0.000018659146,0.000072533585,0.023394413],"genre_scores_gemma":[0.9954047,0.001346723,0.0025701774,0.000049276736,0.00062141154,0.0000021634428,0.0000010774843,0.0000017991982,0.0000026702244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969096,0.0012822476,0.0005238596,0.0001406546,0.0009777431,0.00016589244],"domain_scores_gemma":[0.9970037,0.0012257609,0.0004320662,0.0008342309,0.00046833442,0.000035954563],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.012692441,0.000049610026,0.0001429813,0.00029736428,0.0008511926,0.00017605655,0.00898626,0.000016320551,2.686017e-7],"category_scores_gemma":[0.00009797339,0.000036007135,0.000028613844,0.0008324565,0.0003092548,0.00030687853,0.0044061565,0.00045543513,2.021632e-7],"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.000027806056,0.00021805504,0.026003782,0.00006726693,0.00010606113,0.000027353299,0.014068377,0.0090428265,0.000009818443,0.69841766,0.00554439,0.24646662],"study_design_scores_gemma":[0.00039642953,0.0002525797,0.010037989,0.00084221706,0.000008380797,0.0005931779,0.011947103,0.911503,0.0000043676073,0.03322105,0.031041814,0.00015186219],"about_ca_topic_score_codex":0.00015670562,"about_ca_topic_score_gemma":0.000089439396,"teacher_disagreement_score":0.9024602,"about_ca_system_score_codex":0.000081706436,"about_ca_system_score_gemma":0.00032686786,"threshold_uncertainty_score":0.9963756},"labels":[],"label_agreement":null}]}