{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":166,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":166,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"da50516e2911","filters":{"venue":"International Journal of Communication Systems"}},"results":[{"id":"W2128124921","doi":"10.1002/dac.596","title":"In‐building power lines as high‐speed communication channels: channel characterization and a test channel ensemble","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":208,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Power-line communication; Channel (broadcasting); Computer science; Power (physics); Line (geometry); Telecommunications; Measure (data warehouse); Noise (video); Electric power transmission; Electronic engineering; Electrical engineering; Physics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01718680845017628,"gpt":0.2675837275731772,"spread":0.2503969191230009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201501,0.0002176668,0.0003543,0.000644432,0.0001145731,0.0002324154,0.00113999,0.0001352018,0.00002190732],"category_scores_gemma":[0.0005170492,0.0002257476,0.00007492219,0.0003240302,0.00006907345,0.0009955332,0.0001416142,0.0004331151,0.00001621204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000189635,"about_ca_system_score_gemma":0.00005492401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101152,"about_ca_topic_score_gemma":0.00001317457,"domain_scores_codex":[0.9979006,0.0003256824,0.001070511,0.0001254879,0.0003873392,0.0001903935],"domain_scores_gemma":[0.9971919,0.0005383898,0.0005582367,0.0007603568,0.0008440666,0.0001070478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005364218,0.003610395,0.01018237,0.0002596895,0.00228391,0.0001210972,0.03410025,0.2302476,0.3384786,0.3667446,0.006104048,0.007330982],"study_design_scores_gemma":[0.01883599,0.001028792,0.045872,0.01000042,0.0002950371,0.004645494,0.01153682,0.4011805,0.05007344,0.028255,0.4239307,0.004345816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.964025,0.01553146,0.01108776,0.003438491,0.002534002,0.0004784777,0.00003383457,0.0001159071,0.002755076],"genre_scores_gemma":[0.9863335,0.01250573,0.0006735441,0.0001125927,0.0001038589,0.000025968,0.00004789166,0.0000438908,0.00015302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4178267,"threshold_uncertainty_score":0.9205719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107812461","doi":"10.1002/dac.843","title":"An energy‐efficient multipath routing protocol for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Multipath routing; Wireless Routing Protocol; Dynamic Source Routing; Routing protocol; Link-state routing protocol; Distributed computing; Zone Routing Protocol; Static routing; Geographic routing; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.01916217413206823,"gpt":0.3030994055959982,"spread":0.28393723146393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299251,0.0001961789,0.000296447,0.0002748116,0.0001922297,0.0006134458,0.003348631,0.0001204991,0.000001758151],"category_scores_gemma":[0.00003615443,0.0001756095,0.0001739507,0.0002399109,0.00005893096,0.000481548,0.0001921751,0.0002278739,0.00000141416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002216865,"about_ca_system_score_gemma":0.0000928827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001815579,"about_ca_topic_score_gemma":0.00001884338,"domain_scores_codex":[0.9969919,0.0004561411,0.001227685,0.0002358773,0.0008180731,0.0002702989],"domain_scores_gemma":[0.9948094,0.0004869117,0.001663539,0.0008588015,0.002077998,0.0001032983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005428558,0.0002839664,0.0003117936,0.000002192229,0.00003768314,0.00000671006,0.00009786388,0.9044658,0.0003432964,0.09087163,0.0003669887,0.003157781],"study_design_scores_gemma":[0.001361779,0.00008581766,0.0002474222,0.0002658732,0.000005576622,0.0001123887,0.00007505812,0.9820167,0.0004340694,0.00007737301,0.0151388,0.0001791521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004313637,0.00009579079,0.9875558,0.0003375213,0.0009995489,0.006107678,0.000003231945,0.00008379918,0.0005029923],"genre_scores_gemma":[0.9674244,0.000007013657,0.02537114,0.00007560615,0.0008602189,0.006135726,0.00001482529,0.00002612319,0.00008498062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9631107,"threshold_uncertainty_score":0.7161147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955555619","doi":"10.1002/dac.4068","title":"Multiobjective virtual machine placement mechanisms using nature‐inspired metaheuristic algorithms in cloud environments: A comprehensive review","year":2019,"lang":"en","type":"review","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Virtual machine; Distributed computing; Data center; Server; Virtualization; Metaheuristic; Live migration; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05492322179682044,"gpt":0.3513142969743593,"spread":0.2963910751775388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00192713,0.0004814471,0.001920428,0.0008306637,0.00008865714,0.0002394748,0.005084751,0.0002499832,0.000006434509],"category_scores_gemma":[0.0001259161,0.0003946064,0.0006221176,0.0004408864,0.00004943259,0.00009259045,0.001528461,0.001336338,0.00004178266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294581,"about_ca_system_score_gemma":0.00023156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006872902,"about_ca_topic_score_gemma":0.000001423545,"domain_scores_codex":[0.9935071,0.001882385,0.002411202,0.0004271949,0.00152124,0.0002508581],"domain_scores_gemma":[0.9934639,0.0007450527,0.003972369,0.001282123,0.0004383277,0.00009821397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004040282,0.0009228739,0.000003877528,0.006399223,0.004677107,0.0002532359,0.0007172605,0.1223644,0.000005760131,0.01779403,0.0007036327,0.8461182],"study_design_scores_gemma":[0.0008048217,0.0001137293,0.000003075118,0.0692452,0.0004046083,0.00047619,0.00009272095,0.1034529,7.520686e-7,0.00006790578,0.8249461,0.0003920139],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000007224625,0.8713046,0.1242273,0.0001478862,0.003154917,0.001014703,0.00001977215,0.0000199196,0.0001037342],"genre_scores_gemma":[0.001101451,0.9925228,0.005650994,0.0002478809,0.0002173697,0.00003492522,0.00003461339,0.00003887888,0.000151094],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8457261,"threshold_uncertainty_score":0.9998506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153965103","doi":"10.1002/dac.2315","title":"DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Wireless Routing Protocol; Wireless sensor network; Source routing; Distributed computing; Triangular routing; Sink (geography); Packet forwarding","retraction":null,"screen_n_in":null,"score":{"opus":0.05096756473966507,"gpt":0.3443068581358728,"spread":0.2933392933962077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002036124,0.0002014366,0.0003132854,0.0002007425,0.0001932724,0.0004861124,0.005195315,0.0001106164,0.000002699904],"category_scores_gemma":[0.00004701253,0.0001598734,0.00007928835,0.0002374364,0.00007666615,0.001242491,0.0005868151,0.0003540465,0.000003303841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001891599,"about_ca_system_score_gemma":0.0001096602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002837574,"about_ca_topic_score_gemma":0.000007227603,"domain_scores_codex":[0.997091,0.000482408,0.0009373986,0.0002432955,0.0008955165,0.0003503593],"domain_scores_gemma":[0.9944794,0.0005581996,0.001554474,0.001652623,0.001555949,0.000199417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001018974,0.0003745766,0.001261205,0.000005920161,0.0001077351,0.000003170616,0.0005806548,0.9858696,0.00005703689,0.008312958,0.0002382305,0.003086948],"study_design_scores_gemma":[0.001247453,0.0001680454,0.0002702869,0.0004118958,0.00001333819,0.0002504969,0.0002937168,0.9799593,0.00007772497,0.000002955879,0.01711352,0.0001912334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0140311,0.0001600287,0.9707166,0.0002229873,0.001015755,0.01349735,0.000009116507,0.00007632214,0.0002707206],"genre_scores_gemma":[0.9371486,0.000009652507,0.05525007,0.00006797566,0.0008469702,0.006577047,0.00003663799,0.00003003918,0.00003296025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9231175,"threshold_uncertainty_score":0.9654275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109348731","doi":"10.1002/dac.801","title":"VoIP over WLAN: voice capacity, admission control, QoS, and MAC","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Voice over IP; Computer science; Computer network; Quality of service; Telecommunications; Wireless Multimedia Extensions; The Internet; Wireless; Telephony; Call Admission Control; Wi-Fi; Wireless network; Wi-Fi array; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01709050806673384,"gpt":0.279890593338548,"spread":0.2628000852718142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008889364,0.0001007656,0.0001983113,0.0001435002,0.00008735187,0.0004555119,0.001572353,0.00006613341,0.000007625523],"category_scores_gemma":[0.00003494447,0.00008326759,0.00006743137,0.00009715526,0.0000413952,0.0006693624,0.0001861326,0.0002204004,0.000007710475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007292313,"about_ca_system_score_gemma":0.00005699123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002742007,"about_ca_topic_score_gemma":0.000016918,"domain_scores_codex":[0.9982981,0.0003001772,0.0006138631,0.0001040898,0.0005760893,0.0001076812],"domain_scores_gemma":[0.99784,0.0002987905,0.0007427919,0.0003887758,0.0006511384,0.00007845009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004196656,0.0007428236,0.08539497,0.00005695634,0.0006508614,0.0001018284,0.001303073,0.02841615,0.007131508,0.7718729,0.07296902,0.03094021],"study_design_scores_gemma":[0.004313904,0.0001891395,0.0613726,0.001106717,0.00002325595,0.0008770066,0.00005399737,0.2644605,0.0002634973,0.009798842,0.657157,0.000383569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07446097,0.009218347,0.8916792,0.01209045,0.003476216,0.001910867,0.00002159878,0.0000968071,0.007045596],"genre_scores_gemma":[0.9963188,0.0001630052,0.002533966,0.0001852772,0.0005915031,0.00004207611,0.000002775903,0.000006879839,0.0001556906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9218578,"threshold_uncertainty_score":0.4392512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576057564","doi":"10.1002/dac.3259","title":"Authorship verification using deep belief network systems","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Victoria","funders":"","keywords":"Computer science; Merge (version control); Bernoulli's principle; Gaussian; Word error rate; Basis (linear algebra); Artificial intelligence; Block (permutation group theory); Natural language processing; Data mining; Theoretical computer science; Algorithm; Information retrieval; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09828633259928508,"gpt":0.3644836674045816,"spread":0.2661973348052965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00387107,0.000140356,0.0002740407,0.0001871878,0.0006793104,0.001934318,0.005737888,0.000135383,0.00000564303],"category_scores_gemma":[0.000445938,0.0001326557,0.0001277166,0.0001168582,0.00008066616,0.001693791,0.0004343135,0.0003900018,0.00002930353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002515867,"about_ca_system_score_gemma":0.0001603071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001323095,"about_ca_topic_score_gemma":0.000004244558,"domain_scores_codex":[0.9971159,0.0006664798,0.001000339,0.0001640669,0.0008511263,0.0002021498],"domain_scores_gemma":[0.9934529,0.0002244149,0.002852749,0.001478049,0.0018533,0.0001385885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006761828,0.0001053317,0.01211222,0.00001567852,0.0003394105,0.000026631,0.001610542,0.1311155,0.000690338,0.8454764,0.001085727,0.007354599],"study_design_scores_gemma":[0.000931877,0.00006312626,0.01153522,0.000867132,0.00003511418,0.0006194124,0.000314118,0.9171084,0.0002333189,0.005628145,0.06230814,0.0003560578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01312815,0.005524485,0.9681215,0.002611927,0.008133923,0.0001954984,0.000004026901,0.00005364825,0.002226817],"genre_scores_gemma":[0.9870492,0.0002792901,0.01164362,0.00005395079,0.0007929284,0.000006604002,0.000007278164,0.00001178836,0.0001553017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9739211,"threshold_uncertainty_score":0.9996415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048767501","doi":"10.1002/dac.505","title":"IP router architectures: an overview","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Router; Terabit; Computer network; Next-generation network; Throughput; The Internet; Core router; Interconnection; IP forwarding; Telecommunications; Routing (electronic design automation); Routing protocol; World Wide Web; Wireless; Wavelength-division multiplexing","retraction":null,"screen_n_in":null,"score":{"opus":0.06361439239088819,"gpt":0.3388287412525275,"spread":0.2752143488616394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273067,0.0001194755,0.0002343336,0.0002967354,0.00008869115,0.0005692053,0.003390179,0.00006581535,0.00002411943],"category_scores_gemma":[0.00004770278,0.00009730521,0.0001463741,0.0001929318,0.00002824408,0.0008018225,0.0001894149,0.000258291,0.00003045773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001184778,"about_ca_system_score_gemma":0.00006625522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001118351,"about_ca_topic_score_gemma":0.00002988777,"domain_scores_codex":[0.9976261,0.0005537179,0.0008654482,0.0001319935,0.0006884758,0.0001343189],"domain_scores_gemma":[0.9969764,0.000168929,0.0007962123,0.0007848228,0.001166,0.0001076097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001979217,0.0006310863,0.006793023,0.00001683653,0.0008504292,0.000201431,0.008528137,0.09356143,0.0004529771,0.7557945,0.01005073,0.1229215],"study_design_scores_gemma":[0.001423681,0.0003185713,0.005310903,0.0009169529,0.0000168797,0.006340239,0.0006716317,0.2189879,0.00007931488,0.005993942,0.759545,0.0003950152],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07300539,0.01721417,0.8841985,0.00635623,0.009091821,0.0002736277,0.000004202912,0.0001246082,0.00973141],"genre_scores_gemma":[0.9949974,0.001188419,0.002350793,0.0004293428,0.000706088,0.000007329706,0.000003344805,0.000009849135,0.0003074091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9219921,"threshold_uncertainty_score":0.6299852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045365184","doi":"10.1002/dac.700","title":"On the design of bandwidth efficient signalling for indoor wireless optical channels","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Optical wireless; Computer science; Bandwidth (computing); Multipath propagation; Wireless; Optical wireless communications; Electronic engineering; Channel (broadcasting); Telecommunications; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03486985614496433,"gpt":0.2702440108190248,"spread":0.2353741546740605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248071,0.0001185698,0.0002446397,0.0002078008,0.00006227448,0.00008310493,0.001971873,0.00009041784,0.000007782266],"category_scores_gemma":[0.0003280995,0.00008594859,0.0001105882,0.000119802,0.0001133316,0.0001067984,0.00009358994,0.0003157533,0.000007650432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535253,"about_ca_system_score_gemma":0.00003236823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001413218,"about_ca_topic_score_gemma":4.123971e-7,"domain_scores_codex":[0.9983887,0.0001373485,0.0008258042,0.00006163889,0.0004671305,0.0001193794],"domain_scores_gemma":[0.9955314,0.002723328,0.0003914424,0.000490008,0.0008263663,0.00003741303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005994933,0.00009021839,0.000006423104,0.000006551553,0.0001550413,2.844462e-7,0.0002182794,0.8520138,0.003488136,0.1374422,0.0003619182,0.006157217],"study_design_scores_gemma":[0.0006512165,0.0001072656,0.00002523057,0.0004655073,0.00001604337,0.00001908028,0.0004233413,0.9509329,0.04246197,0.001031431,0.003741127,0.000124913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1415495,0.003407358,0.8475499,0.00520709,0.0006539399,0.0005498354,0.00001013415,0.000103411,0.0009688385],"genre_scores_gemma":[0.9908053,0.000699832,0.008270808,0.00003693267,0.00009613084,0.00005116327,0.00000301484,0.00002141225,0.00001546291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8492558,"threshold_uncertainty_score":0.3664264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017280665","doi":"10.1002/dac.853","title":"Integration of mobility and intrusion detection for wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobility model; Metric (unit); Mobile ad hoc network; Wireless ad hoc network; Waypoint; Intrusion detection system; Obstacle; Markov chain; Scheme (mathematics); Vehicular ad hoc network; Computer network; Wireless; Distributed computing; Network packet; Real-time computing; Data mining; Machine learning; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01300115501186895,"gpt":0.2634335626835559,"spread":0.250432407671687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359025,0.0001046525,0.0002338592,0.0001855722,0.00007410463,0.0001643881,0.001118672,0.00009346463,0.000001255825],"category_scores_gemma":[0.00006305844,0.00009374323,0.00009509028,0.0001646411,0.00006712072,0.0006816661,0.0001741885,0.00018799,4.742602e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001285341,"about_ca_system_score_gemma":0.00004181974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005869259,"about_ca_topic_score_gemma":0.00007152739,"domain_scores_codex":[0.9982011,0.0002272447,0.0009344548,0.0001317081,0.0004096426,0.00009580219],"domain_scores_gemma":[0.9962561,0.000455423,0.001261439,0.0004483607,0.001539211,0.00003949906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005196665,0.0005896257,0.00144744,0.00003604071,0.0002450934,0.000003631773,0.001015922,0.109891,0.04187892,0.1259154,0.001171259,0.7172861],"study_design_scores_gemma":[0.001095356,0.0002305223,0.00549774,0.0003730416,0.00001914062,0.0001271737,0.0001316906,0.9740044,0.004297378,0.004917359,0.009157631,0.0001485584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1162524,0.005043962,0.8770631,0.0003015446,0.000930341,0.0002587296,0.000002986903,0.00001955674,0.0001273805],"genre_scores_gemma":[0.9895196,0.001108447,0.009084272,0.00002265091,0.0001956112,0.000026697,0.000009046531,0.000008027147,0.00002567538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8732672,"threshold_uncertainty_score":0.3822738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978258815","doi":"10.1002/dac.684","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Mathematical optimization; Path (computing); Average path length; Convergence (economics); Routing (electronic design automation); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02630559418688871,"gpt":0.273776655301145,"spread":0.2474710611142563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884002,0.000111954,0.0002150153,0.0002086768,0.00003486062,0.00009134576,0.0005435509,0.00006453912,0.000001142775],"category_scores_gemma":[0.00004437732,0.0001121876,0.00008020408,0.0000967956,0.00001985113,0.0002121217,0.00004691577,0.0002537453,8.248309e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003018861,"about_ca_system_score_gemma":0.00006199635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001507026,"about_ca_topic_score_gemma":0.00004736938,"domain_scores_codex":[0.9989586,0.00004635833,0.0005685829,0.0000672104,0.0002292019,0.0001300116],"domain_scores_gemma":[0.998934,0.000217451,0.0002727023,0.0001835045,0.0003398921,0.000052402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001699266,0.00001821931,0.00004651256,3.296056e-8,0.00008411611,0.000007498493,0.0003639414,0.9885972,0.00009805059,0.002392777,0.0001419478,0.008232752],"study_design_scores_gemma":[0.0007728272,0.00006143178,0.0003113198,0.001033759,0.00001256898,0.0001106182,0.0006018739,0.9950489,0.0001020427,0.001512786,0.0003219334,0.0001099616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004859913,0.00197641,0.9920548,0.0001187249,0.0005320064,0.000162469,0.000003868583,0.00006713632,0.0002247311],"genre_scores_gemma":[0.983815,0.0001670589,0.01558596,0.00002429145,0.0003574638,0.00001094381,0.000008053281,0.00002314214,0.000008141637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.978955,"threshold_uncertainty_score":0.4574876,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W1582930193","doi":"10.1002/dac.2902","title":"Energy efficiency and traffic offloading in wireless mesh networks with delay bounds","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Quality of service; Efficient energy use; Wireless mesh network; Computer network; Wireless; Wireless network; Integer programming; Bounded function; Bandwidth (computing); Mathematical optimization; Telecommunications; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01017368377834638,"gpt":0.2284265357600941,"spread":0.2182528519817477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009871048,0.00008384858,0.0001726777,0.0002569255,0.00006450909,0.000333399,0.00130705,0.0000399369,5.247473e-7],"category_scores_gemma":[0.0000195732,0.00006832563,0.00003819036,0.0001544398,0.00004293107,0.0004477802,0.0001221425,0.0001862218,5.895812e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007756387,"about_ca_system_score_gemma":0.00004469159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001212852,"about_ca_topic_score_gemma":0.00005328865,"domain_scores_codex":[0.9986768,0.0002793488,0.0004439977,0.0001037964,0.0003943502,0.0001016883],"domain_scores_gemma":[0.9985895,0.0002685322,0.0004123106,0.0002988008,0.0003762534,0.00005460721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001840055,0.000328929,0.01007049,0.000009337814,0.0002715499,0.00006192024,0.002409259,0.3849103,0.0005114361,0.4608833,0.0004636799,0.1398959],"study_design_scores_gemma":[0.0006196006,0.00008012279,0.0006269073,0.0003163322,0.000004342396,0.000398692,0.00009136611,0.9962288,0.000009112893,0.00006508335,0.001472039,0.00008762082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3506667,0.001168089,0.6465642,0.0005561252,0.0004506563,0.00002966569,2.749953e-7,0.00001733576,0.0005469271],"genre_scores_gemma":[0.9989573,0.0004167015,0.0003832153,0.0001044357,0.00008873388,0.000003154641,0.000001371007,0.000005616424,0.00003951626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6482906,"threshold_uncertainty_score":0.3214974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766207463","doi":"10.1002/dac.3443","title":"A survey of overlay and underlay paradigms in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Underlay; Cognitive radio; Computer science; Computer network; Overlay; Throughput; Wireless; Transmission (telecommunications); Overlay network; Software-defined radio; Wireless network; Telecommunications; The Internet; Signal-to-noise ratio (imaging); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.05036733424563223,"gpt":0.3269766796008684,"spread":0.2766093453552362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824236,0.00008998818,0.0002829039,0.0001910816,0.0001119084,0.0004213481,0.001471356,0.0000469379,0.000001398494],"category_scores_gemma":[0.0003682456,0.0000831605,0.00005151819,0.00008828237,0.0001263834,0.0007052526,0.0002582919,0.0002331907,4.605371e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006789155,"about_ca_system_score_gemma":0.00007681386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008725681,"about_ca_topic_score_gemma":0.0003558674,"domain_scores_codex":[0.9983945,0.0004189008,0.0006177811,0.0001095673,0.0003531802,0.0001060831],"domain_scores_gemma":[0.9963662,0.0009377304,0.001312225,0.000426346,0.0009029821,0.00005451917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0005202073,0.000500368,0.6615021,0.00001250855,0.00112316,0.0001985144,0.004227867,0.02697327,0.0001390495,0.1006435,0.0008657771,0.2032937],"study_design_scores_gemma":[0.0009847202,0.00005296582,0.7413832,0.0006619567,0.000006573824,0.0001742083,0.00007984077,0.2559075,0.00002069342,0.0003974612,0.0002385645,0.00009233507],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4894433,0.01284953,0.488197,0.001791668,0.00186024,0.0002606505,0.00001197281,0.00001439232,0.005571275],"genre_scores_gemma":[0.997663,0.001819054,0.0003742323,0.00002942588,0.00008557519,0.000001176549,0.000003185023,0.000005568465,0.00001879505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5082197,"threshold_uncertainty_score":0.406307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311508997","doi":"10.1002/dac.5412","title":"A hybrid technique for the PAPR reduction of NOMA waveform","year":2022,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Companding; Computer science; Waveform; Reduction (mathematics); Transmission (telecommunications); Transmitter; Algorithm; Noma; Orthogonal frequency-division multiplexing; Real-time computing; Electronic engineering; Telecommunications; Mathematics; Channel (broadcasting); Telecommunications link","retraction":null,"screen_n_in":null,"score":{"opus":0.01977069109204243,"gpt":0.272631272604304,"spread":0.2528605815122615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008296125,0.00007801662,0.0001616665,0.0002351414,0.0001387555,0.00002555804,0.002131884,0.00002614287,0.00001088387],"category_scores_gemma":[0.00008882917,0.00006512851,0.000106127,0.0001232711,0.00007501236,0.0002044564,0.0002379164,0.0003321657,6.225065e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002794164,"about_ca_system_score_gemma":0.00003468059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001261313,"about_ca_topic_score_gemma":6.867686e-7,"domain_scores_codex":[0.9987459,0.00008657615,0.0006851365,0.00004487687,0.0003653437,0.00007221027],"domain_scores_gemma":[0.99778,0.0003359576,0.000635253,0.0006350396,0.0005992333,0.00001452619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001018257,0.00008884595,0.00005129128,0.00002066273,0.0004012672,0.000001070805,0.0005605702,0.8972451,0.03784815,0.03498775,0.003234533,0.02545895],"study_design_scores_gemma":[0.002147064,0.0003954599,0.0003908439,0.000407961,0.00007417916,0.002295329,0.0139882,0.174319,0.1998861,0.01802721,0.587579,0.0004897462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02316305,0.01912247,0.9489532,0.003400644,0.002389779,0.001150222,0.0001180435,0.0002062468,0.001496334],"genre_scores_gemma":[0.9932278,0.001841494,0.004448307,0.00000854579,0.00005463742,0.0003477528,0.00001472079,0.00001913538,0.00003760865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9700648,"threshold_uncertainty_score":0.3961606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497574042","doi":"10.1002/dac.2428","title":"Cryptanalysis of a dynamic ID‐based remote user authentication with key agreement scheme","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Computer science; Forward secrecy; Spoofing attack; Anonymity; Password; Computer security; Scheme (mathematics); Cryptanalysis; Key (lock); Authentication (law); Secrecy; Computer network; Cryptography; Public-key cryptography; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.01907552836826399,"gpt":0.3180970421640217,"spread":0.2990215137957577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389952,0.0001375978,0.0002737969,0.0004096657,0.00006581355,0.0001191383,0.002436783,0.00005340042,0.00002248226],"category_scores_gemma":[0.00012627,0.0001146205,0.0001164571,0.0003821563,0.00008614664,0.001270134,0.0001886524,0.0001932914,0.00001989945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002618609,"about_ca_system_score_gemma":0.0001386229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002611357,"about_ca_topic_score_gemma":0.000005275167,"domain_scores_codex":[0.9971629,0.0003384094,0.001040363,0.0001310638,0.001165062,0.0001621845],"domain_scores_gemma":[0.9943375,0.0002103248,0.002201057,0.001078518,0.002059812,0.0001127919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004450482,0.002566553,0.02201987,0.0001127599,0.002161776,0.000008705544,0.01056458,0.01322684,0.02123184,0.8992791,0.0001901192,0.02819284],"study_design_scores_gemma":[0.004678381,0.00037307,0.03195933,0.001803063,0.0002077897,0.0002498969,0.001004271,0.9136615,0.008339819,0.009691171,0.02730072,0.0007310361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01782297,0.0007234777,0.9787346,0.001439319,0.0002644456,0.0006654667,0.000005271575,0.00002338849,0.0003210834],"genre_scores_gemma":[0.8553343,0.00004303371,0.1444092,0.00005283198,0.00003749856,0.00004343484,0.00001025031,0.000009398625,0.00006013837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9004346,"threshold_uncertainty_score":0.4674087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526373655","doi":"10.1002/dac.2338","title":"Dynamic channel selection with reinforcement learning for cognitive WLAN over fiber","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cognitive radio; Reinforcement learning; Computer network; Throughput; Cognitive network; Wireless; Radio resource management; Wireless network; Channel (broadcasting); Wi-Fi; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01259768634059497,"gpt":0.2761848124745014,"spread":0.2635871261339064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189193,0.0001095088,0.0001610989,0.0002034747,0.00006411079,0.00005742586,0.0002221117,0.00005362363,0.00002036847],"category_scores_gemma":[0.00005806138,0.00009899501,0.00005115122,0.00009558984,0.00001666062,0.000710405,0.0000197438,0.0001802642,0.00001200367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003125204,"about_ca_system_score_gemma":0.00001956535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008227948,"about_ca_topic_score_gemma":0.000003933556,"domain_scores_codex":[0.9989989,0.00006617534,0.0004811699,0.00004834267,0.000270266,0.0001351777],"domain_scores_gemma":[0.9983567,0.0001685321,0.0004449498,0.00009421796,0.0008786515,0.00005694974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000843768,0.00002037962,0.0005744458,0.00001494601,0.0002575532,2.350315e-7,0.0006453961,0.9969404,0.0003743036,0.0003079342,0.00008702076,0.0006930055],"study_design_scores_gemma":[0.001401213,0.0001365668,0.0007550223,0.0007403902,0.00005667784,0.0001935803,0.001112239,0.9864573,0.0004358558,0.0000301361,0.008468833,0.0002121316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01366607,0.001499354,0.9825058,0.00004684606,0.0006509022,0.0003290005,0.000003831865,0.00005158517,0.001246589],"genre_scores_gemma":[0.9968643,0.0002145515,0.002166458,0.00001003,0.0002042367,0.00005386431,0.00004963256,0.00003334737,0.0004035886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9831982,"threshold_uncertainty_score":0.40369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512221035","doi":"10.1002/dac.2779","title":"A nodes scheduling model based on Markov chain prediction for big streaming data analysis","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Streaming data; Big data; Markov chain; Scheduling (production processes); Distributed computing; Real Time Streaming Protocol; Construct (python library); Data stream mining; Data mining; Computer network; The Internet; Mathematical optimization; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04481012434678847,"gpt":0.2989505884247519,"spread":0.2541404640779634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002796612,0.0001011129,0.0002104988,0.0006293699,0.000131088,0.0003320608,0.003762922,0.00004099886,4.220477e-7],"category_scores_gemma":[0.0002433862,0.00008799972,0.000138067,0.0002880043,0.0000199555,0.0000704193,0.0004274449,0.0001440596,0.000001222873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053634,"about_ca_system_score_gemma":0.00005355544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002701289,"about_ca_topic_score_gemma":0.000003976585,"domain_scores_codex":[0.9982147,0.0002498083,0.0005620146,0.000200174,0.0006659635,0.0001074002],"domain_scores_gemma":[0.9966843,0.0005671633,0.0007761241,0.001316744,0.0006015511,0.00005410438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002140182,0.00008496932,0.0004996062,0.000004898355,0.0003044503,4.082914e-7,0.0001175335,0.9609784,0.00001973505,0.0053048,0.0001329512,0.0325308],"study_design_scores_gemma":[0.0005392833,0.00004334649,0.0005728626,0.0001966631,0.00007147759,0.000004007399,0.00006766416,0.9958803,0.00001126236,0.0002117119,0.002326892,0.00007450696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02309681,0.0001387201,0.9731805,0.0021508,0.0006609784,0.0001081451,0.00001690112,0.00003801412,0.0006091932],"genre_scores_gemma":[0.9354895,0.00001073478,0.06392156,0.0001367235,0.0003245967,0.000006627079,0.00003073883,0.000007248142,0.00007226806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9123927,"threshold_uncertainty_score":0.6992508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09001436105111163,"gpt":0.3074328118247264,"spread":0.2174184507736148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133254,0.0001398942,0.0002630316,0.0002090573,0.00007750124,0.0002571236,0.002764777,0.00009020908,0.000004683117],"category_scores_gemma":[0.00005302326,0.0001305707,0.0001222635,0.00009958394,0.00005988102,0.0004150025,0.0001302732,0.0001852067,0.000002093623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005235172,"about_ca_system_score_gemma":0.0007025266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004864121,"about_ca_topic_score_gemma":0.000002372715,"domain_scores_codex":[0.9977186,0.0002829604,0.0009127078,0.000162145,0.0007403413,0.0001832117],"domain_scores_gemma":[0.9949638,0.0003507905,0.001233407,0.00073414,0.00241118,0.000306703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002026255,0.0004999221,0.0004114521,0.00000431328,0.0001819368,0.00005349387,0.0007313369,0.4506699,0.00005830611,0.4915203,0.02436543,0.03130091],"study_design_scores_gemma":[0.0008226033,0.0001205671,0.00001260008,0.0001197786,0.00001126699,0.00009338752,0.0001187809,0.9261401,0.000003358593,0.0002899532,0.07214034,0.0001272271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004206877,0.001648419,0.9916766,0.0007191877,0.003459918,0.0001001258,0.000004638639,0.00004663484,0.001923805],"genre_scores_gemma":[0.9744884,0.00004393496,0.02431234,0.0004328091,0.0005041352,0.00001497514,0.00004187629,0.00001471747,0.0001468344],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9740677,"threshold_uncertainty_score":0.5324517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485150649","doi":"10.1002/dac.2997","title":"Localization in terrestrial and underwater sensor‐based m2m communication networks: architecture,classification and challenges","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; Ontario Tech University; Seneca Polytechnic","funders":"","keywords":"Computer science; Underwater; Architecture; Wireless sensor network; Underwater acoustic communication; Artificial intelligence; Telecommunications; Computer network; Geology; Oceanography","retraction":null,"screen_n_in":null,"score":{"opus":0.07475452456771559,"gpt":0.268197250278016,"spread":0.1934427257103004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323595,0.0001641795,0.000278039,0.000390795,0.00005657063,0.0002345937,0.0006843678,0.0001330386,0.000001016923],"category_scores_gemma":[0.00003059687,0.0001531341,0.00003960763,0.0001304674,0.0001046624,0.0003872052,0.0001018769,0.0003071857,0.000002261848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001890299,"about_ca_system_score_gemma":0.00004196964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001222173,"about_ca_topic_score_gemma":0.0000884753,"domain_scores_codex":[0.9978169,0.0006359087,0.0009076697,0.0001153428,0.000394673,0.0001295238],"domain_scores_gemma":[0.9984594,0.0002653837,0.0004047244,0.0005067321,0.0002449585,0.0001187945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004310459,0.0002701048,0.01691348,0.00007763488,0.0004106582,0.00001037888,0.01039664,0.8824708,0.0006671259,0.003386328,0.0006737688,0.08429196],"study_design_scores_gemma":[0.003187135,0.00008320877,0.003269765,0.0007435985,0.00002825449,0.0001808759,0.005914576,0.8259311,0.0001367923,0.001097694,0.1591142,0.0003128416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2527927,0.2196412,0.4957391,0.02346966,0.001754842,0.001432826,0.00001638951,0.0003656982,0.004787525],"genre_scores_gemma":[0.9824146,0.01559975,0.001712966,0.00006106927,0.0001159108,0.0000225167,0.00003682216,0.00002777716,0.00000859968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7296218,"threshold_uncertainty_score":0.6244627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1811925492","doi":"10.1002/dac.2587","title":"Design and performance of an efficient rectenna incorporating a fractal structure","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Rectenna; Fractal antenna; HFSS; Fractal; Antenna (radio); Rectifier (neural networks); Energy harvesting; Computer science; Return loss; Patch antenna; Topology (electrical circuits); Electrical engineering; Electronic engineering; Telecommunications; Power (physics); Microstrip antenna; Physics; Antenna efficiency; Mathematics; Engineering; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01265279160354151,"gpt":0.2295742786721043,"spread":0.2169214870685627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003279387,0.0000685296,0.0001543944,0.0001675448,0.00002919375,0.00007053794,0.0003798653,0.00003870281,0.00001385151],"category_scores_gemma":[0.00002166343,0.00005699542,0.00003057435,0.00008187081,0.00003374431,0.0003170318,0.00002678676,0.0001400716,0.000001989111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003738499,"about_ca_system_score_gemma":0.00001659664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002606888,"about_ca_topic_score_gemma":7.364587e-7,"domain_scores_codex":[0.999087,0.0001082929,0.0004567988,0.00003917374,0.0002575039,0.00005121057],"domain_scores_gemma":[0.9987788,0.00008138677,0.0003478298,0.0001517566,0.0005961563,0.00004403135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007195848,0.00007412999,0.004917809,0.00003745927,0.000441307,0.000004053918,0.00177484,0.8026925,0.1771213,0.0005434841,0.00009738188,0.01222374],"study_design_scores_gemma":[0.0001912063,0.00005720974,0.00340538,0.0001370031,0.00001190274,0.0000788997,0.0003284637,0.9947419,0.0009140818,0.00005047682,0.00002586816,0.00005764236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9212956,0.0009398315,0.07741939,0.00004736536,0.0001407907,0.00007215072,0.000001929147,0.00001240739,0.00007048809],"genre_scores_gemma":[0.9925638,0.0001444755,0.007209483,0.000007540198,0.00005111228,0.000002362479,0.000003887999,0.000008827842,0.000008546057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1920494,"threshold_uncertainty_score":0.2324206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498617973","doi":"10.1002/dac.2785","title":"An efficient distributed routing protocol for wireless sensor networks with mobile sinks","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Network packet; Distributed computing; Overhead (engineering)","retraction":null,"screen_n_in":null,"score":{"opus":0.01458987321632121,"gpt":0.2971124017599049,"spread":0.2825225285435837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624092,0.0001863262,0.0003095385,0.0001740831,0.0001873153,0.0005824771,0.002993821,0.0001045175,0.000001529721],"category_scores_gemma":[0.00005517864,0.0001470445,0.0001062347,0.0002479723,0.00007316362,0.0003819496,0.0001565063,0.0002999017,0.000001687479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000176601,"about_ca_system_score_gemma":0.00007890761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001971619,"about_ca_topic_score_gemma":0.000005156835,"domain_scores_codex":[0.9973252,0.0005328824,0.0008980597,0.0002249862,0.0007715103,0.0002473587],"domain_scores_gemma":[0.9946116,0.0006454948,0.001473831,0.0009187812,0.002210589,0.0001397552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001126768,0.0002144819,0.0003773565,0.000004700917,0.00006309547,0.000002694549,0.0001946209,0.9793411,0.00009378311,0.01617026,0.00009157283,0.003333657],"study_design_scores_gemma":[0.001597502,0.0003441284,0.0002085418,0.0004199844,0.000008011125,0.0001305982,0.0001298686,0.9846969,0.0001963895,0.00001430627,0.01208168,0.0001720494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008822058,0.00002769782,0.9797785,0.0002554533,0.0004837678,0.01038721,0.000004679524,0.00007719563,0.0001634511],"genre_scores_gemma":[0.9571966,0.000003312499,0.0332265,0.00006282532,0.000396093,0.009053406,0.00002174134,0.00002331619,0.00001623914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9483745,"threshold_uncertainty_score":0.5996302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021763947","doi":"10.1002/dac.670","title":"Token bank fair queuing: a new scheduling algorithm for wireless multimedia services","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Fair queuing; Quality of service; Scheduling (production processes); Token bucket; Proportionally fair; Wireless network; Wireless; Network packet; Algorithm; Distributed computing; Round-robin scheduling; Dynamic priority scheduling; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01175003844050699,"gpt":0.2636861099291047,"spread":0.2519360714885978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003118668,0.0001491492,0.0002456105,0.0002151343,0.00006052456,0.0001423343,0.0009347277,0.00009382527,0.000005184044],"category_scores_gemma":[0.00002344813,0.0001536343,0.0001031097,0.0001347596,0.00002224841,0.0007041159,0.00005330135,0.0002192248,0.0000076055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003345092,"about_ca_system_score_gemma":0.00008030467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005241245,"about_ca_topic_score_gemma":0.00001738812,"domain_scores_codex":[0.9985758,0.00004002328,0.0007495357,0.00008793879,0.0003992532,0.0001474441],"domain_scores_gemma":[0.9981733,0.0001705727,0.0004663653,0.0002627015,0.0008231994,0.0001038731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001615477,0.0000230447,0.00004655588,0.00001281713,0.0001584455,0.000002090015,0.0007367327,0.9543192,0.0004298164,0.0007400188,0.00008093979,0.04343415],"study_design_scores_gemma":[0.001738451,0.00002680395,0.00005865798,0.0007392176,0.00002042167,0.00006571109,0.000553578,0.9876612,0.0009305987,0.0005719223,0.00747024,0.0001631866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.011927,0.00393699,0.9815963,0.0003616308,0.001634979,0.0002338386,0.00001312413,0.0001013727,0.0001947563],"genre_scores_gemma":[0.7724522,0.00127022,0.2253805,0.00003681879,0.0007141251,0.00001745984,0.00005372173,0.00004068273,0.0000342611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7605252,"threshold_uncertainty_score":0.6265026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009134105","doi":"10.1002/dac.506","title":"Virtual base stations for wireless mobile<i>ad hoc</i>communications: an infrastructure for the infrastructure‐less","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Base station; Wireless ad hoc network; Quality of service; Wireless Routing Protocol; Mobile ad hoc network; Routing protocol; Ad hoc wireless distribution service; Wireless network; Distributed computing; Protocol (science); Node (physics); Mobile IP; Correctness; Optimized Link State Routing Protocol; Wireless; Mobile computing; Routing (electronic design automation); Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.02599835202788226,"gpt":0.3130457417607179,"spread":0.2870473897328357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001757493,0.0002298518,0.000331405,0.0002722478,0.0005181351,0.0008113077,0.009762011,0.0001348719,0.0000080809],"category_scores_gemma":[0.0001962861,0.0001788819,0.0002228685,0.0003539588,0.0001877606,0.001636413,0.0005546813,0.0004583124,0.000002725937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002683007,"about_ca_system_score_gemma":0.0003328871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001724399,"about_ca_topic_score_gemma":0.00006070766,"domain_scores_codex":[0.9970658,0.0004811538,0.001241655,0.0002348945,0.0007258422,0.0002506907],"domain_scores_gemma":[0.9898596,0.002681192,0.001545546,0.002488224,0.003281998,0.0001434451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002938677,0.0002795638,0.0006032841,0.00001158499,0.0005953932,0.000003495025,0.004556204,0.2523952,0.0004440015,0.2296373,0.008982283,0.5021978],"study_design_scores_gemma":[0.001651595,0.0003287642,0.001036611,0.0001564494,0.00004932245,0.0002887943,0.003058358,0.5960577,0.00004832874,0.006546484,0.390533,0.0002446594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01573593,0.007664678,0.969605,0.003417207,0.002067902,0.001266652,0.00008489307,0.00005988463,0.00009788147],"genre_scores_gemma":[0.9376379,0.006907758,0.05362563,0.0004613184,0.000468159,0.0006651241,0.0001005598,0.00003343978,0.0001001087],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.921902,"threshold_uncertainty_score":0.9955956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3107066755","doi":"10.1002/dac.4658","title":"Modified spider monkey optimization—An enhanced optimization of spectrum sharing in cognitive radio networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Cognitive radio; Network packet; Scheduling (production processes); Optimization problem; Throughput; False alarm; Computer network; Handover; Radio spectrum; Real-time computing; Quality of service; Wireless; Algorithm; Mathematical optimization; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03602974748164497,"gpt":0.2872658492612096,"spread":0.2512361017795647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006791275,0.0001509997,0.0003688233,0.0003008842,0.00006081262,0.0002680261,0.001616985,0.00008047117,0.00001578874],"category_scores_gemma":[0.0001860743,0.0001551381,0.0001023979,0.0005062076,0.00005124095,0.001265118,0.0002284683,0.000330778,8.843467e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001356877,"about_ca_system_score_gemma":0.0000867407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006306078,"about_ca_topic_score_gemma":0.00001297519,"domain_scores_codex":[0.9976394,0.0003110361,0.001121905,0.0002241037,0.0005408316,0.0001627442],"domain_scores_gemma":[0.9970309,0.0002852784,0.001194435,0.0003227942,0.001044411,0.0001222294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009383568,0.00009414663,0.0003633259,0.000002325357,0.00008734377,0.00001060271,0.001295516,0.9917865,0.00005549518,0.004388257,0.00001383985,0.001808766],"study_design_scores_gemma":[0.001122243,0.0001263748,0.0004268198,0.0004661271,0.00001273295,0.00004611772,0.0003048588,0.9969098,0.0002602799,0.0001663569,0.00001930402,0.0001389934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496971,0.001220468,0.9803995,0.001501875,0.0004562836,0.0001933039,0.000002379777,0.00002792761,0.00122857],"genre_scores_gemma":[0.9810287,0.001023126,0.01744254,0.0001721865,0.0002892629,0.000003848437,0.00001631152,0.00001574937,0.000008278978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.966059,"threshold_uncertainty_score":0.6326347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972481902","doi":"10.1002/dac.4174","title":"Energy consumption optimization for self‐powered IoT networks with non‐orthogonal multiple access","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Time division multiple access; Data transmission; Computer network; Wireless; Transmission (telecommunications); Node (physics); Energy consumption; Energy harvesting; Internet of Things; Software deployment; Wireless network; Noma; Energy (signal processing); Telecommunications; Electrical engineering; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.01288679973913524,"gpt":0.2472382280049695,"spread":0.2343514282658343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004343666,0.0001658297,0.0002662904,0.000214204,0.00005499521,0.0002543711,0.001038097,0.0001243626,0.00002782835],"category_scores_gemma":[0.00002425977,0.0001537941,0.00008564672,0.0001076804,0.00002873847,0.0004829469,0.00006267421,0.0002190084,0.000002979996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001999945,"about_ca_system_score_gemma":0.00004755546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001732896,"about_ca_topic_score_gemma":0.00001763694,"domain_scores_codex":[0.9985206,0.00009641796,0.0006989795,0.000110705,0.0004148916,0.000158377],"domain_scores_gemma":[0.9973891,0.0005271634,0.0005979173,0.0003471606,0.001065535,0.00007310267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001059401,0.00003773705,0.009448166,0.00001710843,0.0003219811,0.000001516641,0.0000595143,0.9875762,0.00006800466,0.0009609922,0.0004592066,0.0009435569],"study_design_scores_gemma":[0.001473638,0.00005399914,0.001579671,0.0005277665,0.00002667485,0.00007939064,0.00002462894,0.9888874,0.00009137442,0.00001223311,0.007075881,0.0001673643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031871,0.001633835,0.8921008,0.00008170625,0.001895438,0.0002361682,0.000008375707,0.0001169509,0.0007396232],"genre_scores_gemma":[0.9850581,0.001209345,0.0130629,0.00004866462,0.0003734036,0.00004375225,0.00009783119,0.00005291626,0.00005303797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.881871,"threshold_uncertainty_score":0.6271541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1894410978","doi":"10.1002/dac.2931","title":"QoS‐aware energy‐efficient resource allocation in OFDM‐based heterogenous cellular networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Fractional programming; Quality of service; Telecommunications link; Scheduling (production processes); Subgradient method; Efficient energy use; Iterative method; Nonlinear programming; Computer network; Nonlinear system; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01921073358640745,"gpt":0.2424243628971997,"spread":0.2232136293107923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010724,0.0001559207,0.0002598995,0.0004386492,0.00003197918,0.0001020006,0.0008457152,0.0001145656,0.000003241998],"category_scores_gemma":[0.00006403265,0.0001622743,0.00007528655,0.0002610044,0.00003065399,0.0002451345,0.00005233519,0.0002370653,0.000005733885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007233139,"about_ca_system_score_gemma":0.00007084321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000670466,"about_ca_topic_score_gemma":0.00002031622,"domain_scores_codex":[0.9978791,0.0002833358,0.001043814,0.0001012618,0.000537632,0.0001548688],"domain_scores_gemma":[0.9978623,0.0001286472,0.0005199966,0.0004382656,0.0009357042,0.0001150609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003558876,0.000057832,0.0001712412,0.000005389784,0.00004828699,0.00001051571,0.0002966999,0.9975381,0.0003324243,0.0005509643,0.0004603615,0.0004925427],"study_design_scores_gemma":[0.0007731519,0.00003153684,0.00003112136,0.0003203705,0.000008905282,0.00005224347,0.0006159687,0.9852313,0.0008219095,0.00002331785,0.01194689,0.0001432622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0160203,0.006963656,0.9740006,0.0001928836,0.001583229,0.0001641109,0.000005099548,0.00007756407,0.0009926021],"genre_scores_gemma":[0.9980967,0.0001427223,0.001252922,0.00003933956,0.0003080993,0.00002189759,0.00007080544,0.00004016362,0.00002735413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9820764,"threshold_uncertainty_score":0.6617353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1776285172","doi":"10.1002/dac.2625","title":"Phased arrays in communication system based on Taguchi‐neural networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Taguchi methods; Computer science; Artificial neural network; Antenna (radio); Antenna array; Perceptron; Phased array; Radiation pattern; Multilayer perceptron; Artificial intelligence; Electronic engineering; Machine learning; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01237202710849414,"gpt":0.2296950857194196,"spread":0.2173230586109255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006219457,0.0001471262,0.0002456238,0.0004217892,0.00005190511,0.0001983043,0.001051769,0.00009979633,0.00002665087],"category_scores_gemma":[0.00004386428,0.0001380788,0.00008747269,0.0002003281,0.00003705682,0.0004772591,0.00002287474,0.0003821659,0.00002337907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003665722,"about_ca_system_score_gemma":0.00002297783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007558274,"about_ca_topic_score_gemma":0.000006055462,"domain_scores_codex":[0.9981432,0.0003361951,0.0008856423,0.00007467382,0.0004256221,0.0001346731],"domain_scores_gemma":[0.9980907,0.0002879127,0.0004126707,0.000498949,0.0006408456,0.00006894335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003243128,0.00005167457,0.0007019634,0.000006887444,0.00003883686,0.000002308387,0.0001243496,0.9958431,0.0002171834,0.001272934,0.0007716063,0.0009366843],"study_design_scores_gemma":[0.0009639051,0.00003319124,0.001225065,0.0005593176,0.000007357374,0.00002819105,0.0004851785,0.9959236,0.00005032082,0.0000249419,0.0005799126,0.0001190003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04845339,0.006130303,0.926069,0.001426704,0.002369239,0.0008569251,0.00001063884,0.0002578268,0.01442599],"genre_scores_gemma":[0.9977077,0.0003136905,0.001682296,0.00007828861,0.00009017423,0.00003958121,0.00003751194,0.00002859699,0.00002217557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9492543,"threshold_uncertainty_score":0.563069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3113300757","doi":"10.1002/dac.4702","title":"Design of quantum‐dot cellular automata‐based communication system using modular N‐bit binary to gray and gray to binary converters","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Cancer Research Society","keywords":"Converters; Computer science; Gray code; Quantum dot cellular automaton; Binary number; Electronic engineering; Modular design; CMOS; Dissipation; Power (physics); Algorithm; Cellular automaton; Arithmetic; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05313985511986732,"gpt":0.2824824556838798,"spread":0.2293426005640124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002172301,0.0002770198,0.0006093402,0.0006833835,0.0001679754,0.0003518524,0.005168786,0.0001078936,0.000003516114],"category_scores_gemma":[0.0001723481,0.0002731223,0.0001433968,0.0006627546,0.00009992033,0.0009099291,0.0009765027,0.0003095106,0.00002916239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003250175,"about_ca_system_score_gemma":0.0002607733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001789667,"about_ca_topic_score_gemma":9.56595e-7,"domain_scores_codex":[0.9951066,0.001533677,0.001586073,0.0003164141,0.001228046,0.0002291878],"domain_scores_gemma":[0.9946122,0.0005078884,0.001488089,0.001565904,0.001467228,0.0003586877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003388872,0.0003054642,0.0006284285,0.0001997678,0.0004575663,0.0001159926,0.006150417,0.5575317,0.4009582,0.03151732,0.0009383142,0.0008580045],"study_design_scores_gemma":[0.0009340519,0.0003595004,0.0003312163,0.001215501,0.00003632283,0.0001407797,0.0006693899,0.9869834,0.00793743,0.0000742749,0.001060433,0.0002577326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1857555,0.001968869,0.8066394,0.00435923,0.0005367585,0.0005841299,0.00001378385,0.0001118281,0.0000305576],"genre_scores_gemma":[0.9433432,0.00007906113,0.05603758,0.0004150727,0.00005444066,0.00001721539,0.00001604072,0.00003311645,0.000004272342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7575877,"threshold_uncertainty_score":0.9999721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995096481","doi":"10.1002/dac.765","title":"Performance analysis of hierarchical cellular networks with queueing and user retrials","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Macrocell; Computer science; Computer network; Queueing theory; Handover; Call blocking; Cellular network; Blocking (statistics); Layered queueing network; Wireless network; Wireless; Distributed computing; Telecommunications; Base station","retraction":null,"screen_n_in":null,"score":{"opus":0.02066187238396677,"gpt":0.2886400604757122,"spread":0.2679781880917454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293912,0.000103092,0.0003836924,0.0007733309,0.00008860666,0.0002388718,0.002973431,0.00006970989,0.000007361445],"category_scores_gemma":[0.00007846557,0.00008475,0.00009867174,0.0008946217,0.0001343639,0.0008815938,0.0005084464,0.0003893668,0.000001342331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001018701,"about_ca_system_score_gemma":0.00009636705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003434775,"about_ca_topic_score_gemma":0.00001897004,"domain_scores_codex":[0.9972177,0.000647878,0.000947135,0.0001258407,0.0009258519,0.0001356323],"domain_scores_gemma":[0.995581,0.0007901608,0.001068137,0.0009958297,0.001469926,0.00009492338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001385473,0.0001214508,0.02416414,0.000005676278,0.001595968,0.000003664324,0.0007680863,0.926944,0.0004927614,0.02407287,0.0002191333,0.02147369],"study_design_scores_gemma":[0.0005724049,0.0000552839,0.0171488,0.0002054304,0.00006497307,0.00003852204,0.00005472319,0.9769499,0.0003045251,0.00001235133,0.004496976,0.00009607508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4189315,0.004758376,0.5726509,0.002540127,0.0001583781,0.000141054,0.000001518691,0.00002052299,0.0007976331],"genre_scores_gemma":[0.9811205,0.003063396,0.01557183,0.00004278326,0.0001240353,0.000005743607,0.000006359412,0.000008182227,0.00005711723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5621891,"threshold_uncertainty_score":0.5525425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2510377198","doi":"","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Path (computing); Mathematical optimization; Average path length; Routing (electronic design automation); Convergence (economics); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.06935098984981178,"gpt":0.3724407295829069,"spread":0.3030897397330951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147225,0.0001127569,0.0002740853,0.0003822544,0.0001137183,0.000197209,0.0009034882,0.00003659872,0.00001086977],"category_scores_gemma":[0.00005246068,0.0001082666,0.0001424126,0.0003228862,0.00005678761,0.000273994,0.0001530496,0.0004092461,0.00000201849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003174233,"about_ca_system_score_gemma":0.000199994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353768,"about_ca_topic_score_gemma":0.0001279497,"domain_scores_codex":[0.9980688,0.0002602521,0.0008154018,0.000123931,0.0005080909,0.0002235437],"domain_scores_gemma":[0.9973025,0.0007389028,0.0005619205,0.0002755618,0.001038744,0.00008236809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004011886,0.0001092651,0.001820971,3.751162e-8,0.0001784542,0.00000224869,0.0006954986,0.925077,0.00003266699,0.04399058,0.000190023,0.02786316],"study_design_scores_gemma":[0.001230373,0.0001274744,0.001060333,0.0008218573,0.0000247354,0.00001375829,0.004791431,0.9614957,0.00004045196,0.02982779,0.0004336775,0.0001324336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01428948,0.0007108257,0.983879,0.0004377811,0.0001290672,0.0002558315,0.000006530987,0.00001426861,0.0002772004],"genre_scores_gemma":[0.9868474,0.00002441213,0.01219844,0.00001195812,0.0008121062,0.00003784666,0.00001845896,0.00001728933,0.00003211407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725579,"threshold_uncertainty_score":0.4414984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237504221","doi":"10.1002/dac.1095","title":"An energy‐efficient scheme in next‐generation sensor networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Computer network; Node (physics); Quality of service; Next-generation network; Efficient energy use; Scheme (mathematics); Broadband; Exploit; Wireless; Key distribution in wireless sensor networks; Wireless network; Telecommunications; Electrical engineering; Computer security; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.02649959064042883,"gpt":0.2793116255992595,"spread":0.2528120349588306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387201,0.0001548931,0.0002350353,0.0004795431,0.00008884226,0.0006532983,0.003263609,0.0001514924,0.000007623491],"category_scores_gemma":[0.00007551078,0.0001466176,0.00009197718,0.0003720155,0.00006216665,0.0008630588,0.0001918908,0.0005609804,0.000004484487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001253358,"about_ca_system_score_gemma":0.0000963464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001321988,"about_ca_topic_score_gemma":0.0001340005,"domain_scores_codex":[0.9973745,0.0004426466,0.0009777762,0.00020724,0.0007957577,0.000202125],"domain_scores_gemma":[0.9965804,0.0002088386,0.0008681751,0.001012861,0.001198012,0.0001316637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001133357,0.0001873778,0.0006378963,3.837096e-7,0.00002445022,0.00001513114,0.0001998667,0.8772984,0.01083457,0.1072292,0.0001296456,0.003431766],"study_design_scores_gemma":[0.0004550784,0.00003754604,0.0005805232,0.00006746905,0.00000258379,0.0001786246,0.00007511468,0.99199,0.0004743708,0.00003402836,0.005963582,0.0001410849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3985449,0.0008902723,0.5943033,0.000907785,0.004610345,0.00007342699,9.549542e-7,0.00004792505,0.0006211081],"genre_scores_gemma":[0.9700909,0.0002347043,0.0286719,0.000151641,0.0007748459,0.00000797444,0.00001526224,0.00001533589,0.00003740429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5715461,"threshold_uncertainty_score":0.629977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006990595","doi":"10.1002/dac.1183","title":"Analytical modeling of bidirectional multi‐channel IEEE 802.11 MAC protocols","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Mount Royal University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Distributed coordination function; Computer network; IEEE 802.11; Network allocation vector; Queue; Channel (broadcasting); Media access control; Scheduling (production processes); Wireless ad hoc network; Inter-Access Point Protocol; Throughput; Wireless network; Distributed computing; Wireless; Wi-Fi; Mathematical optimization; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07426398559003639,"gpt":0.3692407673341473,"spread":0.294976781744111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559237,0.0001266908,0.0002934826,0.0003004621,0.00007574698,0.0002383929,0.002938257,0.0001128832,0.00001220201],"category_scores_gemma":[0.0001023687,0.0001097391,0.0001740795,0.00021932,0.00006340323,0.0006676666,0.0002072757,0.0004654394,0.000006942018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005723868,"about_ca_system_score_gemma":0.00019568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009331518,"about_ca_topic_score_gemma":0.00002536633,"domain_scores_codex":[0.9975383,0.0002311074,0.00109205,0.0001389146,0.0008617271,0.0001378509],"domain_scores_gemma":[0.9959078,0.000231271,0.0009865458,0.0006344416,0.002133563,0.0001063179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002279427,0.00111817,0.00887531,0.00004122849,0.0005372561,0.00002328397,0.001223589,0.8624246,0.00407295,0.1116666,0.002374259,0.007414792],"study_design_scores_gemma":[0.000767855,0.00005130847,0.0003742636,0.0003698069,0.000005753292,0.0001674633,0.0000306937,0.9903693,0.0004650163,0.000780148,0.006506989,0.0001113775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01452488,0.0001350341,0.9763789,0.001170673,0.001865688,0.005211246,0.000008777325,0.00004023547,0.0006645345],"genre_scores_gemma":[0.9830748,0.00002449201,0.01496872,0.00004269125,0.0004179039,0.00138551,0.000002487015,0.0000111314,0.00007224381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.96855,"threshold_uncertainty_score":0.5460061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2884096875","doi":"10.1002/dac.3773","title":"On optimizing firewall performance in dynamic networks by invoking a novel<i>swapping window</i>–based paradigm","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Firewall (physics); Computer science; Stateful firewall; The Internet; Distributed computing; Application firewall; Computer network; Network packet; Entropy (arrow of time); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01418633484215256,"gpt":0.2638186931382118,"spread":0.2496323582960593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196978,0.0001394929,0.0002119453,0.0003426225,0.0001460021,0.0004477247,0.002052266,0.00008115568,0.000002916679],"category_scores_gemma":[0.00006048536,0.0001340481,0.00005761109,0.0004073214,0.0000648158,0.0009042651,0.0001251973,0.0003445356,0.000005701899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002841016,"about_ca_system_score_gemma":0.0001130405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489739,"about_ca_topic_score_gemma":0.000008111446,"domain_scores_codex":[0.998159,0.0001794194,0.0007622599,0.000165911,0.0005472263,0.000186184],"domain_scores_gemma":[0.9976944,0.0002955802,0.0009439614,0.000445515,0.0005588885,0.00006166707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008545409,0.0001612212,0.001194257,0.000006745837,0.00005249729,0.000003821876,0.001183068,0.9877926,0.0001835836,0.002298119,0.0004730037,0.006565678],"study_design_scores_gemma":[0.0008734454,0.0001011046,0.000447599,0.0012954,0.000003611726,0.00004180973,0.00003050374,0.9947793,0.00009010269,0.0001144441,0.0020908,0.0001318288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04132327,0.001420903,0.9537057,0.001263955,0.001160083,0.0001073453,0.000001152661,0.00004094061,0.0009766367],"genre_scores_gemma":[0.9865025,0.0002967727,0.01258695,0.0004081423,0.0001405257,0.000007509424,0.00001051527,0.00001316769,0.00003393464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9451792,"threshold_uncertainty_score":0.5466323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009032439","doi":"10.1002/dac.4364","title":"Message trust‐based secure multipath routing protocol for opportunistic networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Communication source; Encryption; Latency (audio); Routing protocol; Multipath propagation; Routing (electronic design automation); Multipath routing; Disjoint sets; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.08319818159866635,"gpt":0.3402505668820672,"spread":0.2570523852834009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137948,0.000167732,0.0003250433,0.00009940438,0.000136784,0.0004450658,0.002836506,0.0001037734,0.00001435061],"category_scores_gemma":[0.00008985509,0.0001475493,0.0001856714,0.0001503898,0.00004583117,0.0003972662,0.0002195087,0.0003406273,0.000004065895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008648418,"about_ca_system_score_gemma":0.0002940992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007736793,"about_ca_topic_score_gemma":7.795259e-7,"domain_scores_codex":[0.9976066,0.0002695019,0.001114405,0.0001829118,0.0006371501,0.0001894388],"domain_scores_gemma":[0.9958903,0.0005554186,0.001514002,0.0004738671,0.001331189,0.000235264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002078014,0.001066221,0.004579544,0.0001708991,0.001091737,0.0004099875,0.004590807,0.3492674,0.0002552765,0.4077438,0.08053259,0.1482137],"study_design_scores_gemma":[0.001822518,0.0001295965,0.00003009813,0.0002969883,0.00001242527,0.00005346466,0.00009835427,0.9272273,0.000009165706,0.0001858499,0.06999667,0.0001375771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003054619,0.00006664229,0.9835097,0.00390117,0.0005585286,0.01034722,0.00001222918,0.00005532014,0.001518642],"genre_scores_gemma":[0.9748431,0.00001174419,0.01777522,0.001046392,0.0006353718,0.005576255,0.00002175908,0.00001908417,0.00007106551],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9748126,"threshold_uncertainty_score":0.6016885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991640524","doi":"10.1002/dac.1209","title":"On the design of algorithms for mobile multimedia systems: A survey","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless broadband; WiMAX; Multimedia; Quality of service; The Internet; Wireless; Multicast; Bandwidth (computing); IMT Advanced; Mobile broadband; IP Multimedia Subsystem; Mobile QoS; Telecommunications; Multimedia Broadcast Multicast Service; Broadband networks; Wireless network; Internet access; Broadband; Service provider; Service (business); Mobile computing; Mobile technology; Mobile Web; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.08563129976662025,"gpt":0.2928997678773895,"spread":0.2072684681107692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478203,0.0001016048,0.0002133683,0.0001437027,0.00003564883,0.00003346354,0.0008933183,0.00005824251,0.000009533444],"category_scores_gemma":[0.0002115931,0.00007603076,0.00006347746,0.0001082853,0.0000429596,0.0001799326,0.00002745051,0.0001425036,0.000003847696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001040196,"about_ca_system_score_gemma":0.00002795101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000373396,"about_ca_topic_score_gemma":0.000002489834,"domain_scores_codex":[0.9984595,0.0003387841,0.0007274316,0.00005362978,0.0003337405,0.0000869237],"domain_scores_gemma":[0.9960135,0.001795525,0.0005915223,0.0003274835,0.001238627,0.00003339996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008883834,0.00004686196,0.00010105,0.000007560245,0.0001850486,4.881964e-7,0.000621104,0.9949024,0.00009428831,0.001806827,0.0009993049,0.001146235],"study_design_scores_gemma":[0.0004551953,0.0000953327,0.0003101953,0.0003041971,0.00001220817,0.00001657424,0.0003528747,0.9970137,0.00040355,0.0001940015,0.0007604629,0.00008173016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004159632,0.002517282,0.990923,0.00001868608,0.001468067,0.0005748717,0.00004335506,0.00002712477,0.0002680162],"genre_scores_gemma":[0.9835828,0.0008250403,0.01530304,0.000007530356,0.0000990054,0.0001083193,0.00002163855,0.00002725547,0.00002536207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9794232,"threshold_uncertainty_score":0.3100444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001985868","doi":"10.1002/dac.4325","title":"Distributed parallel algorithms for online virtual network embedding applications","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Scalability; Embedding; Distributed computing; Latency (audio); Virtualization; Algorithm; Parallel computing; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05047591075901323,"gpt":0.326580362996954,"spread":0.2761044522379407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220491,0.0001232395,0.000254728,0.00007209632,0.0001344901,0.0003061376,0.00293408,0.00006721835,0.000003291705],"category_scores_gemma":[0.0001339069,0.0001138357,0.0001572066,0.0002939297,0.00003327067,0.0004775885,0.0002876455,0.0002305112,0.000008228442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008286299,"about_ca_system_score_gemma":0.0000964877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007263685,"about_ca_topic_score_gemma":0.000001340297,"domain_scores_codex":[0.9982535,0.00012548,0.0008263558,0.0001556453,0.0004766566,0.0001623956],"domain_scores_gemma":[0.9967824,0.000579523,0.0008816812,0.0004184756,0.00119164,0.0001462368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008838875,0.0001688118,0.0005422182,0.000006737374,0.0003500608,0.00000530127,0.0004713958,0.7478232,0.00003067858,0.1795028,0.02113123,0.04987916],"study_design_scores_gemma":[0.000825069,0.0001070981,0.0002836943,0.00009382518,0.00001438059,0.0000522165,0.0001173302,0.6454431,0.000004454953,0.001603856,0.3513271,0.0001278821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002854137,0.003443969,0.9863082,0.008794256,0.0007102449,0.0002741286,0.00006701421,0.00007153907,0.00004525901],"genre_scores_gemma":[0.7561863,0.0007055113,0.2395511,0.0008993723,0.002293075,0.00008523027,0.0002189034,0.00002031664,0.00004022853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7559009,"threshold_uncertainty_score":0.54523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998854585","doi":"10.1002/dac.4309","title":"An SDN approach to route massive data flows of sensor networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Distributed computing; Scalability; Routing protocol; Network packet; Network architecture; Software-defined networking; Node (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.07304946422371607,"gpt":0.3090730002540853,"spread":0.2360235360303692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000834623,0.0001131029,0.0002848707,0.0001278164,0.00004906769,0.0002626447,0.007563746,0.0000621537,0.000002923261],"category_scores_gemma":[0.0001439637,0.00009932354,0.00006999776,0.0003099624,0.00002455929,0.0009363887,0.0008264601,0.000253891,0.000006956458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005103967,"about_ca_system_score_gemma":0.00009156134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004879366,"about_ca_topic_score_gemma":0.000002436069,"domain_scores_codex":[0.9978542,0.0003334887,0.0008207452,0.0001999289,0.0006721108,0.0001195445],"domain_scores_gemma":[0.9963573,0.0002385003,0.0008419274,0.001349437,0.001020152,0.0001926926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007982338,0.0001664496,0.001659363,0.000005410041,0.0002276082,0.00000869617,0.001642326,0.9670082,0.0001970597,0.0139158,0.006098948,0.008990312],"study_design_scores_gemma":[0.000377957,0.00009611448,0.0008336274,0.000103641,0.00001105256,0.00006088438,0.0002308032,0.9802566,0.00002031941,0.0000576172,0.01784777,0.0001036257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003621328,0.0012413,0.9898989,0.00363913,0.0007291763,0.0001452248,0.00002455068,0.00003477738,0.0006655931],"genre_scores_gemma":[0.9069397,0.0001759047,0.09177889,0.0005390046,0.000494788,0.000003785412,0.00004729502,0.00001051651,0.00001014442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033183,"threshold_uncertainty_score":0.9978058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993274576","doi":"10.1002/dac.496","title":"A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Computation; Controller (irrigation); Simple (philosophy); Flow control (data); Process (computing); Scheme (mathematics); Control (management); Algorithm; Control theory (sociology); Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0164899866431664,"gpt":0.2715358232506895,"spread":0.2550458366075231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342059,0.0001445359,0.0003254353,0.000270585,0.0001394659,0.0004794838,0.001475248,0.00008796468,0.000003033809],"category_scores_gemma":[0.0001144807,0.0001405719,0.00007545076,0.0002734854,0.00004449317,0.001119285,0.0001351886,0.000261566,0.000002503911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001452056,"about_ca_system_score_gemma":0.0001041478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006374135,"about_ca_topic_score_gemma":0.00004768657,"domain_scores_codex":[0.9978048,0.0005258927,0.0009577626,0.0001688675,0.0003433449,0.0001993419],"domain_scores_gemma":[0.9962093,0.000967935,0.000866271,0.0004614832,0.001406978,0.0000880389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004602398,0.0002499867,0.007813804,0.000009354582,0.000243951,0.000009313281,0.0005818522,0.837966,0.0001827535,0.053842,0.003347164,0.09529357],"study_design_scores_gemma":[0.003196706,0.00007015424,0.001689801,0.0002029677,0.00001058604,0.00007959398,0.000147226,0.9783935,0.000004379257,0.001528052,0.01454967,0.0001273982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01481622,0.00533547,0.9748632,0.003724304,0.0003886387,0.0005395215,0.000004596529,0.00003999172,0.0002880988],"genre_scores_gemma":[0.984217,0.001447272,0.01363986,0.000360346,0.0001349791,0.00008972876,0.00002268584,0.00001257375,0.00007547838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9694009,"threshold_uncertainty_score":0.5732358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250203847","doi":"10.1002/dac.976","title":"An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; Graph; K shortest path routing; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04909891223916364,"gpt":0.3075747939105659,"spread":0.2584758816714023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061548,0.0001206073,0.0002265802,0.0002352749,0.0001477981,0.0002692618,0.002805285,0.00005594085,0.000003357653],"category_scores_gemma":[0.0001115116,0.0001145992,0.00006759517,0.0002017868,0.00005472662,0.0006919833,0.0002247482,0.0002133012,0.00000368397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002273473,"about_ca_system_score_gemma":0.0001234335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002746748,"about_ca_topic_score_gemma":0.000001805833,"domain_scores_codex":[0.9975623,0.0003175209,0.0008500447,0.0001755585,0.0008730817,0.0002214191],"domain_scores_gemma":[0.9980364,0.0002765559,0.0006487228,0.0005878529,0.0003309982,0.0001194361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001608921,0.0003060974,0.0003792506,0.000002485179,0.00003952907,0.000003828539,0.0009630634,0.992853,0.00004355636,0.004088515,0.000277231,0.00102733],"study_design_scores_gemma":[0.0008033325,0.00009082265,0.0006649487,0.000104186,0.000003802478,0.0001324472,0.0001253526,0.9969619,0.000005198462,0.0001401595,0.0008618747,0.0001059946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003596929,0.0003978791,0.9944612,0.0003350502,0.0005065465,0.0003924796,0.000005457109,0.00003016118,0.0002743464],"genre_scores_gemma":[0.7209191,0.00005823055,0.2787496,0.00005929453,0.00009756746,0.00004007892,0.00003024493,0.00001016554,0.00003581284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7173221,"threshold_uncertainty_score":0.5212964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2555769812","doi":"10.1002/dac.3232","title":"An altruism‐based trust‐dependent message forwarding protocol for opportunistic networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Routing protocol; Overhead (engineering); Routing (electronic design automation); Altruism (biology); Protocol (science); Computer security; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05598276550066567,"gpt":0.3529024678468463,"spread":0.2969197023461806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002177338,0.0001742684,0.000316617,0.0001873698,0.0001476699,0.0004368621,0.003388683,0.0001101376,0.00002275639],"category_scores_gemma":[0.00004574834,0.0001217966,0.0001717023,0.0001009571,0.00006254713,0.0009942015,0.0001503538,0.0001722892,0.000004445027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001900956,"about_ca_system_score_gemma":0.0003188375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009032113,"about_ca_topic_score_gemma":0.000001808356,"domain_scores_codex":[0.9973203,0.0003485477,0.001131165,0.0002030797,0.000769094,0.0002278289],"domain_scores_gemma":[0.9951698,0.0007330419,0.001446237,0.0009056439,0.001518723,0.0002265944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001389799,0.001240827,0.004502466,0.00005048442,0.0008244933,0.0001800785,0.0005515442,0.03784709,0.0009498147,0.4372433,0.0188935,0.4963267],"study_design_scores_gemma":[0.002807417,0.0002357428,0.00009673955,0.0006049756,0.00001664001,0.0001528025,0.00005523361,0.9467423,0.00005222985,0.001763409,0.04727636,0.0001961537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007497123,0.00004415338,0.9866742,0.001681267,0.001039236,0.009234244,0.00001499377,0.00004925122,0.001187721],"genre_scores_gemma":[0.9794264,0.00002520024,0.01065718,0.0002427044,0.0005076643,0.008859648,0.000010632,0.00002022508,0.0002502878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9793515,"threshold_uncertainty_score":0.6297072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1942242957","doi":"10.1002/dac.2329","title":"Performance analysis of decision directed maximum likelihood MIMO channel tracking algorithm","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Channel (broadcasting); Computer science; Algorithm; MIMO; Tracking (education); Mode (computer interface); Doppler effect; Bit error rate; Word error rate; Telecommunications; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.01581395111622862,"gpt":0.2699696193771431,"spread":0.2541556682609145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009106304,0.0001384688,0.0004078008,0.0009313813,0.00004250843,0.00004785763,0.0007214227,0.00008742862,0.00001466084],"category_scores_gemma":[0.00008657936,0.0001331967,0.0001694906,0.0006544019,0.00002554632,0.0009890645,0.0000553783,0.0001886683,0.000006338666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002264916,"about_ca_system_score_gemma":0.00001979291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001715933,"about_ca_topic_score_gemma":0.000003914884,"domain_scores_codex":[0.9979492,0.000110174,0.001167919,0.00006543062,0.0005409137,0.0001662907],"domain_scores_gemma":[0.997191,0.0002423866,0.0007982492,0.0003724044,0.001305873,0.0000901504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003006718,0.0001000116,0.004703837,0.00001674526,0.001729764,0.0000012555,0.001253443,0.9266357,0.001067986,0.00008425867,0.0001137405,0.06426315],"study_design_scores_gemma":[0.0004415074,0.00002701402,0.009070873,0.0004789391,0.0002693124,0.00007563888,0.0004702476,0.9862233,0.001482143,0.00005395286,0.001234681,0.0001723498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176059,0.008016009,0.8710539,0.0000299324,0.002169545,0.0001520152,0.00002954779,0.00008620147,0.00085697],"genre_scores_gemma":[0.980078,0.001778406,0.01784774,0.00000536934,0.0002075504,0.000008229043,0.00003893389,0.00002636009,0.000009391352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8624721,"threshold_uncertainty_score":0.5431603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159329951","doi":"10.1002/dac.678","title":"Effects of control loop delay on the stability of a rate control algorithm","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Stability (learning theory); Control theory (sociology); Loop (graph theory); Computer science; Upper and lower bounds; Control (management); Control system; Domain (mathematical analysis); Process (computing); Mathematics; Mathematical analysis; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0106927413827747,"gpt":0.2410676361364338,"spread":0.2303748947536591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002156085,0.0001151347,0.0003518413,0.0001279423,0.00005485589,0.0000750242,0.002362299,0.00005415092,0.000004471233],"category_scores_gemma":[0.0002581984,0.00007811327,0.0001818806,0.0001385574,0.0001194788,0.0002695629,0.00006570794,0.0002494098,0.000005602402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001167201,"about_ca_system_score_gemma":0.0001942395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004013526,"about_ca_topic_score_gemma":0.000003274877,"domain_scores_codex":[0.9972835,0.0008874084,0.000943482,0.0001037915,0.0006742416,0.000107564],"domain_scores_gemma":[0.993672,0.00261213,0.001472895,0.0005876733,0.001597755,0.00005760611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008409931,0.001546117,0.0008744344,0.00004366266,0.002239571,0.00004201502,0.002365241,0.1709002,0.00737722,0.6863623,0.000382336,0.1270259],"study_design_scores_gemma":[0.04247737,0.002236743,0.009696526,0.003435582,0.0003325555,0.0004068066,0.0008180842,0.8998418,0.02037981,0.01302898,0.006617766,0.0007279183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06080708,0.002559818,0.9294461,0.005590101,0.0009427521,0.0004090617,0.00001090399,0.00001685786,0.000217324],"genre_scores_gemma":[0.998386,0.0001503367,0.001022234,0.000307675,0.00009992006,0.0000188183,7.260811e-7,0.00000581989,0.000008532215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9375789,"threshold_uncertainty_score":0.4389778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237498632","doi":"10.1002/dac.949","title":"Symbol detection in spatial multiplexing system using particle swarm optimization meta‐heuristics","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MIMO; Particle swarm optimization; Detector; Spatial multiplexing; Algorithm; Bit error rate; Reduction (mathematics); Computational complexity theory; Heuristics; Convergence (economics); Multiplexing; Swarm intelligence; Communications system; Channel (broadcasting); Mathematics; Telecommunications; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.05320433408325118,"gpt":0.2888840682822194,"spread":0.2356797341989682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834338,0.0001594986,0.0003593044,0.0003521977,0.0001010595,0.00006087593,0.000836117,0.0000934889,0.000004472546],"category_scores_gemma":[0.0001137138,0.0001594766,0.0001193084,0.0002359368,0.0000574593,0.000588818,0.00008718292,0.0003354203,0.000003174032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006535887,"about_ca_system_score_gemma":0.00003831961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001957504,"about_ca_topic_score_gemma":0.00002866707,"domain_scores_codex":[0.9978848,0.0002849067,0.001137101,0.00008689552,0.0004713135,0.0001349658],"domain_scores_gemma":[0.9978791,0.0002210103,0.0005830573,0.0004714505,0.000785956,0.00005935281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002328223,0.00003755718,0.0004909445,0.00001396148,0.0001972719,0.00001057134,0.0004016972,0.9947573,0.003006163,0.0003064208,0.000006978225,0.00074785],"study_design_scores_gemma":[0.00048768,0.00001746339,0.0002774681,0.0002109343,0.00004770914,0.0003423853,0.0004524716,0.9826204,0.01506733,0.00001823097,0.0003166973,0.0001411829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1063014,0.003104652,0.8893882,0.00003577873,0.0005767304,0.0001946707,0.000007621019,0.0001776903,0.0002132394],"genre_scores_gemma":[0.9781043,0.001596366,0.02010453,0.000007515865,0.0001077897,0.00002814321,0.000009244505,0.00003710512,0.000004986347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8718029,"threshold_uncertainty_score":0.6503268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3114904922","doi":"10.1002/dac.4691","title":"Distributed parallel genetic algorithm for online virtual network embedding","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Distributed computing; Virtual network; Embedding; Node (physics); Virtualization; Computer network; The Internet; Heterogeneous network; Orchestration; Cloud computing; Wireless network; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03433580126525338,"gpt":0.3005300169221476,"spread":0.2661942156568942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004226216,0.0001205583,0.0002547034,0.0000651802,0.00009682857,0.0002994345,0.002679262,0.00006285911,0.000003722827],"category_scores_gemma":[0.0001384294,0.0001098684,0.000151049,0.0002141287,0.00002789677,0.000376417,0.0002913159,0.0002132386,0.000006030439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007514552,"about_ca_system_score_gemma":0.00008935564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009173447,"about_ca_topic_score_gemma":0.000001112876,"domain_scores_codex":[0.9982396,0.0001628908,0.0008009035,0.0001389895,0.0004940679,0.0001635129],"domain_scores_gemma":[0.9971922,0.0005229444,0.0008044424,0.0003477616,0.0009955518,0.0001370885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005619794,0.0001056079,0.000517971,0.000003669787,0.0003141593,0.00001647884,0.0004379606,0.8184555,0.00001474148,0.0153629,0.02011623,0.1445985],"study_design_scores_gemma":[0.0008502363,0.0001440655,0.0007709246,0.0001201698,0.00001215269,0.00008471322,0.00007504252,0.9119932,0.000003736691,0.0007090958,0.08512326,0.0001134127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001045939,0.003265001,0.9891634,0.004979871,0.001272006,0.0001523292,0.00004647514,0.00005223249,0.0000227411],"genre_scores_gemma":[0.5335891,0.0006160182,0.4631319,0.0008299854,0.001701143,0.00001462099,0.00008139914,0.0000155615,0.00002026491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5325431,"threshold_uncertainty_score":0.497878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245964686","doi":"10.1002/dac.947","title":"An energy‐efficient localized topology control algorithm for wireless<i>ad hoc</i>and sensor networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Topology control; Computer science; Wireless sensor network; Wireless ad hoc network; Computer network; Topology (electrical circuits); Network topology; Mobile wireless sensor network; Wireless network; Distributed computing; Optimized Link State Routing Protocol; Logical topology; Overhead (engineering); Mobile ad hoc network; Algorithm; Routing protocol; Key distribution in wireless sensor networks; Wireless; Routing (electronic design automation); Network packet; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01351140436214524,"gpt":0.2666373892939119,"spread":0.2531259849317666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355082,0.0001501173,0.00035879,0.0001772505,0.0001782453,0.0001759312,0.002107745,0.0001182319,0.000003056306],"category_scores_gemma":[0.00002872241,0.0001356492,0.0001163261,0.0001232616,0.0001517722,0.0003651163,0.000143514,0.0002148622,0.00000138668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125498,"about_ca_system_score_gemma":0.0001010927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003581554,"about_ca_topic_score_gemma":0.000006313539,"domain_scores_codex":[0.99778,0.0005073252,0.0008393349,0.0001921341,0.0004817069,0.0001995443],"domain_scores_gemma":[0.9963141,0.0006526361,0.0008933134,0.0006585073,0.001330464,0.0001509737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002517727,0.0004732236,0.0004220906,0.000003861125,0.0005492269,0.00008141401,0.001241331,0.6799911,0.0002987079,0.07664095,0.002114741,0.2379316],"study_design_scores_gemma":[0.001937822,0.0001779953,0.0001341103,0.0000605065,0.00001177868,0.001074391,0.00007099873,0.963018,0.00003547489,0.0001752137,0.03317745,0.0001262569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006478888,0.007213485,0.9835075,0.0009836141,0.001503723,0.0001927826,0.000007263455,0.0000372876,0.00007547926],"genre_scores_gemma":[0.9605203,0.002288054,0.03625946,0.0004268133,0.0003814131,0.0000391555,0.000009490499,0.00001492556,0.00006043636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9540414,"threshold_uncertainty_score":0.5531616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1914281590","doi":"10.1002/dac.2940","title":"A novel energy‐efficient cross‐application‐layer platform with QoS‐security support","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Layer (electronics); Computer network; Energy (signal processing); Efficient energy use; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.03488672699328982,"gpt":0.2949185769487648,"spread":0.260031849955475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420601,0.0001365179,0.0002042987,0.0002575455,0.00009914744,0.0004852987,0.00332533,0.00005202702,0.000002319432],"category_scores_gemma":[0.00004520014,0.0001052365,0.00008741619,0.0002518783,0.00007052482,0.0001020659,0.0005705896,0.0001996249,0.00001847939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002574786,"about_ca_system_score_gemma":0.0001956115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001960373,"about_ca_topic_score_gemma":0.00001004392,"domain_scores_codex":[0.9976203,0.00008259132,0.0007198727,0.0001721831,0.001249818,0.000155242],"domain_scores_gemma":[0.9959944,0.000120269,0.0009833743,0.0008255928,0.001912906,0.0001634831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001060876,0.0005746639,0.001663456,0.000005698878,0.0003147631,0.00002377812,0.003319869,0.7778818,0.0001107837,0.2062687,0.003618362,0.006112023],"study_design_scores_gemma":[0.002128878,0.0001935312,0.001007074,0.0001641352,0.00001645188,0.0009328935,0.0005278318,0.7947378,0.0002028336,0.0007849131,0.1990581,0.0002455129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.13326,0.0006682912,0.8517751,0.002381528,0.001380205,0.000141156,0.000003917899,0.00007933823,0.01031047],"genre_scores_gemma":[0.9941242,0.00001129502,0.005028277,0.0002149195,0.0002978662,0.00001198424,0.000004315908,0.00001059521,0.0002965377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608642,"threshold_uncertainty_score":0.6179345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062371900","doi":"10.1002/dac.640","title":"QoS routing through alternate paths in wireless<i>ad hoc</i>networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02008044055838785,"gpt":0.2835944523336849,"spread":0.263514011775297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447602,0.0001762567,0.0003332812,0.0002119189,0.00008022911,0.0004508565,0.004542747,0.0001085656,0.000003920276],"category_scores_gemma":[0.00005917572,0.0001673997,0.0001376722,0.0003527119,0.00005632487,0.001539442,0.0005289699,0.000620033,0.00001860745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004912276,"about_ca_system_score_gemma":0.0001570119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001278578,"about_ca_topic_score_gemma":0.00005648473,"domain_scores_codex":[0.9970422,0.0003460887,0.00129425,0.0002018775,0.0008631664,0.0002524403],"domain_scores_gemma":[0.9966611,0.000279271,0.001351396,0.000855245,0.0007703367,0.00008263226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006325275,0.0002835787,0.00258316,0.000004294748,0.0001906548,0.0001882101,0.003418941,0.69583,0.000241329,0.2622378,0.0003667969,0.034592],"study_design_scores_gemma":[0.0106862,0.0004280518,0.005897217,0.006045067,0.00003717173,0.003258329,0.00124031,0.8745635,0.0007013368,0.02192964,0.0739698,0.00124335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05743766,0.0110842,0.9210956,0.002784347,0.004412828,0.0002043806,0.000002079141,0.00006505236,0.002913836],"genre_scores_gemma":[0.9852858,0.004966158,0.008934109,0.0003037535,0.0004258017,0.00001742266,0.000004934259,0.00001782118,0.00004420311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9278482,"threshold_uncertainty_score":0.8441629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481821562","doi":"10.1002/dac.2359","title":"Performance of transmitted reference pulse cluster ultra‐wideband systems with forward error correction","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Forward error correction; Convolutional code; Bit error rate; Ultra-wideband; TRPC; Electronic engineering; Error detection and correction; Wireless; Coding (social sciences); Interleaving; Computer network; Real-time computing; Algorithm; Telecommunications; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.01670067573893484,"gpt":0.2492470602067021,"spread":0.2325463844677673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338177,0.0001689526,0.0003454898,0.0004125979,0.00006607339,0.00005464984,0.001337474,0.000144707,0.0000126813],"category_scores_gemma":[0.0000522092,0.0001418676,0.00007195597,0.0002530224,0.0001012612,0.0007652628,0.00003270767,0.0004700154,0.00001190939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036175,"about_ca_system_score_gemma":0.00004473791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008696168,"about_ca_topic_score_gemma":0.00001758152,"domain_scores_codex":[0.9980539,0.000190641,0.001000646,0.00007160396,0.0004968054,0.0001864088],"domain_scores_gemma":[0.9972531,0.0003033202,0.0006332395,0.0007138797,0.00101833,0.00007816542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001478171,0.001104495,0.1948215,0.0004051329,0.003550062,0.000004786849,0.00822481,0.7153209,0.03567032,0.008093787,0.007140802,0.02418521],"study_design_scores_gemma":[0.0120506,0.001884353,0.07495147,0.01015923,0.0008474435,0.00864297,0.01352108,0.5482854,0.05338564,0.0001152769,0.2736365,0.002520086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9558271,0.007533842,0.02518469,0.0002824967,0.002013484,0.0003557384,0.00001814166,0.0001344659,0.008650114],"genre_scores_gemma":[0.9971989,0.001966606,0.0005050125,0.00001392007,0.0000907153,0.00004181535,0.00002605393,0.00003090626,0.0001260319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2664957,"threshold_uncertainty_score":0.5785195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2566309962","doi":"10.1002/dac.3247","title":"Resource allocation in heterogeneous cooperative cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Cognitive radio; Cooperative diversity; Resource allocation; Relay; Computer network; Diversity (politics); Wireless; Channel (broadcasting); Resource (disambiguation); Interference (communication); Wireless network; Constraint (computer-aided design); Harm; Transmission (telecommunications); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01823933163246986,"gpt":0.2698964932296766,"spread":0.2516571615972067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009870583,0.000122145,0.0002320627,0.00030467,0.00006441738,0.0002304024,0.001252949,0.00006533528,0.000006823998],"category_scores_gemma":[0.0001870182,0.00009021473,0.00008358683,0.0002459471,0.00007057939,0.000686764,0.0001633276,0.000200084,0.000008209283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002767864,"about_ca_system_score_gemma":0.00008520755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002399205,"about_ca_topic_score_gemma":0.00003083006,"domain_scores_codex":[0.9978782,0.0006137264,0.0007296595,0.0001567215,0.0004638435,0.0001578671],"domain_scores_gemma":[0.9968788,0.000919999,0.0006478294,0.0003099886,0.001170777,0.00007261426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008310142,0.0007338077,0.01100973,0.000005439786,0.001257393,0.0005562738,0.005950464,0.2772942,0.002443908,0.1583326,0.00296687,0.5386183],"study_design_scores_gemma":[0.01061721,0.0006923772,0.01837885,0.007497898,0.00005554493,0.004559237,0.001274751,0.9001686,0.002844078,0.002271679,0.05051773,0.001122028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04169194,0.003908414,0.9474455,0.004298497,0.0007720524,0.0001815748,0.000002899259,0.00002740853,0.001671752],"genre_scores_gemma":[0.9977845,0.001106281,0.000570686,0.0001656404,0.0002673648,0.000005643354,0.000003649045,0.00001004997,0.00008619083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9560925,"threshold_uncertainty_score":0.367885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018278884","doi":"10.1002/dac.1051","title":"An application of univariate marginal distribution algorithm in MIMO communication systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"MIMO; Computer science; Algorithm; Detector; Computational complexity theory; Bit error rate; Transmitter power output; Optimization problem; Mathematical optimization; Mathematics; Channel (broadcasting); Decoding methods; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008874788257901774,"gpt":0.2857819306395729,"spread":0.2769071423816711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369292,0.0001952823,0.0004207492,0.000473705,0.00006108517,0.0001074878,0.002485078,0.0001580667,0.000002832981],"category_scores_gemma":[0.0000523418,0.0002117599,0.00008935833,0.000396539,0.00008380267,0.001074266,0.00007040978,0.0004810573,0.000003916603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005508845,"about_ca_system_score_gemma":0.00005327082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00018674,"about_ca_topic_score_gemma":0.00001271882,"domain_scores_codex":[0.9969881,0.0005236482,0.001615204,0.0001196151,0.0005949596,0.000158504],"domain_scores_gemma":[0.995858,0.000207408,0.001142293,0.001354811,0.001354165,0.00008333909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000158764,0.0008229425,0.001984539,0.00004017238,0.0002265024,0.000005988204,0.001293096,0.6525878,0.0180711,0.1490075,0.000488003,0.1753136],"study_design_scores_gemma":[0.001358497,0.0001791523,0.01105194,0.0009264316,0.00003100937,0.0001381703,0.001075246,0.9577678,0.003452861,0.00341358,0.02021715,0.0003881029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03476864,0.009789124,0.9525832,0.0004830281,0.0003935042,0.0005511289,0.0001028461,0.0002048366,0.001123678],"genre_scores_gemma":[0.9796695,0.004833054,0.01498165,0.00001452409,0.00007275392,0.0000378845,0.0003551831,0.00002538854,0.00001005422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9449009,"threshold_uncertainty_score":0.8635318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2393582145","doi":"10.1002/dac.3146","title":"The offloading model for green base stations in hybrid energy networks with multiple objectives","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Base station; Base (topology); Computer network; Energy consumption; Distributed computing; Telecommunications; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01463846047788904,"gpt":0.2349744516533772,"spread":0.2203359911754882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785468,0.0001026028,0.0001442333,0.0001401029,0.00008798789,0.00008327559,0.0007347032,0.0000364175,6.658585e-7],"category_scores_gemma":[0.0001204034,0.00006317673,0.00005192442,0.00008216644,0.00005682883,0.0003410064,0.00003799332,0.000131888,3.664896e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002251277,"about_ca_system_score_gemma":0.00004665742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007013504,"about_ca_topic_score_gemma":0.0005122692,"domain_scores_codex":[0.9988819,0.0001122072,0.0005437348,0.00006705095,0.0002546276,0.0001404881],"domain_scores_gemma":[0.997003,0.001791212,0.0003071265,0.0002692589,0.0005843093,0.00004504488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005999969,0.00001344803,0.001216672,0.000001885629,0.0001132509,0.00000173704,0.0001216846,0.9845397,0.0001536359,0.005044384,0.000299066,0.00843448],"study_design_scores_gemma":[0.0007943045,0.00001879953,0.0004325531,0.0004978628,0.000007077735,0.00003482923,0.00008110301,0.9947847,0.00009631603,0.0003791476,0.002786135,0.00008714741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01644109,0.001857359,0.9804034,0.0004598141,0.0004364073,0.00008922783,0.00001508187,0.00003558756,0.000261998],"genre_scores_gemma":[0.9955423,0.001100718,0.002867557,0.00001571835,0.000182002,0.00006314971,0.000006803738,0.00002996559,0.0001917522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9791012,"threshold_uncertainty_score":0.2576272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}