{"meta":{"query_hash":"541fb6ba9b96","filters":{"venue":"Journal of Communications and Networks"},"cohort_total":41,"direct_labels_cover":0,"predictions_cover":41,"exported":41,"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/541fb6ba9b96","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Communications+and+Networks"},"results":[{"id":"W1964624053","doi":"10.1109/jcn.2009.6388407","title":"Build-in wiretap channel I with feedback and LDPC codes","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Computer science; Channel (broadcasting); Computer network; Randomness; Binary erasure channel; Information-theoretic security; Decoding methods; Theoretical computer science; Binary symmetric channel; Transmission (telecommunications); Parity bit; Computer security; Telecommunications; Algorithm; Channel capacity; Cryptography; Mathematics; Statistics","score_opus":0.00975721931005988,"score_gpt":0.23394871656403124,"score_spread":0.22419149725397136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964624053","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.049868137,0.00023695632,0.9399926,0.00036350286,0.00006316084,0.00011953403,0.0002572441,0.00084834546,0.008250441],"genre_scores_gemma":[0.86362606,0.00049303815,0.12815163,0.00015138861,0.000051489158,0.0002785464,0.00022626943,0.00007539003,0.006946339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.00026328617,0.000039051905,0.00017091025,0.0002916915,0.0001761854],"domain_scores_gemma":[0.99858415,0.0005909636,0.00022004063,0.00032380852,0.00019941351,0.00008174881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065876707,0.0007270846,0.0006137833,0.0004640051,0.0006765598,0.0008179706,0.0008160737,0.00088074384,0.0017616759],"category_scores_gemma":[0.0021004705,0.0003575926,0.00045607216,0.0006683128,0.0014220828,0.0015076918,0.0018752462,0.0013425542,0.00048645565],"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.0009528106,0.00016020577,0.0015128243,0.0004513116,0.00008626553,0.002186738,0.00083495356,0.25556764,0.09034973,0.5812987,0.006034401,0.06056439],"study_design_scores_gemma":[0.00008802956,0.00032053195,0.00021317859,0.000046854093,0.00005067044,0.00068564125,0.00007817775,0.859089,0.06778568,0.062554225,0.008987917,0.00010010364],"about_ca_topic_score_codex":0.0013646303,"about_ca_topic_score_gemma":0.00084254483,"teacher_disagreement_score":0.0017616759,"about_ca_system_score_codex":0.0006806578,"about_ca_system_score_gemma":0.0009731441,"threshold_uncertainty_score":0.0058934093},"labels":[],"label_agreement":null},{"id":"W1972245690","doi":"10.1109/jcn.2000.6596716","title":"On higher layer protocol performance in CDMA S-ALOHA networks with packet combining in Rayleigh fading channels","year":2000,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","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":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Physical layer; Aloha; Media access control; Retransmission; Rayleigh fading; Data link layer; Protocol stack; Network packet; Fading; Network layer; Throughput; Link layer; Channel (broadcasting); Wireless; Layer (electronics); Wireless sensor network; Telecommunications","score_opus":0.03814669962710386,"score_gpt":0.308141098815762,"score_spread":0.26999439918865814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972245690","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.9468837,0.0008227133,0.046294626,0.00021275094,0.000030605308,0.000056986297,0.000045441757,0.00023920299,0.005414047],"genre_scores_gemma":[0.99418855,0.00022555307,0.004874305,0.000020746755,0.000013534693,0.000018471597,0.000022564589,0.000015525819,0.00062084646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805224,0.00082707853,0.0000775986,0.00013140307,0.00061709585,0.00029455734],"domain_scores_gemma":[0.98757917,0.009352925,0.0008135376,0.0007501259,0.0013558851,0.00014837537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207569,0.000566837,0.0004754268,0.0008000455,0.00050807756,0.0011230438,0.000489105,0.00069186883,0.0011517293],"category_scores_gemma":[0.014036651,0.00027502226,0.00021530878,0.00074755447,0.0008570077,0.0018269113,0.00075099315,0.0006349022,0.00026876302],"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.0021962791,0.00040758227,0.015503868,0.0002960415,0.00016438181,0.00044302357,0.00077903,0.79588324,0.07585289,0.018751748,0.0010657241,0.08865612],"study_design_scores_gemma":[0.000038803224,0.00085731206,0.0045219394,0.000028199107,0.00008018559,0.00015639905,0.00018930099,0.9584476,0.03177249,0.0033976524,0.00047078315,0.000039369843],"about_ca_topic_score_codex":0.0026100036,"about_ca_topic_score_gemma":0.001717517,"teacher_disagreement_score":0.004207569,"about_ca_system_score_codex":0.00094136444,"about_ca_system_score_gemma":0.0006236189,"threshold_uncertainty_score":0.022252023},"labels":[],"label_agreement":null},{"id":"W2010444331","doi":"10.1109/jcn.2014.000094","title":"Power allocation framework for OFDMA-based decode-and-forward cellular relay networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Relay; Telecommunications link; Orthogonal frequency-division multiple access; Cellular network; Computer network; Power (physics); Resource allocation; Base station; Knapsack problem; Scheme (mathematics); Mathematical optimization; Orthogonal frequency-division multiplexing; Algorithm; Mathematics","score_opus":0.0236229432684266,"score_gpt":0.2850686972271793,"score_spread":0.2614457539587527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010444331","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.0025140513,0.00045184005,0.993566,0.00011127918,0.00003499605,0.00003137424,0.00002429577,0.000060941256,0.003205261],"genre_scores_gemma":[0.6698078,0.002450841,0.315347,0.00020327012,0.00021418456,0.0004154207,0.00008925382,0.00008352491,0.011388674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.00025717955,0.000024070105,0.00009987957,0.00018297597,0.0000711493],"domain_scores_gemma":[0.9996432,0.00017098068,0.000037594986,0.000027563978,0.000098977354,0.000021726853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950185,0.00093661156,0.0009507101,0.00046285128,0.00063105003,0.0011488802,0.0013873905,0.00083274813,0.0019471445],"category_scores_gemma":[0.0013950518,0.0003327825,0.00047967522,0.0006941285,0.0008137771,0.0013048222,0.0008773964,0.0010875646,0.000546682],"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.0000456358,0.00007199739,0.00016125874,0.00011460024,0.00003158773,0.00028826695,0.00023301097,0.70406765,0.005008018,0.23786972,0.0026184828,0.04948982],"study_design_scores_gemma":[0.000008440814,0.00004018121,0.000040977662,0.0000088543875,0.00001027361,0.00007145813,0.000031787804,0.97169083,0.0005405589,0.024991378,0.0025548725,0.000010321633],"about_ca_topic_score_codex":0.0028108961,"about_ca_topic_score_gemma":0.0031468887,"teacher_disagreement_score":0.0028108961,"about_ca_system_score_codex":0.001209031,"about_ca_system_score_gemma":0.0009479459,"threshold_uncertainty_score":0.008772194},"labels":[],"label_agreement":null},{"id":"W2013592174","doi":"10.1109/jcn.2008.6388356","title":"Delay-margin based traffic engineering for MPLS-DiffServ networks","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"McGill University","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Quality of service; Computer network; Traffic engineering; Heuristic; Margin (machine learning); Distributed computing","score_opus":0.01899451083958551,"score_gpt":0.22890553494535132,"score_spread":0.20991102410576581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013592174","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.008370093,0.00012128261,0.9895846,0.00004570508,0.000014065736,0.000014694754,0.000007895627,0.0000792491,0.0017623879],"genre_scores_gemma":[0.6110434,0.00036344447,0.38476545,0.000079322606,0.000052901414,0.00006582174,0.00005765468,0.000081777696,0.0034902568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997588,0.00007257953,0.0000068538216,0.000025121215,0.000118956144,0.000017673516],"domain_scores_gemma":[0.99976176,0.00012022382,0.000031145002,0.00002478698,0.00004833254,0.0000137803045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004207388,0.00049884367,0.0002914734,0.0002310295,0.000246601,0.00043188382,0.00067905034,0.0003108223,0.0009939915],"category_scores_gemma":[0.0008631817,0.00013564232,0.00022805134,0.00021941967,0.0003721082,0.00063707767,0.00048717984,0.0006628244,0.00023225415],"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.00010786107,0.000105927786,0.000359765,0.00006989717,0.000013446122,0.000054870772,0.00005558082,0.7696174,0.028671354,0.057792477,0.00076911505,0.1423823],"study_design_scores_gemma":[0.0000030433855,0.000026973896,0.000037459617,0.00000278301,0.0000019359718,0.0000158675,0.0000035234868,0.98905444,0.003544389,0.0062533673,0.0010531073,0.0000031065792],"about_ca_topic_score_codex":0.00059871015,"about_ca_topic_score_gemma":0.00081172166,"teacher_disagreement_score":0.0009939915,"about_ca_system_score_codex":0.00073944294,"about_ca_system_score_gemma":0.0003423171,"threshold_uncertainty_score":0.005365014},"labels":[],"label_agreement":null},{"id":"W2015629629","doi":"10.1109/jcn.2001.6596800","title":"Capacity improvement in cellular systems with reuse partitioning","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":12,"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 British Columbia","funders":"","keywords":"Blocking (statistics); Computer science; Markov chain; Channel (broadcasting); Reuse; Channel capacity; Call blocking; Markov process; Product (mathematics); Algorithm; Mathematics; Telecommunications; Computer network; Statistics; Quality of service","score_opus":0.03840167273524295,"score_gpt":0.2655561828666617,"score_spread":0.22715451013141877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015629629","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.57478046,0.0017421773,0.41197217,0.00026905045,0.000050352206,0.000046876252,0.00011264905,0.001225072,0.00980122],"genre_scores_gemma":[0.9907416,0.00013727223,0.008739845,0.000015034887,0.000008710451,0.000009272103,0.00002064909,0.000014680961,0.00031295035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998697,0.00050927047,0.000020539774,0.00008935491,0.00033582392,0.00034791452],"domain_scores_gemma":[0.99695396,0.0018446215,0.00026383827,0.00035041972,0.0004889236,0.00009823796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010967928,0.0005884021,0.0005255483,0.0006747883,0.0004441445,0.00058488536,0.0006552853,0.0005382087,0.001061079],"category_scores_gemma":[0.0042127585,0.00027138763,0.00031594254,0.0010312535,0.0007010705,0.0007517411,0.0007315529,0.00043754705,0.0001835219],"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.00013386141,0.0000384994,0.0010444559,0.000031999658,0.000029901354,0.000082795326,0.000049615475,0.9694584,0.007808883,0.0058482685,0.00036551658,0.015107787],"study_design_scores_gemma":[0.0000059370423,0.00006286901,0.00028857536,0.0000030847211,0.000012890826,0.00003667736,0.000014936973,0.9952302,0.002646636,0.0013786567,0.00031270267,0.000006856146],"about_ca_topic_score_codex":0.012454708,"about_ca_topic_score_gemma":0.007935332,"teacher_disagreement_score":0.012454708,"about_ca_system_score_codex":0.0016823298,"about_ca_system_score_gemma":0.0011143863,"threshold_uncertainty_score":0.024764419},"labels":[],"label_agreement":null},{"id":"W2027478935","doi":"10.1109/jcn.2005.6387857","title":"Towards the next generation mobile communications","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","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":"Carleton University; University of Ottawa","funders":"","keywords":"Interoperation; Computer science; Software deployment; Mobile telephony; Telecommunications; Communications system; Mobile computing; Computer network; Distributed computing; Mobile radio; Interoperability; World Wide Web","score_opus":0.1411461511776464,"score_gpt":0.3474151161976295,"score_spread":0.2062689650199831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027478935","genre_codex":"other","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.01654472,0.15207744,0.15574153,0.111382864,0.012493858,0.00015486871,0.0003002831,0.0012494535,0.55005497],"genre_scores_gemma":[0.2308647,0.2314885,0.20764266,0.03595341,0.009762327,0.00033088124,0.000927239,0.00035325807,0.2826771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950576,0.00011123928,0.000014448433,0.000045407964,0.00023751128,0.00008567122],"domain_scores_gemma":[0.9994448,0.00012462986,0.000035933987,0.000059757585,0.00019895444,0.00013591576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013065353,0.00045160306,0.00028266103,0.0005302681,0.0007341334,0.0025529917,0.00075551827,0.0036436545,0.013499756],"category_scores_gemma":[0.002016103,0.00020528623,0.00021815553,0.00051230623,0.0011335707,0.005152882,0.0022353057,0.0025521808,0.007471881],"study_design_candidate":"not_applicable","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.000067583016,0.00006710589,0.0005737116,0.00031728717,0.000015097307,0.00030485226,0.00053431065,0.0019150885,0.006059131,0.58329594,0.118901424,0.28794852],"study_design_scores_gemma":[0.0000059318204,0.00004723335,0.00024118235,0.00023989109,0.000005825889,0.00025503855,0.00023317816,0.0027608152,0.00068521407,0.07093331,0.92457795,0.000014359026],"about_ca_topic_score_codex":0.0011865643,"about_ca_topic_score_gemma":0.0015016663,"teacher_disagreement_score":0.013499756,"about_ca_system_score_codex":0.0007608239,"about_ca_system_score_gemma":0.0014551023,"threshold_uncertainty_score":0.045161247},"labels":[],"label_agreement":null},{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"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":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","score_opus":0.05751421122980483,"score_gpt":0.28816879013880614,"score_spread":0.23065457890900132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031332034","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.034356188,0.0016276832,0.95515674,0.001224736,0.00005879635,0.00012244421,0.00018651933,0.00020722976,0.0070595737],"genre_scores_gemma":[0.57967913,0.0031338797,0.4106634,0.00034594678,0.000198254,0.00044440804,0.0004904599,0.00012292407,0.0049215164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.000457938,0.00003245757,0.00011651261,0.00017685736,0.00011767171],"domain_scores_gemma":[0.9958534,0.0034210822,0.00024623825,0.00019015884,0.00019768412,0.0000915219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020123369,0.0010534558,0.0012960427,0.00069797394,0.00086194806,0.0015314997,0.0016972327,0.0015347812,0.0016152274],"category_scores_gemma":[0.005864785,0.0005511832,0.00074193213,0.0016832454,0.0013361139,0.0031180142,0.0013009097,0.0015060159,0.00021587985],"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.000081116086,0.000104078565,0.0003455467,0.00021186638,0.000052261472,0.000097027994,0.0001183748,0.88337094,0.00055576453,0.07936342,0.00350458,0.032195017],"study_design_scores_gemma":[0.00003587118,0.00003334849,0.00008464113,0.000019199764,0.000016184977,0.00005467699,0.00005718984,0.865585,0.0003930374,0.13213731,0.0015755176,0.000007971856],"about_ca_topic_score_codex":0.0025875622,"about_ca_topic_score_gemma":0.0025939741,"teacher_disagreement_score":0.0025875622,"about_ca_system_score_codex":0.0012384658,"about_ca_system_score_gemma":0.0014125139,"threshold_uncertainty_score":0.010642409},"labels":[],"label_agreement":null},{"id":"W2032301438","doi":"10.1109/jcn.2014.000008","title":"Robust relay design for two-way multi-antenna relay systems with imperfect CSI","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","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 Victoria","funders":"","keywords":"Relay; Computer science; Robustness (evolution); Relay channel; Mathematical optimization; Channel state information; Semidefinite programming; Upper and lower bounds; Optimization problem; Beamforming; Convex optimization; Transmitter power output; Control theory (sociology); Channel (broadcasting); Algorithm; Wireless; Telecommunications; Power (physics); Regular polygon; Mathematics; Transmitter","score_opus":0.08228219557442572,"score_gpt":0.2903345700520073,"score_spread":0.20805237447758157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032301438","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.006217761,0.00022506945,0.9922386,0.00007341321,0.000016095415,0.000024605617,0.000026524556,0.00009565186,0.0010824047],"genre_scores_gemma":[0.8316574,0.00064883195,0.16520658,0.00008607238,0.00004198643,0.00013890932,0.000070096845,0.00004631607,0.0021037988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905294,0.0003823819,0.000054957625,0.0002315789,0.0002017553,0.00007648148],"domain_scores_gemma":[0.99888366,0.0005833649,0.00023638847,0.00012343896,0.00013979904,0.00003335957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013514606,0.0011981535,0.0010661863,0.0003728557,0.00031137932,0.0013533643,0.0009969819,0.0011265482,0.0017443233],"category_scores_gemma":[0.0030752982,0.0004334354,0.00072109676,0.0005000765,0.0008262107,0.0013923515,0.0009631136,0.00081214524,0.0005136105],"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.00013022385,0.00003365497,0.00029284667,0.00021917542,0.0000658146,0.00018931727,0.00010454763,0.9311724,0.012242713,0.025631506,0.0006001828,0.029317625],"study_design_scores_gemma":[0.00001591613,0.00011920592,0.00007237903,0.000008966247,0.000019090634,0.00008017637,0.000015700787,0.991524,0.00278076,0.0046458957,0.00070520764,0.000012674642],"about_ca_topic_score_codex":0.00058185845,"about_ca_topic_score_gemma":0.0005019842,"teacher_disagreement_score":0.0017443233,"about_ca_system_score_codex":0.0006570995,"about_ca_system_score_gemma":0.00062395504,"threshold_uncertainty_score":0.007147312},"labels":[],"label_agreement":null},{"id":"W2036170814","doi":"10.1109/jcn.2003.6596557","title":"Approaching near-capacity on a multi-antenna channel using successive decoding and interference cancellation receivers","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Computer science; Transmitter; Decoding methods; Rayleigh fading; Minimum mean square error; Channel (broadcasting); Antenna (radio); Single antenna interference cancellation; 3G MIMO; Multi-user MIMO; Channel capacity; Interference (communication); Fading; Precoding; Telecommunications; Algorithm; Electronic engineering; Mathematics; Statistics; Engineering","score_opus":0.06800085096254285,"score_gpt":0.28908918730911193,"score_spread":0.22108833634656908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036170814","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.08141248,0.00041314887,0.9089286,0.00024881455,0.00004197593,0.000033041113,0.00005157753,0.00057039614,0.008300003],"genre_scores_gemma":[0.9059102,0.00035739766,0.090131134,0.0001318437,0.000061950675,0.00007811965,0.00008481199,0.00005722833,0.0031871647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863535,0.0005005732,0.000040180163,0.00011526448,0.0004881521,0.00022037659],"domain_scores_gemma":[0.9957605,0.0030042173,0.0003087949,0.00032466746,0.00049810903,0.00010383994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013549189,0.0008188195,0.0009210619,0.00044441788,0.0004997336,0.00086886145,0.00078409567,0.00095196447,0.0014709788],"category_scores_gemma":[0.005842406,0.00036774203,0.0004680784,0.00050657557,0.001465911,0.001563071,0.0013161742,0.00093522365,0.00070096395],"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.00019384864,0.000032196793,0.00035283595,0.00008299177,0.00003480998,0.00018717222,0.00018111862,0.91477644,0.009674654,0.047756746,0.0005850457,0.026142128],"study_design_scores_gemma":[0.000013007099,0.00005100398,0.00007583143,0.000010549806,0.000006766637,0.00006803355,0.000022952403,0.9811943,0.004771331,0.013271987,0.00049715413,0.000017002954],"about_ca_topic_score_codex":0.0016878037,"about_ca_topic_score_gemma":0.0012944797,"teacher_disagreement_score":0.0016878037,"about_ca_system_score_codex":0.0007498215,"about_ca_system_score_gemma":0.0008400845,"threshold_uncertainty_score":0.007165551},"labels":[],"label_agreement":null},{"id":"W2036786089","doi":"10.1109/jcn.2009.6391334","title":"End-to-end quality of service constrained routing and admission control for MPLS networks","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.029095801548599316,"score_gpt":0.3049047324052127,"score_spread":0.2758089308566134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036786089","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.030621096,0.0005822658,0.96634096,0.00031572641,0.000037484017,0.000054357704,0.000027970384,0.00024890367,0.0017712085],"genre_scores_gemma":[0.82148063,0.00062650006,0.17479108,0.00013010141,0.000071245784,0.00017087358,0.00008682655,0.000052415347,0.0025903247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986841,0.00051542086,0.00004593843,0.00010658963,0.0005138855,0.00013405812],"domain_scores_gemma":[0.9988471,0.00068083266,0.00014588697,0.00009327803,0.00018037447,0.000052451334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480291,0.0005914938,0.0005604615,0.00059073436,0.0007046679,0.0013254213,0.0014230276,0.0009906702,0.0008582261],"category_scores_gemma":[0.0032555815,0.00036556055,0.00036060586,0.00061012985,0.0008496888,0.0013364111,0.0009891108,0.0011106166,0.0001644286],"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.00012366899,0.000089718764,0.00041735318,0.00008685215,0.00003565347,0.000083818944,0.00008294021,0.8730951,0.0068801246,0.03755611,0.0010202089,0.080528356],"study_design_scores_gemma":[0.000004908703,0.000007188396,0.000042554093,0.0000026501714,0.000004235168,0.000009725019,0.00000548901,0.9942222,0.0011111009,0.0042486293,0.00033690452,0.000004365533],"about_ca_topic_score_codex":0.0055060196,"about_ca_topic_score_gemma":0.0041021802,"teacher_disagreement_score":0.0055060196,"about_ca_system_score_codex":0.0015990265,"about_ca_system_score_gemma":0.0018270036,"threshold_uncertainty_score":0.011601806},"labels":[],"label_agreement":null},{"id":"W2038489696","doi":"10.1109/jcn.2014.000091","title":"Composite differential evolution aided channel allocation in OFDMA systems with proportional rate constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Telecommunications link; Differential evolution; Orthogonal frequency-division multiple access; Code (set theory); Mathematical optimization; Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Set (abstract data type); Telecommunications; Mathematics","score_opus":0.0072301761256411134,"score_gpt":0.2043708895328796,"score_spread":0.1971407134072385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038489696","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.06357691,0.00023774093,0.9330203,0.00011578184,0.000025036235,0.000029531899,0.000018729006,0.00007986201,0.0028962237],"genre_scores_gemma":[0.88518023,0.00018276297,0.11084925,0.0000666988,0.00001578515,0.00011267177,0.000033248238,0.0000188387,0.0035404346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975604,0.00009202,0.000006661769,0.000034611414,0.00007734043,0.00003326266],"domain_scores_gemma":[0.9995011,0.00033028654,0.0000507458,0.000022333677,0.00007381647,0.000021644355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048402252,0.0003347193,0.00048309856,0.00027509575,0.00021364295,0.00040737208,0.0005142123,0.00039682857,0.0007198794],"category_scores_gemma":[0.0013981855,0.0001900279,0.0002703701,0.00043671578,0.0005046478,0.00035572407,0.0005266372,0.00040343098,0.00008649948],"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.000049938277,0.000028427907,0.0004515374,0.000030031008,0.000023638806,0.000059649392,0.00004189493,0.95615196,0.0032825088,0.00880882,0.00027850122,0.030793156],"study_design_scores_gemma":[0.0000057263746,0.000017885632,0.00006226639,0.0000011521896,0.000002822476,0.000012062282,0.0000023687437,0.9981183,0.00056782365,0.0010048447,0.00020269559,0.000002022214],"about_ca_topic_score_codex":0.0018696152,"about_ca_topic_score_gemma":0.0015752525,"teacher_disagreement_score":0.0018696152,"about_ca_system_score_codex":0.0004920613,"about_ca_system_score_gemma":0.00066410797,"threshold_uncertainty_score":0.003717482},"labels":[],"label_agreement":null},{"id":"W2040608916","doi":"10.1109/jcn.2004.6596576","title":"Turbo decoding for precoded systems over multipath fading channels","year":2004,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Advantech AMT (Canada)","funders":"","keywords":"Computer science; Rician fading; Precoding; Fading; Turbo equalizer; Turbo code; Rayleigh fading; Channel state information; Algorithm; Decoding methods; Multipath propagation; Turbo; Serial concatenated convolutional codes; Channel (broadcasting); Electronic engineering; MIMO; Telecommunications; Concatenated error correction code; Block code; Wireless; Engineering","score_opus":0.024980513044098197,"score_gpt":0.2825244252757525,"score_spread":0.2575439122316543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040608916","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.018026562,0.0011291513,0.9772109,0.00017856894,0.00008151371,0.00002954718,0.000047826896,0.00036993393,0.0029260053],"genre_scores_gemma":[0.7260016,0.0022160122,0.2652368,0.00013448075,0.00014815388,0.00011399189,0.00016631752,0.000066059576,0.0059165186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993926,0.0002556659,0.00003547229,0.000041023195,0.00021771232,0.000057541973],"domain_scores_gemma":[0.99892837,0.0005495866,0.00007766554,0.00013598969,0.00028596158,0.00002252731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006083339,0.00062126905,0.0005500684,0.00042368358,0.00044624537,0.000705215,0.0004931474,0.0009093795,0.001054691],"category_scores_gemma":[0.0029678012,0.00025710545,0.00036768874,0.0006411692,0.0005825615,0.000718322,0.00045487797,0.00065405865,0.00044378094],"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.00013998344,0.00001834907,0.0005352232,0.00015930786,0.00005699168,0.00043222838,0.00011641636,0.806782,0.011789272,0.060798034,0.0017873029,0.117384896],"study_design_scores_gemma":[0.000009833244,0.000056483917,0.00008896937,0.000012422374,0.000012634205,0.00013352203,0.00000906434,0.982088,0.0032126762,0.012920227,0.0014438655,0.000012331792],"about_ca_topic_score_codex":0.003253835,"about_ca_topic_score_gemma":0.0037018168,"teacher_disagreement_score":0.003253835,"about_ca_system_score_codex":0.000564924,"about_ca_system_score_gemma":0.0012886873,"threshold_uncertainty_score":0.006469786},"labels":[],"label_agreement":null},{"id":"W2049091044","doi":"10.1109/jcn.2007.6182815","title":"Dual diversity over correlated Ricean fading channels","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Medical Research Council; University of Ottawa","keywords":"Fading; Computer science; Probability density function; Algorithm; Signal-to-noise ratio (imaging); Bit error rate; Maximal-ratio combining; Convergence (economics); Diversity combining; Statistics; Diversity scheme; Mathematics; Telecommunications; Decoding methods","score_opus":0.01756772059990494,"score_gpt":0.2598982957517262,"score_spread":0.24233057515182124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049091044","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.4283306,0.0006391022,0.5612048,0.0001595333,0.000039117807,0.000029119969,0.00009332682,0.00025080596,0.00925365],"genre_scores_gemma":[0.97766215,0.00038525605,0.02064571,0.000032987642,0.000025137233,0.000023673818,0.00004240115,0.000012636445,0.0011700551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.00027538824,0.000034051583,0.00011607205,0.0004371349,0.00020207718],"domain_scores_gemma":[0.9967996,0.0016997178,0.00045885492,0.00036489477,0.00056372985,0.00011310448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293453,0.0010598535,0.0009687657,0.0007100026,0.00048904744,0.0012578076,0.0005854099,0.0007331113,0.0008839386],"category_scores_gemma":[0.004199912,0.00039869454,0.00051752647,0.0009993055,0.0009789454,0.0010692629,0.001560034,0.00061705185,0.00042236754],"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.0008594445,0.00008791441,0.005591523,0.00016174084,0.00017999634,0.0010048662,0.00027170836,0.8761763,0.039883677,0.027842792,0.00058787735,0.04735219],"study_design_scores_gemma":[0.000021541719,0.00013466322,0.000678567,0.00001410472,0.000042398242,0.00041400155,0.000046277513,0.9801792,0.01215558,0.0059903143,0.00029621858,0.000027137203],"about_ca_topic_score_codex":0.00063932606,"about_ca_topic_score_gemma":0.0005709507,"teacher_disagreement_score":0.001293453,"about_ca_system_score_codex":0.00066575437,"about_ca_system_score_gemma":0.0007391622,"threshold_uncertainty_score":0.006840527},"labels":[],"label_agreement":null},{"id":"W2055168151","doi":"10.1109/jcn.2003.6596561","title":"Performance of multicarrier-CDMA uplink with antenna arrays and multiuser detection","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Telecommunications link; Computer science; Multipath propagation; Rayleigh fading; Fading; Asynchronous communication; Multiuser detection; Code division multiple access; Antenna (radio); Channel (broadcasting); Electronic engineering; Antenna array; Algorithm; Telecommunications; Engineering","score_opus":0.018943008505360848,"score_gpt":0.2568081394470939,"score_spread":0.23786513094173306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055168151","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.86138684,0.0008076841,0.13068557,0.00017882643,0.000059918035,0.000027241587,0.00009061126,0.00050316047,0.0062600942],"genre_scores_gemma":[0.99141264,0.00011636672,0.007825117,0.00002684748,0.000016648959,0.000010015307,0.00004450358,0.000015779973,0.00053204317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872214,0.0005027148,0.00004621222,0.00014596904,0.0003520856,0.00023087695],"domain_scores_gemma":[0.9971565,0.0013837961,0.0002664498,0.00037288683,0.0007122838,0.0001080262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009516648,0.00066076167,0.0007127489,0.00039333553,0.0005165147,0.0008888291,0.00043959793,0.00089198304,0.000725278],"category_scores_gemma":[0.004443116,0.00024637094,0.00027937896,0.0005146315,0.0006663771,0.0008131883,0.000614462,0.0004337764,0.00028457463],"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.00083749864,0.00010174497,0.0059386212,0.00016448885,0.000118338205,0.00033353845,0.00015447775,0.9240675,0.03574102,0.004689618,0.00035727955,0.027495952],"study_design_scores_gemma":[0.000019458448,0.0002286489,0.0018701127,0.00000677463,0.00003263367,0.00015190292,0.000039255603,0.98248166,0.014137531,0.0008375542,0.00017699042,0.000017607144],"about_ca_topic_score_codex":0.0032864457,"about_ca_topic_score_gemma":0.0017554339,"teacher_disagreement_score":0.0032864457,"about_ca_system_score_codex":0.0005913422,"about_ca_system_score_gemma":0.00080676365,"threshold_uncertainty_score":0.006534636},"labels":[],"label_agreement":null},{"id":"W2070943779","doi":"10.1109/jcn.2014.000009","title":"An opportunistic channel access scheme for interweave cognitive radio systems","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Channel (broadcasting); Idle; Throughput; Computer network; Cognition; Scheme (mathematics); Telecommunications; Wireless; Mathematics","score_opus":0.050708089932740466,"score_gpt":0.32132479115276263,"score_spread":0.2706167012200222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070943779","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.04764341,0.0004998901,0.94738775,0.00013374406,0.00009269898,0.00009704574,0.000041059477,0.0003669135,0.003737408],"genre_scores_gemma":[0.9543189,0.00018645063,0.04419416,0.00008029849,0.000045032844,0.000087144064,0.000025370991,0.00001389415,0.0010487699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992575,0.00015081026,0.00003254035,0.00008746736,0.00030178152,0.00016991635],"domain_scores_gemma":[0.99886286,0.0004001487,0.00017165694,0.00020124136,0.00026392756,0.00010012069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642152,0.0005765263,0.00053474307,0.00053630705,0.0008030254,0.00075011986,0.0013140198,0.0005028702,0.0007366072],"category_scores_gemma":[0.0022626335,0.00022535186,0.00031090114,0.00051912054,0.0006602423,0.00093502935,0.0011574081,0.0006115827,0.00016304519],"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.00082118745,0.00055573805,0.0037517704,0.00021144925,0.00025653493,0.0015338062,0.00066566316,0.40736276,0.10177958,0.13151255,0.004696946,0.34685197],"study_design_scores_gemma":[0.00005044667,0.00023187704,0.00079672097,0.000015563235,0.000054780136,0.0007250662,0.00004919018,0.9683717,0.006612682,0.019117849,0.003922266,0.000051879182],"about_ca_topic_score_codex":0.0013565543,"about_ca_topic_score_gemma":0.0030531904,"teacher_disagreement_score":0.0013565543,"about_ca_system_score_codex":0.00045663616,"about_ca_system_score_gemma":0.00075104326,"threshold_uncertainty_score":0.004041612},"labels":[],"label_agreement":null},{"id":"W2080191567","doi":"10.1109/jcn.2014.000088","title":"HDRE: Coverage hole detection with residual energy in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":30,"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 Toronto","funders":"","keywords":"Computer science; Wireless sensor network; Residual; Energy (signal processing); Computer network; Key distribution in wireless sensor networks; Wireless; Quality of service; Real-time computing; Wireless network; Telecommunications; Algorithm; Statistics","score_opus":0.007946799263076766,"score_gpt":0.2114718371504416,"score_spread":0.20352503788736484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080191567","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.019122552,0.001160931,0.9777134,0.000122048645,0.00005999335,0.00007382293,0.000059224665,0.0008292401,0.00085883413],"genre_scores_gemma":[0.6947854,0.00107431,0.30121675,0.000179377,0.00009162319,0.00016894694,0.00025542142,0.000098951765,0.0021292022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987956,0.00028383572,0.000057056917,0.00020870872,0.0005707354,0.00008409754],"domain_scores_gemma":[0.9989291,0.0005238989,0.00016264705,0.0001534629,0.0001944057,0.000036390375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010652625,0.00057605037,0.000829741,0.0011738272,0.0002904304,0.0005303826,0.001305841,0.00081358134,0.0005084867],"category_scores_gemma":[0.0036916777,0.00024744016,0.00047557428,0.0009528506,0.0006223186,0.001432126,0.0009887886,0.00046331758,0.00014618156],"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.00033962418,0.0001273128,0.0048087393,0.00048666573,0.00018453797,0.0003805491,0.00022746621,0.41881785,0.035341606,0.014371044,0.0038747406,0.5210398],"study_design_scores_gemma":[0.000019427507,0.00014424753,0.0011837262,0.000022033486,0.000037353053,0.00031775143,0.00006123501,0.9818871,0.009733599,0.0046096104,0.0019559828,0.000027976408],"about_ca_topic_score_codex":0.0018121903,"about_ca_topic_score_gemma":0.0016749932,"teacher_disagreement_score":0.0018121903,"about_ca_system_score_codex":0.00043425342,"about_ca_system_score_gemma":0.0004006414,"threshold_uncertainty_score":0.0056337714},"labels":[],"label_agreement":null},{"id":"W2081975130","doi":"10.1109/jcn.2013.000068","title":"Low complexity zero-forcing beamforming for distributed massive MIMO systems in large public venues","year":2013,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 British Columbia","funders":"University of British Columbia","keywords":"Precoding; MIMO; Computer science; Beamforming; Algorithm; Computational complexity theory; Diagonal; Matrix decomposition; Matrix (chemical analysis); Control theory (sociology); Telecommunications; Topology (electrical circuits); Mathematics; Physics","score_opus":0.027305122728470056,"score_gpt":0.2539606991249963,"score_spread":0.22665557639652625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081975130","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.043517206,0.00009234881,0.9524351,0.0001843092,0.00002251341,0.000022841046,0.0000552311,0.00021882438,0.0034516908],"genre_scores_gemma":[0.85705197,0.00016116117,0.1399042,0.00007802965,0.00003233975,0.00008594729,0.00011832628,0.000020251773,0.002547721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00012870623,0.000009260082,0.000042198033,0.00009386637,0.00006496386],"domain_scores_gemma":[0.9990243,0.0005976424,0.000112782065,0.00010201435,0.00011226033,0.00005102861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053456955,0.0005409786,0.00058758754,0.00014617795,0.00039193602,0.0005369418,0.0007082745,0.000561513,0.0014197613],"category_scores_gemma":[0.0018205956,0.0003095129,0.000305841,0.0004323464,0.00055949594,0.00063060096,0.0007414176,0.00069479394,0.00046278266],"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.0000895464,0.000024720604,0.00042856412,0.000044544176,0.000013492308,0.00011575255,0.000038883183,0.96300083,0.0054632104,0.011003741,0.00067529455,0.019101458],"study_design_scores_gemma":[0.000010009614,0.00003338578,0.00012523554,0.000003142305,0.0000022062118,0.000025942987,0.00001310923,0.9961254,0.00084778026,0.0025779535,0.00023078563,0.0000050768112],"about_ca_topic_score_codex":0.00242471,"about_ca_topic_score_gemma":0.0040604672,"teacher_disagreement_score":0.00242471,"about_ca_system_score_codex":0.00047411094,"about_ca_system_score_gemma":0.00071246637,"threshold_uncertainty_score":0.0048211813},"labels":[],"label_agreement":null},{"id":"W2085267507","doi":"10.1109/jcn.2014.000092","title":"Enhancing network service survivability in large-scale failure scenarios","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Survivability; Computer science; Probabilistic logic; Scale (ratio); Service (business); Network service; Service provider; Computer network; Telecommunications network; Computer security; Risk analysis (engineering); Reliability engineering; Distributed computing; Engineering","score_opus":0.008043594305962977,"score_gpt":0.22953035460002094,"score_spread":0.22148676029405798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085267507","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.08763257,0.0002908847,0.90924203,0.00032896988,0.000027707205,0.00003577371,0.000044827473,0.00041769756,0.0019794896],"genre_scores_gemma":[0.9756689,0.00021430543,0.023353478,0.000037476373,0.00002441995,0.000023585528,0.000037522583,0.000040548995,0.00059983024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00022107137,0.000022377082,0.00011069038,0.00021022037,0.00017279925],"domain_scores_gemma":[0.9978992,0.0009877481,0.00045439487,0.00032781408,0.00018650088,0.00014427555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012195109,0.0010068541,0.0008310953,0.0006957269,0.0005778543,0.00083646446,0.0013350472,0.00090694806,0.00094600476],"category_scores_gemma":[0.0047288314,0.00031533316,0.0006377499,0.0005458229,0.000864878,0.0019630035,0.0017149093,0.0009698143,0.00014875065],"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.000043142696,0.000034796103,0.0007546235,0.000030794785,0.00001885092,0.00006419752,0.000041873758,0.97209126,0.0033809445,0.008277108,0.000287078,0.014975419],"study_design_scores_gemma":[0.0000018272192,0.000023649887,0.0001445906,0.0000020972998,0.000005376779,0.00002895272,0.000017233677,0.99486524,0.00048917864,0.0042444253,0.0001739403,0.000003437714],"about_ca_topic_score_codex":0.0036623061,"about_ca_topic_score_gemma":0.0033614952,"teacher_disagreement_score":0.0036623061,"about_ca_system_score_codex":0.0011686344,"about_ca_system_score_gemma":0.0009806495,"threshold_uncertainty_score":0.008479118},"labels":[],"label_agreement":null},{"id":"W2091421129","doi":"10.1109/jcn.2005.6389815","title":"Performance of convolutionally-coded MIMO systems with antenna selection","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","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":"Concordia University","funders":"","keywords":"Space–time block code; Computer science; Fading; Coding gain; Algorithm; MIMO; Diversity gain; Antenna diversity; Convolutional code; Block code; Coding (social sciences); Diversity combining; Telecommunications; Antenna (radio); Electronic engineering; Channel (broadcasting); Statistics; Decoding methods; Mathematics; Engineering","score_opus":0.0100264706348921,"score_gpt":0.22584425837313438,"score_spread":0.21581778773824228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091421129","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.890641,0.00083547126,0.09674184,0.0002806052,0.000063089916,0.000037204878,0.00031700524,0.000326511,0.010757312],"genre_scores_gemma":[0.99621755,0.00010532202,0.0028640989,0.000026229702,0.000009601635,0.0000079838455,0.0000689974,0.0000070717238,0.00069306506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00037823524,0.000060268478,0.00011709897,0.00036812655,0.00036557313],"domain_scores_gemma":[0.9940758,0.0036594488,0.00056359154,0.00039350698,0.0011512442,0.00015644867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015467199,0.0010194553,0.00066518446,0.00038442103,0.00042843158,0.00090254,0.0005876379,0.0009599376,0.001231356],"category_scores_gemma":[0.005602195,0.0002944741,0.00026874765,0.00070102105,0.0009436169,0.00076056446,0.0009114545,0.00047473772,0.0002764627],"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.00057995145,0.000050523635,0.0038571781,0.00006850675,0.000077332465,0.0001580089,0.00006820181,0.96957994,0.011945614,0.0037151861,0.0002866831,0.009612778],"study_design_scores_gemma":[0.000017498873,0.00017877709,0.0011520777,0.000010825271,0.00003510607,0.0000863077,0.000020287745,0.99009013,0.007291406,0.00096350664,0.00013334557,0.000020806781],"about_ca_topic_score_codex":0.008193081,"about_ca_topic_score_gemma":0.008291242,"teacher_disagreement_score":0.008193081,"about_ca_system_score_codex":0.0012243697,"about_ca_system_score_gemma":0.0014552466,"threshold_uncertainty_score":0.016290784},"labels":[],"label_agreement":null},{"id":"W2105553752","doi":"10.1109/jcn.2008.6389854","title":"A family of concatenated network codes for improved performance with generations","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Linear network coding; Erasure; Decoding methods; Concatenated error correction code; Network packet; Erasure code; Coding (social sciences); Code rate; Algorithm; Theoretical computer science; Block code; Computer network; Mathematics; Statistics","score_opus":0.04821867966487738,"score_gpt":0.26781795201358133,"score_spread":0.21959927234870394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105553752","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.09922909,0.0011844354,0.8884877,0.00051919755,0.00017857623,0.00013961829,0.0003026189,0.0010702696,0.00888852],"genre_scores_gemma":[0.7345977,0.00076580705,0.2573929,0.00018858066,0.000112464564,0.000309396,0.00035773218,0.00016807296,0.006107343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930096,0.00017579686,0.000040981155,0.000104245824,0.00029833123,0.00007966011],"domain_scores_gemma":[0.9968059,0.0011127215,0.00047445766,0.00069582317,0.00074769696,0.00016340123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000910662,0.00070156244,0.0005141998,0.0007444705,0.00068913685,0.00058682804,0.00067759445,0.00066383235,0.0011625517],"category_scores_gemma":[0.0053239013,0.000253166,0.00039860787,0.00094885856,0.0008401125,0.0009831978,0.001049567,0.0010378294,0.00054163695],"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.00059298764,0.00011644692,0.0027692881,0.00018935472,0.00012185216,0.0006786533,0.00040129255,0.51643807,0.09111626,0.17906529,0.0072200224,0.20129052],"study_design_scores_gemma":[0.000044247256,0.00019761921,0.00074536697,0.00004319301,0.000041937306,0.0008516706,0.000019261739,0.9266354,0.028250843,0.02879743,0.014298373,0.00007461802],"about_ca_topic_score_codex":0.0014141303,"about_ca_topic_score_gemma":0.002075896,"teacher_disagreement_score":0.0014141303,"about_ca_system_score_codex":0.0008619307,"about_ca_system_score_gemma":0.0013167177,"threshold_uncertainty_score":0.006253779},"labels":[],"label_agreement":null},{"id":"W2123762323","doi":"10.1109/jcn.2007.6182882","title":"Performance of SC-FDE system in UWB communications with imperfect channel estimation","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Ultra-Wideband Communications Technology","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":"University of Victoria","funders":"","keywords":"Computer science; SC-FDE; Equalization (audio); Bit error rate; Channel (broadcasting); Transmission (telecommunications); Frequency domain; Ultra-wideband; Algorithm; Minimum mean square error; Mean squared error; Block (permutation group theory); Electronic engineering; Telecommunications; Mathematics; Statistics","score_opus":0.00898655779881579,"score_gpt":0.22530217390218826,"score_spread":0.21631561610337247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123762323","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.81810445,0.00095960696,0.17473315,0.0003580493,0.00003936546,0.000024082035,0.00013637535,0.0003246691,0.0053202454],"genre_scores_gemma":[0.99463516,0.00016557603,0.0047309543,0.000024687452,0.000008016127,0.000007806372,0.000034875236,0.000009211015,0.00038369547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.00019276785,0.00002991223,0.000069617294,0.00025869365,0.0001478672],"domain_scores_gemma":[0.99542433,0.0031196114,0.00037150425,0.00028520645,0.0007398853,0.000059420498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013493565,0.0005167986,0.0006393626,0.00041547295,0.0004669687,0.0006202177,0.0003249525,0.001014384,0.00078556826],"category_scores_gemma":[0.0058958624,0.00016462532,0.00026098918,0.00047564795,0.0010212731,0.00087375054,0.00061717385,0.00049348926,0.00014404599],"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.00077256135,0.000049886494,0.006115177,0.00016243532,0.00009455685,0.0004424928,0.0002631531,0.93675655,0.025345298,0.00989519,0.0004068271,0.01969589],"study_design_scores_gemma":[0.000015339449,0.00017294413,0.002387807,0.000018196391,0.000028319317,0.00027362365,0.00005235558,0.98739284,0.008235386,0.0012581316,0.00014179916,0.000023187358],"about_ca_topic_score_codex":0.004285993,"about_ca_topic_score_gemma":0.0023444202,"teacher_disagreement_score":0.004285993,"about_ca_system_score_codex":0.00065141596,"about_ca_system_score_gemma":0.00068059715,"threshold_uncertainty_score":0.008522093},"labels":[],"label_agreement":null},{"id":"W2124297703","doi":"10.1109/jcn.2002.6596934","title":"On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":370,"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":"Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Routing protocol; Telecommunications","score_opus":0.02377303206741777,"score_gpt":0.2757971317582326,"score_spread":0.25202409969081485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124297703","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.008296354,0.0003935005,0.9897288,0.0001021748,0.00006787667,0.00010200966,0.000030988245,0.00013492696,0.0011433926],"genre_scores_gemma":[0.22309552,0.0009787502,0.77413684,0.00009655498,0.00011925927,0.00044335154,0.00016692752,0.000057304667,0.0009055345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982241,0.0008049326,0.00010160625,0.00012780732,0.00069185154,0.00004968208],"domain_scores_gemma":[0.9963243,0.0027356565,0.00017044877,0.00017594025,0.00053179485,0.000061956336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020678234,0.0010278265,0.0009578199,0.0018116126,0.0008042568,0.0009166897,0.0013580874,0.00082568737,0.0010151172],"category_scores_gemma":[0.00925751,0.00043714978,0.00076256413,0.0018179389,0.0006880921,0.0015126459,0.00094075914,0.000662765,0.0002765315],"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.00006492996,0.0000460274,0.00087930326,0.00024873184,0.000078160054,0.00012848791,0.00014338236,0.8744886,0.0026780062,0.023033764,0.0016093671,0.096601225],"study_design_scores_gemma":[0.000012955124,0.00004766504,0.00015563869,0.000024040351,0.000020193716,0.000081880156,0.000017486376,0.9839499,0.0015951284,0.0121928165,0.0018904648,0.000011773433],"about_ca_topic_score_codex":0.0012384156,"about_ca_topic_score_gemma":0.0014309189,"teacher_disagreement_score":0.0020678234,"about_ca_system_score_codex":0.000965055,"about_ca_system_score_gemma":0.0007994884,"threshold_uncertainty_score":0.010935783},"labels":[],"label_agreement":null},{"id":"W2157635692","doi":"10.1109/jcn.2002.6596933","title":"Multipath routing for mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":50,"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; Computer network; Multipath routing; Wireless ad hoc network; Mobile ad hoc network; Multipath propagation; Routing (electronic design automation); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless Routing Protocol; Routing protocol; Telecommunications; Wireless","score_opus":0.03099292896093242,"score_gpt":0.27057946885483497,"score_spread":0.23958653989390255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157635692","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.0023925398,0.045477442,0.92234886,0.0027658285,0.0029229093,0.00034447515,0.00025321098,0.003442566,0.020052183],"genre_scores_gemma":[0.12602057,0.0785624,0.7610517,0.0011780587,0.0040089306,0.0012404174,0.0010944327,0.0005740658,0.026269492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990276,0.00030441588,0.00006270623,0.000094517934,0.0004492917,0.00006138106],"domain_scores_gemma":[0.99918395,0.0003335212,0.00007449916,0.00014093034,0.00021619779,0.000050950253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074158714,0.0012542707,0.0007837255,0.0011951944,0.0007722821,0.0016441036,0.0013670777,0.0013560059,0.004750096],"category_scores_gemma":[0.003059016,0.0004213266,0.0004550239,0.002303904,0.00080917927,0.0022835266,0.0013456495,0.0017870842,0.0031164049],"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.00009596059,0.00004007304,0.00033514207,0.0013283208,0.00010148186,0.0005061479,0.00024679126,0.054248873,0.0066227745,0.2167491,0.053894404,0.6658309],"study_design_scores_gemma":[0.00007366489,0.00018347004,0.00036252508,0.0004446109,0.00008512951,0.0014309738,0.0001536852,0.15062875,0.0027850755,0.26037544,0.5833712,0.000105534775],"about_ca_topic_score_codex":0.0010426184,"about_ca_topic_score_gemma":0.0013026741,"teacher_disagreement_score":0.004750096,"about_ca_system_score_codex":0.0010924647,"about_ca_system_score_gemma":0.00094200094,"threshold_uncertainty_score":0.015890658},"labels":[],"label_agreement":null},{"id":"W2166955633","doi":"10.1109/jcn.2011.6157413","title":"IEEE 802.15.6 under saturation: Some problems to be expected","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Manitoba","funders":"","keywords":"Computer science; Markov chain; IEEE 802.15; Distributed coordination function; IEEE 802.11; Wireless; Channel (broadcasting); Body area network; Computer network; Inter-Access Point Protocol; IEEE 802.11b-1999; Wireless network; Wi-Fi; Wireless sensor network; Telecommunications; Machine learning","score_opus":0.04977944791952341,"score_gpt":0.24064433962062634,"score_spread":0.19086489170110293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166955633","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.13701983,0.021357013,0.7251503,0.07046574,0.002231914,0.00025775164,0.0002343364,0.0030939179,0.040189173],"genre_scores_gemma":[0.93524426,0.0070598284,0.047084402,0.003188916,0.0009938182,0.00017918086,0.00010235164,0.00021512572,0.0059322002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648523,0.0016720386,0.00014157289,0.00027272888,0.0011060383,0.00032231785],"domain_scores_gemma":[0.9871935,0.0073021073,0.00062357914,0.0012622044,0.0032955958,0.00032296177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008900945,0.00094042945,0.0009848389,0.00062693405,0.0012792331,0.0020189995,0.0018891484,0.0031861644,0.001944223],"category_scores_gemma":[0.023409346,0.00047223258,0.00041995887,0.0010102575,0.002321903,0.0067722746,0.00096789066,0.0030235932,0.0008891158],"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.0008072463,0.00035048518,0.038214225,0.0012626591,0.00025440834,0.0030240994,0.003859656,0.25818732,0.015082628,0.2085018,0.03788268,0.43257278],"study_design_scores_gemma":[0.00011763273,0.000833084,0.0067143915,0.0007035128,0.00013175396,0.0041405,0.0024633924,0.6756343,0.013994892,0.24854022,0.046457432,0.00026884268],"about_ca_topic_score_codex":0.005246379,"about_ca_topic_score_gemma":0.0032826194,"teacher_disagreement_score":0.008900945,"about_ca_system_score_codex":0.0014368856,"about_ca_system_score_gemma":0.0010894991,"threshold_uncertainty_score":0.047073245},"labels":[],"label_agreement":null},{"id":"W2199985122","doi":"10.1109/jcn.2011.6157410","title":"Wireless three-pad ECG system: Challenges, design, and evaluations","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":31,"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 British Columbia","funders":"Dalhousie University","keywords":"Computer science; Electrocardiography; Lead (geology); Wireless; Data mining; Artificial intelligence; Medicine; Telecommunications; Cardiology","score_opus":0.07770571878270267,"score_gpt":0.25515356949484264,"score_spread":0.17744785071213998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199985122","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.24705483,0.004064039,0.7385798,0.0015473455,0.0003127464,0.0011525367,0.00028829742,0.0017258843,0.0052745366],"genre_scores_gemma":[0.805505,0.0022778506,0.18653336,0.0004083367,0.00016476314,0.0004257099,0.0004273492,0.000101694626,0.0041559166],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869615,0.00056612416,0.00009928026,0.00013663412,0.00044264237,0.000059216105],"domain_scores_gemma":[0.99827063,0.00054222025,0.00012284862,0.00015772542,0.00078939233,0.00011724555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016620363,0.00045016172,0.00053460523,0.00043068518,0.00018755907,0.00071742205,0.0011693559,0.0008923435,0.001985613],"category_scores_gemma":[0.0032378214,0.00016299171,0.00026286338,0.00031701033,0.0002718784,0.0009700273,0.00038946664,0.0003038968,0.0007138852],"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.0028798194,0.00072805217,0.023473851,0.0025730955,0.00023256656,0.0017149963,0.0005151956,0.041801047,0.29607886,0.0043316986,0.0058428464,0.61982787],"study_design_scores_gemma":[0.0006424738,0.024358753,0.035232447,0.0002765832,0.00054178963,0.008551308,0.00054405775,0.5629965,0.32014292,0.002117833,0.044372845,0.00022244864],"about_ca_topic_score_codex":0.0007355788,"about_ca_topic_score_gemma":0.00049438287,"teacher_disagreement_score":0.001985613,"about_ca_system_score_codex":0.00033239127,"about_ca_system_score_gemma":0.0003173478,"threshold_uncertainty_score":0.008789778},"labels":[],"label_agreement":null},{"id":"W2273990441","doi":"10.1109/jcn.2001.6596962","title":"SELFCON: An architecture for self-configuration of networks","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Configuration Management (ITSM); Computer science; Network management application; Network management station; Element management system; Provisioning; Distributed computing; Directory service; Structure of Management Information; Network management; Computer network; Network architecture; Directory; Operating system","score_opus":0.01842326331975024,"score_gpt":0.26508163532772144,"score_spread":0.2466583720079712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273990441","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.018529726,0.00025002917,0.939768,0.00034346996,0.00009658523,0.00024396794,0.0001171156,0.024772458,0.015878659],"genre_scores_gemma":[0.40774962,0.0007714602,0.5590002,0.0004823786,0.000108521155,0.0004951883,0.0015805358,0.0014735291,0.02833855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920446,0.0001850643,0.00007080278,0.00014588641,0.00030832476,0.00008553839],"domain_scores_gemma":[0.9988991,0.0001246752,0.00009351491,0.00048135244,0.0002567133,0.00014468245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013460777,0.0003729652,0.00033642107,0.0006523066,0.000790914,0.001999083,0.0018274393,0.0007889821,0.0031572927],"category_scores_gemma":[0.0015238008,0.00050314516,0.00029152344,0.0005292111,0.00085515185,0.002771113,0.00235022,0.0009811433,0.0013056763],"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.00054868,0.00040445634,0.005980901,0.00033192753,0.00012984098,0.00072465907,0.0015848279,0.14272675,0.033626318,0.29655233,0.05480031,0.46258897],"study_design_scores_gemma":[0.000073845324,0.00020257397,0.0014766529,0.00008701694,0.000058294354,0.00056757545,0.00016270229,0.70878744,0.022245979,0.06355477,0.20268881,0.00009432547],"about_ca_topic_score_codex":0.0025375301,"about_ca_topic_score_gemma":0.003374795,"teacher_disagreement_score":0.0031572927,"about_ca_system_score_codex":0.00097061804,"about_ca_system_score_gemma":0.0012954941,"threshold_uncertainty_score":0.0105621815},"labels":[],"label_agreement":null},{"id":"W2280203714","doi":"10.1109/jcn.2007.6182854","title":"Performance and energy consumption analysis of 802.11 with FEC codes over wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Energy consumption; Forward error correction; Wireless sensor network; Computer network; Wireless; Telecommunications; Decoding methods; Electrical engineering","score_opus":0.012621643007529094,"score_gpt":0.242734154081111,"score_spread":0.23011251107358188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280203714","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.95904374,0.00036643763,0.03775022,0.0001609449,0.000015887525,0.000027504007,0.00008324166,0.00029448472,0.002257585],"genre_scores_gemma":[0.99729025,0.00010109558,0.0022493887,0.0000100935895,0.000002934857,0.000011372688,0.000048908874,0.000011322184,0.00027463914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00022632052,0.000037225105,0.00007025032,0.00032870172,0.000116892006],"domain_scores_gemma":[0.9974421,0.0016631169,0.0001722408,0.00021793574,0.00047680872,0.000027697803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007970933,0.0006899491,0.00041983215,0.000839152,0.00028560206,0.00034848216,0.00058259786,0.0005020059,0.00048364408],"category_scores_gemma":[0.004221377,0.00017570185,0.00024208945,0.0007624596,0.00048332586,0.0009313067,0.00024070645,0.00026580214,0.0001043056],"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.0004003508,0.000107676366,0.005370642,0.00006540463,0.00004037964,0.00013877862,0.000061034156,0.9563137,0.013453959,0.0021718445,0.00025733688,0.021618864],"study_design_scores_gemma":[0.000004264963,0.00012105747,0.0015475132,0.0000035958185,0.000008884488,0.00006558334,0.000016530137,0.99161166,0.0061283745,0.00037645097,0.000109849454,0.000006218512],"about_ca_topic_score_codex":0.002767996,"about_ca_topic_score_gemma":0.0019099304,"teacher_disagreement_score":0.002767996,"about_ca_system_score_codex":0.0010025058,"about_ca_system_score_gemma":0.00034093778,"threshold_uncertainty_score":0.0072737336},"labels":[],"label_agreement":null},{"id":"W2284453291","doi":"10.1109/jcn.2005.6389819","title":"Interactive conflict detection and resolution for personalized features","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":12,"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 Outaouais; Institut national de psychiatrie légale Philippe-Pinel; University of Ottawa","funders":"","keywords":"Computer science; Telephony; Terminology; Feature (linguistics); Set (abstract data type); Voice over IP; User Friendly; Order (exchange); The Internet; Human–computer interaction; World Wide Web; Telecommunications; Programming language","score_opus":0.014871631935634469,"score_gpt":0.27885667315626383,"score_spread":0.2639850412206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284453291","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.033886593,0.00016835201,0.9542164,0.0005009842,0.0000712642,0.00028964021,0.00011293967,0.0056579835,0.0050958483],"genre_scores_gemma":[0.39592633,0.00009798838,0.5976957,0.00029838106,0.00005250249,0.00034756647,0.0003355393,0.00066736643,0.0045786025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9895974,0.004753962,0.00075430085,0.0014081091,0.0027424896,0.0007437291],"domain_scores_gemma":[0.9693226,0.023492109,0.0016203114,0.0030506642,0.0019445665,0.0005698842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009090568,0.0010335565,0.0011782285,0.0023909665,0.0017841359,0.0034973044,0.0030965495,0.0021452561,0.007976501],"category_scores_gemma":[0.036837384,0.0008904613,0.0010564337,0.0013159836,0.0020159022,0.0056743585,0.004551354,0.0021405169,0.0013174716],"study_design_candidate":"not_applicable","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.001834324,0.00046041643,0.009841997,0.0007146878,0.0001913721,0.0023344911,0.008401893,0.034379393,0.04073223,0.11604431,0.013490454,0.77157444],"study_design_scores_gemma":[0.00017549218,0.00025685178,0.0027472037,0.00013435603,0.00012613388,0.0012477664,0.0016992716,0.73817617,0.060877822,0.15668303,0.037663996,0.00021194234],"about_ca_topic_score_codex":0.0018312852,"about_ca_topic_score_gemma":0.0020911063,"teacher_disagreement_score":0.009090568,"about_ca_system_score_codex":0.0013151116,"about_ca_system_score_gemma":0.0014728997,"threshold_uncertainty_score":0.048076093},"labels":[],"label_agreement":null},{"id":"W2286495892","doi":"10.1109/jcn.2011.6157479","title":"Recent advances in filter topologies and realizations for satellite communications","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Microwave Engineering and Waveguides","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Network topology; Communications satellite; Implementation; Electronic engineering; Filter (signal processing); Microwave transmission; Waveguide filter; Modular design; Transfer function; Microwave; Satellite; Telecommunications; Topology (electrical circuits); Filter design; Electrical engineering; Prototype filter; Computer network; Aerospace engineering; Engineering","score_opus":0.04621030248702551,"score_gpt":0.2730182243535175,"score_spread":0.226807921866492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286495892","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05077493,0.06091777,0.83003175,0.0007725409,0.0006605127,0.0000754911,0.00016779479,0.0012107594,0.05538845],"genre_scores_gemma":[0.35802597,0.07733762,0.53861654,0.00035222445,0.0011609881,0.00018929236,0.00066160667,0.00055694376,0.02309885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972254,0.00005804275,0.000019866813,0.000055166856,0.00012273328,0.00002162051],"domain_scores_gemma":[0.9996074,0.0001766635,0.000036373156,0.000052271356,0.00011167504,0.000015704949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052999984,0.0005149718,0.0004903902,0.0007543755,0.00029686085,0.000796292,0.0005276408,0.00072097714,0.005127707],"category_scores_gemma":[0.0008009856,0.00034348428,0.00052698265,0.0007152941,0.00028341255,0.0015885419,0.00027726358,0.0007977677,0.0020292066],"study_design_candidate":"not_applicable","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.00030070476,0.00017233193,0.0007015841,0.0019462907,0.0000871423,0.00035344658,0.00033283205,0.046897773,0.16400053,0.14983816,0.0074575697,0.6279117],"study_design_scores_gemma":[0.00007209858,0.00088839204,0.0008818636,0.000375454,0.00019753457,0.0029477498,0.00017552976,0.22081953,0.09385974,0.0553458,0.62430954,0.00012680901],"about_ca_topic_score_codex":0.00025233152,"about_ca_topic_score_gemma":0.000356808,"teacher_disagreement_score":0.005127707,"about_ca_system_score_codex":0.00040900972,"about_ca_system_score_gemma":0.00025610017,"threshold_uncertainty_score":0.01715386},"labels":[],"label_agreement":null},{"id":"W2328058829","doi":"10.1109/jcn.2016.000013","title":"Impact of trust-based security association and mobility on the delay metric in MANET","year":2016,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Metric (unit); Mobile ad hoc network; Computer network; Computer security; Association (psychology); Telecommunications; Business; Network packet","score_opus":0.01539669572079831,"score_gpt":0.27570271071491353,"score_spread":0.2603060149941152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328058829","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.81757563,0.0041632615,0.17060272,0.0013270554,0.00019042694,0.00007207403,0.00023210644,0.00018800156,0.005648746],"genre_scores_gemma":[0.9973066,0.0003342854,0.0020882052,0.000015289288,0.000011089237,0.0000074915483,0.000019108167,0.000009487045,0.0002084906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871886,0.00055644667,0.00006347068,0.00015052111,0.00026066942,0.0002501555],"domain_scores_gemma":[0.9836728,0.012910074,0.0016022901,0.0005508791,0.0008175938,0.00044642814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022036938,0.0007833253,0.00065128406,0.0011481007,0.0006039902,0.001149697,0.0007192543,0.00091684726,0.00054482307],"category_scores_gemma":[0.016343439,0.0003071416,0.00035205545,0.0009784759,0.0013739399,0.0023229725,0.0010451339,0.0007929221,0.00007014395],"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.00025731054,0.000043119253,0.0050252513,0.00008062431,0.000059816535,0.00031794098,0.00009487526,0.9693936,0.0048372676,0.012737437,0.00029608578,0.0068567665],"study_design_scores_gemma":[0.000012637194,0.00021799983,0.0018484271,0.000020514617,0.000055358258,0.00028406325,0.0001281671,0.9892707,0.0027909966,0.004954357,0.00038214703,0.000034665183],"about_ca_topic_score_codex":0.004190205,"about_ca_topic_score_gemma":0.0022260374,"teacher_disagreement_score":0.004190205,"about_ca_system_score_codex":0.0022008324,"about_ca_system_score_gemma":0.00087253796,"threshold_uncertainty_score":0.015968204},"labels":[],"label_agreement":null},{"id":"W2601455897","doi":"10.1109/jcn.2017.000007","title":"Competition-based distributed BS power activation and user scheduling algorithm","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Scheduling (production processes); Base station; Computer network; Throughput; Distributed computing; Cellular network; Enhanced Data Rates for GSM Evolution; Maximum throughput scheduling; Algorithm; Fair-share scheduling; Quality of service; Round-robin scheduling; Telecommunications; Mathematical optimization; Wireless","score_opus":0.012057179836194299,"score_gpt":0.2514851949822896,"score_spread":0.2394280151460953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601455897","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.043668192,0.0001993691,0.94885975,0.00030811675,0.0000712799,0.0001208792,0.0000601122,0.00039713274,0.0063152635],"genre_scores_gemma":[0.85044426,0.00010489261,0.1452264,0.00017273084,0.000047260546,0.00020537603,0.0001241861,0.000044172328,0.0036307834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994765,0.00013260242,0.000019334237,0.00010346873,0.00015325588,0.00011498724],"domain_scores_gemma":[0.99930227,0.00031671402,0.000068665504,0.000045444463,0.00017548603,0.000091513975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080949895,0.0005548508,0.0008986961,0.00038694387,0.0004929641,0.00054191344,0.0014704809,0.00071417267,0.0026630673],"category_scores_gemma":[0.0012609012,0.00029306283,0.0003602823,0.00058209,0.0005946491,0.00053667853,0.0009088597,0.0007442555,0.0004213495],"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.00014633153,0.00010443402,0.0007197245,0.000031456217,0.000025895619,0.000039623563,0.000043117052,0.94888616,0.002470328,0.0075448933,0.0020641182,0.037924007],"study_design_scores_gemma":[0.000022584883,0.000021155842,0.000054914017,8.0473103e-7,0.0000025879613,0.000010793059,0.0000037015368,0.99871826,0.00020327016,0.000781765,0.00017773181,0.0000023907307],"about_ca_topic_score_codex":0.0060694795,"about_ca_topic_score_gemma":0.006155649,"teacher_disagreement_score":0.0060694795,"about_ca_system_score_codex":0.0010210663,"about_ca_system_score_gemma":0.0025497032,"threshold_uncertainty_score":0.012068331},"labels":[],"label_agreement":null},{"id":"W2774231546","doi":"10.1109/jcn.2017.000082","title":"Risk-adaptive strategic network protection in disaster scenarios","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Ontario Tech University","funders":"","keywords":"Computer science; Computer security; Risk analysis (engineering); Computer network","score_opus":0.044119659109385416,"score_gpt":0.300355317562984,"score_spread":0.2562356584535986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774231546","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.1564098,0.0002638162,0.8387338,0.00033056815,0.000029791876,0.000065016604,0.00003913895,0.0003076269,0.003820391],"genre_scores_gemma":[0.97791195,0.00007364691,0.021498153,0.00002512321,0.000007311997,0.000022832857,0.000015779158,0.000014078121,0.00043110162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00016900389,0.000012654771,0.000062037725,0.00006523309,0.00006954458],"domain_scores_gemma":[0.99897695,0.000538409,0.00020188604,0.00009743532,0.000114072354,0.00007130485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089536904,0.00061002024,0.00044204423,0.0005149446,0.0003855169,0.0005885353,0.0008722819,0.0006418463,0.00068207434],"category_scores_gemma":[0.002903927,0.00023679843,0.0002571974,0.0002533184,0.0005620358,0.001099633,0.0010341362,0.00056044204,0.00011135686],"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.00005356895,0.000032502925,0.0010901844,0.000025650992,0.000022780614,0.00009262162,0.000089286055,0.96753436,0.004452432,0.007751819,0.00032009927,0.018534768],"study_design_scores_gemma":[0.0000046932573,0.00003760233,0.00042003338,0.000004428878,0.000008371831,0.00005018526,0.0000565889,0.99080503,0.00085746933,0.007423971,0.00032437893,0.0000072588273],"about_ca_topic_score_codex":0.0018411111,"about_ca_topic_score_gemma":0.0019437188,"teacher_disagreement_score":0.0018411111,"about_ca_system_score_codex":0.00065258855,"about_ca_system_score_gemma":0.0005674455,"threshold_uncertainty_score":0.0047352314},"labels":[],"label_agreement":null},{"id":"W2786118779","doi":"10.1109/jcn.2017.000094","title":"Software defined multihop wireless networks: Promises and challenges","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Computer science; Software-defined networking; Computer network; Wireless network; Distributed computing; Node (physics); Forwarding plane; Network topology; Wireless; Telecommunications","score_opus":0.05447947907822185,"score_gpt":0.2760178994619249,"score_spread":0.22153842038370306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786118779","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012270917,0.5150861,0.21379933,0.17342554,0.008379099,0.00009857048,0.00015137444,0.00030583245,0.076483265],"genre_scores_gemma":[0.19842835,0.6380869,0.11373782,0.012425352,0.018903576,0.00023633533,0.00023506262,0.0001562513,0.017790401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763,0.0006638936,0.00009067511,0.0002206893,0.0012325488,0.00016218646],"domain_scores_gemma":[0.9944872,0.0036098678,0.00021187677,0.0003126964,0.0009502004,0.0004281588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052585024,0.0006469042,0.000610764,0.0008203056,0.0010359017,0.0033651984,0.0017951047,0.002949219,0.0019876484],"category_scores_gemma":[0.0062635983,0.0004154785,0.0003685724,0.0013724086,0.0034508645,0.013768597,0.0024646302,0.007138249,0.0008825887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048792637,0.00006668731,0.00063119346,0.0009096443,0.0000165829,0.00019361482,0.00050886464,0.0038912504,0.0011899222,0.74982864,0.017882364,0.22483253],"study_design_scores_gemma":[0.000011329373,0.00013967705,0.00038970454,0.0009728747,0.00001696043,0.0004618458,0.00095686316,0.019033259,0.00089187326,0.5170394,0.4600299,0.00005637105],"about_ca_topic_score_codex":0.0007086803,"about_ca_topic_score_gemma":0.00069593615,"teacher_disagreement_score":0.0052585024,"about_ca_system_score_codex":0.0012182443,"about_ca_system_score_gemma":0.0013249309,"threshold_uncertainty_score":0.027809918},"labels":[],"label_agreement":null},{"id":"W2907758373","doi":"10.1109/jcn.2019.000005","title":"Coverage protocols for wireless sensor networks: Review and future directions","year":2019,"lang":"en","type":"preprint","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","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":"Carleton University; Fisheries and Oceans Canada","funders":"","keywords":"Computer science; Wireless sensor network; Software deployment; Computer network; Open research; Scheduling (production processes); Energy consumption; Distributed computing; Engineering","score_opus":0.02424992602582755,"score_gpt":0.301829857882434,"score_spread":0.27757993185660645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907758373","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024846254,0.99359775,0.0033536335,0.0006660385,0.00046417583,0.000016790273,0.000023999448,0.000032734355,0.0015962811],"genre_scores_gemma":[0.0016709963,0.9933954,0.0031956292,0.00032640834,0.00075498165,0.000028712608,0.0000749062,0.000012777184,0.0005402475],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988728,0.00022624308,0.00015439889,0.0001839152,0.00047646798,0.0000861312],"domain_scores_gemma":[0.996799,0.002030495,0.00022643426,0.00014219643,0.0007188055,0.00008302404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022215,0.0013498057,0.0018583437,0.0029616992,0.00054978725,0.0019566193,0.002410628,0.0019081498,0.003538769],"category_scores_gemma":[0.00433381,0.0007799913,0.0010598662,0.00596862,0.0011663046,0.004687946,0.0015373585,0.0028087692,0.0024527668],"study_design_candidate":"not_applicable","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.00006104782,0.00010879059,0.0002945655,0.013958243,0.00007948632,0.00012892912,0.00015895255,0.0030459343,0.0012887178,0.020587878,0.024462156,0.9358253],"study_design_scores_gemma":[0.000021491865,0.00021582373,0.0008653854,0.0076768,0.00016985835,0.001190648,0.0002366992,0.0029592142,0.0010138957,0.024867687,0.96070355,0.00007895427],"about_ca_topic_score_codex":0.0018513385,"about_ca_topic_score_gemma":0.0010420901,"teacher_disagreement_score":0.003538769,"about_ca_system_score_codex":0.0010208859,"about_ca_system_score_gemma":0.0017852656,"threshold_uncertainty_score":0.011838317},"labels":[],"label_agreement":null},{"id":"W2945709631","doi":"10.1109/jcn.2019.000021","title":"Error detection algorithm for Lempel-Ziv-77 compressed data","year":2019,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Parity bit; Algorithm; Checksum; Hamming code; Error detection and correction; Cyclic redundancy check; Bit error rate; Data compression; Redundancy (engineering); Decoding methods; Block code","score_opus":0.0480410243959005,"score_gpt":0.31154297135214476,"score_spread":0.26350194695624424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945709631","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.036064506,0.0005753165,0.96028084,0.00025899353,0.000081235135,0.00013282201,0.00013676,0.0011709462,0.0012986087],"genre_scores_gemma":[0.31677774,0.0005097551,0.67780167,0.00031344587,0.00013946727,0.00026630628,0.0007617712,0.00008458471,0.0033451817],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986072,0.00019455726,0.00010906576,0.00015660601,0.00082056265,0.00011197571],"domain_scores_gemma":[0.9981421,0.00065665017,0.00027541033,0.00027387234,0.0005996315,0.00005232162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010887956,0.0005844184,0.0007070046,0.0018328723,0.00050488475,0.00079395156,0.0011912232,0.0008629962,0.0014463133],"category_scores_gemma":[0.0053202487,0.00014608153,0.00030441064,0.0012029267,0.0006110534,0.0014946545,0.0010290777,0.000829601,0.00078584714],"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.0010909725,0.00016080048,0.0029436038,0.0002701369,0.00007806066,0.0004692154,0.00031840408,0.074920155,0.07956589,0.03685603,0.0054954235,0.79783136],"study_design_scores_gemma":[0.000090667374,0.00022157705,0.0010048754,0.00004790633,0.000029561754,0.00089324435,0.00009458842,0.8748,0.108338475,0.00752228,0.0069055906,0.00005117155],"about_ca_topic_score_codex":0.0015357111,"about_ca_topic_score_gemma":0.0011668047,"teacher_disagreement_score":0.0018328723,"about_ca_system_score_codex":0.00081107527,"about_ca_system_score_gemma":0.0012874521,"threshold_uncertainty_score":0.0058847666},"labels":[],"label_agreement":null},{"id":"W3139677063","doi":"10.23919/jcn.2020.000031","title":"5G NR mmWave indoor coverage with massive antenna system","year":2021,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":26,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Kyungpook National University","keywords":"Computer science; Relay; Architecture; Antenna (radio); Radio frequency; Computer network; Embedded system; Telecommunications; Power (physics)","score_opus":0.014895290216222198,"score_gpt":0.21204223572792702,"score_spread":0.1971469455117048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139677063","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.2998587,0.0012673726,0.65362847,0.0004870671,0.0001865213,0.00008169886,0.00034745006,0.0020563977,0.042086434],"genre_scores_gemma":[0.98328364,0.00018730882,0.013232529,0.00008455546,0.000027566623,0.000024229797,0.00007780816,0.000012239628,0.003070274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998449,0.000041394593,0.000003640781,0.000027593687,0.000036421443,0.00004595447],"domain_scores_gemma":[0.9999145,0.000016484832,0.00001500828,0.000024084746,0.000019681125,0.000010191599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011416015,0.00043172183,0.0002413874,0.00017118311,0.00028655148,0.00040286218,0.00037452774,0.00033590867,0.002041615],"category_scores_gemma":[0.00018912663,0.00007231521,0.00017742663,0.00029490257,0.00019408875,0.0003857779,0.00054267095,0.00025713953,0.00053986383],"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.00057776587,0.00012455053,0.0066253785,0.00022056834,0.00012408449,0.0014218502,0.000275051,0.6159229,0.08850086,0.06018986,0.011771236,0.21424583],"study_design_scores_gemma":[0.00003744914,0.0002968043,0.0020305587,0.000013162493,0.00004614769,0.000521643,0.00007420199,0.9686594,0.011701567,0.005565859,0.011031163,0.000022028107],"about_ca_topic_score_codex":0.0023939165,"about_ca_topic_score_gemma":0.0033777857,"teacher_disagreement_score":0.0023939165,"about_ca_system_score_codex":0.00041032207,"about_ca_system_score_gemma":0.00021914116,"threshold_uncertainty_score":0.006829858},"labels":[],"label_agreement":null},{"id":"W4206341533","doi":"10.23919/jcn.2021.100036","title":"Inside front cover","year":2021,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Front cover; Front (military); Cover (algebra); Telecommunications; Geology; Mechanical engineering","score_opus":0.05698833462839843,"score_gpt":0.2464076569589739,"score_spread":0.18941932233057546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206341533","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019476502,0.00040436996,0.0003883355,0.0007400273,0.0033214705,0.000074685384,0.0015843816,0.0006463839,0.9926455],"genre_scores_gemma":[0.00039231635,0.00013349482,0.00008005753,0.00019127868,0.000335853,0.000021400032,0.00050119415,0.00018038576,0.998164],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944,0.0000494501,0.000016648817,0.00009953668,0.00030525977,0.000089039895],"domain_scores_gemma":[0.9989298,0.0001712804,0.000049792794,0.00014630854,0.00034946928,0.0003533076],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039142635,0.0013448783,0.0011105457,0.0019899663,0.0020804903,0.006522505,0.0010761629,0.0027009065,0.93983245],"category_scores_gemma":[0.0022396839,0.00048332516,0.0007121568,0.001563767,0.00057965866,0.0029100357,0.0026608177,0.0020963666,0.92881495],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000022152099,0.000024857416,0.000040547457,0.00007649208,0.0000015343863,0.000021008798,0.00001078398,0.00004831717,0.00022389775,0.001635256,0.9537315,0.04416354],"study_design_scores_gemma":[0.000008246769,0.0000133034355,0.00025789568,0.000065607004,0.0000014213654,0.000024010464,0.00002246755,0.00008599954,0.00012017467,0.0011596661,0.99823666,0.0000044955327],"about_ca_topic_score_codex":0.002155732,"about_ca_topic_score_gemma":0.0054769856,"teacher_disagreement_score":0.06016755,"about_ca_system_score_codex":0.0012706025,"about_ca_system_score_gemma":0.0011905386,"threshold_uncertainty_score":0.08582163},"labels":[],"label_agreement":null},{"id":"W4220873601","doi":"10.23919/jcn.2022.9737071","title":"Inside front cover","year":2022,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Front cover; Cover (algebra); Front (military); Geology","score_opus":0.05562962457323,"score_gpt":0.24389277664736664,"score_spread":0.18826315207413663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220873601","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019658245,0.000374495,0.0003847393,0.000709626,0.0031848985,0.00007383331,0.0014415525,0.0006551923,0.9929791],"genre_scores_gemma":[0.00038817368,0.00012273715,0.00007727032,0.00019255954,0.00032686553,0.000019987969,0.00044320172,0.00017647186,0.9982527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999471,0.00004466812,0.000015546128,0.00009632133,0.00028844157,0.0000840188],"domain_scores_gemma":[0.9990062,0.00015653236,0.000046812824,0.00014498873,0.00032019604,0.00032530134],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037465486,0.0013528541,0.0010816338,0.0019515806,0.0021021783,0.0063327947,0.0010601514,0.0027348774,0.938443],"category_scores_gemma":[0.0020956565,0.00049377955,0.0007103633,0.0015156541,0.00058578193,0.0028533712,0.0025794993,0.0020588494,0.92853296],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000022463539,0.000026344867,0.000041804356,0.00007252162,0.0000015900781,0.000022341716,0.000011131207,0.00004761417,0.00025703845,0.0016180128,0.95401204,0.043866992],"study_design_scores_gemma":[0.000008234934,0.000013736643,0.0002660061,0.000059462705,0.0000014512902,0.0000252278,0.000022927234,0.00008579345,0.00013244593,0.0011271596,0.99825305,0.000004520413],"about_ca_topic_score_codex":0.0021044402,"about_ca_topic_score_gemma":0.0053741992,"teacher_disagreement_score":0.061556995,"about_ca_system_score_codex":0.0011757296,"about_ca_system_score_gemma":0.0011280903,"threshold_uncertainty_score":0.0878036},"labels":[],"label_agreement":null},{"id":"W4313886758","doi":"10.23919/jcn.2022.000054","title":"Slicing-based resource optimization in multi-access edge network using ensemble learning aided DDPG algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","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":"Carleton University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Mobile edge computing; Wireless network; Distributed computing; Virtual network; Resource allocation; Wireless; Edge computing; Computer network; Server; Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence","score_opus":0.07294231477596194,"score_gpt":0.31744040555547004,"score_spread":0.2444980907795081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313886758","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.046007644,0.00053957256,0.9497892,0.00029134253,0.000051507566,0.00004169432,0.00006304312,0.0004251085,0.0027907572],"genre_scores_gemma":[0.8911342,0.00026795524,0.10564318,0.00020248246,0.000035620367,0.000103466264,0.00017612158,0.0000659205,0.0023711238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.0000958221,0.000016649494,0.00007556211,0.00007245417,0.00009580939],"domain_scores_gemma":[0.999183,0.00047963037,0.00007082719,0.000042926597,0.00015516537,0.00006834491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908113,0.0008295651,0.0013897258,0.00050877954,0.00041437123,0.0007795871,0.0011081758,0.00091625913,0.0018520445],"category_scores_gemma":[0.0018284329,0.00041631746,0.0005632022,0.00054693554,0.0005927944,0.0010525725,0.0008700561,0.00092505914,0.00020965269],"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.000030578005,0.00001946151,0.00046491774,0.000014897442,0.000017159677,0.000025597828,0.000016169972,0.98212564,0.00031082993,0.0015870304,0.00045837864,0.014929346],"study_design_scores_gemma":[0.0000022881898,0.0000047884337,0.000021056796,8.8537604e-7,0.0000015729273,0.0000021196654,0.0000016907071,0.99944574,0.000041362408,0.0004461835,0.000031477157,7.7030865e-7],"about_ca_topic_score_codex":0.013980798,"about_ca_topic_score_gemma":0.009361329,"teacher_disagreement_score":0.013980798,"about_ca_system_score_codex":0.0010756883,"about_ca_system_score_gemma":0.0016437959,"threshold_uncertainty_score":0.027798831},"labels":[],"label_agreement":null},{"id":"W4313887358","doi":"10.23919/jcn.2022.000051","title":"HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Heuristic; Clique; Network topology; Algorithm; Theoretical computer science; Genetic algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.051666683221326996,"score_gpt":0.29256302870495576,"score_spread":0.24089634548362876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313887358","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.055890594,0.0007866255,0.93273765,0.00033319002,0.00013761349,0.00025285446,0.00018478456,0.0020152319,0.007661419],"genre_scores_gemma":[0.47651178,0.00062943983,0.5145491,0.0003394537,0.000066549495,0.0004934286,0.0006516398,0.00030863401,0.006450011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995123,0.00014696192,0.000015477046,0.00010084846,0.00009759023,0.00012677697],"domain_scores_gemma":[0.9993198,0.00039840283,0.000061029536,0.00007258365,0.00009635986,0.000051912193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057211425,0.0011340674,0.0012734388,0.0013537807,0.0007579203,0.0008250496,0.0020658171,0.0017701784,0.0027298033],"category_scores_gemma":[0.0018798466,0.00044254973,0.0009896321,0.0013817265,0.00073600025,0.0010148499,0.00084621523,0.0010074453,0.00045901004],"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.00009675331,0.00018167494,0.0010020618,0.00014285365,0.00007918721,0.00017461582,0.00016219117,0.8815055,0.003936068,0.014564327,0.0054208646,0.09273399],"study_design_scores_gemma":[0.00004088215,0.000055348057,0.00014128366,0.000014916004,0.00003143638,0.000048616956,0.000047952584,0.992331,0.0010606425,0.0042167683,0.0019990834,0.000012074971],"about_ca_topic_score_codex":0.011788209,"about_ca_topic_score_gemma":0.009343912,"teacher_disagreement_score":0.011788209,"about_ca_system_score_codex":0.0014078813,"about_ca_system_score_gemma":0.002747566,"threshold_uncertainty_score":0.023439229},"labels":[],"label_agreement":null},{"id":"W4392392437","doi":"10.23919/jcn.2024.000001","title":"Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation","year":2024,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Fading; Computer science; Statistical analysis; Algorithm; Fading distribution; Telecommunications; Correlation; Statistics; Mathematics; Channel (broadcasting); Rayleigh fading","score_opus":0.014940584636000544,"score_gpt":0.2781283553238455,"score_spread":0.26318777068784494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392392437","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.24453627,0.0008405737,0.750368,0.00016167205,0.000038797516,0.00005464673,0.00014847665,0.00019072964,0.0036607345],"genre_scores_gemma":[0.977455,0.000731139,0.020533977,0.000043576838,0.00006160898,0.00003580634,0.00009806948,0.0000187783,0.0010219567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.00014878775,0.000026433312,0.00011718368,0.00025445927,0.00010851846],"domain_scores_gemma":[0.9962069,0.0022149403,0.0007465902,0.00031186745,0.00044991134,0.00006984966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008428314,0.00066928286,0.0006024848,0.00083831843,0.00033453968,0.00067415193,0.00055298785,0.00046030566,0.0005291644],"category_scores_gemma":[0.004346627,0.00029086493,0.0005741639,0.0011065955,0.00091556966,0.0009820599,0.0006370917,0.00053223234,0.00010595759],"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.000068673886,0.000024052146,0.0056512095,0.00008660817,0.00007319359,0.0006794664,0.00007824568,0.92881495,0.007485815,0.042029522,0.0003816593,0.014626619],"study_design_scores_gemma":[0.0000034376824,0.000027915836,0.0024718717,0.0000065733357,0.000019534018,0.00020658746,0.000017224547,0.9872685,0.001355761,0.008318344,0.00028730775,0.000017020335],"about_ca_topic_score_codex":0.0025451945,"about_ca_topic_score_gemma":0.0019466404,"teacher_disagreement_score":0.0025451945,"about_ca_system_score_codex":0.00072772615,"about_ca_system_score_gemma":0.0008410789,"threshold_uncertainty_score":0.0052800775},"labels":[],"label_agreement":null}]}