{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62844694,0.00040855515,0.3674543,0.00006564889,0.000042152988,0.000047960595,0.00018404858,0.000977586,0.0023728511],"genre_scores_gemma":[0.9607791,0.00014957707,0.038325477,0.000005668133,0.000011451625,0.000023655408,0.00016941111,0.00005510206,0.00048057802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928194,0.00014430072,0.000028776485,0.00017827276,0.00027951028,0.00008725055],"domain_scores_gemma":[0.99765575,0.00089919596,0.0004526774,0.00032865742,0.0005771397,0.00008661138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010296156,0.00036298748,0.00045225074,0.0015870446,0.0004985159,0.0006251012,0.0006085273,0.0003128093,0.00035291165],"category_scores_gemma":[0.0075181983,0.00020934927,0.00016409,0.0023678094,0.0003394841,0.0006365114,0.00070030394,0.00041397894,0.0001351365],"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.0006022776,0.000048685677,0.03632251,0.000111428584,0.00005677549,0.00013073246,0.00041891582,0.7757339,0.022707405,0.008867762,0.0012784109,0.1537212],"study_design_scores_gemma":[0.000022298644,0.000100977144,0.008715415,0.000010184023,0.000022247961,0.00008848484,0.00009055297,0.970712,0.015549314,0.0031838978,0.0014793157,0.000025208705],"about_ca_topic_score_codex":0.006330145,"about_ca_topic_score_gemma":0.0020501942,"teacher_disagreement_score":0.006330145,"about_ca_system_score_codex":0.00081451534,"about_ca_system_score_gemma":0.0007795792,"threshold_uncertainty_score":0.012586594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06305969,0.00016768329,0.93396693,0.00010554484,0.000045714536,0.00006876506,0.000014066056,0.00020166699,0.0023700234],"genre_scores_gemma":[0.91780686,0.000070792594,0.08034968,0.00006136406,0.000032366363,0.000046165493,0.000026235683,0.000030322795,0.0015762058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999395,0.00013899273,0.000024637027,0.00010856483,0.00017194604,0.00016086608],"domain_scores_gemma":[0.99935657,0.00028633748,0.00007675056,0.000079263504,0.00011442247,0.000086692125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000696437,0.00041984295,0.00053058664,0.00031779072,0.0006001862,0.0009046243,0.0008914711,0.00049619743,0.0012753414],"category_scores_gemma":[0.0016540557,0.00016368712,0.00030302425,0.0002995509,0.0005533451,0.00078786147,0.0010824641,0.00057568646,0.00013404703],"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.00067009643,0.00019171972,0.0024337522,0.000115537296,0.00006822925,0.0002818521,0.00031312046,0.65474427,0.04029911,0.0383552,0.0022810684,0.260246],"study_design_scores_gemma":[0.000033723,0.00008605641,0.00020418962,0.0000028569384,0.000009540272,0.00004977647,0.0000241288,0.9918854,0.002219002,0.0044120043,0.001064673,0.000008597352],"about_ca_topic_score_codex":0.003565869,"about_ca_topic_score_gemma":0.0036132794,"teacher_disagreement_score":0.003565869,"about_ca_system_score_codex":0.00069282384,"about_ca_system_score_gemma":0.0009429465,"threshold_uncertainty_score":0.0070902705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01283941,0.00074397685,0.9832206,0.00013684643,0.000024971263,0.00001860124,0.000042595715,0.00018479988,0.002788251],"genre_scores_gemma":[0.81748384,0.0024927957,0.1728062,0.00021475641,0.00012936302,0.00013782183,0.00018310774,0.0002373915,0.006314769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987716,0.00056178164,0.000027309108,0.00010737492,0.00042305668,0.000108961554],"domain_scores_gemma":[0.99858105,0.0009078622,0.00012609962,0.00008419293,0.00027978583,0.00002113027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136768,0.0010462347,0.0010563411,0.0005445837,0.0003344166,0.0008720742,0.00081433594,0.00095151656,0.0018811236],"category_scores_gemma":[0.0020795066,0.0005052562,0.0009839217,0.000725661,0.00075293146,0.0008768819,0.00070238253,0.00073405326,0.0005052321],"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.000039298095,0.000012949723,0.0004818526,0.00012978449,0.00006499193,0.00019048252,0.00010187203,0.9578869,0.0055727763,0.026711578,0.000544825,0.008262652],"study_design_scores_gemma":[0.0000020191837,0.000012491373,0.000099859295,0.0000062863064,0.000005188971,0.00004377366,0.000007489783,0.9967578,0.00061861944,0.0022639392,0.00017594748,0.000006584776],"about_ca_topic_score_codex":0.0025362764,"about_ca_topic_score_gemma":0.0020297938,"teacher_disagreement_score":0.0025362764,"about_ca_system_score_codex":0.00083818263,"about_ca_system_score_gemma":0.0009712957,"threshold_uncertainty_score":0.0072330236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004620846,0.00035811347,0.9930139,0.00007982119,0.000045013763,0.00007622418,0.000022650946,0.0007723748,0.0010111454],"genre_scores_gemma":[0.21653989,0.0009436694,0.77832174,0.00016193901,0.00015200493,0.00033526745,0.00025608583,0.00017052944,0.003118848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940014,0.00013923823,0.000047917267,0.00006229215,0.00029213837,0.000058323003],"domain_scores_gemma":[0.9996443,0.00009793159,0.000033108747,0.000058414804,0.0001360172,0.000030229807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529921,0.00066724006,0.00038789154,0.0005533184,0.00039784692,0.000898143,0.0012059514,0.00073722546,0.001085483],"category_scores_gemma":[0.0016567571,0.00040084182,0.00053701655,0.00026262164,0.00042897917,0.00096642046,0.0008535892,0.0012563104,0.00042653325],"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.0002756797,0.0002625967,0.0011219379,0.00043712746,0.00022026333,0.0011474654,0.0005283828,0.38432518,0.122783944,0.15366097,0.011544178,0.32369226],"study_design_scores_gemma":[0.000024887318,0.00015278764,0.00027246383,0.000028767941,0.000044284356,0.00021473053,0.000025912155,0.96713024,0.014021198,0.0065252744,0.01153068,0.00002873975],"about_ca_topic_score_codex":0.0030298536,"about_ca_topic_score_gemma":0.0030670466,"teacher_disagreement_score":0.0030298536,"about_ca_system_score_codex":0.0004974754,"about_ca_system_score_gemma":0.0010757867,"threshold_uncertainty_score":0.008741915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003256027,0.00015727333,0.99283534,0.00020298696,0.000034342265,0.00015380191,0.000041116622,0.0014514215,0.0018676886],"genre_scores_gemma":[0.38240138,0.0004876019,0.6069298,0.00027635874,0.00013754492,0.00079516467,0.0002248178,0.000337497,0.008409882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971541,0.0009394256,0.00021739877,0.0005374532,0.0008853035,0.00026619414],"domain_scores_gemma":[0.9981249,0.00070934545,0.00023290105,0.00037542108,0.0003992811,0.000158134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003504774,0.0014434624,0.0010747781,0.0011717483,0.0008058667,0.0029603846,0.0041793655,0.0017896574,0.0051068007],"category_scores_gemma":[0.0036843996,0.000733784,0.0012880842,0.0005998013,0.0015609924,0.0033408531,0.0025200418,0.0025146874,0.0013368126],"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.0004279342,0.0003044552,0.0021163854,0.0003214072,0.00015536517,0.0005286523,0.0006579582,0.64461446,0.010973341,0.23772469,0.004351,0.097824365],"study_design_scores_gemma":[0.000016637336,0.0000644425,0.000071670926,0.000013210585,0.000020968957,0.0000655424,0.000029493744,0.97656983,0.0011592275,0.018249312,0.00372329,0.000016399295],"about_ca_topic_score_codex":0.0045024217,"about_ca_topic_score_gemma":0.0030075812,"teacher_disagreement_score":0.0051068007,"about_ca_system_score_codex":0.0016050303,"about_ca_system_score_gemma":0.0019060012,"threshold_uncertainty_score":0.018535197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99187416,0.000027886414,0.0074619413,0.00001870599,0.0000056557624,0.000014746912,0.000083249004,0.000056731435,0.00045686506],"genre_scores_gemma":[0.9967585,0.000034787212,0.002844646,0.000009771917,0.0000027825324,0.000020996576,0.000043857264,0.000007951334,0.00027676433],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996319,0.00006875946,0.000020180265,0.00006568436,0.00013957753,0.0000740351],"domain_scores_gemma":[0.99893683,0.00037090475,0.00017487566,0.00017786145,0.0002648124,0.000074606854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036149306,0.0003028062,0.0003699446,0.00022594503,0.00034406935,0.00018387029,0.0004183791,0.00052700477,0.00081131834],"category_scores_gemma":[0.0007304919,0.00017013322,0.00012856258,0.0003337799,0.0003917853,0.00027735584,0.0004797109,0.00029829156,0.0001783951],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0006252178,0.00019164222,0.00988794,0.000113821145,0.000035541,0.000457126,0.00041712736,0.005690542,0.9741455,0.00021116379,0.00013831341,0.008086106],"study_design_scores_gemma":[0.00008211207,0.0023196363,0.027312282,0.000018090275,0.000054973087,0.0006559591,0.0004400213,0.019422522,0.9481919,0.000260028,0.0011956133,0.00004696952],"about_ca_topic_score_codex":0.0004218901,"about_ca_topic_score_gemma":0.00060036185,"teacher_disagreement_score":0.00081131834,"about_ca_system_score_codex":0.00014455109,"about_ca_system_score_gemma":0.00015999429,"threshold_uncertainty_score":0.0027140975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016898904,0.0002758978,0.97755015,0.00026378498,0.00002851944,0.000053703934,0.00004968896,0.00009349809,0.004785895],"genre_scores_gemma":[0.6256371,0.0016981149,0.3639819,0.00022925217,0.00011519116,0.0007435035,0.00016285136,0.00018456116,0.007247584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.00043052243,0.000026992106,0.00008737989,0.00017706744,0.0000501219],"domain_scores_gemma":[0.99867,0.0008676999,0.0001623941,0.00012180469,0.0001339499,0.00004427143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017774809,0.00090257224,0.0005666591,0.00067852216,0.00055886735,0.0008294292,0.00083540904,0.0009325476,0.0017602142],"category_scores_gemma":[0.0044427174,0.0005851614,0.0008535543,0.000753918,0.0013098071,0.0026201496,0.0014523683,0.0012616304,0.00027730165],"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.000014732328,0.000008835812,0.000161919,0.000016721977,0.000011151791,0.000015975176,0.000023505581,0.94575876,0.00029689554,0.0483315,0.0002853537,0.00507458],"study_design_scores_gemma":[0.0000037144719,0.000019834684,0.000030636707,0.0000055105465,0.0000028167137,0.000010272559,0.000008700698,0.9656295,0.00016880817,0.03308394,0.0010322816,0.000003971612],"about_ca_topic_score_codex":0.001918494,"about_ca_topic_score_gemma":0.0012574842,"teacher_disagreement_score":0.001918494,"about_ca_system_score_codex":0.0009886661,"about_ca_system_score_gemma":0.00076318864,"threshold_uncertainty_score":0.009400368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021247403,0.000048358816,0.99646145,0.000052597927,0.000014485813,0.00006477305,0.000023677894,0.00058239535,0.00062757713],"genre_scores_gemma":[0.171309,0.00013780224,0.82704115,0.0000609991,0.00005303258,0.00030140457,0.00013235236,0.000097270226,0.0008670469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206674,0.0031117692,0.00056644075,0.0013592978,0.002598176,0.00029751257],"domain_scores_gemma":[0.99329454,0.003181846,0.0009298477,0.0012106065,0.0012339469,0.00014913901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004894885,0.001181907,0.0011503713,0.0041115866,0.00072638784,0.0026700215,0.001615462,0.0014836291,0.0024030497],"category_scores_gemma":[0.013805177,0.00051813846,0.0012130095,0.0025523603,0.0012943144,0.0047834096,0.0026888421,0.0018879457,0.00043225408],"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.00035432552,0.0002611727,0.008074455,0.0005448903,0.0002857283,0.00036123887,0.0019195117,0.09590559,0.014089669,0.1452116,0.0033682296,0.72962356],"study_design_scores_gemma":[0.000047145037,0.0001852633,0.0013593719,0.00005369426,0.00008801806,0.0003402672,0.0001580955,0.9495067,0.0097233355,0.030057844,0.008409374,0.00007086372],"about_ca_topic_score_codex":0.001723156,"about_ca_topic_score_gemma":0.0012608267,"teacher_disagreement_score":0.004894885,"about_ca_system_score_codex":0.0008552754,"about_ca_system_score_gemma":0.0016542193,"threshold_uncertainty_score":0.025886893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018645393,0.0003458182,0.9784766,0.00012011477,0.000039121645,0.000051800136,0.000043099153,0.00013783775,0.0021402698],"genre_scores_gemma":[0.5080894,0.00041645663,0.48774415,0.000121945326,0.000071569106,0.00012895184,0.00006480515,0.000036028618,0.0033266002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996107,0.00015030925,0.00002005165,0.000055886,0.00012080901,0.00004227522],"domain_scores_gemma":[0.9997873,0.0000614857,0.000047380203,0.000045792713,0.000046511977,0.00001153833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048279934,0.00062588835,0.00055152265,0.00029002255,0.00024796705,0.0004874873,0.0007649868,0.00048505893,0.0016748513],"category_scores_gemma":[0.00088462664,0.00021879627,0.00037027133,0.00052079273,0.00043258633,0.00062726426,0.0005232667,0.00051526126,0.00038609194],"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.0004885406,0.00015289799,0.0010173792,0.00032478277,0.00013015723,0.00029775052,0.00017548208,0.46436182,0.19365446,0.0650875,0.0032487465,0.27106047],"study_design_scores_gemma":[0.00005231123,0.00025599916,0.00039572976,0.000017930955,0.00004433618,0.00029734283,0.000011422734,0.96912867,0.022081425,0.0044737216,0.0032078747,0.000033213357],"about_ca_topic_score_codex":0.000544364,"about_ca_topic_score_gemma":0.0009055725,"teacher_disagreement_score":0.0016748513,"about_ca_system_score_codex":0.00040476923,"about_ca_system_score_gemma":0.0005578814,"threshold_uncertainty_score":0.005602956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024877766,0.020263327,0.91049796,0.0020511372,0.0012789243,0.00021371464,0.00014374102,0.00028677544,0.040386714],"genre_scores_gemma":[0.65115154,0.105325975,0.201743,0.0019837439,0.0074945427,0.0014858788,0.00036879405,0.0004009633,0.030045573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973667,0.00070888473,0.00015052246,0.0003174289,0.0012580132,0.00019844007],"domain_scores_gemma":[0.9938314,0.0041468283,0.00053899543,0.00075359526,0.00062691537,0.00010226385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001962342,0.0012671606,0.0011950396,0.001288674,0.0008809209,0.0020291544,0.0016440316,0.001915434,0.0029398676],"category_scores_gemma":[0.008293693,0.0006796638,0.0005324949,0.0024184012,0.005824428,0.0053787865,0.0027281346,0.0025945948,0.0012384552],"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.00027028768,0.00004606278,0.00031303367,0.0014702262,0.00006262937,0.0008359451,0.0007333716,0.061457805,0.011590292,0.81719565,0.006785419,0.09923928],"study_design_scores_gemma":[0.00012062668,0.0003683398,0.0006305185,0.0007440502,0.00010965842,0.001300618,0.00015361469,0.2276959,0.00938436,0.6655632,0.093743585,0.00018546918],"about_ca_topic_score_codex":0.00077444175,"about_ca_topic_score_gemma":0.00040599774,"teacher_disagreement_score":0.0029398676,"about_ca_system_score_codex":0.0008739645,"about_ca_system_score_gemma":0.0007142125,"threshold_uncertainty_score":0.010378003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072375694,0.00027203583,0.9900467,0.000099713136,0.00006550426,0.000042624924,0.000051462317,0.0009613148,0.00122309],"genre_scores_gemma":[0.55378604,0.0009009873,0.4388937,0.000107132466,0.00020031974,0.00036587013,0.0004875615,0.00035202003,0.004906386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962655,0.0010936101,0.0002509483,0.0007728839,0.0014064633,0.00021073787],"domain_scores_gemma":[0.99468154,0.0023302943,0.0005606053,0.0015180313,0.00073409994,0.00017541797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027358215,0.0008071617,0.0010000789,0.0018447489,0.0009820323,0.0019654667,0.0020909728,0.0009168215,0.0017655351],"category_scores_gemma":[0.011914315,0.0006244396,0.0004978798,0.002200511,0.0015212643,0.0038312294,0.0026293935,0.0013320803,0.0005822589],"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.00062796444,0.00009094323,0.003506244,0.0002550521,0.000121995276,0.0003253451,0.0008761323,0.4571867,0.016952788,0.24606195,0.0029439135,0.27105096],"study_design_scores_gemma":[0.00006765054,0.0000980529,0.0005292128,0.000039124643,0.00003169196,0.00011789902,0.0001435264,0.8817196,0.010915541,0.092810266,0.013491497,0.000035884856],"about_ca_topic_score_codex":0.0038683473,"about_ca_topic_score_gemma":0.0023985694,"teacher_disagreement_score":0.0038683473,"about_ca_system_score_codex":0.0015207322,"about_ca_system_score_gemma":0.001704854,"threshold_uncertainty_score":0.01446861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031220865,0.001749729,0.9638768,0.00025629843,0.00011189399,0.00004442261,0.000014371563,0.00017292229,0.0025527794],"genre_scores_gemma":[0.9269883,0.0014625794,0.06793992,0.00010161786,0.000087359964,0.00010303822,0.000034987417,0.000075436656,0.0032067567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.000111948095,0.000011598169,0.00004231855,0.00009382256,0.000025585796],"domain_scores_gemma":[0.9996898,0.0001983573,0.000031142314,0.00002697241,0.00004422363,0.000009553192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919351,0.00048135847,0.00043073975,0.0003281444,0.0002787585,0.00044205788,0.0006431711,0.0004638112,0.0006000012],"category_scores_gemma":[0.0015412559,0.00017017199,0.00024266464,0.00040843425,0.00041035103,0.00068738166,0.0005255515,0.0005228018,0.00014172561],"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.0000774996,0.00005865624,0.00044687433,0.000093773095,0.000040684314,0.00008226189,0.00006843544,0.8797784,0.010539698,0.021295087,0.00096626347,0.08655237],"study_design_scores_gemma":[0.0000039129463,0.000026596566,0.00014259537,0.0000033289887,0.0000045195648,0.00002201636,0.0000069839416,0.99297684,0.00084331486,0.005442091,0.0005233154,0.0000045281154],"about_ca_topic_score_codex":0.00060783955,"about_ca_topic_score_gemma":0.0006169457,"teacher_disagreement_score":0.0006431711,"about_ca_system_score_codex":0.000439463,"about_ca_system_score_gemma":0.00024269796,"threshold_uncertainty_score":0.0031885505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02862211,0.0075893877,0.9489758,0.0025491484,0.0006436844,0.0001999909,0.0003074118,0.0030893863,0.008023153],"genre_scores_gemma":[0.61752284,0.005409428,0.36030814,0.0010565153,0.00053047924,0.00028408522,0.00045998572,0.0001683012,0.014260231],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808455,0.0005096727,0.00012294584,0.00025798034,0.00091951125,0.00010539841],"domain_scores_gemma":[0.9990577,0.00021864417,0.00018879357,0.00027882436,0.00020499328,0.0000511119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014391114,0.00054121506,0.00054300885,0.00093422976,0.0004490652,0.001190669,0.0008707083,0.0020767644,0.0049079107],"category_scores_gemma":[0.002587406,0.00028353793,0.00037811397,0.00087959616,0.00081979966,0.0019078371,0.0012943527,0.0010314683,0.0030852288],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007410908,0.0001757301,0.0033222286,0.0005241579,0.000072193405,0.0009419374,0.00037358538,0.0050094067,0.21729152,0.04478086,0.012274206,0.71449304],"study_design_scores_gemma":[0.00030722382,0.0019483707,0.024962544,0.00083249604,0.00018191373,0.019185873,0.0005499782,0.3290499,0.32138622,0.075445205,0.22576314,0.0003871485],"about_ca_topic_score_codex":0.00027526938,"about_ca_topic_score_gemma":0.00022663912,"teacher_disagreement_score":0.0049079107,"about_ca_system_score_codex":0.00046831043,"about_ca_system_score_gemma":0.0004412399,"threshold_uncertainty_score":0.016418576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051867412,0.00010305097,0.98906773,0.00025506577,0.00003485556,0.00009037463,0.00004856765,0.00016063156,0.0050529516],"genre_scores_gemma":[0.30563796,0.0005614831,0.68548936,0.00030009373,0.00024033451,0.00075999164,0.00026118924,0.00026372322,0.0064859637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941011,0.0025314277,0.0004594638,0.0005037227,0.001980647,0.000423706],"domain_scores_gemma":[0.993425,0.004311109,0.00048001952,0.00081487244,0.0008417979,0.00012723145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070915883,0.000994357,0.0006426377,0.002307335,0.0012755168,0.003195902,0.001922543,0.001129203,0.004595914],"category_scores_gemma":[0.0077776876,0.0007095896,0.0028817565,0.0013665551,0.0059377947,0.0055491114,0.0022460257,0.003977114,0.0007265058],"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.000023252907,0.000030401756,0.00015052981,0.00007402604,0.000016509486,0.00012317362,0.00035139214,0.013668703,0.0014436579,0.975227,0.00041253417,0.00847866],"study_design_scores_gemma":[0.000044416804,0.00007781843,0.0001695136,0.000093897026,0.000038934144,0.00024758704,0.00017403436,0.21737137,0.0055501577,0.76183,0.014350752,0.000051615127],"about_ca_topic_score_codex":0.001966334,"about_ca_topic_score_gemma":0.0010485076,"teacher_disagreement_score":0.0070915883,"about_ca_system_score_codex":0.0030431196,"about_ca_system_score_gemma":0.0024822224,"threshold_uncertainty_score":0.037504315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013890194,0.0016141698,0.9810199,0.0001791315,0.000035612135,0.00003327949,0.000029526878,0.00021805117,0.0029801957],"genre_scores_gemma":[0.37700862,0.0041836095,0.6130528,0.00014062173,0.00016848334,0.00007273796,0.00011332706,0.00007818437,0.005181588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999666,0.000059708484,0.0000144996175,0.000029740844,0.00021565246,0.0000144035],"domain_scores_gemma":[0.99950755,0.00027046935,0.00007663079,0.000049794846,0.0000880965,0.000007576369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036037096,0.00052567327,0.00040485317,0.0003948249,0.00031823156,0.00063596235,0.0005035758,0.0004605392,0.0017012926],"category_scores_gemma":[0.0014099919,0.00019814736,0.0002172416,0.000512148,0.00033919845,0.0005556978,0.00027995222,0.0006208053,0.00066098646],"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.000211637,0.000120175326,0.0012633813,0.00067660125,0.000053463642,0.0003550271,0.00025891478,0.11586337,0.21112917,0.05293792,0.002942404,0.61418796],"study_design_scores_gemma":[0.000041207226,0.00037759446,0.0015271371,0.00007404241,0.00005782381,0.0013917391,0.00006602944,0.82495034,0.13790712,0.012575545,0.020978115,0.000053276857],"about_ca_topic_score_codex":0.0004001214,"about_ca_topic_score_gemma":0.0006808521,"teacher_disagreement_score":0.0017012926,"about_ca_system_score_codex":0.0003905322,"about_ca_system_score_gemma":0.00042463193,"threshold_uncertainty_score":0.005691409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00635489,0.00020439559,0.98857087,0.00026617514,0.000036300327,0.00007708635,0.00010911634,0.000121287274,0.004259919],"genre_scores_gemma":[0.4723682,0.00078790454,0.51885,0.0003491069,0.000120982775,0.00082438247,0.0005093153,0.00019890367,0.005991204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.00027268898,0.000017544618,0.00008559674,0.00011227855,0.00009491029],"domain_scores_gemma":[0.9984871,0.001096888,0.00012325177,0.0000636822,0.00016718621,0.000061815976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529401,0.0010345707,0.0010165423,0.00059927965,0.0004328658,0.0011581326,0.0013701525,0.0011035547,0.004620937],"category_scores_gemma":[0.003049793,0.00061474636,0.00097380026,0.0007842761,0.0008299442,0.0010707522,0.0011339751,0.002228479,0.00043595853],"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.000017654747,0.000018079312,0.000077888144,0.00004334198,0.000008077576,0.000044479497,0.00001872211,0.98420066,0.00032375375,0.008874462,0.00073373015,0.0056391195],"study_design_scores_gemma":[0.000004204057,0.000009834803,0.000011616654,0.000004052722,0.0000029247117,0.0000073406386,0.000006122703,0.9955817,0.0000915597,0.003981183,0.0002977574,0.0000016552256],"about_ca_topic_score_codex":0.004351504,"about_ca_topic_score_gemma":0.003945296,"teacher_disagreement_score":0.004620937,"about_ca_system_score_codex":0.0010864566,"about_ca_system_score_gemma":0.0016393502,"threshold_uncertainty_score":0.015458584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012699857,0.043643024,0.8911962,0.007919272,0.0014338534,0.00019966213,0.00009327388,0.0010072821,0.041807577],"genre_scores_gemma":[0.5825614,0.056315057,0.33537,0.0018526413,0.001147737,0.0003193422,0.00023541656,0.00019643038,0.022002015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00019067201,0.000025810092,0.00007848235,0.00033266924,0.00006818996],"domain_scores_gemma":[0.99928683,0.00023824253,0.00007703985,0.00014855641,0.00020056522,0.000048694557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014223637,0.00042993858,0.00047107288,0.0008310078,0.001085769,0.0017820089,0.0011906321,0.0012941604,0.0029326237],"category_scores_gemma":[0.002285535,0.0001773708,0.00041668926,0.000608992,0.0012055362,0.0025587087,0.0011888258,0.0014209943,0.00061907497],"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.00006763668,0.000059047234,0.00047077882,0.00068800716,0.000029980269,0.00015454633,0.00022133645,0.05964893,0.007644878,0.7060132,0.014379932,0.2106217],"study_design_scores_gemma":[0.0000186147,0.00014320193,0.00060352107,0.00039719904,0.000045203342,0.00060010445,0.0003729219,0.31516084,0.0059080217,0.42812616,0.24856587,0.00005834059],"about_ca_topic_score_codex":0.0015487978,"about_ca_topic_score_gemma":0.0016836541,"teacher_disagreement_score":0.0029326237,"about_ca_system_score_codex":0.0016958863,"about_ca_system_score_gemma":0.0018475984,"threshold_uncertainty_score":0.012304544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3085988,0.00057300983,0.68047786,0.00047313905,0.00015664508,0.00021535702,0.0001836477,0.00035858195,0.00896287],"genre_scores_gemma":[0.95617986,0.00031407765,0.040151305,0.00008252758,0.00004711019,0.00012175215,0.00010964828,0.000031326952,0.0029625203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993826,0.00018805696,0.00003271804,0.0000873535,0.00019803309,0.00011113513],"domain_scores_gemma":[0.99877363,0.0006957607,0.00019623541,0.000060254282,0.00023026414,0.000043910026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096105353,0.00065629685,0.00036598303,0.00067574496,0.0005822193,0.0010837818,0.0010578784,0.001253273,0.0008863342],"category_scores_gemma":[0.002182028,0.00034203392,0.00045884683,0.0003468597,0.00058966724,0.0013241703,0.0005892832,0.000809179,0.00014717375],"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.00004810215,0.000059002396,0.00069590245,0.000018382627,0.000009264069,0.00007100242,0.00008979391,0.97475964,0.0026104655,0.017254075,0.00012309181,0.00426132],"study_design_scores_gemma":[0.000003132346,0.000009666494,0.00005124496,0.000001980392,0.0000029865062,0.0000034602244,0.0000062010868,0.9981913,0.00028199464,0.0012939099,0.00015192883,0.0000021778367],"about_ca_topic_score_codex":0.009269651,"about_ca_topic_score_gemma":0.006139637,"teacher_disagreement_score":0.009269651,"about_ca_system_score_codex":0.0019237871,"about_ca_system_score_gemma":0.0012903202,"threshold_uncertainty_score":0.018431425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012948699,0.00019251791,0.98441327,0.00024367568,0.00003914735,0.000023657747,0.00002919526,0.0000873012,0.0020224878],"genre_scores_gemma":[0.8395278,0.000456178,0.15398791,0.0001712793,0.00008606052,0.0001777168,0.00010812137,0.00010590219,0.005378986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000086504915,0.00000836656,0.0000415044,0.00008024528,0.000041537867],"domain_scores_gemma":[0.9995889,0.00022391957,0.00004921924,0.000017877357,0.000086687556,0.00003349659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007621341,0.00079365727,0.0007512541,0.00033499577,0.00035017828,0.000675249,0.0007775931,0.0006272897,0.0012283232],"category_scores_gemma":[0.0012338331,0.00039314455,0.000361674,0.0004614101,0.0006197196,0.000728923,0.00067925715,0.00077065,0.000164852],"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.000008209311,0.0000059779795,0.00006386645,0.000013137547,0.000005795654,0.000011306863,0.0000049519126,0.99109054,0.00028690402,0.00536517,0.00022183021,0.0029223969],"study_design_scores_gemma":[0.0000012928122,0.0000044581584,0.000009911518,8.097414e-7,5.3824783e-7,0.0000015896268,7.698201e-7,0.9990748,0.000056602268,0.00077710085,0.00007122246,8.091848e-7],"about_ca_topic_score_codex":0.0037804528,"about_ca_topic_score_gemma":0.0031354108,"teacher_disagreement_score":0.0037804528,"about_ca_system_score_codex":0.0009864508,"about_ca_system_score_gemma":0.0015704413,"threshold_uncertainty_score":0.0075169206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41267067,0.00035240225,0.58497375,0.00012486067,0.00003004984,0.000023172357,0.000015937676,0.00015585333,0.0016532489],"genre_scores_gemma":[0.9589497,0.00017686847,0.03983602,0.000040408355,0.000015090917,0.00002323056,0.00001871603,0.000017615985,0.00092239835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.00016665434,0.000030043946,0.00012138395,0.0003232266,0.00009833947],"domain_scores_gemma":[0.9975852,0.0016898201,0.00027694815,0.000115459516,0.0002947693,0.000037789592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012495492,0.00045667685,0.00044898703,0.00033328257,0.00030492042,0.00074238796,0.00047801717,0.001091841,0.00032832063],"category_scores_gemma":[0.0045990106,0.0002018419,0.00031125732,0.0004071221,0.00082646863,0.0010098673,0.00044920345,0.0005726694,0.00011837366],"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.0004204327,0.00010211479,0.0041562133,0.00010183404,0.00009511086,0.0005660082,0.0002484602,0.8466132,0.0888113,0.01573466,0.000115233735,0.043035336],"study_design_scores_gemma":[0.0000052481614,0.000054544646,0.0005792957,0.000004779768,0.00000939824,0.000054501903,0.000012141319,0.99181795,0.0065156813,0.0008716937,0.000065794964,0.000008970308],"about_ca_topic_score_codex":0.0018941864,"about_ca_topic_score_gemma":0.0012744131,"teacher_disagreement_score":0.0018941864,"about_ca_system_score_codex":0.00047802262,"about_ca_system_score_gemma":0.00042843318,"threshold_uncertainty_score":0.006608367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026728706,0.00040779074,0.9938647,0.00019587392,0.00016335034,0.0000836573,0.000030015271,0.00020091861,0.0023808114],"genre_scores_gemma":[0.20542938,0.0011635111,0.78280234,0.00043351782,0.00037242778,0.00058919884,0.00024006962,0.0001628352,0.008806668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.00046843736,0.00009160479,0.00023925348,0.0004613645,0.00015913889],"domain_scores_gemma":[0.9990336,0.000423161,0.000090009475,0.0001238164,0.00027359408,0.00005585288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888244,0.0007083748,0.0007475676,0.0010000784,0.0012451255,0.0015216736,0.0017529165,0.0012753487,0.0033742418],"category_scores_gemma":[0.0054140333,0.00030417394,0.0004411089,0.0016733682,0.0009062414,0.0015229603,0.0014094663,0.0014284961,0.00089636346],"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.00035998135,0.000116429765,0.00069273706,0.00017772797,0.00005415499,0.00014739731,0.00026090263,0.465397,0.0059089917,0.20746677,0.012553347,0.30686453],"study_design_scores_gemma":[0.00004146784,0.000039266426,0.00006395301,0.000013994562,0.000007034975,0.000052953113,0.00001653113,0.9760734,0.0007748121,0.017720833,0.0051838933,0.000011819572],"about_ca_topic_score_codex":0.006805804,"about_ca_topic_score_gemma":0.0062299334,"teacher_disagreement_score":0.006805804,"about_ca_system_score_codex":0.0013955708,"about_ca_system_score_gemma":0.002892352,"threshold_uncertainty_score":0.0135324},"labels":[],"label_agreement":null}]}