{"meta":{"query_hash":"2d6df00fc6bc","filters":{"venue":"Journal of Computer Networks and Communications"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2d6df00fc6bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computer+Networks+and+Communications"},"results":[{"id":"W1973276154","doi":"10.1155/2008/583162","title":"Internal Clock Drift Estimation in Computer Clusters","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clock drift; Computer science; Clock synchronization; Timer; Network packet; Digital clock manager; Timing failure; Synchronization (alternating current); Clock domain crossing; Real-time computing; Clock skew; Vector clock; Tracing; Global Positioning System; Interrupt; CPU multiplier; Master clock; Clock signal; Synchronous circuit; Computer hardware; Computer network; Channel (broadcasting); Jitter; Telecommunications","score_opus":0.013998597076925553,"score_gpt":0.23937573617336852,"score_spread":0.22537713909644297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973276154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064908154,0.0017819444,0.9885084,0.0025627078,0.00037240214,0.000098023265,2.0737961e-7,0.00007338474,0.00011213494],"genre_scores_gemma":[0.6113037,0.0014241459,0.3868802,0.00026871604,0.00010334508,0.000002271614,0.00000143617,0.0000063185626,0.0000099168055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985729,0.00017493378,0.0006871554,0.00015956127,0.00019731118,0.000208165],"domain_scores_gemma":[0.99812794,0.00023263223,0.00046029116,0.0009069134,0.00019209887,0.00008011575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003817978,0.00014616874,0.00028203562,0.00030850005,0.00021064136,0.00013283253,0.0020729827,0.000097348464,0.0000026276102],"category_scores_gemma":[0.000010588468,0.00013470334,0.00007600994,0.0005501568,0.00019894369,0.0006976595,0.0011537549,0.00051794545,0.0000032410455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000822579,0.0001492359,0.005351042,0.0000055832056,0.000047150625,0.000030405708,0.00062502816,0.60502476,0.0000011300717,0.013063732,0.0062633287,0.36943042],"study_design_scores_gemma":[0.0004892176,0.00014949162,0.010176834,0.00011236759,0.0000052638643,0.0006180357,0.0000067469355,0.9849971,0.0000029805528,0.0015827914,0.0017308298,0.00012836249],"about_ca_topic_score_codex":0.0000087560165,"about_ca_topic_score_gemma":0.00001029635,"teacher_disagreement_score":0.60481286,"about_ca_system_score_codex":0.0000628775,"about_ca_system_score_gemma":0.00006487944,"threshold_uncertainty_score":0.5493043},"labels":[],"label_agreement":null},{"id":"W1993198472","doi":"10.1155/2014/597425","title":"Efficient Priority Access to the Shared Commercial Radio with Offloading for Public Safety in LTE Heterogeneous Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Macrocell; Preemption; Blocking (statistics); Heterogeneous network; Prioritization; Cellular network; Radio access network; Telecommunications; Wireless; Wireless network; Base station; Business","score_opus":0.020673561496569577,"score_gpt":0.2520568808766912,"score_spread":0.23138331938012163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993198472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053383843,0.0011686968,0.99163586,0.0011204915,0.00028100217,0.000381887,0.0000021972548,0.000026127498,0.000045350323],"genre_scores_gemma":[0.9629815,0.0003498382,0.036059953,0.00017115832,0.00038342905,0.000022773753,0.000007727797,0.000022262207,0.0000013408758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990508,0.00012520266,0.00045993502,0.0000828413,0.000079780155,0.00020145954],"domain_scores_gemma":[0.99870485,0.0003738028,0.00016942337,0.00049808115,0.00015994109,0.00009387363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695023,0.00012045536,0.00025012213,0.00009584818,0.00024845166,0.00019849536,0.00076981744,0.00005418768,8.12819e-7],"category_scores_gemma":[0.000013182592,0.000089757916,0.00004845888,0.00028478165,0.000033206605,0.00014206706,0.00018849297,0.00029568988,1.517664e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023752757,0.000021930078,0.00080758345,0.000007016503,0.0000308084,2.614779e-7,0.00016299676,0.97055334,5.222617e-7,0.00028142426,0.00034950348,0.02776088],"study_design_scores_gemma":[0.00050783594,0.00007304747,0.0034482328,0.00012938633,0.000015719526,0.000038912323,0.000008399478,0.98752505,5.095008e-7,0.000018243209,0.0081315935,0.00010310202],"about_ca_topic_score_codex":0.0000038365865,"about_ca_topic_score_gemma":0.00024766,"teacher_disagreement_score":0.95764315,"about_ca_system_score_codex":0.000077157325,"about_ca_system_score_gemma":0.000014825321,"threshold_uncertainty_score":0.36602217},"labels":[],"label_agreement":null},{"id":"W2010486721","doi":"10.1155/2014/720546","title":"Analysis of MIMO Receiver Using Generalized Least Squares Method in Colored Environments","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"MIMO; Colors of noise; Algorithm; Estimator; Noise (video); Mathematics; Minimum mean square error; Gaussian noise; Computer science; Covariance; Covariance matrix; Colored; Statistics; Channel (broadcasting); Telecommunications; White noise","score_opus":0.017222094163018137,"score_gpt":0.26631265573337853,"score_spread":0.24909056157036039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010486721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031437747,0.0012818845,0.9670844,0.000025798587,0.00006650836,0.000050150757,0.0000011053277,0.0000054207044,0.000046949328],"genre_scores_gemma":[0.70250106,0.00088508014,0.2965511,0.00001331712,0.00003348914,0.0000010722117,0.0000048995607,0.0000076157335,0.0000023688426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.0002074412,0.00047058926,0.00005000195,0.000063878884,0.000079090954],"domain_scores_gemma":[0.9991972,0.00016390759,0.00023622213,0.00032725334,0.000038875023,0.000036572066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032742397,0.00007350488,0.00031949917,0.00024212383,0.000039207524,0.000014849278,0.00023448044,0.00004805974,0.0000031051916],"category_scores_gemma":[0.0000050650815,0.00007185938,0.000069941925,0.00035482534,0.000030312767,0.00012070477,0.000065873515,0.00013461073,7.5024715e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054990787,0.000021225444,0.0027758663,0.000004243936,0.0002184677,1.8097182e-7,0.00015210515,0.988565,0.00018746576,0.00015088306,0.000018770332,0.007900286],"study_design_scores_gemma":[0.00032506944,0.000021044323,0.0068378416,0.000049552465,0.00017745866,0.0000050715935,0.000019497249,0.9918056,0.000011680372,0.00004756087,0.000638608,0.000061028546],"about_ca_topic_score_codex":0.000012310965,"about_ca_topic_score_gemma":0.000029807103,"teacher_disagreement_score":0.6710633,"about_ca_system_score_codex":0.00003886347,"about_ca_system_score_gemma":0.0000041993176,"threshold_uncertainty_score":0.29303405},"labels":[],"label_agreement":null},{"id":"W2015501914","doi":"10.1155/2009/682813","title":"A Cross‐Layer Framework for Efficient Streaming of H.264 Video over IEEE 802.11 Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Computer science; Computer network; Video quality; Wireless network; Network packet; Transcoding; Transmission (telecommunications); Real-time computing; Layer (electronics); Heterogeneous network; Application layer; Wireless; Telecommunications","score_opus":0.030335755895460757,"score_gpt":0.314397748184944,"score_spread":0.2840619922894832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015501914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034707777,0.004469803,0.95872253,0.0013722635,0.00047406167,0.00013962688,0.000001186439,0.00007612826,0.000036640635],"genre_scores_gemma":[0.7497671,0.00077712256,0.24895108,0.0003015492,0.00018340081,0.0000048032207,6.943004e-7,0.000007060633,0.0000071619056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998424,0.000106490035,0.00075783266,0.00020209062,0.00021960729,0.00028999418],"domain_scores_gemma":[0.9963926,0.00096177205,0.0007753146,0.0014201502,0.0003448632,0.00010528532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056832825,0.00018469905,0.00040834356,0.00018326938,0.00035739393,0.00027369102,0.0025492443,0.00018757633,0.0000016657681],"category_scores_gemma":[0.00003872281,0.00015262098,0.0002169434,0.00038719157,0.00014378194,0.00024396867,0.0005358977,0.00053924846,1.9698001e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030633026,0.00029942862,0.0011831409,0.000009170386,0.00006668,0.0000026499515,0.00025316371,0.5867601,0.000034665638,0.0866749,0.0020213379,0.32266414],"study_design_scores_gemma":[0.00048141892,0.0003565981,0.007846247,0.00047361056,0.000025659958,0.000040564977,0.000017761495,0.9749567,0.00008281491,0.01375743,0.0017936922,0.0001675283],"about_ca_topic_score_codex":0.0000036001554,"about_ca_topic_score_gemma":0.0000016260781,"teacher_disagreement_score":0.71505934,"about_ca_system_score_codex":0.000025775049,"about_ca_system_score_gemma":0.000044429107,"threshold_uncertainty_score":0.6223703},"labels":[],"label_agreement":null},{"id":"W2028698981","doi":"10.1155/2013/134760","title":"A Retroactive-Burst Framework for Automated Intrusion Response System","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Intrusion detection system; Mechanism (biology); Response time; Computer security; Intrusion; Data mining; Operating system","score_opus":0.016776659485347824,"score_gpt":0.2647463940455995,"score_spread":0.2479697345602517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028698981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017358644,0.0013104432,0.9764018,0.00367825,0.0007413195,0.0002849548,7.7574e-7,0.00017782205,0.000045982273],"genre_scores_gemma":[0.66176176,0.00038753435,0.33726385,0.00025603274,0.0002956978,0.000019630845,0.0000010391183,0.000008254822,0.000006164799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846584,0.00044367957,0.00055807806,0.00015326559,0.00017120272,0.00020796357],"domain_scores_gemma":[0.99660707,0.0012445273,0.00054534466,0.0009423589,0.0005156581,0.00014503887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094156154,0.00013530563,0.00027515853,0.00017038776,0.0005041387,0.0004000154,0.0013456672,0.00014731099,0.0000035513224],"category_scores_gemma":[0.00004567548,0.0001145533,0.00012312747,0.00039792666,0.00007832997,0.00072775746,0.00057178346,0.00046060552,0.0000038181943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005834649,0.00045142294,0.0002318963,0.000071683346,0.00032555746,0.000008159766,0.001995058,0.024611214,0.00017136821,0.48909986,0.032692228,0.44975808],"study_design_scores_gemma":[0.0003415827,0.00045407887,0.0031809027,0.00028323536,0.000016492642,0.00017340599,0.000053349504,0.9802656,0.000008452609,0.006065031,0.009034528,0.00012332956],"about_ca_topic_score_codex":0.000008909182,"about_ca_topic_score_gemma":0.0000016046873,"teacher_disagreement_score":0.9556544,"about_ca_system_score_codex":0.00007520318,"about_ca_system_score_gemma":0.00004949504,"threshold_uncertainty_score":0.46713483},"labels":[],"label_agreement":null},{"id":"W2031246246","doi":"10.1155/2011/157596","title":"Experimental Characterization of Ultra-Wideband Channel Parameter Measurements in an Underground Mine","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Non-line-of-sight propagation; Wideband; Path loss; Bandwidth (computing); Computer science; Channel (broadcasting); Range (aeronautics); Acoustics; Coherence bandwidth; Delay spread; Ultra-wideband; Remote sensing; Electronic engineering; Geology; Wireless; Telecommunications; Physics; Engineering; Aerospace engineering","score_opus":0.056188319552520356,"score_gpt":0.2516031729636779,"score_spread":0.19541485341115755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031246246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80393845,0.0018893358,0.19353878,0.00008433249,0.00012353597,0.00012027227,0.0000015148391,0.000032197127,0.00027160184],"genre_scores_gemma":[0.98942345,0.0011707381,0.009292983,0.00004159255,0.000029474573,0.0000103568,0.000013133148,0.000016320879,0.000001963213],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990506,0.00010755012,0.0005571219,0.00006784038,0.00009020903,0.00012664925],"domain_scores_gemma":[0.9988276,0.00008127936,0.00020232354,0.00072346977,0.000110316796,0.000055012984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021923443,0.00011508627,0.00024167067,0.00020067196,0.00005708952,0.00002296605,0.0007166666,0.00009119982,0.000006407695],"category_scores_gemma":[0.000004753953,0.00011300176,0.000045738117,0.00020508107,0.00010629752,0.00033410432,0.00007599611,0.00026808266,3.0630315e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051200454,0.010120517,0.20003219,0.0002070642,0.0018844052,0.000015472791,0.027319342,0.10126198,0.46806386,0.009837122,0.0006206654,0.18012536],"study_design_scores_gemma":[0.0043726126,0.0018868347,0.22009799,0.0008040288,0.00018960852,0.00033070266,0.0009896862,0.7246784,0.040907033,0.0035218277,0.001173086,0.0010481793],"about_ca_topic_score_codex":0.000010553615,"about_ca_topic_score_gemma":0.000037269772,"teacher_disagreement_score":0.6234164,"about_ca_system_score_codex":0.000035769564,"about_ca_system_score_gemma":0.000011468995,"threshold_uncertainty_score":0.4608078},"labels":[],"label_agreement":null},{"id":"W2040665326","doi":"10.1155/2014/940130","title":"Survivable Network Design and Optimization with Network Families","year":2014,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Survivability; Scheme (mathematics); Variety (cybernetics); Simple (philosophy); Telecommunications network; Random graph; Network simulation; Computer network; Distributed computing; Theoretical computer science; Artificial intelligence; Mathematics; Graph","score_opus":0.010431091039573067,"score_gpt":0.20075802875324125,"score_spread":0.19032693771366818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040665326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067776674,0.007069596,0.99143773,0.00022397611,0.00012495145,0.00010139271,1.4572768e-7,0.000121144934,0.00024328096],"genre_scores_gemma":[0.18014018,0.014307609,0.80511624,0.00007876229,0.00032508207,0.0000045813567,0.0000019061789,0.00002220208,0.0000034511247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991514,0.00010847919,0.0003264251,0.00008363439,0.00008773382,0.00024229077],"domain_scores_gemma":[0.9985529,0.0006901756,0.0001284209,0.00044422143,0.000105500796,0.0000787858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041749727,0.00014797738,0.00028216705,0.000046405723,0.00021036279,0.000087856984,0.0003703624,0.00009013104,0.000001396331],"category_scores_gemma":[0.000008768063,0.00011984599,0.000025806508,0.0002811744,0.00018277277,0.0002079168,0.00018168293,0.00038085142,2.2389452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012448472,0.000008525239,0.0003848315,0.000005432778,0.000050888677,6.412707e-7,0.000015246017,0.9558719,2.4723104e-7,0.0044827946,0.0014526511,0.03771441],"study_design_scores_gemma":[0.00025735097,0.0001844439,0.0004655469,0.00013331241,0.00003444031,0.00005166699,0.000013920594,0.9899436,3.2649845e-7,0.0026133275,0.006164507,0.0001375431],"about_ca_topic_score_codex":6.7320536e-7,"about_ca_topic_score_gemma":0.0000043583664,"teacher_disagreement_score":0.18632153,"about_ca_system_score_codex":0.0000148941035,"about_ca_system_score_gemma":0.000007253665,"threshold_uncertainty_score":0.48871773},"labels":[],"label_agreement":null},{"id":"W2043596652","doi":"10.1155/2012/151205","title":"System Health Monitoring Using a Novel Method: Security Unified Process","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Information and Cyber Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Asset (computer security); Process (computing); Dimension (graph theory); Security management; Risk management; Risk analysis (engineering); Business process; Computer security; Work in process","score_opus":0.05377658122995602,"score_gpt":0.34556293940568683,"score_spread":0.2917863581757308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043596652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004145258,0.0025918707,0.9914805,0.0007419286,0.00066055165,0.000087849105,6.491413e-7,0.00003938493,0.00025197087],"genre_scores_gemma":[0.6620207,0.00012883329,0.33739477,0.00017009901,0.00027920495,0.0000012721854,5.439164e-7,0.0000037314423,8.5431566e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986694,0.00021539586,0.00058927276,0.000069868496,0.00020441801,0.00025168265],"domain_scores_gemma":[0.99808455,0.0001365201,0.00064501475,0.00062532705,0.00028605436,0.00022253633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015253695,0.000110264875,0.00025201568,0.00011728819,0.0004206877,0.00019895757,0.0011271432,0.000053975145,4.7466472e-7],"category_scores_gemma":[0.0000044642734,0.00009693134,0.00006945055,0.0003328317,0.000031580665,0.0012551446,0.00043319684,0.0004366221,5.1488183e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018220684,0.0006460239,0.0074317795,0.00023988582,0.00021535395,0.0000014527618,0.03596268,0.041869514,0.000016960847,0.82193744,0.00043186275,0.09122885],"study_design_scores_gemma":[0.00029816685,0.00004253485,0.0018747912,0.00020991698,0.000011692085,0.00053608854,0.0004352571,0.9933398,0.000008060824,0.00029534986,0.0028346556,0.00011370662],"about_ca_topic_score_codex":0.00001767091,"about_ca_topic_score_gemma":0.0000013493927,"teacher_disagreement_score":0.95147026,"about_ca_system_score_codex":0.00008315175,"about_ca_system_score_gemma":0.00011666811,"threshold_uncertainty_score":0.39527452},"labels":[],"label_agreement":null},{"id":"W2048241951","doi":"10.1155/2012/642649","title":"A Jointly Optimized Variable<i>M</i>-QAM and Power Allocation Scheme for Image Transmission","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Transmission (telecommunications); Quadrature amplitude modulation; Image quality; Rayleigh fading; Transmitter; QAM; Algorithm; Modulation (music); Peak signal-to-noise ratio; Signal-to-noise ratio (imaging); Bit error rate; Image (mathematics); Channel (broadcasting); Fading; Telecommunications; Artificial intelligence; Decoding methods","score_opus":0.009234523778811446,"score_gpt":0.2301363347056336,"score_spread":0.22090181092682215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048241951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013509688,0.010698262,0.9870276,0.00036712544,0.00018709194,0.00016530583,0.0000013442933,0.00003860886,0.00016369761],"genre_scores_gemma":[0.30187756,0.0062716594,0.69155425,0.00006876519,0.00018044746,0.000009637857,0.000010996386,0.0000213174,0.000005358163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.000047939742,0.00037611858,0.0000583079,0.00006965254,0.00017841694],"domain_scores_gemma":[0.9990843,0.00022119019,0.00014105895,0.00027075567,0.00015369042,0.00012902103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235013,0.00011822939,0.00021247346,0.0000672487,0.00014459687,0.00005831774,0.00019140782,0.00007550014,0.000004592962],"category_scores_gemma":[0.000005788379,0.000110637986,0.000046063735,0.00012877956,0.000048566042,0.00052255404,0.000058856454,0.00020949473,1.8788775e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003889539,0.00007702217,0.00007176102,0.000030625008,0.000090923604,1.8280352e-7,0.0003355089,0.9541151,0.00043398517,0.003413096,0.0023425082,0.039050415],"study_design_scores_gemma":[0.0007341909,0.0000509961,0.00027109965,0.00011022309,0.00003965473,0.000049634917,0.00001858937,0.98136544,0.000016666998,0.00025956705,0.016964667,0.00011929126],"about_ca_topic_score_codex":3.6127656e-7,"about_ca_topic_score_gemma":1.7745796e-7,"teacher_disagreement_score":0.3005266,"about_ca_system_score_codex":0.000023463235,"about_ca_system_score_gemma":0.0000105269655,"threshold_uncertainty_score":0.4511686},"labels":[],"label_agreement":null},{"id":"W2052669191","doi":"10.1155/2009/409853","title":"On Reliable Transmission of Data over Simple Wireless Channels","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Computer science; Computer network; Simple (philosophy); Selective Repeat ARQ; Node (physics); Transmission (telecommunications); Wireless; Automatic repeat request; Data transmission; Context (archaeology); Channel (broadcasting); Hybrid automatic repeat request; Wireless network; Distributed computing; Telecommunications; Engineering","score_opus":0.04108574642570699,"score_gpt":0.3127035266342503,"score_spread":0.27161778020854327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052669191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002136077,0.0014786323,0.99332565,0.0022914498,0.00012186884,0.000398091,0.0000016959624,0.000018037901,0.00022850603],"genre_scores_gemma":[0.9211621,0.0021004544,0.07566059,0.0007793845,0.00026049418,0.000007492701,0.000008662271,0.0000076277192,0.000013175959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870104,0.00013651114,0.0005768762,0.0001712045,0.00023029002,0.00018406368],"domain_scores_gemma":[0.99699414,0.00031958998,0.00046700306,0.0019392851,0.00015305485,0.00012695757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065037323,0.00013040235,0.0003249932,0.00009602625,0.00018310653,0.00014480297,0.0033664256,0.00008051074,0.0000048936445],"category_scores_gemma":[0.000002797769,0.0001038441,0.000075670505,0.00031246443,0.000054428237,0.00066524744,0.00053059217,0.00038005202,3.943632e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049413287,0.000374772,0.00008793383,0.000011413242,0.00004335236,0.0000049827045,0.00020189371,0.06577597,0.000022444307,0.06388932,0.021657174,0.8478813],"study_design_scores_gemma":[0.00051708834,0.00055016,0.00113998,0.00029842276,0.000011989836,0.000029353854,0.0000025613808,0.9532864,0.000012949471,0.011676853,0.032361086,0.000113132926],"about_ca_topic_score_codex":0.000005442839,"about_ca_topic_score_gemma":0.0000010766115,"teacher_disagreement_score":0.9190261,"about_ca_system_score_codex":0.000011162363,"about_ca_system_score_gemma":0.000051225532,"threshold_uncertainty_score":0.62557125},"labels":[],"label_agreement":null},{"id":"W2066929678","doi":"10.1155/2009/190579","title":"Traces Synchronization in Distributed Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Offset (computer science); Debugging; UTC offset; Timestamp; Distributed computing; Latency (audio); Computation; Queue; Bounding overwatch; Real-time computing; Parallel computing; Computer network; Operating system; Algorithm; Global Positioning System","score_opus":0.009270094058874483,"score_gpt":0.2363093767518409,"score_spread":0.22703928269296642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066929678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009619288,0.00831802,0.9849022,0.005357158,0.00017636774,0.00010376478,4.0118604e-7,0.00008766191,0.00009252368],"genre_scores_gemma":[0.9032469,0.004732429,0.091564156,0.0002933269,0.0001436402,0.0000019394117,0.0000072362213,0.000005556236,0.0000048483816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986531,0.000166897,0.0006415411,0.0001519311,0.0001546777,0.00023185405],"domain_scores_gemma":[0.9981421,0.00022129853,0.00045483967,0.0008883626,0.0002183645,0.0000749918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004663601,0.00014241779,0.00027656084,0.00021567883,0.00017108268,0.00024202531,0.0019106736,0.00012153576,0.0000023080318],"category_scores_gemma":[0.000019700205,0.000130533,0.000059369504,0.0010321072,0.00009754173,0.0006967547,0.0003792141,0.0004685052,6.924439e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003997948,0.00012153837,0.0013115903,0.0000016553246,0.00001584628,0.0000066604525,0.0000816755,0.4791402,9.917895e-7,0.03591649,0.001637772,0.48176157],"study_design_scores_gemma":[0.0003645258,0.00017888231,0.014530095,0.000093563256,0.000007978312,0.000086162276,0.000011903224,0.9769025,0.0000017677048,0.0055692038,0.0021244013,0.0001290454],"about_ca_topic_score_codex":0.0000018452453,"about_ca_topic_score_gemma":0.000008096268,"teacher_disagreement_score":0.9022849,"about_ca_system_score_codex":0.00006707861,"about_ca_system_score_gemma":0.0000487123,"threshold_uncertainty_score":0.5322981},"labels":[],"label_agreement":null},{"id":"W2082318518","doi":"10.1155/2012/767920","title":"Energy Efficiency Adaptation for Multihop Routing in Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Key distribution in wireless sensor networks; Quality of service; Routing (electronic design automation); Routing protocol; Distributed computing; Energy (signal processing); Mobile wireless sensor network; Adaptation (eye); Key (lock); Power control; Wireless; Real-time computing; Power (physics); Wireless network; Telecommunications","score_opus":0.024484579103108136,"score_gpt":0.2540928044247126,"score_spread":0.22960822532160446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082318518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009583424,0.003711352,0.9849999,0.0005810289,0.0008648757,0.00012813346,4.817605e-7,0.00003976777,0.0000910307],"genre_scores_gemma":[0.8193242,0.0013439517,0.1783889,0.0002820353,0.0006145743,0.000011290915,0.000005249266,0.00001779565,0.000012013908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978303,0.0003381868,0.000865549,0.0001975798,0.000218288,0.0005501311],"domain_scores_gemma":[0.99670005,0.0012683889,0.00067746954,0.0008541105,0.00029802995,0.00020193994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011521779,0.00021397711,0.0003862508,0.00023755891,0.00031645663,0.00018243551,0.0014507903,0.00015234108,6.1929586e-7],"category_scores_gemma":[0.000016697122,0.00019972767,0.00014455042,0.00061351777,0.000099173034,0.00065072865,0.0005218791,0.00043267652,2.7126387e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013450741,0.0002339316,0.0013385679,0.0000035805292,0.000025305868,0.0000015026847,0.0005360415,0.81250006,0.0000066031325,0.059780046,0.0001633305,0.12539756],"study_design_scores_gemma":[0.00069740135,0.000105731466,0.0017469121,0.00013904065,0.00001736203,0.00007868065,0.000070008144,0.9950862,0.000005914618,0.00009162096,0.0017506828,0.00021046307],"about_ca_topic_score_codex":0.00002385649,"about_ca_topic_score_gemma":0.000037207297,"teacher_disagreement_score":0.8097408,"about_ca_system_score_codex":0.00007142878,"about_ca_system_score_gemma":0.00004326839,"threshold_uncertainty_score":0.8144658},"labels":[],"label_agreement":null},{"id":"W2103268550","doi":"10.1155/2012/924791","title":"Secure Telemedicine: Biometrics for Remote and Continuous Patient Verification","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biometrics; Computer science; Identification (biology); Computer security; Field (mathematics); Telemedicine; Authentication (law); Health care; Identity (music); SIGNAL (programming language)","score_opus":0.02339764917556227,"score_gpt":0.2937051717526986,"score_spread":0.27030752257713636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103268550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25286135,0.043661874,0.6977914,0.004836018,0.00046616266,0.00023606954,0.0000026265905,0.000016668893,0.00012781848],"genre_scores_gemma":[0.91215324,0.00605067,0.08084284,0.00020090837,0.00071663136,0.0000013914832,0.000009206027,0.000006872863,0.000018211307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939364,0.000039896986,0.00031245546,0.00004901949,0.0000940384,0.00011094004],"domain_scores_gemma":[0.9988224,0.00022937049,0.00025389725,0.0002939435,0.00025765382,0.00014271465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036055315,0.000065313776,0.00021964044,0.0001649812,0.00012486217,0.000023110184,0.0000946231,0.00004982196,9.4465395e-7],"category_scores_gemma":[0.000034689307,0.00005004367,0.00006152374,0.00024621628,0.00005580482,0.000073048104,0.00005853845,0.00017814586,1.455243e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044278615,0.00019426891,0.033269837,0.000031907202,0.00020613914,8.5212133e-7,0.0005603911,0.00009296049,0.000065346074,0.0003230174,0.0036516562,0.96155936],"study_design_scores_gemma":[0.003003796,0.0019506309,0.11722485,0.0006898234,0.0012991241,0.0007231419,0.00076643424,0.52519345,0.000053789205,0.00028214225,0.34853342,0.0002793824],"about_ca_topic_score_codex":0.000004453755,"about_ca_topic_score_gemma":4.3817923e-7,"teacher_disagreement_score":0.96128,"about_ca_system_score_codex":0.000015870277,"about_ca_system_score_gemma":0.000013441038,"threshold_uncertainty_score":0.20407216},"labels":[],"label_agreement":null},{"id":"W2144444499","doi":"10.1155/2012/254942","title":"Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Cryptographic protocol; Protocol (science); Property (philosophy); Set (abstract data type); Secrecy; Cryptography; Computer security; Cryptographic primitive; Interpretation (philosophy); Theoretical computer science; Computer network; Programming language","score_opus":0.05470402120692109,"score_gpt":0.3858703698019459,"score_spread":0.3311663485950248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144444499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012085462,0.00037913048,0.99565345,0.00045854974,0.00004894504,0.0022242987,0.0000016208223,0.0000093286,0.00001615661],"genre_scores_gemma":[0.63135785,0.0000135888495,0.36814922,0.00013520951,0.00003596244,0.00030221886,0.0000017690815,0.0000030277117,0.000001172334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987166,0.00039597874,0.0005143109,0.00007860011,0.00015516624,0.0001393584],"domain_scores_gemma":[0.9976034,0.00052301417,0.0007347443,0.00077200244,0.0002904259,0.00007642458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302578,0.00008710502,0.00023398106,0.00019829856,0.00025734337,0.0001021584,0.0007728999,0.000039052396,0.0000021506498],"category_scores_gemma":[0.000017145365,0.00006232376,0.000105088555,0.0006908616,0.00010908753,0.0009036995,0.00041457126,0.00022937042,9.5260596e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007528896,0.00048030794,0.02200767,0.000046422432,0.000990284,2.8225818e-7,0.0056691724,0.5529722,0.00008302642,0.13091968,0.00007672322,0.28667897],"study_design_scores_gemma":[0.00021684445,0.000068164874,0.009941905,0.00005169231,0.00018625945,0.000020661979,0.00004721432,0.98715013,0.00001548325,0.001468924,0.0007713551,0.00006138313],"about_ca_topic_score_codex":0.000003192156,"about_ca_topic_score_gemma":0.000003310408,"teacher_disagreement_score":0.6301493,"about_ca_system_score_codex":0.000020259415,"about_ca_system_score_gemma":0.00003817929,"threshold_uncertainty_score":0.2541489},"labels":[],"label_agreement":null},{"id":"W2149595173","doi":"10.1155/2012/929763","title":"Low-Complexity Distortionless Techniques for Peak Power Reduction in OFDM Communication Systems","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Fast Fourier transform; Computational complexity theory; Reduction (mathematics); Computer science; Algorithm; Discrete Fourier transform (general); Multiplexing; SIGNAL (programming language); Electronic engineering; Mathematics; Fourier transform; Telecommunications; Channel (broadcasting); Short-time Fourier transform; Engineering; Fourier analysis","score_opus":0.02719073795305587,"score_gpt":0.2699902884230204,"score_spread":0.24279955046996454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149595173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089330986,0.024796434,0.88114524,0.00085012073,0.0020130768,0.0005880792,0.0000072862035,0.00016183185,0.0011069559],"genre_scores_gemma":[0.967673,0.0027065123,0.029147265,0.000013837759,0.0003763643,0.00004039792,0.000013942409,0.000019055224,0.000009602675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899256,0.0001339151,0.00056285056,0.00005243283,0.00009065732,0.00016755966],"domain_scores_gemma":[0.9987999,0.0001230675,0.0002280847,0.00060492696,0.00016310278,0.000080872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489089,0.0001079032,0.00021937385,0.00015780322,0.0001483697,0.000059769165,0.00043902025,0.00008417995,0.0000022318927],"category_scores_gemma":[0.000007179794,0.00010854561,0.00006533422,0.0001700702,0.000113813585,0.00045270784,0.00009504047,0.00034136762,4.972853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016866889,0.0020994425,0.00789391,0.00045964724,0.000537629,0.0000011205551,0.0076738806,0.5933055,0.0015270956,0.16503917,0.06346379,0.15783013],"study_design_scores_gemma":[0.0012083349,0.00020622539,0.048117407,0.001155501,0.00011184373,0.0007007214,0.0010244905,0.8182306,0.00018410938,0.0026247674,0.12573726,0.000698719],"about_ca_topic_score_codex":0.0000080579275,"about_ca_topic_score_gemma":0.000004798893,"teacher_disagreement_score":0.87834203,"about_ca_system_score_codex":0.00013197507,"about_ca_system_score_gemma":0.0000117155205,"threshold_uncertainty_score":0.44263616},"labels":[],"label_agreement":null},{"id":"W2152595820","doi":"10.1155/2012/546301","title":"ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization in<i>p</i>-Cycle Networks","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Survivability; Network topology; Computer science; Decomposition; Relaxation (psychology); Set (abstract data type); Topology (electrical circuits); Mathematical optimization; Mathematics; Computer network","score_opus":0.013904697480925578,"score_gpt":0.2519544971366065,"score_spread":0.23804979965568093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152595820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00889406,0.004636406,0.9858973,0.00019147129,0.00008771085,0.0001579692,0.0000010236633,0.000046059635,0.000088006316],"genre_scores_gemma":[0.5355102,0.0011938298,0.46313462,0.000056436733,0.00006944337,0.000011706114,0.000014572408,0.000008892586,3.4176094e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.000037856436,0.0003428066,0.00006162783,0.000048270627,0.00018759674],"domain_scores_gemma":[0.9992927,0.00024852416,0.00011760608,0.00022500464,0.00005592335,0.00006025662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023910265,0.00010109482,0.00018228136,0.000094133145,0.00010794557,0.00002810498,0.00020259073,0.00011708321,5.551386e-7],"category_scores_gemma":[0.0000071525956,0.000099435085,0.000033695254,0.00012650774,0.00009424407,0.00026786805,0.00009323965,0.0002843528,2.8442898e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013506397,0.000055445915,0.0010296955,0.00000756686,0.000016506025,7.088049e-8,0.000034916837,0.9858301,0.0000038074331,0.0028260408,0.00009531721,0.010086973],"study_design_scores_gemma":[0.00046961082,0.000051934087,0.00069074903,0.000031255808,0.000021754477,0.000014268481,0.000026539921,0.99783885,0.0000014085164,0.00069425907,0.000061987965,0.00009736296],"about_ca_topic_score_codex":6.8125996e-7,"about_ca_topic_score_gemma":0.0000027328138,"teacher_disagreement_score":0.5266161,"about_ca_system_score_codex":0.000046772264,"about_ca_system_score_gemma":0.000006178076,"threshold_uncertainty_score":0.40548453},"labels":[],"label_agreement":null},{"id":"W2796423018","doi":"10.1155/2018/4134878","title":"Network Restoration for Next-Generation Communication and Computing Networks","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Pretoria; National Research Foundation","keywords":"Computer science; Reliability (semiconductor); Adaptation (eye); The Internet; Distributed computing; Telecommunications network; Frame (networking); Computer network; Software-defined networking; World Wide Web","score_opus":0.061902556249583296,"score_gpt":0.28252840692238534,"score_spread":0.22062585067280205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796423018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003748659,0.013227042,0.9790162,0.0028704146,0.0007369491,0.00026354514,5.93317e-7,0.00006344773,0.00007317148],"genre_scores_gemma":[0.6528135,0.0029525748,0.34093663,0.0010225475,0.0022284132,0.000007375398,0.000016017633,0.000015164454,0.000007751963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981304,0.00035115704,0.00079069124,0.00023969801,0.00016846631,0.0003195924],"domain_scores_gemma":[0.9961596,0.00097493076,0.00077702024,0.0012066783,0.0007260449,0.00015574132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803667,0.00020463332,0.0003522738,0.00011331719,0.001203322,0.0007242404,0.0013500684,0.00015409042,0.0000012184404],"category_scores_gemma":[0.00003303643,0.00019186959,0.00008866686,0.0004403032,0.00026011965,0.00092753384,0.0008605679,0.0003976337,5.206685e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006300785,0.0001550403,0.0025646086,0.000015700301,0.00015757115,0.0000014658847,0.001060235,0.20667766,0.000021071279,0.18108618,0.052836753,0.55536073],"study_design_scores_gemma":[0.00056089944,0.0004106879,0.0027034394,0.0001350891,0.000038760478,0.00008976135,0.000016261223,0.9772402,0.0000015159002,0.00486025,0.013749431,0.00019372793],"about_ca_topic_score_codex":0.000008698093,"about_ca_topic_score_gemma":0.00004553934,"teacher_disagreement_score":0.7705625,"about_ca_system_score_codex":0.00003707741,"about_ca_system_score_gemma":0.000053923653,"threshold_uncertainty_score":0.92551017},"labels":[],"label_agreement":null},{"id":"W2905037677","doi":"10.1155/2018/1543531","title":"Modeling Handover Signaling Messages in OpenFlow-Based Mobile Software-Defined Networks","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"OpenFlow; Computer science; Handover; Computer network; Software-defined networking; Network packet; Mobility management; Distributed computing","score_opus":0.02144314863366592,"score_gpt":0.2629826510508095,"score_spread":0.24153950241714356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905037677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010924776,0.007877882,0.9796039,0.0006857944,0.00057406945,0.00020102154,6.863352e-7,0.00008030512,0.000051597082],"genre_scores_gemma":[0.7186658,0.00091057946,0.27898917,0.00085686304,0.0005300261,0.000015921054,0.0000035477306,0.000020551806,0.000007533158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976939,0.00031619566,0.0009614234,0.0002981771,0.00028351045,0.0004467909],"domain_scores_gemma":[0.99683875,0.00076413824,0.00042345916,0.0013224205,0.00045564922,0.0001955612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206695,0.00026689545,0.0005203242,0.00027039484,0.00043643735,0.00047483272,0.002431481,0.0001689531,0.000008576294],"category_scores_gemma":[0.00003073478,0.000237157,0.00016791248,0.0007688112,0.00017064295,0.00065838784,0.00093547464,0.0007310299,0.000002181425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032025197,0.00012950333,0.001484073,0.0000046390182,0.00003945924,0.000008703689,0.00018098275,0.9335552,0.0000025953113,0.0016999205,0.0007793872,0.06208351],"study_design_scores_gemma":[0.0011314144,0.00032645828,0.0005164797,0.00032970228,0.00002515454,0.000048994767,0.000013318953,0.99381083,0.000004395297,0.0015392499,0.00199463,0.00025938964],"about_ca_topic_score_codex":0.00003384072,"about_ca_topic_score_gemma":0.000060535418,"teacher_disagreement_score":0.707741,"about_ca_system_score_codex":0.000055068398,"about_ca_system_score_gemma":0.00012691272,"threshold_uncertainty_score":0.9670982},"labels":[],"label_agreement":null},{"id":"W2925269827","doi":"10.1155/2019/4390917","title":"A Stochastic Approach to Energy Cost Minimization in Smart-Grid-Enabled Data Center Network","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Lyapunov optimization; Smart grid; Data center; Quality of service; Mathematical optimization; Constraint (computer-aided design); Grid; Minification; Electricity; Real-time computing; Computer network","score_opus":0.026036507595352268,"score_gpt":0.24401205071517315,"score_spread":0.21797554311982087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925269827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027747955,0.0009170502,0.99289095,0.0017148738,0.0005957925,0.00022013843,0.0000010684862,0.00002456552,0.00086073676],"genre_scores_gemma":[0.8395895,0.0001704429,0.15802804,0.0015256576,0.00055090373,0.0000075251724,0.000020424512,0.000014570349,0.00009295094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983899,0.0002577211,0.0005685122,0.00027848626,0.00021490257,0.00029049942],"domain_scores_gemma":[0.9970742,0.00026654833,0.00031224857,0.0020895202,0.00011826119,0.00013920713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007481739,0.00014789033,0.00030588917,0.00018968133,0.00014625098,0.00027272795,0.0034876037,0.000056525816,0.0000013492827],"category_scores_gemma":[0.000008178111,0.00012926481,0.00005202101,0.0006559866,0.000031200496,0.0001194485,0.0038228938,0.00029340407,0.0000023541497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010494099,0.00019467394,0.0007590188,0.0000054362786,0.000039350616,0.0000014581954,0.00025788415,0.9437513,2.2926781e-7,0.006610106,0.0075148777,0.040855207],"study_design_scores_gemma":[0.000593185,0.00008022922,0.0044353222,0.00016026745,0.000010921823,0.000049328537,0.000019417907,0.95700866,3.1492817e-8,0.00022085605,0.037286922,0.00013486504],"about_ca_topic_score_codex":0.000021974518,"about_ca_topic_score_gemma":0.000019325495,"teacher_disagreement_score":0.8368147,"about_ca_system_score_codex":0.000039997114,"about_ca_system_score_gemma":0.000039380117,"threshold_uncertainty_score":0.64808935},"labels":[],"label_agreement":null},{"id":"W2987674778","doi":"10.1155/2019/2938653","title":"Adaptive Filtering in Optical Coherent Flexible Bit-Rate Receivers in the Presence of State-of-Polarization Transients and Colored Noise","year":2019,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Least mean squares filter; Colors of noise; Adaptive filter; Colored; Algorithm; Noise (video); Recursive least squares filter; Bit error rate; Control theory (sociology); Filter (signal processing); Artificial intelligence; Decoding methods; Computer vision","score_opus":0.013416838609371014,"score_gpt":0.21996245419117672,"score_spread":0.2065456155818057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987674778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9327573,0.0010933069,0.06562222,0.0001786561,0.000061454,0.0001739952,0.0000015070723,0.000009662725,0.000101860605],"genre_scores_gemma":[0.9794052,0.0025247624,0.018044023,0.000009344216,0.000006883553,0.0000024272833,0.000001115048,0.0000050570447,0.0000011737939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993427,0.00008264378,0.0003539403,0.000048605903,0.000075088945,0.00009703253],"domain_scores_gemma":[0.99917114,0.00042107087,0.00009306131,0.00024150877,0.00005257867,0.00002062478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002946321,0.00006610291,0.00018976492,0.00009605414,0.000017960629,0.000018474682,0.00035113288,0.00004661565,8.4022884e-7],"category_scores_gemma":[0.000007954201,0.00005210289,0.000021602946,0.00025689782,0.00011047756,0.00013225724,0.00009860565,0.0003069886,9.2591286e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044533263,0.000063673084,0.0083926385,0.000023455243,0.000028246504,0.0000011500683,0.000674561,0.967953,0.00029556296,0.001609688,0.000025812318,0.020887628],"study_design_scores_gemma":[0.00036542577,0.00016395396,0.08264481,0.00024940397,0.000008388868,0.000004811207,0.00014664572,0.9158169,0.000047108162,0.000453404,0.0000496204,0.000049522325],"about_ca_topic_score_codex":0.0000057005395,"about_ca_topic_score_gemma":0.000018131397,"teacher_disagreement_score":0.07425217,"about_ca_system_score_codex":0.000014990732,"about_ca_system_score_gemma":0.000008358682,"threshold_uncertainty_score":0.21246941},"labels":[],"label_agreement":null},{"id":"W3002929358","doi":"10.1155/2020/4189789","title":"New Courteous Algorithm for Uplink Scheduling in LTE-Advanced and 5G Networks","year":2020,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 3rd Generation Partnership Project 2; LTE Advanced; Quality of service; Scheduling (production processes); Computer network; Telecommunications link; Cellular network; Throughput; Wireless network; Wireless; Telecommunications; Mathematical optimization","score_opus":0.012211470832015108,"score_gpt":0.23109310112346396,"score_spread":0.21888163029144886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002929358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008831814,0.016843917,0.9809831,0.00085245917,0.00019786267,0.00017164629,8.726134e-7,0.00004313888,0.00002382105],"genre_scores_gemma":[0.28223795,0.015160024,0.7017944,0.00021759681,0.00054493075,0.000005395369,0.000008611543,0.000028869863,0.0000022681465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991511,0.000031254945,0.0004687863,0.00010006191,0.000062198116,0.00018656433],"domain_scores_gemma":[0.9990758,0.0002791526,0.00015889644,0.00022499183,0.00009000481,0.00017115833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013320886,0.00014021726,0.00029502684,0.00005943403,0.00009946787,0.00006883385,0.0003044626,0.000087646404,0.000001211913],"category_scores_gemma":[0.0000068044897,0.00014661456,0.000047626065,0.00022614376,0.000034694356,0.00024233751,0.00009761472,0.00044011182,1.1879247e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007718244,0.0000062424124,0.000064952226,0.000004989265,0.00002008831,9.580117e-7,0.000080591875,0.63686836,0.0000020347863,0.00016656143,0.00023210185,0.36254543],"study_design_scores_gemma":[0.0009251112,0.000093041344,0.00021560816,0.00012346242,0.000022455824,0.000024534873,0.000025210646,0.99557394,0.0000015108203,0.0002991268,0.0025568472,0.00013915393],"about_ca_topic_score_codex":8.967167e-7,"about_ca_topic_score_gemma":0.000004856338,"teacher_disagreement_score":0.36240628,"about_ca_system_score_codex":0.00002610982,"about_ca_system_score_gemma":0.00001820821,"threshold_uncertainty_score":0.59787685},"labels":[],"label_agreement":null}]}