{"meta":{"query_hash":"db7b57e9a4f9","filters":{"venue":"IEEE Transactions on Communications"},"cohort_total":879,"direct_labels_cover":0,"predictions_cover":879,"exported":879,"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/db7b57e9a4f9","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Communications"},"results":[{"id":"W1423052447","doi":"10.1109/tcomm.2015.2502954","title":"Hybrid Block Diagonalization for Massive Multiuser MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":382,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; MIMO; Baseband; Electronic engineering; Telecommunications link; Rayleigh fading; Computer science; Block (permutation group theory); Antenna (radio); Fading; Channel (broadcasting); Multi-user MIMO; Telecommunications; Engineering; Mathematics; Bandwidth (computing)","score_opus":0.04356902100349175,"score_gpt":0.27359293536154305,"score_spread":0.2300239143580513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1423052447","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.01666698,0.00023945523,0.9793656,0.00010689775,0.00002787701,0.000025840996,0.000039888506,0.00027389344,0.0032535847],"genre_scores_gemma":[0.6361063,0.00050066796,0.35717097,0.00020863942,0.00009153815,0.00016097823,0.00017685279,0.000055346456,0.0055286926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997545,0.00008410509,0.000009602589,0.000027531,0.00009841231,0.000025784322],"domain_scores_gemma":[0.99974316,0.00010174757,0.000029060984,0.000052204716,0.000058590595,0.000015187775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027084973,0.00038096655,0.00027007563,0.0001673378,0.00023702318,0.0003927894,0.00031439777,0.00028690876,0.0025372934],"category_scores_gemma":[0.0004988487,0.00014346588,0.00019430206,0.00027963505,0.00032015968,0.00045760087,0.00052104646,0.00049569353,0.0007200303],"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.00036042585,0.00015321093,0.0007080741,0.00019332125,0.00007885781,0.0001522907,0.00016842518,0.4884454,0.09166419,0.10339414,0.0055504832,0.30913112],"study_design_scores_gemma":[0.000018965426,0.00007973754,0.00011307177,0.0000056065323,0.000004811986,0.000039728548,0.000011714564,0.983023,0.006756822,0.007899647,0.0020370637,0.0000098278415],"about_ca_topic_score_codex":0.001009497,"about_ca_topic_score_gemma":0.0015753898,"teacher_disagreement_score":0.0025372934,"about_ca_system_score_codex":0.00024813498,"about_ca_system_score_gemma":0.00036968372,"threshold_uncertainty_score":0.008488059},"labels":[],"label_agreement":null},{"id":"W1487935471","doi":"10.1109/tcomm.2015.2438832","title":"Centralized and Game Theoretical Solutions of Joint Source and Relay Power Allocation for AF Relay Based Network","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Stackelberg competition; Computer science; Transmitter power output; Mathematical optimization; Node (physics); Game theory; Geometric programming; Computer network; Optimization problem; Power (physics); Key (lock); Mathematics; Engineering; Computer security","score_opus":0.0771996307057762,"score_gpt":0.2892104417411179,"score_spread":0.21201081103534167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487935471","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.011916542,0.0002865392,0.9722277,0.0005515595,0.00007038015,0.00007606622,0.000082912666,0.00007322741,0.014715192],"genre_scores_gemma":[0.782301,0.000792414,0.20112213,0.0003606042,0.00015895066,0.0004217229,0.00014014456,0.000120514465,0.014582584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992047,0.00032598095,0.000021454483,0.0001347064,0.00016225062,0.00015095108],"domain_scores_gemma":[0.99871945,0.0008123627,0.00014189087,0.000055032302,0.00019072993,0.00008048219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014429477,0.0013133266,0.00117225,0.0005395709,0.0006109198,0.001969862,0.0015140481,0.0018775923,0.004555132],"category_scores_gemma":[0.0036001476,0.00057470123,0.0010795672,0.00070593785,0.0014679974,0.0012877604,0.0016645478,0.0018155886,0.0004869163],"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.000034045173,0.000038106504,0.00014816444,0.000055922726,0.00002057914,0.00007872212,0.00006986522,0.92033744,0.00052584393,0.07018834,0.0013890179,0.0071139187],"study_design_scores_gemma":[0.0000100905045,0.000017565977,0.000043931006,0.000006526655,0.0000051498396,0.000016124428,0.000024073537,0.9782476,0.00010627548,0.02106625,0.00045149808,0.000004877081],"about_ca_topic_score_codex":0.0053370357,"about_ca_topic_score_gemma":0.004479985,"teacher_disagreement_score":0.0053370357,"about_ca_system_score_codex":0.0020575263,"about_ca_system_score_gemma":0.0022930924,"threshold_uncertainty_score":0.015238464},"labels":[],"label_agreement":null},{"id":"W1519108428","doi":"10.1109/tcomm.2015.2429127","title":"Successive Interference Mitigation in Multiuser MIMO Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":24,"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 Saskatchewan","funders":"","keywords":"Interference (communication); MIMO; Decoding methods; Set (abstract data type); Computer science; Interference alignment; Sequence (biology); Simple (philosophy); Transmission (telecommunications); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Computer network; Telecommunications; Beamforming; Channel (broadcasting)","score_opus":0.04222010473372995,"score_gpt":0.28226395182882735,"score_spread":0.2400438470950974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519108428","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.030541264,0.00040799056,0.9659109,0.00014927097,0.000056540983,0.000018785633,0.000021722786,0.00018011185,0.0027133294],"genre_scores_gemma":[0.81732535,0.0009994323,0.17658532,0.00016013136,0.00011524406,0.00007456379,0.00005596748,0.00004777146,0.004636185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994748,0.00018389428,0.000015417982,0.00006735223,0.00017490127,0.00008365749],"domain_scores_gemma":[0.9996283,0.00018913898,0.00005958206,0.000035637266,0.00006594309,0.000021456683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587709,0.0008100943,0.00062596175,0.0003689713,0.000334306,0.0005486319,0.0004795218,0.00055083365,0.00062070857],"category_scores_gemma":[0.0011493843,0.00030248275,0.0005347711,0.0006067921,0.00066278497,0.00053702807,0.0007864809,0.0005576499,0.00025901175],"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.00008159218,0.00002120515,0.00022345589,0.000053771324,0.000043088785,0.00009147891,0.00008478987,0.9384696,0.008035795,0.019173915,0.00055609073,0.033165243],"study_design_scores_gemma":[0.00001060217,0.000045564,0.000089288296,0.000005339649,0.000009763032,0.000036157468,0.0000137641055,0.99127287,0.003414302,0.004505091,0.00058859197,0.00000855657],"about_ca_topic_score_codex":0.0023105522,"about_ca_topic_score_gemma":0.0023570769,"teacher_disagreement_score":0.0023105522,"about_ca_system_score_codex":0.00055215805,"about_ca_system_score_gemma":0.00096012774,"threshold_uncertainty_score":0.0045942664},"labels":[],"label_agreement":null},{"id":"W1554369138","doi":"10.1109/tcomm.2015.2451648","title":"On the Deployment of Energy Sources in Wireless-Powered Cellular Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":41,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Base station; Telecommunications link; Wireless; Energy harvesting; Information transfer; Computer network; Computer science; Duplex (building); Beacon; Signal-to-noise ratio (imaging); Electronic engineering; Spectral efficiency; Energy (signal processing); Efficient energy use; Electrical engineering; Engineering; Telecommunications; Channel (broadcasting); Physics","score_opus":0.030259516526165892,"score_gpt":0.22414016401227677,"score_spread":0.19388064748611086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554369138","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.09305466,0.012334571,0.8583634,0.001138649,0.00013326108,0.00008463242,0.00010636463,0.0001857801,0.03459867],"genre_scores_gemma":[0.94751406,0.008883578,0.040643305,0.00016384739,0.00008137291,0.000070845555,0.00005663867,0.000041266147,0.002545126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993062,0.00034978573,0.000020505218,0.00008487635,0.00017495618,0.000063681946],"domain_scores_gemma":[0.99807054,0.0014221789,0.00017144538,0.000114025504,0.00018560255,0.00003626034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000789492,0.000800714,0.000530302,0.00051167473,0.00048545,0.0011150042,0.00080298027,0.0008243706,0.0011347283],"category_scores_gemma":[0.004295895,0.00034840044,0.00031544262,0.0010525575,0.0010930877,0.001455347,0.0010257873,0.00061897736,0.0003687327],"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.000060362352,0.000032695236,0.0009722156,0.00014614637,0.000026762093,0.00018514335,0.00007232769,0.9047804,0.0040960237,0.056170568,0.000891787,0.032565676],"study_design_scores_gemma":[0.0000073344013,0.000101687794,0.000627143,0.00010086865,0.000025150877,0.00015260723,0.00010764183,0.9680438,0.0022797894,0.024773616,0.003762553,0.000017733693],"about_ca_topic_score_codex":0.0014653913,"about_ca_topic_score_gemma":0.0021217451,"teacher_disagreement_score":0.0014653913,"about_ca_system_score_codex":0.0010880734,"about_ca_system_score_gemma":0.00041201437,"threshold_uncertainty_score":0.007894516},"labels":[],"label_agreement":null},{"id":"W1575827797","doi":"10.1109/tcomm.2010.03.080238","title":"Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of British Columbia; Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Scheduling (production processes); Computer science; Spectral efficiency; Wireless; Algorithm; Computer network; Real-time computing; Mathematics; Channel (broadcasting); Telecommunications; Mathematical optimization","score_opus":0.02981871467635826,"score_gpt":0.2724712433676104,"score_spread":0.24265252869125215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575827797","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.31445223,0.0007506419,0.68146765,0.00012909801,0.000042925545,0.00007453713,0.000040810817,0.00019901908,0.0028431022],"genre_scores_gemma":[0.98406327,0.000090009766,0.015546348,0.000019138215,0.000012203684,0.000019076424,0.000009318196,0.0000060095936,0.00023460698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.00042194471,0.00003254765,0.00008854898,0.00025298906,0.00021017682],"domain_scores_gemma":[0.9973482,0.0016584718,0.00034283235,0.00029671562,0.00024109906,0.00011258705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020181763,0.00060540286,0.00065781287,0.0005310061,0.0006175749,0.00071425945,0.0009563217,0.0004261059,0.0003679014],"category_scores_gemma":[0.0037664978,0.0002759642,0.0003207068,0.00083989115,0.0009241914,0.0009138959,0.00084031746,0.00036879192,0.00006778499],"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.00016569003,0.00005852126,0.0020802352,0.000041000792,0.000039908562,0.00017089366,0.00012023024,0.95245206,0.007106256,0.017160648,0.00022051261,0.020383978],"study_design_scores_gemma":[0.000005591513,0.000037968803,0.00025855648,0.0000016922895,0.0000046475,0.000025622172,0.000014782959,0.99733764,0.00049929856,0.0017134604,0.000095145275,0.0000055319324],"about_ca_topic_score_codex":0.0049339547,"about_ca_topic_score_gemma":0.0058680726,"teacher_disagreement_score":0.0049339547,"about_ca_system_score_codex":0.0013995076,"about_ca_system_score_gemma":0.0010404746,"threshold_uncertainty_score":0.0106732845},"labels":[],"label_agreement":null},{"id":"W1626906177","doi":"10.1109/tcomm.2015.2493063","title":"Degraded Gaussian Diamond–Wiretap Channel","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"University of Toronto","funders":"Qatar National Research Fund","keywords":"Randomness; Relay; Channel (broadcasting); Gaussian; Secrecy; Upper and lower bounds; Computer science; Topology (electrical circuits); Relay channel; Channel code; Encoder; Coding (social sciences); Constraint (computer-aided design); Computer network; Decoding methods; Algorithm; Mathematics; Combinatorics; Statistics; Physics; Computer security","score_opus":0.07075431771036544,"score_gpt":0.28243073572356403,"score_spread":0.2116764180131986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626906177","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.06973106,0.0015958342,0.89776343,0.0007025883,0.00011832011,0.000077506884,0.00091383985,0.0004435054,0.028653897],"genre_scores_gemma":[0.9583489,0.0012051463,0.036297575,0.00016751925,0.00007991663,0.00014317835,0.0003254072,0.000038774662,0.0033935187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997693,0.0005895301,0.00008787185,0.00027972396,0.000826646,0.000523215],"domain_scores_gemma":[0.982588,0.011328786,0.0012250044,0.0016989588,0.0027455902,0.00041370207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021676694,0.0010107697,0.0011437273,0.0011816758,0.00055044,0.0018404725,0.0013111158,0.0010214783,0.0037546325],"category_scores_gemma":[0.014534731,0.0004002477,0.00037905105,0.0013851877,0.0022909727,0.0027618126,0.0022372047,0.0014378766,0.0008426202],"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.00068450766,0.000063618,0.0009927291,0.00049851043,0.00007497439,0.0010378639,0.00032580085,0.59666204,0.011387152,0.35636362,0.0058068624,0.026102228],"study_design_scores_gemma":[0.000017462758,0.000062148305,0.00020848477,0.000052264142,0.000016123404,0.00029667484,0.00007361357,0.93203545,0.003988503,0.06126391,0.0019403398,0.000044988476],"about_ca_topic_score_codex":0.0025978694,"about_ca_topic_score_gemma":0.001647955,"teacher_disagreement_score":0.0037546325,"about_ca_system_score_codex":0.0015035972,"about_ca_system_score_gemma":0.0012297303,"threshold_uncertainty_score":0.012560546},"labels":[],"label_agreement":null},{"id":"W1760638340","doi":"10.1109/tcomm.2015.2431259","title":"Asymptotic Performance of Energy Detector in Fading and Diversity Reception","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Moment-generating function; Probability density function; Detector; Energy (signal processing); Random variable; Diversity gain; Mathematics; Metric (unit); Signal-to-noise ratio (imaging); Interference (communication); Applied mathematics; Algorithm; Computer science; Channel (broadcasting); Statistics; Telecommunications; Engineering","score_opus":0.04367925550076344,"score_gpt":0.24460448747679936,"score_spread":0.20092523197603593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760638340","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.10676686,0.0016462763,0.88144684,0.00036993597,0.00004676946,0.000047252306,0.0001442616,0.00066981796,0.008862057],"genre_scores_gemma":[0.95606184,0.00063537323,0.041434087,0.00014947841,0.000039727944,0.000061791405,0.00013664228,0.000058718295,0.0014222119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726224,0.0009210627,0.0001030358,0.00045082782,0.00080332,0.00045950676],"domain_scores_gemma":[0.98702997,0.01010452,0.0006877399,0.00082799426,0.0011943614,0.00015532866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004500458,0.0012465044,0.0014280214,0.00097185106,0.0006127099,0.0016388117,0.0014375391,0.0015798798,0.0012551019],"category_scores_gemma":[0.029274551,0.0005213689,0.0006030776,0.0008939143,0.0021386377,0.002779956,0.0022307297,0.0013775541,0.0004956439],"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.0003684274,0.00006613601,0.0036025695,0.00028544327,0.0000896373,0.0004922433,0.0003525724,0.85247344,0.012883962,0.08055647,0.0009031893,0.047925908],"study_design_scores_gemma":[0.000008637296,0.00006964653,0.0005975502,0.000027746732,0.00001613955,0.00034728297,0.00005158994,0.9796647,0.0034067992,0.01551702,0.00026342418,0.000029450117],"about_ca_topic_score_codex":0.001806472,"about_ca_topic_score_gemma":0.0010130054,"teacher_disagreement_score":0.004500458,"about_ca_system_score_codex":0.0017812363,"about_ca_system_score_gemma":0.0013963784,"threshold_uncertainty_score":0.023801029},"labels":[],"label_agreement":null},{"id":"W1917463349","doi":"10.1109/tcomm.2015.2456093","title":"Millimeter Wave Cellular Networks: A MAC Layer Perspective","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":405,"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":"European Commission; York University; Vetenskapsrådet; Stiftelsen för Strategisk Forskning; New York University","keywords":"Computer network; Computer science; Physical layer; Radio resource management; Cellular network; Wireless; Scheduling (production processes); Base station; Handover; Synchronization (alternating current); Wireless network; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.09565613722390491,"score_gpt":0.2706013469799129,"score_spread":0.17494520975600797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917463349","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.024576958,0.07252395,0.7759467,0.027915562,0.0017048112,0.000103007595,0.00038526178,0.00054039434,0.09630334],"genre_scores_gemma":[0.6887948,0.0900166,0.18544649,0.0038950986,0.0046021007,0.00023544503,0.0001976248,0.00010791431,0.026703982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.00011394099,0.000024504725,0.00006027251,0.00018231575,0.00008869402],"domain_scores_gemma":[0.9994019,0.00023915188,0.00006619219,0.00008647055,0.00016528877,0.00004091223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063903304,0.0007392319,0.00042883775,0.0004450729,0.00061395415,0.0035048155,0.0008999398,0.0013788792,0.002082162],"category_scores_gemma":[0.0012955163,0.00045199002,0.0002451443,0.0006984683,0.000881691,0.002695716,0.0009623634,0.0020403708,0.0006182495],"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.00006173215,0.000057200217,0.00070563355,0.00037434854,0.00004913565,0.00020003316,0.00021052569,0.054886423,0.009043285,0.82886904,0.009380383,0.096162304],"study_design_scores_gemma":[0.000019988698,0.0001983739,0.0016653881,0.0004893377,0.00012653237,0.00052270846,0.0004513185,0.40316874,0.008801887,0.3823726,0.20212004,0.00006301638],"about_ca_topic_score_codex":0.0028266555,"about_ca_topic_score_gemma":0.0022630438,"teacher_disagreement_score":0.0035048155,"about_ca_system_score_codex":0.0012900162,"about_ca_system_score_gemma":0.0008872848,"threshold_uncertainty_score":0.009359837},"labels":[],"label_agreement":null},{"id":"W1941179672","doi":"10.1109/tcomm.2015.2472012","title":"On Lossy Joint Source-Channel Coding in Energy Harvesting Communication Systems","year":2015,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":1,"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","keywords":"Computer science; Lossy compression; Transmitter; Gaussian; Channel (broadcasting); Binary number; Topology (electrical circuits); Decoding methods; Control theory (sociology); Electronic engineering; Telecommunications; Mathematics; Physics; Electrical engineering; Engineering","score_opus":0.06005247262184767,"score_gpt":0.25314948716233887,"score_spread":0.1930970145404912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941179672","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.056010045,0.0013670536,0.9331588,0.00073695445,0.000042139287,0.00004166607,0.00009614186,0.000081415215,0.008465804],"genre_scores_gemma":[0.9468638,0.0018671363,0.045168135,0.00018656971,0.000070125694,0.00010756038,0.000110321635,0.00006476747,0.005561713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00033677215,0.000027289756,0.00008170396,0.00029731335,0.00011601371],"domain_scores_gemma":[0.9953708,0.003793607,0.00031289752,0.0001550016,0.00031500534,0.000052593496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018957133,0.00077844155,0.0008659764,0.00048734862,0.00034749604,0.0011558144,0.0007595464,0.0010166542,0.0017043736],"category_scores_gemma":[0.0076362314,0.00037975743,0.00039110426,0.000986587,0.0020867654,0.0017921833,0.0013692857,0.001209645,0.0002762743],"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.000061670755,0.000014764438,0.000270476,0.000066016895,0.000016155134,0.00007163553,0.000088286724,0.91147226,0.0017141553,0.08038426,0.00036145275,0.005478827],"study_design_scores_gemma":[0.0000069357825,0.00001736349,0.00009080396,0.0000114574295,0.000004718876,0.000026894922,0.00001845986,0.973126,0.00058221986,0.02588163,0.00022432485,0.000009191004],"about_ca_topic_score_codex":0.0033113242,"about_ca_topic_score_gemma":0.0016942992,"teacher_disagreement_score":0.0033113242,"about_ca_system_score_codex":0.0015102646,"about_ca_system_score_gemma":0.0009970798,"threshold_uncertainty_score":0.0109577775},"labels":[],"label_agreement":null},{"id":"W1964527706","doi":"10.1109/tcomm.2013.061913.110585","title":"Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Fountain code; Linear network coding; Relay; Computer science; Decoding methods; Coding (social sciences); Computer network; Erasure; Luby transform code; Degree distribution; Encoding (memory); Theoretical computer science; Algorithm; Block code; Mathematics; Concatenated error correction code; Network packet; Complex network","score_opus":0.07585027634728102,"score_gpt":0.2960460330290131,"score_spread":0.22019575668173208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964527706","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.050508406,0.0004548242,0.9439735,0.00029465748,0.00004615861,0.00004091201,0.000035019635,0.00021501674,0.004431495],"genre_scores_gemma":[0.82620883,0.00052545447,0.17034212,0.00011296487,0.000030478117,0.00006619769,0.000049181654,0.000032549833,0.0026323022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960107,0.00014449886,0.000015017375,0.00005147654,0.00013422473,0.00005381556],"domain_scores_gemma":[0.9988411,0.00065333175,0.00013205601,0.00017506698,0.00016406245,0.00003441318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078367244,0.00041440557,0.00044683513,0.00038754998,0.00030876667,0.00040614113,0.00080877077,0.0004890441,0.0007765223],"category_scores_gemma":[0.0027439843,0.00013477218,0.00034018344,0.00045993985,0.0007631021,0.001081994,0.0006832282,0.0005609016,0.000174152],"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.00019536477,0.00005919763,0.0005120234,0.00017706348,0.000047109945,0.00037028367,0.00045567699,0.60303646,0.051303852,0.29115444,0.0017888324,0.050899655],"study_design_scores_gemma":[0.000012051259,0.000050831943,0.00005433241,0.000008348729,0.000010779277,0.00011547245,0.000016320895,0.98304623,0.0053691594,0.009991432,0.0013118216,0.000013266882],"about_ca_topic_score_codex":0.0020597735,"about_ca_topic_score_gemma":0.0017805438,"teacher_disagreement_score":0.0020597735,"about_ca_system_score_codex":0.000919647,"about_ca_system_score_gemma":0.000808753,"threshold_uncertainty_score":0.0066725016},"labels":[],"label_agreement":null},{"id":"W1964584888","doi":"10.1109/tcomm.2009.09.070583","title":"Sum-rate analysis of multiuser MIMO system with zero-forcing transmit beamforming","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"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":"Beamforming; Ergodic theory; MIMO; Precoding; Control theory (sociology); Channel (broadcasting); Transmitter power output; Mathematics; Computer science; Topology (electrical circuits); Telecommunications; Mathematical optimization; Transmitter; Mathematical analysis; Combinatorics","score_opus":0.015621025747745189,"score_gpt":0.23769495010548222,"score_spread":0.22207392435773704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964584888","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.04950704,0.0027399033,0.9220498,0.0005578129,0.00010694137,0.00007204321,0.00039950173,0.0003656751,0.024201283],"genre_scores_gemma":[0.9351296,0.0033088308,0.053659298,0.0002872375,0.00018463405,0.0001802662,0.0003475852,0.00019084827,0.0067117726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790835,0.0007050493,0.000083720006,0.0001612041,0.00080863986,0.00033295184],"domain_scores_gemma":[0.99703646,0.0015575713,0.00024084265,0.0003156432,0.0007895044,0.00005997501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024169188,0.0017766679,0.0015194728,0.0009399318,0.0005686217,0.0015390854,0.0013523219,0.0010680844,0.00480573],"category_scores_gemma":[0.0054881917,0.0005805832,0.0011980125,0.0011159617,0.0011551831,0.002428465,0.0015977649,0.0011974997,0.0013719591],"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.00008815306,0.00003150757,0.00049498945,0.00021224888,0.00006294681,0.0002867737,0.0001405472,0.90583116,0.0074069207,0.07440938,0.0010667228,0.00996867],"study_design_scores_gemma":[0.000005717173,0.000025518388,0.00024076637,0.000025667689,0.00001664639,0.00017109206,0.000031258212,0.98639643,0.0018261415,0.010840761,0.00039651018,0.000023426752],"about_ca_topic_score_codex":0.0022083027,"about_ca_topic_score_gemma":0.0015799383,"teacher_disagreement_score":0.00480573,"about_ca_system_score_codex":0.0015921716,"about_ca_system_score_gemma":0.0014029959,"threshold_uncertainty_score":0.016076803},"labels":[],"label_agreement":null},{"id":"W1966874787","doi":"10.1109/tcomm.2010.05.080299","title":"On the design of LDPC code ensembles for BIAWGN channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Node (physics); Algorithm; Computer science; Code (set theory); Variable (mathematics); Upper and lower bounds; Channel (broadcasting); Mathematics; Decoding methods; Theoretical computer science; Engineering","score_opus":0.09466371076810175,"score_gpt":0.31983875124568273,"score_spread":0.22517504047758097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966874787","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.049412876,0.00016346606,0.9479495,0.00010238102,0.000016954482,0.000039570936,0.000039857456,0.00012417804,0.0021511032],"genre_scores_gemma":[0.62387276,0.00046773764,0.37357223,0.00009703489,0.000037552047,0.00018877108,0.000116920244,0.000069533206,0.001577513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933606,0.0003276193,0.000027786835,0.00007574914,0.00018613802,0.000046691333],"domain_scores_gemma":[0.9985196,0.0008748612,0.00016117522,0.00018014672,0.00021252237,0.000051780673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082051044,0.0005563725,0.0005186398,0.00042523837,0.0003599804,0.00033585101,0.0003058524,0.0004363633,0.00047677942],"category_scores_gemma":[0.0027920485,0.00024314452,0.00026403615,0.00040584122,0.00068851357,0.0005023587,0.0006808216,0.00055090035,0.00021630221],"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.00007678538,0.000028689288,0.0005261243,0.00006949509,0.000029336545,0.000058961996,0.00007244617,0.92104864,0.01690101,0.027889727,0.00038234692,0.032916408],"study_design_scores_gemma":[0.0000075628122,0.000046953224,0.00010613675,0.000007834049,0.000005781189,0.00003779449,0.0000059055833,0.98362136,0.0069878884,0.008480631,0.00068298855,0.000009145088],"about_ca_topic_score_codex":0.00048678403,"about_ca_topic_score_gemma":0.00083178544,"teacher_disagreement_score":0.00082051044,"about_ca_system_score_codex":0.00036009535,"about_ca_system_score_gemma":0.0005579226,"threshold_uncertainty_score":0.0043393373},"labels":[],"label_agreement":null},{"id":"W1966992373","doi":"10.1109/tcomm.2012.062512.100568","title":"On the Benefits of Multichannel/Wideband Spectrum Sensing with Non-Uniform Channel Sensing Durations for Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":24,"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":"Cognitive radio; Narrowband; Wideband; Interference (communication); Computer science; Channel (broadcasting); Convex optimization; Optimization problem; Electronic engineering; Throughput; Transmission (telecommunications); Constraint (computer-aided design); Algorithm; Computer network; Regular polygon; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.0305796731900877,"score_gpt":0.2511619792142153,"score_spread":0.2205823060241276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966992373","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.02093805,0.0027301188,0.9707929,0.00036101879,0.000083269915,0.0000354296,0.000027070188,0.00009739929,0.00493478],"genre_scores_gemma":[0.8363328,0.0032431835,0.15833254,0.00023165203,0.00019429263,0.000118851414,0.000038894414,0.00005494677,0.0014528002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990288,0.00040096205,0.000037798116,0.00013645677,0.00027713584,0.000118958436],"domain_scores_gemma":[0.9971716,0.0022293197,0.00017327207,0.0001766685,0.00017645246,0.00007273314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216512,0.0010158854,0.0007494868,0.00046827339,0.0005371927,0.0011202716,0.0010426879,0.0008452394,0.0013471274],"category_scores_gemma":[0.0064414763,0.0003986535,0.00047928395,0.00069391687,0.001199004,0.0022219284,0.0014724195,0.0011767632,0.00014778435],"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.00025053392,0.0001226931,0.00049526617,0.0001885259,0.00004783991,0.000120762365,0.000109139975,0.77414507,0.0050372146,0.1242251,0.0012272359,0.0940306],"study_design_scores_gemma":[0.000017436992,0.00013660405,0.00022965689,0.000024769754,0.000021539185,0.00008193574,0.00003406468,0.9630942,0.0011935687,0.034260835,0.0008843387,0.000021140475],"about_ca_topic_score_codex":0.001969221,"about_ca_topic_score_gemma":0.00232503,"teacher_disagreement_score":0.00216512,"about_ca_system_score_codex":0.00092677464,"about_ca_system_score_gemma":0.0013035323,"threshold_uncertainty_score":0.01145041},"labels":[],"label_agreement":null},{"id":"W1969231301","doi":"10.1109/tcomm.2014.2367020","title":"Optimized Distributed Inter-Cell Interference Coordination (ICIC) Scheme Using Projected Subgradient and Network Flow Optimization","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Carleton University","funders":"","keywords":"Subgradient method; Mathematical optimization; Scheduling (production processes); Interference (communication); Linear programming; Computer science; Computational complexity theory; Optimization problem; Single antenna interference cancellation; Polynomial; Mathematics; Algorithm; Channel (broadcasting); Decoding methods","score_opus":0.018901272718236946,"score_gpt":0.23589502661857137,"score_spread":0.21699375390033443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969231301","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.0106742615,0.00022354099,0.9866898,0.0001390873,0.0000428059,0.000053855754,0.00003905812,0.00021939738,0.001918217],"genre_scores_gemma":[0.60568994,0.00036435746,0.39012074,0.00017465847,0.00006635828,0.00021013664,0.00019809244,0.00009073035,0.003085004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992747,0.00025050368,0.000021234793,0.00014780184,0.00016174905,0.00014402265],"domain_scores_gemma":[0.9995297,0.00018177467,0.00006531294,0.00005394845,0.00010544809,0.0000638626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078019,0.0011593451,0.0015391571,0.0004571274,0.0005181449,0.0008112801,0.0012840342,0.00082431635,0.0014015071],"category_scores_gemma":[0.0012097602,0.0003537548,0.00055832876,0.0008432568,0.00071558694,0.0011005827,0.0010028984,0.0013299873,0.00027006867],"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.0001094193,0.00006266187,0.00019415937,0.000056034005,0.000028660175,0.000065682296,0.000041685875,0.9534362,0.0025170003,0.013342801,0.0020876369,0.028058074],"study_design_scores_gemma":[0.000009985929,0.000015956904,0.000024256797,0.0000014311435,0.0000026434275,0.000009279662,0.0000038129701,0.99788624,0.00024921555,0.0015907715,0.00020403578,0.0000023278917],"about_ca_topic_score_codex":0.0060322727,"about_ca_topic_score_gemma":0.0048395176,"teacher_disagreement_score":0.0060322727,"about_ca_system_score_codex":0.0014235338,"about_ca_system_score_gemma":0.0021649152,"threshold_uncertainty_score":0.011994302},"labels":[],"label_agreement":null},{"id":"W1969312047","doi":"10.1109/tcomm.2002.801465","title":"Analytical level crossing rates and average fade durations for diversity techniques in Nakagami fading channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":125,"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":"Fading; Nakagami distribution; Fade; Diversity combining; Maximal-ratio combining; Rayleigh fading; Channel (broadcasting); Statistics; Diversity gain; Diversity scheme; Fading distribution; Level crossing; Telecommunications; Envelope (radar); Channel state information; Computer science; Mathematics; Algorithm; Wireless; Engineering","score_opus":0.08259165893051813,"score_gpt":0.2958363710545022,"score_spread":0.2132447121239841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969312047","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.025595704,0.002925493,0.96370745,0.00014005206,0.00005243544,0.00004857827,0.00009990473,0.00027164794,0.007158588],"genre_scores_gemma":[0.8034031,0.009948515,0.1783695,0.00017786304,0.00018400636,0.0002197933,0.00025415918,0.00025136038,0.007191754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00023268932,0.000050106042,0.00008782176,0.00029989492,0.000109838475],"domain_scores_gemma":[0.9953608,0.0031023035,0.0006801082,0.00028249755,0.00051158725,0.000062654835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022156674,0.0010850618,0.00064200506,0.0016900926,0.00045906668,0.0014113777,0.00083250494,0.0007568255,0.0028312665],"category_scores_gemma":[0.0127679,0.0004623545,0.0008220299,0.0016364409,0.0010406759,0.0015844437,0.0006569261,0.0011524205,0.0009831256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048424892,0.00002972769,0.00072498136,0.00022665456,0.000031549196,0.00021809488,0.0003073587,0.84952617,0.005859606,0.11602557,0.0009977624,0.026004124],"study_design_scores_gemma":[0.00000578207,0.000042938078,0.00040399475,0.000058091224,0.00002763411,0.0002558809,0.00005568738,0.97245187,0.0023008164,0.022782553,0.0015868957,0.000027804932],"about_ca_topic_score_codex":0.0013287828,"about_ca_topic_score_gemma":0.0012520583,"teacher_disagreement_score":0.0028312665,"about_ca_system_score_codex":0.0014780394,"about_ca_system_score_gemma":0.0010143854,"threshold_uncertainty_score":0.011717737},"labels":[],"label_agreement":null},{"id":"W1969403520","doi":"10.1109/tcomm.2006.885084","title":"Frequency-Domain Channel Estimation for SC-FDE in UWB Communications","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":44,"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":"SC-FDE; Estimator; Frequency domain; Channel (broadcasting); Minimum mean square error; Equalization (audio); Transmission (telecommunications); Algorithm; Ultra-wideband; Mean squared error; Computer science; Upper and lower bounds; Channel state information; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics; Wireless","score_opus":0.020601408733283,"score_gpt":0.2542858328345232,"score_spread":0.2336844241012402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969403520","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.012682885,0.0004003407,0.98579246,0.00013033423,0.000028848743,0.00001129606,0.000018543271,0.00014917206,0.00078615505],"genre_scores_gemma":[0.50757223,0.0012880086,0.4888875,0.00013157386,0.00010761546,0.00009160256,0.00014213128,0.000035565772,0.0017438144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.00014003475,0.000014621124,0.00004048156,0.00014267227,0.000023381184],"domain_scores_gemma":[0.99855024,0.0009908256,0.000096066804,0.00013729474,0.0002108818,0.0000146638195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071507815,0.00034242935,0.00046612258,0.00025754314,0.00030795645,0.00044324255,0.00026163572,0.00052206754,0.0012272238],"category_scores_gemma":[0.0042444943,0.00020934368,0.00015505761,0.00031373068,0.00046208614,0.00056325673,0.00035793622,0.00054101134,0.00031571128],"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.00038402202,0.000080655904,0.0011677162,0.0003208734,0.000058978178,0.00018696739,0.000104133906,0.59822583,0.068634376,0.03900678,0.0031106183,0.28871912],"study_design_scores_gemma":[0.0000170353,0.000057131703,0.00035175562,0.000021175558,0.000010386948,0.00011456309,0.000013398899,0.9791499,0.013628572,0.0047129216,0.0019078387,0.000015402798],"about_ca_topic_score_codex":0.0008180111,"about_ca_topic_score_gemma":0.0012599408,"teacher_disagreement_score":0.0012272238,"about_ca_system_score_codex":0.00029213555,"about_ca_system_score_gemma":0.0008259164,"threshold_uncertainty_score":0.0041055083},"labels":[],"label_agreement":null},{"id":"W1971124947","doi":"10.1109/tcomm.2013.071013.120521","title":"A Max-Flow Design Approach for Improved Service Availability in Multi-Ring ERP Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","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":"Concordia University","funders":"","keywords":"Failover; Computer network; Computer science; Network topology; Synchronous optical networking; Ring network; Ethernet flow control; Service (business); Distributed computing; Optical mesh network; Ethernet; Network planning and design; Wireless mesh network; Telecommunications","score_opus":0.05484207719999598,"score_gpt":0.26116356316212486,"score_spread":0.20632148596212888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971124947","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.01230063,0.00013536695,0.9848439,0.00008896745,0.000019201205,0.00006257009,0.000028137403,0.00014303435,0.0023781045],"genre_scores_gemma":[0.6005986,0.00027590428,0.39585793,0.00013670488,0.00004397543,0.00024700232,0.00008055511,0.000088710905,0.0026706555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999476,0.0002177795,0.000022439948,0.00008539827,0.000118085976,0.00008040302],"domain_scores_gemma":[0.9994103,0.00031079605,0.00008904175,0.000040429408,0.00011881289,0.000030683565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017314868,0.0007973596,0.000608171,0.000561547,0.0004582367,0.0006764135,0.0009801973,0.0005652935,0.0029153689],"category_scores_gemma":[0.0017151583,0.00043768497,0.0005108078,0.00039363504,0.0005552359,0.0007778321,0.0006688359,0.00063985033,0.00024931],"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.00008418942,0.00005648427,0.00025002545,0.000094210554,0.000020408415,0.000055602257,0.000049500333,0.94499063,0.006022183,0.011923912,0.000534622,0.03591814],"study_design_scores_gemma":[0.00001260232,0.00007606183,0.000044028897,0.0000059766585,0.000008136034,0.00001543771,0.0000074355326,0.9943816,0.001254851,0.0034747578,0.0007152414,0.0000038819567],"about_ca_topic_score_codex":0.0012513947,"about_ca_topic_score_gemma":0.001928733,"teacher_disagreement_score":0.0029153689,"about_ca_system_score_codex":0.0009165067,"about_ca_system_score_gemma":0.0011727717,"threshold_uncertainty_score":0.009752929},"labels":[],"label_agreement":null},{"id":"W1972053034","doi":"10.1109/tcomm.2008.060117","title":"Mobility Enhanced Smart Antenna Adaptive Sectoring for Uplink Capacity Maximization in CDMA Cellular Network","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Cellular network; Computer science; Femtocell; Capacity planning; Computer network; Real-time computing; Base station","score_opus":0.0981226239586824,"score_gpt":0.2891847913057321,"score_spread":0.1910621673470497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972053034","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.10015554,0.0006945558,0.8964539,0.0002111674,0.000024041567,0.00002128505,0.000035091205,0.00014891839,0.0022555282],"genre_scores_gemma":[0.97120607,0.00024013928,0.027918883,0.000029623834,0.000017983191,0.000019992103,0.000018536919,0.000014982506,0.00053383457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955755,0.0002112206,0.0000145895165,0.000058847196,0.000083996354,0.0000738138],"domain_scores_gemma":[0.99916375,0.0005188763,0.00008989526,0.00007730177,0.00011344423,0.000036783895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153143,0.00037127375,0.00053056714,0.0003120664,0.0002924931,0.0005375335,0.00048130457,0.00037696242,0.0006598752],"category_scores_gemma":[0.0020667955,0.0002494265,0.00022086101,0.000705577,0.0006743762,0.0007753304,0.0005611783,0.00034973005,0.00011313725],"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.00007513898,0.000014540083,0.0004426196,0.00002889058,0.000015873728,0.000047317444,0.00005150421,0.9652465,0.0048244945,0.008711081,0.0003455734,0.020196497],"study_design_scores_gemma":[0.0000029782307,0.000011508934,0.000052600037,0.0000012994607,0.0000030750973,0.000010586179,0.000007418519,0.9968246,0.0004605708,0.0025101893,0.00011277826,0.0000023502632],"about_ca_topic_score_codex":0.0023265711,"about_ca_topic_score_gemma":0.00195707,"teacher_disagreement_score":0.0023265711,"about_ca_system_score_codex":0.0007541598,"about_ca_system_score_gemma":0.00062702637,"threshold_uncertainty_score":0.005471885},"labels":[],"label_agreement":null},{"id":"W1973323421","doi":"10.1109/tcomm.2014.010914.130249","title":"Free-Space Optical Communication with Nonzero Boresight Pointing Errors","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":400,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Fading; Probability density function; Free-space optical communication; Jitter; Bit error rate; Log-normal distribution; Optics; Cumulative distribution function; Optical communication; Nakagami distribution; Electronic engineering; Time diversity; Mathematics; Physics; Computer science; Statistics; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.013823083471176457,"score_gpt":0.22404120163205266,"score_spread":0.2102181181608762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973323421","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.27944916,0.0011551848,0.7129854,0.00029315936,0.00007710775,0.000025039526,0.0001615854,0.000427427,0.0054260227],"genre_scores_gemma":[0.99066824,0.00033887711,0.008190428,0.00003454272,0.000026344313,0.000006704176,0.00003105928,0.000007531428,0.00069625996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990459,0.00016959579,0.00004082284,0.00012853839,0.00043409978,0.00018097732],"domain_scores_gemma":[0.9973149,0.001237618,0.0005627162,0.00035160157,0.00047538083,0.000057734018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008625051,0.00081505097,0.0004989811,0.00050840527,0.0004674423,0.000830352,0.00066490116,0.00085455034,0.0003839391],"category_scores_gemma":[0.00405917,0.0002558964,0.00041664438,0.00086650555,0.00102151,0.001524888,0.00082750135,0.00060428615,0.00010909126],"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.00026174233,0.00006530766,0.009162854,0.00020116307,0.00008897991,0.0009891117,0.00021345435,0.81640816,0.027795883,0.101532355,0.0010154162,0.042265538],"study_design_scores_gemma":[0.000008712967,0.00007783089,0.001506337,0.000013916088,0.000024590461,0.0004900189,0.00004103837,0.9793084,0.00496396,0.012942695,0.0005869356,0.00003555028],"about_ca_topic_score_codex":0.003242406,"about_ca_topic_score_gemma":0.0033537003,"teacher_disagreement_score":0.003242406,"about_ca_system_score_codex":0.00082515687,"about_ca_system_score_gemma":0.00092137704,"threshold_uncertainty_score":0.006447077},"labels":[],"label_agreement":null},{"id":"W1974016518","doi":"10.1109/tcomm.2014.2361337","title":"Lattice-Reduction-Aided Conditional Detection for MIMO Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Lattice reduction; Orthogonality; MIMO; Detector; Algorithm; Fading; Computational complexity theory; Lattice (music); Mathematics; Reduction (mathematics); Decoding methods; Computer science; Channel (broadcasting); Topology (electrical circuits); Theoretical computer science; Telecommunications; Combinatorics","score_opus":0.027701495235057216,"score_gpt":0.2748324164135937,"score_spread":0.24713092117853647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974016518","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.009878135,0.00009334609,0.98785895,0.00011845253,0.00003053655,0.000015393669,0.00005252646,0.0003273659,0.0016253133],"genre_scores_gemma":[0.37313378,0.00017898627,0.6234693,0.00018602419,0.00005573322,0.00007398346,0.00019396398,0.000081078906,0.0026271308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922764,0.00022609648,0.000028607928,0.000083148414,0.00036921893,0.00006529046],"domain_scores_gemma":[0.9991636,0.00037157678,0.00008892118,0.0001760851,0.00016046345,0.000039358565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006179529,0.00045139797,0.00062782556,0.00029945956,0.00028222208,0.0006212415,0.00071786216,0.00047375791,0.0017344474],"category_scores_gemma":[0.0019683938,0.00023761943,0.00033681068,0.00043687047,0.0007260968,0.00081511505,0.0009844871,0.0011468444,0.0007380694],"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.00037466348,0.00013636351,0.0009775667,0.00023961431,0.00006895623,0.00025054315,0.00016244457,0.35998774,0.13769677,0.2950183,0.005283484,0.19980353],"study_design_scores_gemma":[0.0000131510815,0.00006679059,0.00008168898,0.0000070792225,0.0000059064396,0.00012313243,0.0000056839062,0.9569283,0.02771065,0.013194832,0.0018385403,0.000024129398],"about_ca_topic_score_codex":0.00048591787,"about_ca_topic_score_gemma":0.00091376744,"teacher_disagreement_score":0.0017344474,"about_ca_system_score_codex":0.00043281092,"about_ca_system_score_gemma":0.0010476989,"threshold_uncertainty_score":0.0058022738},"labels":[],"label_agreement":null},{"id":"W1974190285","doi":"10.1109/tcomm.2013.092813.130126","title":"Uniform Approximations for Wireless Performance in Fading Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"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":"Moment-generating function; Fading; Rayleigh fading; Maximal-ratio combining; Probability density function; Signal-to-noise ratio (imaging); Mathematics; Cumulative distribution function; Channel (broadcasting); Algorithm; Topology (electrical circuits); Computer science; Statistics; Telecommunications","score_opus":0.06295867897916722,"score_gpt":0.2874495964671314,"score_spread":0.22449091748796418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974190285","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.007591072,0.001198523,0.98031485,0.00016373493,0.00007176857,0.000021715356,0.00007693265,0.00020364439,0.010357841],"genre_scores_gemma":[0.78347695,0.0069977427,0.19418924,0.00049180526,0.0004243578,0.00030663854,0.00027961863,0.00040723162,0.013426417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884146,0.0003931896,0.000051636922,0.000119695316,0.00042209125,0.00017186179],"domain_scores_gemma":[0.99547666,0.0029429093,0.00032321518,0.00056333776,0.0006143662,0.000079487494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022953541,0.0015502239,0.00072314957,0.0015178547,0.00040792197,0.0012061271,0.0012798657,0.0009057425,0.001995929],"category_scores_gemma":[0.01261587,0.00038581726,0.0008366183,0.0011572487,0.0018429557,0.0026389896,0.0012276267,0.0021342612,0.0010702916],"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.00004134476,0.000032896904,0.00072955503,0.00018251335,0.000037015776,0.00026571495,0.00025424236,0.45770985,0.0030515427,0.51496613,0.002052633,0.020676631],"study_design_scores_gemma":[0.0000025178254,0.000022120876,0.00023636004,0.000039561364,0.000009680277,0.00011308517,0.000029866329,0.9361038,0.0009889446,0.06083812,0.0016018144,0.00001408112],"about_ca_topic_score_codex":0.0024111161,"about_ca_topic_score_gemma":0.0011778498,"teacher_disagreement_score":0.0024111161,"about_ca_system_score_codex":0.001202882,"about_ca_system_score_gemma":0.0005548251,"threshold_uncertainty_score":0.012139142},"labels":[],"label_agreement":null},{"id":"W1977865278","doi":"10.1109/tcomm.2014.2315612","title":"Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"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; Single antenna interference cancellation; Scheduling (production processes); Wireless network; Computer network; Network performance; Greedy algorithm; Network topology; Transmission (telecommunications); Computational complexity theory; Wireless; Distributed computing; Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.17759528154483173,"score_gpt":0.32021710654508617,"score_spread":0.14262182500025444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977865278","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.056102954,0.002022529,0.9330905,0.00077397743,0.000055099757,0.00004224895,0.000060257935,0.00009181722,0.0077605434],"genre_scores_gemma":[0.89634943,0.004515493,0.096520096,0.0002248463,0.00010952742,0.00009447907,0.00008486917,0.00005279803,0.0020484703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949765,0.00023388154,0.000014395639,0.00005280037,0.0001440482,0.00005716938],"domain_scores_gemma":[0.99919134,0.000597395,0.00008969898,0.00004666249,0.000056805828,0.000018053432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069643435,0.0007207419,0.00044172007,0.00031136003,0.00028160712,0.00094073324,0.0005719902,0.000712498,0.0011471682],"category_scores_gemma":[0.002385367,0.00048494292,0.0004089754,0.00047971634,0.00079198723,0.0017780546,0.0005033483,0.0011265058,0.00020098328],"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.000016302876,0.000028492843,0.00028868453,0.000050558334,0.000008752638,0.000031300726,0.000023915116,0.9703199,0.0016150125,0.01999405,0.00017046019,0.0074525853],"study_design_scores_gemma":[0.0000032137157,0.00002878835,0.00018613737,0.000008653035,0.0000057324123,0.00001510324,0.000015524138,0.98282856,0.00065371656,0.01574097,0.00050905644,0.000004613337],"about_ca_topic_score_codex":0.0029800322,"about_ca_topic_score_gemma":0.0026475578,"teacher_disagreement_score":0.0029800322,"about_ca_system_score_codex":0.00070914446,"about_ca_system_score_gemma":0.0007091549,"threshold_uncertainty_score":0.0059253573},"labels":[],"label_agreement":null},{"id":"W1979802120","doi":"10.1109/tcomm.2012.122112.110805","title":"Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"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; Advanced Micro Devices (Canada)","funders":"","keywords":"Algorithm; Computer science; Low-density parity-check code; Turbo code; Decoding methods; Mathematics","score_opus":0.03332396291760937,"score_gpt":0.3172709810086092,"score_spread":0.2839470180909998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979802120","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.08107505,0.00015573009,0.91662055,0.000051768657,0.0000091376405,0.000035758287,0.00007070803,0.0002704296,0.0017108751],"genre_scores_gemma":[0.7418323,0.00019569742,0.25692973,0.00003217264,0.0000087371145,0.000088408844,0.00016762226,0.00007675967,0.0006685269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.00076752255,0.00007980156,0.00013114211,0.0006712693,0.000064249434],"domain_scores_gemma":[0.99472827,0.00376395,0.00041504714,0.00047003516,0.00057146867,0.000051290914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016355125,0.0006569383,0.00080246426,0.0011991834,0.00031020626,0.0011769583,0.0010313482,0.00062157796,0.0006792471],"category_scores_gemma":[0.013820702,0.0003349868,0.00034443935,0.00071780983,0.00090890954,0.0013011631,0.0008175919,0.00069550116,0.00027046216],"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.00012117273,0.000030803792,0.0014566177,0.00006616949,0.000023672885,0.000063220774,0.00005918207,0.9438025,0.007744361,0.021763213,0.00014157992,0.024727587],"study_design_scores_gemma":[0.000004923655,0.000015049368,0.0001827502,0.0000070182964,0.000002853229,0.000021029455,0.00000512028,0.9909575,0.005253683,0.0034649875,0.00007608541,0.000009037146],"about_ca_topic_score_codex":0.0013247776,"about_ca_topic_score_gemma":0.0010705425,"teacher_disagreement_score":0.0016355125,"about_ca_system_score_codex":0.0009577821,"about_ca_system_score_gemma":0.00078824034,"threshold_uncertainty_score":0.008649468},"labels":[],"label_agreement":null},{"id":"W1981907634","doi":"10.1109/tcomm.2013.020413.120070","title":"On the Capacity of Duplication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Alberta","funders":"","keywords":"Gene duplication; Channel capacity; Channel (broadcasting); Probability density function; Upper and lower bounds; Mathematics; Series (stratigraphy); Representation (politics); Computer science; Algorithm; Topology (electrical circuits); Combinatorics; Statistics; Telecommunications","score_opus":0.04739777772552795,"score_gpt":0.2642986101064345,"score_spread":0.21690083238090657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981907634","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.24073455,0.008123569,0.62290037,0.005750355,0.0006742764,0.00016499052,0.0021215924,0.0007910683,0.11873913],"genre_scores_gemma":[0.96139383,0.0048302,0.018526647,0.00061407464,0.00082401256,0.00039333847,0.0005589718,0.00024412043,0.012614856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973464,0.0007701857,0.00008838374,0.00034462352,0.0005910087,0.0008594543],"domain_scores_gemma":[0.97701687,0.018797088,0.00085504237,0.0011386493,0.0015896681,0.00060267036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028826937,0.0015594169,0.0020442593,0.002802499,0.0017152269,0.0037555473,0.0024785295,0.0017329875,0.00945736],"category_scores_gemma":[0.02094321,0.0007447986,0.00082191353,0.0032102147,0.004798923,0.0048602647,0.0033250074,0.0032405653,0.0013261555],"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.00025361485,0.00006645907,0.00028629266,0.00025033957,0.000036356396,0.00023903635,0.00020495604,0.1522767,0.0044470592,0.82295966,0.005859894,0.013119626],"study_design_scores_gemma":[0.00003606086,0.000045646884,0.00019431468,0.00010511872,0.00002732415,0.00022489535,0.00006757789,0.43070167,0.0017546617,0.56419903,0.002584414,0.00005933241],"about_ca_topic_score_codex":0.0022523112,"about_ca_topic_score_gemma":0.0009956326,"teacher_disagreement_score":0.00945736,"about_ca_system_score_codex":0.0036963285,"about_ca_system_score_gemma":0.0020769364,"threshold_uncertainty_score":0.031637967},"labels":[],"label_agreement":null},{"id":"W1983459476","doi":"10.1109/tcomm.2012.050912.110380","title":"Training and Decodings for Cooperative Network with Multiple Relays and Receive Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of Alberta","funders":"","keywords":"Decoding methods; Relay; Transmitter; Computer science; Channel (broadcasting); Bit error rate; Channel state information; Relay channel; Algorithm; Space–time code; Electronic engineering; Antenna (radio); List decoding; Maximal-ratio combining; Telecommunications; Fading; Wireless; Engineering; Block code; Concatenated error correction code","score_opus":0.08999971044700875,"score_gpt":0.30364295564536475,"score_spread":0.213643245198356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983459476","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.15342635,0.00052102556,0.84230936,0.0002500232,0.00002472875,0.000041404965,0.00004694984,0.00020287682,0.0031771278],"genre_scores_gemma":[0.94261014,0.00022965191,0.055314556,0.000055732176,0.000019165538,0.00004795931,0.00004265378,0.000016940003,0.0016632113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906534,0.00031757646,0.000046501,0.00015422466,0.0002727384,0.00014364313],"domain_scores_gemma":[0.9955336,0.0031073887,0.00046615745,0.00035042208,0.0004798155,0.00006263913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977213,0.00065107987,0.0005960674,0.00032760834,0.00047633584,0.00051207823,0.00059418764,0.00085318997,0.00073759374],"category_scores_gemma":[0.0078826295,0.00028879775,0.00030345848,0.00051992474,0.000964855,0.0012069925,0.0007367781,0.00051978027,0.00019834754],"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.00017025627,0.000033572254,0.0009663499,0.00006166091,0.000024950543,0.0001565366,0.00022794693,0.9433262,0.0065021776,0.01873799,0.00029427608,0.029498149],"study_design_scores_gemma":[0.0000101384185,0.00006059803,0.00016683138,0.000005327018,0.000010079687,0.00008436504,0.000021808593,0.9921928,0.0033524574,0.0038380239,0.00024815192,0.000009360511],"about_ca_topic_score_codex":0.0042409324,"about_ca_topic_score_gemma":0.003512623,"teacher_disagreement_score":0.0042409324,"about_ca_system_score_codex":0.0010031033,"about_ca_system_score_gemma":0.0011216331,"threshold_uncertainty_score":0.0084325075},"labels":[],"label_agreement":null},{"id":"W1984363480","doi":"10.1109/tcomm.2013.042313.120629","title":"Fourth-Order Statistics for Blind Classification of Spatial Multiplexing and Alamouti Space-Time Block Code Signals","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Memorial University of Newfoundland","funders":"","keywords":"Space–time block code; Block code; Algorithm; Fading; Spatial multiplexing; Nakagami distribution; Multiplexing; Computer science; Orthogonal frequency-division multiplexing; Antenna (radio); Electronic engineering; Channel (broadcasting); Telecommunications; MIMO; Decoding methods; Engineering","score_opus":0.056353214200314555,"score_gpt":0.31224299428634233,"score_spread":0.2558897800860278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984363480","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.014481899,0.0004289656,0.9837001,0.00011730768,0.000044310673,0.00003020896,0.000058369507,0.00037324167,0.0007655574],"genre_scores_gemma":[0.3223525,0.00091595337,0.6729396,0.0001538182,0.00020854815,0.00018369609,0.00040619317,0.00009366266,0.002746079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984585,0.0004584637,0.00010767817,0.00017130523,0.00069170847,0.00011237],"domain_scores_gemma":[0.99477357,0.0030732795,0.00082856877,0.0005719996,0.0006608333,0.00009168601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139618,0.0007707906,0.0007221097,0.0021375786,0.0005343184,0.0011235457,0.0006798788,0.00097590964,0.0010702254],"category_scores_gemma":[0.01094827,0.0002801912,0.0005599521,0.0015093387,0.0013245625,0.0011667635,0.0007159768,0.0011949025,0.0006697646],"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.00071366807,0.00013158444,0.002799052,0.00024146083,0.00010659397,0.00012970548,0.00021625323,0.24418646,0.02602597,0.1202822,0.0030413717,0.6021257],"study_design_scores_gemma":[0.000019298352,0.00006802582,0.0008796267,0.000017234313,0.000013325422,0.0001566685,0.00001507039,0.9610148,0.012313345,0.023969423,0.0014969758,0.00003628348],"about_ca_topic_score_codex":0.0013376283,"about_ca_topic_score_gemma":0.0012886329,"teacher_disagreement_score":0.002139618,"about_ca_system_score_codex":0.0010710169,"about_ca_system_score_gemma":0.0019450373,"threshold_uncertainty_score":0.011315465},"labels":[],"label_agreement":null},{"id":"W1985952244","doi":"10.1109/tcomm.2011.121611.110181","title":"Diversity Gain and Outage Probability for MIMO Free-Space Optical Links with Misalignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fading; Diversity gain; MIMO; Fading distribution; Signal-to-noise ratio (imaging); Diversity combining; Channel (broadcasting); Maximal-ratio combining; Electronic engineering; Channel state information; Computer science; Transmitter; Telecommunications; Wireless; Engineering; Rayleigh fading","score_opus":0.059146595102558916,"score_gpt":0.2361440594475078,"score_spread":0.1769974643449489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985952244","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.30870166,0.0020411343,0.680941,0.0006970772,0.0000832706,0.00004880324,0.00042356353,0.00037237207,0.0066911024],"genre_scores_gemma":[0.99246407,0.0006993435,0.0052423715,0.000057169214,0.00007841547,0.000035443183,0.00010098923,0.000029461997,0.0012926918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878854,0.00033515654,0.00003151663,0.00012267266,0.00045853257,0.00026355832],"domain_scores_gemma":[0.9940001,0.0041054813,0.00090829877,0.00036187563,0.0005072644,0.00011703717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014979301,0.001186853,0.0009043438,0.00080863124,0.0005536542,0.001042442,0.0008876878,0.001232415,0.0010371192],"category_scores_gemma":[0.0058670407,0.0006077735,0.00055719167,0.000947036,0.001493778,0.0017217777,0.0009218183,0.0011226337,0.00031853633],"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.00008369125,0.00003257569,0.0012894536,0.000056685283,0.00002786633,0.0002669244,0.0000786157,0.96783775,0.0045640934,0.021772988,0.0004045634,0.0035848194],"study_design_scores_gemma":[0.000004362056,0.000032986354,0.0004893445,0.000006153644,0.000009333209,0.0001001855,0.000015537638,0.9940217,0.0006554426,0.0045359316,0.00011443431,0.00001464199],"about_ca_topic_score_codex":0.00317198,"about_ca_topic_score_gemma":0.0033852146,"teacher_disagreement_score":0.00317198,"about_ca_system_score_codex":0.0016365633,"about_ca_system_score_gemma":0.0008545439,"threshold_uncertainty_score":0.011874139},"labels":[],"label_agreement":null},{"id":"W1987532191","doi":"10.1109/tcomm.2015.2404777","title":"Energy Harvesting Wireless Communications With Energy Cooperation Between Transmitter and Receiver","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":33,"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":"Transmitter; Energy harvesting; Rayleigh fading; Energy (signal processing); Wireless; Electronic engineering; Transmitter power output; Computer science; Fading; Additive white Gaussian noise; Electrical engineering; Engineering; Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.04103937744648119,"score_gpt":0.23714233213533525,"score_spread":0.19610295468885408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987532191","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.046944104,0.0010097197,0.94387734,0.00024998773,0.000051213083,0.000040798637,0.000024424835,0.00013283259,0.0076695113],"genre_scores_gemma":[0.95170623,0.0010540258,0.042945866,0.00009655921,0.00005454046,0.00007777494,0.000021504156,0.000011396792,0.0040320107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995913,0.00013509113,0.00002057319,0.00008503693,0.00012220179,0.0000457647],"domain_scores_gemma":[0.99973756,0.0001328747,0.00004348357,0.000034254655,0.00004244566,0.000009432032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025395,0.00056813273,0.000600282,0.00018165645,0.00038313217,0.00063850096,0.0007328221,0.00072894146,0.0007585797],"category_scores_gemma":[0.0006698103,0.00021898767,0.00036486005,0.0005868196,0.0006386184,0.0010692104,0.00081864203,0.00039932065,0.0002785032],"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.0002591357,0.00012340808,0.0016036684,0.00049497874,0.000115772964,0.0012218276,0.00035064417,0.68128914,0.07706174,0.1525047,0.0020563859,0.08291862],"study_design_scores_gemma":[0.000023558036,0.00018305691,0.00029916453,0.000019460018,0.00003518925,0.00044699243,0.00005651656,0.967099,0.0077179987,0.02149807,0.0025969308,0.000024063169],"about_ca_topic_score_codex":0.00027587,"about_ca_topic_score_gemma":0.0003476569,"teacher_disagreement_score":0.0007585797,"about_ca_system_score_codex":0.00027627693,"about_ca_system_score_gemma":0.0003328171,"threshold_uncertainty_score":0.0026577115},"labels":[],"label_agreement":null},{"id":"W1988384836","doi":"10.1109/tcomm.2015.2396916","title":"Queue-Aware Transmission Scheduling for Cooperative Wireless Communications","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of Victoria","funders":"","keywords":"Computer science; Dynamic priority scheduling; Mathematical optimization; Fair-share scheduling; Round-robin scheduling; Scheduling (production processes); Rate-monotonic scheduling; Queue; Computer network; Mathematics; Quality of service","score_opus":0.13224458012143012,"score_gpt":0.3476252542649352,"score_spread":0.21538067414350506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988384836","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.027929667,0.00034195086,0.9700684,0.0001015952,0.000042565705,0.000029540412,0.000025835927,0.00012378134,0.0013367939],"genre_scores_gemma":[0.89059037,0.0003952673,0.107355714,0.000062641135,0.000039403712,0.00006656715,0.00006258601,0.00003618061,0.0013913437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966466,0.000110957626,0.000017277158,0.00006057815,0.00009031491,0.000056226567],"domain_scores_gemma":[0.9992237,0.00041588378,0.00010159865,0.00005837564,0.00015822388,0.000042183117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974097,0.00052691635,0.00057567516,0.0003328298,0.00053284195,0.00063853414,0.0010715032,0.00037789217,0.00095486135],"category_scores_gemma":[0.0019506754,0.00021598978,0.00027601127,0.00069404446,0.0004228276,0.0009870365,0.00057962054,0.00065272726,0.00017282827],"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.00009727686,0.00007534104,0.0004404874,0.00007715602,0.000025683174,0.00007297647,0.00013647106,0.9146382,0.009607944,0.027839754,0.0013705029,0.04561814],"study_design_scores_gemma":[0.0000048374213,0.000022449067,0.000034049197,0.0000014203179,0.0000030135996,0.0000084231215,0.000007254831,0.9976476,0.0004646328,0.0015719561,0.00023142634,0.000003017551],"about_ca_topic_score_codex":0.0052433186,"about_ca_topic_score_gemma":0.0072858036,"teacher_disagreement_score":0.0052433186,"about_ca_system_score_codex":0.0010752053,"about_ca_system_score_gemma":0.0016066686,"threshold_uncertainty_score":0.010425627},"labels":[],"label_agreement":null},{"id":"W1989889906","doi":"10.1109/tcomm.2014.2360852","title":"Source-Channel Coding for Fading Channels With Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Fading; Computer science; Channel state information; Transmitter; Channel (broadcasting); Upper and lower bounds; Algorithm; Decoding methods; Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.03337097799345879,"score_gpt":0.25657922920778325,"score_spread":0.22320825121432447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989889906","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.01856611,0.00043161216,0.9784759,0.00013341973,0.000023447365,0.000026251615,0.000070831855,0.00008041034,0.0021920432],"genre_scores_gemma":[0.89693636,0.0008734706,0.09984023,0.000081816564,0.000041213145,0.00010651909,0.00014918708,0.000031410385,0.0019398882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990477,0.00030875512,0.00003693597,0.000080353544,0.0003951871,0.00013114397],"domain_scores_gemma":[0.99688536,0.0023023002,0.00024162717,0.00020025522,0.000325597,0.000044837758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001455934,0.0010520096,0.0008588265,0.0005170568,0.00034173083,0.0009072804,0.0009881468,0.0008415723,0.0013081223],"category_scores_gemma":[0.0052682087,0.00031052998,0.00044171754,0.0010432698,0.0011931884,0.0012442464,0.0014436906,0.0011657553,0.00028317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046497586,0.000009267821,0.00016392424,0.000063066094,0.000020247513,0.00007485221,0.000057335103,0.93498826,0.0018195818,0.0552585,0.00025960398,0.007238819],"study_design_scores_gemma":[0.0000056988297,0.000011020235,0.000036116253,0.000007279841,0.000005172179,0.000021383281,0.000006081624,0.9882742,0.00084964925,0.010587053,0.000191057,0.0000053452495],"about_ca_topic_score_codex":0.0031660993,"about_ca_topic_score_gemma":0.0023540815,"teacher_disagreement_score":0.0031660993,"about_ca_system_score_codex":0.0012568622,"about_ca_system_score_gemma":0.0013102227,"threshold_uncertainty_score":0.009119272},"labels":[],"label_agreement":null},{"id":"W1991079262","doi":"10.1109/tcomm.2003.815083","title":"Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Decoding methods; Turbo code; Sequential decoding; Interleaving; Computer science; Algorithm; Encoder; Concatenated error correction code; List decoding; Error detection and correction; Block code","score_opus":0.05423382058004998,"score_gpt":0.323706578886975,"score_spread":0.269472758306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991079262","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.03429289,0.00041881227,0.96244013,0.00006410419,0.00005320149,0.0000277003,0.00003676114,0.00038659293,0.0022798416],"genre_scores_gemma":[0.64397585,0.0007678028,0.35000956,0.00007878727,0.000062877494,0.00006531762,0.00017623871,0.00012226177,0.004741336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.00006368294,0.000044315042,0.000048438236,0.00027452942,0.00005457402],"domain_scores_gemma":[0.9991141,0.0003058831,0.00011797558,0.00017275146,0.00025474807,0.000034444194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038132299,0.00031231792,0.00031189123,0.00047131118,0.00029784598,0.00059321575,0.0005252373,0.00041031782,0.0005831345],"category_scores_gemma":[0.0021545056,0.00014446676,0.00023522417,0.0005988129,0.00046684116,0.00089224527,0.00056177075,0.0004829425,0.00033023677],"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.00046197404,0.000074889984,0.0021134694,0.00027747705,0.00006781631,0.00042343987,0.00034855006,0.16569664,0.22415625,0.18483716,0.0026397135,0.41890264],"study_design_scores_gemma":[0.000023933211,0.00016105239,0.0003515977,0.000027824637,0.00002636095,0.00048697708,0.000019440573,0.84066755,0.13180588,0.021389907,0.0050049955,0.000034458437],"about_ca_topic_score_codex":0.00089446007,"about_ca_topic_score_gemma":0.0012658433,"teacher_disagreement_score":0.00089446007,"about_ca_system_score_codex":0.00040425517,"about_ca_system_score_gemma":0.0009175757,"threshold_uncertainty_score":0.002933085},"labels":[],"label_agreement":null},{"id":"W1995345730","doi":"10.1109/tcomm.2014.2367014","title":"Flexible Symmetric Multiple Description Lattice Vector Quantizer With <inline-formula> <tex-math notation=\"TeX\">$L\\geq 3$</tex-math></inline-formula> Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"","keywords":"Mathematics; Decoding methods; Lattice (music); Algorithm; Erasure; Notation; Discrete mathematics; Arithmetic; Computer science","score_opus":0.04422991991100132,"score_gpt":0.28563133392587653,"score_spread":0.2414014140148752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995345730","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.0094298,0.00047070422,0.98566705,0.00017515096,0.00006694118,0.00009794673,0.00021536561,0.00072001736,0.0031570306],"genre_scores_gemma":[0.34894457,0.00047782168,0.6439868,0.00023794264,0.000054339485,0.00019836528,0.00050771603,0.00011263345,0.005479768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00009620923,0.000040530078,0.00007410109,0.00021516094,0.000044843884],"domain_scores_gemma":[0.9993987,0.00018281647,0.00008477806,0.00017720008,0.00012502624,0.000031508953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082241226,0.0004669805,0.00053871784,0.0003796389,0.00033727885,0.0010271863,0.001195162,0.00042584664,0.0039729266],"category_scores_gemma":[0.0017534154,0.00021656265,0.00030018616,0.000890323,0.0005299607,0.0015799527,0.00094977574,0.00092943583,0.0009830045],"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.00047754165,0.00014528199,0.0009352567,0.00043734783,0.00005958507,0.00029618508,0.00024542102,0.16415226,0.08214249,0.20176898,0.009884171,0.5394555],"study_design_scores_gemma":[0.00007760432,0.00014063495,0.00016660235,0.00003893733,0.000016347447,0.00028903736,0.000042216205,0.9204,0.04333272,0.023139114,0.012300477,0.00005631901],"about_ca_topic_score_codex":0.001699688,"about_ca_topic_score_gemma":0.0023746477,"teacher_disagreement_score":0.0039729266,"about_ca_system_score_codex":0.0007281864,"about_ca_system_score_gemma":0.0014994935,"threshold_uncertainty_score":0.013290763},"labels":[],"label_agreement":null},{"id":"W1997394709","doi":"10.1109/tcomm.2012.081512.110408","title":"Using the Wireless and PLC Channels for Diversity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Subcarrier; Wireless; Diversity combining; Computer science; Signal-to-noise ratio (imaging); Maximal-ratio combining; Electronic engineering; Narrowband; Orthogonal frequency-division multiplexing; Throughput; Diversity scheme; Bit error rate; Computer network; Fading; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.10528708014022488,"score_gpt":0.3005666736421725,"score_spread":0.19527959350194762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997394709","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.30176133,0.0006900572,0.68377924,0.0003141846,0.000055022738,0.000027164482,0.00011152507,0.0006998442,0.012561625],"genre_scores_gemma":[0.96520174,0.00029472672,0.032958668,0.000052694795,0.00004535948,0.000017676472,0.000056954006,0.00002164635,0.0013505579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971527,0.00007198844,0.0000063569,0.00003980576,0.00013252663,0.00003402446],"domain_scores_gemma":[0.9997311,0.00012057136,0.000041523952,0.000058024045,0.000039246548,0.000009608997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024191593,0.00037658509,0.00025758488,0.0002122297,0.0003321315,0.00055001414,0.00020158476,0.00031485225,0.0014701904],"category_scores_gemma":[0.0005576629,0.00019520137,0.00021468847,0.00042783818,0.00051024894,0.0007284623,0.00034657793,0.00030592148,0.00038106643],"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.000445003,0.00015076644,0.011996569,0.00018308271,0.00013446709,0.00038610012,0.0001630771,0.40127146,0.3197134,0.04543585,0.002355017,0.21776521],"study_design_scores_gemma":[0.000047906444,0.0007684603,0.0063597867,0.000031988868,0.00012174948,0.0008786292,0.00009990437,0.8523674,0.10794196,0.0194247,0.011897952,0.00005956273],"about_ca_topic_score_codex":0.00079659594,"about_ca_topic_score_gemma":0.0013240316,"teacher_disagreement_score":0.0014701904,"about_ca_system_score_codex":0.00038949764,"about_ca_system_score_gemma":0.00037263983,"threshold_uncertainty_score":0.0049182177},"labels":[],"label_agreement":null},{"id":"W1998050154","doi":"10.1109/tcomm.2013.102313.110741","title":"Coding Opportunity Densification Strategies for Instantly Decodable Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Goodput; Linear network coding; Network packet; Erasure; Coding (social sciences); Computer science; Monotonic function; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Computer network; Telecommunications; Wireless; Throughput","score_opus":0.11632450337673955,"score_gpt":0.317877816346718,"score_spread":0.20155331296997847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998050154","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.101080775,0.00059435447,0.89342684,0.00020369378,0.000036066318,0.00009284631,0.000047272206,0.00020352601,0.004314614],"genre_scores_gemma":[0.91432935,0.00031736752,0.08310867,0.00007510522,0.000021384809,0.00009232966,0.00003413745,0.00003707183,0.0019846493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.00026295302,0.000034808967,0.00014228339,0.00026931232,0.0001657205],"domain_scores_gemma":[0.994932,0.003417765,0.0005351357,0.0004529807,0.00047504148,0.00018709776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014952224,0.0008509885,0.00057509524,0.00081384805,0.0005499607,0.0008233696,0.0013947948,0.00058234885,0.0011473628],"category_scores_gemma":[0.00758662,0.00037798137,0.0002605695,0.00057178334,0.0015947986,0.0021307606,0.0018081005,0.0010947775,0.00013729677],"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.00029573758,0.000108265434,0.001005064,0.00018544172,0.000051630235,0.00026169943,0.00045566174,0.7392842,0.02647424,0.16423939,0.00092347653,0.066715196],"study_design_scores_gemma":[0.000029102663,0.00015312227,0.00036960738,0.00003549881,0.000026709213,0.00020875054,0.00010818934,0.9428834,0.011649017,0.04291372,0.0015846984,0.00003814184],"about_ca_topic_score_codex":0.0014796504,"about_ca_topic_score_gemma":0.0020959626,"teacher_disagreement_score":0.0014952224,"about_ca_system_score_codex":0.001330839,"about_ca_system_score_gemma":0.0011094555,"threshold_uncertainty_score":0.009655952},"labels":[],"label_agreement":null},{"id":"W1998710728","doi":"10.1109/tcomm.2014.2338856","title":"Performance Analysis of Relay-Based Cooperative Spectrum Sensing in Cognitive Radio Networks Over Non-Identical Nakagami-<named-content content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"TeX\">$m$</tex-math></inline-formula></named-content> Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":33,"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":"Nakagami distribution; Cognitive radio; Fading; Relay; False alarm; Computer science; Channel (broadcasting); Algorithm; Bandwidth (computing); Spectral efficiency; Topology (electrical circuits); Mathematics; Electronic engineering; Wireless; Telecommunications; Engineering; Artificial intelligence","score_opus":0.040413240420220986,"score_gpt":0.2738888044175049,"score_spread":0.23347556399728392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998710728","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.50060135,0.0013222656,0.48607093,0.00032981538,0.000046684934,0.000060489514,0.00009780288,0.00023919035,0.011231505],"genre_scores_gemma":[0.99684334,0.00017051121,0.0025304903,0.000017598164,0.0000066589655,0.000011624965,0.000013326284,0.0000054699412,0.00040091487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990275,0.0003512296,0.000036580746,0.00016034995,0.00023244765,0.000191866],"domain_scores_gemma":[0.9963659,0.0024756228,0.00038349026,0.00015855147,0.00053885113,0.00007745907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016361543,0.00083976676,0.00058909593,0.0004980604,0.0003731101,0.0009837699,0.0007844428,0.00076377654,0.00068013254],"category_scores_gemma":[0.004549017,0.00021635667,0.00040936487,0.00046747952,0.000983084,0.0006739923,0.0008822394,0.00044640063,0.00014514459],"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.00029693224,0.00004678482,0.00195074,0.00013780507,0.00007986094,0.00030767164,0.00023228483,0.9560393,0.011399181,0.015896505,0.00032961572,0.01328333],"study_design_scores_gemma":[0.000004560867,0.00008749778,0.00045777907,0.0000062181725,0.000020525422,0.00006827676,0.000039350012,0.996601,0.0013462679,0.0012954792,0.00006422449,0.000008743392],"about_ca_topic_score_codex":0.0040145027,"about_ca_topic_score_gemma":0.0022633097,"teacher_disagreement_score":0.0040145027,"about_ca_system_score_codex":0.0010537464,"about_ca_system_score_gemma":0.0008017642,"threshold_uncertainty_score":0.008652866},"labels":[],"label_agreement":null},{"id":"W1998929580","doi":"10.1109/tcomm.2009.11.070095","title":"On the design of raptor codes for binary-input gaussian channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":64,"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":"Raptor code; Computer science; EXIT chart; Additive white Gaussian noise; Binary number; Channel (broadcasting); Forward error correction; Decoding methods; Turbo code; Code (set theory); Algorithm; Binary code; Telecommunications; Concatenated error correction code; Block code; Mathematics; Arithmetic","score_opus":0.07119583108889162,"score_gpt":0.3137383782324997,"score_spread":0.24254254714360812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998929580","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.014057249,0.00097186636,0.98128223,0.00015189481,0.000036294314,0.00004724633,0.000043335418,0.00019392325,0.003215986],"genre_scores_gemma":[0.41916272,0.0028659995,0.574006,0.00021606388,0.00017229418,0.00019404014,0.0001740834,0.0001321334,0.0030767177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979964,0.0011261333,0.000075874756,0.00014391443,0.0005390251,0.00011858361],"domain_scores_gemma":[0.9946938,0.0038908322,0.00040749388,0.00023103818,0.0007065583,0.00007014006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027821867,0.0009386655,0.0007349209,0.00091976003,0.00045384394,0.0010057603,0.00060162257,0.0009690386,0.0010121174],"category_scores_gemma":[0.008923647,0.00041357544,0.0004081046,0.00086972245,0.0010136232,0.0012232991,0.0007639636,0.0008949162,0.00043022435],"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.00040661785,0.000055506796,0.0008900665,0.00047347238,0.00008357037,0.00031171727,0.00037725747,0.68877846,0.013673749,0.14402501,0.002406799,0.14851777],"study_design_scores_gemma":[0.000032372336,0.00019923078,0.00014203189,0.00008644172,0.000023785922,0.00032276203,0.00004219677,0.9375989,0.0139094265,0.043369748,0.0042342497,0.00003898832],"about_ca_topic_score_codex":0.00052142923,"about_ca_topic_score_gemma":0.0004930287,"teacher_disagreement_score":0.0027821867,"about_ca_system_score_codex":0.00049064547,"about_ca_system_score_gemma":0.0007790561,"threshold_uncertainty_score":0.014713764},"labels":[],"label_agreement":null},{"id":"W1999062841","doi":"10.1109/tcomm.2013.070213.120570","title":"Energy-Efficient Cooperative Routing in Wireless Sensor Networks: A Mixed-Integer Optimization Framework and Explicit Solution","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":49,"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; Mathematical optimization; Wireless sensor network; Relay; Node (physics); Optimization problem; Integer programming; Transmission (telecommunications); Broadcasting (networking); Distributed computing; Computer network; Power (physics); Engineering; Algorithm; Mathematics; Telecommunications","score_opus":0.029147007911218943,"score_gpt":0.262162192802152,"score_spread":0.2330151848909331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999062841","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.002298252,0.0003841045,0.99525297,0.00018053077,0.000019501858,0.000020997559,0.0000148458275,0.00004046247,0.0017883765],"genre_scores_gemma":[0.36652756,0.0023252647,0.62514734,0.00020238088,0.0001593806,0.000500516,0.00010494065,0.00011701362,0.0049155727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00038425726,0.000020933318,0.00006598545,0.00015214062,0.000048306105],"domain_scores_gemma":[0.999295,0.000503359,0.00007654848,0.00003711009,0.000067589426,0.000020363295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018015819,0.0012463032,0.00081384723,0.00042670037,0.00036746447,0.0012578677,0.0013703952,0.0014019923,0.0011593081],"category_scores_gemma":[0.0029326587,0.000596706,0.0007470894,0.00087594375,0.00088542135,0.0014771317,0.0013457637,0.0014944217,0.00027435238],"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.00001464351,0.000025163832,0.000082634004,0.000069996,0.000013224843,0.000040499217,0.0000355381,0.945924,0.00053624023,0.041538954,0.00045006128,0.0112689985],"study_design_scores_gemma":[0.0000037486632,0.000012142507,0.000012097798,0.0000060359935,0.0000028121153,0.0000063517637,0.0000059546455,0.9916644,0.000107281645,0.007675674,0.000500776,0.0000027160522],"about_ca_topic_score_codex":0.0020144207,"about_ca_topic_score_gemma":0.0022380105,"teacher_disagreement_score":0.0020144207,"about_ca_system_score_codex":0.0007397484,"about_ca_system_score_gemma":0.0010373074,"threshold_uncertainty_score":0.0095278025},"labels":[],"label_agreement":null},{"id":"W1999499117","doi":"10.1109/tcomm.2013.032713.120654","title":"On the Ergodic Capacity of Amplify-and-Forward Relay Channels with Interference in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Relay; Interference (communication); Computer science; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel capacity; Electronic engineering; Channel (broadcasting); Co-channel interference; Independent and identically distributed random variables; Single antenna interference cancellation; Telecommunications; Mathematics; Power (physics); Engineering; Physics; Electrical engineering; Random variable; Statistics","score_opus":0.06422410717492637,"score_gpt":0.2668053767185139,"score_spread":0.20258126954358752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999499117","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.19581167,0.007768041,0.7592248,0.0007875019,0.00012343946,0.00006384624,0.0005237501,0.0003532681,0.035343703],"genre_scores_gemma":[0.98008233,0.0047268714,0.011907329,0.0001043294,0.00017530133,0.000102307,0.00019706259,0.00008052039,0.0026240342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.00034814014,0.00003652623,0.00008619016,0.00025324314,0.00026531378],"domain_scores_gemma":[0.9920515,0.006165067,0.0004929862,0.0004073866,0.0007614867,0.000121466386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018423593,0.0011749275,0.00084567524,0.0016749263,0.00058361824,0.0013158132,0.00090168905,0.0006087906,0.0019017707],"category_scores_gemma":[0.009650674,0.00039343382,0.00052736554,0.0014875904,0.00249131,0.0019190054,0.0012917822,0.0010739712,0.00048958213],"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.00008010817,0.00003819351,0.0010518824,0.00022652453,0.00006245189,0.000375228,0.00030401268,0.76198995,0.0046359384,0.21607994,0.0016255635,0.013530179],"study_design_scores_gemma":[0.000004764209,0.00002544288,0.00059718254,0.00006781443,0.000031784344,0.00014039392,0.000063012456,0.9312498,0.0022137226,0.06455085,0.0010235528,0.000031692998],"about_ca_topic_score_codex":0.004500783,"about_ca_topic_score_gemma":0.0025087937,"teacher_disagreement_score":0.004500783,"about_ca_system_score_codex":0.0021822772,"about_ca_system_score_gemma":0.001142467,"threshold_uncertainty_score":0.015833616},"labels":[],"label_agreement":null},{"id":"W2000852639","doi":"10.1109/tcomm.2013.032013.120322","title":"Resource Allocation for Selective Relaying Based Cellular Wireless System with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of British Columbia","funders":"","keywords":"Computer science; Telecommunications link; Karush–Kuhn–Tucker conditions; Probabilistic logic; Resource allocation; Quality of service; Mathematical optimization; Power control; Transmitter power output; Optimization problem; Fading; Channel state information; Channel (broadcasting); Computer network; Wireless; Power (physics); Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.030046302312631026,"score_gpt":0.2506374002990045,"score_spread":0.22059109798637347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000852639","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.0843723,0.00037196645,0.9121572,0.00018951845,0.000026619433,0.000045258257,0.000046348847,0.00017857907,0.002612266],"genre_scores_gemma":[0.97989035,0.00015135079,0.019218381,0.000038106977,0.000018595712,0.000037844624,0.0000181594,0.0000065659065,0.0006207335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.00012176322,0.00002982889,0.00011047911,0.00014027189,0.00012268499],"domain_scores_gemma":[0.9993943,0.00031440597,0.00011655743,0.00006738947,0.00007831336,0.000029053837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045946005,0.0006085971,0.00063834974,0.00026631178,0.0005070756,0.0006593959,0.0008373357,0.00047869547,0.0005902],"category_scores_gemma":[0.0015520176,0.00022891533,0.000285917,0.00037494072,0.0006759752,0.0008085727,0.0007268071,0.00041492577,0.00018439401],"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.00010704573,0.00003745312,0.00070335565,0.00007167176,0.000041724477,0.00030243333,0.00013609747,0.93211716,0.013103921,0.018729236,0.00062522886,0.034024734],"study_design_scores_gemma":[0.000008139554,0.00003144112,0.00011290616,0.0000028138181,0.000011861234,0.000057199508,0.000018578889,0.99477,0.0013943992,0.003323756,0.00026183235,0.000007053486],"about_ca_topic_score_codex":0.0026110986,"about_ca_topic_score_gemma":0.0029245466,"teacher_disagreement_score":0.0026110986,"about_ca_system_score_codex":0.0006951284,"about_ca_system_score_gemma":0.00061165297,"threshold_uncertainty_score":0.005191803},"labels":[],"label_agreement":null},{"id":"W2001178040","doi":"10.1109/tcomm.2013.020413.120457","title":"Delay-Optimal Distributed Scheduling in Multi-User Multi-Relay Cellular Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"","keywords":"Computer science; Relay; Scheduling (production processes); Computer network; Time division multiple access; RSS; Base station; Telecommunications link; Wireless; Transmission (telecommunications); Markov process; Wireless network; Real-time computing; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.054840833267975446,"score_gpt":0.2892029471408835,"score_spread":0.23436211387290806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001178040","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.023549462,0.00063829025,0.9744213,0.00012472192,0.00007580958,0.000040463252,0.000029664647,0.00018664022,0.00093369064],"genre_scores_gemma":[0.9272062,0.00043923076,0.0711656,0.000072135714,0.00008513326,0.00007489791,0.00004870243,0.000022838127,0.00088525977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989737,0.00036386395,0.000044810247,0.00019760727,0.00025406692,0.00016608762],"domain_scores_gemma":[0.9988047,0.0006084493,0.00018065757,0.00013794652,0.00017254832,0.000095739124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013544306,0.00089799927,0.001338047,0.0003767005,0.0006198756,0.0007332458,0.0019366726,0.0008064808,0.000709425],"category_scores_gemma":[0.002705793,0.00042964856,0.00048783154,0.0007695815,0.00076358585,0.0009994416,0.0010800014,0.000734428,0.0001688336],"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.00009626645,0.00006569167,0.00029261678,0.000060855124,0.000027441276,0.00009179277,0.000055692333,0.9591861,0.0028215859,0.01137341,0.0005697763,0.025358813],"study_design_scores_gemma":[0.000008573177,0.000021749951,0.00002243446,0.0000011086239,0.0000031288266,0.000010547572,0.000003126366,0.9977233,0.00026393612,0.0017758312,0.00016376933,0.0000026296352],"about_ca_topic_score_codex":0.0029768266,"about_ca_topic_score_gemma":0.0028640549,"teacher_disagreement_score":0.0029768266,"about_ca_system_score_codex":0.0012285507,"about_ca_system_score_gemma":0.0011975494,"threshold_uncertainty_score":0.008913815},"labels":[],"label_agreement":null},{"id":"W2003480200","doi":"10.1109/tcomm.2014.2359875","title":"Limiting Properties of Overloaded Multiuser Wireless Systems With Throughput-Optimal Scheduling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Victoria","funders":"","keywords":"Maximum throughput scheduling; Scheduling (production processes); Computer science; Queue; Round-robin scheduling; Wireless; Throughput; Mathematical optimization; Proportionally fair; Distributed computing; Buffer overflow; Job shop scheduling; Fair-share scheduling; Dynamic priority scheduling; Computer network; Mathematics; Quality of service","score_opus":0.025701760114796916,"score_gpt":0.2210854360386223,"score_spread":0.19538367592382538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003480200","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.25221118,0.0033020976,0.706412,0.0022473426,0.00021941996,0.00018271663,0.0005152332,0.0010072693,0.033902816],"genre_scores_gemma":[0.98469883,0.0010917581,0.010189333,0.00024744085,0.000148358,0.00012541379,0.00011621943,0.00009812264,0.003284416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822694,0.00049999857,0.000083339364,0.00021547638,0.00047943817,0.0004948681],"domain_scores_gemma":[0.98541796,0.008390454,0.0025582337,0.0006642078,0.0021482192,0.0008208863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974635,0.0012644562,0.002065537,0.0021653562,0.0013880864,0.0033694827,0.0018967801,0.0014521165,0.0032926416],"category_scores_gemma":[0.024603818,0.0008793502,0.00075979833,0.0014905497,0.0032479372,0.0031913028,0.002380744,0.0017383395,0.0005242392],"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.00029870376,0.00014008832,0.0030697247,0.00040276945,0.0001066718,0.0012732503,0.0007634036,0.62574,0.009725477,0.3443469,0.0038448244,0.010288156],"study_design_scores_gemma":[0.00001978011,0.000027651493,0.00030742463,0.000032339405,0.000013044312,0.00014645114,0.000072848925,0.94472075,0.0005408378,0.053716946,0.000377465,0.000024508896],"about_ca_topic_score_codex":0.0062601496,"about_ca_topic_score_gemma":0.0019550556,"teacher_disagreement_score":0.0062601496,"about_ca_system_score_codex":0.0028086316,"about_ca_system_score_gemma":0.0017779557,"threshold_uncertainty_score":0.020378113},"labels":[],"label_agreement":null},{"id":"W2007380483","doi":"10.1109/tcomm.2012.072612.110143","title":"On Raptor Code Design for Inactivation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of Alberta","funders":"","keywords":"Decoding methods; Raptor code; Degree (music); Computer science; Fountain code; Set (abstract data type); Code (set theory); Block (permutation group theory); Block code; Degree distribution; Algorithm; Theoretical computer science; Mathematics; Linear code; Combinatorics; Physics","score_opus":0.12737220143933028,"score_gpt":0.3467728440012235,"score_spread":0.2194006425618932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007380483","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.009615537,0.00018780364,0.98658943,0.00010599437,0.000020643974,0.00002707261,0.000026780435,0.00014226678,0.0032843638],"genre_scores_gemma":[0.5791531,0.0009901287,0.41376728,0.0003568894,0.00014583736,0.00025189118,0.00012280446,0.00012717009,0.005084907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998966,0.000417176,0.000040071987,0.000112349306,0.00038522726,0.00007929556],"domain_scores_gemma":[0.99785954,0.0011398634,0.0002100964,0.00029940737,0.00044453237,0.000046598652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200556,0.000665291,0.0004060419,0.0006063972,0.0003319919,0.00070521235,0.0005961813,0.00082998455,0.0011885943],"category_scores_gemma":[0.004522973,0.00023268882,0.000269436,0.00062668405,0.0008943924,0.0010325664,0.00070179114,0.0009825212,0.00070481864],"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.00016686815,0.00004416488,0.00060175033,0.00018337819,0.000028277114,0.0001889058,0.00028557103,0.3881339,0.049532894,0.46374893,0.002476027,0.09460925],"study_design_scores_gemma":[0.000017188822,0.00013851965,0.00013263068,0.00003109046,0.000010899258,0.00029432506,0.000014954829,0.9147902,0.023105241,0.0571403,0.0042969454,0.000027695185],"about_ca_topic_score_codex":0.00049878994,"about_ca_topic_score_gemma":0.0005505313,"teacher_disagreement_score":0.0011885943,"about_ca_system_score_codex":0.00067448965,"about_ca_system_score_gemma":0.000755501,"threshold_uncertainty_score":0.0053946376},"labels":[],"label_agreement":null},{"id":"W2008359784","doi":"10.1109/tcomm.2014.2378257","title":"On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Algorithm; Block code; Queue; Hamming distance; Binary number; Mathematics; Fading; Sequential decoding; Hamming code; Computer science; Theoretical computer science; Computer network; Arithmetic","score_opus":0.049836312430617154,"score_gpt":0.2807018596210243,"score_spread":0.23086554719040714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008359784","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.13578834,0.0014487762,0.8459391,0.0014290279,0.00009189326,0.000056188917,0.00026689481,0.00011202361,0.014867732],"genre_scores_gemma":[0.93104845,0.0017213844,0.061866775,0.00031620625,0.00021668464,0.00011034583,0.0002575138,0.00011448092,0.0043481593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810165,0.0007803307,0.00008841129,0.00027552655,0.0004481498,0.00030585655],"domain_scores_gemma":[0.9815106,0.01608892,0.0009712191,0.0005438544,0.000656631,0.000228703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702842,0.000947848,0.0011458697,0.0011583787,0.0006268029,0.0022223885,0.0015455827,0.0016492859,0.0025406785],"category_scores_gemma":[0.024212465,0.00054413493,0.00055794895,0.0013275532,0.00400814,0.0050099846,0.0023496186,0.0018140768,0.00032631663],"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.00022163078,0.00006550712,0.00072648656,0.00014519869,0.000031148436,0.00011616415,0.00023585398,0.28073224,0.0020189693,0.7027032,0.0008312022,0.012172367],"study_design_scores_gemma":[0.000039598144,0.00006277397,0.00022754433,0.000035266574,0.00001184381,0.000058122354,0.000041793515,0.6875391,0.0012696355,0.3102478,0.00043908446,0.000027462676],"about_ca_topic_score_codex":0.0023499173,"about_ca_topic_score_gemma":0.0015973108,"teacher_disagreement_score":0.003702842,"about_ca_system_score_codex":0.0023206065,"about_ca_system_score_gemma":0.0017426743,"threshold_uncertainty_score":0.019582748},"labels":[],"label_agreement":null},{"id":"W2010692329","doi":"10.1109/tcomm.2013.021413.110555","title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 British Columbia","funders":"","keywords":"Linear network coding; Price of anarchy; Nash equilibrium; Computer science; Game theory; Bottleneck; Network packet; Computer network; Pairwise comparison; Non-cooperative game; Mathematical optimization; Packet forwarding; Price of stability; Mathematical economics; Mathematics","score_opus":0.04708077613640651,"score_gpt":0.2783337920222419,"score_spread":0.23125301588583538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010692329","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.16009712,0.00027254695,0.8243471,0.0007581041,0.000037008685,0.00011099593,0.0000640428,0.000059524024,0.014253589],"genre_scores_gemma":[0.969438,0.00030141635,0.026048949,0.00012775959,0.00003096976,0.000108260974,0.000024696028,0.00002353549,0.003896431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904007,0.00042657397,0.00002025013,0.000099876925,0.00021014766,0.00020297065],"domain_scores_gemma":[0.99728084,0.0018277359,0.00033042993,0.00014707597,0.00026278428,0.00015119488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517979,0.0008807405,0.0006663291,0.0007446031,0.00067424326,0.0013642379,0.0015937566,0.0015014282,0.0021714226],"category_scores_gemma":[0.005333599,0.00046198576,0.0006760107,0.00079273817,0.0027583004,0.002933685,0.0012708743,0.0012682225,0.0001848258],"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.000071709546,0.000046458437,0.000583939,0.00003811717,0.000031112286,0.00021849858,0.00018610829,0.6739921,0.0028846178,0.31559062,0.00072450185,0.0056322007],"study_design_scores_gemma":[0.000007873099,0.000027228443,0.00009338563,0.0000059301433,0.000006989776,0.000047274243,0.000037816433,0.9472572,0.0002764008,0.051902957,0.00032817177,0.000008778588],"about_ca_topic_score_codex":0.0051989923,"about_ca_topic_score_gemma":0.0030781152,"teacher_disagreement_score":0.0051989923,"about_ca_system_score_codex":0.0023072448,"about_ca_system_score_gemma":0.0013539934,"threshold_uncertainty_score":0.016740382},"labels":[],"label_agreement":null},{"id":"W2011095555","doi":"10.1109/tcomm.2011.071111.100351","title":"On the Performance of an Automatic Frequency Control Loop in Dissimilar Fading Channels in the Presence of Interference","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Nakagami distribution; Rayleigh fading; Fading distribution; Interference (communication); Electronic engineering; Control theory (sociology); Computer science; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Control (management)","score_opus":0.04454456056660241,"score_gpt":0.2713567143844337,"score_spread":0.2268121538178313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011095555","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.88292307,0.0008160132,0.10947873,0.00015948014,0.000052569307,0.00003347403,0.000053333944,0.00021173817,0.0062716147],"genre_scores_gemma":[0.997175,0.00010836655,0.0025282013,0.000009928718,0.000014217445,0.000004948805,0.000011940556,0.000008690826,0.00013862234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998747,0.00041909312,0.000051262443,0.00013594139,0.00041298597,0.00023358378],"domain_scores_gemma":[0.98162985,0.015929716,0.00091268704,0.00041201356,0.0009660064,0.00014979603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016578346,0.0007578438,0.00064726314,0.0006602999,0.00055893575,0.00065589545,0.00043785543,0.000830625,0.0006600108],"category_scores_gemma":[0.014781643,0.00017070684,0.0002672246,0.00076748914,0.0010380098,0.0007667435,0.0006716176,0.00059138867,0.000102902144],"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.001029209,0.000072602255,0.0048686056,0.00015010247,0.00007034799,0.0003337658,0.0001598567,0.9392117,0.019373493,0.0032138943,0.0001905568,0.03132578],"study_design_scores_gemma":[0.000015346404,0.0004273215,0.0030002207,0.000013394311,0.000042728218,0.00018749546,0.000045288092,0.9876673,0.007628207,0.0008436946,0.00010376686,0.000025234809],"about_ca_topic_score_codex":0.0030791613,"about_ca_topic_score_gemma":0.0018151955,"teacher_disagreement_score":0.0030791613,"about_ca_system_score_codex":0.0007797367,"about_ca_system_score_gemma":0.0003992578,"threshold_uncertainty_score":0.008767545},"labels":[],"label_agreement":null},{"id":"W2012158206","doi":"10.1109/tcomm.2011.122111.100197a","title":"Adaptive Power Loading for Multi-Relay OFDM Regenerative Networks with Relay Selection","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 British Columbia","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Bit error rate; Computer science; Selection (genetic algorithm); Relay channel; Electronic engineering; Power (physics); Multiplexing; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.12782066954455967,"score_gpt":0.30019273838400484,"score_spread":0.17237206883944517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012158206","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.039575513,0.00029657214,0.9583767,0.000082565864,0.000023887018,0.000036017314,0.000009268529,0.0001913605,0.0014080649],"genre_scores_gemma":[0.84811294,0.00020152504,0.1500967,0.000071348615,0.00003388133,0.000076614095,0.000020843743,0.000026804331,0.001359304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00014292654,0.000018949364,0.00006413919,0.0001005795,0.00003744211],"domain_scores_gemma":[0.9993395,0.00038053686,0.00010723463,0.000073867835,0.000073850584,0.000024968833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047972184,0.00047012346,0.00047903004,0.00025707457,0.00041377105,0.0003619258,0.0011142716,0.00040400287,0.0008553858],"category_scores_gemma":[0.0014417829,0.0002070278,0.00019190574,0.0002590288,0.00052361446,0.00091068837,0.00057234877,0.00042669466,0.00027611735],"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.00037084156,0.00012381791,0.00086010294,0.00012697944,0.000045108955,0.00029362197,0.00021788036,0.7281922,0.03577719,0.022556769,0.0008033144,0.21063218],"study_design_scores_gemma":[0.000019909667,0.000080000085,0.00012672582,0.0000060887246,0.000009856272,0.000098136574,0.000019344521,0.9888026,0.0053162775,0.004844007,0.0006655913,0.000011349088],"about_ca_topic_score_codex":0.00051684346,"about_ca_topic_score_gemma":0.0009796466,"teacher_disagreement_score":0.0011142716,"about_ca_system_score_codex":0.00036900153,"about_ca_system_score_gemma":0.00029154567,"threshold_uncertainty_score":0.0028615594},"labels":[],"label_agreement":null},{"id":"W2012217633","doi":"10.1109/tcomm.2015.2389255","title":"Distance Statistics of the Communication Best Neighbor in a Poisson Field of Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Western University","funders":"","keywords":"Fading; Poisson distribution; Node (physics); Path loss; Attenuation; Statistics; Mathematics; k-nearest neighbors algorithm; Topology (electrical circuits); Computer science; Algorithm; Wireless; Telecommunications; Physics; Combinatorics; Artificial intelligence; Decoding methods","score_opus":0.029770531393956044,"score_gpt":0.2820368421103502,"score_spread":0.25226631071639416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012217633","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.52404696,0.0018791474,0.4654254,0.00046668138,0.000066859604,0.000106808126,0.00036872743,0.0001706099,0.007468839],"genre_scores_gemma":[0.9830245,0.00052428956,0.014520276,0.000051140454,0.000041349922,0.00006883433,0.00022181883,0.000022257904,0.0015255305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913615,0.00021097898,0.00005457324,0.00017428215,0.00029703163,0.00012699167],"domain_scores_gemma":[0.9917835,0.005010344,0.0013322436,0.0003448418,0.0012953632,0.00023377578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021424529,0.0003190226,0.00068530877,0.0012345386,0.00047765305,0.0008626374,0.0010775339,0.0005287724,0.00083878427],"category_scores_gemma":[0.010662848,0.0003036133,0.00028086387,0.0011388025,0.00089191674,0.0016577202,0.0010003314,0.00041226763,0.00027650408],"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.00022699924,0.000052458723,0.015316008,0.00015231522,0.000044750068,0.00039316007,0.0003041905,0.9034318,0.004690693,0.057816863,0.0012478251,0.01632288],"study_design_scores_gemma":[0.000013668334,0.00009245191,0.003464141,0.00001326052,0.000018574738,0.0003283455,0.00022124633,0.9784007,0.0020663424,0.01464599,0.0006957355,0.000039471808],"about_ca_topic_score_codex":0.0020727885,"about_ca_topic_score_gemma":0.0015574248,"teacher_disagreement_score":0.0021424529,"about_ca_system_score_codex":0.00083036744,"about_ca_system_score_gemma":0.00061640143,"threshold_uncertainty_score":0.011330545},"labels":[],"label_agreement":null},{"id":"W2014285456","doi":"10.1109/tcomm.2011.012012.100426","title":"Aggregate Interference Modeling in Cognitive Radio Networks with Power and Contention Control","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":95,"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":"Engineering and Physical Sciences Research Council","keywords":"Interference (communication); Power control; Cognitive radio; Node (physics); Computer science; Transmission (telecommunications); Computer network; Power (physics); Carrier sense multiple access with collision avoidance; Co-channel interference; Topology (electrical circuits); Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Wireless; Throughput; Electrical engineering; Physics","score_opus":0.03783821846480506,"score_gpt":0.2614185490077743,"score_spread":0.22358033054296922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014285456","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.03080544,0.0008145428,0.96111214,0.00021384009,0.000069241214,0.000031893254,0.00006116877,0.00017228641,0.0067193443],"genre_scores_gemma":[0.95161945,0.0013136736,0.041337516,0.0001744696,0.0001493468,0.00015229895,0.000077431716,0.000066168985,0.005109609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992386,0.00019787015,0.000026326763,0.00010387542,0.0002963007,0.0001371408],"domain_scores_gemma":[0.99902165,0.0005829975,0.00013843899,0.00008459653,0.00013762376,0.00003468809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701693,0.0010747858,0.0008244452,0.0007017159,0.00043019155,0.0012892927,0.0018678424,0.0011750428,0.0008147924],"category_scores_gemma":[0.0027141569,0.0003917595,0.0008015601,0.0009354678,0.0011049638,0.0017266965,0.0009234767,0.001105624,0.00026071013],"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.000020884516,0.000020418245,0.0002814907,0.00002006547,0.000015912941,0.00007574933,0.00006413416,0.96710426,0.00073287473,0.027464569,0.00022729993,0.003972363],"study_design_scores_gemma":[0.0000021004466,0.000007573728,0.000048251422,0.000001680907,0.0000034924194,0.000011178641,0.000005942001,0.9956131,0.00006696173,0.0040808707,0.00015595877,0.0000028382747],"about_ca_topic_score_codex":0.007224811,"about_ca_topic_score_gemma":0.0029189887,"teacher_disagreement_score":0.007224811,"about_ca_system_score_codex":0.0009597354,"about_ca_system_score_gemma":0.00068029657,"threshold_uncertainty_score":0.014365494},"labels":[],"label_agreement":null},{"id":"W2016530058","doi":"10.1109/tcomm.2003.816972","title":"Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Computer science; Bandwidth (computing); Markov process; Admission control; Buffer overflow; Statistical time division multiplexing; Partition (number theory); Multiplexing; Markov chain; Packet loss; Queueing theory; Computer network; Bandwidth allocation; Buffer (optical fiber); Call Admission Control; Network packet; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.0076939997439488565,"score_gpt":0.23032366538541754,"score_spread":0.2226296656414687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016530058","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.22479002,0.0009643847,0.7708985,0.00035529214,0.000053959116,0.00003478693,0.000021547132,0.00009470264,0.002786787],"genre_scores_gemma":[0.98927003,0.00018574638,0.010039309,0.00002038639,0.000026893795,0.000025257494,0.000008833315,0.000008719588,0.00041483346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992374,0.0002570497,0.000024485913,0.00008246935,0.0002339275,0.00016455904],"domain_scores_gemma":[0.9981863,0.0012826666,0.00022587186,0.00008032216,0.00015133257,0.000073493895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952301,0.0006014773,0.0005687339,0.0006880908,0.00037503117,0.0012064741,0.0011465542,0.0006016676,0.000517447],"category_scores_gemma":[0.0057987096,0.00037841345,0.00030638793,0.0005090315,0.00093769655,0.0016409961,0.0008719737,0.0006460755,0.00006359668],"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.00017017743,0.00003846001,0.00071012776,0.00004459916,0.000029053019,0.00009026238,0.0001000559,0.91398,0.0074920007,0.06090367,0.00016147857,0.01628015],"study_design_scores_gemma":[0.0000043058603,0.000010651782,0.00007369824,0.0000025642778,0.000004629693,0.000011119186,0.0000072394514,0.99343187,0.0006471168,0.005745524,0.000057831632,0.000003429855],"about_ca_topic_score_codex":0.0028563957,"about_ca_topic_score_gemma":0.0010993456,"teacher_disagreement_score":0.0028563957,"about_ca_system_score_codex":0.0013630462,"about_ca_system_score_gemma":0.00095258915,"threshold_uncertainty_score":0.009889603},"labels":[],"label_agreement":null},{"id":"W2018334863","doi":"10.1109/tcomm.2014.2359885","title":"Coexistence Analysis of H2H and M2M Traffic in FiWi Smart Grid Communications Infrastructures Based on Multi-Tier Business Models","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Computer science; Ethernet; Quality of service; Bottleneck; Wireless; Real-time computing; Telecommunications; Embedded system","score_opus":0.035831972914116196,"score_gpt":0.2658957280288074,"score_spread":0.2300637551146912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018334863","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.8350173,0.0005163514,0.15826462,0.0003110286,0.000021044714,0.00006116992,0.00010955387,0.00018340576,0.0055155274],"genre_scores_gemma":[0.9954868,0.000098577846,0.003839398,0.000024722543,0.0000071524264,0.000016206994,0.00002909485,0.000015167108,0.00048300662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827814,0.000569996,0.000046961166,0.00023500387,0.00031274007,0.00055713044],"domain_scores_gemma":[0.9952276,0.0029153288,0.00071057526,0.00028331173,0.0006006026,0.00026266775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020181562,0.0010263206,0.000805281,0.0010489044,0.00075471523,0.0017973405,0.0012182896,0.0013660243,0.0009385434],"category_scores_gemma":[0.0062733884,0.00045751367,0.00076758966,0.0007547426,0.0015666403,0.0023339544,0.0012435385,0.00084713055,0.00016075598],"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.00017537255,0.000137825,0.004951563,0.00003498825,0.00004588849,0.00017588558,0.000121879675,0.9560501,0.006159424,0.028607497,0.00025180395,0.0032878262],"study_design_scores_gemma":[0.000001669251,0.000018050001,0.00032394385,0.0000014426394,0.0000054901802,0.000016452592,0.0000270998,0.9975725,0.0004406014,0.0015463077,0.000041937983,0.0000045249453],"about_ca_topic_score_codex":0.009805658,"about_ca_topic_score_gemma":0.0042090816,"teacher_disagreement_score":0.009805658,"about_ca_system_score_codex":0.0025599306,"about_ca_system_score_gemma":0.0009649561,"threshold_uncertainty_score":0.019497156},"labels":[],"label_agreement":null},{"id":"W2019099392","doi":"10.1109/tcomm.2006.869806","title":"M-ary NCFSK with S+N selection combining in Rician fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Rician fading; Fading; Fading distribution; Multipath propagation; Algorithm; Diversity combining; Independent and identically distributed random variables; Mathematics; Phase-shift keying; Signal-to-noise ratio (imaging); Bit error rate; Electronic engineering; Telecommunications; Statistics; Computer science; Rayleigh fading; Engineering; Random variable; Decoding methods; Estimator","score_opus":0.013685941574819747,"score_gpt":0.24205160887983726,"score_spread":0.2283656673050175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019099392","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.6856795,0.0013255562,0.298428,0.00023173227,0.00005608186,0.00010064666,0.000096875345,0.00051505613,0.013566506],"genre_scores_gemma":[0.96898156,0.00030375668,0.029436097,0.000036767407,0.000026327176,0.000027809001,0.000041332914,0.000005997577,0.0011402995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987753,0.00033642375,0.000085228436,0.00010081745,0.0005081647,0.00019404758],"domain_scores_gemma":[0.99783427,0.00097224745,0.00049056363,0.00020081799,0.0004443774,0.000057665777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456694,0.00080043584,0.00090377696,0.0006703802,0.00067536446,0.0006933114,0.00056478963,0.00076828233,0.00072937127],"category_scores_gemma":[0.0028166277,0.00022437956,0.00040903,0.001361061,0.0010165224,0.0009336433,0.0006845157,0.00027661535,0.00031847102],"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.0022215184,0.00014822281,0.009338676,0.00038784635,0.00029032837,0.0006767673,0.00045308383,0.75785506,0.06285047,0.015213176,0.0008660148,0.14969887],"study_design_scores_gemma":[0.00012641758,0.000837839,0.0025508516,0.000034840643,0.00012895829,0.0007636217,0.00008482541,0.95152485,0.037944898,0.0043841447,0.0015482146,0.00007057239],"about_ca_topic_score_codex":0.0042282655,"about_ca_topic_score_gemma":0.005259537,"teacher_disagreement_score":0.0042282655,"about_ca_system_score_codex":0.00092108425,"about_ca_system_score_gemma":0.00093010644,"threshold_uncertainty_score":0.008407295},"labels":[],"label_agreement":null},{"id":"W2019936054","doi":"10.1109/tcomm.2012.12.100562","title":"Gaussian Multiple Description Coding with Low-Density Generator Matrix Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Generator matrix; Gaussian; Coding (social sciences); Algorithm; Quadratic equation; Quantization (signal processing); Mathematics; Computer science; Discrete mathematics; Topology (electrical circuits); Combinatorics; Decoding methods; Physics","score_opus":0.02837938316599134,"score_gpt":0.2673096130151183,"score_spread":0.23893022984912696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019936054","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.021996006,0.00026943893,0.97147363,0.00031034186,0.000040873554,0.00008825194,0.00012284113,0.0002488253,0.0054496806],"genre_scores_gemma":[0.70769554,0.00039566602,0.28595597,0.00023060667,0.000077445744,0.00023512426,0.0003807377,0.000058636226,0.004970271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.00041205637,0.000056138593,0.00010741212,0.0004951795,0.00019261082],"domain_scores_gemma":[0.9977841,0.0011729425,0.00017496679,0.00041905235,0.0003792996,0.00006967627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016484492,0.0006536209,0.0006842822,0.00071039173,0.00058386417,0.0012228878,0.0014678185,0.0009590078,0.002211883],"category_scores_gemma":[0.004473289,0.0003000048,0.00057938334,0.0012244385,0.0010929358,0.0017523525,0.0021000837,0.0012658958,0.00060740754],"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.0003986601,0.00006571179,0.0006501263,0.00016092676,0.000038238333,0.0006012479,0.00022684854,0.39630482,0.010642129,0.51025385,0.0035140973,0.0771435],"study_design_scores_gemma":[0.000044921468,0.00004797446,0.0000705744,0.000017919072,0.000009231199,0.00012251725,0.000022895641,0.9248406,0.0036826453,0.0696268,0.0014865978,0.000027238299],"about_ca_topic_score_codex":0.0034299335,"about_ca_topic_score_gemma":0.0031870035,"teacher_disagreement_score":0.0034299335,"about_ca_system_score_codex":0.0011738329,"about_ca_system_score_gemma":0.0014160702,"threshold_uncertainty_score":0.008717954},"labels":[],"label_agreement":null},{"id":"W2020661221","doi":"10.1109/tcomm.2013.021513.100278","title":"Energy-Aware Power Allocation in Cooperative Communication Systems with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of British Columbia","funders":"","keywords":"Transmitter power output; Computer science; Relay; Power budget; Channel state information; Quality of service; Computer network; Communications system; Power (physics); Transmission (telecommunications); Signal-to-noise ratio (imaging); Efficient energy use; Energy (signal processing); Wireless; Imperfect; Electronic engineering; Channel (broadcasting); Telecommunications; Power control; Engineering; Electrical engineering; Transmitter; Mathematics","score_opus":0.025986993013217587,"score_gpt":0.2581110792061994,"score_spread":0.23212408619298183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661221","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.060636196,0.0005693959,0.9355181,0.00016589055,0.000016296446,0.00002587351,0.000020542762,0.00012472259,0.0029229652],"genre_scores_gemma":[0.9778024,0.00021719221,0.021158012,0.0000347257,0.000015278545,0.000026562277,0.000010497036,0.000009148023,0.00072611135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00025050103,0.000034049248,0.00010411173,0.00017636281,0.000081294376],"domain_scores_gemma":[0.9988689,0.00070791465,0.00016244207,0.000100564546,0.000135511,0.000024729936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548068,0.00061361893,0.00066875113,0.00036205535,0.00042466697,0.0007331001,0.0008055039,0.0005789999,0.00042933697],"category_scores_gemma":[0.002607418,0.0003469146,0.0002391178,0.00061036483,0.0009833013,0.0012561177,0.0009506321,0.0004416224,0.00015089223],"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.00008886802,0.000035242112,0.00038593562,0.000063960724,0.000024210027,0.00012329739,0.00018425702,0.94023454,0.0074821706,0.01533249,0.00040106164,0.035644017],"study_design_scores_gemma":[0.000013275218,0.00005700615,0.00013228603,0.0000071630006,0.000011950643,0.000060871633,0.000043104512,0.9855833,0.0020158645,0.011658782,0.00040498003,0.000011357214],"about_ca_topic_score_codex":0.0012244169,"about_ca_topic_score_gemma":0.0016462206,"teacher_disagreement_score":0.0012244169,"about_ca_system_score_codex":0.0005592968,"about_ca_system_score_gemma":0.00057349115,"threshold_uncertainty_score":0.0050495863},"labels":[],"label_agreement":null},{"id":"W2021672277","doi":"10.1109/tcomm.2013.032013.120601","title":"Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"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":"Relay; Rayleigh fading; Topology (electrical circuits); Mathematics; Gaussian; Asymptotic analysis; Channel (broadcasting); Bounded function; Signal-to-noise ratio (imaging); Fading; Relay channel; Node (physics); Decoding methods; Computer science; Algorithm; Telecommunications; Power (physics); Statistics; Combinatorics; Engineering; Mathematical analysis","score_opus":0.08890690206518086,"score_gpt":0.3245589423044543,"score_spread":0.23565204023927344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021672277","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.12328362,0.0025679541,0.8530991,0.0008082307,0.00009004971,0.00014021536,0.0003052531,0.00025713348,0.019448342],"genre_scores_gemma":[0.966329,0.001463682,0.02838464,0.00016297525,0.00008351195,0.000079384554,0.00012070808,0.000046008096,0.0033301434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00027935614,0.000020838563,0.00007798302,0.0002130095,0.0002102245],"domain_scores_gemma":[0.99736065,0.0015421397,0.00028118902,0.00020102362,0.0005269087,0.00008800718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016747781,0.0014116452,0.00090409606,0.00084232807,0.00059683714,0.001269919,0.0010966444,0.0013121589,0.0034065652],"category_scores_gemma":[0.0053796694,0.00036699188,0.0006418848,0.00096590084,0.0020037193,0.0014122591,0.0012554354,0.00090012583,0.00040229745],"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.00011605629,0.000025108175,0.0004966033,0.00013352711,0.000037864913,0.00026038164,0.00017678119,0.8822433,0.004044791,0.09606541,0.0012924914,0.015107743],"study_design_scores_gemma":[0.000008113917,0.00004457542,0.00015135095,0.000016856045,0.000012394141,0.00009886349,0.000045239267,0.98613316,0.00039670404,0.012672188,0.00040279294,0.000017758595],"about_ca_topic_score_codex":0.009905019,"about_ca_topic_score_gemma":0.006629211,"teacher_disagreement_score":0.009905019,"about_ca_system_score_codex":0.0019511544,"about_ca_system_score_gemma":0.0013985038,"threshold_uncertainty_score":0.019694686},"labels":[],"label_agreement":null},{"id":"W2021991420","doi":"10.1109/tcomm.2015.2397885","title":"Distributed Uplink Power Control for Multi-Cell Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Power control; Telecommunications link; Cognitive radio; Transmitter power output; Computer science; Interference (communication); Constraint (computer-aided design); Signal-to-noise ratio (imaging); Power (physics); Computer network; Channel (broadcasting); Real-time computing; Algorithm; Transmitter; Telecommunications; Mathematics; Wireless","score_opus":0.05111441690243437,"score_gpt":0.2907075591421324,"score_spread":0.23959314223969805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021991420","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.005410579,0.00024288593,0.9928525,0.00005631931,0.00004264275,0.00001622813,0.000006418475,0.00010315576,0.001269174],"genre_scores_gemma":[0.9022897,0.00035394283,0.09514444,0.00011203021,0.00009106689,0.00010910126,0.00002626343,0.000029336326,0.0018441284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995185,0.00011004278,0.000019282019,0.000112749,0.00018253681,0.000056836674],"domain_scores_gemma":[0.9995567,0.00021248638,0.000057383062,0.000044616812,0.0001077707,0.000020956759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202916,0.0006800169,0.00056707894,0.00023718031,0.00039527589,0.0007139525,0.001238102,0.0005813703,0.00077272113],"category_scores_gemma":[0.0018080308,0.0001853579,0.00028831602,0.0003551661,0.00056020834,0.00054204726,0.00070229825,0.0008680381,0.00018157488],"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.000057293822,0.00007224538,0.00032468745,0.00005985777,0.000026331756,0.000078554694,0.000058406968,0.890364,0.0041997707,0.0114983,0.0009610855,0.09229943],"study_design_scores_gemma":[0.0000066731563,0.000022176815,0.00003379684,0.0000017994246,0.0000031014984,0.000011506222,0.0000031495315,0.99755496,0.00041016925,0.0016772955,0.00027314798,0.000002236974],"about_ca_topic_score_codex":0.0021371963,"about_ca_topic_score_gemma":0.0021320353,"teacher_disagreement_score":0.0021371963,"about_ca_system_score_codex":0.00062663143,"about_ca_system_score_gemma":0.00056695513,"threshold_uncertainty_score":0.0045465827},"labels":[],"label_agreement":null},{"id":"W2022582029","doi":"10.1109/tcomm.2005.861683","title":"A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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","funders":"","keywords":"Trellis (graph); Algorithm; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Space–time trellis code; Transmission (telecommunications); Channel (broadcasting); Binary number; Trellis modulation; Set (abstract data type); Viterbi decoder; Decoding methods; Mathematics; Fading; Sequential decoding; Error floor; Telecommunications; Block code","score_opus":0.028492406471890722,"score_gpt":0.29817121432877536,"score_spread":0.26967880785688464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022582029","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.0038546773,0.0002675287,0.99460196,0.00008184743,0.00004076026,0.00004687505,0.000035038756,0.00049072196,0.00058057223],"genre_scores_gemma":[0.094846725,0.0003416338,0.90090466,0.00011450182,0.00008319982,0.00022041818,0.00022861513,0.00015758889,0.0031025899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988494,0.00027271066,0.00008587508,0.00017864464,0.00051134906,0.00010203814],"domain_scores_gemma":[0.9982237,0.0006948871,0.00021877898,0.0002803659,0.00053752714,0.00004469401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840946,0.0008008895,0.0009099413,0.0009302877,0.0006285539,0.0010120445,0.0014550409,0.0010845694,0.002598601],"category_scores_gemma":[0.003839548,0.00051494926,0.0006466068,0.00083837874,0.00081808673,0.0013543378,0.0008294387,0.0014651477,0.0014917388],"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.00067016535,0.00010170098,0.00041552266,0.0002464263,0.000124931,0.00021982208,0.00028437134,0.25698623,0.13037229,0.052767616,0.006417055,0.55139375],"study_design_scores_gemma":[0.000094573305,0.000209748,0.00025223635,0.000030907722,0.000038184546,0.00037020518,0.000021763997,0.91779244,0.065190546,0.008643806,0.007261477,0.00009415942],"about_ca_topic_score_codex":0.0019802237,"about_ca_topic_score_gemma":0.0022928677,"teacher_disagreement_score":0.002598601,"about_ca_system_score_codex":0.00091570057,"about_ca_system_score_gemma":0.0013722798,"threshold_uncertainty_score":0.008693218},"labels":[],"label_agreement":null},{"id":"W2022963826","doi":"10.1109/tcomm.2006.877945","title":"Length-constrained MAP decoding of variable-length encoded Markov sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Markov chain; Directed acyclic graph; Mathematics; Parameterized complexity; Algorithm; Directed graph; Markov process; Path (computing); Sequential decoding; Sequence (biology); Binary number; Markov model; Mathematical optimization; Computer science; Maximum likelihood; Block code","score_opus":0.020305138290164695,"score_gpt":0.2612639241017747,"score_spread":0.24095878581160998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022963826","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.064100295,0.0001940763,0.9333312,0.00023262876,0.000018062792,0.00003529242,0.00012767687,0.00025307832,0.001707659],"genre_scores_gemma":[0.78225124,0.0004755281,0.21144876,0.0000945876,0.00005157033,0.0001340125,0.00044827373,0.00016257523,0.0049334336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993622,0.00026848883,0.00002506507,0.000111669586,0.00014677654,0.00008584104],"domain_scores_gemma":[0.99707603,0.0023926205,0.00019780001,0.00014466693,0.0001452067,0.00004360216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009090945,0.00055466045,0.0008539537,0.0003854638,0.00033974118,0.00078608416,0.0007524162,0.0010541541,0.001668934],"category_scores_gemma":[0.0061999084,0.00039691615,0.00041790956,0.00080693513,0.00084064784,0.0018091808,0.00093056966,0.0008414797,0.00040411996],"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.00025629104,0.000029480763,0.00034416106,0.000100750534,0.000025065305,0.00011985938,0.000091220914,0.9137051,0.004854076,0.04294977,0.0005287796,0.036995385],"study_design_scores_gemma":[0.00001457926,0.00002362071,0.00005893793,0.000006739315,0.000004285853,0.000026773227,0.000014278073,0.97656167,0.003252355,0.01976233,0.00026732826,0.0000070611386],"about_ca_topic_score_codex":0.0026205909,"about_ca_topic_score_gemma":0.0017824806,"teacher_disagreement_score":0.0026205909,"about_ca_system_score_codex":0.0008553124,"about_ca_system_score_gemma":0.0015594978,"threshold_uncertainty_score":0.0062057376},"labels":[],"label_agreement":null},{"id":"W2023544465","doi":"10.1109/tcomm.2011.091911.100189","title":"Binary Soliton-Like Rateless Coding for the Y-Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"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":"Fountain code; Computer science; Luby transform code; Linear network coding; Decoding methods; Binary erasure channel; Computer network; Binary number; Variable-length code; Coding (social sciences); Theoretical computer science; Algorithm; Block code; Linear code; Channel (broadcasting); Channel capacity; Mathematics; Network packet","score_opus":0.14080348725088326,"score_gpt":0.31156643319474675,"score_spread":0.1707629459438635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023544465","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.051373053,0.0005616783,0.94285136,0.00035580082,0.00004266486,0.000048587535,0.000039543684,0.00021851291,0.004508768],"genre_scores_gemma":[0.85983765,0.0007114296,0.13567148,0.00015902474,0.00003309406,0.000120941244,0.000059121416,0.000033005024,0.0033742536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978966,0.000081114886,0.000007855176,0.000019913161,0.00007087264,0.000030576302],"domain_scores_gemma":[0.9989901,0.00048461492,0.00020456639,0.00014421072,0.00015142426,0.000024921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071250065,0.00026783216,0.0002577345,0.00034713873,0.00038975227,0.00060969096,0.00046642168,0.00043733485,0.00086554466],"category_scores_gemma":[0.0021643776,0.00010370409,0.00019652602,0.00044148098,0.00074777106,0.0009868112,0.0005812143,0.0005835042,0.00021057665],"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.0003830639,0.00007575268,0.0006942182,0.00024622172,0.000040768424,0.00026842474,0.0002833727,0.335774,0.060465116,0.49455342,0.002389452,0.10482621],"study_design_scores_gemma":[0.000023377977,0.00011878488,0.00017713384,0.000028442817,0.000012260971,0.00014149102,0.000033686865,0.93865126,0.017075004,0.04002688,0.003688317,0.000023373475],"about_ca_topic_score_codex":0.0016181621,"about_ca_topic_score_gemma":0.0014085331,"teacher_disagreement_score":0.0016181621,"about_ca_system_score_codex":0.00073499966,"about_ca_system_score_gemma":0.0008539578,"threshold_uncertainty_score":0.0053328276},"labels":[],"label_agreement":null},{"id":"W2023580604","doi":"10.1109/tcomm.2012.042712.110410","title":"Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"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; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Relay; Rayleigh fading; Computer science; Cognitive radio; Spectral efficiency; Interference (communication); Signal-to-noise ratio (imaging); Electronic engineering; Wireless; Telecommunications; Power (physics); Engineering; Channel (broadcasting); Physics","score_opus":0.05721254112731804,"score_gpt":0.2918700804958549,"score_spread":0.23465753936853684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023580604","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.45771927,0.0041695107,0.52074677,0.0005316952,0.000040539508,0.00009989314,0.00020857873,0.00031582578,0.016167859],"genre_scores_gemma":[0.99364895,0.0007914866,0.004783567,0.00002899459,0.000025509373,0.000026774826,0.00003108228,0.000012933614,0.0006508325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00042275176,0.000046450412,0.00012333096,0.0002885078,0.00024357432],"domain_scores_gemma":[0.9924925,0.0055576405,0.00085147814,0.00024921313,0.0007358981,0.000113231225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018962095,0.0015163999,0.00097451115,0.000952317,0.0007137606,0.0016112684,0.0007826165,0.0013247947,0.00083626166],"category_scores_gemma":[0.0091095,0.00037032727,0.00050477433,0.0011282644,0.0012815497,0.0012612296,0.0009755125,0.0007683489,0.00026074494],"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.000074913,0.000036148394,0.0012356568,0.00007704203,0.00004262207,0.00030977046,0.00019183928,0.9758394,0.0034178363,0.011357027,0.00025293775,0.0071648406],"study_design_scores_gemma":[0.000003688474,0.0000528377,0.00037267298,0.000007309352,0.000014860524,0.00009470103,0.000042786985,0.99626106,0.00053531013,0.0025127446,0.000091679074,0.000010235985],"about_ca_topic_score_codex":0.007931373,"about_ca_topic_score_gemma":0.0039985455,"teacher_disagreement_score":0.007931373,"about_ca_system_score_codex":0.0014664083,"about_ca_system_score_gemma":0.00097209093,"threshold_uncertainty_score":0.015770435},"labels":[],"label_agreement":null},{"id":"W2024982724","doi":"10.1109/tcomm.2012.082812.110390","title":"Multiple CFO Mitigation in Amplify-and-Forward Cooperative OFDM Transmission","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Decoding methods; Computer science; Carrier frequency offset; Interference (communication); Algorithm; Transmission (telecommunications); Multiplexing; Decodes; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Frequency offset","score_opus":0.05104095675021321,"score_gpt":0.30287572687776193,"score_spread":0.25183477012754873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024982724","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.17235811,0.0013658291,0.823578,0.0001593502,0.000042266023,0.000030271049,0.000023907396,0.00027765124,0.0021645837],"genre_scores_gemma":[0.90506357,0.00060674746,0.09290565,0.000048252463,0.000029528112,0.00003183501,0.000025433712,0.000011323357,0.0012776622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943525,0.000114129914,0.000022091466,0.00007254539,0.00029688404,0.00005911605],"domain_scores_gemma":[0.99935704,0.0003224087,0.00010667825,0.00005732254,0.00013284908,0.000023817167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061617355,0.0004951235,0.0004795696,0.00037282534,0.00041682157,0.0004331595,0.0005175772,0.00055253366,0.0002761063],"category_scores_gemma":[0.0016302537,0.00026077428,0.00026824206,0.00046778063,0.00047112248,0.00069656083,0.0005046004,0.0004383033,0.00011599895],"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.0004498786,0.00012728568,0.0033984198,0.00022500013,0.00008105359,0.00062720064,0.0005930251,0.5160736,0.16222486,0.016209258,0.0009578519,0.29903254],"study_design_scores_gemma":[0.000020335456,0.00018949425,0.0005370041,0.000014468321,0.00003211842,0.00032837858,0.000056944915,0.95540863,0.03977921,0.002384653,0.0012277478,0.00002100023],"about_ca_topic_score_codex":0.0022499925,"about_ca_topic_score_gemma":0.002291374,"teacher_disagreement_score":0.0022499925,"about_ca_system_score_codex":0.00041249522,"about_ca_system_score_gemma":0.0008296489,"threshold_uncertainty_score":0.004473865},"labels":[],"label_agreement":null},{"id":"W2025349149","doi":"10.1109/tcomm.2015.2404440","title":"MINTED: <italic>M</italic>ulticast <italic>VI</italic>rtual <italic>N</italic>e<italic>T</italic>work <italic>E</italic>mbedding in Cloud Data Centers With <italic>D</italic>elay Constraints","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":33,"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":"Qatar National Research Fund","keywords":"Multicast; Computer science; Computer network; Unicast; Quality of service","score_opus":0.05337180103299812,"score_gpt":0.2837657976359783,"score_spread":0.23039399660298018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025349149","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.0052426253,0.002297936,0.015393445,0.017545618,0.013217349,0.0003357716,0.0042158794,0.002945257,0.9388062],"genre_scores_gemma":[0.018021178,0.0012047159,0.0024994179,0.0011211135,0.00084205694,0.00008883522,0.0016626872,0.001119876,0.9734402],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.00016509452,0.00006817252,0.000512358,0.00030710286,0.00024639702],"domain_scores_gemma":[0.9979236,0.0003889438,0.00016337646,0.00040138338,0.0007281886,0.00039454637],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000984279,0.0015525883,0.0010217013,0.0010835594,0.0019570505,0.007881642,0.0019474456,0.0029130063,0.7696226],"category_scores_gemma":[0.0028643,0.0005617068,0.00080475095,0.0018284712,0.0015580627,0.004603214,0.004115955,0.0023485692,0.66397876],"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.00033027364,0.00012838142,0.0012344961,0.0005037738,0.000024148854,0.00044444102,0.00035283485,0.0020204447,0.0045536375,0.055314172,0.6590045,0.27608892],"study_design_scores_gemma":[0.000012725429,0.000023311637,0.00041627837,0.0000869078,0.0000052250507,0.00011627331,0.00017203513,0.0017671621,0.0010439788,0.004664225,0.9916802,0.000011719727],"about_ca_topic_score_codex":0.0061675212,"about_ca_topic_score_gemma":0.0065935156,"teacher_disagreement_score":0.7696226,"about_ca_system_score_codex":0.0034241225,"about_ca_system_score_gemma":0.0021235896,"threshold_uncertainty_score":0.32860535},"labels":[],"label_agreement":null},{"id":"W2027150172","doi":"10.1109/tcomm.2012.071812.110739","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Network-Coded Two-Way Relay Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"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":"Relay; Computer science; Phase-shift keying; Detector; Linear network coding; Relay channel; Binary number; Transmission (telecommunications); Node (physics); Bit error rate; Algorithm; Channel (broadcasting); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Network packet; Physics; Arithmetic; Electrical engineering; Power (physics)","score_opus":0.07165189234788484,"score_gpt":0.29551240790146066,"score_spread":0.22386051555357583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027150172","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.020678796,0.00051636825,0.97670835,0.00019695323,0.000022270217,0.000032494354,0.000033547458,0.00012378792,0.0016873823],"genre_scores_gemma":[0.8565085,0.00052825175,0.141104,0.00011700764,0.000038506427,0.000057644138,0.000052242984,0.000027090176,0.0015668091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979079,0.00082955766,0.00011226949,0.00029111243,0.0006411162,0.00021815272],"domain_scores_gemma":[0.99532735,0.003398109,0.00042631166,0.0002679678,0.00051527814,0.00006497058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024143127,0.000822892,0.0011019575,0.0007401761,0.00038477726,0.001716917,0.0012776284,0.0015719583,0.000636928],"category_scores_gemma":[0.009329107,0.00042278145,0.0004752915,0.0010842165,0.0016393602,0.0023021817,0.0013543332,0.0008198277,0.0002756807],"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.00024167661,0.00006694631,0.00075887865,0.00028129114,0.000074629825,0.00047517565,0.00041888122,0.8178292,0.014651888,0.10630362,0.00069261785,0.058205254],"study_design_scores_gemma":[0.000015268017,0.000044598564,0.00005938374,0.000012452791,0.00000943756,0.00011438648,0.000020227455,0.9826262,0.003430299,0.0133246705,0.00032656573,0.000016428567],"about_ca_topic_score_codex":0.0013065385,"about_ca_topic_score_gemma":0.0011332715,"teacher_disagreement_score":0.0024143127,"about_ca_system_score_codex":0.0013059264,"about_ca_system_score_gemma":0.0011890574,"threshold_uncertainty_score":0.012768269},"labels":[],"label_agreement":null},{"id":"W2028070124","doi":"10.1109/tcomm.2013.020813.120594","title":"A Modified Hard Core Point Process for Analysis of Random CSMA Wireless Networks in General Fading Environments","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":90,"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":"Fading; Computer network; Computer science; Node (physics); Point process; Transmission (telecommunications); Wireless network; Stochastic geometry; Interference (communication); Carrier sense multiple access with collision avoidance; Wireless; Distributed computing; Topology (electrical circuits); Channel (broadcasting); Throughput; Engineering; Telecommunications; Mathematics","score_opus":0.04026231450494504,"score_gpt":0.27457280157659947,"score_spread":0.23431048707165442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028070124","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.0034184542,0.00015094093,0.9949433,0.00007564762,0.000022119662,0.000028746737,0.000025783771,0.000042757783,0.0012922857],"genre_scores_gemma":[0.68771625,0.0025256595,0.2975758,0.00041347937,0.00028789332,0.0007899904,0.00028261347,0.00015354251,0.010254722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.00028125852,0.000027823307,0.00011222913,0.00028464122,0.00006337512],"domain_scores_gemma":[0.998016,0.0013411782,0.0001666525,0.0001435781,0.0002757366,0.000056795903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693152,0.0011091607,0.0005628566,0.000997036,0.00033127484,0.0008147416,0.0014204794,0.0011713164,0.0023768027],"category_scores_gemma":[0.0062999357,0.00031186955,0.0008922245,0.0010004734,0.0013306438,0.0016393398,0.0011865613,0.0021631462,0.00064406486],"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.000031173007,0.000044632623,0.00068662124,0.00011817701,0.000029759194,0.00023206066,0.000114819544,0.70349294,0.0074362494,0.27494478,0.0009484929,0.0119202975],"study_design_scores_gemma":[0.0000027989495,0.000014380119,0.00007994758,0.0000060530692,0.0000039840816,0.00002313403,0.000007922053,0.9828857,0.0005016664,0.015926868,0.00054175296,0.00000577001],"about_ca_topic_score_codex":0.0014504436,"about_ca_topic_score_gemma":0.0008042357,"teacher_disagreement_score":0.0023768027,"about_ca_system_score_codex":0.00074262853,"about_ca_system_score_gemma":0.00067499094,"threshold_uncertainty_score":0.009886026},"labels":[],"label_agreement":null},{"id":"W2031321507","doi":"10.1109/tcomm.2015.2408601","title":"Uplink Decentralized Joint Bandwidth and Power Allocation for Energy-Efficient Operation in a Heterogeneous Wireless Medium","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":44,"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":"Qatar National Research Fund","keywords":"Telecommunications link; Base station; Computer science; Computer network; Quality of service; Efficient energy use; Benchmark (surveying); Wireless; Bandwidth (computing); Multihoming; Distributed computing; Engineering; Telecommunications; Electrical engineering","score_opus":0.032282928049624626,"score_gpt":0.2585824660237203,"score_spread":0.2262995379740957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031321507","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.027434656,0.00027355255,0.9688588,0.00011199956,0.000020560861,0.000021962698,0.000024020208,0.00008931879,0.0031650893],"genre_scores_gemma":[0.9476947,0.00019929321,0.05030162,0.0000478509,0.00003855234,0.00005367547,0.000036569854,0.000034655288,0.0015931844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.00020718623,0.000015866752,0.00009320775,0.00015518953,0.00011367549],"domain_scores_gemma":[0.99950624,0.00026678824,0.000073243726,0.00005236595,0.000071398914,0.000029977662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007661618,0.0006480396,0.0010262477,0.00027653307,0.0005336488,0.0010864937,0.00091991515,0.0006781843,0.0011350969],"category_scores_gemma":[0.0014801951,0.0003328428,0.00035045113,0.0006062225,0.00071296695,0.0011025886,0.00088998117,0.0005710468,0.00021265974],"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.000041419364,0.000034265657,0.00019616474,0.00003831264,0.00001899705,0.00006874665,0.000027927344,0.965817,0.0046103643,0.0148892375,0.00054106646,0.013716583],"study_design_scores_gemma":[0.0000040979508,0.000014749958,0.00004928342,0.0000016006783,0.00000370911,0.000014213685,0.000010244736,0.99652535,0.00052957615,0.0026503277,0.00019363037,0.0000031118118],"about_ca_topic_score_codex":0.0016634911,"about_ca_topic_score_gemma":0.0021594628,"teacher_disagreement_score":0.0016634911,"about_ca_system_score_codex":0.00075979513,"about_ca_system_score_gemma":0.00090702233,"threshold_uncertainty_score":0.0055127144},"labels":[],"label_agreement":null},{"id":"W2031570691","doi":"10.1109/tcomm.2009.04.070114","title":"On decoding binary perfect and quasi-perfect codes over markov noise channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Decoding methods; Hamming bound; Hamming code; Algorithm; Block code; Binary symmetric channel; Mathematics; Linear code; Sequential decoding; List decoding; Markov chain; Concatenated error correction code; Hamming distance; Discrete mathematics; Computer science; Low-density parity-check code; Statistics","score_opus":0.018475127721856662,"score_gpt":0.2779605272010587,"score_spread":0.259485399479202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031570691","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.15871902,0.00054177013,0.8352423,0.00063650066,0.000049216396,0.00005057301,0.00013556903,0.000101351055,0.004523642],"genre_scores_gemma":[0.92360926,0.0009508691,0.072237045,0.00016368888,0.00007836012,0.000081069746,0.0001698803,0.000045571036,0.0026642452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997806,0.0010415178,0.00010549105,0.00021118473,0.0005197277,0.00031612342],"domain_scores_gemma":[0.986464,0.011266485,0.00087458256,0.0005105877,0.00072872784,0.00015562828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025593913,0.00065487856,0.00090832566,0.00057446904,0.0005363032,0.0012753827,0.00074514584,0.0011476728,0.0010502887],"category_scores_gemma":[0.016888719,0.00039305593,0.00033165974,0.0011674972,0.0028054535,0.0030651358,0.0016552821,0.00094459695,0.00024490297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000359276,0.00003679431,0.0010597156,0.00018182096,0.000025427245,0.00028941839,0.00028955462,0.72191226,0.004551795,0.25482136,0.0006028012,0.015869835],"study_design_scores_gemma":[0.00003371613,0.000071558825,0.00023681471,0.000021309908,0.0000067868577,0.00011224239,0.00005121873,0.88698554,0.002387972,0.10984231,0.0002314642,0.000019127307],"about_ca_topic_score_codex":0.0023488118,"about_ca_topic_score_gemma":0.0015565709,"teacher_disagreement_score":0.0025593913,"about_ca_system_score_codex":0.0011533343,"about_ca_system_score_gemma":0.0016411266,"threshold_uncertainty_score":0.0135355},"labels":[],"label_agreement":null},{"id":"W2036710797","doi":"10.1109/tcomm.2015.2427171","title":"PLC System Performance With AF Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":66,"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":"International Development Research Centre","keywords":"Fading; Electronic engineering; Additive white Gaussian noise; Transmission (telecommunications); Bit error rate; Relay; Data transmission; Control theory (sociology); Attenuation; Phase-shift keying; Communications system; Noise (video); Channel (broadcasting); Signal-to-noise ratio (imaging); Computer science; Engineering; Telecommunications; Electrical engineering; Power (physics); Physics","score_opus":0.04213137260765672,"score_gpt":0.23833655832461254,"score_spread":0.19620518571695583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036710797","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.9065894,0.00067069184,0.07359195,0.00030475514,0.000043142052,0.000041095864,0.00036692014,0.0015318987,0.01686019],"genre_scores_gemma":[0.9981439,0.00008838914,0.0010383602,0.000016797412,0.0000067178785,0.0000090995145,0.00009254292,0.000013432766,0.0005908687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.0002704497,0.00007310597,0.00021950406,0.00031717593,0.00025469472],"domain_scores_gemma":[0.99630725,0.0019658771,0.0003368545,0.00029190636,0.0010254546,0.00007265209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007275316,0.00067431165,0.0005348947,0.00038852936,0.0005606426,0.00086684333,0.00041803464,0.00090315024,0.0020248448],"category_scores_gemma":[0.004344357,0.000109373854,0.00021746915,0.0005551655,0.00065201876,0.0008718399,0.00072082324,0.00048247524,0.0005637704],"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.0026133023,0.0001645629,0.013075469,0.00052460027,0.00018785054,0.0011886976,0.0005615422,0.85200554,0.048356473,0.0040327567,0.0016839466,0.075605236],"study_design_scores_gemma":[0.00009389151,0.001262999,0.008037433,0.00004673088,0.00019517716,0.0010102364,0.00026028597,0.9439071,0.041259885,0.002173508,0.001683416,0.00006929996],"about_ca_topic_score_codex":0.005400401,"about_ca_topic_score_gemma":0.00212944,"teacher_disagreement_score":0.005400401,"about_ca_system_score_codex":0.0006548623,"about_ca_system_score_gemma":0.00071257807,"threshold_uncertainty_score":0.010737896},"labels":[],"label_agreement":null},{"id":"W2038386869","doi":"10.1109/tcomm.2013.041113.120480","title":"Joint Optimization of Source Power Allocation and Cooperative Beamforming for SC-FDMA Multi-User Multi-Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Joint (building); Optimization problem; Computer science; Mathematical optimization; Power (physics); Interference (communication); Signal-to-noise ratio (imaging); Convex optimization; Noise (video); Electronic engineering; Telecommunications; Mathematics; Algorithm; Regular polygon; Engineering; Channel (broadcasting)","score_opus":0.05336404005613694,"score_gpt":0.2852314857243695,"score_spread":0.23186744566823259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038386869","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.016330225,0.00035648493,0.9805517,0.00014799152,0.000013429809,0.000034407993,0.000030813575,0.00006272538,0.002472201],"genre_scores_gemma":[0.81650627,0.0010597915,0.17743373,0.0001033092,0.00004587165,0.0003040866,0.00009065315,0.000058894693,0.004397413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995041,0.00023688971,0.000017797387,0.00007092858,0.000109722954,0.00006056484],"domain_scores_gemma":[0.9991918,0.000593328,0.000082798615,0.0000261995,0.00008336012,0.000022499516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052549,0.001011314,0.0008541449,0.00043155023,0.0002935911,0.0009787962,0.0005522336,0.0010513784,0.0009904918],"category_scores_gemma":[0.0023066325,0.00058879564,0.00058031926,0.0008847543,0.0007739991,0.0008512898,0.00082259683,0.0006361815,0.00019995817],"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.0000221219,0.000014338572,0.00014297833,0.00003948751,0.00001562474,0.000034226618,0.00002242142,0.9847633,0.00090870814,0.006179345,0.00021283727,0.007644581],"study_design_scores_gemma":[0.0000047854132,0.000015302054,0.000031951702,0.000002234002,0.0000035239086,0.000006811934,0.0000059682343,0.997378,0.00025989473,0.0021541747,0.00013498781,0.0000024068079],"about_ca_topic_score_codex":0.0035941254,"about_ca_topic_score_gemma":0.0032980717,"teacher_disagreement_score":0.0035941254,"about_ca_system_score_codex":0.0010475847,"about_ca_system_score_gemma":0.0011083727,"threshold_uncertainty_score":0.0076007843},"labels":[],"label_agreement":null},{"id":"W2039436865","doi":"10.1109/tcomm.2008.060315","title":"On the complexity of joint source-channel decoding of Markov sequences over memoryless channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McMaster University","funders":"","keywords":"Convolutional code; Decoding methods; Viterbi algorithm; Algorithm; Source code; Markov process; Computer science; Markov chain; Viterbi decoder; Discrete mathematics; Mathematics; Theoretical computer science; Statistics","score_opus":0.16279026126519539,"score_gpt":0.3071654428613609,"score_spread":0.1443751815961655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039436865","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.5281144,0.0021541228,0.44920638,0.0043650037,0.000172719,0.00020509989,0.0013093785,0.0013458409,0.01312705],"genre_scores_gemma":[0.9494375,0.00076907396,0.044315603,0.00024365891,0.00014698583,0.00022267363,0.001011447,0.0002457309,0.003607318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963529,0.0012339476,0.00014118846,0.00041301805,0.0010847995,0.00077418075],"domain_scores_gemma":[0.93490356,0.06007376,0.0016408511,0.0014197689,0.0014705296,0.0004915137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036624747,0.0010317527,0.0015496506,0.0009104464,0.0010514191,0.0025707104,0.001825459,0.0015488806,0.0039839707],"category_scores_gemma":[0.027198222,0.00072254747,0.00092016364,0.0012070524,0.002276515,0.00543316,0.0021967825,0.0024804978,0.0004860656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012214171,0.00007040954,0.0021500182,0.00018472958,0.00009090484,0.000260467,0.00018767678,0.9408568,0.0035560762,0.03212177,0.0017268625,0.017572783],"study_design_scores_gemma":[0.000028775987,0.000032195323,0.00024720523,0.000011003042,0.000011492631,0.000030692263,0.000025767386,0.9809684,0.00095861236,0.017549766,0.00012469952,0.000011429476],"about_ca_topic_score_codex":0.008366216,"about_ca_topic_score_gemma":0.008665002,"teacher_disagreement_score":0.008366216,"about_ca_system_score_codex":0.0042718695,"about_ca_system_score_gemma":0.0042048865,"threshold_uncertainty_score":0.030994713},"labels":[],"label_agreement":null},{"id":"W2040483094","doi":"10.1109/tcomm.2010.062310.090065","title":"Selective Cooperative Relaying over Time-Varying Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"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":"Relay; Relay channel; Fading; Bandwidth (computing); Computer science; Computer network; Electronic engineering; Power (physics); Channel (broadcasting); Engineering; Physics","score_opus":0.03669912004018087,"score_gpt":0.2961604010098597,"score_spread":0.2594612809696788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040483094","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.43126273,0.0007617954,0.56013554,0.00013114623,0.00003054388,0.00006475637,0.0001244978,0.0003042543,0.007184806],"genre_scores_gemma":[0.99240017,0.00022504108,0.006510882,0.000017869765,0.000008889103,0.000015560936,0.000021739967,0.0000058754226,0.0007939942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996238,0.00008858302,0.000013817049,0.000060116767,0.00010524382,0.000108488966],"domain_scores_gemma":[0.99726593,0.0018306307,0.00032976767,0.00026864157,0.0002600614,0.000044872933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000608251,0.00048224558,0.0003863502,0.00031417128,0.00033560567,0.0004776184,0.00044198078,0.00036167746,0.00059733336],"category_scores_gemma":[0.002503387,0.00012069842,0.00019644639,0.0006718049,0.00055155996,0.00066022284,0.00035458858,0.00025452767,0.00016264008],"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.0004046028,0.000060830156,0.0033486534,0.00021185937,0.000086594395,0.0008957893,0.00047704836,0.78665155,0.075551346,0.041556038,0.0008897455,0.089866005],"study_design_scores_gemma":[0.000023342012,0.00023889639,0.0014862309,0.000010068653,0.00005419717,0.00061874755,0.00013494275,0.96480834,0.01650441,0.014165623,0.001926632,0.000028580662],"about_ca_topic_score_codex":0.0014967988,"about_ca_topic_score_gemma":0.0024720032,"teacher_disagreement_score":0.0014967988,"about_ca_system_score_codex":0.0004148807,"about_ca_system_score_gemma":0.00036742978,"threshold_uncertainty_score":0.003216803},"labels":[],"label_agreement":null},{"id":"W2041376620","doi":"10.1109/tcomm.2013.050813.120450","title":"Randomized Masking in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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 Waterloo","funders":"","keywords":"Transmitter; Code word; Channel (broadcasting); Transmission (telecommunications); Computer science; Cognitive radio; Computer network; Masking (illustration); Code (set theory); Quality of service; Interference (communication); Telecommunications; Set (abstract data type); Decoding methods; Wireless","score_opus":0.029684406223567078,"score_gpt":0.27186302636367166,"score_spread":0.24217862014010458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041376620","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.106592484,0.0023175713,0.87952274,0.00071883225,0.00016068711,0.00009413941,0.00013132197,0.0003848182,0.010077417],"genre_scores_gemma":[0.979912,0.00065368053,0.01705396,0.00012602082,0.000093811264,0.00009239289,0.000038685415,0.00002090872,0.0020084886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980882,0.00086534506,0.00005952596,0.00031320704,0.0003385297,0.00033521038],"domain_scores_gemma":[0.99318755,0.0050809286,0.0008105019,0.0003092927,0.00035547535,0.00025625085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021514446,0.001019029,0.0010423324,0.000671138,0.00066235743,0.0014167217,0.0014292568,0.0010625841,0.0010407879],"category_scores_gemma":[0.008201582,0.0006139354,0.0005992999,0.00068743667,0.0024170452,0.0016083077,0.0013937266,0.0011009665,0.00019175958],"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.00024235772,0.00004952967,0.00089574634,0.00014868221,0.000058157086,0.00026948482,0.00017273908,0.8461566,0.0035198212,0.13393502,0.00078861805,0.013763224],"study_design_scores_gemma":[0.00002214677,0.00007236373,0.00020938658,0.000014149217,0.000018950399,0.000048383747,0.000023369132,0.9483845,0.00043272684,0.050259344,0.0004975146,0.000017202206],"about_ca_topic_score_codex":0.0037557578,"about_ca_topic_score_gemma":0.0018514557,"teacher_disagreement_score":0.0037557578,"about_ca_system_score_codex":0.0018518568,"about_ca_system_score_gemma":0.0014202975,"threshold_uncertainty_score":0.013436198},"labels":[],"label_agreement":null},{"id":"W2041849117","doi":"10.1109/tcomm.2012.120512.110258","title":"A General Framework for Mixed-Domain Echo Cancellation in Discrete Multitone Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Adaptive Filtering 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":"McGill University","funders":"","keywords":"Computer science; Toeplitz matrix; Algorithm; Echo (communications protocol); Frequency domain; Matrix decomposition; Mathematics","score_opus":0.027262475069016547,"score_gpt":0.28887031343717295,"score_spread":0.26160783836815643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041849117","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.0012563332,0.00019130541,0.9965341,0.000042656255,0.000023756458,0.000013526189,0.000013500209,0.00003869138,0.0018861181],"genre_scores_gemma":[0.24239771,0.0019337663,0.7430034,0.00029561832,0.00016806262,0.00017998874,0.00012728338,0.0000730421,0.011821153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.00003419035,0.000008184972,0.00003169221,0.000076688535,0.000014763485],"domain_scores_gemma":[0.99991214,0.000029332805,0.000009177689,0.0000149119405,0.00002756072,0.000006904039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003161058,0.00060072786,0.00032330668,0.00029880193,0.0002619457,0.00067263417,0.0006831637,0.00069778366,0.001958051],"category_scores_gemma":[0.00046340178,0.00018813886,0.0004390807,0.000333404,0.00056786754,0.0007162287,0.00054725393,0.0008911662,0.0006234852],"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.000056078312,0.000047772348,0.00023154686,0.00026884404,0.000045338173,0.00036674505,0.0001612063,0.26848832,0.07908798,0.5727885,0.0020868513,0.07637082],"study_design_scores_gemma":[0.00002304022,0.000110784,0.0001936725,0.00003303256,0.000017943827,0.00038919382,0.000039377774,0.8754266,0.011290317,0.08945514,0.022984747,0.00003614731],"about_ca_topic_score_codex":0.0007939901,"about_ca_topic_score_gemma":0.0011247746,"teacher_disagreement_score":0.001958051,"about_ca_system_score_codex":0.00028217555,"about_ca_system_score_gemma":0.0005163744,"threshold_uncertainty_score":0.006550312},"labels":[],"label_agreement":null},{"id":"W2042649448","doi":"10.1109/tcomm.2011.100611.100171","title":"Efficient Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Algorithm; Turbo code; Computer science; Serial concatenated convolutional codes; Mathematics; Concatenated error correction code; Block code; Decoding methods","score_opus":0.05541220702480414,"score_gpt":0.2880105201604358,"score_spread":0.23259831313563167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042649448","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.022084579,0.00012476774,0.97537553,0.00004829388,0.000009774793,0.00006103085,0.000050524457,0.00044737288,0.0017980209],"genre_scores_gemma":[0.15367118,0.00010372989,0.8441793,0.00004990237,0.000011991518,0.00023562557,0.00024087558,0.00006809283,0.0014391827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975103,0.00006913524,0.000022357059,0.000041041043,0.00008336025,0.000033024167],"domain_scores_gemma":[0.9994641,0.00030894385,0.000058502777,0.000040758452,0.00011257461,0.0000150704045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044919786,0.0005620841,0.0005221626,0.0007900267,0.000291272,0.0004359218,0.00064467965,0.00055808935,0.002725811],"category_scores_gemma":[0.0021313366,0.00026257057,0.00024838778,0.0006310019,0.00036040018,0.00056360225,0.00062404637,0.000350609,0.0007582291],"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.00039970747,0.00014014695,0.0022369858,0.00023769551,0.00006703924,0.00016485088,0.00022911244,0.36064824,0.0256883,0.034892723,0.003595901,0.5716993],"study_design_scores_gemma":[0.00007617308,0.0000874961,0.00025834696,0.000018023944,0.000011260105,0.00008855314,0.000031168936,0.9872349,0.004855057,0.0060534053,0.0012724908,0.000013167348],"about_ca_topic_score_codex":0.0014055857,"about_ca_topic_score_gemma":0.0026054766,"teacher_disagreement_score":0.002725811,"about_ca_system_score_codex":0.00038093477,"about_ca_system_score_gemma":0.0015651345,"threshold_uncertainty_score":0.009118736},"labels":[],"label_agreement":null},{"id":"W2044066528","doi":"10.1109/tcomm.2012.071812.100789","title":"Suboptimal Detectors for Alpha-Stable Noise: Simplifying Design and Improving Performance","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":40,"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":"Detector; Limiter; Gaussian; Computer science; Noise (video); Gaussian noise; Algorithm; Electronic engineering; Binary number; Signal-to-noise ratio (imaging); Mathematics; Engineering; Telecommunications; Physics; Artificial intelligence; Arithmetic","score_opus":0.04774013833522976,"score_gpt":0.26636956726635147,"score_spread":0.2186294289311217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044066528","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.005247331,0.00019973812,0.99361914,0.00007044718,0.000013792105,0.000018587258,0.000014468427,0.00014833256,0.0006681261],"genre_scores_gemma":[0.30633038,0.0006443068,0.69119203,0.00017891942,0.00007492527,0.00011394958,0.000086025466,0.00008073857,0.0012986647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969399,0.0011453097,0.0001911788,0.00051940215,0.0010237286,0.00018047667],"domain_scores_gemma":[0.99484646,0.0028402656,0.00049067475,0.00078004395,0.00092286157,0.000119647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041013216,0.0010964752,0.0015599634,0.0007408247,0.0005557344,0.0020551893,0.001333031,0.0013719682,0.0011915796],"category_scores_gemma":[0.016683156,0.0006501256,0.0006187069,0.00073837437,0.0014458102,0.0020199076,0.0013165433,0.0014337089,0.0009358472],"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.0009697834,0.00013642378,0.003061576,0.0003564308,0.00014404848,0.00035585067,0.00039344325,0.35972464,0.085096315,0.25030038,0.0027464828,0.29671466],"study_design_scores_gemma":[0.0000377373,0.00020214613,0.00025887674,0.000034835353,0.000034093067,0.00029338576,0.000029877327,0.92965996,0.027382335,0.0390047,0.0030326329,0.000029464485],"about_ca_topic_score_codex":0.0008041043,"about_ca_topic_score_gemma":0.00092922064,"teacher_disagreement_score":0.0041013216,"about_ca_system_score_codex":0.0009487027,"about_ca_system_score_gemma":0.002423731,"threshold_uncertainty_score":0.02169013},"labels":[],"label_agreement":null},{"id":"W2044404558","doi":"10.1109/tcomm.2013.112513.130142","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part I: General Properties and Numerical Techniques","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Poisson distribution; Channel capacity; Mathematics; Channel (broadcasting); Constraint (computer-aided design); Envelope (radar); Applied mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Statistics; Telecommunications; Geometry","score_opus":0.03614595243466399,"score_gpt":0.23625343763918244,"score_spread":0.20010748520451846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044404558","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.01051528,0.0004509092,0.97874486,0.00033362905,0.000026643822,0.00006196293,0.000089543035,0.00015348333,0.0096237315],"genre_scores_gemma":[0.59494376,0.002105153,0.3930676,0.00029151855,0.00012740894,0.0006271485,0.00027747476,0.00026674307,0.008293284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937624,0.00023757791,0.000027130529,0.000055322107,0.00022531641,0.000078433324],"domain_scores_gemma":[0.99519026,0.0037406555,0.0003136572,0.00028602208,0.00034265168,0.00012679618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024507071,0.0006925836,0.0007072102,0.0014881025,0.000726742,0.0015895602,0.0014038861,0.0011378971,0.004233109],"category_scores_gemma":[0.012699154,0.0005411026,0.0009066495,0.0013887528,0.0021188497,0.0019894056,0.001568896,0.0021882318,0.0005706697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002485153,0.000025949943,0.00033911518,0.00008517134,0.000010338597,0.000056627807,0.000096045704,0.52235395,0.0011585584,0.46544954,0.00091525743,0.009484584],"study_design_scores_gemma":[0.000003589432,0.000004551991,0.000037335634,0.000010445739,0.0000015861372,0.000025252004,0.000011033141,0.9303593,0.000305995,0.06880878,0.00042580545,0.0000063495186],"about_ca_topic_score_codex":0.0027849637,"about_ca_topic_score_gemma":0.0017923027,"teacher_disagreement_score":0.004233109,"about_ca_system_score_codex":0.0021384575,"about_ca_system_score_gemma":0.0014718783,"threshold_uncertainty_score":0.0155156255},"labels":[],"label_agreement":null},{"id":"W2044607510","doi":"10.1109/tcomm.2005.861668","title":"Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":71,"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":"Low-density parity-check code; Decoding methods; Algorithm; Asynchronous communication; Successive over-relaxation; Belief propagation; Relaxation (psychology); Mathematics; Computer science; Iterative method; Gaussian; Telecommunications","score_opus":0.024923408748593487,"score_gpt":0.2895366205965194,"score_spread":0.2646132118479259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044607510","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.48824054,0.0005144026,0.5010403,0.00033741494,0.000019777885,0.000052701504,0.00008877283,0.00029448356,0.009411608],"genre_scores_gemma":[0.98731405,0.00017879308,0.011460153,0.000018817427,0.000006001336,0.00002140917,0.00003900519,0.000022184064,0.00093973655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.00011905771,0.000009823292,0.000039205246,0.00013791957,0.0000374235],"domain_scores_gemma":[0.99811745,0.0012596592,0.00022348206,0.00011043053,0.00025469446,0.000034263165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006604814,0.0003420188,0.00034871427,0.00035313852,0.00020715041,0.00036229103,0.00046766896,0.00037807613,0.0007616894],"category_scores_gemma":[0.0048801373,0.00020243708,0.00021796298,0.00033226327,0.00080276985,0.00079573935,0.00043059528,0.0005715205,0.00014934942],"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.00006355107,0.000022254446,0.0010423448,0.00004912837,0.000012477887,0.00007161346,0.00012433658,0.95535684,0.011938042,0.023776865,0.00017182797,0.0073707676],"study_design_scores_gemma":[0.0000014714316,0.00001047123,0.00014508603,0.0000018136618,0.0000013507986,0.000009997589,0.00000461235,0.99747485,0.0011821368,0.0011167522,0.000048582067,0.0000028288703],"about_ca_topic_score_codex":0.0028920495,"about_ca_topic_score_gemma":0.0013307546,"teacher_disagreement_score":0.0028920495,"about_ca_system_score_codex":0.000929811,"about_ca_system_score_gemma":0.0006259609,"threshold_uncertainty_score":0.0067463517},"labels":[],"label_agreement":null},{"id":"W2044733806","doi":"10.1109/tcomm.2006.885072","title":"An Analytical Expression for the BER of an Individually Optimal Single Cochannel Interferer BPSK Receiver","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Phase-shift keying; Additive white Gaussian noise; Bit error rate; Interference (communication); Algorithm; Keying; Electronic engineering; Computer science; Mathematics; Gaussian noise; Channel (broadcasting); Telecommunications; Decoding methods; Engineering","score_opus":0.05322844969051971,"score_gpt":0.3311402596869316,"score_spread":0.2779118099964119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044733806","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.013538574,0.0008540141,0.97193277,0.0002850002,0.00006264374,0.00002749206,0.000097725264,0.00047765757,0.012724087],"genre_scores_gemma":[0.6058056,0.0024206801,0.37475032,0.00035430279,0.00019072836,0.00020688919,0.00027875768,0.00038573664,0.015607024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911755,0.00013271571,0.0000392755,0.000099806406,0.0005122782,0.00009839427],"domain_scores_gemma":[0.99881554,0.00054731563,0.00010680525,0.0000916547,0.0004156368,0.000023027083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948109,0.00095949403,0.0008424195,0.000589359,0.00036580302,0.0009453394,0.00090899365,0.0010929498,0.0038689922],"category_scores_gemma":[0.0040593934,0.00037963022,0.00042063734,0.0006034203,0.0008866146,0.0012810846,0.0006385384,0.00083250104,0.002095832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098272656,0.000037677055,0.0005237503,0.00022876788,0.00004478308,0.00026952464,0.0001634748,0.81916547,0.025703693,0.112289324,0.002320757,0.03915457],"study_design_scores_gemma":[0.000009537608,0.00005926728,0.00037847177,0.00006115033,0.000023007666,0.00039314284,0.000034443143,0.9639869,0.008211813,0.024125924,0.0026853003,0.000031029485],"about_ca_topic_score_codex":0.000814445,"about_ca_topic_score_gemma":0.0010376079,"teacher_disagreement_score":0.0038689922,"about_ca_system_score_codex":0.0012444236,"about_ca_system_score_gemma":0.0008458034,"threshold_uncertainty_score":0.012943089},"labels":[],"label_agreement":null},{"id":"W2045408189","doi":"10.1109/tcomm.2014.010414.130440","title":"Generalized and Extended Subspace Algorithms for Error Correction with Quantized DFT Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"McGill University","funders":"","keywords":"Algorithm; Subspace topology; Computer science; Error detection and correction; Mathematics; Artificial intelligence","score_opus":0.03507357175845837,"score_gpt":0.3008096985111171,"score_spread":0.26573612675265873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045408189","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.006080552,0.00046167278,0.99235183,0.00006477999,0.00003537195,0.00001948286,0.00002271159,0.00013821617,0.0008254013],"genre_scores_gemma":[0.289273,0.0012416594,0.7055207,0.0001178085,0.000103429535,0.00011869886,0.000157138,0.00005682603,0.0034107424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991929,0.00027378858,0.00004594452,0.00008173658,0.0003493264,0.000056253335],"domain_scores_gemma":[0.9987577,0.0004968819,0.00012048406,0.00026781054,0.00032597626,0.000031163047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000721939,0.0006743852,0.0006314682,0.0006874206,0.00031418595,0.0006030986,0.0007292973,0.0006284512,0.0015868805],"category_scores_gemma":[0.0040525245,0.00013921078,0.0003911792,0.0010951072,0.00071212323,0.0012564906,0.0010625871,0.00086702465,0.00041579193],"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.00014998746,0.000038046226,0.00044087972,0.00016505373,0.000047493693,0.000083624815,0.00016314434,0.50057256,0.010426745,0.15019374,0.0015369155,0.33618176],"study_design_scores_gemma":[0.00001617169,0.000061258914,0.00008052809,0.000016473421,0.000008068178,0.00008956653,0.000022466433,0.9664819,0.0040742788,0.02696207,0.0021695555,0.000017587887],"about_ca_topic_score_codex":0.0016616073,"about_ca_topic_score_gemma":0.0019060005,"teacher_disagreement_score":0.0016616073,"about_ca_system_score_codex":0.0005049069,"about_ca_system_score_gemma":0.0009735057,"threshold_uncertainty_score":0.005308628},"labels":[],"label_agreement":null},{"id":"W2051821457","doi":"10.1109/tcomm.2009.11.080460","title":"Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Transmission (telecommunications); Channel (broadcasting); Rayleigh fading; Automatic repeat request; Computer network; Hybrid automatic repeat request; Algorithm; Real-time computing; Bitstream; Fading; Decoding methods; Telecommunications","score_opus":0.024948729394263604,"score_gpt":0.2998096858582066,"score_spread":0.274860956463943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051821457","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.036321,0.000255162,0.9623092,0.00013671574,0.000047375972,0.000051711326,0.000015827187,0.00026048187,0.00060242217],"genre_scores_gemma":[0.8407345,0.0001910389,0.15778472,0.00006299296,0.000043155625,0.00008548596,0.000030753592,0.00003885798,0.001028479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991047,0.00033266182,0.00006457524,0.00010677679,0.00027650318,0.000114772374],"domain_scores_gemma":[0.9970655,0.0018766177,0.00034799206,0.0002133824,0.00039474203,0.000101815305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014198729,0.00045536688,0.0007965394,0.00039409896,0.0005354068,0.0008036623,0.00071540696,0.0005694469,0.0008496577],"category_scores_gemma":[0.006035945,0.00029533278,0.00021540816,0.00036658818,0.00076252787,0.0007858737,0.0006559104,0.000663446,0.00019589852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092432025,0.00013056175,0.00124489,0.00016403841,0.00005812558,0.0002664125,0.0003636707,0.7483416,0.027265554,0.032005325,0.0018913784,0.187344],"study_design_scores_gemma":[0.00001661595,0.00004136067,0.00007453594,0.0000047385047,0.000005154485,0.00003901021,0.00000989217,0.994128,0.002921918,0.0024791092,0.00027278552,0.00000690785],"about_ca_topic_score_codex":0.001161712,"about_ca_topic_score_gemma":0.0009742782,"teacher_disagreement_score":0.0014198729,"about_ca_system_score_codex":0.0009055686,"about_ca_system_score_gemma":0.0010925141,"threshold_uncertainty_score":0.0075091124},"labels":[],"label_agreement":null},{"id":"W2052543119","doi":"10.1109/tcomm.2013.122013.130239","title":"Joint Optimization of Source Precoding and Relay Beamforming in Wireless MIMO Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"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 Saskatchewan","funders":"","keywords":"MIMO; Beamforming; Precoding; Relay; Optimization problem; Computer science; Mathematical optimization; Telecommunications link; Convex optimization; Linear programming; Algorithm; Mathematics; Computer network; Power (physics); Telecommunications; Regular polygon","score_opus":0.034887186930708775,"score_gpt":0.2568818715504245,"score_spread":0.22199468461971575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052543119","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.010987398,0.0005278267,0.9862017,0.00008990212,0.000021278329,0.000018775836,0.000027241102,0.00010189013,0.0020239537],"genre_scores_gemma":[0.8140462,0.0020746093,0.17859115,0.000101820115,0.00008929938,0.00019413973,0.00012288903,0.0000672746,0.0047125733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.000410935,0.00003156012,0.00013440062,0.00017129519,0.00008795433],"domain_scores_gemma":[0.9993044,0.0004717789,0.000076021744,0.000035050383,0.00009377956,0.000018983248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009497699,0.0011810518,0.0010193663,0.00036829372,0.00025334544,0.00096149085,0.0006537564,0.00092592154,0.00064188265],"category_scores_gemma":[0.0018477628,0.00055769854,0.0005235982,0.0010201446,0.0007507932,0.0010347659,0.0008380432,0.00071563944,0.00027442377],"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.00003193013,0.00001674059,0.00016712204,0.000053218228,0.000020992999,0.00006451343,0.00002805222,0.9699774,0.0017179488,0.009506943,0.00032668616,0.018088492],"study_design_scores_gemma":[0.0000038789644,0.000023051434,0.00003831194,0.0000024076219,0.0000040765103,0.000012537952,0.0000056301947,0.99693155,0.00047010576,0.0023364155,0.00016832292,0.0000036252181],"about_ca_topic_score_codex":0.002640756,"about_ca_topic_score_gemma":0.0023221679,"teacher_disagreement_score":0.002640756,"about_ca_system_score_codex":0.00067243195,"about_ca_system_score_gemma":0.0010147344,"threshold_uncertainty_score":0.0052508116},"labels":[],"label_agreement":null},{"id":"W2052616361","doi":"10.1109/tcomm.2012.020912.110117","title":"A Constrained-Coding Alternative to MPPM","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Concatenated error correction code; Computer science; Algorithm; Decoding methods; Concatenation (mathematics); Lookup table; Coding gain; Encoder; Coding (social sciences); Block code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.042518401239919366,"score_gpt":0.3052045463125458,"score_spread":0.26268614507262644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052616361","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.02051893,0.00043447127,0.96591324,0.0003046875,0.0001165478,0.00006822021,0.00016183437,0.00030526193,0.012176847],"genre_scores_gemma":[0.5857127,0.0006490847,0.40253004,0.0004270386,0.00012500587,0.00021431914,0.00032759632,0.00010969341,0.009904602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00012571683,0.000025436158,0.000074518866,0.0002640631,0.00006404145],"domain_scores_gemma":[0.99875903,0.00047111485,0.00012427253,0.0003405527,0.0002564302,0.00004860168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031478982,0.00046216632,0.00036249554,0.0004681984,0.0004541955,0.0006434314,0.0009767844,0.0006763805,0.0025776094],"category_scores_gemma":[0.0023619507,0.00016319558,0.00025824734,0.0008985397,0.00072957494,0.0010644844,0.0013546557,0.0009231854,0.00060603785],"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.00024172412,0.0000802561,0.00041988553,0.00019673539,0.00003301594,0.00036241714,0.00019962058,0.15820532,0.05781082,0.5305976,0.003969606,0.24788302],"study_design_scores_gemma":[0.000022682067,0.000120611214,0.0002266536,0.000053726737,0.000014049259,0.00038966723,0.00002455205,0.8645027,0.038497925,0.08215745,0.01393462,0.0000553688],"about_ca_topic_score_codex":0.001514539,"about_ca_topic_score_gemma":0.0017699568,"teacher_disagreement_score":0.0025776094,"about_ca_system_score_codex":0.00045545245,"about_ca_system_score_gemma":0.0010737466,"threshold_uncertainty_score":0.008622944},"labels":[],"label_agreement":null},{"id":"W2052789880","doi":"10.1109/tcomm.2007.904371","title":"On Trellis Shaping for PAR Reduction in OFDM Systems","year":2007,"lang":"fr","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","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":"University of British Columbia","funders":"","keywords":"Trellis (graph); Orthogonal frequency-division multiplexing; Reduction (mathematics); Decoding methods; Computer science; Space–time trellis code; Metric (unit); Algorithm; Trellis modulation; Multiplexing; Electronic engineering; Frequency domain; Theoretical computer science; Mathematics; Telecommunications; Fading; Channel (broadcasting); Block code; Engineering; Concatenated error correction code","score_opus":0.0739426159092565,"score_gpt":0.3150851067858185,"score_spread":0.24114249087656203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052789880","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.009970567,0.0014880837,0.98233414,0.0001934165,0.00006768018,0.00006669637,0.00006210599,0.00036870156,0.005448638],"genre_scores_gemma":[0.421897,0.0045343,0.5636107,0.0004579651,0.00038969395,0.00027706588,0.00031164798,0.0002466458,0.008275024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983662,0.0005657631,0.0000880739,0.00018090903,0.00066592684,0.00013325867],"domain_scores_gemma":[0.9971058,0.0018630214,0.00021156592,0.00039054404,0.0003891003,0.000040058294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800827,0.0009845744,0.0007107185,0.0006137576,0.00048044926,0.00092226587,0.0007126134,0.0007969467,0.0026937937],"category_scores_gemma":[0.005450073,0.0003284236,0.0006371208,0.0014229937,0.00091994193,0.0012630703,0.0006937148,0.0012459429,0.0013032742],"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.0004942768,0.00009234614,0.0005321847,0.00036834576,0.000088559595,0.00035589843,0.0003711574,0.42233536,0.09644966,0.16033205,0.0033104033,0.31526983],"study_design_scores_gemma":[0.000037123165,0.00041883503,0.00045004257,0.000086518165,0.000054804343,0.0006912755,0.000041076946,0.8400101,0.09414445,0.04729083,0.01669918,0.000075777054],"about_ca_topic_score_codex":0.0011401811,"about_ca_topic_score_gemma":0.0012248222,"teacher_disagreement_score":0.0026937937,"about_ca_system_score_codex":0.0009269998,"about_ca_system_score_gemma":0.0009946034,"threshold_uncertainty_score":0.009011686},"labels":[],"label_agreement":null},{"id":"W2053730170","doi":"10.1109/tcomm.2005.852844","title":"Improvement and Analysis of Iterative Decision- Feedback Differential Demodulation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of British Columbia","funders":"","keywords":"Demodulation; Fading; Computer science; Iterative method; Channel state information; Convergence (economics); Transmission (telecommunications); Channel (broadcasting); Bit error rate; Decoding methods; Algorithm; Differential (mechanical device); Control theory (sociology); Electronic engineering; Telecommunications; Wireless; Engineering; Artificial intelligence","score_opus":0.015640961499251427,"score_gpt":0.2758237968010049,"score_spread":0.26018283530175346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053730170","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.032069243,0.00062937714,0.95771265,0.0001415522,0.00004093081,0.000029961242,0.00003268605,0.00013145634,0.009212213],"genre_scores_gemma":[0.8913195,0.00097524346,0.103183985,0.00011043082,0.000073201816,0.00006792308,0.000070444636,0.000070453374,0.0041288347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988691,0.00035309346,0.000034169458,0.00009464518,0.00055577856,0.000093254996],"domain_scores_gemma":[0.9979132,0.001150715,0.00014484391,0.00019277219,0.000560532,0.00003783315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014084278,0.0007108709,0.00056798087,0.0005766046,0.00025242657,0.00072727,0.00087967335,0.0008462689,0.0016012508],"category_scores_gemma":[0.006550271,0.000284668,0.00042812765,0.0004963176,0.00084456074,0.0012068655,0.0009459944,0.0007861036,0.00041976292],"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.00014957026,0.00004576647,0.00095024466,0.00016172772,0.000041137195,0.00025363683,0.00026350626,0.6870932,0.018405706,0.24328469,0.0007638074,0.04858708],"study_design_scores_gemma":[0.0000047310186,0.000033399585,0.00013405013,0.000013250033,0.0000072694265,0.000064505744,0.000007088202,0.9840062,0.004390638,0.010666077,0.00066323596,0.000009503144],"about_ca_topic_score_codex":0.00081381394,"about_ca_topic_score_gemma":0.0005243106,"teacher_disagreement_score":0.0016012508,"about_ca_system_score_codex":0.0010321401,"about_ca_system_score_gemma":0.0006936127,"threshold_uncertainty_score":0.007488787},"labels":[],"label_agreement":null},{"id":"W2054159605","doi":"10.1109/tcomm.2012.010512.100630","title":"Multi-Hop Relaying over the Atmospheric Poisson Channel: Outage Analysis and Optimization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Transmitter; Constraint (computer-aided design); Computer science; Channel (broadcasting); Channel state information; Poisson distribution; Minification; Hop (telecommunications); Power control; Power (physics); Mathematical optimization; Topology (electrical circuits); Electronic engineering; Telecommunications; Wireless; Mathematics; Engineering; Electrical engineering; Physics; Statistics","score_opus":0.027087660061652835,"score_gpt":0.262901073620197,"score_spread":0.23581341355854415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054159605","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.3726446,0.0020054146,0.6110498,0.00092077197,0.000050684663,0.00005548585,0.00023730857,0.0001592085,0.012876693],"genre_scores_gemma":[0.98887306,0.0006474758,0.009039935,0.000034217777,0.00003139317,0.000022371501,0.000041861647,0.000018966415,0.0012907971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943525,0.0001793368,0.00001709685,0.000050878276,0.00018484947,0.00013261643],"domain_scores_gemma":[0.9966852,0.0026126562,0.00033846995,0.00008078963,0.00021742111,0.00006537978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011191757,0.0006623804,0.00084285357,0.0005372139,0.0004884916,0.0008458102,0.0005909495,0.0008850418,0.00094277674],"category_scores_gemma":[0.0040817517,0.0002963103,0.00036360967,0.00081091333,0.0009642205,0.00089094,0.00075821724,0.0005518395,0.00012822209],"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.000037047128,0.000016522647,0.000662197,0.000043969303,0.0000131725,0.00020916494,0.000051675863,0.97827816,0.0014361397,0.015733285,0.00026263372,0.0032560478],"study_design_scores_gemma":[0.0000029610987,0.000013208538,0.00017375407,0.0000025588001,0.000003415062,0.00003712295,0.000021162916,0.9961563,0.00026666553,0.0032384496,0.00008006798,0.0000042890515],"about_ca_topic_score_codex":0.0044248416,"about_ca_topic_score_gemma":0.0030196658,"teacher_disagreement_score":0.0044248416,"about_ca_system_score_codex":0.0012510146,"about_ca_system_score_gemma":0.00069997495,"threshold_uncertainty_score":0.009076774},"labels":[],"label_agreement":null},{"id":"W2055044375","doi":"10.1109/tcomm.2013.111213.130235","title":"Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cognitive radio; Scheduling (production processes); Computer network; Quality of service; Rayleigh fading; Artificial noise; Fading; Physical layer; Base station; Mathematical optimization; Wireless; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.0255506041634968,"score_gpt":0.27381222421167173,"score_spread":0.24826162004817492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055044375","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.06231764,0.0016614754,0.9318528,0.00031789552,0.00011759191,0.0000436499,0.000027341057,0.00009542693,0.0035662523],"genre_scores_gemma":[0.970258,0.00069563586,0.02812936,0.00007182911,0.00009700533,0.00004104034,0.000011843224,0.000010355714,0.00068485324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977926,0.0009703599,0.00007696222,0.00024842474,0.0005399151,0.00037176468],"domain_scores_gemma":[0.99648416,0.0020945556,0.0005188878,0.00035402994,0.00043049033,0.00011789394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026315264,0.0011023291,0.0007802184,0.0005827839,0.0009062833,0.0016586881,0.0011122985,0.001105812,0.0006030883],"category_scores_gemma":[0.0049659265,0.0004307798,0.0005952853,0.0009572898,0.002074165,0.0019459373,0.0014209652,0.0009771404,0.0001436452],"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.00015580785,0.000048171143,0.0008621198,0.00011912607,0.00006679379,0.00037642632,0.00016172786,0.90916616,0.005087681,0.07042319,0.00041325646,0.013119462],"study_design_scores_gemma":[0.0000140219,0.000055978,0.00012286824,0.000007830791,0.000015869526,0.000065362205,0.000023879502,0.98666614,0.00085267203,0.01183866,0.00032513417,0.000011592943],"about_ca_topic_score_codex":0.003700278,"about_ca_topic_score_gemma":0.0024261915,"teacher_disagreement_score":0.003700278,"about_ca_system_score_codex":0.0017128657,"about_ca_system_score_gemma":0.0018361212,"threshold_uncertainty_score":0.013917029},"labels":[],"label_agreement":null},{"id":"W2056207853","doi":"10.1109/tcomm.2015.2424416","title":"Update-Efficient Error-Correcting Product-Matrix Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Council; Syracuse University","keywords":"Vandermonde matrix; Computer science; Decoding methods; Algorithm; Overhead (engineering); Fountain code; Error detection and correction; Encoding (memory); Encoder; Luby transform code; Hamming code; Node (physics); Concatenated error correction code; Block code; Reed–Solomon error correction; Engineering","score_opus":0.067804828299535,"score_gpt":0.3306793863381466,"score_spread":0.2628745580386116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056207853","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.049856804,0.0005164391,0.94581157,0.00015973045,0.00005013365,0.00007478503,0.000106209285,0.00079399743,0.002630319],"genre_scores_gemma":[0.5693576,0.0005996513,0.4216837,0.00012040958,0.00005904097,0.00012948972,0.00026642514,0.00007453264,0.0077091902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993092,0.00015979026,0.000047667156,0.00009311644,0.00032144864,0.00006885707],"domain_scores_gemma":[0.99746954,0.00079855137,0.000419553,0.00054633594,0.00071632897,0.00004975496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006368446,0.00054838543,0.00042394802,0.0006023791,0.0003787498,0.00052275375,0.00084417005,0.0004271837,0.0011784048],"category_scores_gemma":[0.0035373885,0.00016956769,0.00021589095,0.00090593414,0.0005672608,0.0011115643,0.00056003325,0.0006032556,0.0005717937],"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.00058887363,0.00012538477,0.001264255,0.0003320394,0.00006500213,0.00042263884,0.00042270817,0.33295485,0.1112612,0.16930188,0.004178837,0.3790822],"study_design_scores_gemma":[0.00004591475,0.000233788,0.000277606,0.00003639062,0.000025688967,0.0005283621,0.00003903801,0.89434624,0.07719496,0.02038325,0.0068440638,0.000044700904],"about_ca_topic_score_codex":0.0013715756,"about_ca_topic_score_gemma":0.0021659022,"teacher_disagreement_score":0.0013715756,"about_ca_system_score_codex":0.0005105605,"about_ca_system_score_gemma":0.00087242655,"threshold_uncertainty_score":0.0039421916},"labels":[],"label_agreement":null},{"id":"W2056404676","doi":"10.1109/tcomm.2014.2363116","title":"Two-Stage Spectrum Sharing With Combinatorial Auction and Stackelberg Game in Recall-Based Cognitive Radio Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":91,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Cognitive radio; Computer science; Frequency allocation; Resource allocation; Quality of service; Computer network; Game theory; Scheme (mathematics); Mathematical optimization; Telecommunications; Mathematics; Mathematical economics","score_opus":0.017977796026361414,"score_gpt":0.25389576806538255,"score_spread":0.23591797203902115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056404676","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.13949805,0.00045113437,0.8538397,0.00027786344,0.000049763377,0.00014594558,0.00006204195,0.000102104896,0.005573322],"genre_scores_gemma":[0.9683528,0.00019209254,0.028862694,0.000068266876,0.000032164862,0.00009010301,0.00003372241,0.000012900081,0.0023551488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713886,0.0011983564,0.000114067014,0.00054075435,0.00041304674,0.00059486844],"domain_scores_gemma":[0.99806875,0.0010741684,0.00033989796,0.00014183194,0.0001482428,0.00022708559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002896676,0.0014465558,0.0021848008,0.00068787806,0.0009475121,0.0028068053,0.0027289235,0.0023924126,0.0013741454],"category_scores_gemma":[0.0038133906,0.0008198239,0.0016577409,0.0009284525,0.0025346617,0.0036323383,0.0017713811,0.0013481914,0.00017771023],"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.00037957646,0.00019008356,0.0011484791,0.00013287715,0.00015057657,0.00072045176,0.00028378822,0.90146327,0.0032120305,0.07951042,0.0005737742,0.012234668],"study_design_scores_gemma":[0.000058697053,0.00018294707,0.00024671832,0.000009336562,0.000055440385,0.00022748078,0.00006989686,0.9634248,0.0006039641,0.03458023,0.00049996894,0.000040466814],"about_ca_topic_score_codex":0.0037993544,"about_ca_topic_score_gemma":0.0024443143,"teacher_disagreement_score":0.0037993544,"about_ca_system_score_codex":0.0019060576,"about_ca_system_score_gemma":0.0013151855,"threshold_uncertainty_score":0.015319288},"labels":[],"label_agreement":null},{"id":"W2057544104","doi":"10.1109/tcomm.2011.102011.090300","title":"EM-Based Adaptive Frequency Domain Estimation of Doppler Shifts with CRLB Analysis for CDMA Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Cramér–Rao bound; Code division multiple access; Computer science; Doppler effect; Algorithm; Upper and lower bounds; Electronic engineering; Frequency domain; Wireless; Spread spectrum; Estimation theory; Telecommunications; Engineering; Mathematics; Physics","score_opus":0.04737437104390624,"score_gpt":0.2645424523094379,"score_spread":0.21716808126553167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057544104","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.0024809365,0.000105054016,0.9969374,0.000028766852,0.0000061087685,0.0000053120893,0.000005484687,0.00008304396,0.00034795183],"genre_scores_gemma":[0.37724888,0.0008252523,0.61927,0.00012067107,0.000077053875,0.0001363524,0.00013339528,0.00009806458,0.0020903242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993655,0.00023851637,0.000026447735,0.00006805635,0.0002649422,0.00003648343],"domain_scores_gemma":[0.99798167,0.001448252,0.00013940613,0.00012356247,0.00028770507,0.000019368057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247392,0.00070011074,0.00050255895,0.0005923626,0.00023867958,0.000518795,0.00059425447,0.0006284644,0.001257043],"category_scores_gemma":[0.007503675,0.0003623038,0.00042884573,0.0006260444,0.0006569846,0.0009706939,0.0006001041,0.0009090422,0.00046225183],"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.000083315186,0.000040271723,0.00060102495,0.00010857513,0.000045859877,0.000059431877,0.00007887303,0.8733165,0.010497201,0.023061039,0.000871952,0.09123591],"study_design_scores_gemma":[0.000003867534,0.000013666937,0.000105786865,0.0000061999303,0.0000039319057,0.000028981205,0.000004773695,0.9954348,0.0019489358,0.0020620872,0.0003816018,0.000005253805],"about_ca_topic_score_codex":0.0020719978,"about_ca_topic_score_gemma":0.001736269,"teacher_disagreement_score":0.0020719978,"about_ca_system_score_codex":0.0004865572,"about_ca_system_score_gemma":0.0006364611,"threshold_uncertainty_score":0.0059482455},"labels":[],"label_agreement":null},{"id":"W2061432406","doi":"10.1109/tcomm.2006.881264","title":"Spectrally efficient differential space-time coding using non-full-diverse constellations","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spectral efficiency; Decoding methods; Constellation; Algorithm; Computer science; Space–time code; Coding (social sciences); Transmit diversity; Antenna (radio); Differential (mechanical device); Block code; Electronic engineering; Mathematics; Telecommunications; Fading; Engineering; Channel (broadcasting)","score_opus":0.018748700152623306,"score_gpt":0.2514995930429355,"score_spread":0.2327508928903122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061432406","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.021704957,0.00022571489,0.9749536,0.00012447554,0.000033749187,0.000026400558,0.0000277627,0.000102684055,0.0028006476],"genre_scores_gemma":[0.4616029,0.00047003166,0.53456193,0.00013410728,0.000056918245,0.00013242626,0.00014871926,0.00004919216,0.0028438275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999273,0.0002920845,0.00003473824,0.00006575439,0.0002731249,0.00006126757],"domain_scores_gemma":[0.9987739,0.00056768424,0.00013876917,0.0002889229,0.00016977743,0.000060909348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658778,0.00053808535,0.00062435813,0.00077075214,0.00043809172,0.0005623868,0.0006555545,0.0005663975,0.0013429835],"category_scores_gemma":[0.002891424,0.00020610171,0.0005098811,0.0008392211,0.0009333849,0.0011185735,0.0015797354,0.00073732913,0.0004639938],"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.00027802077,0.00008421999,0.00073272374,0.00026455178,0.000051882176,0.00040584206,0.000471602,0.19772351,0.052743237,0.5525733,0.0014489975,0.19322215],"study_design_scores_gemma":[0.0000673695,0.00028675637,0.0002973599,0.000046711662,0.000019874904,0.00080668845,0.00006283991,0.8786415,0.03830443,0.07173524,0.009671939,0.00005933527],"about_ca_topic_score_codex":0.00018718817,"about_ca_topic_score_gemma":0.00029668515,"teacher_disagreement_score":0.0013429835,"about_ca_system_score_codex":0.00042628346,"about_ca_system_score_gemma":0.00046649776,"threshold_uncertainty_score":0.0044927},"labels":[],"label_agreement":null},{"id":"W2062402845","doi":"10.1109/tcomm.2014.020314.130448","title":"On Signal Detection in the Presence of Weakly Correlated Noise over Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"McGill University","funders":"","keywords":"Fading; Cognitive radio; False alarm; Interference (communication); Detector; Noise (video); Computer science; Detection theory; Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Electronic engineering; Energy (signal processing); Statistics; Telecommunications; Mathematics; Artificial intelligence; Engineering; Wireless","score_opus":0.02110148743605466,"score_gpt":0.253279905763931,"score_spread":0.23217841832787633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062402845","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.062009733,0.0012550774,0.9350913,0.00020552857,0.000041924162,0.00004018813,0.000026347552,0.000113074406,0.0012168719],"genre_scores_gemma":[0.92144334,0.0017787174,0.07544115,0.00015823568,0.00014749524,0.00004684522,0.00003970235,0.00004129131,0.00090323365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943879,0.002992247,0.0002064219,0.0005482334,0.00143412,0.000431058],"domain_scores_gemma":[0.97097147,0.024886033,0.0015356998,0.0010680206,0.0013373188,0.0002014055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044349297,0.0013087179,0.001652402,0.0014413793,0.00055544474,0.001352146,0.001178667,0.0014035433,0.00060354196],"category_scores_gemma":[0.024578864,0.00052142004,0.0007274349,0.0012326374,0.0026767547,0.002401892,0.0015382929,0.0011884125,0.00019556744],"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.0009151458,0.00008733627,0.0036006393,0.00035977922,0.00021894758,0.00078546826,0.0002734275,0.86679363,0.016725801,0.04623516,0.0007048191,0.063299805],"study_design_scores_gemma":[0.000008345155,0.00008539157,0.00036953719,0.000015959233,0.000025873136,0.00018187081,0.000019924533,0.98980623,0.004021747,0.0053010625,0.00014455918,0.000019424895],"about_ca_topic_score_codex":0.0014023114,"about_ca_topic_score_gemma":0.0008524071,"teacher_disagreement_score":0.0044349297,"about_ca_system_score_codex":0.00089893874,"about_ca_system_score_gemma":0.00075238675,"threshold_uncertainty_score":0.023454428},"labels":[],"label_agreement":null},{"id":"W2062920601","doi":"10.1109/tcomm.2014.2356581","title":"Tag Modulation Silencing: Design and Application in RFID Anti-Collision Protocols","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"RFID technology advancements","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Collision; Decoding methods; Inefficiency; Frame (networking); Metric (unit); Capture effect; Modulation (music); Limit (mathematics); Collision problem; Radio-frequency identification; Computer network; Throughput; Telecommunications; Computer security; Engineering; Wireless","score_opus":0.026825044013103972,"score_gpt":0.28283549431265365,"score_spread":0.25601045029954966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062920601","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.013156891,0.00056742935,0.9837414,0.00010754333,0.000028691418,0.00007519894,0.00000861951,0.00017547858,0.002138687],"genre_scores_gemma":[0.654495,0.0011485456,0.34099776,0.00015657018,0.00008743596,0.00022750063,0.000032819113,0.000076873526,0.0027775236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946135,0.0001809,0.000038641734,0.000061311686,0.00021524364,0.000042590105],"domain_scores_gemma":[0.99914587,0.0003384272,0.00017598477,0.00010658148,0.00020452648,0.00002850483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760702,0.00050412136,0.0003023726,0.00037115856,0.0002807292,0.00078935426,0.0011883175,0.0007608595,0.0006776003],"category_scores_gemma":[0.0017909961,0.00024048437,0.00024501508,0.0004504931,0.0006382381,0.0008848651,0.0004829319,0.0005155307,0.00037558607],"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.0002200521,0.00018087214,0.002236028,0.00042365055,0.00007379347,0.0004542515,0.00041487179,0.35352987,0.2536337,0.14193688,0.0015879807,0.24530797],"study_design_scores_gemma":[0.000014598771,0.00027891775,0.00021624641,0.00001956906,0.000025782507,0.00030723208,0.000029157125,0.93560946,0.05003076,0.0076722223,0.005778104,0.000017911332],"about_ca_topic_score_codex":0.00037630575,"about_ca_topic_score_gemma":0.00049025513,"teacher_disagreement_score":0.0011883175,"about_ca_system_score_codex":0.00070552394,"about_ca_system_score_gemma":0.00048287184,"threshold_uncertainty_score":0.005118966},"labels":[],"label_agreement":null},{"id":"W2063601473","doi":"10.1109/tcomm.2013.031213.120686","title":"Outage Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Relay Networks in the Presence of Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"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":"Relay; Outage probability; Scheduling (production processes); Computer science; Hop (telecommunications); Interference (communication); Upper and lower bounds; Co-channel interference; Topology (electrical circuits); Single antenna interference cancellation; Channel state information; Channel (broadcasting); Relay channel; Closed-form expression; Computer network; Control theory (sociology); Fading; Mathematics; Telecommunications; Mathematical optimization; Wireless","score_opus":0.08063186284505632,"score_gpt":0.3159307185270514,"score_spread":0.2352988556819951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063601473","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.47351938,0.001973997,0.5115174,0.00064826186,0.00006980133,0.000037695918,0.00017036924,0.0002671684,0.0117958635],"genre_scores_gemma":[0.9952872,0.00030986912,0.0038215502,0.000020806057,0.00002165546,0.000009882571,0.000021619553,0.000013819291,0.00049343915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00034234262,0.000035789664,0.00007906025,0.00025064292,0.00017806192],"domain_scores_gemma":[0.99195576,0.0062367744,0.00074772123,0.00028433083,0.0006248151,0.0001505928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019891832,0.0005687125,0.00085422513,0.0005706507,0.00056716613,0.0010611305,0.00070198945,0.00062092574,0.0007366068],"category_scores_gemma":[0.007537999,0.000377567,0.00031441578,0.000786086,0.0011357507,0.00093490025,0.0008079377,0.000495187,0.00011891649],"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.00016063158,0.000025422225,0.0020510608,0.000072517105,0.000035293848,0.0005937191,0.0001598481,0.9626988,0.0038580801,0.022776112,0.00049483293,0.007073677],"study_design_scores_gemma":[0.0000032736784,0.000019890405,0.00031765853,0.000003898713,0.000008055049,0.00009349525,0.000033207016,0.9954295,0.000366947,0.0036106566,0.00010686784,0.0000065154936],"about_ca_topic_score_codex":0.003521258,"about_ca_topic_score_gemma":0.0020679582,"teacher_disagreement_score":0.003521258,"about_ca_system_score_codex":0.0017289888,"about_ca_system_score_gemma":0.0007520768,"threshold_uncertainty_score":0.012544692},"labels":[],"label_agreement":null},{"id":"W2064875147","doi":"10.1109/tcomm.2014.050714.130586","title":"Distributed Collaborative Beamforming in the Presence of Angular Scattering","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":24,"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":"Scattering; Beamforming; Monochromatic color; Channel (broadcasting); Topology (electrical circuits); Physics; Noise (video); Plane wave; Power (physics); Computer science; Mathematics; Optics; Telecommunications; Combinatorics; Quantum mechanics","score_opus":0.0236013063430094,"score_gpt":0.2512918874048781,"score_spread":0.22769058106186874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064875147","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.0046175537,0.00013307326,0.9941155,0.000049179762,0.000022018914,0.000008392188,0.000011218119,0.000054924138,0.0009881651],"genre_scores_gemma":[0.6187791,0.0011164364,0.37122598,0.0002366498,0.00014190045,0.00018806287,0.00013912679,0.00006559143,0.008107037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905556,0.00027974715,0.000036833968,0.00021847758,0.00029593694,0.00011339906],"domain_scores_gemma":[0.99877554,0.0006530425,0.0001682752,0.00012988379,0.00022515866,0.000048175345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010168435,0.0010485481,0.0010257164,0.000320243,0.00041672387,0.0010485287,0.0010678682,0.0011911783,0.0009686572],"category_scores_gemma":[0.0022256454,0.00054223096,0.0005842992,0.00073824846,0.0010389244,0.0013224517,0.0013867478,0.0010826441,0.00047685212],"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.00016909518,0.000027877606,0.00053463376,0.00013593516,0.000082519175,0.00030828017,0.00015201529,0.8973542,0.017325683,0.04123886,0.0008234847,0.041847467],"study_design_scores_gemma":[0.000018764062,0.000056881727,0.00012373811,0.000008189442,0.000017538383,0.000093905976,0.000025001495,0.98911893,0.002118617,0.007381528,0.0010223213,0.000014548695],"about_ca_topic_score_codex":0.0017916424,"about_ca_topic_score_gemma":0.0020155034,"teacher_disagreement_score":0.0017916424,"about_ca_system_score_codex":0.00056300603,"about_ca_system_score_gemma":0.000742134,"threshold_uncertainty_score":0.0053776503},"labels":[],"label_agreement":null},{"id":"W2065439483","doi":"10.1109/tcomm.2004.836559","title":"Accurate Simulation of Multiple Cross-Correlated Rician Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":57,"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; Queen's University","funders":"","keywords":"Rician fading; Autocorrelation; Fading; Computer science; Rayleigh fading; Fading distribution; Autoregressive model; Channel (broadcasting); Algorithm; Channel state information; Wireless; Electronic engineering; Mathematics; Statistics; Telecommunications; Engineering","score_opus":0.04097646254708521,"score_gpt":0.3210827001431497,"score_spread":0.2801062375960645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065439483","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.36577865,0.00020896517,0.62261057,0.00028563596,0.000051963878,0.00007101509,0.00016126662,0.00058173784,0.010250183],"genre_scores_gemma":[0.97068673,0.00010891845,0.027936157,0.000023424509,0.000007025369,0.000045447458,0.0000793735,0.000022402335,0.0010905497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997253,0.00007152294,0.000011990804,0.000029455587,0.000120440905,0.000041187366],"domain_scores_gemma":[0.999019,0.0006001798,0.00008005263,0.00012679696,0.00014872481,0.000025151465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041148567,0.00032094965,0.00046852138,0.00023942786,0.00024049974,0.00050590845,0.00047026644,0.0006370822,0.0009933624],"category_scores_gemma":[0.0025157412,0.00019606877,0.00027685228,0.00032659734,0.00041155764,0.0005895835,0.00035749597,0.0005459326,0.00011599564],"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.000013795804,0.000010802026,0.00026678538,0.000008325566,0.0000047426743,0.000028569219,0.000023358156,0.99041593,0.0013758366,0.005675102,0.00007288111,0.002103926],"study_design_scores_gemma":[0.0000021152605,0.0000056521208,0.000036063364,7.62301e-7,9.182819e-7,0.000005363593,0.0000023805658,0.99857557,0.00064449763,0.00061580405,0.000109612025,0.0000012978238],"about_ca_topic_score_codex":0.002991341,"about_ca_topic_score_gemma":0.0017935068,"teacher_disagreement_score":0.002991341,"about_ca_system_score_codex":0.00047245994,"about_ca_system_score_gemma":0.0006010589,"threshold_uncertainty_score":0.005947888},"labels":[],"label_agreement":null},{"id":"W2065913119","doi":"10.1109/tcomm.2012.040212.100193","title":"Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"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":"Relay; Relay channel; Computer science; Power (physics); Wireless; Computer network; Telecommunications","score_opus":0.05007567618113382,"score_gpt":0.3140893679192075,"score_spread":0.26401369173807365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065913119","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.040186375,0.0004981069,0.949783,0.00021651444,0.000039174844,0.00010977661,0.000054464406,0.00006128009,0.00905136],"genre_scores_gemma":[0.8351597,0.0009805206,0.15885144,0.0000858998,0.000051660965,0.0003097381,0.000039627066,0.000026431526,0.004494992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00052473065,0.00005422713,0.00015320639,0.00013573412,0.0001202665],"domain_scores_gemma":[0.99889165,0.00069521705,0.00017090703,0.00005945775,0.0001350168,0.000047764803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091738,0.0015339982,0.0012557781,0.0005406041,0.0005609323,0.00102914,0.0012956582,0.0010356461,0.002238692],"category_scores_gemma":[0.002883205,0.00054850697,0.00051329285,0.0009975857,0.0010692832,0.0014688225,0.0011668041,0.0006361364,0.00040798285],"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.00017809939,0.00012136281,0.00059024245,0.00019600222,0.00007727735,0.00037547736,0.00013124051,0.85618556,0.0065545826,0.09118185,0.0010762465,0.043332104],"study_design_scores_gemma":[0.00004728071,0.00014101098,0.000096584365,0.000017283113,0.000039686445,0.00014404937,0.000058995924,0.9660696,0.0014588889,0.031068603,0.00083429395,0.00002378569],"about_ca_topic_score_codex":0.0012019571,"about_ca_topic_score_gemma":0.0016002632,"teacher_disagreement_score":0.002238692,"about_ca_system_score_codex":0.00088961876,"about_ca_system_score_gemma":0.00080064265,"threshold_uncertainty_score":0.007489145},"labels":[],"label_agreement":null},{"id":"W2067125863","doi":"10.1109/tcomm.2014.2336245","title":"Source–Channel Communication Over Phase-Incoherent Multiuser Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"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","keywords":"Channel (broadcasting); Computer science; Context (archaeology); Interference (communication); Relay; Coding (social sciences); Cognitive radio; Asynchronous communication; Topology (electrical circuits); Algorithm; Theoretical computer science; Wireless; Mathematics; Telecommunications; Physics; Statistics; Combinatorics","score_opus":0.05591394083249561,"score_gpt":0.31878063408418217,"score_spread":0.26286669325168655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067125863","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.116761535,0.00078289607,0.872184,0.00042292857,0.00006188284,0.00005715177,0.00014000683,0.000120664896,0.009468934],"genre_scores_gemma":[0.972843,0.0007986083,0.023545392,0.00009420433,0.00007113873,0.000077355326,0.000063650354,0.000019174213,0.0024874392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989285,0.00036028202,0.000033859487,0.00015657871,0.0003080298,0.00021269922],"domain_scores_gemma":[0.99343216,0.004836393,0.00084903766,0.0002810964,0.00050626125,0.00009501595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013224946,0.0011236849,0.00069215335,0.0005587198,0.0005713701,0.0009786101,0.0010073071,0.0012510486,0.0012698948],"category_scores_gemma":[0.0069838497,0.00041608754,0.0004729872,0.0008587807,0.0018112365,0.0016859255,0.0012527657,0.0011453601,0.0002524723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016414435,0.000061605104,0.00090243673,0.00020704839,0.00007418313,0.00057719304,0.0003425623,0.76100105,0.0074262377,0.22111495,0.00058803294,0.0075405873],"study_design_scores_gemma":[0.000015053445,0.00005825032,0.00021277435,0.000012396331,0.000025864822,0.000121509256,0.000050379684,0.9703386,0.0017533365,0.026972933,0.00042190216,0.000016952925],"about_ca_topic_score_codex":0.0024303682,"about_ca_topic_score_gemma":0.0015345387,"teacher_disagreement_score":0.0024303682,"about_ca_system_score_codex":0.0010584787,"about_ca_system_score_gemma":0.00079341826,"threshold_uncertainty_score":0.00767982},"labels":[],"label_agreement":null},{"id":"W2067303882","doi":"10.1109/tcomm.2012.051012.100285a","title":"Channel-Selective Multi-Cell Digital Predistorter for Multi-Carrier Transmitters","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Predistortion; Intermodulation; Adjacent channel power ratio; Electronic engineering; Adjacent channel; Amplifier; Wideband; Computer science; Nonlinear distortion; Transmitter; Channel (broadcasting); Engineering; Telecommunications; CMOS","score_opus":0.05653248325612453,"score_gpt":0.2824551572268547,"score_spread":0.22592267397073018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067303882","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.083389506,0.0011683888,0.9099591,0.00011942468,0.00011175919,0.000059195612,0.00005996317,0.0006782039,0.004454383],"genre_scores_gemma":[0.600742,0.0009196953,0.39172754,0.0001476545,0.00009808698,0.00006113788,0.00011236808,0.000053477477,0.006137937],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998653,0.000018641222,0.000006536356,0.000020371788,0.000076209784,0.000012905934],"domain_scores_gemma":[0.9998091,0.00007369296,0.000030872634,0.000030542098,0.000047573485,0.000008325986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013545399,0.00027168434,0.00017000706,0.00028716328,0.00022755895,0.00031464547,0.0004826406,0.00027562396,0.0022436727],"category_scores_gemma":[0.00033674086,0.00017508524,0.00019287264,0.00023201335,0.00015529583,0.00045534284,0.00028047478,0.00048361803,0.00069543783],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022880199,0.00003372387,0.00053108786,0.0001902616,0.000028215536,0.0002662244,0.00014719843,0.01730992,0.7338739,0.005089301,0.0010295034,0.24127188],"study_design_scores_gemma":[0.00005148714,0.0005218532,0.0017255787,0.000038005932,0.000063793195,0.0022641933,0.000058920283,0.22136444,0.74621016,0.0012922793,0.026367122,0.000042106178],"about_ca_topic_score_codex":0.00026847413,"about_ca_topic_score_gemma":0.0009533342,"teacher_disagreement_score":0.0022436727,"about_ca_system_score_codex":0.00022271027,"about_ca_system_score_gemma":0.00024342471,"threshold_uncertainty_score":0.007505834},"labels":[],"label_agreement":null},{"id":"W2067709532","doi":"10.1109/26.957406","title":"Multiuser channel estimation for detection of cochannel signals","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Time division multiple access; Multiuser detection; Fading; Channel (broadcasting); Computer science; Key (lock); Context (archaeology); Electronic engineering; Interference (communication); Code division multiple access; Telecommunications; Engineering; Computer security","score_opus":0.03899073006356722,"score_gpt":0.29583215663037976,"score_spread":0.2568414265668125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067709532","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.002370772,0.00035704102,0.99614835,0.000039586037,0.000025946827,0.000012790691,0.00002799454,0.00024127636,0.00077612436],"genre_scores_gemma":[0.19116174,0.0008587165,0.80247104,0.00015854852,0.0001318271,0.000115953546,0.00023692449,0.00008327348,0.004781825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922526,0.00023093446,0.0000336036,0.00014639564,0.00029901045,0.000064824046],"domain_scores_gemma":[0.99913967,0.00043339547,0.000056089313,0.0001570881,0.00019238448,0.000021311873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792337,0.0005389279,0.000593797,0.00055623386,0.00029814913,0.0004502278,0.0005600914,0.00074230693,0.0027014383],"category_scores_gemma":[0.0032387127,0.00029705392,0.00036448007,0.00050101214,0.0003655069,0.0006239866,0.0007219982,0.0007460517,0.0017761708],"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.00044892542,0.000089643145,0.0011210353,0.00038784402,0.0001200613,0.00028237005,0.00020925967,0.09597017,0.21453014,0.052667644,0.0042845653,0.6298883],"study_design_scores_gemma":[0.00003190516,0.00022024178,0.0017313504,0.00006181963,0.00004477181,0.0006501137,0.000025763155,0.84644306,0.111288674,0.021937516,0.017497748,0.000066951034],"about_ca_topic_score_codex":0.0008702086,"about_ca_topic_score_gemma":0.0016640701,"teacher_disagreement_score":0.0027014383,"about_ca_system_score_codex":0.00024603432,"about_ca_system_score_gemma":0.0005873213,"threshold_uncertainty_score":0.009037197},"labels":[],"label_agreement":null},{"id":"W2070061930","doi":"10.1109/tcomm.2012.061112.11-551","title":"Exact Analysis of Dual-Hop AF Maximum End-to-End SNR Relay Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"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":"Relay; Relay channel; Nakagami distribution; Rayleigh fading; Rician fading; Channel state information; Computer science; Diversity gain; Selection (genetic algorithm); Fading; Hop (telecommunications); Signal-to-noise ratio (imaging); Topology (electrical circuits); Probability density function; Maximal-ratio combining; Cumulative distribution function; Mathematics; Channel (broadcasting); Telecommunications; Wireless; Statistics; Physics","score_opus":0.05600481566002874,"score_gpt":0.3132762628461942,"score_spread":0.25727144718616546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070061930","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.02037506,0.00057737425,0.9740796,0.00011046316,0.000023055973,0.000034009332,0.000057893543,0.0001744989,0.0045679663],"genre_scores_gemma":[0.88003916,0.0012210775,0.114018366,0.00010260478,0.00005894159,0.00016383099,0.00015087493,0.00007927488,0.0041658124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981053,0.00048571048,0.00007604227,0.00016223727,0.00094645657,0.00022423253],"domain_scores_gemma":[0.99266726,0.005187064,0.0004576374,0.0005074336,0.0010967068,0.00008395149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025633252,0.0010046456,0.0011540942,0.00087165757,0.0004587793,0.0013732716,0.0013315026,0.00075660436,0.0026566756],"category_scores_gemma":[0.013750815,0.00061182556,0.0005825482,0.00095452345,0.0010425707,0.00218763,0.0013005653,0.0007621156,0.00063226675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010653763,0.000027625128,0.0006724197,0.00011651717,0.000033030894,0.00019626746,0.00014848639,0.9121082,0.0036748666,0.05489598,0.0006669628,0.027353138],"study_design_scores_gemma":[0.0000053574113,0.00002269413,0.00015473418,0.000010601101,0.000008241356,0.0001214804,0.000018408666,0.9884298,0.0009642908,0.009912975,0.00034305468,0.000008399054],"about_ca_topic_score_codex":0.0019887886,"about_ca_topic_score_gemma":0.0015930414,"teacher_disagreement_score":0.0026566756,"about_ca_system_score_codex":0.0019458446,"about_ca_system_score_gemma":0.0012941234,"threshold_uncertainty_score":0.014118135},"labels":[],"label_agreement":null},{"id":"W2070394551","doi":"10.1109/tcomm.2009.12.080396","title":"Bit-interleaved coded modulation for hybrid RF/FSO systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":148,"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":"Computer science; Electronic engineering; Radio frequency; Transmitter; Hybrid system; Fading; Code (set theory); Modulation (music); Bit error rate; Channel (broadcasting); Communications system; Telecommunications; Engineering; Physics","score_opus":0.03391046944717376,"score_gpt":0.26744762139241707,"score_spread":0.2335371519452433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070394551","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.1611071,0.0010608105,0.8308635,0.0002019619,0.00006237911,0.00004567864,0.000035519235,0.00029858822,0.0063244537],"genre_scores_gemma":[0.86121255,0.00027463373,0.13638581,0.00007456684,0.000045383134,0.000040619732,0.000031332154,0.000014248469,0.0019208797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978894,0.000053547814,0.000009797963,0.000019134675,0.000106446045,0.000022213851],"domain_scores_gemma":[0.99950457,0.00021303876,0.00007717688,0.00008167806,0.00010386711,0.0000195915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028838144,0.0003455066,0.00026595427,0.00029278078,0.00025149377,0.00038928995,0.00046697044,0.00040395916,0.000969038],"category_scores_gemma":[0.0009055505,0.00011140848,0.000106546046,0.00029417133,0.0004399832,0.0004924986,0.0004988199,0.0003780125,0.00027100887],"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.0007372321,0.0001381021,0.0025484902,0.00032081324,0.00008415983,0.00037843818,0.00037777325,0.25937146,0.22963928,0.10651074,0.0017515301,0.39814207],"study_design_scores_gemma":[0.000037257316,0.00017660148,0.00043860447,0.000028433917,0.000025974448,0.00024295144,0.000022732798,0.95883536,0.025631739,0.01032401,0.0042076726,0.000028587021],"about_ca_topic_score_codex":0.0003912066,"about_ca_topic_score_gemma":0.00097481394,"teacher_disagreement_score":0.000969038,"about_ca_system_score_codex":0.0002601316,"about_ca_system_score_gemma":0.0001867277,"threshold_uncertainty_score":0.0032417774},"labels":[],"label_agreement":null},{"id":"W2072132013","doi":"10.1109/tcomm.2013.070213.120264","title":"Distributed Joint Source-Channel Coding Using Unequal Error Protection LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of Manitoba","funders":"","keywords":"Low-density parity-check code; Code word; Algorithm; Computer science; Distributed source coding; Channel (broadcasting); Binary symmetric channel; Turbo code; Binary number; Theoretical computer science; Decoding methods; Forward error correction; Variable-length code; Source code; Error detection and correction; Mathematics; Telecommunications; Arithmetic","score_opus":0.12038957945736296,"score_gpt":0.3059059524873597,"score_spread":0.18551637302999674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072132013","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.011332413,0.00010112622,0.98704183,0.000066709494,0.000010439858,0.000040235824,0.000034544224,0.0001650775,0.0012076383],"genre_scores_gemma":[0.62057614,0.00030390572,0.37636846,0.000068644214,0.000030352294,0.00024929253,0.00014076057,0.000049376984,0.0022131235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837023,0.0006196736,0.00005938445,0.00020373138,0.00062276673,0.00012421505],"domain_scores_gemma":[0.9980368,0.00096751616,0.00027497372,0.00039155176,0.000266053,0.00006313777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589096,0.0008519004,0.0008351444,0.0006539165,0.0004880404,0.00074264733,0.0010968267,0.00073533354,0.0008173601],"category_scores_gemma":[0.0034560615,0.0003486322,0.00048448134,0.0010647572,0.0011526665,0.0010730416,0.0015833268,0.0011518779,0.00030124353],"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.00024303002,0.00007585604,0.00070149783,0.0001761806,0.00004874796,0.00017691235,0.00021617042,0.783832,0.02724277,0.10830428,0.00070355705,0.078278944],"study_design_scores_gemma":[0.000039311893,0.00008756036,0.00010607563,0.000022206497,0.00001690532,0.00009468263,0.000014471488,0.9629162,0.016399479,0.018556308,0.0017250498,0.00002175019],"about_ca_topic_score_codex":0.0011497309,"about_ca_topic_score_gemma":0.0018033664,"teacher_disagreement_score":0.0011589096,"about_ca_system_score_codex":0.00092688145,"about_ca_system_score_gemma":0.0014461647,"threshold_uncertainty_score":0.0067250133},"labels":[],"label_agreement":null},{"id":"W2072734326","doi":"10.1109/tcomm.2011.063011.100706","title":"Multilevel Coding with General Decoding Metrics and Rateless Transmission","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Decoding methods; Algorithm; Code rate; MIMO; Coding (social sciences); Fading; Transmission (telecommunications); Channel (broadcasting); Telecommunications; Mathematics; Statistics","score_opus":0.06360568148206715,"score_gpt":0.27028891310012526,"score_spread":0.20668323161805813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072734326","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.011132173,0.0010155508,0.9799865,0.00037596351,0.000072383045,0.000031253254,0.00006229528,0.00019323823,0.00713065],"genre_scores_gemma":[0.585455,0.0019531334,0.40697053,0.00045827343,0.00027215836,0.00017205032,0.00017691434,0.00018403586,0.0043578907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878734,0.00038550197,0.00005861261,0.000116213465,0.000554306,0.00009796949],"domain_scores_gemma":[0.99759173,0.0009889234,0.00038309413,0.00045326975,0.00053264253,0.000050354058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580521,0.00074639806,0.00049499917,0.0008849174,0.00031819395,0.0011015895,0.0008692063,0.00088180025,0.0010280571],"category_scores_gemma":[0.0070714816,0.00025264858,0.00037804944,0.0009568029,0.0012943612,0.0016441928,0.0011618802,0.0015553508,0.0004202642],"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.000055791472,0.00001559387,0.00042826872,0.00010363302,0.000017659288,0.000120373115,0.0001531959,0.13738734,0.012064706,0.79195094,0.0013496104,0.056352925],"study_design_scores_gemma":[0.000009657838,0.00007351553,0.00022011911,0.000044275057,0.000010824284,0.00019550856,0.00002122261,0.7776914,0.008020638,0.20777425,0.0058922553,0.00004636903],"about_ca_topic_score_codex":0.0011072983,"about_ca_topic_score_gemma":0.00067063235,"teacher_disagreement_score":0.0012654322,"about_ca_system_score_codex":0.0012654322,"about_ca_system_score_gemma":0.0007426275,"threshold_uncertainty_score":0.00918144},"labels":[],"label_agreement":null},{"id":"W2072997002","doi":"10.1109/tcomm.2013.052013.120900","title":"Ergodic Capacity Analysis for Interference-Limited AF Multi-Hop Relaying Channels in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"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":"Fading; Nakagami distribution; Ergodic theory; Topology (electrical circuits); Computer science; Interference (communication); Moment-generating function; Channel capacity; Co-channel interference; Mathematics; Telecommunications; Channel (broadcasting); Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.13684191084836556,"score_gpt":0.31659228402133416,"score_spread":0.1797503731729686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072997002","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.12217034,0.0032292213,0.8476019,0.00045400902,0.00005944493,0.000053169035,0.0003380856,0.00044323146,0.02565065],"genre_scores_gemma":[0.9857965,0.0014450432,0.010366049,0.000057105066,0.00007645059,0.00005242439,0.00011322103,0.000054836597,0.0020382595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.0001573749,0.000021261158,0.00004490577,0.00021350753,0.00014441257],"domain_scores_gemma":[0.9968094,0.0021968225,0.0002773045,0.00017947562,0.00046948795,0.00006740762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096452236,0.00094079546,0.00063300657,0.0013059686,0.00044385792,0.000929783,0.00077114877,0.00051545014,0.0017314235],"category_scores_gemma":[0.0051502082,0.00021271246,0.00051838794,0.0011682571,0.0013283247,0.0011267312,0.00077782536,0.000750364,0.00038623423],"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.00003568505,0.000015376649,0.0004983073,0.00007576523,0.000025373263,0.00024423242,0.00011929746,0.912255,0.0037876423,0.07632231,0.0006323692,0.0059886416],"study_design_scores_gemma":[0.0000011109695,0.000008222006,0.00022838524,0.000011921492,0.0000070709666,0.00006924781,0.000020990301,0.98753566,0.0008232167,0.010992077,0.00029231567,0.000009774587],"about_ca_topic_score_codex":0.004886625,"about_ca_topic_score_gemma":0.002569691,"teacher_disagreement_score":0.004886625,"about_ca_system_score_codex":0.0019953914,"about_ca_system_score_gemma":0.00087229605,"threshold_uncertainty_score":0.014477611},"labels":[],"label_agreement":null},{"id":"W2073833448","doi":"10.1109/tcomm.2007.910687","title":"Explicit Analytical Expressions for Outage and Error Rate of Diversity Cellular Systems in the Presence of Multiple Interferers and Correlated Rayleigh Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":15,"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; Nortel (Canada)","funders":"","keywords":"Rayleigh fading; Phase-shift keying; Maximal-ratio combining; Fading; Interference (communication); Mathematics; Signal-to-noise ratio (imaging); Statistics; Bit error rate; Diversity combining; Fading distribution; Electronic engineering; Telecommunications; Algorithm; Computer science; Engineering; Decoding methods","score_opus":0.06046028086385841,"score_gpt":0.29662459081188003,"score_spread":0.23616430994802162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073833448","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.073300414,0.005479878,0.8887429,0.0007635554,0.00011143484,0.00006613058,0.00040416047,0.0005025492,0.030628864],"genre_scores_gemma":[0.9388192,0.0053921947,0.048095748,0.00016046762,0.00018287882,0.000192696,0.00030172535,0.00014003272,0.006714993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873525,0.00040416652,0.000056369205,0.00007472437,0.0005396614,0.0001899022],"domain_scores_gemma":[0.9907952,0.0068731396,0.0007285522,0.00041071343,0.0011163572,0.000076108365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027031347,0.00134482,0.00094585645,0.0013330715,0.00056813954,0.0017323688,0.0013836141,0.0014102854,0.0036755216],"category_scores_gemma":[0.019242177,0.00059440965,0.00054460845,0.0016539554,0.0014243007,0.0018063327,0.0010287772,0.0011228663,0.000920275],"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.0000484199,0.00003114731,0.0007538814,0.00022161285,0.000027763926,0.00032609978,0.0002778243,0.8484436,0.0026782274,0.13184428,0.0012758885,0.014071262],"study_design_scores_gemma":[0.0000072858566,0.000020102203,0.0003802787,0.00007349961,0.000015946496,0.00024915655,0.00006671143,0.9716794,0.00071501225,0.02608767,0.000684177,0.000020746293],"about_ca_topic_score_codex":0.002140186,"about_ca_topic_score_gemma":0.0025102238,"teacher_disagreement_score":0.0036755216,"about_ca_system_score_codex":0.0018115937,"about_ca_system_score_gemma":0.00089664455,"threshold_uncertainty_score":0.014295697},"labels":[],"label_agreement":null},{"id":"W2074931698","doi":"10.1109/tcomm.2012.082812.110817","title":"LDGM-Based Multiple Description Coding for Finite Alphabet Sources","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Binary number; Mathematics; Algorithm; Coding (social sciences); Rate–distortion theory; Distortion (music); Upper and lower bounds; Rate distortion; Computer science; Statistics; Arithmetic; Bandwidth (computing); Telecommunications; Mathematical analysis","score_opus":0.08652453606989656,"score_gpt":0.2955598895495641,"score_spread":0.2090353534796675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074931698","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.009599841,0.00026104294,0.988893,0.00011242413,0.00001696564,0.000031460488,0.00004652694,0.00017018948,0.0008684386],"genre_scores_gemma":[0.51319283,0.0004728274,0.4833558,0.00021291035,0.000045340268,0.00015761069,0.00030828733,0.00005436776,0.002200123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902654,0.00036421823,0.00005343946,0.0000878244,0.00040200603,0.00006585319],"domain_scores_gemma":[0.9984174,0.0008977575,0.00015968086,0.0002812744,0.00020552489,0.000038339418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014796618,0.00050909416,0.000671013,0.0006168322,0.00034547184,0.00055340386,0.0013962766,0.0008192678,0.0010605424],"category_scores_gemma":[0.0044848407,0.00020866272,0.00043465185,0.00096669764,0.00067069783,0.0015061242,0.0014935903,0.00105216,0.00035225085],"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.00048900873,0.000074823685,0.00057219184,0.0003543457,0.0000550414,0.00032200408,0.00034829444,0.5191197,0.03085059,0.16123362,0.0019193867,0.28466094],"study_design_scores_gemma":[0.000031420695,0.00007223387,0.00006380225,0.00001885266,0.000009189227,0.00013866212,0.000012146899,0.9691872,0.008866386,0.020158492,0.0014202467,0.00002131831],"about_ca_topic_score_codex":0.001412795,"about_ca_topic_score_gemma":0.0011608801,"teacher_disagreement_score":0.0014796618,"about_ca_system_score_codex":0.00087377225,"about_ca_system_score_gemma":0.00096777175,"threshold_uncertainty_score":0.007825255},"labels":[],"label_agreement":null},{"id":"W2075397399","doi":"10.1109/tcomm.2012.100812.110547","title":"Reliable Communication over Non-Binary Insertion/Deletion Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"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":"Decodes; Algorithm; Binary number; Additive white Gaussian noise; Sequence (biology); Redundancy (engineering); Computer science; Decoding methods; Binary code; Set (abstract data type); Theoretical computer science; Mathematics; White noise; Arithmetic; Telecommunications","score_opus":0.02976522417575794,"score_gpt":0.2859943577366687,"score_spread":0.25622913356091076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075397399","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.16925953,0.000741863,0.8249852,0.0005788312,0.00008724621,0.00008486432,0.00013868003,0.00023988944,0.0038838806],"genre_scores_gemma":[0.9615081,0.00046229688,0.036038246,0.000071727794,0.000061597566,0.0000863114,0.00005490935,0.000024103418,0.0016927897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769294,0.0009416895,0.0000836381,0.0002567425,0.00065960287,0.00036539425],"domain_scores_gemma":[0.98731184,0.008958384,0.0018679283,0.0008025513,0.00090618746,0.00015313175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023896226,0.0010484917,0.0010932423,0.00071765046,0.00081603567,0.0011660863,0.0013784859,0.0013546054,0.0011118741],"category_scores_gemma":[0.009501469,0.00032362554,0.00032673497,0.0011469405,0.0020775246,0.0017783104,0.001520656,0.0010534995,0.0002979542],"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.00059306336,0.00005245701,0.0005346462,0.00031114748,0.00003536495,0.0005599797,0.00024253863,0.9104782,0.01413257,0.054389555,0.00057253725,0.018097892],"study_design_scores_gemma":[0.00004506624,0.00011481408,0.00013773485,0.000016121467,0.000016624115,0.00015795235,0.000054070675,0.97259593,0.006283402,0.02005966,0.00049024937,0.00002830207],"about_ca_topic_score_codex":0.0008543891,"about_ca_topic_score_gemma":0.00070584845,"teacher_disagreement_score":0.0023896226,"about_ca_system_score_codex":0.0007741772,"about_ca_system_score_gemma":0.00070116663,"threshold_uncertainty_score":0.012637675},"labels":[],"label_agreement":null},{"id":"W2075416647","doi":"10.1109/tcomm.2015.2409259","title":"Jitter-Robust Spectral Shaping in OFDM","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":2,"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","keywords":"Jitter; Orthogonal frequency-division multiplexing; Electronic engineering; Computer science; Reduction (mathematics); Sampling (signal processing); Spectral efficiency; Control theory (sociology); Mathematics; Telecommunications; Engineering","score_opus":0.14120831588563065,"score_gpt":0.29446452635827197,"score_spread":0.15325621047264132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075416647","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.0650625,0.0004900193,0.93089104,0.00007070001,0.000038094393,0.000026365331,0.000021010392,0.0003667335,0.0030335966],"genre_scores_gemma":[0.90621877,0.00034297403,0.092400104,0.00005010947,0.000045965495,0.000023673785,0.000023732784,0.000043894186,0.0008508668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.00014482083,0.000032589953,0.00008173268,0.00033786622,0.00005562416],"domain_scores_gemma":[0.99913675,0.0004542619,0.00015244736,0.00012441404,0.000112632224,0.000019463432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007255846,0.00038529534,0.00042172402,0.00031342843,0.00031672427,0.000566085,0.0004527013,0.0004205526,0.0005336288],"category_scores_gemma":[0.0029696682,0.00016728563,0.00024453385,0.0003909119,0.0004713669,0.0004440937,0.00050114514,0.0004101772,0.00017205106],"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.000502157,0.000077933044,0.0011796197,0.00017345925,0.000057192774,0.000274885,0.0002092863,0.7021347,0.121501945,0.03352941,0.000553278,0.13980608],"study_design_scores_gemma":[0.000012764043,0.00014458405,0.0003304451,0.0000132855475,0.000013608001,0.00013928,0.00001318236,0.96150035,0.032448236,0.004546568,0.0008221614,0.000015446467],"about_ca_topic_score_codex":0.00045152043,"about_ca_topic_score_gemma":0.0002585568,"teacher_disagreement_score":0.0007255846,"about_ca_system_score_codex":0.00038870404,"about_ca_system_score_gemma":0.0004300788,"threshold_uncertainty_score":0.0038372874},"labels":[],"label_agreement":null},{"id":"W2076579100","doi":"10.1109/tcomm.2015.2411266","title":"Cognitive and Energy Harvesting-Based D2D Communication in Cellular Networks: Stochastic Geometry Modeling and Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":347,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Stochastic geometry; Cognitive radio; Computer science; Energy harvesting; Computer network; Interference (communication); Transmitter; Cellular network; Channel (broadcasting); Stochastic geometry models of wireless networks; Wireless; Signal-to-interference-plus-noise ratio; Electronic engineering; Energy (signal processing); Radio resource management; Telecommunications; Wireless network; Engineering; Power (physics); Mathematics; Physics","score_opus":0.03234404328833789,"score_gpt":0.2432006864108595,"score_spread":0.21085664312252161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076579100","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.11170565,0.0025953178,0.86749125,0.0020222613,0.00015294753,0.0001274305,0.00053660554,0.00024676253,0.015121828],"genre_scores_gemma":[0.976596,0.0021241119,0.015110357,0.00024165794,0.0000915126,0.00013349016,0.00023983496,0.000050494513,0.005412543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991929,0.0002705111,0.000025820216,0.00012125774,0.00020207648,0.00018735042],"domain_scores_gemma":[0.9968832,0.0017889695,0.0005561177,0.0001191305,0.00048914703,0.00016340362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168385,0.0014267531,0.0011936198,0.0010310654,0.00083373464,0.0016344805,0.0014723003,0.001630129,0.0013224832],"category_scores_gemma":[0.0038951647,0.00067677005,0.0010926671,0.0012665717,0.0019934191,0.0013394883,0.0016051861,0.0011440744,0.00034874104],"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.000019738867,0.000017227041,0.0010355213,0.000029978635,0.000020706897,0.0001340484,0.00006578191,0.95058644,0.00067054277,0.0449162,0.0007621901,0.0017416109],"study_design_scores_gemma":[0.0000027805586,0.0000076258216,0.00016196135,0.0000036031795,0.0000052676487,0.000022176275,0.000021913733,0.99476707,0.0000789747,0.0046908865,0.00023097172,0.0000068377576],"about_ca_topic_score_codex":0.025168,"about_ca_topic_score_gemma":0.011118683,"teacher_disagreement_score":0.025168,"about_ca_system_score_codex":0.0033998794,"about_ca_system_score_gemma":0.0012655383,"threshold_uncertainty_score":0.050042987},"labels":[],"label_agreement":null},{"id":"W2077262688","doi":"10.1109/tcomm.2006.888584","title":"Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Binary number; Computer science; Code (set theory); Discrete mathematics; Mathematics; Arithmetic","score_opus":0.0390375926743596,"score_gpt":0.3129934600301889,"score_spread":0.27395586735582933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077262688","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.45421576,0.00022495397,0.53806794,0.0002256939,0.0000374523,0.00007358528,0.000073335876,0.0004266892,0.00665466],"genre_scores_gemma":[0.9482578,0.00007756477,0.04955096,0.000051887833,0.000009332254,0.000042595966,0.000070404974,0.000026272288,0.0019132235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873453,0.00039786528,0.00005319405,0.00016834021,0.0004355907,0.00021039377],"domain_scores_gemma":[0.99219316,0.0054917405,0.0006362015,0.00070037553,0.000793393,0.00018508571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016408516,0.000412002,0.00063458853,0.0005736948,0.00048109583,0.0010076761,0.0011646049,0.00076902326,0.00094030576],"category_scores_gemma":[0.008502157,0.00030263246,0.00037837593,0.0006218695,0.0012782295,0.001282469,0.001216465,0.00081251294,0.00022751902],"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.0003182135,0.000078887635,0.0025733553,0.000080249534,0.00005151609,0.00015661563,0.00024584407,0.8584367,0.007913482,0.102401435,0.0004221409,0.02732162],"study_design_scores_gemma":[0.0000086505825,0.000020541382,0.00010324646,0.0000031529812,0.0000031383383,0.000021020427,0.000009387989,0.9907645,0.0022143235,0.006762192,0.00008461841,0.0000052279534],"about_ca_topic_score_codex":0.0031108535,"about_ca_topic_score_gemma":0.0029415428,"teacher_disagreement_score":0.0031108535,"about_ca_system_score_codex":0.0015747127,"about_ca_system_score_gemma":0.0014281743,"threshold_uncertainty_score":0.011425376},"labels":[],"label_agreement":null},{"id":"W2079392607","doi":"10.1109/tcomm.2013.111613.130238","title":"Power Line Communications for Low-Voltage Power Grid Tomography","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":70,"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":"Power-line communication; Smart grid; Automatic meter reading; Grid; Computer science; Context (archaeology); Ranging; Electronic engineering; Power (physics); Electrical engineering; Topology (electrical circuits); Engineering; Telecommunications; Wireless","score_opus":0.020963960393625657,"score_gpt":0.25707845306525745,"score_spread":0.2361144926716318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079392607","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.0021440592,0.0012539693,0.9924475,0.0006236097,0.0000848241,0.000016527527,0.000034975663,0.00013908664,0.0032554474],"genre_scores_gemma":[0.36530602,0.006711872,0.6189574,0.000520819,0.00048336125,0.0001836684,0.00029749316,0.00019363484,0.0073456084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997285,0.00011147384,0.000010461342,0.000042111147,0.00009535963,0.000012130001],"domain_scores_gemma":[0.99932325,0.0004213832,0.00006853002,0.00009455249,0.00007387466,0.000018533738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003862221,0.00058827084,0.0003680598,0.00022982818,0.00031521023,0.0008254132,0.00059505133,0.0009023865,0.0038008254],"category_scores_gemma":[0.0022528868,0.00021788984,0.00030818582,0.00068005576,0.00072753686,0.0013778349,0.00091637176,0.0015931755,0.0007837994],"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.00010460719,0.00004265662,0.0012018343,0.00041844274,0.0000335823,0.00056206546,0.00016191136,0.42670217,0.020452192,0.31950966,0.010605954,0.22020501],"study_design_scores_gemma":[0.000010313642,0.000027304686,0.00028766223,0.000040861643,0.000010193466,0.00023520755,0.000029796702,0.89611155,0.0036240409,0.07946701,0.020139817,0.000016152486],"about_ca_topic_score_codex":0.0010495145,"about_ca_topic_score_gemma":0.0013248387,"teacher_disagreement_score":0.0038008254,"about_ca_system_score_codex":0.0004981955,"about_ca_system_score_gemma":0.0005156929,"threshold_uncertainty_score":0.012715101},"labels":[],"label_agreement":null},{"id":"W2079624325","doi":"10.1109/tcomm.2015.2389833","title":"Analyzing the Impact of Inter Cooperation Region Interference in Coordinated Multi-Point Uplink Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Telecommunications link; Ergodic theory; Base station; Coverage probability; Interference (communication); Computer science; Cellular network; Topology (electrical circuits); Parametric statistics; Stochastic geometry; Point (geometry); Mathematical optimization; Lattice (music); Mathematics; Telecommunications; Statistics; Physics; Mathematical analysis; Combinatorics","score_opus":0.05572548228033818,"score_gpt":0.3052779985076034,"score_spread":0.2495525162272652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079624325","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.38176367,0.0016035048,0.59365433,0.00051840534,0.00005654282,0.000051171457,0.00015761767,0.00024177301,0.02195309],"genre_scores_gemma":[0.99157023,0.00032817177,0.0070562973,0.000045591583,0.000025006391,0.000026528387,0.000034749406,0.00002835147,0.0008850292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990835,0.00039246771,0.000015325326,0.000068641566,0.0002216485,0.0002183385],"domain_scores_gemma":[0.99578434,0.0032116193,0.00038838235,0.00012885297,0.00037783163,0.000108927685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531239,0.0009168931,0.00068717793,0.0006419928,0.0004870723,0.0011111838,0.00082380517,0.0008416457,0.0008606652],"category_scores_gemma":[0.0059841466,0.00039235826,0.00045749298,0.0009060994,0.0011143395,0.0010419505,0.00096337707,0.0005794496,0.00013979462],"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.0000122606725,0.000005776225,0.00036889515,0.000007931712,0.000007923101,0.000049954535,0.000012755991,0.9964252,0.00039082163,0.002018733,0.00008127079,0.00061850174],"study_design_scores_gemma":[0.0000010958015,0.000012613314,0.0001912532,0.0000018733969,0.0000043049454,0.000016106433,0.000017451915,0.9985032,0.0002214359,0.0009703774,0.00005784064,0.0000023701793],"about_ca_topic_score_codex":0.00807528,"about_ca_topic_score_gemma":0.0042918315,"teacher_disagreement_score":0.00807528,"about_ca_system_score_codex":0.001822404,"about_ca_system_score_gemma":0.00083490566,"threshold_uncertainty_score":0.016056538},"labels":[],"label_agreement":null},{"id":"W2079882399","doi":"10.1109/tcomm.2012.010313.100669","title":"Relay Selection Schemes and Performance Analysis Approximations for Two-Way Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"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":"Relay; Selection (genetic algorithm); Computer science; Relay channel; Maximization; Block Error Rate; Cumulative distribution function; Signal-to-noise ratio (imaging); Overhead (engineering); Mathematical optimization; Computer network; Topology (electrical circuits); Mathematics; Telecommunications; Probability density function; Engineering; Statistics; Telecommunications link; Electrical engineering; Power (physics); Artificial intelligence","score_opus":0.036510521352791724,"score_gpt":0.28294165729959186,"score_spread":0.24643113594680013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079882399","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.01915587,0.002876311,0.967644,0.00018564299,0.000057676705,0.000060861603,0.000052569358,0.00020196318,0.009765138],"genre_scores_gemma":[0.84618616,0.0068510585,0.13828085,0.00014147695,0.00012370333,0.000237431,0.00013449772,0.000088245724,0.007956547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884593,0.0004738087,0.000041882333,0.00010040584,0.00040467686,0.0001331758],"domain_scores_gemma":[0.9960103,0.002790524,0.00031693824,0.00033704744,0.0004933103,0.000051899202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290273,0.0010524127,0.00074934255,0.0009864405,0.00045692353,0.0014423378,0.0009701225,0.0009487407,0.0018993872],"category_scores_gemma":[0.009478302,0.0003203679,0.00063975697,0.0015033102,0.0011456911,0.0017026139,0.00094380847,0.0013372615,0.0008408565],"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.000046972542,0.000028771028,0.0004609194,0.00014455074,0.000026452484,0.00014241965,0.0002940636,0.85943604,0.0030875655,0.11603972,0.000814225,0.019478185],"study_design_scores_gemma":[0.000003013282,0.00002614635,0.00010673516,0.000019242594,0.0000071898007,0.00009440029,0.000029457357,0.9859724,0.0005113593,0.012163399,0.0010567936,0.000009945998],"about_ca_topic_score_codex":0.0028721825,"about_ca_topic_score_gemma":0.0012066592,"teacher_disagreement_score":0.0028721825,"about_ca_system_score_codex":0.001498784,"about_ca_system_score_gemma":0.00052828476,"threshold_uncertainty_score":0.0121123195},"labels":[],"label_agreement":null},{"id":"W2080920551","doi":"10.1109/tcomm.2011.093011.100693","title":"Cognitive Base Stations in LTE/3GPP Femtocells: A Correlated Equilibrium Game-Theoretic Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":129,"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":"Macrocell; Femtocell; Base station; Telecommunications link; Cognitive radio; Computer science; Resource allocation; Node (physics); Game theory; Potential game; Frequency allocation; Computer network; Interference (communication); Mathematical optimization; Resource management (computing); LTE Advanced; Nash equilibrium; Wireless; Engineering; Telecommunications; Mathematics; Mathematical economics","score_opus":0.046166163700319104,"score_gpt":0.2544726297428994,"score_spread":0.2083064660425803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080920551","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.039443653,0.00019396227,0.94570345,0.00043408753,0.000039312883,0.00008750129,0.000042434014,0.000042649284,0.014013011],"genre_scores_gemma":[0.92501056,0.00031679418,0.06774886,0.0001662071,0.00003771977,0.00013188992,0.000027430804,0.000017233666,0.0065432927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.00040534502,0.000014860141,0.00007450215,0.00015784234,0.00011863124],"domain_scores_gemma":[0.9994986,0.00029208884,0.00005827293,0.000026641383,0.00007804632,0.00004637278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955579,0.000746354,0.00073801243,0.00034432035,0.00065385044,0.001374061,0.0011589939,0.0011777035,0.0014838101],"category_scores_gemma":[0.0016755019,0.0003680475,0.00058034476,0.00041251545,0.0015067224,0.0010153789,0.00091982883,0.0010109773,0.00018693453],"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.000043958236,0.000042753043,0.00027225565,0.000022765511,0.000027209046,0.00012958235,0.0000684094,0.8404501,0.0008648588,0.15294804,0.0005161609,0.004613854],"study_design_scores_gemma":[0.0000118468415,0.000017764214,0.00006242957,0.000003793917,0.0000066325097,0.00001811358,0.000025424499,0.9767321,0.00020298797,0.02240614,0.0005063025,0.0000064145956],"about_ca_topic_score_codex":0.007832038,"about_ca_topic_score_gemma":0.007912167,"teacher_disagreement_score":0.007832038,"about_ca_system_score_codex":0.001685538,"about_ca_system_score_gemma":0.001670499,"threshold_uncertainty_score":0.015572906},"labels":[],"label_agreement":null},{"id":"W2080932185","doi":"10.1109/tcomm.2011.122111.110057","title":"Node Switching Rates of Opportunistic Relaying and Switch-and-Examine Relaying in Rician and Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Relay; Computer science; Nakagami distribution; Independent and identically distributed random variables; Rayleigh fading; Fading distribution; Channel (broadcasting); Electronic engineering; Computer network; Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Statistics; Physics; Power (physics)","score_opus":0.128837156170677,"score_gpt":0.3070029729815844,"score_spread":0.1781658168109074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080932185","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.6590503,0.0029189864,0.3137753,0.0002848893,0.00009138877,0.00021358355,0.00028721822,0.0003692361,0.023009127],"genre_scores_gemma":[0.98970836,0.0005562914,0.008581109,0.00002243028,0.000013887648,0.000049269995,0.00005765698,0.000020972062,0.0009899173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871755,0.00038049428,0.00007802551,0.00018913,0.00032835559,0.000306467],"domain_scores_gemma":[0.9895235,0.0074885963,0.0010986958,0.0008071029,0.00088674796,0.00019538376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031422146,0.00068702403,0.00078587,0.0009511341,0.0005095578,0.0013102894,0.00088627514,0.0006620286,0.0012162651],"category_scores_gemma":[0.014991903,0.00030770816,0.00048067624,0.000957397,0.0010906766,0.0013173562,0.0009992198,0.0006281183,0.00020829657],"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.0012509937,0.00014238358,0.0073425644,0.00037326352,0.00011481273,0.00060220336,0.0009182955,0.75862646,0.014908401,0.10056686,0.0018675079,0.113286205],"study_design_scores_gemma":[0.00004971684,0.0005510926,0.004341536,0.0000672522,0.00016266691,0.000999711,0.00051906874,0.9517942,0.013230272,0.02628845,0.0018944424,0.00010155766],"about_ca_topic_score_codex":0.0020629624,"about_ca_topic_score_gemma":0.0020538608,"teacher_disagreement_score":0.0031422146,"about_ca_system_score_codex":0.0015926128,"about_ca_system_score_gemma":0.0010730145,"threshold_uncertainty_score":0.016617775},"labels":[],"label_agreement":null},{"id":"W2083983191","doi":"10.1109/tcomm.2006.876849","title":"A Low-Complexity Method for Fixed-Rate Entropy-Constrained Vector Quantization","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrange multiplier; Vector quantization; Mathematics; Mathematical optimization; Quantization (signal processing); Algorithm; Constraint algorithm; Entropy (arrow of time); Iterative method","score_opus":0.048746259002279614,"score_gpt":0.3404887353094802,"score_spread":0.29174247630720057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083983191","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.00040934785,0.0000836748,0.9985877,0.000031731972,0.000025485737,0.000019947309,0.000013288989,0.0000871763,0.00074165745],"genre_scores_gemma":[0.047423013,0.00031061153,0.94919646,0.000079984784,0.000065177665,0.00015981334,0.00009842848,0.000111090456,0.002555468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938035,0.00014492689,0.000032230142,0.00007383317,0.00033616717,0.00003239346],"domain_scores_gemma":[0.9994981,0.00026082876,0.000037115053,0.00007546527,0.000113764145,0.000014711527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080079754,0.0006013855,0.0005877575,0.0006494883,0.00041267223,0.00071290374,0.001342814,0.00067978783,0.0044539245],"category_scores_gemma":[0.0026932496,0.00031389046,0.0005033639,0.0007495961,0.0006786466,0.0011702256,0.000973286,0.0015236079,0.0010696321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010186451,0.00006086855,0.0002154454,0.00022210924,0.000045415858,0.00011570755,0.0001112214,0.30536905,0.016566293,0.2949717,0.0049280594,0.37729222],"study_design_scores_gemma":[0.000016856382,0.000027389533,0.00004688803,0.000019170091,0.00000682784,0.00008802403,0.000006414719,0.9647593,0.0039709723,0.024125097,0.0069146827,0.000018417455],"about_ca_topic_score_codex":0.0017201524,"about_ca_topic_score_gemma":0.0019864268,"teacher_disagreement_score":0.0044539245,"about_ca_system_score_codex":0.000669377,"about_ca_system_score_gemma":0.0011187461,"threshold_uncertainty_score":0.01489985},"labels":[],"label_agreement":null},{"id":"W2084279706","doi":"10.1109/tcomm.2014.2347279","title":"DSL and PLC Co-Existence: An Interference Cancellation Approach","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Digital subscriber line; Interference (communication); Single antenna interference cancellation; Electronic engineering; Computer science; Power-line communication; Channel (broadcasting); Common-mode signal; Computer network; Engineering; Telecommunications; Power (physics); Digital signal processing; Physics","score_opus":0.040061322930697675,"score_gpt":0.27900908022469106,"score_spread":0.2389477572939934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084279706","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.008583703,0.00030649948,0.98496455,0.00018548554,0.000037818427,0.000029028739,0.00001438199,0.00016534959,0.00571325],"genre_scores_gemma":[0.59491223,0.0008641206,0.39281994,0.00029588654,0.0001875363,0.0001117495,0.00008283983,0.00006243979,0.010663217],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986307,0.0002554459,0.000038219972,0.00022992818,0.00071127724,0.0001344349],"domain_scores_gemma":[0.99889886,0.00048210827,0.00015072191,0.00011950407,0.0003022088,0.00004650696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258699,0.00087373226,0.0006347053,0.0011281021,0.00084289286,0.0011317752,0.001381318,0.0013160394,0.0017194811],"category_scores_gemma":[0.0019632454,0.00051158963,0.0006191886,0.0010176038,0.001256979,0.0014589299,0.0014174235,0.001225864,0.00054598367],"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.0004039067,0.00031732826,0.0060986644,0.00037212876,0.00027517724,0.0014578826,0.0007202552,0.29253072,0.07858385,0.12987742,0.0028295272,0.4865332],"study_design_scores_gemma":[0.000042301403,0.0001685625,0.0016075859,0.000033251454,0.000080995655,0.0007790268,0.00016260461,0.9528135,0.01808309,0.018264577,0.007906173,0.000058316007],"about_ca_topic_score_codex":0.0035604953,"about_ca_topic_score_gemma":0.0064835134,"teacher_disagreement_score":0.0035604953,"about_ca_system_score_codex":0.000877281,"about_ca_system_score_gemma":0.001637365,"threshold_uncertainty_score":0.0070795417},"labels":[],"label_agreement":null},{"id":"W2087905744","doi":"10.1109/tcomm.2014.012614.130747","title":"Towards Scalable Traffic Management in Cloud Data Centers","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":20,"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; Cloud computing; Virtual LAN; Scalability; Distributed computing; Column generation; Heuristic; Computer network; Mathematical optimization; Database","score_opus":0.05188230002339097,"score_gpt":0.2857047275059596,"score_spread":0.23382242748256862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087905744","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.06892078,0.00062077434,0.9238497,0.0008577416,0.00005670412,0.00009975144,0.00012434185,0.0007222243,0.004747961],"genre_scores_gemma":[0.79335064,0.00058277574,0.2036743,0.00024315545,0.000079447025,0.00011797485,0.00023518597,0.00015020985,0.001566274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993635,0.0002264801,0.00001683443,0.000072571456,0.0001613059,0.00015932889],"domain_scores_gemma":[0.9990075,0.00044879122,0.00010552194,0.00009413364,0.000235817,0.0001082893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012036883,0.0009157503,0.0007603329,0.0007300834,0.00071355863,0.0015569422,0.0011828279,0.0009020138,0.001361553],"category_scores_gemma":[0.0030705228,0.0003829711,0.0004991586,0.00096273574,0.0006659463,0.0016177293,0.0012360145,0.0012477612,0.00035305604],"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.000049187936,0.000042499778,0.00029741568,0.000028886136,0.000009248064,0.000023518847,0.000026743299,0.9683303,0.0028685736,0.007779115,0.0012186043,0.019325987],"study_design_scores_gemma":[0.0000032333594,0.000007635606,0.000027091879,0.0000019137226,0.000001332802,0.0000035210765,0.000010135233,0.9969091,0.00026492745,0.0025403788,0.00022955958,0.0000012186761],"about_ca_topic_score_codex":0.007569607,"about_ca_topic_score_gemma":0.005186497,"teacher_disagreement_score":0.007569607,"about_ca_system_score_codex":0.00133472,"about_ca_system_score_gemma":0.0022349886,"threshold_uncertainty_score":0.0150511265},"labels":[],"label_agreement":null},{"id":"W2088111058","doi":"10.1109/tcomm.2012.100512.120006","title":"Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"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":"Low-density parity-check code; Computer science; Algorithm; Bit error rate; Modulation (music); Error detection and correction; Electronic engineering; Turbo code; Block code; Linear code; Bandwidth (computing); Theoretical computer science; Mathematics; Decoding methods; Telecommunications; Engineering","score_opus":0.07044379227568483,"score_gpt":0.33031192657691716,"score_spread":0.25986813430123235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088111058","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.014998471,0.00024633584,0.9825289,0.000058971375,0.000021382943,0.000021673719,0.00002470707,0.00016686,0.0019327168],"genre_scores_gemma":[0.3239638,0.0004626756,0.6729905,0.00008805805,0.000036219688,0.00012004092,0.000095440635,0.00006311436,0.0021800648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997154,0.00009255787,0.000013015307,0.000030572515,0.00012618737,0.000022294029],"domain_scores_gemma":[0.99954695,0.00016863804,0.000052842974,0.00011359385,0.00009908049,0.000018814953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042734112,0.0003525784,0.00032490416,0.0005195259,0.00033197165,0.00044908808,0.0005632065,0.0004943398,0.0009691936],"category_scores_gemma":[0.0013575157,0.00018108748,0.00022794092,0.00042800032,0.00043061722,0.0004730758,0.000544407,0.0008159097,0.00040517247],"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.0001871387,0.000100516845,0.0013920243,0.00028440266,0.000037786423,0.00021140695,0.0002120071,0.25592607,0.175546,0.29407707,0.0017939071,0.2702317],"study_design_scores_gemma":[0.000017755241,0.000104267594,0.00032865076,0.000037088408,0.000012443478,0.0002578232,0.000010760947,0.899216,0.06054706,0.03363671,0.00580245,0.000028915294],"about_ca_topic_score_codex":0.00017169282,"about_ca_topic_score_gemma":0.0003688856,"teacher_disagreement_score":0.0009691936,"about_ca_system_score_codex":0.0002679747,"about_ca_system_score_gemma":0.00043667163,"threshold_uncertainty_score":0.0032423139},"labels":[],"label_agreement":null},{"id":"W2088219981","doi":"10.1109/tcomm.2013.021913.120620","title":"Diversity and Multiplexing for Near-Field Atmospheric Optical Communication","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplexing; Free-space optical communication; Electronic engineering; Computer science; Communications system; Antenna diversity; Crosstalk; Atmospheric turbulence; Optical communication; Diversity gain; Orthogonal frequency-division multiplexing; Field (mathematics); Telecommunications; Physics; Engineering; Mathematics; Turbulence; MIMO; Wireless","score_opus":0.027092420836269428,"score_gpt":0.24028600313595105,"score_spread":0.21319358229968163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088219981","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.12896037,0.0034803047,0.84505516,0.00039475362,0.00015651167,0.000032481177,0.00003961312,0.00012730766,0.0217535],"genre_scores_gemma":[0.9541999,0.0017541274,0.041032087,0.00008684641,0.00014296625,0.000023187695,0.000018435767,0.00001596752,0.0027264534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996917,0.00009365277,0.0000057227257,0.000023942217,0.00015496732,0.000030011459],"domain_scores_gemma":[0.99937063,0.00041818043,0.00006988943,0.000051238712,0.00007327605,0.000016796675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003477742,0.0003668432,0.00025283147,0.0002759279,0.00045687734,0.0005283109,0.00024549608,0.00044082644,0.0011962621],"category_scores_gemma":[0.0012076919,0.00011344112,0.00020879766,0.0002746185,0.00061633094,0.00081665016,0.00040611642,0.0005223525,0.00023986747],"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.00011438615,0.00006200389,0.00078229234,0.00025168064,0.00003772753,0.0003061026,0.00021128944,0.523837,0.08927997,0.3130343,0.0010271306,0.07105615],"study_design_scores_gemma":[0.0000044718468,0.00010184215,0.00030697143,0.000021062384,0.000009629094,0.0003605642,0.00004095463,0.9368908,0.012011812,0.04703993,0.0031895149,0.000022507771],"about_ca_topic_score_codex":0.00026148086,"about_ca_topic_score_gemma":0.00035924758,"teacher_disagreement_score":0.0011962621,"about_ca_system_score_codex":0.0004080225,"about_ca_system_score_gemma":0.00027902625,"threshold_uncertainty_score":0.0040019155},"labels":[],"label_agreement":null},{"id":"W2088849139","doi":"10.1109/tcomm.2004.840672","title":"Improved Decoding for Bluetooth Systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":20,"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":"Computer science; Decoding methods; Bluetooth; Detector; Network packet; Throughput; Bit error rate; Error detection and correction; Hamming distance; Discriminator; Real-time computing; Transmission (telecommunications); Computer hardware; Electronic engineering; Algorithm; Wireless; Computer network; Telecommunications; Engineering","score_opus":0.04660050196733913,"score_gpt":0.28936846116281334,"score_spread":0.24276795919547423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088849139","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.030912023,0.0028742272,0.9519637,0.0004311853,0.00035929677,0.000099797086,0.00010534402,0.0019313624,0.011323174],"genre_scores_gemma":[0.3638172,0.0028568276,0.60906965,0.0006628866,0.00048648554,0.00012763024,0.00044122216,0.00025163614,0.02228641],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878556,0.00020666105,0.00007434712,0.00013754414,0.00069145416,0.00010450264],"domain_scores_gemma":[0.99887604,0.00036311446,0.00009430903,0.00020040554,0.0004339937,0.000032133823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449361,0.0008128998,0.0006351313,0.0008893658,0.00039168634,0.00081281684,0.0008001861,0.0009637461,0.0033847159],"category_scores_gemma":[0.00268802,0.0003030121,0.00037567722,0.00070672034,0.0003506209,0.0010657939,0.0008627516,0.0011102749,0.00213373],"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.00069279043,0.00011764757,0.0018055257,0.00068424916,0.00012441807,0.0006352624,0.0002984007,0.049611423,0.23280181,0.065036796,0.0075662383,0.6406254],"study_design_scores_gemma":[0.00016037941,0.00082103413,0.0012489618,0.000251209,0.00016910178,0.0038470072,0.00006238279,0.44949403,0.40859133,0.011935206,0.123273484,0.00014591853],"about_ca_topic_score_codex":0.00060570927,"about_ca_topic_score_gemma":0.0012253106,"teacher_disagreement_score":0.0033847159,"about_ca_system_score_codex":0.00046390248,"about_ca_system_score_gemma":0.0006189293,"threshold_uncertainty_score":0.011322975},"labels":[],"label_agreement":null},{"id":"W2089426645","doi":"10.1109/tcomm.2006.873065","title":"Selective maximum-likelihood symbol-by-symbol detection for multidimensional multicode WCDMA with precoding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Simon Fraser University","funders":"","keywords":"Precoding; Computer science; Telecommunications link; Algorithm; Code division multiple access; Symbol rate; Symbol (formal); Electronic engineering; Bit error rate; Decoding methods; MIMO; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.02093469730244359,"score_gpt":0.2722067548261051,"score_spread":0.25127205752366155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089426645","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.04879217,0.00018710864,0.94943684,0.00013169911,0.000016443097,0.000027134967,0.00004198484,0.0002078855,0.0011587527],"genre_scores_gemma":[0.5931004,0.00022465998,0.40517858,0.0000947065,0.000047577116,0.00010631113,0.00009770442,0.000021870983,0.0011281121],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992962,0.00023683591,0.0000309158,0.00008818706,0.00029885865,0.00004889903],"domain_scores_gemma":[0.99897194,0.00054855907,0.0001641824,0.00016968661,0.00010960441,0.00003607754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834216,0.00037814118,0.00042186497,0.0004259593,0.00024481775,0.00038582445,0.00049344555,0.00042961023,0.0005749905],"category_scores_gemma":[0.002739429,0.00030046306,0.00023637999,0.00040333674,0.00052632554,0.0005689716,0.00079124386,0.0003839596,0.0003655801],"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.0008406104,0.0001368234,0.0036774823,0.0003673996,0.000108890556,0.0004653282,0.00041520398,0.17044862,0.41989464,0.07234592,0.0015063505,0.32979277],"study_design_scores_gemma":[0.000038630355,0.0001269876,0.0005658436,0.000013275488,0.000013763362,0.00026720532,0.000012538881,0.9241243,0.064473,0.008631645,0.0017074456,0.000025440233],"about_ca_topic_score_codex":0.00030091457,"about_ca_topic_score_gemma":0.00096998527,"teacher_disagreement_score":0.0005834216,"about_ca_system_score_codex":0.0003595126,"about_ca_system_score_gemma":0.00052361493,"threshold_uncertainty_score":0.003085494},"labels":[],"label_agreement":null},{"id":"W2093554016","doi":"10.1109/tcomm.2012.12.110670","title":"Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":424,"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":"Fading; Transmitter; Channel (broadcasting); Channel state information; MIMO; Topology (electrical circuits); Computer science; Secrecy; Antenna (radio); Selection (genetic algorithm); Nakagami distribution; Signal-to-noise ratio (imaging); Algorithm; Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Combinatorics; Computer security","score_opus":0.03391912688999205,"score_gpt":0.2874597000552449,"score_spread":0.25354057316525286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093554016","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.033121683,0.00045200658,0.9616034,0.00018327046,0.000046262914,0.00004243648,0.000044018598,0.00021041677,0.0042964956],"genre_scores_gemma":[0.9250315,0.0011140591,0.070384316,0.0001152834,0.000095093885,0.00009235583,0.000053838172,0.00004238253,0.0030712835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00036195043,0.000025117366,0.000084732565,0.0002569429,0.0001669181],"domain_scores_gemma":[0.9971974,0.0017218762,0.00035501356,0.00027183205,0.00038287626,0.000071074384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206003,0.0010126628,0.0006199131,0.0004304005,0.0004036183,0.0010566864,0.00067291275,0.0006446387,0.001717733],"category_scores_gemma":[0.0028025964,0.00034917088,0.00063104194,0.0007573835,0.001438706,0.0012085296,0.0009145936,0.0008468304,0.00053544616],"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.00040954718,0.00007236676,0.0016431267,0.0001595418,0.0000955285,0.0004219009,0.0001741879,0.81464314,0.028879069,0.11196786,0.0015288561,0.04000482],"study_design_scores_gemma":[0.000010201765,0.00011552891,0.00017368927,0.000011646128,0.00002880861,0.00012993588,0.000021419546,0.987655,0.0044255853,0.00678338,0.0006304461,0.000014423556],"about_ca_topic_score_codex":0.0006818004,"about_ca_topic_score_gemma":0.0008048886,"teacher_disagreement_score":0.001717733,"about_ca_system_score_codex":0.00081748475,"about_ca_system_score_gemma":0.0007451714,"threshold_uncertainty_score":0.0069841146},"labels":[],"label_agreement":null},{"id":"W2094116203","doi":"10.1109/tcomm.2010.092810.090549","title":"Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Electrical, Communications and Cyber Systems; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"MIMO; Link adaptation; Low-density parity-check code; Computer science; Code rate; Spectral efficiency; Adaptive coding; Communications system; Wireless; Bit error rate; Throughput; Coding (social sciences); Electronic engineering; Algorithm; Channel (broadcasting); Real-time computing; Computer network; Decoding methods; Mathematics; Telecommunications; Fading; Engineering","score_opus":0.039680225384198894,"score_gpt":0.298442293113083,"score_spread":0.2587620677288841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094116203","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.05369742,0.00038835156,0.9403193,0.00024339507,0.000062640305,0.00009095096,0.00007296902,0.0004575668,0.004667435],"genre_scores_gemma":[0.78487426,0.00043373377,0.21152346,0.00015284175,0.00008552967,0.00015708961,0.000076983786,0.000023654979,0.0026724532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.00021861562,0.00003117634,0.00009436299,0.00025473512,0.00006118029],"domain_scores_gemma":[0.99894875,0.00044895918,0.00016375796,0.00018598088,0.00021323343,0.00003925669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048607998,0.0005253855,0.000362621,0.0003748333,0.00037188517,0.0006116104,0.00076382933,0.0004718607,0.00065225863],"category_scores_gemma":[0.0022249657,0.0002167002,0.00022163226,0.0005800845,0.0006403017,0.00065859605,0.00063501176,0.0006892144,0.00033727597],"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.0006198514,0.00021824002,0.002470863,0.00038367393,0.00010821318,0.0008415191,0.0004350851,0.4918301,0.20083982,0.14382504,0.0026941635,0.15573339],"study_design_scores_gemma":[0.00008446687,0.0002260442,0.0004184527,0.000026587653,0.00004002425,0.00035584677,0.000025305766,0.9258895,0.051340844,0.016866064,0.0046746857,0.000052241703],"about_ca_topic_score_codex":0.00091831526,"about_ca_topic_score_gemma":0.0011491118,"teacher_disagreement_score":0.00091831526,"about_ca_system_score_codex":0.00044477513,"about_ca_system_score_gemma":0.00056700374,"threshold_uncertainty_score":0.003227055},"labels":[],"label_agreement":null},{"id":"W2094772862","doi":"10.1109/tcomm.2012.061212.110200","title":"Iterative Mode-Dropping for the Sum Capacity of MIMO-MAC with Per-Antenna Power Constraint","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems 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":"McGill University","funders":"","keywords":"MIMO; Maximization; Constraint (computer-aided design); Antenna (radio); 3G MIMO; Multi-user MIMO; Mathematical optimization; Power (physics); Mode (computer interface); Iterative method; Convergence (economics); Computer science; Algorithm; Covariance matrix; Mathematics; Electronic engineering; Control theory (sociology); Telecommunications; Engineering; Beamforming","score_opus":0.035674985202138465,"score_gpt":0.268052692047264,"score_spread":0.23237770684512554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094772862","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.0054829083,0.00009201885,0.99257666,0.00007739001,0.00001767016,0.00003133968,0.000016695762,0.00018080135,0.0015244993],"genre_scores_gemma":[0.4413938,0.0003558167,0.5547199,0.00022121571,0.00006641128,0.00028219773,0.00007984872,0.00018132759,0.002699516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989606,0.000314624,0.000032196425,0.00008443057,0.0004555915,0.00015250975],"domain_scores_gemma":[0.9982293,0.0009509067,0.00012591774,0.0002531525,0.00037890315,0.000061854844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021581415,0.001135827,0.0006524278,0.00039671204,0.00056494446,0.001020444,0.0016815356,0.0005981643,0.001963692],"category_scores_gemma":[0.005163514,0.0003660467,0.0007005889,0.00058120274,0.0011918258,0.00092818984,0.0013126164,0.001536057,0.00055161444],"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.000099967125,0.00007354879,0.00064796983,0.00007225373,0.000033754113,0.00008183407,0.00013103464,0.8685611,0.011220747,0.052486114,0.0017606132,0.06483112],"study_design_scores_gemma":[0.0000066656216,0.000017631804,0.000056705187,0.000003507508,0.0000038701064,0.000015819796,0.0000050036547,0.991438,0.0028960884,0.005204519,0.00034554387,0.000006663448],"about_ca_topic_score_codex":0.004186301,"about_ca_topic_score_gemma":0.004979403,"teacher_disagreement_score":0.004186301,"about_ca_system_score_codex":0.0013083352,"about_ca_system_score_gemma":0.0031571337,"threshold_uncertainty_score":0.011413455},"labels":[],"label_agreement":null},{"id":"W2095529104","doi":"10.1109/tcomm.2010.093010.100024","title":"Robust Multiresolution Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Codebook; Algorithm; Coding (social sciences); Robustness (evolution); Computer science; Multiresolution analysis; Distributed source coding; Shannon–Fano coding; Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Wavelet; Wavelet transform; Artificial intelligence","score_opus":0.06678330363256661,"score_gpt":0.30961659334065866,"score_spread":0.24283328970809204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095529104","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.0033586998,0.0006578019,0.99360055,0.00014114166,0.000044847904,0.000033589306,0.0000951573,0.00022419055,0.0018439408],"genre_scores_gemma":[0.29803562,0.0019626357,0.6943433,0.00034882838,0.0001834039,0.00015447133,0.00052705524,0.00014061677,0.004304008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863344,0.00030245195,0.00006806178,0.00018168564,0.0007069855,0.00010725466],"domain_scores_gemma":[0.99806315,0.00077172846,0.0002008742,0.0006154326,0.00029761408,0.00005133165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014468962,0.0008273894,0.0011053918,0.0010190028,0.00043211997,0.0013843866,0.0014149986,0.0012034768,0.0024819544],"category_scores_gemma":[0.0052706804,0.0003891252,0.00072598155,0.0013879383,0.0010211184,0.002116078,0.002187169,0.0018393726,0.0011934317],"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.00029732127,0.0000650251,0.00039761612,0.00044611082,0.000088909626,0.0004344399,0.0002505858,0.15845247,0.08701012,0.47513354,0.0062716245,0.27115223],"study_design_scores_gemma":[0.00004121403,0.00009757923,0.00021600084,0.000075899676,0.000038759626,0.000534637,0.000040388168,0.8224123,0.043738954,0.118746534,0.013985188,0.0000725325],"about_ca_topic_score_codex":0.00069831224,"about_ca_topic_score_gemma":0.0005852763,"teacher_disagreement_score":0.0024819544,"about_ca_system_score_codex":0.000765444,"about_ca_system_score_gemma":0.00056277297,"threshold_uncertainty_score":0.008302987},"labels":[],"label_agreement":null},{"id":"W2096439448","doi":"10.1109/tcomm.2011.060911.100554","title":"Multicell Interference Mitigation with Joint Beamforming and Common Message Decoding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":56,"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":"Beamforming; Computer science; Telecommunications link; Decoding methods; Interference (communication); Base station; Transmitter; Multiplexing; Computer network; Optimization problem; Heuristic; Antenna (radio); Mathematical optimization; Channel (broadcasting); Telecommunications; Algorithm; Mathematics","score_opus":0.04056802228546848,"score_gpt":0.2394367607084012,"score_spread":0.19886873842293273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096439448","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.013931767,0.00023505026,0.9823224,0.00009349119,0.00001864286,0.000025197198,0.000022393377,0.00017646726,0.003174535],"genre_scores_gemma":[0.57850546,0.0006049674,0.41448864,0.00017164838,0.00008076062,0.00014158218,0.0001022854,0.00006174258,0.005842929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.0003268009,0.000035453348,0.00014088851,0.00036148555,0.00015260233],"domain_scores_gemma":[0.9992495,0.0003213758,0.00013492523,0.000115821684,0.00014529469,0.00003295162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225986,0.0014556207,0.00077843526,0.00051803305,0.0004181207,0.00068479043,0.00092353206,0.000831829,0.0008731439],"category_scores_gemma":[0.001980613,0.0003466812,0.00044642403,0.0010064936,0.00072600134,0.0011060659,0.0014034029,0.0007175896,0.0005123793],"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.00019724507,0.00014142791,0.00055176596,0.00010453451,0.000083235354,0.000117662756,0.000115697905,0.77289015,0.03189506,0.02955384,0.0010279601,0.16332147],"study_design_scores_gemma":[0.00003078363,0.00014160576,0.0001342041,0.000012460339,0.000022543554,0.00008942453,0.000029281451,0.9706332,0.018894844,0.008332367,0.0016600317,0.000019413732],"about_ca_topic_score_codex":0.0022153037,"about_ca_topic_score_gemma":0.004216791,"teacher_disagreement_score":0.0022153037,"about_ca_system_score_codex":0.0006699111,"about_ca_system_score_gemma":0.0011429149,"threshold_uncertainty_score":0.00486058},"labels":[],"label_agreement":null},{"id":"W2096735338","doi":"10.1109/tcomm.2009.08.070399","title":"Design and analysis of robust detectors for TH IR-UWB systems with multiuser interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Detector; Computer science; Bit error rate; Interference (communication); Electronic engineering; Ultra-wideband; Multiuser detection; Robustness (evolution); Impulse (physics); Parametric statistics; Impulse response; Algorithm; Telecommunications; Physics; Mathematics; Engineering; Statistics; Decoding methods; Channel (broadcasting)","score_opus":0.03677024918431639,"score_gpt":0.2452470432369565,"score_spread":0.2084767940526401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096735338","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.014678493,0.0003980439,0.98402506,0.00005770865,0.000012131464,0.000017629609,0.000013238439,0.00011340421,0.00068428746],"genre_scores_gemma":[0.7560782,0.0008686638,0.2412177,0.00012915452,0.000057613048,0.00010617578,0.00005885344,0.00004895005,0.001434745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987196,0.00043503576,0.000056859855,0.00017952654,0.0004997818,0.000109199915],"domain_scores_gemma":[0.9964825,0.0022554686,0.00042226785,0.00029474127,0.00048886903,0.000056118828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020464552,0.0007692541,0.0010816003,0.000386237,0.00022958113,0.0011037025,0.0009605276,0.0012097233,0.00066437636],"category_scores_gemma":[0.006137464,0.00044847457,0.0005104231,0.00036624548,0.0009260353,0.001138341,0.0007527471,0.00088324613,0.00030865983],"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.00027004458,0.000057438974,0.000908905,0.00023572583,0.00018917184,0.00020717796,0.0001307232,0.8563871,0.038631596,0.033390522,0.00043716427,0.06915432],"study_design_scores_gemma":[0.000010956075,0.00007024112,0.00012183557,0.000007660363,0.000020665017,0.00009183449,0.000009649082,0.98728997,0.008817196,0.0031554159,0.00039100257,0.000013691501],"about_ca_topic_score_codex":0.00031371723,"about_ca_topic_score_gemma":0.00022222304,"teacher_disagreement_score":0.0020464552,"about_ca_system_score_codex":0.00073032064,"about_ca_system_score_gemma":0.0006420158,"threshold_uncertainty_score":0.010822773},"labels":[],"label_agreement":null},{"id":"W2096969048","doi":"10.1109/tcomm.2007.896127","title":"Source-Matched Spreading Codes for Optical CDMA","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"Center for High Performance Computing","keywords":"Puncturing; Code division multiple access; Computer science; Bit error rate; Electronic engineering; Convolutional code; Physical layer; Probability of error; Code (set theory); Computer network; Telecommunications; Algorithm; Channel (broadcasting); Decoding methods; Engineering; Wireless; Set (abstract data type)","score_opus":0.026720632724459233,"score_gpt":0.26773194387620675,"score_spread":0.2410113111517475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096969048","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.045749877,0.0020439094,0.9422351,0.0004357322,0.00017803667,0.00008376511,0.00011919716,0.0002857371,0.008868589],"genre_scores_gemma":[0.8410998,0.0023668397,0.14693461,0.0001722608,0.0002040317,0.00019313097,0.00021364565,0.000061210216,0.008754436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960715,0.00011508324,0.000013204738,0.0000331216,0.00019704305,0.000034350025],"domain_scores_gemma":[0.9989378,0.00065923564,0.000104177234,0.00009470387,0.00018011253,0.000023977564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004270147,0.0004933792,0.00028866975,0.0004406054,0.00039076735,0.0006004351,0.0005352874,0.0006336198,0.0013328589],"category_scores_gemma":[0.0029688608,0.00020366005,0.00020877857,0.00064768863,0.0006635927,0.000573977,0.0005328841,0.0005755984,0.00041262168],"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.00021172351,0.000057609912,0.0005380191,0.00024200867,0.00003523004,0.00022155647,0.00017095676,0.2606852,0.026586516,0.6023878,0.002450271,0.10641324],"study_design_scores_gemma":[0.000035160174,0.0000519122,0.00015043959,0.000033567194,0.000013673711,0.00009993569,0.000017164552,0.8243364,0.0049315672,0.16665277,0.0036608109,0.00001667381],"about_ca_topic_score_codex":0.0014263781,"about_ca_topic_score_gemma":0.0018117324,"teacher_disagreement_score":0.0014263781,"about_ca_system_score_codex":0.0007724859,"about_ca_system_score_gemma":0.0008595994,"threshold_uncertainty_score":0.005604863},"labels":[],"label_agreement":null},{"id":"W2097179998","doi":"10.1109/tcomm.2004.831357","title":"Equalization Concepts for Alamouti's Space–Time Block Code","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":64,"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":"Block code; Transmit diversity; Space–time block code; Computer science; Equalization (audio); Algorithm; Fading; Estimator; Antenna diversity; Transmission (telecommunications); Block (permutation group theory); Electronic engineering; Decoding methods; Mathematics; Telecommunications; Antenna (radio); Engineering","score_opus":0.029518065906435253,"score_gpt":0.31304927293657575,"score_spread":0.2835312070301405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097179998","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.0016131967,0.0015698451,0.9902558,0.00020307914,0.00016910501,0.000043177555,0.00003969737,0.000099203164,0.0060069603],"genre_scores_gemma":[0.12060606,0.006259247,0.85600626,0.00089353527,0.000929368,0.0004140226,0.00023254195,0.00014674084,0.014512272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994211,0.0001459992,0.0000424617,0.00008818176,0.00025207928,0.00005020015],"domain_scores_gemma":[0.9993636,0.00025691403,0.00009336631,0.00009524822,0.00017744192,0.000013485578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010561238,0.00082204444,0.0003840478,0.0007618516,0.00042352424,0.0009441395,0.0006954475,0.0008948756,0.0029500257],"category_scores_gemma":[0.0021389194,0.00026309732,0.00042093458,0.00063507835,0.0009229374,0.0016637698,0.0007151514,0.0020975042,0.0015464806],"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.000048607184,0.000027298138,0.00013551895,0.00024214014,0.000029768482,0.00012763139,0.00024276169,0.01942669,0.01658607,0.8370943,0.0037892358,0.12224996],"study_design_scores_gemma":[0.000058261845,0.00033211894,0.00071995053,0.0002854066,0.00008633146,0.0014382959,0.00010983913,0.30872297,0.048910003,0.4908176,0.14834923,0.00016999099],"about_ca_topic_score_codex":0.0008004446,"about_ca_topic_score_gemma":0.00080120016,"teacher_disagreement_score":0.0029500257,"about_ca_system_score_codex":0.00069389306,"about_ca_system_score_gemma":0.00070966873,"threshold_uncertainty_score":0.009868801},"labels":[],"label_agreement":null},{"id":"W2097329427","doi":"10.1109/tcomm.2014.032014.130399","title":"On the Performance of Cooperative Relaying Spectrum-Sharing Systems with Collaborative Distributed Beamforming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"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; Université du Québec à Montréal; Concordia University","funders":"","keywords":"Beamforming; Rayleigh fading; Phase-shift keying; Cognitive radio; Computer science; Relay; Moment-generating function; Spectral efficiency; Quadrature amplitude modulation; Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Fading; Bit error rate; Probability density function; Algorithm; Mathematics; Telecommunications; Decoding methods; Engineering; Wireless; Statistics","score_opus":0.029785680449203593,"score_gpt":0.2550656941608576,"score_spread":0.22528001371165401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097329427","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.36653253,0.0033127412,0.60183924,0.00071854115,0.00010300619,0.00011357251,0.00022930116,0.0004637945,0.026687255],"genre_scores_gemma":[0.99360996,0.00032504046,0.0053744526,0.000044730008,0.000021057227,0.000028925733,0.00003991032,0.000020220665,0.00053556164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976158,0.0010216036,0.0000944264,0.00028889105,0.0006071976,0.00037202775],"domain_scores_gemma":[0.9872736,0.009677218,0.000739357,0.0007533819,0.0014151611,0.00014136093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003423371,0.0017577794,0.0012980642,0.00077637885,0.0007771671,0.0014098972,0.0010023143,0.0014305619,0.0014544278],"category_scores_gemma":[0.019006483,0.00043541697,0.0005302077,0.0010019285,0.001406519,0.0019350733,0.0019664734,0.0007276998,0.00037556048],"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.00015652204,0.000043480482,0.00073291146,0.00006652491,0.00004634838,0.000102851525,0.0001203063,0.97481954,0.0028066498,0.009855905,0.00028876527,0.010960216],"study_design_scores_gemma":[0.000016791428,0.00012643501,0.00048413605,0.000016211283,0.000027989756,0.000087983644,0.000049110677,0.9931375,0.0013070657,0.0045524985,0.00017379675,0.000020521673],"about_ca_topic_score_codex":0.0037394662,"about_ca_topic_score_gemma":0.0023893816,"teacher_disagreement_score":0.0037394662,"about_ca_system_score_codex":0.0013345897,"about_ca_system_score_gemma":0.0010170096,"threshold_uncertainty_score":0.018104792},"labels":[],"label_agreement":null},{"id":"W2097882868","doi":"10.1109/tcomm.2009.07.070510","title":"Error probabilities of noncoherent and coherent FSK in the presence of frequency and phase offsets for two-hop relay networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"","keywords":"Frequency-shift keying; Relay; Rayleigh fading; Electronic engineering; Synchronization (alternating current); Hop (telecommunications); Computer science; Phase-shift keying; Bit error rate; Topology (electrical circuits); Telecommunications; Control theory (sociology); Fading; Engineering; Channel (broadcasting); Power (physics); Electrical engineering; Demodulation; Physics","score_opus":0.06746455128897061,"score_gpt":0.34433786787256826,"score_spread":0.27687331658359765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097882868","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.55114305,0.0017283679,0.44260317,0.0005563417,0.00005587874,0.00005882865,0.00021210038,0.00029630042,0.003345945],"genre_scores_gemma":[0.9888123,0.0005305538,0.009067424,0.00003472911,0.000037409147,0.00004249147,0.00009782628,0.00004282571,0.0013344777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997652,0.0007920905,0.00013792892,0.00027989392,0.0008162473,0.00032184576],"domain_scores_gemma":[0.95242435,0.038718753,0.0045029083,0.0014742989,0.0025334875,0.0003462069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068297195,0.0012241085,0.0011346136,0.00152062,0.0005082791,0.0012993459,0.0012557553,0.0014548877,0.0011321855],"category_scores_gemma":[0.029650766,0.0006180692,0.0005465158,0.0009173047,0.0024451052,0.0022895944,0.0016229723,0.0009427377,0.00022778058],"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.00039283038,0.000041818905,0.0041146465,0.00010019405,0.000061978935,0.00031982083,0.00024886752,0.955754,0.0028766848,0.028071605,0.0002882666,0.0077293077],"study_design_scores_gemma":[0.000014217894,0.000049963295,0.001004036,0.00001418044,0.000023176246,0.00012654785,0.00003910583,0.99054235,0.0016231409,0.0064530848,0.00008241122,0.000027720325],"about_ca_topic_score_codex":0.0023001235,"about_ca_topic_score_gemma":0.0012619057,"teacher_disagreement_score":0.0068297195,"about_ca_system_score_codex":0.0015574499,"about_ca_system_score_gemma":0.00077387877,"threshold_uncertainty_score":0.03611946},"labels":[],"label_agreement":null},{"id":"W2098237535","doi":"10.1109/tcomm.2011.011811.090638","title":"Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Decoding methods; Low-density parity-check code; List decoding; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; Linear programming; Concatenated error correction code; Computer science; Mathematics; Block code; Error floor","score_opus":0.0926874537098621,"score_gpt":0.3199310397218236,"score_spread":0.22724358601196148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098237535","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.0028449248,0.0000506357,0.99600667,0.000027269216,0.000009221376,0.00001434871,0.000011814379,0.00019310926,0.00084205763],"genre_scores_gemma":[0.10511034,0.00014641463,0.89124507,0.000063723084,0.000017053007,0.00015961254,0.000114538234,0.000115619565,0.0030276864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.00011241902,0.000017634668,0.00005374816,0.000186966,0.00003106682],"domain_scores_gemma":[0.9995276,0.00027178263,0.000025501038,0.000041103147,0.00011782804,0.00001616784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041166815,0.0004924562,0.0006949158,0.00047718178,0.00035163012,0.00067147677,0.0007046218,0.0006586353,0.0019232598],"category_scores_gemma":[0.0012325869,0.0002703843,0.0004295648,0.0005027801,0.00045047508,0.0006617129,0.0007395215,0.0014245271,0.0009346219],"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.00013814314,0.00007097889,0.00047106852,0.00015408175,0.00004829753,0.00011548182,0.0001647299,0.5657615,0.01722945,0.08539354,0.0018287211,0.328624],"study_design_scores_gemma":[0.000014177798,0.000026884087,0.000036108348,0.0000067983274,0.0000038969542,0.000041571435,0.000006085903,0.98724127,0.0034243672,0.007629674,0.0015616155,0.0000075444855],"about_ca_topic_score_codex":0.0012331388,"about_ca_topic_score_gemma":0.0011094216,"teacher_disagreement_score":0.0019232598,"about_ca_system_score_codex":0.000530528,"about_ca_system_score_gemma":0.0007683046,"threshold_uncertainty_score":0.006433964},"labels":[],"label_agreement":null},{"id":"W2098243791","doi":"10.1109/tcomm.2006.876884","title":"Signal Activity Detection of Phase-Shift Keying Signals","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":43,"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":"Detector; Phase-shift keying; Additive white Gaussian noise; Keying; Algorithm; Likelihood-ratio test; Gaussian noise; Detection theory; Amplitude and phase-shift keying; Energy (signal processing); Signal-to-noise ratio (imaging); Binary number; SIGNAL (programming language); Mathematics; Electronic engineering; Computer science; Invariant (physics); Gaussian; White noise; Bit error rate; Statistics; Telecommunications; Engineering; Decoding methods; Physics","score_opus":0.05191040407982971,"score_gpt":0.2985036673704731,"score_spread":0.2465932632906434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098243791","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.012619087,0.00010929312,0.9864965,0.000052326013,0.000012327435,0.000035692803,0.000019629797,0.00015183183,0.0005032535],"genre_scores_gemma":[0.31843793,0.00021920011,0.6797904,0.0000880644,0.00005795283,0.00014924118,0.0001165774,0.000031703396,0.0011088781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.00050827273,0.000064883796,0.00012551488,0.0005436505,0.00008672342],"domain_scores_gemma":[0.9979607,0.0011167295,0.00032785398,0.00023868156,0.0002953066,0.0000607047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013252458,0.00082667306,0.0009234159,0.000928979,0.0002216853,0.00081526453,0.001452073,0.0007192485,0.001049538],"category_scores_gemma":[0.0065932437,0.0002712508,0.00048367155,0.00075356604,0.00069381273,0.0013598767,0.0011122057,0.00073199323,0.00051357184],"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.0006786504,0.00025206205,0.0029665409,0.00034701664,0.00012890004,0.0002589383,0.00012216074,0.26157838,0.08184669,0.12362373,0.001630829,0.52656615],"study_design_scores_gemma":[0.000036457506,0.0001560579,0.00035453783,0.000008264009,0.000015224007,0.0001538531,0.000008555888,0.9636527,0.020496305,0.0142227365,0.00087680406,0.000018507897],"about_ca_topic_score_codex":0.0002534602,"about_ca_topic_score_gemma":0.00034484596,"teacher_disagreement_score":0.001452073,"about_ca_system_score_codex":0.00040632725,"about_ca_system_score_gemma":0.0005452104,"threshold_uncertainty_score":0.0070086718},"labels":[],"label_agreement":null},{"id":"W2098592039","doi":"10.1109/tcomm.2011.091911.100007a","title":"A Weighted Queue-Based Model for Correlated Rayleigh and Rician Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network 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":"University of Manitoba","funders":"","keywords":"Rician fading; Queue; Rayleigh fading; Fading; Channel (broadcasting); Computer science; Channel capacity; Algorithm; Mathematics; Telecommunications; Computer network","score_opus":0.0484424474503522,"score_gpt":0.24224605641726085,"score_spread":0.19380360896690865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098592039","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.0092267515,0.00028998917,0.987954,0.00018190671,0.00011159082,0.000040739495,0.0001942309,0.00012904273,0.0018718404],"genre_scores_gemma":[0.83133537,0.0021591047,0.14801887,0.00047563124,0.00030658208,0.00045304836,0.00066143397,0.00015107755,0.016438838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912614,0.0002137867,0.000041606334,0.0001443268,0.00029586273,0.00017838526],"domain_scores_gemma":[0.998871,0.00044406453,0.00017274634,0.0001275603,0.00033209467,0.00005242008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010176905,0.0010003448,0.00094517804,0.00065437844,0.0005380297,0.0015534009,0.0026099589,0.0012237063,0.0023695843],"category_scores_gemma":[0.0025193887,0.00041102388,0.0007142383,0.0012961858,0.0010412227,0.002497445,0.00080251246,0.0016856069,0.00077383686],"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.00011573031,0.000057845267,0.00068816,0.00010471488,0.000042915148,0.00020576004,0.00009782521,0.7625375,0.0060609533,0.2133124,0.0023720122,0.014404159],"study_design_scores_gemma":[0.000009412818,0.000022013754,0.00006982598,0.00000426599,0.000009504791,0.00005164569,0.000007825112,0.98596364,0.00041961492,0.012674929,0.00075155863,0.000015805985],"about_ca_topic_score_codex":0.0059230733,"about_ca_topic_score_gemma":0.0049879486,"teacher_disagreement_score":0.0059230733,"about_ca_system_score_codex":0.0014406658,"about_ca_system_score_gemma":0.0014913846,"threshold_uncertainty_score":0.011777163},"labels":[],"label_agreement":null},{"id":"W2098669738","doi":"10.1109/tcomm.2006.887488","title":"Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"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":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Belief propagation; Decoding methods; Bit error rate; Mathematics; Channel (broadcasting); Node (physics); Computer science; Telecommunications; Physics","score_opus":0.05991274641773332,"score_gpt":0.3339470309411472,"score_spread":0.2740342845234139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098669738","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.6256165,0.0007949732,0.3707384,0.00035744655,0.000027827959,0.000043889424,0.00008541854,0.0006982637,0.0016372971],"genre_scores_gemma":[0.9642044,0.00015155859,0.035216626,0.000034745066,0.0000073270107,0.000023451801,0.00007393211,0.000024660718,0.00026332753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974354,0.0009465035,0.00010244264,0.00020507225,0.0010270035,0.0002835576],"domain_scores_gemma":[0.97810966,0.018061632,0.0009953358,0.00079278153,0.0018005609,0.00024012676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005242143,0.000841841,0.0009105375,0.0008205316,0.0004793765,0.00092199736,0.00069576805,0.0013646758,0.000328793],"category_scores_gemma":[0.03440241,0.00034897617,0.00025007848,0.0007360812,0.0013577447,0.0018520383,0.0013290478,0.0008736132,0.00011581416],"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.0008119721,0.00006197494,0.004815758,0.00008245185,0.000075501324,0.00007093857,0.00011260613,0.9545921,0.0058933636,0.0040291944,0.00013975755,0.029314473],"study_design_scores_gemma":[0.000009716555,0.00006918847,0.00042638506,0.0000044488384,0.0000071265063,0.000019704688,0.000009501786,0.99398994,0.0043094154,0.0011200642,0.000024197248,0.000010273176],"about_ca_topic_score_codex":0.004827815,"about_ca_topic_score_gemma":0.0026916668,"teacher_disagreement_score":0.005242143,"about_ca_system_score_codex":0.0013485253,"about_ca_system_score_gemma":0.0011178517,"threshold_uncertainty_score":0.027723432},"labels":[],"label_agreement":null},{"id":"W2099114934","doi":"10.1109/tcomm.2007.895978","title":"Convergence Speed and Throughput of Analog Decoders","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Convergence (economics); Throughput; Computer science; Electronic engineering; Engineering; Telecommunications; Wireless","score_opus":0.04220366089989956,"score_gpt":0.31848603325049724,"score_spread":0.27628237235059766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099114934","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.48380566,0.001719904,0.49621847,0.00047297092,0.00007131622,0.00008384981,0.00022841962,0.0010514279,0.016347956],"genre_scores_gemma":[0.9503154,0.0005786405,0.045511607,0.000080698366,0.00004113431,0.0000810595,0.00014886561,0.00012808808,0.0031145865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980438,0.00053249224,0.000082834034,0.00026528488,0.0008421965,0.00023340018],"domain_scores_gemma":[0.98656034,0.010017304,0.00062603666,0.00085992995,0.0017740573,0.00016231922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026792663,0.0005316617,0.0006461266,0.0013199791,0.0005821474,0.0014755116,0.00082215166,0.0007370303,0.0019594007],"category_scores_gemma":[0.025825622,0.00032170265,0.00029609032,0.0009087585,0.0011960828,0.0019672343,0.0009326195,0.0007889016,0.0005125854],"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.00081767474,0.00009368257,0.0051594037,0.00024172818,0.000080122234,0.00023415942,0.00030731867,0.7960829,0.037000403,0.09175567,0.0010291603,0.06719773],"study_design_scores_gemma":[0.000036275047,0.00012099029,0.00092076656,0.000044761164,0.000027995864,0.00017897243,0.000048610495,0.94408876,0.037757315,0.015863748,0.0008851814,0.000026738257],"about_ca_topic_score_codex":0.0014507793,"about_ca_topic_score_gemma":0.0010120792,"teacher_disagreement_score":0.0026792663,"about_ca_system_score_codex":0.0018284677,"about_ca_system_score_gemma":0.0013221867,"threshold_uncertainty_score":0.014169514},"labels":[],"label_agreement":null},{"id":"W2099510208","doi":"10.1109/tcomm.2007.902519","title":"Error Rate Analysis for Coded Multicarrier Systems Over Quasi-Static Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":40,"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":"Orthogonal frequency-division multiplexing; Bit error rate; Subcarrier; Computer science; Electronic engineering; Cyclic prefix; Fading; QAM; Spectral efficiency; Quadrature amplitude modulation; Interleaving; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.041032047840594166,"score_gpt":0.300676328613927,"score_spread":0.25964428077333285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099510208","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.02948057,0.0016211708,0.96353376,0.00023909601,0.000046505585,0.000036220004,0.00010235674,0.00024219674,0.00469811],"genre_scores_gemma":[0.8959633,0.0043293834,0.09127856,0.00016483512,0.00017358581,0.00017665836,0.0002903984,0.00017070143,0.0074525415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839765,0.00044814573,0.00006707604,0.00013495749,0.00077178254,0.0001802854],"domain_scores_gemma":[0.9915706,0.0061494447,0.0006113824,0.00043109598,0.0011837573,0.000053751908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989598,0.0010665912,0.0005891392,0.0014426166,0.00035002158,0.0009797848,0.00087052217,0.0007186969,0.0018994099],"category_scores_gemma":[0.013754664,0.0003165051,0.00051015045,0.0009862741,0.000918006,0.0015001484,0.0007406591,0.001082871,0.0006070192],"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.00006244357,0.000022625032,0.0008434579,0.00013081914,0.000038667742,0.00011864407,0.00017198591,0.9325102,0.004108346,0.04275196,0.00062968594,0.018611168],"study_design_scores_gemma":[0.0000014769073,0.000010427242,0.00015968307,0.000009083308,0.0000045088104,0.00003060864,0.000011884391,0.9961676,0.0006787048,0.00273292,0.00018735816,0.0000057900015],"about_ca_topic_score_codex":0.0056945076,"about_ca_topic_score_gemma":0.0026549706,"teacher_disagreement_score":0.0056945076,"about_ca_system_score_codex":0.0015178705,"about_ca_system_score_gemma":0.0009296435,"threshold_uncertainty_score":0.015810728},"labels":[],"label_agreement":null},{"id":"W2100072869","doi":"10.1109/26.855519","title":"The generation of correlated Rayleigh random variates by inverse discrete Fourier transform","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":270,"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":"Random variate; Convolution random number generator; Algorithm; Random number generation; Computer science; Control variates; Discrete Fourier transform (general); Fourier transform; Inverse; Mathematics; Mathematical optimization; Random variable; Statistics; Fourier analysis; Monte Carlo method; Fractional Fourier transform","score_opus":0.025999727430228128,"score_gpt":0.2791343712317966,"score_spread":0.25313464380156847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100072869","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.0062281047,0.00012099528,0.9924576,0.00003413851,0.000019603833,0.000045303183,0.000020847247,0.00018358766,0.00088981213],"genre_scores_gemma":[0.15721726,0.00041837947,0.8402568,0.00006239382,0.00004581564,0.00017617784,0.00016045322,0.00014357717,0.0015191203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858236,0.0005479798,0.000055063178,0.00014456142,0.0006057646,0.0000642448],"domain_scores_gemma":[0.9952549,0.0033754632,0.0002688828,0.0006230803,0.00041827324,0.00005951348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029337017,0.00066418236,0.0006916935,0.0011049045,0.00036917566,0.0006923883,0.00076155295,0.0006246319,0.0017826699],"category_scores_gemma":[0.011719627,0.00030861393,0.00078424916,0.0008880592,0.0010167869,0.0010896885,0.00090944755,0.0009242015,0.0007266655],"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.00049581734,0.00010635887,0.0037680303,0.00035518425,0.00015123782,0.0002695973,0.0004402512,0.32730973,0.03361615,0.17369148,0.0020646746,0.4577315],"study_design_scores_gemma":[0.000064063104,0.00019495847,0.0013585002,0.000048502534,0.000035959732,0.0005228539,0.00004070852,0.9244297,0.03951401,0.025628837,0.008060758,0.000101125086],"about_ca_topic_score_codex":0.00046473768,"about_ca_topic_score_gemma":0.0004820463,"teacher_disagreement_score":0.0029337017,"about_ca_system_score_codex":0.00039112344,"about_ca_system_score_gemma":0.00044465263,"threshold_uncertainty_score":0.015515029},"labels":[],"label_agreement":null},{"id":"W2100108445","doi":"10.1109/tcomm.2004.823591","title":"Isometric Data Sequences and Data-Modulation Schemes in Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","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":"University of Toronto","funders":"","keywords":"Fading; Algorithm; Computer science; Modulation (music); Multiplicative function; Channel (broadcasting); Detector; Constellation; Transmission (telecommunications); Electronic engineering; Mathematics; Telecommunications; Decoding methods; Engineering; Physics","score_opus":0.11689976784521064,"score_gpt":0.34943556189435676,"score_spread":0.23253579404914612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100108445","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.05062451,0.00048727263,0.94569397,0.00016049648,0.000037185793,0.00002773399,0.0000238433,0.000096305004,0.0028488238],"genre_scores_gemma":[0.8147204,0.00057383167,0.18261865,0.00011590126,0.00007466794,0.000046712772,0.000073313946,0.000022976381,0.0017535001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988656,0.0005106193,0.00005986072,0.0001157008,0.00034909844,0.000099044104],"domain_scores_gemma":[0.9971572,0.001424746,0.00037493499,0.0006093665,0.0003610446,0.0000727915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379963,0.00049483665,0.00041452845,0.000545404,0.00031391557,0.00067740824,0.000556825,0.0005940376,0.00070131634],"category_scores_gemma":[0.0075635347,0.00020450633,0.00017860683,0.0009914421,0.0009767457,0.0014640599,0.00096115837,0.0006371087,0.00023505156],"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.0004929119,0.00009021059,0.0018669738,0.00029004182,0.000035308083,0.00019760287,0.00026365148,0.365767,0.031102974,0.25095227,0.0010761268,0.3478649],"study_design_scores_gemma":[0.00003001275,0.00029338413,0.0007260836,0.000031419575,0.000020974729,0.00041193748,0.00008059336,0.89118344,0.023546325,0.07904456,0.00459747,0.000033964563],"about_ca_topic_score_codex":0.00042424517,"about_ca_topic_score_gemma":0.0003834263,"teacher_disagreement_score":0.001379963,"about_ca_system_score_codex":0.00042632897,"about_ca_system_score_gemma":0.000501143,"threshold_uncertainty_score":0.0072980523},"labels":[],"label_agreement":null},{"id":"W2100183328","doi":"10.1109/tcomm.2010.08.090220","title":"Data-Aided and Non-Data-Aided Estimation of Signal Amplitude for Binary Data Communication in Laplace Noise","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"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":"Estimator; Binary number; Noise (video); SIGNAL (programming language); Binary data; Amplitude; Algorithm; Mean squared error; Mathematics; Estimation theory; Laplace transform; Statistics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.07492159489404657,"score_gpt":0.34571023056526967,"score_spread":0.27078863567122313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100183328","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.027445577,0.00032289897,0.9709456,0.00013379753,0.000034798442,0.00002567352,0.000021395008,0.0001058689,0.0009644204],"genre_scores_gemma":[0.7891749,0.00060929946,0.20799235,0.000109128916,0.00010739851,0.000093775285,0.000090035515,0.000028299988,0.0017948315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.00029080219,0.000050929404,0.00009427801,0.000369714,0.000065728455],"domain_scores_gemma":[0.99598515,0.00304032,0.00031180456,0.00021855583,0.00039393245,0.000050279585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015441594,0.0006149905,0.0006386686,0.0005786593,0.00030376617,0.0009310463,0.0006605271,0.0009613663,0.0011585271],"category_scores_gemma":[0.009831889,0.00026273433,0.00032939002,0.0005457675,0.0007473998,0.001403008,0.0012142949,0.00064942986,0.00035804033],"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.0017089014,0.00018512756,0.0057607316,0.0009865586,0.00010112143,0.000868705,0.00052682287,0.4211327,0.09200402,0.054082602,0.0015247664,0.42111793],"study_design_scores_gemma":[0.00002070565,0.00017857466,0.00065107126,0.00003321551,0.000023924327,0.0003219181,0.000049025904,0.96775067,0.024281066,0.005846859,0.00081396254,0.000028925946],"about_ca_topic_score_codex":0.00033437004,"about_ca_topic_score_gemma":0.0004913791,"teacher_disagreement_score":0.0015441594,"about_ca_system_score_codex":0.00036528116,"about_ca_system_score_gemma":0.0005366558,"threshold_uncertainty_score":0.008166432},"labels":[],"label_agreement":null},{"id":"W2100198221","doi":"10.1109/tcomm.2014.2318717","title":"Joint Channel and Frequency Offset Estimation for Oversampled Perfect Reconstruction Filter Bank Transceivers","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Carrier frequency offset; Estimator; Fading; Computer science; Cramér–Rao bound; Algorithm; Channel (broadcasting); Frequency offset; Control theory (sociology); Estimation theory; Electronic engineering; Orthogonal frequency-division multiplexing; Mathematics; Engineering; Telecommunications; Statistics","score_opus":0.03379579537303312,"score_gpt":0.24489841518352992,"score_spread":0.2111026198104968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100198221","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.023328068,0.00017204498,0.9757817,0.00005417106,0.000010893838,0.000007540568,0.000031050917,0.00023938896,0.00037501863],"genre_scores_gemma":[0.5058997,0.0003488887,0.49212697,0.000064819375,0.000027188935,0.000047362893,0.00016271939,0.00004649139,0.0012757875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.0001357833,0.000020260548,0.00004791422,0.00018161585,0.00002994372],"domain_scores_gemma":[0.9992681,0.00040742473,0.000117097414,0.000103961145,0.000091368885,0.000012032539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093322305,0.00036107402,0.0005709142,0.00042703364,0.00018497018,0.00044153188,0.00025253996,0.0004945485,0.0008370146],"category_scores_gemma":[0.0029506919,0.00025381276,0.00024637373,0.00038111405,0.00030279494,0.00071762,0.0003987922,0.0004620723,0.00025216388],"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.00028750944,0.00007379678,0.0034054124,0.0001986259,0.00008459576,0.00021871574,0.0002093376,0.56757885,0.06917194,0.022004468,0.0011847981,0.33558196],"study_design_scores_gemma":[0.000014566155,0.00005224366,0.000916068,0.000014924044,0.000011903842,0.00012181714,0.00002116925,0.98183227,0.012746953,0.0031765765,0.0010712601,0.000020251051],"about_ca_topic_score_codex":0.0011064037,"about_ca_topic_score_gemma":0.0018885469,"teacher_disagreement_score":0.0011064037,"about_ca_system_score_codex":0.0002997449,"about_ca_system_score_gemma":0.0006997488,"threshold_uncertainty_score":0.0049354434},"labels":[],"label_agreement":null},{"id":"W2100863752","doi":"10.1109/26.891203","title":"Information theoretic considerations for coded modulation over fading channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Queen's University","funders":"","keywords":"Fading; Rayleigh fading; Additive white Gaussian noise; Fading distribution; Channel state information; Algorithm; Diversity scheme; Probability of error; Mathematics; Computer science; Diversity combining; Electronic engineering; Channel (broadcasting); Telecommunications; Decoding methods; Topology (electrical circuits); Wireless; Engineering","score_opus":0.02620171050907693,"score_gpt":0.2730852568252837,"score_spread":0.24688354631620674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100863752","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.06775749,0.0030912866,0.8967716,0.0012147436,0.0003278005,0.00008973942,0.00023654217,0.000164587,0.030346135],"genre_scores_gemma":[0.8787047,0.00542841,0.10801796,0.00047191395,0.00056009216,0.0002970984,0.00038060138,0.0001841467,0.005955092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988668,0.00041411622,0.000036238358,0.000050345145,0.0004988787,0.0001336909],"domain_scores_gemma":[0.9880463,0.009576033,0.0005979641,0.00060242414,0.0010889947,0.000088184475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022242407,0.0013622566,0.00067146245,0.0017665774,0.00076235423,0.002053162,0.0010252373,0.001204821,0.004407135],"category_scores_gemma":[0.02455644,0.0004023193,0.00051472377,0.0016122574,0.001783262,0.00304959,0.0011407069,0.0013911997,0.0007567151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049239632,0.00003085157,0.00040357767,0.00013037707,0.000019722835,0.00023980334,0.00007950046,0.6267929,0.0024544282,0.36094815,0.0011718811,0.0076796263],"study_design_scores_gemma":[0.000007936124,0.00004275781,0.00022282037,0.00006824473,0.000012733626,0.00015286,0.000041805502,0.8736731,0.0016511407,0.12319871,0.0008991705,0.000028713297],"about_ca_topic_score_codex":0.001286594,"about_ca_topic_score_gemma":0.0014534454,"teacher_disagreement_score":0.004407135,"about_ca_system_score_codex":0.0017981115,"about_ca_system_score_gemma":0.0009252773,"threshold_uncertainty_score":0.014743328},"labels":[],"label_agreement":null},{"id":"W2101081066","doi":"10.1109/26.939904","title":"An overlapping window decorrelating multiuser detector for DS-CDMA radio channels","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Decorrelation; Detector; Code division multiple access; Computer science; Spread spectrum; Electronic engineering; Multiuser detection; Algorithm; Window (computing); Detection theory; Telecommunications; Engineering","score_opus":0.06766013472288533,"score_gpt":0.3371466916258581,"score_spread":0.26948655690297274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101081066","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.008190968,0.0006872051,0.9899346,0.00005240592,0.000090506925,0.00003153086,0.0000263775,0.00029455248,0.00069167145],"genre_scores_gemma":[0.2005915,0.0008337307,0.79460293,0.00018055666,0.00014503322,0.00011168323,0.00011529736,0.000039446808,0.003379931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.00013654114,0.000021183503,0.000076239485,0.00023952979,0.00004194622],"domain_scores_gemma":[0.99940825,0.00025783663,0.000057474703,0.00006805538,0.0001679387,0.000040413022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072463823,0.0004280209,0.0005754799,0.00044304904,0.0002953111,0.00046976528,0.0006245206,0.0005944683,0.00079295307],"category_scores_gemma":[0.0013140724,0.00026259787,0.00026555342,0.00037792514,0.00040257213,0.00070278265,0.0004685283,0.00069562346,0.00043960885],"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.0009043063,0.00023418403,0.0024708817,0.00055754045,0.00016339468,0.00066933315,0.00014492418,0.071495324,0.288679,0.04939005,0.0051581278,0.5801329],"study_design_scores_gemma":[0.00007690182,0.00063208025,0.0010985364,0.000032567,0.0000895056,0.0015789369,0.000018706614,0.8784376,0.08986703,0.0067308825,0.021360727,0.00007652615],"about_ca_topic_score_codex":0.00022289978,"about_ca_topic_score_gemma":0.0006379371,"teacher_disagreement_score":0.00079295307,"about_ca_system_score_codex":0.00028526626,"about_ca_system_score_gemma":0.00043689334,"threshold_uncertainty_score":0.0038323402},"labels":[],"label_agreement":null},{"id":"W2101246173","doi":"10.1109/tcomm.2005.855007","title":"Revised Analyses of Postdetection Switched Combining in Nakagami-<tex>$m$</tex>Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Frequency-shift keying; Fading; Rician fading; Mathematics; Rayleigh fading; Bit error rate; Phase-shift keying; Statistics; Algorithm; Telecommunications; Computer science; Demodulation; Decoding methods; Channel (broadcasting)","score_opus":0.047528809034075206,"score_gpt":0.32355914646187983,"score_spread":0.27603033742780464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101246173","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.14010629,0.0051162527,0.8206888,0.00045373917,0.00015311353,0.000056229528,0.00026683006,0.00049179234,0.032667007],"genre_scores_gemma":[0.9187718,0.0042050276,0.06580414,0.00025903346,0.0002230607,0.00005998195,0.00027502168,0.00017953027,0.010222247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.0002936934,0.00006478828,0.0001279325,0.0007737223,0.00018026358],"domain_scores_gemma":[0.99496424,0.0029504367,0.0003890756,0.0004820823,0.001142275,0.0000719013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018326298,0.00152073,0.0007959028,0.0010321524,0.00041378543,0.0016137202,0.00088907644,0.0005476267,0.0044501834],"category_scores_gemma":[0.006289762,0.000416673,0.0007157916,0.001254325,0.0009580125,0.0014626371,0.0007282031,0.000986314,0.0011743999],"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.0005941542,0.00008331661,0.0023090318,0.0005243162,0.00019277149,0.0003490892,0.0002933213,0.7100507,0.059986107,0.122448884,0.0023332885,0.100834884],"study_design_scores_gemma":[0.000020698342,0.00016961014,0.0019371473,0.000048478953,0.00016872236,0.00033094033,0.000049979502,0.92483014,0.03200537,0.035279844,0.005103197,0.000055863038],"about_ca_topic_score_codex":0.001674028,"about_ca_topic_score_gemma":0.0015826651,"teacher_disagreement_score":0.0044501834,"about_ca_system_score_codex":0.0015007365,"about_ca_system_score_gemma":0.0008150631,"threshold_uncertainty_score":0.014887333},"labels":[],"label_agreement":null},{"id":"W2101637789","doi":"10.1109/26.939851","title":"Single parity check product codes","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":110,"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","score_opus":0.06367548601671887,"score_gpt":0.29474189126887845,"score_spread":0.2310664052521596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101637789","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.155909,0.0028295624,0.821845,0.00039683608,0.0001943672,0.00010715648,0.00033611374,0.0008802431,0.017501686],"genre_scores_gemma":[0.9012874,0.0008722052,0.09410259,0.0001410311,0.00008956116,0.000083730694,0.00023807657,0.000065914806,0.0031195008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985777,0.0003859706,0.000047506015,0.00020054584,0.0006149263,0.00017325747],"domain_scores_gemma":[0.995749,0.0021726214,0.00033959304,0.0005607418,0.0010846312,0.00009340876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011943813,0.00072151463,0.0006986594,0.00079300144,0.00052539597,0.0013407359,0.00095086725,0.00081116107,0.0021313427],"category_scores_gemma":[0.006423314,0.00023410968,0.00031790437,0.0009885546,0.000896124,0.001421414,0.0008561082,0.00067246467,0.00077098166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006994433,0.000085450825,0.0029945374,0.0003837409,0.0001313274,0.00084312976,0.00015745105,0.48102143,0.025454197,0.307894,0.0036754168,0.17665976],"study_design_scores_gemma":[0.000043561693,0.0002843422,0.00043167782,0.00004402477,0.000038363807,0.0009216766,0.000023441127,0.9014005,0.017217468,0.07529222,0.004260328,0.000042400963],"about_ca_topic_score_codex":0.00087172684,"about_ca_topic_score_gemma":0.0005416782,"teacher_disagreement_score":0.0021313427,"about_ca_system_score_codex":0.0005899382,"about_ca_system_score_gemma":0.00086374325,"threshold_uncertainty_score":0.007130027},"labels":[],"label_agreement":null},{"id":"W2101704919","doi":"10.1109/tcomm.2004.826412","title":"Transmission Properties of Conjugate-Root Pulses","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","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":"University of Alberta","funders":"","keywords":"Intersymbol interference; Pulse shaping; Raised-cosine filter; Transmission (telecommunications); Electronic engineering; Matched filter; Filter (signal processing); Interference (communication); Computer science; Pulse (music); Data transmission; Telecommunications; Root-raised-cosine filter; Optics; Low-pass filter; Physics; Bandwidth (computing); Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.02633962944648991,"score_gpt":0.23074255455222167,"score_spread":0.20440292510573177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101704919","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.93790495,0.00088542514,0.04267659,0.00013696526,0.000045367782,0.00003871773,0.00012695102,0.00012452147,0.018060546],"genre_scores_gemma":[0.9899733,0.0003632239,0.0050639827,0.00003618028,0.000019378027,0.000012195535,0.000078934696,0.00002603886,0.0044268114],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997607,0.000041972293,0.000007737904,0.000034859793,0.0001168903,0.000037858066],"domain_scores_gemma":[0.9973373,0.0015147268,0.00034746437,0.00023720335,0.00049394584,0.00006920247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054425036,0.00022170346,0.00022252135,0.0003723868,0.00027180972,0.00063770794,0.0003278408,0.00037257286,0.003659457],"category_scores_gemma":[0.0023142167,0.00016410719,0.00013590332,0.00040074784,0.0005885384,0.000827945,0.00029300107,0.00048617015,0.00082820933],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012745548,0.00010100656,0.002968592,0.0002253055,0.00003666,0.00075850455,0.0012878864,0.010648481,0.8845773,0.061298486,0.00085344055,0.035969798],"study_design_scores_gemma":[0.000087498,0.0012350846,0.0060112043,0.00004536108,0.000044952914,0.0021483696,0.00032680048,0.1031711,0.8703762,0.0099142,0.006556918,0.00008229474],"about_ca_topic_score_codex":0.00019140264,"about_ca_topic_score_gemma":0.00008818999,"teacher_disagreement_score":0.003659457,"about_ca_system_score_codex":0.00035413678,"about_ca_system_score_gemma":0.00019570065,"threshold_uncertainty_score":0.012242079},"labels":[],"label_agreement":null},{"id":"W2101899205","doi":"10.1109/tcomm.2005.849792","title":"Accurate Performance Evaluation of Time-Hopping and Direct-Sequence UWB Systems in Multi-User Interference","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":128,"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":"Time-hopping; Keying; Additive white Gaussian noise; Interference (communication); Bit error rate; Algorithm; Frequency-hopping spread spectrum; Phase-shift keying; Gaussian noise; Computer science; Modulation (music); Electronic engineering; Gaussian; Spread spectrum; Noise (video); Signal-to-noise ratio (imaging); Binary number; Telecommunications; White noise; Mathematics; Decoding methods; Physics; Engineering; Acoustics; Artificial intelligence; Pulse-amplitude modulation; Channel (broadcasting)","score_opus":0.07523173087991988,"score_gpt":0.30456971790822657,"score_spread":0.22933798702830668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101899205","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.18195882,0.001626472,0.8113549,0.00010187873,0.00003699539,0.00004097231,0.00006739061,0.0007890795,0.004023504],"genre_scores_gemma":[0.9643386,0.00038587372,0.03447491,0.000029830422,0.000015672378,0.000028614573,0.000046786532,0.000027561808,0.00065214565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972531,0.0007181748,0.00010865788,0.00017579198,0.0015346822,0.0002096088],"domain_scores_gemma":[0.9947753,0.0034112423,0.00029460303,0.0006322033,0.00082753814,0.000059143877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024025147,0.00064151455,0.0011718683,0.0008897747,0.00037711338,0.0009832334,0.00081392477,0.0010927905,0.00071146083],"category_scores_gemma":[0.011695109,0.0003207695,0.0004052138,0.0008251919,0.0007250831,0.0015557262,0.0009447698,0.000460105,0.00032546252],"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.00030153824,0.0000327686,0.0021585252,0.00013095594,0.000060477098,0.0001982646,0.00016465911,0.9163761,0.015021292,0.012243698,0.0002082048,0.053103507],"study_design_scores_gemma":[0.0000065612626,0.00009686034,0.0005699719,0.000010196882,0.00001307212,0.00016861601,0.00001601657,0.9886671,0.00883253,0.0014390898,0.00016453466,0.000015335181],"about_ca_topic_score_codex":0.0016830603,"about_ca_topic_score_gemma":0.0009498363,"teacher_disagreement_score":0.0024025147,"about_ca_system_score_codex":0.0011999283,"about_ca_system_score_gemma":0.00062629656,"threshold_uncertainty_score":0.0127058625},"labels":[],"label_agreement":null},{"id":"W2102105576","doi":"10.1109/tcomm.2009.03.070115","title":"Optimal adaptive modulation and coding with switching costs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":19,"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":"Link adaptation; Fading; Coding (social sciences); Computer science; Markov decision process; Adaptive coding; Mathematical optimization; Monotonic function; Markov process; Control theory (sociology); Channel (broadcasting); Mathematics; Algorithm; Telecommunications","score_opus":0.015728875812314063,"score_gpt":0.23497690477160763,"score_spread":0.21924802895929357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102105576","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.07821638,0.00048925064,0.91262746,0.0005454437,0.00006392089,0.00009231966,0.00009149995,0.00013704444,0.007736664],"genre_scores_gemma":[0.9391936,0.0002217173,0.058447607,0.00008799159,0.000036174133,0.00008955789,0.00004407931,0.000021677824,0.0018574966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930143,0.00021260948,0.000029094028,0.00010320279,0.00020192601,0.00015172966],"domain_scores_gemma":[0.99844176,0.001046224,0.00017181283,0.00009290236,0.00018270692,0.0000646064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078882946,0.00063890516,0.0006364547,0.00042404418,0.00030230053,0.0009013072,0.00089836936,0.0007487829,0.0019128524],"category_scores_gemma":[0.0041252184,0.00025522363,0.00027295682,0.0006025227,0.0008360768,0.001246217,0.00075425504,0.0009588832,0.00017516538],"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.00012187465,0.00006618637,0.00034570324,0.000054724736,0.000018097833,0.000094043426,0.000040246952,0.89345104,0.0037070932,0.06804072,0.00076983485,0.033290453],"study_design_scores_gemma":[0.000016180278,0.000024414185,0.000064592794,0.000005319532,0.0000052877936,0.000019312805,0.000007211095,0.9843762,0.0008854823,0.0143444445,0.00024590106,0.0000057491757],"about_ca_topic_score_codex":0.0028300255,"about_ca_topic_score_gemma":0.0018839828,"teacher_disagreement_score":0.0028300255,"about_ca_system_score_codex":0.0011696139,"about_ca_system_score_gemma":0.001683042,"threshold_uncertainty_score":0.008486152},"labels":[],"label_agreement":null},{"id":"W2102169767","doi":"10.1109/26.871391","title":"Gallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":36,"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":"Algorithm; Additive white Gaussian noise; Decoding methods; Code division multiple access; Fading; Computer science; Frame (networking); Turbo code; Mathematics; Theoretical computer science; Low-density parity-check code; White noise; Telecommunications","score_opus":0.015325679743627306,"score_gpt":0.25404894938696393,"score_spread":0.23872326964333662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102169767","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.021840747,0.022976302,0.901012,0.0015899922,0.00045492128,0.00015094175,0.00038601767,0.00065091334,0.050938107],"genre_scores_gemma":[0.60847825,0.04383502,0.32608056,0.0011855864,0.0013886055,0.001066896,0.0008260238,0.0003325457,0.016806537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897635,0.00032587105,0.00004518336,0.00012251109,0.0003986891,0.00013143447],"domain_scores_gemma":[0.9965166,0.0022576493,0.00031001293,0.00041940127,0.0003798912,0.00011634668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013347797,0.0014334789,0.00061055046,0.0017392625,0.0008677329,0.0017928298,0.0008325565,0.0015203332,0.003158854],"category_scores_gemma":[0.008557275,0.0005358952,0.0005272286,0.0020858957,0.0016394538,0.0027707706,0.0022076734,0.0032977453,0.0017204498],"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.000084673266,0.00003913414,0.0003239783,0.00030363005,0.000024405514,0.00012722267,0.00025576187,0.054167926,0.004889981,0.8667547,0.0071395165,0.06588914],"study_design_scores_gemma":[0.000018765577,0.00009278288,0.00023714888,0.00024301036,0.000025126135,0.00048134828,0.000059638187,0.15038016,0.0082271425,0.8065186,0.033654775,0.000061482504],"about_ca_topic_score_codex":0.0007524438,"about_ca_topic_score_gemma":0.0006235838,"teacher_disagreement_score":0.003158854,"about_ca_system_score_codex":0.0015522564,"about_ca_system_score_gemma":0.0008768728,"threshold_uncertainty_score":0.011262417},"labels":[],"label_agreement":null},{"id":"W2102226403","doi":"10.1109/tcomm.2003.811421","title":"A method for increasing downlink capacity by coded multiuser transmission with a base station antenna array","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Simon Fraser University","funders":"","keywords":"Computer science; Telecommunications link; Electronic engineering; Base station; Pairwise error probability; Antenna array; Algorithm; Transmission (telecommunications); Antenna diversity; Antenna (radio); Fading; Decoding methods; Telecommunications; Engineering","score_opus":0.03105875438405074,"score_gpt":0.29108862391625656,"score_spread":0.2600298695322058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102226403","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.009686957,0.00024166418,0.9844508,0.00016346278,0.00007178285,0.00007295457,0.00004538808,0.00065539725,0.004611535],"genre_scores_gemma":[0.25380373,0.00028614898,0.74019355,0.00029167117,0.00012774912,0.0002161338,0.00011999443,0.000109006716,0.004852037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.000118087846,0.000024412602,0.00006550277,0.000216749,0.000048187143],"domain_scores_gemma":[0.999064,0.00030870095,0.000079144156,0.0002816188,0.0002143581,0.000052126386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041814608,0.0005858654,0.00044533046,0.00068220217,0.00044664243,0.00063354615,0.0009696221,0.000638042,0.002926558],"category_scores_gemma":[0.0018894676,0.0002952179,0.00033748327,0.00059234514,0.0006080365,0.00092094345,0.000999905,0.0009685978,0.0011015927],"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.00036373638,0.00024760826,0.0009875133,0.00033883695,0.00012899737,0.0003710302,0.00026915508,0.13020636,0.26105338,0.1048053,0.005102048,0.4961261],"study_design_scores_gemma":[0.00014096087,0.0005536915,0.0007936134,0.000095650335,0.00009413913,0.0009836071,0.000052793017,0.74175835,0.19896655,0.020576645,0.03585949,0.00012457988],"about_ca_topic_score_codex":0.0005743166,"about_ca_topic_score_gemma":0.0012534531,"teacher_disagreement_score":0.002926558,"about_ca_system_score_codex":0.0004970704,"about_ca_system_score_gemma":0.00063486176,"threshold_uncertainty_score":0.009790301},"labels":[],"label_agreement":null},{"id":"W2103117825","doi":"10.1109/tcomm.2004.826351","title":"Design of Nonuniformly Spaced Tapped-Delay-Line Equalizers for Sparse Multipath Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":38,"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":"Channel (broadcasting); Delay spread; Filter (signal processing); Multipath propagation; Algorithm; Computer science; Matched filter; Control theory (sociology); Raised-cosine filter; Minimum mean square error; Electronic engineering; Mathematics; Filter design; Root-raised-cosine filter; Engineering; Telecommunications; Statistics","score_opus":0.07746427210293072,"score_gpt":0.31266530155029737,"score_spread":0.23520102944736665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103117825","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.008373224,0.00006119658,0.99064904,0.000039930594,0.000015031847,0.000026194715,0.000013435466,0.00012428022,0.00069758674],"genre_scores_gemma":[0.3192441,0.00031796648,0.6780068,0.00011364788,0.000071076516,0.00019435065,0.00007302266,0.000039511287,0.0019395804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.00013123272,0.000040647952,0.00008288964,0.00011789119,0.000045589935],"domain_scores_gemma":[0.9991353,0.00033449713,0.00018084307,0.00008294196,0.00024515713,0.000021370111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297606,0.0005601523,0.00039222438,0.00041949993,0.00024231413,0.0006902069,0.0007209205,0.0005262408,0.0012965322],"category_scores_gemma":[0.0025530534,0.00030306814,0.00025227835,0.00037091007,0.00046321296,0.00083834236,0.00041844253,0.00049477606,0.00056909857],"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.00044319368,0.00009792871,0.0014152534,0.0002551687,0.0000970666,0.0001974795,0.00022106206,0.39874375,0.2050191,0.05351749,0.0022784336,0.33771408],"study_design_scores_gemma":[0.000059229686,0.00016661863,0.00027592175,0.000022092703,0.00002864237,0.00016459597,0.000039179507,0.9221093,0.06947873,0.004487093,0.0031518317,0.000016775839],"about_ca_topic_score_codex":0.0005322242,"about_ca_topic_score_gemma":0.0011776872,"teacher_disagreement_score":0.0012965322,"about_ca_system_score_codex":0.0005266487,"about_ca_system_score_gemma":0.0005787296,"threshold_uncertainty_score":0.004337311},"labels":[],"label_agreement":null},{"id":"W2103435488","doi":"10.1109/tcomm.2009.0901.060118","title":"Design of irregular LDPC codes for BIAWGN channels with SNR mismatch","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"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":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Noisy-channel coding theorem; Decoding methods; Turbo code; Signal-to-noise ratio (imaging); Channel (broadcasting); Concatenated error correction code; Computer science; Belief propagation; Binary number; Mathematics; Error floor; Block code; Telecommunications; Arithmetic","score_opus":0.05956928053002612,"score_gpt":0.302457746603452,"score_spread":0.24288846607342585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103435488","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.115471855,0.0002217708,0.88164306,0.00014654157,0.000025224295,0.000052537165,0.000063026804,0.00022903981,0.0021469083],"genre_scores_gemma":[0.8331893,0.00021243424,0.1654054,0.00006263181,0.000016841923,0.000098001365,0.00009010074,0.000045962464,0.00087933685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994199,0.00021043618,0.00004346354,0.00008623313,0.00018096065,0.000058911297],"domain_scores_gemma":[0.99801314,0.00082125585,0.000410387,0.00023731135,0.00043018974,0.000087695495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843856,0.00050889427,0.00043028974,0.0005972998,0.00030263158,0.0006356733,0.00043755939,0.00052871066,0.00038499208],"category_scores_gemma":[0.0037544523,0.000210871,0.00022076354,0.0005044602,0.00072146655,0.0005933427,0.0006580806,0.0004978103,0.00014945869],"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.00041445397,0.000059035166,0.0022938168,0.00014875675,0.000041449806,0.00020162386,0.00021756373,0.82494146,0.042388275,0.062268596,0.00059098884,0.06643399],"study_design_scores_gemma":[0.000019981957,0.00008789479,0.0001864502,0.0000127221565,0.000008368175,0.00007916716,0.000013716069,0.9769951,0.013691388,0.008080366,0.0008123116,0.000012603255],"about_ca_topic_score_codex":0.00062903756,"about_ca_topic_score_gemma":0.0006178943,"teacher_disagreement_score":0.000843856,"about_ca_system_score_codex":0.0006511475,"about_ca_system_score_gemma":0.00081798463,"threshold_uncertainty_score":0.004724443},"labels":[],"label_agreement":null},{"id":"W2103642899","doi":"10.1109/tcomm.2005.857160","title":"DC-Free Error-Control Block Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Alberta","funders":"","keywords":"Block code; Concatenated error correction code; Linear code; Turbo code; Computer science; BCH code; Serial concatenated convolutional codes; List decoding; Algorithm; Low-density parity-check code; Tornado code; Forward error correction; Decoding methods; Theoretical computer science","score_opus":0.033329838642760554,"score_gpt":0.29479614562807477,"score_spread":0.2614663069853142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103642899","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.044419914,0.0022900742,0.9283493,0.00043108207,0.00027477418,0.00015837645,0.00040027936,0.0011239526,0.022552196],"genre_scores_gemma":[0.62205106,0.0017620819,0.34715044,0.00059949583,0.00022148679,0.00032749955,0.00079208694,0.000133147,0.02696265],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.000106039755,0.000044363373,0.000086525164,0.000386469,0.000081381695],"domain_scores_gemma":[0.9981567,0.00044184332,0.0001936522,0.00038926105,0.000752749,0.000065803586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000450036,0.00041942336,0.00038455924,0.0005713195,0.00042285398,0.0006293062,0.00068712624,0.00058665464,0.002848292],"category_scores_gemma":[0.0024192159,0.00014594285,0.00017010047,0.000654768,0.00044994464,0.000779661,0.0006480082,0.000777456,0.0012733404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008010947,0.000098266806,0.0017469147,0.00041706936,0.000056936453,0.0004217362,0.00022068596,0.071503624,0.110633865,0.32983434,0.008324416,0.47594112],"study_design_scores_gemma":[0.0001583378,0.0003602726,0.0012791278,0.00016886507,0.000069618065,0.0014144941,0.00004557364,0.56957555,0.2304883,0.06392737,0.13241297,0.00009951303],"about_ca_topic_score_codex":0.0014336441,"about_ca_topic_score_gemma":0.0024978337,"teacher_disagreement_score":0.002848292,"about_ca_system_score_codex":0.00051271025,"about_ca_system_score_gemma":0.0008699454,"threshold_uncertainty_score":0.009528518},"labels":[],"label_agreement":null},{"id":"W2103728008","doi":"10.1109/tcomm.2004.833197","title":"Sequence Detection and Adaptive Channel Estimation for ISI Channels Under Class-A Impulsive Noise","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":15,"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":"Intersymbol interference; Algorithm; Gaussian noise; Computer science; Noise (video); Channel (broadcasting); Estimation theory; Entropy (arrow of time); Upper and lower bounds; Maximum likelihood sequence estimation; Fading; Mathematics; Control theory (sociology); Artificial intelligence; Telecommunications; Decoding methods","score_opus":0.04773712568564409,"score_gpt":0.2836725320555676,"score_spread":0.2359354063699235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103728008","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.05009278,0.00014287469,0.94887155,0.000049350794,0.000011301612,0.000010933024,0.000011497073,0.00010549809,0.00070415414],"genre_scores_gemma":[0.8778088,0.00026422396,0.12093623,0.000047515132,0.0000388312,0.00003277261,0.00004409557,0.000014124685,0.0008133926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994603,0.0001381402,0.000023947361,0.00007872785,0.0002413973,0.000057472378],"domain_scores_gemma":[0.99802834,0.0014001944,0.00021160801,0.00011427291,0.0002114676,0.00003410015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752985,0.00042832768,0.00039215464,0.00047960458,0.000256192,0.00044959266,0.0005149095,0.0005763532,0.0004347372],"category_scores_gemma":[0.003973521,0.00015434764,0.00018433706,0.0005707706,0.00065019313,0.0009213121,0.00048096082,0.0004228649,0.00010642553],"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.00042560932,0.000075978016,0.0029271194,0.00014039778,0.00005908997,0.00031871255,0.00016947192,0.73698467,0.035486627,0.048522536,0.00044878555,0.17444104],"study_design_scores_gemma":[0.000008407169,0.000044672648,0.00035854822,0.0000041163653,0.000009182905,0.00009810383,0.000014281478,0.98696935,0.007850354,0.0044064857,0.00022621098,0.000010207281],"about_ca_topic_score_codex":0.0009884505,"about_ca_topic_score_gemma":0.0011620529,"teacher_disagreement_score":0.0009884505,"about_ca_system_score_codex":0.00040720106,"about_ca_system_score_gemma":0.00053059804,"threshold_uncertainty_score":0.003571391},"labels":[],"label_agreement":null},{"id":"W2103781515","doi":"10.1109/tcomm.2010.03.070333","title":"UWB receiver designs based on a gaussian-laplacian noise-plus-MAI model","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":72,"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":"Additive white Gaussian noise; Rake receiver; Electronic engineering; Fading; Multipath propagation; Interference (communication); Bandwidth (computing); Rake; Computer science; Gaussian noise; Multipath interference; Matched filter; Gaussian; Algorithm; Telecommunications; White noise; Engineering; Physics; Channel (broadcasting); Decoding methods","score_opus":0.031008487362631978,"score_gpt":0.2561945189994218,"score_spread":0.22518603163678982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103781515","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.0057748873,0.00027256025,0.992187,0.00007137728,0.000040262606,0.000023726026,0.000019356086,0.00022053011,0.001390262],"genre_scores_gemma":[0.50215596,0.0013030964,0.48850828,0.00022217623,0.00019665484,0.00015939756,0.00012224652,0.000059578426,0.007272616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930394,0.0002666892,0.000039325965,0.00009451838,0.00022588077,0.00006972407],"domain_scores_gemma":[0.99926454,0.0003527369,0.000079428646,0.000084189196,0.00019682547,0.000022290265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130239,0.0007973709,0.00089242886,0.0004439978,0.0004316313,0.00095436745,0.001499348,0.001256676,0.0011923977],"category_scores_gemma":[0.0020116684,0.00036434337,0.0006514454,0.0005486986,0.00052481017,0.0009904329,0.000500629,0.0010406966,0.0010046312],"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.00045898103,0.0001827533,0.0018441927,0.000472901,0.00022991572,0.00050293386,0.00043622265,0.540758,0.07276928,0.19900689,0.0025462823,0.18079168],"study_design_scores_gemma":[0.000019637686,0.00019249495,0.00012706807,0.000019835394,0.000055260552,0.0004067347,0.00002100096,0.97755855,0.0103025995,0.009222182,0.0020448028,0.000029820272],"about_ca_topic_score_codex":0.000731715,"about_ca_topic_score_gemma":0.0010345412,"teacher_disagreement_score":0.001499348,"about_ca_system_score_codex":0.00065982714,"about_ca_system_score_gemma":0.0007060297,"threshold_uncertainty_score":0.0068877935},"labels":[],"label_agreement":null},{"id":"W2103880125","doi":"10.1109/tcomm.2003.822704","title":"An Analytical Method for Approximate Performance Evaluation of Binary Linear Block Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":25,"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":"Binary number; Additive white Gaussian noise; Algorithm; Mathematics; Series expansion; Phase-shift keying; Series (stratigraphy); Applied mathematics; Binary code; Gaussian; Keying; Focus (optics); Probability density function; Block (permutation group theory); Function (biology); Computer science; Decoding methods; White noise; Bit error rate; Statistics; Mathematical analysis; Telecommunications; Arithmetic; Combinatorics","score_opus":0.07551570766824982,"score_gpt":0.38350854639311377,"score_spread":0.30799283872486394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103880125","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.0028634535,0.0003665126,0.9938653,0.00005219595,0.000024271541,0.00002034893,0.000017656053,0.0002566099,0.0025335706],"genre_scores_gemma":[0.42277294,0.001978058,0.5679961,0.00016643808,0.00014459634,0.00029236253,0.00015547803,0.00031933404,0.0061746677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886656,0.0003962169,0.000031843163,0.000052767184,0.00059158244,0.00006115808],"domain_scores_gemma":[0.9987709,0.00067722664,0.00008241041,0.00015905335,0.00028659683,0.000023884513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012887162,0.00091262854,0.000773745,0.0010624941,0.0003467083,0.00085977267,0.00083283265,0.0007560397,0.002343381],"category_scores_gemma":[0.0065905275,0.00032791146,0.00041685716,0.0008831136,0.0006152593,0.0013207424,0.00071864005,0.0009207815,0.0010416807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006959628,0.000028215418,0.00020127004,0.0001765064,0.000025982008,0.00010915356,0.00008741425,0.7765886,0.015021386,0.14008795,0.0016972332,0.06590672],"study_design_scores_gemma":[0.0000023528905,0.000015858333,0.00002609396,0.000012031075,0.000003237379,0.000037911563,0.0000038262965,0.9900804,0.001552822,0.007271669,0.0009871717,0.0000065670465],"about_ca_topic_score_codex":0.0013740754,"about_ca_topic_score_gemma":0.0007861647,"teacher_disagreement_score":0.002343381,"about_ca_system_score_codex":0.0011146745,"about_ca_system_score_gemma":0.0007938918,"threshold_uncertainty_score":0.008087635},"labels":[],"label_agreement":null},{"id":"W2104090769","doi":"10.1109/tcomm.2011.102910.090386","title":"Interference Diversity Gain and its Application in Multi-Channel Systems: Capacity Maximization and QoS Guarantee Strategies","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Interference (communication); Channel (broadcasting); Resource allocation; Diversity scheme; Spectral efficiency; Computer network; Wireless; Diversity gain; Throughput; Channel allocation schemes; Channel capacity; Fading; Electronic engineering; Telecommunications; Engineering","score_opus":0.04049512902770024,"score_gpt":0.25222478217223226,"score_spread":0.21172965314453202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104090769","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.032038487,0.004081518,0.9368268,0.00097108324,0.000077509234,0.000041061958,0.000038331596,0.000099415025,0.025825752],"genre_scores_gemma":[0.96625704,0.0022218789,0.028538486,0.00013344623,0.00015426404,0.00006902234,0.000015303369,0.000032954526,0.0025776287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905175,0.0004081399,0.00002224933,0.00006167588,0.00031389532,0.0001422332],"domain_scores_gemma":[0.9979657,0.001455843,0.00018260954,0.0000951599,0.00022123821,0.00007943782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012963747,0.0009458074,0.0006351471,0.00066725217,0.00045641596,0.001629045,0.00093261915,0.0010921463,0.0015104596],"category_scores_gemma":[0.0036186634,0.00028713592,0.0005047599,0.0009716802,0.0016943475,0.0011693153,0.0016534856,0.0009658055,0.00026227784],"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.000058801015,0.00005437225,0.00040933603,0.00012747277,0.00004906122,0.0002064365,0.00013303246,0.83079475,0.004576217,0.14164764,0.0009232918,0.021019597],"study_design_scores_gemma":[0.00000674004,0.00004995599,0.00015755302,0.000019363733,0.000010743716,0.00006698283,0.000032113534,0.96177256,0.00094346824,0.03625603,0.00067173026,0.000012704377],"about_ca_topic_score_codex":0.0015329826,"about_ca_topic_score_gemma":0.0010654838,"teacher_disagreement_score":0.001629045,"about_ca_system_score_codex":0.0014542595,"about_ca_system_score_gemma":0.00081183383,"threshold_uncertainty_score":0.010551453},"labels":[],"label_agreement":null},{"id":"W2104265071","doi":"10.1109/tcomm.2011.012711.090433","title":"DPC Rates and Multiplexing Gains for MIMO Broadcast Systems with Multi-Dimensional Space-Time Modulation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"McGill University","funders":"","keywords":"Multiplexing; MIMO; Transmitter; Computer science; Transmission (telecommunications); Modulation (music); Spatial multiplexing; Space–time code; Wireless; Coding (social sciences); Disjoint sets; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Channel (broadcasting); Engineering; Physics","score_opus":0.1369186114890206,"score_gpt":0.31023006074971227,"score_spread":0.17331144926069167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104265071","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.16514656,0.0074134846,0.76614594,0.0017268178,0.00017999594,0.0001328078,0.00040762927,0.00046340775,0.058383353],"genre_scores_gemma":[0.96025455,0.003636049,0.03191247,0.00022425705,0.00021333511,0.0002323132,0.00016340708,0.00013474202,0.0032288719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972799,0.0009083163,0.000078754805,0.00019354114,0.0009486407,0.0005909569],"domain_scores_gemma":[0.98125124,0.014100272,0.001436104,0.001373505,0.0015465427,0.0002923449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150004,0.0014815221,0.0010605559,0.0016351965,0.001054923,0.0029732636,0.0014254093,0.0011563181,0.0025083108],"category_scores_gemma":[0.024482414,0.00085150835,0.0006192892,0.0018497258,0.0022876444,0.0031613025,0.0024472615,0.002663807,0.0006828031],"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.00017941893,0.000088943496,0.00081580266,0.0001922785,0.000041363077,0.00031709168,0.0003367218,0.5943733,0.00765023,0.36849844,0.0017531401,0.02575334],"study_design_scores_gemma":[0.00001556215,0.000076406155,0.00042085376,0.00008197052,0.000025809997,0.00033825112,0.00011750136,0.9030063,0.0035186778,0.09077272,0.0015793105,0.000046674802],"about_ca_topic_score_codex":0.0024551912,"about_ca_topic_score_gemma":0.0019690504,"teacher_disagreement_score":0.004150004,"about_ca_system_score_codex":0.0034814253,"about_ca_system_score_gemma":0.0013756899,"threshold_uncertainty_score":0.025259674},"labels":[],"label_agreement":null},{"id":"W2104527807","doi":"10.1109/tcomm.2008.060347","title":"Performance Improvement of Non-Data-Aided Feedforward Symbol Timing Estimation Using the \"Better Than\" Raised-Cosine Pulse","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advancements in PLL and VCO Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Raised-cosine filter; Pulse (music); Computer science; Trigonometric functions; Symbol (formal); Pulse shaping; Discrete cosine transform; Electronic engineering; Algorithm; Mathematics; Engineering; Telecommunications; Artificial intelligence; Physics; Bandwidth (computing); Power (physics)","score_opus":0.07818573419489822,"score_gpt":0.3004064761627917,"score_spread":0.2222207419678935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104527807","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.36724347,0.0012179347,0.61661017,0.00058198994,0.00034988584,0.000066331006,0.00009912524,0.0024973622,0.011333718],"genre_scores_gemma":[0.94240725,0.00022367838,0.05541338,0.00012025164,0.000055963497,0.000017083896,0.00007464074,0.000027493643,0.001660303],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918085,0.00024297566,0.000049623006,0.00013625645,0.00029554026,0.00009476414],"domain_scores_gemma":[0.99766797,0.001380245,0.00018404213,0.00023292277,0.00047951983,0.00005529173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008775448,0.0004722135,0.00044461133,0.0003575643,0.00026748946,0.00061049865,0.00056826544,0.0007539877,0.0018176828],"category_scores_gemma":[0.0031778403,0.00020468247,0.00016883506,0.00032628735,0.0002508546,0.000623914,0.00047540886,0.00055979495,0.00038303027],"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.0038038027,0.0002814637,0.0042080637,0.00063886837,0.00016565721,0.0007955252,0.0005167067,0.090070315,0.4430078,0.012487929,0.0024634919,0.4415603],"study_design_scores_gemma":[0.00014376112,0.0013097029,0.0037347253,0.00006330628,0.00010408486,0.0011397201,0.000040941217,0.63107854,0.35734472,0.001463424,0.003511052,0.00006602925],"about_ca_topic_score_codex":0.0004567694,"about_ca_topic_score_gemma":0.0006003627,"teacher_disagreement_score":0.0018176828,"about_ca_system_score_codex":0.00023990725,"about_ca_system_score_gemma":0.0006508497,"threshold_uncertainty_score":0.0060807467},"labels":[],"label_agreement":null},{"id":"W2104758809","doi":"10.1109/tcomm.2005.851582","title":"Sample Rejection for Efficient Simulation of Binary Coding Schemes Over Quantized Additive White Gaussian Noise Channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Alberta","funders":"","keywords":"Decoding methods; Algorithm; Additive white Gaussian noise; Binary number; Computer science; Hypersphere; Curse of dimensionality; Gaussian noise; Mathematics; White noise; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.05092323093219039,"score_gpt":0.3348693885056417,"score_spread":0.2839461575734513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104758809","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.18875451,0.00015020724,0.80709374,0.00025731136,0.000028261757,0.00009576296,0.000061657454,0.00050366874,0.0030548105],"genre_scores_gemma":[0.92730534,0.00008912943,0.071964525,0.000052635085,0.000007835588,0.00011593448,0.000046603644,0.00004939297,0.00036851456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00045556697,0.000028871797,0.000029616232,0.0002323706,0.00006665331],"domain_scores_gemma":[0.99525094,0.0037272053,0.0003034595,0.00035495273,0.0002917657,0.000071669085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018573711,0.00035705726,0.00045384152,0.00032455093,0.0002921748,0.0004935904,0.000609933,0.00051557325,0.0012718999],"category_scores_gemma":[0.009479052,0.00020948824,0.0003067565,0.0002840493,0.0007340603,0.00085020263,0.0006390373,0.000770686,0.00018969353],"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.0001309881,0.000025076475,0.00055105623,0.0000279632,0.000007497473,0.00003130592,0.000056567544,0.9761989,0.0023207858,0.016569931,0.00009144304,0.0039884993],"study_design_scores_gemma":[0.0000047827452,0.0000117201125,0.000020829973,0.0000017099377,5.2450764e-7,0.0000030938559,0.0000024470703,0.9979461,0.0007021135,0.0012521123,0.000052977615,0.0000015731575],"about_ca_topic_score_codex":0.0018762418,"about_ca_topic_score_gemma":0.0010859387,"teacher_disagreement_score":0.0018762418,"about_ca_system_score_codex":0.0006302008,"about_ca_system_score_gemma":0.0005075171,"threshold_uncertainty_score":0.009822845},"labels":[],"label_agreement":null},{"id":"W2104878965","doi":"10.1109/tcomm.2010.082010.090256","title":"Error Performance Analysis of BPSK Modulation in Physical-Layer Network-Coded Bidirectional Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"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":"Relay; Relay channel; Phase-shift keying; Rayleigh fading; Linear network coding; Bit error rate; Computer science; Algorithm; Topology (electrical circuits); Fading; Node (physics); Mathematics; Decoding methods; Computer network; Network packet; Engineering; Physics; Combinatorics","score_opus":0.04881039997255162,"score_gpt":0.3068714708438505,"score_spread":0.2580610708712989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104878965","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.3980714,0.0026447305,0.5856724,0.0006562244,0.00007299118,0.000065420754,0.00016180679,0.0003555388,0.012299555],"genre_scores_gemma":[0.9885958,0.00059871183,0.0094230585,0.00004156302,0.00001973672,0.000037449998,0.000046977028,0.0000443884,0.0011924063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981267,0.0006590806,0.00005846992,0.00013240364,0.0007355377,0.00028782376],"domain_scores_gemma":[0.9863695,0.010199313,0.00089156395,0.00047967344,0.0019365151,0.00012345854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037644568,0.0011548701,0.00087441725,0.000951542,0.00047855196,0.0010638396,0.0008534372,0.0010361588,0.0012190174],"category_scores_gemma":[0.018265441,0.0003231212,0.00031149067,0.00080009125,0.0015987775,0.0014868128,0.0014941591,0.000761701,0.0002655296],"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.0001768498,0.000031937278,0.0010448333,0.00008076368,0.000029966466,0.00011350004,0.00011089821,0.96422577,0.00431221,0.021669991,0.0002502638,0.00795292],"study_design_scores_gemma":[0.0000038949,0.000033191096,0.00016302707,0.000009477737,0.0000074078343,0.000030112491,0.000017985345,0.9959928,0.001043317,0.0026157396,0.00007393729,0.000009006821],"about_ca_topic_score_codex":0.0044056205,"about_ca_topic_score_gemma":0.0022843252,"teacher_disagreement_score":0.0044056205,"about_ca_system_score_codex":0.0018858784,"about_ca_system_score_gemma":0.001157166,"threshold_uncertainty_score":0.019908547},"labels":[],"label_agreement":null},{"id":"W2105077230","doi":"10.1109/tcomm.2007.902500","title":"Tree-Search Multiple-Symbol Differential Decoding for Unitary Space-Time Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":41,"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":"MIMO; Fading; Channel state information; Algorithm; Decoding methods; Computer science; Benchmark (surveying); Tree (set theory); Unitary matrix; Channel (broadcasting); Computational complexity theory; Mathematics; Telecommunications; Unitary state; Wireless","score_opus":0.038160652505204104,"score_gpt":0.2980205812435675,"score_spread":0.2598599287383634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105077230","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.011742477,0.00022180687,0.9866606,0.000053052765,0.000011692241,0.000013588042,0.000024203653,0.00013158226,0.0011410221],"genre_scores_gemma":[0.43465343,0.00057425007,0.56261814,0.0001345153,0.000028527162,0.00008954851,0.000136341,0.000036228757,0.0017289585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958366,0.00014345489,0.000026138634,0.000046516783,0.00015965317,0.000040598054],"domain_scores_gemma":[0.9989718,0.00060756877,0.000096857635,0.00011812178,0.00017764051,0.000027970596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045246418,0.0003552289,0.00047437334,0.00032210714,0.00023794,0.00045765436,0.00044008202,0.0004674833,0.00088287087],"category_scores_gemma":[0.0029759014,0.00016255729,0.0002451055,0.00068257574,0.00035054484,0.0006289935,0.0005446639,0.0005007369,0.00032768268],"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.00015941502,0.000055557768,0.0009796281,0.00020568683,0.000045843757,0.00013505283,0.00016347194,0.6338318,0.030479737,0.11491735,0.0017893635,0.21723706],"study_design_scores_gemma":[0.000006737765,0.00004614049,0.00006116798,0.0000072153566,0.000004392559,0.000059209695,0.000005853174,0.98667556,0.004914322,0.007060879,0.0011542612,0.0000043147365],"about_ca_topic_score_codex":0.0008940652,"about_ca_topic_score_gemma":0.0016235274,"teacher_disagreement_score":0.0008940652,"about_ca_system_score_codex":0.00047889378,"about_ca_system_score_gemma":0.00096216897,"threshold_uncertainty_score":0.0034746528},"labels":[],"label_agreement":null},{"id":"W2105451798","doi":"10.1109/tcomm.2003.809263","title":"Dynamic rate adaptation based on multidimensional multicode DS-CDMA in cellular wireless networks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Victoria; Simon Fraser University","funders":"","keywords":"Computer science; Fading; Code division multiple access; Base station; Multipath propagation; Telecommunications link; Cellular network; Computer network; Throughput; Network packet; Link adaptation; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.036282890273090986,"score_gpt":0.28670160399627204,"score_spread":0.25041871372318103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105451798","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.12597613,0.0015244894,0.8681415,0.0001686345,0.00007763792,0.000049443315,0.000021087344,0.0002455907,0.0037954673],"genre_scores_gemma":[0.97395486,0.0004057005,0.02492077,0.000025088957,0.000021716287,0.000031940697,0.000010489998,0.000009573778,0.0006198853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943465,0.0002131891,0.000017412576,0.00007899364,0.00018833888,0.00006736828],"domain_scores_gemma":[0.999027,0.0004997483,0.000120149554,0.00009237813,0.0002285864,0.000032202188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829604,0.00047153514,0.00037423597,0.00037696422,0.0003693658,0.0006288044,0.0005824385,0.0004670219,0.00037247912],"category_scores_gemma":[0.0026270784,0.0002422229,0.0002447447,0.00039567988,0.0007391199,0.0005053152,0.00044116584,0.0004171744,0.000101902806],"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.00008200128,0.000029073268,0.0008085922,0.000047596302,0.00003078663,0.00013962541,0.0000770147,0.9302959,0.013715583,0.022958877,0.0003154775,0.03149943],"study_design_scores_gemma":[0.0000022263634,0.000025683947,0.000110067,0.000002438736,0.0000046393525,0.00003539129,0.000006625708,0.99714464,0.0012727549,0.0012020444,0.00018823017,0.0000052493497],"about_ca_topic_score_codex":0.0032046135,"about_ca_topic_score_gemma":0.003545287,"teacher_disagreement_score":0.0032046135,"about_ca_system_score_codex":0.0010159299,"about_ca_system_score_gemma":0.00059869245,"threshold_uncertainty_score":0.0073711276},"labels":[],"label_agreement":null},{"id":"W2105551413","doi":"10.1109/tcomm.2004.829516","title":"Exact Error-Rate Analysis of Diversity 16-QAM With Channel Estimation Error","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":85,"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":"Quadrature amplitude modulation; Bit error rate; QAM; Estimator; Rayleigh fading; Diversity combining; Fading; Transmit diversity; Channel (broadcasting); Algorithm; Mathematics; Sensitivity (control systems); Maximal-ratio combining; Antenna diversity; Phase-shift keying; Computer science; Decorrelation; Electronic engineering; Statistics; Telecommunications; Engineering; Antenna (radio)","score_opus":0.041264321405480815,"score_gpt":0.2869912575860922,"score_spread":0.24572693618061137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105551413","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.11505381,0.0061621433,0.86925274,0.00045331294,0.00014152784,0.000094273906,0.00038050362,0.00076305406,0.007698647],"genre_scores_gemma":[0.9187604,0.002647136,0.07371034,0.00016820301,0.0002323496,0.00015583483,0.0004289782,0.00022152186,0.0036753686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99243075,0.002596523,0.00032643144,0.00047704903,0.0033648596,0.0008043538],"domain_scores_gemma":[0.9605365,0.02916358,0.0023271774,0.0030336822,0.0047574807,0.00018162357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009626853,0.0017697782,0.0016608333,0.0020285386,0.0007433032,0.0012225565,0.0015334236,0.0015863585,0.0030722516],"category_scores_gemma":[0.05548127,0.0006795692,0.000724814,0.0018205642,0.0017645059,0.0026853853,0.0024524143,0.0011462457,0.000813455],"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.00054293056,0.000039652103,0.002143825,0.00027166717,0.000121835765,0.00027891758,0.00018584133,0.9160724,0.0065716356,0.035417072,0.00062368636,0.037730522],"study_design_scores_gemma":[0.0000118395565,0.00008712638,0.0009265683,0.000033101944,0.000028456983,0.00024688148,0.000028018683,0.9855076,0.0046849763,0.008058487,0.00035658773,0.000030375499],"about_ca_topic_score_codex":0.0029657066,"about_ca_topic_score_gemma":0.0018594301,"teacher_disagreement_score":0.009626853,"about_ca_system_score_codex":0.0017478158,"about_ca_system_score_gemma":0.0012789426,"threshold_uncertainty_score":0.05091226},"labels":[],"label_agreement":null},{"id":"W2105552720","doi":"10.1109/tcomm.2010.07.090297","title":"Communications over the Best Singular Mode of a Reciprocal MIMO Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"MIMO; Channel (broadcasting); Computer science; Fading; Mode (computer interface); Transmission (telecommunications); Reciprocal; Algorithm; Computer network; Telecommunications","score_opus":0.028304484361192487,"score_gpt":0.29984824519515585,"score_spread":0.27154376083396337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105552720","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.13202232,0.00014075401,0.86367756,0.000108819906,0.00003631499,0.000025108402,0.000055561377,0.00025472432,0.0036788536],"genre_scores_gemma":[0.95677835,0.00013049277,0.041318707,0.0000347502,0.000024133256,0.000028739527,0.00003255547,0.0000125112165,0.0016396762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00023002875,0.000018249108,0.00011339123,0.00014668373,0.00009820523],"domain_scores_gemma":[0.99931216,0.0003270162,0.00012425802,0.000113626746,0.00008889794,0.0000341239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406512,0.0006613983,0.00050229504,0.00029198825,0.0003040107,0.00068707444,0.00044713105,0.00076002575,0.00075760373],"category_scores_gemma":[0.0019291147,0.00017451888,0.00040848175,0.00025711893,0.0011475415,0.0007256448,0.0005725086,0.00039311775,0.00028363257],"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.00038091472,0.000052886357,0.0012100042,0.00008236374,0.00004074409,0.0005154452,0.0001800584,0.9196687,0.024624702,0.03301789,0.0004042372,0.019822069],"study_design_scores_gemma":[0.00001447738,0.000102308106,0.00022373801,0.000003548586,0.000011498208,0.0001636974,0.000028776829,0.98918545,0.0046631587,0.0052266633,0.0003601769,0.0000164436],"about_ca_topic_score_codex":0.0011744429,"about_ca_topic_score_gemma":0.00065401907,"teacher_disagreement_score":0.0011744429,"about_ca_system_score_codex":0.0002614549,"about_ca_system_score_gemma":0.0003754737,"threshold_uncertainty_score":0.0033881068},"labels":[],"label_agreement":null},{"id":"W2105749229","doi":"10.1109/tcomm.2011.080111.090524","title":"Closed-Form Error Analysis of Variable-Gain Multihop Systems in Nakagami-m Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"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":"Nakagami distribution; Fading; Hypergeometric function; Mathematics; Bessel function; Random variable; Elementary function; Applied mathematics; Topology (electrical circuits); Algorithm; Computer science; Statistics; Mathematical analysis; Decoding methods; Combinatorics","score_opus":0.11688496621535671,"score_gpt":0.30946869793608434,"score_spread":0.19258373172072762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105749229","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.028544132,0.0009297042,0.96681887,0.00022392381,0.00004678896,0.00001984153,0.000047358688,0.00011450507,0.0032548502],"genre_scores_gemma":[0.8974139,0.0023603318,0.091913246,0.00016632391,0.00010056837,0.000097844415,0.00014563324,0.00012328276,0.007678794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990644,0.00026837888,0.000036172285,0.00011713162,0.00041999522,0.00009400487],"domain_scores_gemma":[0.9945286,0.00396739,0.00046860447,0.00022614334,0.00074742944,0.0000618014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565817,0.0009100296,0.0009582051,0.00073134305,0.00040445948,0.0016467096,0.000977451,0.0010486515,0.0016189327],"category_scores_gemma":[0.010381278,0.0003082728,0.00049897446,0.00084429036,0.001403308,0.0021010123,0.0011302615,0.0012368053,0.00033436526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004136035,0.000022262286,0.0006338226,0.00013626227,0.000034279972,0.00017822222,0.00018929441,0.87640244,0.0016985338,0.106014,0.00056000217,0.0140894735],"study_design_scores_gemma":[0.0000035905473,0.000013270067,0.00012530849,0.000014441534,0.000008284253,0.00007424418,0.00003330747,0.9773372,0.0006224965,0.021472655,0.00028515907,0.000010041334],"about_ca_topic_score_codex":0.0019418631,"about_ca_topic_score_gemma":0.0013586669,"teacher_disagreement_score":0.002565817,"about_ca_system_score_codex":0.0012064984,"about_ca_system_score_gemma":0.001063789,"threshold_uncertainty_score":0.013569474},"labels":[],"label_agreement":null},{"id":"W2105785674","doi":"10.1109/tcomm.2006.874006","title":"Efficient design of FMT systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Digital Filter Design and Implementation","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":"McMaster University","funders":"","keywords":"Computer science; Transceiver; Electronic engineering; Iterative method; Matched filter; Channel (broadcasting); Design methods; Systems design; Filter (signal processing); Engineering; Algorithm; Wireless; Telecommunications; Computer vision","score_opus":0.06161142283313114,"score_gpt":0.2820327095995154,"score_spread":0.22042128676638423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105785674","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.0046405955,0.00009516346,0.99251693,0.00004780421,0.000025580382,0.000043353397,0.00002286525,0.00022195296,0.0023857446],"genre_scores_gemma":[0.32323575,0.00032625676,0.6710921,0.00012058764,0.00008824434,0.00029452113,0.00013109378,0.00008573106,0.004625697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945897,0.000140653,0.00002153576,0.00007005979,0.00026401127,0.000044774333],"domain_scores_gemma":[0.99950576,0.00017188475,0.000062540006,0.00006936643,0.00017051217,0.000019879124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053630705,0.0006066126,0.0004287433,0.00035594116,0.00040518038,0.00085533847,0.00072894007,0.00087888574,0.0034023765],"category_scores_gemma":[0.002030762,0.00026313495,0.00038854528,0.0003173354,0.00034565912,0.00077045546,0.00045263785,0.0006286294,0.0010004891],"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.0004743204,0.000080734215,0.00069840834,0.00041318382,0.00010261088,0.00024004605,0.0002557503,0.26226053,0.15227516,0.09680301,0.0042310623,0.48216525],"study_design_scores_gemma":[0.00008283179,0.00032790183,0.00038569202,0.000039984614,0.000030663996,0.00027447223,0.000035350196,0.934253,0.040819164,0.011150235,0.012570187,0.000030519233],"about_ca_topic_score_codex":0.00061054545,"about_ca_topic_score_gemma":0.0008990356,"teacher_disagreement_score":0.0034023765,"about_ca_system_score_codex":0.00062715553,"about_ca_system_score_gemma":0.00064940104,"threshold_uncertainty_score":0.011382103},"labels":[],"label_agreement":null},{"id":"W2106325446","doi":"10.1109/tcomm.2005.860059","title":"Infinite Series Representations of the Trivariate and Quadrivariate Rayleigh Distribution and Their Applications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":71,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rayleigh fading; Probability density function; Rayleigh distribution; Moment-generating function; Series (stratigraphy); Cumulative distribution function; Random variable; Joint probability distribution; Moment (physics); Applied mathematics; Rayleigh scattering; Function (biology); Statistics; Mathematical analysis; Fading; Physics","score_opus":0.015281729968398917,"score_gpt":0.25523615014418416,"score_spread":0.23995442017578525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106325446","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.01494532,0.0010544442,0.9751794,0.00019872606,0.000058522215,0.000011902443,0.00006645947,0.000095580326,0.008389652],"genre_scores_gemma":[0.667369,0.008927317,0.30614805,0.00032196092,0.0005274914,0.00024490643,0.00034978436,0.00024478947,0.015866736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.00023403595,0.000029700777,0.000083386905,0.0002528614,0.00007110564],"domain_scores_gemma":[0.99623835,0.0025772387,0.0005035658,0.0002674169,0.00032368928,0.000089651214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017905384,0.0009503414,0.00049758307,0.0012098731,0.0002861589,0.000912729,0.000941446,0.0006328425,0.0034632625],"category_scores_gemma":[0.009694907,0.0002959701,0.00061430974,0.0013658974,0.0015328293,0.0020347065,0.00089210796,0.0018178333,0.0009871724],"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.000029006836,0.000022789387,0.00056071114,0.000083256746,0.000020022364,0.0002488424,0.00014919123,0.09875254,0.0019173147,0.8512846,0.001185519,0.045746196],"study_design_scores_gemma":[0.000008545473,0.000034228964,0.000567932,0.00003987683,0.000013827668,0.00040987696,0.00003869827,0.59415185,0.0012877022,0.39823177,0.0051843277,0.000031384814],"about_ca_topic_score_codex":0.0007610886,"about_ca_topic_score_gemma":0.00078252924,"teacher_disagreement_score":0.0034632625,"about_ca_system_score_codex":0.000782045,"about_ca_system_score_gemma":0.0005566552,"threshold_uncertainty_score":0.011585772},"labels":[],"label_agreement":null},{"id":"W2107428208","doi":"10.1109/tcomm.2009.0901.060523","title":"Exact error probability analysis of rectangular QAM for single- and multichannel reception in nakagami-m fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":48,"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; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Quadrature amplitude modulation; Hypergeometric function; QAM; Mathematics; Independent and identically distributed random variables; Algorithm; Statistics; Topology (electrical circuits); Random variable; Combinatorics; Bit error rate; Mathematical analysis","score_opus":0.05541987781601642,"score_gpt":0.30583888318585334,"score_spread":0.2504190053698369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107428208","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.032119416,0.001192481,0.9611385,0.00022165469,0.00004423258,0.000025330915,0.0001239339,0.00024491383,0.0048894677],"genre_scores_gemma":[0.8618476,0.002809437,0.12831399,0.00026280992,0.00018257389,0.00011055095,0.00036976786,0.00018488163,0.005918343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982834,0.0004443924,0.00007117425,0.0002105568,0.00078079663,0.00020970972],"domain_scores_gemma":[0.9924331,0.0055610877,0.0005239001,0.00056609686,0.0008381295,0.00007782514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809978,0.0010087576,0.00090719864,0.001055187,0.00034184408,0.001281781,0.0012200407,0.000779483,0.002670696],"category_scores_gemma":[0.011698996,0.00041723443,0.00072090636,0.0009834006,0.0014646476,0.0024652106,0.0013152037,0.0010868671,0.0007650152],"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.00013757983,0.00003056952,0.00167639,0.0002565985,0.000074826334,0.0003033552,0.0002546174,0.7979821,0.005137836,0.15641607,0.0009161433,0.03681398],"study_design_scores_gemma":[0.000006160389,0.00003021696,0.00048249552,0.000034258526,0.000016577751,0.00019416386,0.000034847133,0.9623101,0.002488276,0.033811964,0.0005725137,0.000018457944],"about_ca_topic_score_codex":0.0015158093,"about_ca_topic_score_gemma":0.001342342,"teacher_disagreement_score":0.002809978,"about_ca_system_score_codex":0.0013955447,"about_ca_system_score_gemma":0.0013281633,"threshold_uncertainty_score":0.014860749},"labels":[],"label_agreement":null},{"id":"W2107883234","doi":"10.1109/tcomm.2010.06.090121","title":"New designs for bit-interleaved coded modulation with hard-decision feedback iterative decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Convolutional code; Fading; Algorithm; Bit error rate; Transmission (telecommunications); Error detection and correction; Forward error correction; Modulation (music); Computer engineering; Electronic engineering; Telecommunications; Engineering","score_opus":0.04520537086097836,"score_gpt":0.2984888654634526,"score_spread":0.25328349460247424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107883234","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.0047418317,0.00069186994,0.99196154,0.00011099411,0.00009000723,0.00006514158,0.000038260077,0.00022163296,0.0020786277],"genre_scores_gemma":[0.16112521,0.0011096072,0.83289635,0.00024949014,0.00019281513,0.0003070731,0.00013610518,0.00005926091,0.0039240355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801135,0.00063584145,0.00017384338,0.00021138396,0.00083452946,0.00013312724],"domain_scores_gemma":[0.9970362,0.0010257333,0.00044302465,0.00041685445,0.00100002,0.000078210054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015318802,0.0013795097,0.0008200583,0.0008844151,0.0004535673,0.0012652382,0.0015500564,0.0014909151,0.0016765257],"category_scores_gemma":[0.0053721224,0.00057509606,0.0006292861,0.00082111,0.0006021914,0.001152919,0.0009643101,0.0016876865,0.0011218945],"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.000622661,0.00018365901,0.0016275377,0.0007952769,0.0003148088,0.0005074965,0.00076487707,0.15908857,0.11636758,0.16338845,0.0052026915,0.5511364],"study_design_scores_gemma":[0.00013991,0.0006299635,0.0006638624,0.00017847911,0.00017230689,0.0012790378,0.000046966128,0.87456244,0.06854312,0.02851634,0.025131226,0.00013641494],"about_ca_topic_score_codex":0.00048494016,"about_ca_topic_score_gemma":0.001150031,"teacher_disagreement_score":0.0016765257,"about_ca_system_score_codex":0.0007967557,"about_ca_system_score_gemma":0.0008260061,"threshold_uncertainty_score":0.008101463},"labels":[],"label_agreement":null},{"id":"W2108165364","doi":"10.1109/26.871398","title":"Equal-gain diversity receiver performance in wireless channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":247,"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":"Rician fading; Nakagami distribution; Mathematics; Fading; Probability density function; Rayleigh fading; Diversity gain; Algorithm; Telecommunications; Computer science; Statistics","score_opus":0.030439364612317936,"score_gpt":0.2523884447162454,"score_spread":0.22194908010392744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108165364","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.48283932,0.0018649712,0.49691707,0.00032026038,0.000048583333,0.000026849182,0.00014925754,0.0005213641,0.017312275],"genre_scores_gemma":[0.9842903,0.0005517671,0.013482133,0.00004669943,0.00002679399,0.000014867163,0.0000784749,0.000019352674,0.001489758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862385,0.0004503058,0.000037966933,0.00014951167,0.00044263038,0.000295738],"domain_scores_gemma":[0.99756026,0.0016175392,0.00018561952,0.00022096575,0.0003800918,0.00003555397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018142711,0.00064429356,0.0007817876,0.00048246142,0.00039312,0.0011142058,0.0005218593,0.0010475507,0.0013971013],"category_scores_gemma":[0.005896075,0.00025767798,0.00029324225,0.0006258034,0.0010302386,0.0012493726,0.0012165508,0.0005179622,0.0005833777],"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.00076744444,0.000090155336,0.003635771,0.00022189073,0.00010278618,0.0002698366,0.00033624697,0.8014913,0.04228357,0.07758395,0.00081797526,0.07239898],"study_design_scores_gemma":[0.00004943618,0.00036723507,0.0030157645,0.00004349691,0.0000743939,0.0005970303,0.00011597451,0.9217471,0.039640006,0.032945137,0.001329087,0.00007534021],"about_ca_topic_score_codex":0.00094299106,"about_ca_topic_score_gemma":0.00067342666,"teacher_disagreement_score":0.0018142711,"about_ca_system_score_codex":0.00078704284,"about_ca_system_score_gemma":0.00041276155,"threshold_uncertainty_score":0.009594917},"labels":[],"label_agreement":null},{"id":"W2109962273","doi":"10.1109/tcomm.2003.816969","title":"Optimizing spectral efficiency in multiwavelength optical CDMA system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"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":"Code division multiple access; Spectral efficiency; Computer science; CDMA spectral efficiency; Electronic engineering; Spread spectrum; Wavelength-division multiplexing; Code (set theory); Prime (order theory); Computer network; Wavelength; Engineering; Mathematics; Optics; Physics; Channel (broadcasting)","score_opus":0.018225540692362013,"score_gpt":0.22876649045114777,"score_spread":0.21054094975878576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109962273","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.6705472,0.0008371745,0.3167583,0.00021004824,0.000029030438,0.000046416437,0.000051116454,0.00047255494,0.011048137],"genre_scores_gemma":[0.96276027,0.00016830914,0.03548061,0.000029019444,0.000010179091,0.000015984084,0.000022899987,0.00003997681,0.0014727294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00018166922,0.000015575928,0.000055476303,0.00010694551,0.00007468314],"domain_scores_gemma":[0.99913365,0.0004672125,0.000096603195,0.000098159384,0.00017215373,0.000032242624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047616175,0.00045021472,0.00030687643,0.0003890195,0.00029058303,0.0005439169,0.00032048946,0.00033767553,0.0011305043],"category_scores_gemma":[0.0015280975,0.00017922335,0.00007891957,0.0003856731,0.00025906536,0.00079199293,0.00036027236,0.0001767047,0.00039557213],"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.0006765139,0.00022295967,0.0042138165,0.00016579808,0.000051730338,0.00019155465,0.00019421784,0.45422962,0.35314786,0.02741468,0.0014717137,0.15801953],"study_design_scores_gemma":[0.00004421782,0.00020958643,0.0010994202,0.000015115615,0.000026490101,0.0001448256,0.000047509562,0.85808307,0.1311278,0.006926571,0.0022522083,0.000023154224],"about_ca_topic_score_codex":0.00037419246,"about_ca_topic_score_gemma":0.0007568031,"teacher_disagreement_score":0.0011305043,"about_ca_system_score_codex":0.00048591298,"about_ca_system_score_gemma":0.00036752384,"threshold_uncertainty_score":0.003781855},"labels":[],"label_agreement":null},{"id":"W2110040147","doi":"10.1109/tcomm.2010.07.080633","title":"Limits to Performance of Optimum Combining with Dense Multiple Correlated Antennas","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Rayleigh fading; Signal-to-interference-plus-noise ratio; Interference (communication); Signal-to-noise ratio (imaging); Fading; Topology (electrical circuits); Mathematical analysis; Power (physics); Statistics; Physics; Telecommunications; Computer science; Combinatorics; Channel (broadcasting)","score_opus":0.01655576203975411,"score_gpt":0.23240446377809643,"score_spread":0.2158487017383423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110040147","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.31862542,0.0018059894,0.65005183,0.00053576997,0.00003349797,0.000038304544,0.00014358747,0.00087664556,0.027888987],"genre_scores_gemma":[0.9759857,0.00052720984,0.022440214,0.00010190774,0.000038207534,0.00006038807,0.000075661235,0.000038299648,0.00073250936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970523,0.0008352288,0.00014092775,0.00030596304,0.0011587878,0.00050679414],"domain_scores_gemma":[0.98469985,0.01164149,0.0011015242,0.0010955171,0.0012666936,0.0001948198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029867582,0.0009114762,0.0010720917,0.00063564396,0.0004277044,0.0015619657,0.000739636,0.001098799,0.0012150608],"category_scores_gemma":[0.022824923,0.00068381376,0.00044604825,0.0010369063,0.0020484144,0.0024222971,0.0018600762,0.0008492275,0.00068313215],"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.00060587435,0.00008297483,0.003020622,0.0002626316,0.00012325459,0.00036015615,0.00034213366,0.8340636,0.04736766,0.07227841,0.00072545867,0.040767223],"study_design_scores_gemma":[0.00004592761,0.00044540278,0.0026162425,0.000101711455,0.000071277966,0.0007854568,0.00014486723,0.8786493,0.04137064,0.07410318,0.0015631069,0.00010295261],"about_ca_topic_score_codex":0.0005643906,"about_ca_topic_score_gemma":0.00035384973,"teacher_disagreement_score":0.0029867582,"about_ca_system_score_codex":0.000921068,"about_ca_system_score_gemma":0.000701416,"threshold_uncertainty_score":0.015795708},"labels":[],"label_agreement":null},{"id":"W2110138118","doi":"10.1109/tcomm.2006.877959","title":"Revised analyses of postdetection switch-and-stay diversity in rician fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Bit error rate; Phase-shift keying; Keying; Diversity combining; Mathematics; Algorithm; Computer science; Statistics; Electronic engineering; Telecommunications; Engineering; Decoding methods","score_opus":0.056574239922813734,"score_gpt":0.30996856538755496,"score_spread":0.2533943254647412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110138118","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.13566232,0.004531413,0.8308705,0.0004939295,0.0001828097,0.00006808329,0.00029608974,0.0007590244,0.027135959],"genre_scores_gemma":[0.9498574,0.0023903938,0.041483223,0.00029430495,0.00023312587,0.00007553923,0.00028552013,0.00021929617,0.0051611504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737763,0.000662562,0.00013389936,0.00017964114,0.0013004465,0.00034586436],"domain_scores_gemma":[0.9905652,0.006005574,0.000628509,0.0008081622,0.0018888379,0.00010366746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035813693,0.0018739098,0.0010427346,0.0015172029,0.00043666994,0.0016648434,0.0012266168,0.0007260775,0.0030964406],"category_scores_gemma":[0.01098784,0.00039991437,0.0011273898,0.0012219057,0.0012546543,0.0016036815,0.0009569871,0.0011940598,0.000868017],"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.0008194585,0.00006115359,0.0023602273,0.00055537757,0.00021638398,0.00048432715,0.0003344623,0.7438642,0.060167205,0.13088475,0.002228024,0.05802442],"study_design_scores_gemma":[0.000022938724,0.00018000338,0.0019248506,0.000049450166,0.00019524543,0.00033940547,0.000043440887,0.925402,0.041737482,0.027301086,0.002723493,0.000080623584],"about_ca_topic_score_codex":0.0009651892,"about_ca_topic_score_gemma":0.00076749385,"teacher_disagreement_score":0.0035813693,"about_ca_system_score_codex":0.0013566137,"about_ca_system_score_gemma":0.00076996774,"threshold_uncertainty_score":0.01894033},"labels":[],"label_agreement":null},{"id":"W2110288531","doi":"10.1109/tcomm.2013.021913.120149","title":"Relaxed Half-Stochastic Belief Propagation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"","keywords":"Decoding methods; Belief propagation; Computer science; Code word; Algorithm; Binary number; Throughput; Low-density parity-check code; Bit error rate; Coding (social sciences); Sequential decoding; Theoretical computer science; Wireless; Block code; Mathematics; Arithmetic; Telecommunications","score_opus":0.03033599025639153,"score_gpt":0.27193571936845407,"score_spread":0.24159972911206254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110288531","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.024414029,0.00011367705,0.972008,0.00021323007,0.000026816415,0.00003817019,0.00009768605,0.0002449717,0.0028433998],"genre_scores_gemma":[0.6182256,0.00028835208,0.3750565,0.00028865968,0.000054543376,0.00021142312,0.00040889124,0.000106274325,0.0053597763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.0005291552,0.00006625137,0.0001553722,0.0004313566,0.00013054413],"domain_scores_gemma":[0.9945187,0.0035133343,0.00029322883,0.0007011089,0.0008709578,0.00010274705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616489,0.0005868493,0.00076268916,0.00054738927,0.00043504522,0.0010384842,0.0016947597,0.0011516052,0.0023117464],"category_scores_gemma":[0.008655414,0.00044380128,0.0005947871,0.00066068955,0.0011241196,0.0016876808,0.0010406174,0.0013862052,0.00063696323],"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.000264012,0.000041249496,0.0006745442,0.000115422044,0.000043143107,0.00010159116,0.00013163283,0.81042373,0.0054868283,0.12547353,0.0015510782,0.05569313],"study_design_scores_gemma":[0.000010371872,0.000015419728,0.000036741087,0.0000041877825,0.0000035250407,0.000015400637,0.0000049524133,0.98767483,0.0013346076,0.01063594,0.00025864158,0.0000053406166],"about_ca_topic_score_codex":0.0029609897,"about_ca_topic_score_gemma":0.0024780568,"teacher_disagreement_score":0.0029609897,"about_ca_system_score_codex":0.0008692051,"about_ca_system_score_gemma":0.0013939522,"threshold_uncertainty_score":0.008548915},"labels":[],"label_agreement":null},{"id":"W2110487308","doi":"10.1109/tcomm.2005.861670","title":"Approximate SER of H-S/MRC in Nakagami fading with arbitrary branch power correlation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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 Alberta","funders":"","keywords":"Nakagami distribution; Fading; Mathematics; Maximal-ratio combining; Integer (computer science); Modulation (music); Phase-shift keying; Statistics; Keying; Power (physics); Bit error rate; Algorithm; Telecommunications; Computer science; Physics; Decoding methods","score_opus":0.010546982591988939,"score_gpt":0.2291825001758941,"score_spread":0.21863551758390515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110487308","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.07176811,0.0013060505,0.9079321,0.0003267157,0.00006910239,0.000038665527,0.00017226842,0.00053630216,0.017850649],"genre_scores_gemma":[0.9066863,0.0014895675,0.08728291,0.00013197365,0.00007453745,0.0000915865,0.00013232425,0.0001350769,0.0039758654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993899,0.00021950653,0.000026766065,0.00004850972,0.00022946569,0.00008585963],"domain_scores_gemma":[0.998221,0.0010895337,0.00016024098,0.00026604603,0.00021699326,0.000046072535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022964168,0.0008480695,0.0007655019,0.0006710262,0.00030882822,0.0012347191,0.00092014787,0.0009065515,0.0016405501],"category_scores_gemma":[0.0050248243,0.00034389534,0.0004956075,0.00075308076,0.0015006386,0.0015470564,0.00082962395,0.00064451434,0.0007752794],"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.00009032953,0.000009161512,0.0004910035,0.000081142316,0.00001988806,0.0001717293,0.000068985995,0.89752585,0.0022790516,0.09267502,0.00050506985,0.0060827616],"study_design_scores_gemma":[0.0000036675576,0.000008014832,0.00010683864,0.000012643901,0.0000044575954,0.000040312887,0.000009193547,0.98836005,0.000597832,0.010665785,0.00018573787,0.0000054865823],"about_ca_topic_score_codex":0.003091643,"about_ca_topic_score_gemma":0.002409132,"teacher_disagreement_score":0.003091643,"about_ca_system_score_codex":0.0013309447,"about_ca_system_score_gemma":0.0009223441,"threshold_uncertainty_score":0.012144744},"labels":[],"label_agreement":null},{"id":"W2110529479","doi":"10.1109/tcomm.2012.050812.110115a","title":"Dithered Belief Propagation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":31,"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":"Dither; Decoding methods; Belief propagation; Overhead (engineering); Computer science; Limit (mathematics); Algorithm; Waterfall; Propagation of uncertainty; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.0562468275296146,"score_gpt":0.3094651156017489,"score_spread":0.2532182880721343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110529479","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.0068930485,0.00024224824,0.98803085,0.00026789616,0.00013884374,0.000041874686,0.0001371958,0.0010666264,0.0031813474],"genre_scores_gemma":[0.2192118,0.0004520297,0.76671606,0.00043287547,0.0001264296,0.00014081637,0.00036508183,0.00022904911,0.012325896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.00016067272,0.000051267427,0.00020107396,0.00044864876,0.00013046242],"domain_scores_gemma":[0.99802077,0.000665652,0.00014567676,0.0005578016,0.0005336675,0.00007643395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000552835,0.00093105744,0.0008518727,0.0010729674,0.00057729526,0.0016926611,0.0016885343,0.0017598565,0.0062625655],"category_scores_gemma":[0.0038318154,0.0004859776,0.0004921451,0.0012957902,0.0008405481,0.0019603074,0.0015965264,0.0019126938,0.002142352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062607887,0.00021335059,0.0008259628,0.0003820825,0.00012440643,0.00029057285,0.00018634183,0.24750634,0.05808773,0.1229459,0.008557614,0.5602537],"study_design_scores_gemma":[0.000058829282,0.00009759853,0.00020434844,0.0000273035,0.000030048002,0.00023640222,0.000016763037,0.92142045,0.04463748,0.026653562,0.0065640802,0.000053114032],"about_ca_topic_score_codex":0.002207522,"about_ca_topic_score_gemma":0.003535987,"teacher_disagreement_score":0.0062625655,"about_ca_system_score_codex":0.0008109907,"about_ca_system_score_gemma":0.0016957403,"threshold_uncertainty_score":0.020950377},"labels":[],"label_agreement":null},{"id":"W2111061487","doi":"10.1109/26.996072","title":"Noncoherent MMSE interference suppression for DS-CDMA","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":20,"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":"Code division multiple access; Minimum mean square error; Algorithm; Interference (communication); Spread spectrum; Single antenna interference cancellation; Matched filter; Computer science; Mathematics; Detector; Control theory (sociology); Channel (broadcasting); Electronic engineering; Telecommunications; Decoding methods; Statistics; Engineering","score_opus":0.11722199677070158,"score_gpt":0.3350077925116484,"score_spread":0.21778579574094684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111061487","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.02268435,0.00083513005,0.9752787,0.00006719638,0.0000364256,0.000017903703,0.000022781931,0.00016465824,0.0008929492],"genre_scores_gemma":[0.5717645,0.0010357271,0.4236245,0.000103694125,0.00009835883,0.00008515318,0.000114481474,0.00003146665,0.003142101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996123,0.00009974028,0.000018935458,0.000045247663,0.00020784866,0.00001603258],"domain_scores_gemma":[0.9996201,0.00014675871,0.000054677366,0.00004872288,0.00011978908,0.0000099584095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005549359,0.0002955925,0.00033923468,0.00023178011,0.00017683583,0.00042959998,0.0004316562,0.0003589795,0.00062651356],"category_scores_gemma":[0.0014545018,0.00018188558,0.0002045348,0.0002067942,0.00021093636,0.00036304595,0.00033947345,0.00034956323,0.00028852004],"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.00053033134,0.00011760894,0.0024253041,0.00048900134,0.00011108019,0.00027327795,0.00025735135,0.21812792,0.26487252,0.06834101,0.0020940185,0.44236052],"study_design_scores_gemma":[0.000041073465,0.00021366721,0.0006812435,0.000013583061,0.000029528639,0.00019118386,0.00001347322,0.9416636,0.047516633,0.0060207723,0.003592045,0.000023274486],"about_ca_topic_score_codex":0.00034796027,"about_ca_topic_score_gemma":0.0005413515,"teacher_disagreement_score":0.00062651356,"about_ca_system_score_codex":0.00031213573,"about_ca_system_score_gemma":0.00034933118,"threshold_uncertainty_score":0.0029348135},"labels":[],"label_agreement":null},{"id":"W2111484900","doi":"10.1109/tcomm.2011.050211.100036a","title":"Cramer-Rao Lower Bounds of DOA Estimates from Square QAM-Modulated Signals","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Direction-of-Arrival Estimation Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Quadrature amplitude modulation; Cramér–Rao bound; QAM; Mathematics; Algorithm; Additive white Gaussian noise; Fisher information; Estimation theory; Statistics; White noise; Bit error rate; Decoding methods","score_opus":0.05889292817463917,"score_gpt":0.2964461860052343,"score_spread":0.23755325783059514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111484900","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.00456324,0.0021879212,0.98779476,0.00025172933,0.000057312838,0.00003688328,0.00015801043,0.00023831347,0.004711799],"genre_scores_gemma":[0.4275548,0.009468674,0.55225945,0.00070962135,0.0005972279,0.00066368486,0.0012156087,0.0005404699,0.006990463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532926,0.0012581724,0.00029257586,0.00061509595,0.002091481,0.00041341968],"domain_scores_gemma":[0.9734158,0.02034621,0.001467292,0.0018161334,0.0027757904,0.00017872054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050958907,0.0022750946,0.0013140467,0.0022762627,0.0006625642,0.0026923988,0.001519538,0.0013766434,0.0034992977],"category_scores_gemma":[0.04537383,0.0007772941,0.0009916263,0.001613509,0.0024316947,0.0031067908,0.0021793407,0.002514184,0.0022404823],"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.00030286875,0.00008771632,0.0016124017,0.0011064003,0.00019714003,0.0002191826,0.000440625,0.58764297,0.016250256,0.24451613,0.0042409343,0.1433834],"study_design_scores_gemma":[0.00002166931,0.00014018374,0.0013033052,0.00029228444,0.00007072252,0.00035990129,0.000101518395,0.88752985,0.015960976,0.085399695,0.00872393,0.0000959868],"about_ca_topic_score_codex":0.0024929212,"about_ca_topic_score_gemma":0.0034175925,"teacher_disagreement_score":0.0050958907,"about_ca_system_score_codex":0.001632785,"about_ca_system_score_gemma":0.0022859601,"threshold_uncertainty_score":0.026949942},"labels":[],"label_agreement":null},{"id":"W2111600529","doi":"10.1109/tcomm.2010.05.090100","title":"Coherent max-log decision fusion in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":36,"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":"Fusion; Fusion center; Sensor fusion; Fusion rules; Decision rule; Computer science; Wireless sensor network; Wireless; Binary number; Algorithm; Data mining; Artificial intelligence; Mathematics; Cognitive radio; Telecommunications; Computer network; Image fusion","score_opus":0.017144890658940058,"score_gpt":0.2615282395100707,"score_spread":0.24438334885113064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111600529","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.009286132,0.000980118,0.9880272,0.00029680823,0.00004903427,0.000017518241,0.000027621238,0.00010297564,0.0012125613],"genre_scores_gemma":[0.8197634,0.001428987,0.17623974,0.00036108025,0.0002046501,0.000108287204,0.000121794714,0.00004470585,0.0017273326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625564,0.0018354156,0.00016735963,0.0004970685,0.0010277727,0.00021670836],"domain_scores_gemma":[0.99679106,0.0022382168,0.00024187128,0.0002849894,0.00039874334,0.000045127967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040096706,0.00071776536,0.0010917417,0.000506883,0.00054146216,0.0015055276,0.0012212505,0.0010035827,0.00059176784],"category_scores_gemma":[0.010129512,0.00040161653,0.000332148,0.0011724008,0.0015180274,0.0026828297,0.0013678949,0.0011266533,0.00028297136],"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.00030721875,0.000057541474,0.00082513585,0.00020750887,0.00007065967,0.00016443302,0.0001570095,0.68961865,0.0046138535,0.16493577,0.0023574214,0.13668478],"study_design_scores_gemma":[0.000015067075,0.00005447945,0.00011712409,0.000011516928,0.000010754837,0.000044432614,0.0000149170355,0.93051636,0.0021419248,0.06619972,0.000858944,0.000014771227],"about_ca_topic_score_codex":0.00088268664,"about_ca_topic_score_gemma":0.0007028941,"teacher_disagreement_score":0.0040096706,"about_ca_system_score_codex":0.0009483457,"about_ca_system_score_gemma":0.0010388923,"threshold_uncertainty_score":0.021205366},"labels":[],"label_agreement":null},{"id":"W2111795445","doi":"10.1109/tcomm.2006.876852","title":"Joint Estimation of Carrier Frequency Offset and Statistical Parameters of the Multipath Fading Channel","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":17,"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":"Fading; Multipath propagation; Channel state information; Rayleigh fading; Estimator; Computer science; Algorithm; Frequency offset; Fading distribution; Channel (broadcasting); Autoregressive model; Carrier frequency offset; Electronic engineering; Mathematics; Telecommunications; Statistics; Wireless; Orthogonal frequency-division multiplexing; Engineering","score_opus":0.02500190490422295,"score_gpt":0.25765577868704237,"score_spread":0.23265387378281943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111795445","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.017912425,0.0001993113,0.9808468,0.000071807306,0.000022363598,0.000014554145,0.000060757637,0.00023091052,0.00064105703],"genre_scores_gemma":[0.5829831,0.00082935154,0.41347584,0.000064868764,0.00008189091,0.00005162013,0.0002837134,0.00013263235,0.002097063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.0001002693,0.000023097662,0.00009351021,0.00020482772,0.000054791508],"domain_scores_gemma":[0.9990939,0.00038974194,0.00012293855,0.00019115694,0.00018063631,0.000021599026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007981562,0.00070298597,0.000840943,0.000597022,0.00022711375,0.00078033435,0.00041625695,0.0005393485,0.0007071455],"category_scores_gemma":[0.005507218,0.00035841236,0.00033700018,0.0006252889,0.0004680264,0.0016797435,0.0006938388,0.00092756824,0.0005155695],"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.00018429119,0.00006448201,0.004956095,0.00016380135,0.000116463896,0.00016717245,0.00012265908,0.5638798,0.066986196,0.036733072,0.001257824,0.32536826],"study_design_scores_gemma":[0.000018363073,0.00006360793,0.002765275,0.0000257527,0.000036606405,0.0002092595,0.000026345188,0.95930797,0.022226745,0.013136039,0.0021259298,0.000058163096],"about_ca_topic_score_codex":0.0013348222,"about_ca_topic_score_gemma":0.0018314152,"teacher_disagreement_score":0.0013348222,"about_ca_system_score_codex":0.00027433093,"about_ca_system_score_gemma":0.0011742052,"threshold_uncertainty_score":0.0042210817},"labels":[],"label_agreement":null},{"id":"W2112020139","doi":"10.1109/tcomm.2009.10.080048","title":"Switching rates of dual selection diversity in noisy fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Alberta","funders":"","keywords":"Fading; Independent and identically distributed random variables; Diversity combining; Fading distribution; Diversity scheme; Selection (genetic algorithm); Dual (grammatical number); Computer science; Noise (video); Mathematics; Algorithm; Electronic engineering; Telecommunications; Topology (electrical circuits); Statistics; Channel (broadcasting); Random variable; Engineering; Rayleigh fading; Artificial intelligence; Combinatorics","score_opus":0.04381582510786672,"score_gpt":0.29838754698471975,"score_spread":0.25457172187685306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112020139","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.4189274,0.0014692304,0.55408883,0.0004713097,0.00009255827,0.000051986033,0.00015865699,0.0003607655,0.024379255],"genre_scores_gemma":[0.98836577,0.0004853624,0.009823141,0.000036738085,0.00002556017,0.000026148502,0.00003705936,0.00003115867,0.0011690632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989936,0.00028842807,0.000040021994,0.00013085715,0.00037479997,0.00017232075],"domain_scores_gemma":[0.9937231,0.004582076,0.0005660742,0.00033586638,0.0006726678,0.000120174904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016572477,0.00061312615,0.00068892544,0.000510307,0.00051314855,0.0014370845,0.0004895313,0.0006233354,0.0017633941],"category_scores_gemma":[0.009699733,0.00046872444,0.00036519274,0.0005471162,0.0010028677,0.000985013,0.0007090934,0.0007474864,0.00034237112],"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.0008377847,0.00007981898,0.0033354328,0.00018706414,0.00005476292,0.0005563385,0.0003190274,0.8296958,0.048463512,0.07946405,0.0008739013,0.036132526],"study_design_scores_gemma":[0.000021582848,0.00008278508,0.00073122856,0.000031152325,0.00003441599,0.0002894594,0.000045560482,0.9779142,0.010482751,0.009902386,0.00043089982,0.000033501958],"about_ca_topic_score_codex":0.0009431105,"about_ca_topic_score_gemma":0.0006621264,"teacher_disagreement_score":0.0017633941,"about_ca_system_score_codex":0.0011247906,"about_ca_system_score_gemma":0.0005727501,"threshold_uncertainty_score":0.008764446},"labels":[],"label_agreement":null},{"id":"W2112266980","doi":"10.1109/tcomm.2006.887479","title":"Linear Decoupled and Quasi-Decoupled Space–Time Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Block code; Linear code; Decoding methods; Concatenated error correction code; Space time; Full Rate; Space–time block code; Algorithm; Computer science; Diversity gain; Mathematics; Space–time code; Topology (electrical circuits); Combinatorics; Fading; Engineering","score_opus":0.01718006144823575,"score_gpt":0.278915571190286,"score_spread":0.26173550974205023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112266980","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.07642772,0.0003863334,0.9022595,0.0002509036,0.00005242634,0.000056893496,0.00024436857,0.000074214506,0.020247564],"genre_scores_gemma":[0.8424893,0.00067512767,0.14564827,0.00021467642,0.00009160985,0.00015340885,0.00038333656,0.000043968135,0.010300253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.00021666476,0.000047780573,0.00012834673,0.00037524762,0.0001381795],"domain_scores_gemma":[0.9981694,0.0006232317,0.0003398674,0.0003067516,0.00045915082,0.00010160272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005871357,0.00054374844,0.00041316997,0.00037602926,0.0003754837,0.0008886132,0.00046791107,0.00074423355,0.003364538],"category_scores_gemma":[0.0030650017,0.00029776903,0.0003607943,0.00061110494,0.0010532873,0.001257171,0.0011418262,0.0009563526,0.0008415832],"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.00012125161,0.000037252525,0.0006199332,0.00013839672,0.000030831634,0.00024567975,0.0001824636,0.25777403,0.021493465,0.6900354,0.0015471703,0.02777412],"study_design_scores_gemma":[0.000034230892,0.000092905386,0.00035781498,0.000019962094,0.000008462605,0.00032206037,0.000063020314,0.8490071,0.0060876748,0.13989629,0.0040774303,0.000033065866],"about_ca_topic_score_codex":0.00081570755,"about_ca_topic_score_gemma":0.0009266421,"teacher_disagreement_score":0.003364538,"about_ca_system_score_codex":0.0005129742,"about_ca_system_score_gemma":0.0010230142,"threshold_uncertainty_score":0.011255503},"labels":[],"label_agreement":null},{"id":"W2112379819","doi":"10.1109/tcomm.2004.833028","title":"Reconstruction of Predictively Encoded Signals Over Noisy Channels Using a Sequence MMSE Decoder","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Decoding methods; Algorithm; Redundancy (engineering); Maximum a posteriori estimation; Minimum mean square error; Trellis (graph); Mean squared error; Residual; Sequence (biology); A priori and a posteriori; Computer science; Signal reconstruction; Mathematics; Signal processing; Statistics; Maximum likelihood; Telecommunications","score_opus":0.05820305858855234,"score_gpt":0.30790074094478453,"score_spread":0.2496976823562322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112379819","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.018703718,0.00015048773,0.98008156,0.000079757214,0.000014826057,0.000009578494,0.0000377659,0.00013363943,0.0007887058],"genre_scores_gemma":[0.5561464,0.0006721359,0.4382024,0.000092817136,0.00006412196,0.00006166389,0.00022595968,0.000059900623,0.0044745393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.00014110586,0.000024758107,0.00005780864,0.0001576839,0.000031474887],"domain_scores_gemma":[0.9991627,0.00052495557,0.000082287996,0.00007716071,0.00013649378,0.00001637503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000769642,0.00064286776,0.0007988764,0.00027714597,0.00019070494,0.0006265521,0.000508976,0.0008667198,0.00066174945],"category_scores_gemma":[0.0029516784,0.00033035644,0.00035545914,0.000422932,0.00063575845,0.0009122078,0.00054001214,0.00059622794,0.00034420824],"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.00028928995,0.00002669336,0.00055694685,0.00010433994,0.00003795046,0.00018840982,0.00008291522,0.9109515,0.017232131,0.025401535,0.00043300443,0.04469534],"study_design_scores_gemma":[0.000008360762,0.000029715602,0.000053161548,0.0000059720446,0.0000060531866,0.000047565165,0.0000073033616,0.9892675,0.0074133133,0.0029260293,0.00022918255,0.0000058048554],"about_ca_topic_score_codex":0.0013273926,"about_ca_topic_score_gemma":0.0014149789,"teacher_disagreement_score":0.0013273926,"about_ca_system_score_codex":0.00038208222,"about_ca_system_score_gemma":0.0008016633,"threshold_uncertainty_score":0.0040703416},"labels":[],"label_agreement":null},{"id":"W2112627185","doi":"10.1109/tcomm.2012.12.100185","title":"MPPM Constellation Selection for Free-Space Optical Communications","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","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":"University of British Columbia","funders":"","keywords":"Heuristics; Selection (genetic algorithm); SIGNAL (programming language); Algorithm; Computer science; Channel (broadcasting); Constellation; Figure of merit; Modulation (music); Compressed sensing; Constellation diagram; Position (finance); Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Telecommunications; Physics; Bit error rate","score_opus":0.041306056829605246,"score_gpt":0.2751747246043181,"score_spread":0.23386866777471282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112627185","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.06579635,0.0011526429,0.9263014,0.0005211473,0.000057203437,0.00006669022,0.000068949084,0.00012328883,0.005912352],"genre_scores_gemma":[0.7485858,0.0010242956,0.24676982,0.00015744069,0.000073013674,0.000117132615,0.000103983875,0.00005250363,0.0031160552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.00029408725,0.00001237863,0.00007290556,0.00012542612,0.00007614338],"domain_scores_gemma":[0.99855,0.0011407566,0.00011450974,0.00006179193,0.00006742609,0.00006548862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452338,0.0007737741,0.00076639245,0.00057787827,0.00035887928,0.0006898669,0.00073782966,0.0011247885,0.0017136306],"category_scores_gemma":[0.0033760862,0.00036552746,0.00045926083,0.0011498973,0.00091084413,0.0011524272,0.0006275591,0.00074579514,0.00023541959],"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.00012900706,0.00006637891,0.00027223423,0.000120966695,0.000035939527,0.00010408844,0.00006341886,0.92727786,0.0022731114,0.040920686,0.00090274756,0.027833492],"study_design_scores_gemma":[0.00002591854,0.00008324607,0.000088721616,0.000007135474,0.000009728429,0.00003433871,0.000019340796,0.97613347,0.0009785492,0.021775743,0.00083520456,0.000008580422],"about_ca_topic_score_codex":0.0009823467,"about_ca_topic_score_gemma":0.0010992624,"teacher_disagreement_score":0.0017136306,"about_ca_system_score_codex":0.00083843665,"about_ca_system_score_gemma":0.00080683286,"threshold_uncertainty_score":0.0060833693},"labels":[],"label_agreement":null},{"id":"W2112633589","doi":"10.1109/tcomm.2010.06.090114","title":"Estimation and equalization of fiber-wireless uplink for multiuser CDMA 4G networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":38,"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; Multipath propagation; Electronic engineering; Bit error rate; Channel (broadcasting); Nonlinear distortion; Code division multiple access; Wireless; Equalization (audio); Multiuser detection; Signal-to-interference-plus-noise ratio; Radio over fiber; Computer network; Telecommunications; Engineering; Bandwidth (computing); Physics","score_opus":0.0392670958674767,"score_gpt":0.32696311475869066,"score_spread":0.287696018891214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112633589","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.023643784,0.00021908201,0.9752137,0.000055726945,0.000026154761,0.000018243754,0.000015365447,0.00020823829,0.0005997274],"genre_scores_gemma":[0.49749815,0.00059073773,0.49867642,0.000047977086,0.00006963437,0.000069891044,0.00011646613,0.00005730513,0.002873465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.000073394745,0.0000136239005,0.00004366014,0.0001301198,0.000020472446],"domain_scores_gemma":[0.9995616,0.00026560927,0.000048524438,0.00003455835,0.0000806123,0.000009087558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170612,0.0004796263,0.0003294261,0.00031317963,0.00032670418,0.00032888545,0.00027362801,0.0004794656,0.0011399807],"category_scores_gemma":[0.0020410663,0.00023251318,0.00017460242,0.00023138794,0.00028538756,0.0007191474,0.00036820755,0.0004880525,0.00045442895],"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.00028263705,0.00009069814,0.0023130793,0.00014567366,0.000056794914,0.00010068728,0.00010364248,0.42371452,0.0769117,0.010011923,0.00089502195,0.48537365],"study_design_scores_gemma":[0.000008012087,0.000071790615,0.00090400013,0.000010336669,0.000010187454,0.00006398825,0.000011242574,0.96314335,0.032795876,0.0017178884,0.0012492118,0.000013992357],"about_ca_topic_score_codex":0.0015130888,"about_ca_topic_score_gemma":0.0035806445,"teacher_disagreement_score":0.0015130888,"about_ca_system_score_codex":0.000410605,"about_ca_system_score_gemma":0.0006209156,"threshold_uncertainty_score":0.0038135648},"labels":[],"label_agreement":null},{"id":"W2113120847","doi":"10.1109/tcomm.2010.01.070451","title":"Systematic design of low-density parity-check code ensembles for binary erasure channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"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":"Erasure; Binary erasure channel; Low-density parity-check code; Binary number; Algorithm; Node (physics); Upper and lower bounds; Mathematics; Code (set theory); Degree (music); Computer science; Theoretical computer science; Topology (electrical circuits); Decoding methods; Channel capacity; Arithmetic; Combinatorics; Coding (social sciences); Statistics","score_opus":0.05596313526142133,"score_gpt":0.30405353589121603,"score_spread":0.2480904006297947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113120847","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.11875272,0.00022627779,0.8782061,0.00010562478,0.000038076774,0.00007537412,0.000056404493,0.00022584747,0.0023135128],"genre_scores_gemma":[0.7119408,0.00016887649,0.2868999,0.000056014895,0.000016668813,0.00018312497,0.00006296818,0.0000356528,0.00063600315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956733,0.00016515523,0.000024138688,0.000058796497,0.0001435537,0.000040882027],"domain_scores_gemma":[0.99890804,0.00037894511,0.00026356222,0.00017782036,0.00022563264,0.00004600823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884248,0.00033949074,0.0003719651,0.0003765485,0.00031887722,0.00032167105,0.00043941085,0.00036009555,0.00037385355],"category_scores_gemma":[0.0019494968,0.0002533133,0.0002562924,0.00026817762,0.00046173084,0.0003223529,0.0005568667,0.00040483425,0.00014111125],"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.0001838197,0.00012112026,0.003569351,0.00027876662,0.000102583756,0.0002018287,0.00020617795,0.6818574,0.108069144,0.097136475,0.0011559157,0.10711739],"study_design_scores_gemma":[0.000028376431,0.00017194942,0.00038873745,0.000020099484,0.000021037818,0.00010204293,0.00001398641,0.960971,0.026751045,0.009795617,0.0017114852,0.000024539517],"about_ca_topic_score_codex":0.00027797793,"about_ca_topic_score_gemma":0.00056209264,"teacher_disagreement_score":0.0005884248,"about_ca_system_score_codex":0.00029805876,"about_ca_system_score_gemma":0.0006296712,"threshold_uncertainty_score":0.0031119585},"labels":[],"label_agreement":null},{"id":"W2113552374","doi":"10.1109/26.843130","title":"Valuation of the effects of intersymbol interference in decision-feedback equalizers","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"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; Communications Research Centre Canada","funders":"","keywords":"Intersymbol interference; Computer science; Interference (communication); Markov process; Bounding overwatch; Channel (broadcasting); Convergence (economics); Control theory (sociology); Equalization (audio); Noise (video); Algorithm; Mathematics; Telecommunications; Statistics; Artificial intelligence","score_opus":0.02469361702110106,"score_gpt":0.2861098678788465,"score_spread":0.26141625085774545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113552374","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.26478574,0.001149019,0.72492033,0.00013219574,0.000047368187,0.000047052883,0.000039225884,0.00019804187,0.008680984],"genre_scores_gemma":[0.9597185,0.0003638852,0.0389475,0.000014690243,0.000020265017,0.000021893744,0.000017299815,0.000026685206,0.0008693014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924564,0.00033125433,0.000018212368,0.000028427097,0.00031776616,0.000058648344],"domain_scores_gemma":[0.9926225,0.0066324747,0.00021627088,0.00018931967,0.0002976372,0.0000417593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016851544,0.00063569815,0.00038281086,0.00041032676,0.0002362421,0.00059954444,0.00039811363,0.0005366927,0.0006613107],"category_scores_gemma":[0.011878643,0.00020955077,0.00020333176,0.00036759832,0.0007323519,0.001109316,0.00042412264,0.0005226608,0.00007980669],"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.0003446663,0.000032498465,0.0011206325,0.00007326171,0.0000278016,0.00020417133,0.00007141828,0.94538116,0.01182795,0.0137359435,0.00014971051,0.027030747],"study_design_scores_gemma":[0.000009970455,0.00009186182,0.0006190348,0.000010874162,0.000013819246,0.000080308884,0.000013452139,0.9828652,0.012880193,0.003176704,0.00022886798,0.00000975667],"about_ca_topic_score_codex":0.00093447807,"about_ca_topic_score_gemma":0.000820331,"teacher_disagreement_score":0.0016851544,"about_ca_system_score_codex":0.0006996148,"about_ca_system_score_gemma":0.00033714384,"threshold_uncertainty_score":0.0089120865},"labels":[],"label_agreement":null},{"id":"W2114115739","doi":"10.1109/tcomm.2011.042111.100310","title":"Analysis and Design of Cooperative BICM-OFDM Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Relay; Computer science; Disjoint sets; Cooperative diversity; Diversity gain; Multiplexing; Transmit diversity; Electronic engineering; Selection (genetic algorithm); Wireless; Diversity scheme; Computer network; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Wireless network; Engineering; Fading","score_opus":0.1283991337974955,"score_gpt":0.29790581125811916,"score_spread":0.16950667746062364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114115739","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.029533884,0.0011084145,0.9597476,0.00023563324,0.000028397906,0.000058171725,0.000042827698,0.00007182701,0.00917325],"genre_scores_gemma":[0.89278865,0.0011310789,0.10206093,0.00010269848,0.00004464438,0.00023048156,0.000076988435,0.00003115257,0.0035334034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936587,0.00027028614,0.00001744136,0.000061825434,0.00022732478,0.000057371995],"domain_scores_gemma":[0.9994466,0.00026644688,0.00008330746,0.000040191717,0.0001391738,0.000024389112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008418394,0.00058101164,0.00064766797,0.00043597704,0.00037734426,0.00083925924,0.0007944483,0.000774699,0.0012631622],"category_scores_gemma":[0.002839874,0.00047884262,0.00030566758,0.00045366117,0.0005265147,0.0006415286,0.00085739157,0.00049418333,0.00030206027],"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.00004119844,0.000021584863,0.00047597947,0.000096106945,0.000031910404,0.00012997715,0.0001501717,0.9182475,0.0042972523,0.057967152,0.00068827876,0.017852817],"study_design_scores_gemma":[0.000006282009,0.000020285383,0.00008489776,0.0000082313245,0.0000059487816,0.00003557616,0.000018854287,0.9905301,0.0004626602,0.008030431,0.0007907468,0.0000060532293],"about_ca_topic_score_codex":0.001604248,"about_ca_topic_score_gemma":0.0015993485,"teacher_disagreement_score":0.001604248,"about_ca_system_score_codex":0.00089158415,"about_ca_system_score_gemma":0.00067585317,"threshold_uncertainty_score":0.006468892},"labels":[],"label_agreement":null},{"id":"W2115002145","doi":"10.1109/26.843194","title":"Extremal shape-controlled traffic patterns in high-speed networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"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":"Queueing theory; Upper and lower bounds; Ergodic theory; Queue; Probabilistic logic; Randomness; Channel (broadcasting); Computer science; Network packet; Channel capacity; Random variable; Renewal theory; Topology (electrical circuits); Mathematics; Computer network; Statistics; Combinatorics","score_opus":0.01734213812584941,"score_gpt":0.23626182671001797,"score_spread":0.21891968858416855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115002145","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.62431014,0.00039844253,0.36882076,0.00046819414,0.000050195198,0.00004742584,0.0000688819,0.00024080729,0.005595134],"genre_scores_gemma":[0.991178,0.00013304026,0.008026482,0.00003214086,0.000016620259,0.000021251451,0.000023944107,0.000016547001,0.0005518785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00021695725,0.000019826666,0.00008713299,0.00017187382,0.00013354856],"domain_scores_gemma":[0.99782723,0.0010755834,0.00040164447,0.00021462997,0.00026432588,0.0002165569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008478311,0.00037766004,0.0004140737,0.00058903755,0.0006607097,0.0011911489,0.0009952381,0.0011861179,0.0005639754],"category_scores_gemma":[0.0063768476,0.0004097069,0.00038497316,0.0007035074,0.001940106,0.0012653845,0.0006932955,0.00075204775,0.00011170293],"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.00015527786,0.0000622557,0.003518168,0.000048699247,0.00002612758,0.00038842225,0.00022598873,0.6268316,0.009184179,0.35025933,0.0005640499,0.008735847],"study_design_scores_gemma":[0.000017439866,0.000032558444,0.0007847349,0.000007582084,0.0000074295713,0.00012423772,0.00005518249,0.9258885,0.0014310881,0.071264215,0.00036928296,0.000017801942],"about_ca_topic_score_codex":0.0016129153,"about_ca_topic_score_gemma":0.0014752622,"teacher_disagreement_score":0.0016129153,"about_ca_system_score_codex":0.0013289839,"about_ca_system_score_gemma":0.00069942744,"threshold_uncertainty_score":0.009642541},"labels":[],"label_agreement":null},{"id":"W2115817513","doi":"10.1109/tcomm.2004.838736","title":"On Finite-State Vector Quantization for Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"University of Manitoba","funders":"","keywords":"Decoding methods; Vector quantization; Encoder; Algorithm; Channel (broadcasting); Computer science; Quantization (signal processing); Mathematics; Telecommunications","score_opus":0.04938890782892184,"score_gpt":0.32249000995779525,"score_spread":0.2731011021288734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115817513","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.008057554,0.0011838315,0.98829824,0.00016200506,0.00004699784,0.000024492158,0.000035435725,0.00009444573,0.0020970132],"genre_scores_gemma":[0.73995924,0.0063356315,0.24672869,0.0001908737,0.00028510054,0.00022984014,0.0003193928,0.000077567536,0.005873726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.0004192387,0.00006302465,0.00012037008,0.00037156453,0.0000828652],"domain_scores_gemma":[0.9969619,0.002239973,0.00017423855,0.00025135855,0.0003417801,0.00003072925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590648,0.000603184,0.0008591097,0.00042106325,0.00043558216,0.0011903436,0.0009954063,0.0008095017,0.001437292],"category_scores_gemma":[0.0051157773,0.00031284,0.00034242935,0.0013358778,0.0014683756,0.0021333355,0.00083983317,0.0011862626,0.0003297859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009951632,0.000025165842,0.0003422589,0.00016866803,0.000023814931,0.00011732075,0.00012890769,0.6724718,0.0033823662,0.23993714,0.0011027361,0.08220026],"study_design_scores_gemma":[0.000005010542,0.000018266464,0.00003619814,0.000013194474,0.0000036246588,0.000020796737,0.000007087445,0.9686157,0.0008313473,0.02987918,0.00056087214,0.000008787219],"about_ca_topic_score_codex":0.0049066534,"about_ca_topic_score_gemma":0.0036346845,"teacher_disagreement_score":0.0049066534,"about_ca_system_score_codex":0.0012032968,"about_ca_system_score_gemma":0.0011080701,"threshold_uncertainty_score":0.0097562075},"labels":[],"label_agreement":null},{"id":"W2115825742","doi":"10.1109/tcomm.2006.869865","title":"Reliability-based coded modulation with low-density parity-check codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":37,"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":"Low-density parity-check code; Demodulation; Decoding methods; Algorithm; Raptor code; Computer science; Coding (social sciences); Turbo code; Modulation (music); Bit error rate; Error detection and correction; Electronic engineering; Mathematics; Statistics; Telecommunications; Error floor; Engineering","score_opus":0.01966030584582169,"score_gpt":0.26426229313043303,"score_spread":0.24460198728461136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115825742","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.090166345,0.0013038706,0.9007663,0.00043448657,0.00010031021,0.0000650701,0.000036047844,0.00018097798,0.0069466094],"genre_scores_gemma":[0.8480115,0.00065911625,0.14959629,0.00011192661,0.00007897116,0.000064096406,0.000031267064,0.000022508066,0.0014242681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.00026388827,0.000022059805,0.000044772594,0.00026407282,0.000056431432],"domain_scores_gemma":[0.99854773,0.00082603836,0.00016024361,0.00018840373,0.00025286357,0.000024691542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080818794,0.00050767796,0.00043253665,0.00041362437,0.00028714383,0.0005827423,0.0006907778,0.0007618382,0.0005425637],"category_scores_gemma":[0.0041124304,0.00017297849,0.00021283825,0.00047194006,0.0008136375,0.0008021291,0.0005212322,0.0006127917,0.00027565495],"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.00028781284,0.00007183247,0.001371734,0.0003608484,0.000056989036,0.0005010467,0.00023824324,0.6254845,0.04197717,0.2603459,0.0009912072,0.06831273],"study_design_scores_gemma":[0.000029926314,0.00014133057,0.00015007031,0.000027327776,0.000022495642,0.00021494264,0.000013781507,0.957941,0.013732722,0.025939653,0.0017675869,0.00001910858],"about_ca_topic_score_codex":0.0004863655,"about_ca_topic_score_gemma":0.0004970154,"teacher_disagreement_score":0.00080818794,"about_ca_system_score_codex":0.00042239594,"about_ca_system_score_gemma":0.00044179673,"threshold_uncertainty_score":0.0042741895},"labels":[],"label_agreement":null},{"id":"W2116246363","doi":"10.1109/tcomm.2009.03.070068","title":"Adaptive iterative detectors for phase-uncertain channels via variational bounding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":34,"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":"Bounding overwatch; Detector; Computer science; Iterative method; Phase (matter); Control theory (sociology); Phase detector; Electronic engineering; Algorithm; Mathematical optimization; Mathematics; Physics; Telecommunications; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.047585702832365954,"score_gpt":0.3252938858538462,"score_spread":0.27770818302148026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116246363","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.0034294124,0.00009011082,0.9958175,0.00004781598,0.0000054054167,0.0000090389385,0.0000083849945,0.00003962531,0.0005526766],"genre_scores_gemma":[0.40000376,0.00069284695,0.5952883,0.0001528454,0.00006172792,0.00018472684,0.00016312473,0.0001162507,0.003336407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.0005741868,0.00005425133,0.00016258248,0.00042785174,0.000109426415],"domain_scores_gemma":[0.99662113,0.0026560242,0.00021092591,0.00019039474,0.000264578,0.00005694649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024893403,0.00080630986,0.00116962,0.00061268045,0.00038661752,0.0011874513,0.0012238596,0.001009207,0.00095849903],"category_scores_gemma":[0.008632773,0.0006233571,0.0008157911,0.00078770943,0.0015851319,0.0016502779,0.001775035,0.0013432212,0.00022412126],"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.000060153867,0.000026351303,0.00031694645,0.0000811394,0.000040592902,0.00007659432,0.00014286222,0.77913976,0.0054433215,0.17695591,0.00057245744,0.037143912],"study_design_scores_gemma":[0.000003254178,0.0000064622386,0.000025646157,0.000002988646,0.0000022609368,0.000014892867,0.000003155649,0.98244965,0.00071367336,0.016580837,0.00019265663,0.0000044656576],"about_ca_topic_score_codex":0.0024292448,"about_ca_topic_score_gemma":0.0018463115,"teacher_disagreement_score":0.0024893403,"about_ca_system_score_codex":0.0012384192,"about_ca_system_score_gemma":0.0016809626,"threshold_uncertainty_score":0.013165057},"labels":[],"label_agreement":null},{"id":"W2116430029","doi":"10.1109/tcomm.2009.04.070246","title":"The effect of imperfect carrier frequency offset estimation on an OFDMA uplink","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":25,"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; Carrier frequency offset; Orthogonal frequency-division multiple access; Bit error rate; Orthogonal frequency-division multiplexing; Electronic engineering; Interference (communication); Frequency-division multiple access; Frequency offset; Computer science; Signal-to-interference-plus-noise ratio; Power (physics); Telecommunications; Engineering; Decoding methods; Physics","score_opus":0.011336078168917496,"score_gpt":0.2876714722224291,"score_spread":0.2763353940535116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116430029","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.6593445,0.0018321717,0.32856902,0.00051197497,0.000191926,0.00003647425,0.00024145258,0.00074722024,0.008525303],"genre_scores_gemma":[0.9910807,0.00033347303,0.007916666,0.000030663236,0.000033759392,0.000005723374,0.000052004703,0.000033503,0.0005134046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990121,0.00023379269,0.000054514814,0.00013865675,0.00043115823,0.00012972932],"domain_scores_gemma":[0.99408287,0.0040703434,0.0007072539,0.00041792175,0.00064064434,0.00008098075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008969415,0.00052869023,0.0006668704,0.00036347087,0.0006490827,0.00061364705,0.00031861162,0.0005993348,0.00050571753],"category_scores_gemma":[0.01058641,0.00031932414,0.00018841638,0.00057547115,0.0008280133,0.0010735267,0.0006201427,0.0005513597,0.00018937168],"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.00047221634,0.000057426376,0.014750931,0.00018239398,0.00005724773,0.002047621,0.00024670846,0.8734535,0.040743016,0.005253109,0.0007425252,0.061993346],"study_design_scores_gemma":[0.00000825178,0.00015767373,0.013609499,0.00003330139,0.000092647504,0.0011178625,0.000104917315,0.9370423,0.044809476,0.0021431136,0.00082400354,0.00005679265],"about_ca_topic_score_codex":0.004806604,"about_ca_topic_score_gemma":0.004091484,"teacher_disagreement_score":0.004806604,"about_ca_system_score_codex":0.00072712405,"about_ca_system_score_gemma":0.000549226,"threshold_uncertainty_score":0.009557247},"labels":[],"label_agreement":null},{"id":"W2116674255","doi":"10.1109/tcomm.2010.01.080080","title":"Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":274,"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; University of Waterloo","funders":"","keywords":"Relay; Relay channel; Cooperative diversity; Node (physics); Computer science; Transmitter; Selection (genetic algorithm); Diversity gain; Computer network; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Channel (broadcasting); Telecommunications; Fading; Engineering; Power (physics); Artificial intelligence","score_opus":0.0326593209367927,"score_gpt":0.26295878030493214,"score_spread":0.23029945936813945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116674255","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.26956847,0.0035790207,0.7060838,0.0010063073,0.00006080938,0.00009101821,0.00034628503,0.00043404018,0.018830262],"genre_scores_gemma":[0.9895335,0.0010789072,0.007522737,0.000057440666,0.000037465506,0.000054564,0.00008985827,0.000029376348,0.0015960407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.0006046331,0.000051391853,0.00016116732,0.00050221116,0.0003069639],"domain_scores_gemma":[0.9918887,0.0056288815,0.0008046033,0.00029615316,0.0012536738,0.00012786948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895397,0.0013096469,0.0012998836,0.0012301813,0.0007183966,0.001484953,0.0012267944,0.0011481834,0.0014236288],"category_scores_gemma":[0.01005551,0.0005097089,0.00057020236,0.0014000789,0.0017661394,0.0016812035,0.0013117378,0.00074851216,0.0002861218],"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.000098127275,0.000026821006,0.000852137,0.00007759021,0.000040207033,0.00017684231,0.00013554678,0.96266246,0.0028352549,0.026860727,0.00047738274,0.0057569346],"study_design_scores_gemma":[0.0000044792764,0.000035447905,0.00024735334,0.000007682387,0.000012748936,0.00006233095,0.000025298252,0.9951336,0.00044879466,0.0039027578,0.00011004654,0.000009537581],"about_ca_topic_score_codex":0.0074073,"about_ca_topic_score_gemma":0.0041003632,"teacher_disagreement_score":0.0074073,"about_ca_system_score_codex":0.00299907,"about_ca_system_score_gemma":0.0014005756,"threshold_uncertainty_score":0.021759868},"labels":[],"label_agreement":null},{"id":"W2116750704","doi":"10.1109/tcomm.2002.1006561","title":"A reduced complexity channel estimation for OFDM systems with transmit diversity in mobile wireless channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":104,"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":"Subcarrier; Orthogonal frequency-division multiplexing; Algorithm; Computational complexity theory; Reduction (mathematics); Channel (broadcasting); Computer science; Bit error rate; Electronic engineering; Mathematics; Telecommunications; Engineering","score_opus":0.08356209367219043,"score_gpt":0.2788531696928271,"score_spread":0.19529107602063667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116750704","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.008620808,0.00025726005,0.9901316,0.000058938964,0.000038888757,0.00003187464,0.000025517396,0.0003758434,0.0004593081],"genre_scores_gemma":[0.19505635,0.00052667595,0.8019099,0.00005874685,0.00015896981,0.00011287707,0.00015400213,0.000051380102,0.0019710993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.000113152055,0.000016961845,0.000052084775,0.0001875856,0.000031927782],"domain_scores_gemma":[0.9994012,0.00026344828,0.00007632377,0.00012112928,0.00011690747,0.000021024076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003617121,0.00057228253,0.0005525176,0.00043146222,0.00029084302,0.0004501656,0.000543313,0.0005163392,0.0011643381],"category_scores_gemma":[0.0013858917,0.0003520377,0.00040701946,0.00034306166,0.00037216872,0.00050646235,0.00038733578,0.000730978,0.00062483666],"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.00047265762,0.00014372304,0.0009211332,0.00033979185,0.00014575361,0.00026067704,0.00014157203,0.16308159,0.21158634,0.015073628,0.0033792187,0.6044539],"study_design_scores_gemma":[0.00005297027,0.00020106946,0.0008209867,0.0000148878835,0.00005031235,0.0002846238,0.0000144463265,0.94566995,0.045706943,0.0017910668,0.0053393394,0.000053468113],"about_ca_topic_score_codex":0.0012778078,"about_ca_topic_score_gemma":0.002406764,"teacher_disagreement_score":0.0012778078,"about_ca_system_score_codex":0.0002648924,"about_ca_system_score_gemma":0.0006516184,"threshold_uncertainty_score":0.003895104},"labels":[],"label_agreement":null},{"id":"W2117094662","doi":"10.1109/tcomm.2007.898836","title":"Equalization for DS-UWB Systems—Part I: BPSK Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 British Columbia","funders":"","keywords":"Rake; Rake receiver; Equalization (audio); Computer science; Phase-shift keying; Intersymbol interference; Electronic engineering; Adaptive equalizer; Transmission (telecommunications); Ultra-wideband; Data transmission; Bandwidth (computing); Matched filter; Channel (broadcasting); Bit error rate; Filter (signal processing); Telecommunications; Engineering; Fading; Computer network","score_opus":0.0399079712772989,"score_gpt":0.2799604119695461,"score_spread":0.24005244069224718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117094662","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.01923963,0.0037507804,0.96586746,0.00024738535,0.0001383161,0.000032642616,0.000046986945,0.00026951535,0.010407201],"genre_scores_gemma":[0.84926134,0.008561506,0.12982333,0.00023154348,0.0003705849,0.00010428362,0.00013089456,0.00012704438,0.011389499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969363,0.0000571445,0.0000147650935,0.000045511322,0.0001577765,0.000031224932],"domain_scores_gemma":[0.9997086,0.00014833536,0.000037361573,0.00003179384,0.00006850958,0.0000053257177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026173552,0.00061764644,0.00045685013,0.00036348123,0.00027640868,0.00076918886,0.0002556257,0.0005297223,0.002796546],"category_scores_gemma":[0.0010955381,0.00023465566,0.0002671301,0.0005230934,0.00051082775,0.00066334195,0.00042198284,0.0006720594,0.0009602806],"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.000348112,0.00010653634,0.0012905137,0.0008417108,0.00010928371,0.0002611123,0.00021677108,0.38157687,0.14193428,0.09904498,0.0052626724,0.36900708],"study_design_scores_gemma":[0.000019499701,0.00017091751,0.0013363889,0.00010648805,0.00004961973,0.00031812384,0.000049671624,0.9219616,0.04109825,0.023420582,0.011433242,0.000035594305],"about_ca_topic_score_codex":0.00070282345,"about_ca_topic_score_gemma":0.00065812515,"teacher_disagreement_score":0.002796546,"about_ca_system_score_codex":0.0005719003,"about_ca_system_score_gemma":0.0003932911,"threshold_uncertainty_score":0.009355426},"labels":[],"label_agreement":null},{"id":"W2117145663","doi":"10.1109/tcomm.2010.03.080118","title":"Capacity of amplify-and-forward multi-hop relaying systems under adaptive transmission","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"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":"Fading; Channel capacity; Nakagami distribution; Signal-to-noise ratio (imaging); Computer science; Control theory (sociology); Noise power; Communications system; Adaptive system; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Mathematics; Power (physics); Telecommunications; Engineering; Physics","score_opus":0.10172004464597555,"score_gpt":0.30624978644737333,"score_spread":0.20452974180139777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117145663","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.74283105,0.0020265826,0.23713875,0.0006332784,0.00007169711,0.00007028067,0.0004659102,0.0005207947,0.016241694],"genre_scores_gemma":[0.9978225,0.0002012372,0.0014659535,0.0000116723295,0.000014255375,0.000021340076,0.000049076727,0.000007869879,0.00040612073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989176,0.00031785393,0.000051402014,0.00012554109,0.00026070556,0.00032689082],"domain_scores_gemma":[0.99250984,0.0053318115,0.0005866447,0.0004474106,0.0009914534,0.00013280574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961712,0.00060750474,0.00092436175,0.000797233,0.00067522546,0.0012389447,0.00076626433,0.0008746306,0.0011546193],"category_scores_gemma":[0.006843373,0.00026486465,0.00039056403,0.0009042318,0.0017620601,0.0014828432,0.00109902,0.00052644673,0.00019102507],"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.00017575541,0.000015065441,0.0006097807,0.0000930111,0.00003294567,0.00028845237,0.00015640957,0.96321285,0.0064658686,0.020971168,0.0004851698,0.0074935425],"study_design_scores_gemma":[0.00001181852,0.000054426408,0.00058445055,0.000016875185,0.000028324266,0.0001131076,0.000070153794,0.9864152,0.003044299,0.0093538705,0.0002780085,0.00002950875],"about_ca_topic_score_codex":0.0054246993,"about_ca_topic_score_gemma":0.002242596,"teacher_disagreement_score":0.0054246993,"about_ca_system_score_codex":0.0017441225,"about_ca_system_score_gemma":0.0012083753,"threshold_uncertainty_score":0.012654543},"labels":[],"label_agreement":null},{"id":"W2117691901","doi":"10.1109/tcomm.2006.869881","title":"Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":27,"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":"Block code; Decoding methods; Algorithm; Computational complexity theory; Space time; Metric (unit); Mathematics; Computer science; Block (permutation group theory); Concatenated error correction code; Combinatorics; Engineering","score_opus":0.02592500877808454,"score_gpt":0.2732119221488582,"score_spread":0.24728691337077366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117691901","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.0036094193,0.00023688143,0.9939248,0.00008780317,0.00004472456,0.000019403327,0.000046566536,0.0004139102,0.001616567],"genre_scores_gemma":[0.14403702,0.0007399222,0.84870553,0.00013669816,0.00012018658,0.00012166978,0.00048385526,0.00016238897,0.0054927943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888676,0.00038712905,0.0000682033,0.00008932144,0.00051056076,0.000057954534],"domain_scores_gemma":[0.99838686,0.00060663506,0.00012669618,0.00034032678,0.0004953242,0.00004405456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008146604,0.00069947145,0.00074577134,0.00066821434,0.00037213325,0.00087320997,0.0005229279,0.00066204945,0.0022784437],"category_scores_gemma":[0.0036518844,0.00020273996,0.00032751216,0.0009839016,0.0006311656,0.0009886214,0.000686685,0.00090467214,0.0023945647],"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.00044548747,0.000080666476,0.0008010134,0.00024513836,0.00007596886,0.00013698635,0.00015104134,0.17232649,0.04487898,0.16436198,0.010036942,0.6064593],"study_design_scores_gemma":[0.00004451778,0.00008696802,0.0002785749,0.000017569708,0.000010655612,0.00019742902,0.000016837203,0.9351538,0.024568653,0.028336644,0.011255873,0.000032433825],"about_ca_topic_score_codex":0.0017963508,"about_ca_topic_score_gemma":0.0022923967,"teacher_disagreement_score":0.0022784437,"about_ca_system_score_codex":0.0005901488,"about_ca_system_score_gemma":0.001287552,"threshold_uncertainty_score":0.0076221824},"labels":[],"label_agreement":null},{"id":"W2117855196","doi":"10.1109/tcomm.2007.908512","title":"On the Applicability of the Pearson Method for Approximating Distributions in Wireless Communications","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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 British Columbia","funders":"","keywords":"Nakagami distribution; Weibull distribution; Fading; Wireless; Weibull fading; Simple (philosophy); Computer science; Random variable; Probability distribution; Communications system; Mathematics; Algorithm; Applied mathematics; Statistics; Telecommunications; Rayleigh fading; Decoding methods","score_opus":0.036687443614386174,"score_gpt":0.32654613722809206,"score_spread":0.28985869361370586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117855196","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.0021033527,0.0008776892,0.9931572,0.00021216263,0.000054194807,0.000015349235,0.000022566755,0.00008255316,0.0034749636],"genre_scores_gemma":[0.31516746,0.0140772015,0.6559012,0.0008477692,0.000654601,0.00024489526,0.00021363932,0.00051589136,0.012377367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699306,0.0019105021,0.00006875948,0.00019432411,0.0007250998,0.00010812176],"domain_scores_gemma":[0.9884843,0.009802386,0.00032034033,0.0007688326,0.0005603258,0.000063722015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073084976,0.0015379522,0.0008362907,0.0012514377,0.0006007316,0.0012173518,0.0013232316,0.0012813733,0.0022565671],"category_scores_gemma":[0.026140373,0.0004741175,0.0009166717,0.002013883,0.0025280386,0.003544015,0.001448438,0.0026606533,0.0017042],"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.000056326724,0.000024972578,0.00062975014,0.00013820904,0.000034809844,0.00023565415,0.00027027505,0.2039025,0.002073354,0.7365318,0.0030300305,0.05307239],"study_design_scores_gemma":[0.0000140705915,0.000074956435,0.00025811,0.00007628699,0.000016263437,0.0003889562,0.000071666764,0.7211221,0.0013713303,0.26748356,0.00907763,0.000045095596],"about_ca_topic_score_codex":0.0022051907,"about_ca_topic_score_gemma":0.0015382642,"teacher_disagreement_score":0.0073084976,"about_ca_system_score_codex":0.0008622031,"about_ca_system_score_gemma":0.0008236632,"threshold_uncertainty_score":0.038651466},"labels":[],"label_agreement":null},{"id":"W2118061326","doi":"10.1109/tcomm.2010.07.090337","title":"Performance Analysis for BICM Transmission over Gaussian Mixture Noise Fading Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":32,"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":"Fading; Computer science; Gaussian noise; Transmission (telecommunications); Electronic engineering; Fading distribution; Noise (video); Additive white Gaussian noise; Telecommunications; Channel (broadcasting); Algorithm; Rayleigh fading; Engineering; Artificial intelligence","score_opus":0.01915652581378722,"score_gpt":0.277049875312401,"score_spread":0.25789334949861376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118061326","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.2659062,0.0034146395,0.7150011,0.00064966094,0.00006711228,0.000054056924,0.00019743673,0.0004812948,0.014228534],"genre_scores_gemma":[0.9765572,0.0011859477,0.020158056,0.0000872741,0.000031369662,0.000035281937,0.00010061391,0.000053701235,0.0017905629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914634,0.00035981167,0.00002115377,0.000050751063,0.0003232985,0.00009857951],"domain_scores_gemma":[0.99647176,0.0024824585,0.0002220946,0.00014787608,0.0006301661,0.00004562919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015482788,0.0009962807,0.0008264116,0.00088652346,0.0004850816,0.00080173824,0.00063719763,0.0008987791,0.0015814654],"category_scores_gemma":[0.007322674,0.00029923182,0.00054283807,0.00090507476,0.0010542339,0.00095639774,0.0010139873,0.00077326,0.00039105563],"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.00010418762,0.000015079622,0.0011316316,0.000097991775,0.00003226859,0.00021565767,0.00018448976,0.96316016,0.004927244,0.023012608,0.0004137136,0.006705005],"study_design_scores_gemma":[0.0000023634486,0.00002510628,0.00031178966,0.000014150958,0.0000067005744,0.00010109295,0.000026354322,0.9957931,0.00095868134,0.0026266156,0.00012226473,0.000011754738],"about_ca_topic_score_codex":0.0044242283,"about_ca_topic_score_gemma":0.0023049377,"teacher_disagreement_score":0.0044242283,"about_ca_system_score_codex":0.0012259865,"about_ca_system_score_gemma":0.0006375527,"threshold_uncertainty_score":0.008895218},"labels":[],"label_agreement":null},{"id":"W2118733048","doi":"10.1109/tcomm.2013.0828131.120920","title":"Robust Design of Widely Linear Pre-Equalization Filters for Pre-Rake UWB Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 British Columbia","funders":"","keywords":"Rake; Computer science; Rake receiver; Electronic engineering; Transmitter; Equalization (audio); Channel state information; Robustness (evolution); Ultra-wideband; Transmission (telecommunications); Filter (signal processing); Communications system; Channel (broadcasting); Fading; Telecommunications; Engineering; Wireless","score_opus":0.06220147998480039,"score_gpt":0.27022778312334106,"score_spread":0.20802630313854067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118733048","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.003316925,0.00019722499,0.9956577,0.000047319147,0.000017045391,0.000015063837,0.000010103385,0.00005576861,0.0006829685],"genre_scores_gemma":[0.637588,0.0013061455,0.35668766,0.00018791488,0.00010450215,0.00029709763,0.00009927183,0.00006138861,0.0036679315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930966,0.00016163722,0.000044618933,0.00020446347,0.0002172415,0.000062317406],"domain_scores_gemma":[0.99871635,0.00064411067,0.00026503662,0.0000750313,0.00027404376,0.000025439429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009592445,0.0012064369,0.0008807842,0.0003678667,0.0002909118,0.0010643861,0.00073020445,0.0015741033,0.0011155232],"category_scores_gemma":[0.0028586618,0.00047103313,0.00067011255,0.00029251177,0.00067424774,0.0008418558,0.00065770635,0.0010404052,0.0005032677],"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.00016712803,0.00006252567,0.0005083391,0.00030858404,0.000104531995,0.00017697715,0.00022538402,0.7446411,0.048933875,0.03763523,0.0010155449,0.16622083],"study_design_scores_gemma":[0.000017086904,0.00014708923,0.00016696252,0.00003533577,0.000026428595,0.000077572615,0.000021692435,0.98271173,0.00985483,0.004851888,0.0020643384,0.000025124458],"about_ca_topic_score_codex":0.000773811,"about_ca_topic_score_gemma":0.000645705,"teacher_disagreement_score":0.0015741033,"about_ca_system_score_codex":0.0005698653,"about_ca_system_score_gemma":0.0006796673,"threshold_uncertainty_score":0.0050730705},"labels":[],"label_agreement":null},{"id":"W2118891613","doi":"10.1109/tcomm.2005.855005","title":"Enhanced Multiple-Bit Differential Detection of DOQPSK","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of British Columbia","funders":"","keywords":"Bit error rate; Algorithm; Decoding methods; Phase-shift keying; Bit (key); Mathematics; Offset (computer science); Detection theory; Computer science; Differential coding; Telecommunications; Detector","score_opus":0.018051863832494467,"score_gpt":0.25843734565958626,"score_spread":0.2403854818270918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118891613","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.10702531,0.0011997427,0.8865276,0.00026826368,0.0000996377,0.000038394966,0.000044433003,0.0001223227,0.004674325],"genre_scores_gemma":[0.824221,0.0010542045,0.17206235,0.00013591969,0.00010473761,0.000030434838,0.000050569037,0.0000189337,0.002321845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.00020995375,0.000034036584,0.0001447962,0.00032710336,0.00011347022],"domain_scores_gemma":[0.99903226,0.0005629409,0.00011602621,0.00010919307,0.00015412839,0.000025520849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297571,0.00056284375,0.00065750454,0.00031527967,0.00021882507,0.00066518894,0.000666614,0.00058847555,0.00058784825],"category_scores_gemma":[0.0026083782,0.00023068766,0.00027227658,0.00042868426,0.0006708414,0.0012149011,0.0006473455,0.00051619235,0.00015943979],"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.0006270883,0.00015082175,0.0038549455,0.00046175136,0.00009051941,0.0007256407,0.00026173057,0.5211645,0.14250489,0.1931319,0.00090863433,0.1361176],"study_design_scores_gemma":[0.000019235214,0.00014313312,0.00042935018,0.000015424064,0.000020859767,0.0002397687,0.000019323854,0.9594249,0.02622837,0.011002083,0.0024403625,0.000017206296],"about_ca_topic_score_codex":0.0005320637,"about_ca_topic_score_gemma":0.0007064211,"teacher_disagreement_score":0.000666614,"about_ca_system_score_codex":0.00058615475,"about_ca_system_score_gemma":0.0004929211,"threshold_uncertainty_score":0.004252851},"labels":[],"label_agreement":null},{"id":"W2119039041","doi":"10.1109/tcomm.2009.07.070157","title":"Resource allocation in an OFDM-based cognitive radio system","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":175,"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":"Cognitive radio; Subcarrier; Knapsack problem; Orthogonal frequency-division multiplexing; Resource allocation; Greedy algorithm; Computer science; Frequency allocation; Mathematical optimization; Resource management (computing); Simple (philosophy); Electronic engineering; Algorithm; Telecommunications; Computer network; Mathematics; Engineering; Wireless","score_opus":0.019338298893964344,"score_gpt":0.2548390433945764,"score_spread":0.23550074450061206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119039041","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.13312447,0.000887281,0.8544377,0.00036707427,0.00009316302,0.00006802717,0.00006763478,0.00016940774,0.010785169],"genre_scores_gemma":[0.9622698,0.00026255645,0.035111178,0.00008967842,0.000035530404,0.00006405698,0.000021728561,0.000011386934,0.0021341473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00018439711,0.000017550425,0.00008168748,0.000120326964,0.00013241875],"domain_scores_gemma":[0.99953437,0.0002779329,0.00006712846,0.0000244824,0.00006342516,0.000032821114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088747975,0.00042710063,0.00076957524,0.0003080677,0.0005341055,0.0012264339,0.000978035,0.0008519856,0.0011416151],"category_scores_gemma":[0.0019893062,0.0002917086,0.00021743451,0.00062190235,0.0007662865,0.00075829815,0.0007719322,0.00043129097,0.0001938788],"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.0001205091,0.000048132548,0.00025275347,0.000050532424,0.000030101914,0.00019395567,0.000050878945,0.96464777,0.0024325964,0.012267376,0.00070542924,0.019200027],"study_design_scores_gemma":[0.000019713523,0.00002608486,0.00008965753,0.0000034736622,0.000008168982,0.000033506338,0.000019327103,0.9948368,0.0003753137,0.0043096542,0.00027110244,0.0000072132],"about_ca_topic_score_codex":0.004818399,"about_ca_topic_score_gemma":0.0027396178,"teacher_disagreement_score":0.004818399,"about_ca_system_score_codex":0.00079782924,"about_ca_system_score_gemma":0.0008963059,"threshold_uncertainty_score":0.009580731},"labels":[],"label_agreement":null},{"id":"W2119561941","doi":"10.1109/tcomm.2014.022314.120896","title":"Asymptotical Analysis of Several Multiple Description Scenarios with L≥ 3 Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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":"McMaster University","funders":"","keywords":"Erasure; Algorithm; Computer science; Lattice (music); Code (set theory); Mathematics; Theoretical computer science","score_opus":0.02844989013748888,"score_gpt":0.2391577841428268,"score_spread":0.2107078940053379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119561941","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.4495017,0.0034403137,0.5138914,0.001679928,0.00010476156,0.00017031064,0.0003304881,0.0008285745,0.030052485],"genre_scores_gemma":[0.97210354,0.00059955526,0.025178414,0.00013898376,0.00004775881,0.00006348985,0.00015651496,0.000068506335,0.0016431881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971245,0.0010435551,0.00007722768,0.00024387613,0.0009398085,0.00057102676],"domain_scores_gemma":[0.9738235,0.020588227,0.0018124196,0.0015112596,0.0018342859,0.0004302918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049395883,0.00090920884,0.00091428176,0.0015355473,0.0008967325,0.0013427838,0.001460235,0.0013798514,0.0029751149],"category_scores_gemma":[0.02497492,0.0004469393,0.0007441924,0.00084463274,0.0019544864,0.0030396872,0.0023282375,0.0016454502,0.0004023101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007534082,0.00019533487,0.0035448112,0.00040028166,0.000109293665,0.0005559523,0.00027443533,0.82961226,0.012405576,0.12107542,0.0016527688,0.029420411],"study_design_scores_gemma":[0.000021785949,0.00017225553,0.00055391627,0.000038239472,0.000022591239,0.00029823865,0.00007183494,0.98030865,0.004689921,0.013199534,0.00057975843,0.00004316791],"about_ca_topic_score_codex":0.0019642706,"about_ca_topic_score_gemma":0.0014979288,"teacher_disagreement_score":0.0049395883,"about_ca_system_score_codex":0.002650754,"about_ca_system_score_gemma":0.0014518553,"threshold_uncertainty_score":0.026123345},"labels":[],"label_agreement":null},{"id":"W2119912755","doi":"10.1109/tcomm.2010.08.080181","title":"On the Dynamics of Analog Min-Sum Iterative Decoders: An Analytical Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Mathematics; Piecewise linear function; Applied mathematics; Singularity; Algorithm; Computer science; Mathematical analysis","score_opus":0.05127028002457988,"score_gpt":0.3201092435319665,"score_spread":0.2688389635073866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119912755","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.109202236,0.0011924825,0.8313887,0.001381303,0.00008704979,0.000047984184,0.00009090493,0.00024318375,0.056366187],"genre_scores_gemma":[0.95719147,0.0011441684,0.030963233,0.00019847673,0.000053014595,0.00004043351,0.00004033307,0.000064092266,0.010304722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984276,0.0000440223,0.0000043214477,0.000017992403,0.00006575814,0.000025086836],"domain_scores_gemma":[0.9995234,0.00026146794,0.00005781697,0.000041828687,0.000085708285,0.000029869276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003445632,0.00038141315,0.00036050222,0.00056345726,0.00040472025,0.00081604614,0.0006626564,0.0006341898,0.003348402],"category_scores_gemma":[0.0024024518,0.00024192978,0.00030853332,0.0003604098,0.0013091611,0.0013870603,0.0008322682,0.0007925474,0.00045730808],"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.00003608125,0.000026696853,0.00032236,0.00007374591,0.000009446752,0.00016889078,0.0002517195,0.34857756,0.0058925655,0.6348893,0.0009258781,0.008825634],"study_design_scores_gemma":[0.0000032641524,0.0000128256415,0.0000836478,0.00001330754,0.0000032131265,0.000087546105,0.000037955448,0.89535254,0.00083816616,0.10263127,0.00092831027,0.0000080172],"about_ca_topic_score_codex":0.0010981513,"about_ca_topic_score_gemma":0.0007604764,"teacher_disagreement_score":0.003348402,"about_ca_system_score_codex":0.0009878795,"about_ca_system_score_gemma":0.0004446634,"threshold_uncertainty_score":0.0112015605},"labels":[],"label_agreement":null},{"id":"W2120347238","doi":"10.1109/tcomm.2011.060911.100166","title":"Exact and Closed-Form Error Performance Analysis for Hard MMSE-SIC Detection in MIMO Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":51,"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":"Quadrature amplitude modulation; MIMO; Bit error rate; QAM; Mathematics; Algorithm; Single antenna interference cancellation; Pulse-amplitude modulation; Modulation (music); Control theory (sociology); Computer science; Statistics; Telecommunications; Pulse (music); Decoding methods; Physics; Detector","score_opus":0.05845323976861937,"score_gpt":0.2715310289998595,"score_spread":0.2130777892312401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120347238","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.04998732,0.0014799931,0.9398156,0.0002763636,0.000056868892,0.0000574066,0.00019698202,0.00036140362,0.007768092],"genre_scores_gemma":[0.8961213,0.001457825,0.098253064,0.0002257961,0.00010267751,0.00012662499,0.00028196373,0.00009577207,0.0033350252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652314,0.0010920074,0.00016791782,0.0003132771,0.0014935925,0.0004100726],"domain_scores_gemma":[0.9892762,0.0075951507,0.00082486734,0.00067395536,0.0015212017,0.00010865289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005058966,0.0014695864,0.0017470464,0.0010863008,0.00050375675,0.0017263768,0.0011508557,0.0014485877,0.0033298512],"category_scores_gemma":[0.019246643,0.0006235077,0.0006814302,0.0011507587,0.0021435337,0.0020742964,0.0018175989,0.001044356,0.0006316403],"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.00009577758,0.000024106497,0.00090213865,0.00020480092,0.000050448136,0.00013295928,0.00011816062,0.9434505,0.0026254745,0.040322993,0.00040696017,0.011665605],"study_design_scores_gemma":[0.000010312712,0.000047944504,0.00039286472,0.000040080264,0.000015060818,0.00013442613,0.000029940764,0.9839677,0.0018842056,0.013212009,0.00024139609,0.000024136722],"about_ca_topic_score_codex":0.002404583,"about_ca_topic_score_gemma":0.0022426813,"teacher_disagreement_score":0.005058966,"about_ca_system_score_codex":0.0015866191,"about_ca_system_score_gemma":0.0017314127,"threshold_uncertainty_score":0.026754677},"labels":[],"label_agreement":null},{"id":"W2120448104","doi":"10.1109/tcomm.2004.836447","title":"Multihop Diversity in Wireless Relaying Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":673,"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":"Channel (broadcasting); Computer science; Computer network; Wireless; Transmission (telecommunications); Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.09475132157149174,"score_gpt":0.3027697721859978,"score_spread":0.20801845061450608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120448104","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.065641664,0.0024645792,0.91551685,0.0004507199,0.00011602102,0.000051985182,0.00015518162,0.00017101852,0.015431969],"genre_scores_gemma":[0.9514136,0.0032715662,0.040594198,0.00017345464,0.00018694327,0.000108424196,0.000099234945,0.000040410778,0.004112225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.00037144852,0.000031311378,0.00010886386,0.0005664132,0.00017079551],"domain_scores_gemma":[0.9953584,0.0032577487,0.00037771088,0.00033526865,0.0006001044,0.00007069046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011502359,0.00077206676,0.00061433256,0.0008044845,0.0005659857,0.0015451161,0.0007877992,0.0009536848,0.0015853823],"category_scores_gemma":[0.0057506333,0.00038834996,0.00056756445,0.0006602492,0.0014295003,0.0020573903,0.0007668688,0.001038822,0.0004291604],"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.00004933207,0.000023045266,0.00042466132,0.00011322147,0.000020852149,0.00023525275,0.00015649719,0.67013675,0.0037094606,0.31141433,0.00075810344,0.012958519],"study_design_scores_gemma":[0.000011575417,0.00006565649,0.00023537914,0.000028470597,0.000016755046,0.00030939735,0.00005211067,0.89881325,0.001446588,0.09582879,0.0031597093,0.00003224314],"about_ca_topic_score_codex":0.0014712827,"about_ca_topic_score_gemma":0.0011629697,"teacher_disagreement_score":0.0015853823,"about_ca_system_score_codex":0.0014218985,"about_ca_system_score_gemma":0.0007850411,"threshold_uncertainty_score":0.01031667},"labels":[],"label_agreement":null},{"id":"W2120458420","doi":"10.1109/tcomm.2009.09.070567","title":"Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":20,"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":"Fading; Quadrature amplitude modulation; QAM; Algorithm; Computer science; Mathematics; Probability density function; Fading distribution; Electronic engineering; Statistics; Bit error rate; Decoding methods; Rayleigh fading; Engineering","score_opus":0.03961288077833008,"score_gpt":0.300856371263989,"score_spread":0.2612434904856589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120458420","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.06746839,0.0018898486,0.9225355,0.00046687166,0.000048694652,0.00005114103,0.00027578376,0.00058949454,0.0066742063],"genre_scores_gemma":[0.92781323,0.0020375676,0.06440572,0.00029111234,0.0000880887,0.0002288991,0.00049040833,0.00021981123,0.004425274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937916,0.00025826914,0.00002213715,0.00005985986,0.00020701019,0.000073479336],"domain_scores_gemma":[0.99360895,0.004370232,0.00058718794,0.00044190048,0.00086803094,0.00012378888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018948601,0.0008565489,0.000527992,0.0011558749,0.00031956137,0.001404447,0.0008360871,0.0007141682,0.0030227522],"category_scores_gemma":[0.014563679,0.00034173342,0.00024549375,0.0008034127,0.0018090508,0.0021941722,0.0009763885,0.0008821208,0.00079025293],"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.00028898127,0.00004551478,0.0027585689,0.00048039475,0.000038564653,0.00041586286,0.00046674744,0.46937868,0.00955507,0.46777964,0.0032895436,0.045502346],"study_design_scores_gemma":[0.0000104347255,0.0000470616,0.0010328236,0.00007969379,0.000008053263,0.00041451468,0.00006338631,0.87334085,0.0027227944,0.120289944,0.0019434778,0.000047044006],"about_ca_topic_score_codex":0.0006118725,"about_ca_topic_score_gemma":0.00043986074,"teacher_disagreement_score":0.0030227522,"about_ca_system_score_codex":0.00096565555,"about_ca_system_score_gemma":0.0005910272,"threshold_uncertainty_score":0.010112166},"labels":[],"label_agreement":null},{"id":"W2120530281","doi":"10.1109/tcomm.2011.050911.100063","title":"On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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 Ottawa","funders":"","keywords":"Multiplexing; Outage probability; MIMO; Relay; Computer science; Electronic engineering; Telecommunications; Topology (electrical circuits); Channel (broadcasting); Fading; Engineering; Electrical engineering; Physics; Power (physics)","score_opus":0.14930326292531437,"score_gpt":0.2839082592346494,"score_spread":0.13460499630933503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120530281","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.2552628,0.009130202,0.69450617,0.0011989516,0.00015600656,0.00007110368,0.0003342335,0.0004590492,0.03888153],"genre_scores_gemma":[0.9865715,0.0029410254,0.008075161,0.00008025772,0.00014120691,0.000040680585,0.000064097825,0.00004398372,0.0020422102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979715,0.00081616535,0.00005406382,0.00016864866,0.0006236892,0.00036599298],"domain_scores_gemma":[0.983487,0.014043539,0.0009919829,0.000449336,0.00086611084,0.00016211446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027532685,0.0014460505,0.0013044663,0.001247943,0.0007158117,0.0017452709,0.000990606,0.001078528,0.002136447],"category_scores_gemma":[0.015046035,0.0006359884,0.0005918237,0.0017550915,0.0021846395,0.0022598892,0.0014656034,0.0012954028,0.00037114494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013373503,0.00004739535,0.0014272807,0.00020680975,0.000039296734,0.0006207862,0.00021000244,0.8647399,0.003928413,0.11422166,0.0010406529,0.013384075],"study_design_scores_gemma":[0.000007844025,0.00007485681,0.0005947932,0.000052207466,0.000018803223,0.0003393321,0.000072663184,0.9543531,0.001256837,0.042769004,0.00043330638,0.000027369357],"about_ca_topic_score_codex":0.0016963241,"about_ca_topic_score_gemma":0.0012055362,"teacher_disagreement_score":0.0027532685,"about_ca_system_score_codex":0.0023147804,"about_ca_system_score_gemma":0.0007510104,"threshold_uncertainty_score":0.01679498},"labels":[],"label_agreement":null},{"id":"W2120721517","doi":"10.1109/tcomm.2006.878827","title":"Differential turbo-coded modulation with APP channel estimation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":36,"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":"Phase-shift keying; Decoding methods; Algorithm; Turbo code; Computer science; Bit error rate; Channel (broadcasting); Concatenated error correction code; Differential coding; Keying; Channel state information; Convolutional code; Binary erasure channel; Electronic engineering; Telecommunications; Channel capacity; Block code; Engineering; Wireless","score_opus":0.013767703521590572,"score_gpt":0.23762409514665656,"score_spread":0.223856391625066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120721517","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.16069579,0.0005476059,0.8291271,0.00023582243,0.0001288699,0.00008631263,0.000119755525,0.0013172413,0.0077414433],"genre_scores_gemma":[0.83013046,0.00020152987,0.1658421,0.00007893431,0.00006301473,0.00005811227,0.000120450575,0.00002911276,0.0034761678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949133,0.00015331677,0.000026228407,0.00005334784,0.00022933891,0.000046414167],"domain_scores_gemma":[0.9990508,0.0003036387,0.000116536474,0.00021222922,0.0002749115,0.00004191726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039618617,0.00037218255,0.00035678488,0.00030992602,0.00030128055,0.00045476478,0.0004641577,0.00038154225,0.0005207282],"category_scores_gemma":[0.0019427717,0.0001905203,0.00019076787,0.00043398404,0.0004040204,0.00050287234,0.0005669251,0.0004215721,0.00037943214],"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.0010994159,0.00022993749,0.009097925,0.000292496,0.00016775054,0.0010951569,0.00030033235,0.30096674,0.24295664,0.057046216,0.0037344417,0.38301292],"study_design_scores_gemma":[0.00003579282,0.00026955697,0.00095755316,0.000020122998,0.000052957315,0.0009353451,0.00000903432,0.8967133,0.091732286,0.003654278,0.005574051,0.000045596014],"about_ca_topic_score_codex":0.0012757721,"about_ca_topic_score_gemma":0.0020241358,"teacher_disagreement_score":0.0012757721,"about_ca_system_score_codex":0.00036050516,"about_ca_system_score_gemma":0.0006743769,"threshold_uncertainty_score":0.0026156306},"labels":[],"label_agreement":null},{"id":"W2120896095","doi":"10.1109/tcomm.2006.877947","title":"Distributed space-time block coding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":257,"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":"Computer science; Node (physics); Relay; Code (set theory); Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Set (abstract data type); Physics; Programming language","score_opus":0.03229868936485061,"score_gpt":0.2693690723793093,"score_spread":0.23707038301445868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120896095","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.00541422,0.0009271109,0.9832825,0.0002834616,0.00031208532,0.00008335011,0.000251897,0.0004608914,0.008984466],"genre_scores_gemma":[0.5310022,0.0028319627,0.43785787,0.0007090677,0.00048115937,0.00048768058,0.0018806432,0.00011939632,0.024629904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.00029958406,0.00005520327,0.00019419214,0.000591104,0.00017710439],"domain_scores_gemma":[0.99871755,0.0003661733,0.00008958705,0.00035546557,0.0004177209,0.000053487165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943842,0.000586561,0.0007410753,0.00067302503,0.0005200204,0.0011625914,0.0010084895,0.0007053774,0.0032105257],"category_scores_gemma":[0.0022091991,0.0002121692,0.000335036,0.0013015715,0.0006721036,0.0011015702,0.0012653441,0.001170486,0.0017147657],"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.00046843503,0.000110474735,0.000676741,0.00023992656,0.000073022755,0.0002937498,0.00013752907,0.20180905,0.02299418,0.42236346,0.015645886,0.3351877],"study_design_scores_gemma":[0.000068361085,0.00012509672,0.00021414274,0.000037111142,0.000021637901,0.00026495708,0.000025078227,0.8887148,0.009479794,0.0714486,0.029569397,0.00003113369],"about_ca_topic_score_codex":0.0029917806,"about_ca_topic_score_gemma":0.0036992144,"teacher_disagreement_score":0.0032105257,"about_ca_system_score_codex":0.000990239,"about_ca_system_score_gemma":0.0017259464,"threshold_uncertainty_score":0.010740221},"labels":[],"label_agreement":null},{"id":"W2120940736","doi":"10.1109/tcomm.2011.051311.090588","title":"Adaptive L_p—Norm Spectrum Sensing for Cognitive Radio Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":71,"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":"Cognitive radio; Additive white Gaussian noise; Detector; Algorithm; False alarm; Gaussian noise; Rayleigh fading; Computer science; Norm (philosophy); Detection theory; Fading; Mathematics; Electronic engineering; Wireless; Telecommunications; Channel (broadcasting); Statistics; Engineering; Decoding methods","score_opus":0.06190989711200075,"score_gpt":0.26437578500067466,"score_spread":0.20246588788867392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120940736","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.008369141,0.00033510962,0.9901461,0.00012480548,0.000031049836,0.00001639995,0.000017927541,0.00008142738,0.0008780719],"genre_scores_gemma":[0.6893045,0.0009955356,0.30729005,0.0003113278,0.0001367594,0.00015649575,0.00010178314,0.00005377808,0.0016498243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859196,0.00058987614,0.000052683048,0.00024179395,0.00042329496,0.00010026052],"domain_scores_gemma":[0.9973763,0.0018964111,0.00020319712,0.00011558714,0.00034173558,0.00006683428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520077,0.00072676694,0.0006232012,0.00041554208,0.00028993463,0.0007038913,0.0011897518,0.0009950398,0.0005975395],"category_scores_gemma":[0.0074689,0.00032349417,0.00044188643,0.00048916513,0.0012868249,0.0012779885,0.0010141602,0.0011092157,0.00023458317],"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.0004852886,0.00012404463,0.0009623195,0.0003018506,0.00008675557,0.00023930806,0.00018118699,0.7270953,0.02214983,0.09102112,0.0023094676,0.15504362],"study_design_scores_gemma":[0.0000054230977,0.000044729553,0.00008300078,0.000006961662,0.0000035917167,0.000038782626,0.000005678124,0.9913244,0.0013902897,0.006809491,0.0002761584,0.000011419221],"about_ca_topic_score_codex":0.0012473352,"about_ca_topic_score_gemma":0.00093935203,"teacher_disagreement_score":0.0020520077,"about_ca_system_score_codex":0.00071944285,"about_ca_system_score_gemma":0.0009814285,"threshold_uncertainty_score":0.010852218},"labels":[],"label_agreement":null},{"id":"W2120968943","doi":"10.1109/tcomm.2013.042313.120770","title":"Throughput Upper-Bound of Slotted CSMA Systems with Unsaturated Finite Population","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":15,"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":"Upper and lower bounds; Throughput; Exponential backoff; Computer science; Population; Algorithm; Markov process; Markov chain; Protocol (science); Computer network; Mathematics; Statistics","score_opus":0.02820872018376837,"score_gpt":0.26199499860348535,"score_spread":0.23378627841971697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120968943","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.081203036,0.00067851687,0.91398567,0.000307908,0.00005221189,0.00003590877,0.00009023781,0.00031133008,0.0033351886],"genre_scores_gemma":[0.9821504,0.00046323703,0.0155925965,0.00007548123,0.000041232932,0.0000715671,0.000049092218,0.000045133107,0.0015113303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849725,0.00032201246,0.000050600305,0.00030299902,0.00048462767,0.0003425545],"domain_scores_gemma":[0.9950925,0.003304254,0.0005707845,0.0004145787,0.0004877069,0.00013012606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017634034,0.00072537543,0.0010924694,0.0007983598,0.00090277655,0.0020091687,0.0014876279,0.0008746123,0.0011654694],"category_scores_gemma":[0.007770743,0.00040951493,0.0005579006,0.00073274144,0.0020630637,0.0027675142,0.0011329531,0.0016345319,0.00020438839],"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.000128975,0.000044430057,0.0009310781,0.00009919951,0.00004263996,0.00017802793,0.00022661587,0.8856795,0.009102144,0.09517692,0.00056958233,0.007820839],"study_design_scores_gemma":[0.000004413663,0.000026365762,0.00016560286,0.000007455836,0.000009638388,0.00003500372,0.00002026227,0.9876895,0.0012722132,0.0105045475,0.00025525794,0.000009759306],"about_ca_topic_score_codex":0.004715544,"about_ca_topic_score_gemma":0.002001116,"teacher_disagreement_score":0.004715544,"about_ca_system_score_codex":0.0030594757,"about_ca_system_score_gemma":0.0021290781,"threshold_uncertainty_score":0.02219814},"labels":[],"label_agreement":null},{"id":"W2120987109","doi":"10.1109/tcomm.2010.03.070409","title":"Fixed relaying versus selective relaying in multi-hop diversity transmission systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Rayleigh fading; Hop (telecommunications); Relay; Computer science; Diversity gain; Bit error rate; Fading; Transmission (telecommunications); Diversity scheme; Cooperative diversity; Outage probability; Diversity combining; Electronic engineering; Telecommunications; Decoding methods; Engineering; Physics","score_opus":0.09965880473049743,"score_gpt":0.3175072360297983,"score_spread":0.21784843129930087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120987109","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.41027373,0.0047222218,0.5702689,0.00028978873,0.0000820125,0.00006184586,0.0000998106,0.00021178501,0.013989924],"genre_scores_gemma":[0.98810005,0.0009098558,0.01032851,0.000021856144,0.00003049871,0.000018047569,0.000019194322,0.000009998059,0.00056192523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928635,0.0002798273,0.000028564898,0.0000812968,0.000216965,0.0001069802],"domain_scores_gemma":[0.9966587,0.0024416414,0.00027904703,0.00024361604,0.00032514505,0.000051825034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893167,0.0006298369,0.00045604803,0.00048155698,0.0004746529,0.0009447432,0.0005779546,0.0006698527,0.00071142387],"category_scores_gemma":[0.0047542118,0.00023548784,0.000285887,0.00061629043,0.00092340005,0.0009987287,0.0006230533,0.00037472826,0.0002013552],"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.0003581536,0.000032864034,0.001769813,0.000264261,0.00007616692,0.00068209274,0.0002895425,0.8467292,0.017918795,0.07071725,0.0008521664,0.06030973],"study_design_scores_gemma":[0.000025025844,0.00033206967,0.00083447807,0.00003607215,0.00006918732,0.0004947059,0.00011067517,0.96263075,0.0073792986,0.026882734,0.0011680779,0.000036880832],"about_ca_topic_score_codex":0.0012303032,"about_ca_topic_score_gemma":0.0014809432,"teacher_disagreement_score":0.0012303032,"about_ca_system_score_codex":0.00081382366,"about_ca_system_score_gemma":0.00041953608,"threshold_uncertainty_score":0.005904734},"labels":[],"label_agreement":null},{"id":"W2121288242","doi":"10.1109/tcomm.2011.010411.090109","title":"Error Rate Analysis of M-ary Coherent Free-Space Optical Communication Systems with K-Distributed Turbulence","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":71,"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, Okanagan Campus; University of British Columbia","funders":"Medical Research Council","keywords":"Quadrature amplitude modulation; Phase-shift keying; Bit error rate; Free-space optical communication; Compensation (psychology); Modulation (music); Optical communication; Turbulence; Standard deviation; Electronic engineering; Phase (matter); Mathematics; Keying; Control theory (sociology); Physics; Optics; Computer science; Telecommunications; Algorithm; Statistics; Engineering; Acoustics","score_opus":0.0420204356942666,"score_gpt":0.24236343471276145,"score_spread":0.20034299901849484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121288242","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.4571716,0.002496377,0.5314702,0.000391968,0.00008039881,0.000057106627,0.00016323195,0.0006128117,0.007556379],"genre_scores_gemma":[0.9839399,0.00056285574,0.014134175,0.00003388169,0.000029031411,0.00002329558,0.00008623711,0.000053917294,0.0011365853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843365,0.00037539453,0.00007590489,0.00012597103,0.0007647116,0.0002242772],"domain_scores_gemma":[0.98760754,0.00907126,0.001132555,0.00064244034,0.0014612486,0.0000849434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021977006,0.0010051971,0.0007535614,0.00073738396,0.00061402,0.00074319984,0.00070230494,0.00088214054,0.0010747766],"category_scores_gemma":[0.012428408,0.00021198943,0.00042005535,0.00081839116,0.0008884066,0.0013590882,0.0008030575,0.0006345602,0.00025679555],"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.0005326461,0.00004393932,0.005175197,0.00024577882,0.00009646267,0.00038998108,0.0003158898,0.91055954,0.029324992,0.022125876,0.0003977338,0.030791944],"study_design_scores_gemma":[0.0000059432914,0.0000926941,0.0013985778,0.000018751198,0.000015337784,0.00022004258,0.000038241025,0.9876737,0.008449026,0.0018315874,0.00022939188,0.000026799182],"about_ca_topic_score_codex":0.0025486932,"about_ca_topic_score_gemma":0.0016832736,"teacher_disagreement_score":0.0025486932,"about_ca_system_score_codex":0.0009191734,"about_ca_system_score_gemma":0.0006917867,"threshold_uncertainty_score":0.011622667},"labels":[],"label_agreement":null},{"id":"W2121484689","doi":"10.1109/tcomm.2013.13.120317","title":"Grobner Bases for Lattices and an Algebraic Decoding Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gröbner basis; Decoding methods; Algebraic number; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Algebra over a field; Mathematics; Theoretical computer science; Block code; Computation; Concatenated error correction code; Pure mathematics","score_opus":0.04023690450236831,"score_gpt":0.2959592228082651,"score_spread":0.25572231830589676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121484689","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.013323596,0.0003750055,0.96914274,0.00055256614,0.00010115965,0.00007265841,0.00016075763,0.00043550425,0.01583611],"genre_scores_gemma":[0.1950358,0.0006412897,0.7940247,0.00036287992,0.00025359835,0.00023376905,0.00051828526,0.00021509193,0.008714502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981212,0.00057824526,0.00012288529,0.00025054833,0.0007423814,0.00018469448],"domain_scores_gemma":[0.9987091,0.00061340805,0.0001116129,0.00023907522,0.00027599256,0.000050940223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558922,0.00066499115,0.00064981094,0.0013578455,0.00071713154,0.0018791462,0.000829911,0.0008072793,0.0034844342],"category_scores_gemma":[0.0045625106,0.00032685712,0.00060979184,0.0014865722,0.0016315605,0.0029440108,0.0017021374,0.0023972667,0.0019122707],"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.000057865727,0.000048644433,0.00013411064,0.00006690664,0.000008358224,0.00004387523,0.00011785733,0.027276497,0.0033746213,0.89350945,0.0020437597,0.07331802],"study_design_scores_gemma":[0.00003922992,0.000059882244,0.00006331506,0.000048389484,0.00000717155,0.0001352023,0.000043578268,0.168087,0.007295199,0.8103591,0.0138256615,0.00003619766],"about_ca_topic_score_codex":0.0007672288,"about_ca_topic_score_gemma":0.00080920476,"teacher_disagreement_score":0.0034844342,"about_ca_system_score_codex":0.0011415575,"about_ca_system_score_gemma":0.0012628194,"threshold_uncertainty_score":0.011656582},"labels":[],"label_agreement":null},{"id":"W2121887926","doi":"10.1109/26.855514","title":"A quasi-optimum receiver for continuous phase modulation","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":31,"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":"Continuous phase modulation; Radio receiver design; SIGNAL (programming language); Modulation (music); Analog transmission; Electronic engineering; Computer science; Phase (matter); Phase modulation; Analog signal; Telecommunications; Engineering; Digital signal processing; Phase noise; Acoustics; Physics; Transmitter","score_opus":0.03604156395441832,"score_gpt":0.30486735670438386,"score_spread":0.26882579274996554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121887926","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.004174279,0.00061529974,0.99214244,0.00010344943,0.00014075656,0.000029180725,0.00002765066,0.00042455416,0.002342367],"genre_scores_gemma":[0.151784,0.0010657999,0.8360899,0.00032732022,0.0009199001,0.000110393215,0.00011777696,0.00010176516,0.009483142],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994568,0.000112797105,0.00002455996,0.00009891776,0.00025963443,0.00004729864],"domain_scores_gemma":[0.9996972,0.00009031148,0.000044087355,0.000053366108,0.00008711633,0.00002792119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005775603,0.00050601433,0.00072642905,0.0004928927,0.00034669324,0.0008380677,0.0007549234,0.0010897523,0.0030896186],"category_scores_gemma":[0.0007781572,0.000480755,0.00037010564,0.0004137174,0.00045381667,0.0011064226,0.0006193376,0.0011339723,0.0028869952],"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.00058745773,0.00014390891,0.00053472596,0.0004960449,0.000080972924,0.0003116286,0.00016437906,0.015304867,0.60070205,0.14908205,0.0068994407,0.22569245],"study_design_scores_gemma":[0.00029853123,0.002301531,0.0020567337,0.00014376079,0.00027587858,0.0043034726,0.000042931588,0.54559934,0.26797414,0.04060962,0.1361598,0.00023434575],"about_ca_topic_score_codex":0.000095512776,"about_ca_topic_score_gemma":0.00018691065,"teacher_disagreement_score":0.0030896186,"about_ca_system_score_codex":0.000256942,"about_ca_system_score_gemma":0.00036816628,"threshold_uncertainty_score":0.010335743},"labels":[],"label_agreement":null},{"id":"W2122210545","doi":"10.1109/tcomm.2009.11.080038","title":"Linear LLR approximation for iterative decoding on wireless channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":39,"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":"Fading; Rayleigh fading; Channel state information; Decoding methods; Mathematics; Noise power; Measure (data warehouse); Channel (broadcasting); Algorithm; Noise (video); Signal-to-noise ratio (imaging); Bit error rate; Wireless; Computer science; Statistics; Power (physics); Telecommunications; Physics","score_opus":0.042422888012264834,"score_gpt":0.3109782135341635,"score_spread":0.26855532552189865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122210545","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.005898796,0.00044634668,0.99177814,0.000084910585,0.000014311481,0.000015788637,0.000026573582,0.0003744341,0.0013606484],"genre_scores_gemma":[0.46035883,0.0021223247,0.53070045,0.0002715775,0.00014031677,0.00025832801,0.00032159314,0.00034315587,0.0054835104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970289,0.0012384763,0.00012752679,0.00024011817,0.0011370414,0.0002278911],"domain_scores_gemma":[0.9933828,0.005078434,0.0003707063,0.000569731,0.0005436303,0.000054731456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032994288,0.0012648574,0.0014307247,0.0010979077,0.00037710348,0.0016062588,0.001029391,0.0013843958,0.0012686182],"category_scores_gemma":[0.01680538,0.000548336,0.000683617,0.0015786648,0.0016129529,0.0021932516,0.0012146194,0.0015479228,0.0012017157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000834248,0.000020126017,0.00028471224,0.00009720235,0.000030618645,0.00009744756,0.0001095529,0.92426205,0.0026059714,0.03745286,0.00062743865,0.034328476],"study_design_scores_gemma":[0.0000030678384,0.000012528992,0.00003704621,0.000009458624,0.0000030846045,0.0000343473,0.000004753651,0.9895511,0.0008643179,0.009240357,0.00023312014,0.0000067419205],"about_ca_topic_score_codex":0.0025952219,"about_ca_topic_score_gemma":0.0015071457,"teacher_disagreement_score":0.0032994288,"about_ca_system_score_codex":0.0015877918,"about_ca_system_score_gemma":0.0011322551,"threshold_uncertainty_score":0.01744926},"labels":[],"label_agreement":null},{"id":"W2122539785","doi":"10.1109/tcomm.2012.090512.110198","title":"EDFA-Based All-Optical Relaying in Free-Space Optical Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":110,"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":"Computer science; Electronic engineering; Attenuation; Optical amplifier; Optical wireless; Optical performance monitoring; Free-space optical communication; Transmission (telecommunications); Optical communication; Optical communications repeater; Optical engineering; Fading; Wireless; Optical fiber; Wavelength-division multiplexing; Channel (broadcasting); Optical attenuator; Telecommunications; Engineering; Laser; Multi-mode optical fiber; Optics; Wavelength; Physics","score_opus":0.04264797399737679,"score_gpt":0.2703477278897781,"score_spread":0.22769975389240132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122539785","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.24816369,0.0076711304,0.73276716,0.0003585597,0.0001227903,0.00005345146,0.00012575315,0.0005196438,0.010217743],"genre_scores_gemma":[0.9738331,0.0019136018,0.02201383,0.00002774931,0.000034039986,0.000014574716,0.000020730935,0.000013753055,0.0021285969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00014673216,0.0000144813785,0.00005563586,0.0001505948,0.000048328973],"domain_scores_gemma":[0.99922574,0.00047117274,0.00010753772,0.00006689062,0.00011344369,0.000015280102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419943,0.0005788322,0.00051301013,0.00044689752,0.00043407342,0.00078984344,0.00084630965,0.000865498,0.00060610374],"category_scores_gemma":[0.0013697768,0.00038218932,0.00042904995,0.00040595556,0.00082673295,0.001207291,0.00041552327,0.00034871727,0.00020177147],"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.00014335777,0.00004629833,0.0009192777,0.00019943593,0.000040737676,0.0004064956,0.00016432194,0.89020187,0.022361081,0.06018078,0.00050143834,0.024835015],"study_design_scores_gemma":[0.0000091393795,0.00008341973,0.00020615435,0.000019946805,0.000018247069,0.00016358291,0.000019536,0.98582745,0.0060224095,0.006316386,0.0012905238,0.000023189776],"about_ca_topic_score_codex":0.0043241708,"about_ca_topic_score_gemma":0.005012241,"teacher_disagreement_score":0.0043241708,"about_ca_system_score_codex":0.0012275757,"about_ca_system_score_gemma":0.00047820355,"threshold_uncertainty_score":0.008906722},"labels":[],"label_agreement":null},{"id":"W2123054575","doi":"10.1109/tcomm.2007.906399","title":"Reduced-Complexity Time-Domain Equalization for Turbo-MIMO Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Communications Research Centre Canada","funders":"","keywords":"Intersymbol interference; Computer science; Quadrature amplitude modulation; MIMO; Algorithm; Turbo; Equalization (audio); Trellis (graph); QAM; Turbo code; Trellis modulation; Electronic engineering; Mathematics; Channel (broadcasting); Bit error rate; Fading; Telecommunications; Decoding methods; Engineering","score_opus":0.054266928894197666,"score_gpt":0.31308632458758306,"score_spread":0.2588193956933854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123054575","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.013330668,0.0004144424,0.9831328,0.00007877634,0.000070589675,0.000023339822,0.0000259109,0.00030969366,0.0026138443],"genre_scores_gemma":[0.49523726,0.0006943069,0.4977062,0.00011233182,0.000147052,0.0000804893,0.00013520515,0.000050085153,0.00583709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955195,0.00010819323,0.000027017448,0.00003968896,0.0002274955,0.000045617362],"domain_scores_gemma":[0.999438,0.00020652682,0.000057905276,0.00011040108,0.00016913535,0.00001796102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035936336,0.00045084025,0.00040265237,0.0002885734,0.00031301458,0.00049441773,0.0005282754,0.00053883775,0.0021239917],"category_scores_gemma":[0.0012310217,0.0001648619,0.0003226379,0.00037509715,0.00027799013,0.00060459325,0.00034542818,0.00067172037,0.0008767169],"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.00051803637,0.0001126448,0.00056422316,0.00028681417,0.000106453015,0.00026130848,0.00015515211,0.33568922,0.20669244,0.054697428,0.0036569226,0.39725938],"study_design_scores_gemma":[0.000028232265,0.0001507391,0.0002198078,0.000015171221,0.000023094333,0.0002272737,0.0000116268775,0.9490203,0.041586976,0.004144019,0.0045448197,0.0000279194],"about_ca_topic_score_codex":0.00074883393,"about_ca_topic_score_gemma":0.0017203409,"teacher_disagreement_score":0.0021239917,"about_ca_system_score_codex":0.00029729842,"about_ca_system_score_gemma":0.000482644,"threshold_uncertainty_score":0.00710541},"labels":[],"label_agreement":null},{"id":"W2123447220","doi":"10.1109/tcomm.2009.02.070158","title":"Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":199,"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":"Cognitive radio; Computer science; Regret; Channel (broadcasting); Interference (communication); Computer network; Agile software development; Wireless; Telecommunications; Machine learning","score_opus":0.042197090668896084,"score_gpt":0.32879332533251926,"score_spread":0.28659623466362316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123447220","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.04385574,0.00013988858,0.9496857,0.00039288343,0.000029429086,0.0001540516,0.000031308882,0.000051762483,0.0056592105],"genre_scores_gemma":[0.9395429,0.0001749698,0.057135988,0.00009503929,0.000032813896,0.00037252688,0.00001958428,0.000015094209,0.0026111056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983986,0.00076393684,0.00003791405,0.00026988372,0.0003163362,0.00021324468],"domain_scores_gemma":[0.99806005,0.0011909081,0.00025910893,0.00010145991,0.00020954305,0.0001789717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024102253,0.0010488344,0.001321001,0.00042062913,0.00059740053,0.0017021114,0.0022095933,0.0015054346,0.001212239],"category_scores_gemma":[0.004430399,0.00064765255,0.0006413418,0.00050562376,0.0023218312,0.0014412015,0.0016427696,0.0011598129,0.0001867822],"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.00010146899,0.000089187095,0.00033294302,0.000059658105,0.000045843783,0.00018281984,0.0001451663,0.9280832,0.0019531383,0.062919445,0.00032343334,0.005763654],"study_design_scores_gemma":[0.000022999995,0.000039895778,0.000035946065,0.0000027380026,0.000006227414,0.000011193611,0.00001232224,0.9902442,0.00010868465,0.0093441205,0.00016718666,0.000004598372],"about_ca_topic_score_codex":0.0034724707,"about_ca_topic_score_gemma":0.0030206393,"teacher_disagreement_score":0.0034724707,"about_ca_system_score_codex":0.0015821793,"about_ca_system_score_gemma":0.0020608508,"threshold_uncertainty_score":0.012746632},"labels":[],"label_agreement":null},{"id":"W2123576001","doi":"10.1109/tcomm.2014.2329834","title":"Diversity–Multiplexing Tradeoff of Asynchronous Decode-and-Forward Cooperative Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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 Waterloo; IGNIS Innovation (Canada)","funders":"","keywords":"Asynchronous communication; Multiplexing; Computer science; Transmitter; Orthogonal frequency-division multiplexing; Bandwidth (computing); Electronic engineering; Computer network; Waveform; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.04129521618978292,"score_gpt":0.2712260852320172,"score_spread":0.22993086904223425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123576001","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.7005985,0.0010629977,0.2799636,0.0004984228,0.00004451898,0.000070691785,0.00012805256,0.00009652089,0.017536784],"genre_scores_gemma":[0.99401516,0.00020829895,0.00515838,0.000029248606,0.000020864476,0.000025069006,0.000015998448,0.0000049428713,0.00052208203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885046,0.00047887326,0.00003706487,0.00011662606,0.00030782045,0.00020925053],"domain_scores_gemma":[0.9941373,0.0044198204,0.00049008237,0.00023694611,0.0005342255,0.00018171324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002502269,0.0008864673,0.0005512289,0.0006937962,0.00087357283,0.0012204581,0.00073478324,0.0010218677,0.0010200522],"category_scores_gemma":[0.0079636,0.0003103157,0.00025622084,0.0007392714,0.0011296716,0.0015768561,0.0010229372,0.00046765423,0.00016195251],"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.0006837104,0.00009302558,0.0022465396,0.0001478219,0.00007386483,0.00060339324,0.00040403538,0.829168,0.04217357,0.096222594,0.00057599944,0.027607435],"study_design_scores_gemma":[0.00002459269,0.00024706338,0.00048895605,0.000016924778,0.000034595923,0.00032894395,0.00009171673,0.9725672,0.0065483423,0.01926672,0.00035892872,0.000025950347],"about_ca_topic_score_codex":0.0008789528,"about_ca_topic_score_gemma":0.0008707096,"teacher_disagreement_score":0.002502269,"about_ca_system_score_codex":0.0012679832,"about_ca_system_score_gemma":0.00047517847,"threshold_uncertainty_score":0.013233364},"labels":[],"label_agreement":null},{"id":"W2123616804","doi":"10.1109/tcomm.2009.06.070480","title":"Dynamic spot diffusing configuration for indoor optical wireless access","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","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":"McMaster University","funders":"McMaster University","keywords":"Transmitter; Erasure; Computer science; Multipath propagation; Wireless; Electronic engineering; Channel (broadcasting); Optical power; Real-time computing; Telecommunications; Optics; Engineering; Physics","score_opus":0.03387930918076527,"score_gpt":0.30473217197946106,"score_spread":0.2708528627986958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123616804","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.39643443,0.00065248116,0.5894885,0.0001961103,0.00007890732,0.00007769605,0.00008902775,0.00120811,0.011774689],"genre_scores_gemma":[0.9481935,0.00015300064,0.050140582,0.000027911627,0.0000140173115,0.0000330352,0.000038678387,0.000024062312,0.0013752027],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998017,0.000060200968,0.0000073540164,0.000032865446,0.00006882651,0.000029146871],"domain_scores_gemma":[0.9996879,0.00009702315,0.00004424114,0.00008499205,0.000056024157,0.000029881658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515712,0.00038930646,0.00021082775,0.00028462076,0.00036885205,0.00036697646,0.00063617545,0.00028624348,0.0015043912],"category_scores_gemma":[0.00036923695,0.00016996817,0.00015179996,0.00034445152,0.00044445446,0.000667657,0.00042032835,0.00031900126,0.00031624085],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009574544,0.000198185,0.005450442,0.00027597017,0.00007076647,0.000634769,0.0003136058,0.20622218,0.5169468,0.047009904,0.0022923145,0.21962763],"study_design_scores_gemma":[0.00011948643,0.001418908,0.0030900475,0.00003159111,0.000059567334,0.0019481736,0.00017293153,0.6180842,0.3485707,0.010510942,0.015856914,0.00013638168],"about_ca_topic_score_codex":0.00043601985,"about_ca_topic_score_gemma":0.000780598,"teacher_disagreement_score":0.0015043912,"about_ca_system_score_codex":0.00045478388,"about_ca_system_score_gemma":0.00022047726,"threshold_uncertainty_score":0.005032718},"labels":[],"label_agreement":null},{"id":"W2123920269","doi":"10.1109/tcomm.2008.050628","title":"Performance of a CDMA system employing AMC and multicodes in the presence of channel estimation errors","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hidden Markov model; Channel (broadcasting); Computer science; Code division multiple access; Markov chain; Filter (signal processing); Algorithm; Markov model; Adaptive filter; Electronic engineering; Control theory (sociology); Speech recognition; Engineering; Telecommunications; Artificial intelligence","score_opus":0.07470288131571103,"score_gpt":0.3041034271432002,"score_spread":0.2294005458274892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123920269","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.9726055,0.00032120274,0.02509726,0.00013221214,0.000034652894,0.000015321928,0.00003394261,0.00022111865,0.0015386343],"genre_scores_gemma":[0.99571335,0.00009536965,0.003671838,0.000026006852,0.000015213751,0.00000699067,0.000024996214,0.000012522977,0.00043373846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840707,0.0005709021,0.000074606476,0.000191183,0.00039138988,0.00036492388],"domain_scores_gemma":[0.98547703,0.011118815,0.0007914275,0.0005767234,0.0017475475,0.00028835787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022999889,0.00086182856,0.0010142032,0.00067856803,0.0011019218,0.00088567287,0.00044882807,0.001683022,0.00085442665],"category_scores_gemma":[0.009663205,0.0003719449,0.00038318126,0.00069178076,0.0010730543,0.0009976941,0.0009242896,0.0006657169,0.00025730286],"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.007988886,0.0003917187,0.023039253,0.0003262547,0.00043105005,0.0009567067,0.0009080708,0.7573514,0.13285358,0.003452935,0.0004938831,0.07180637],"study_design_scores_gemma":[0.0001239977,0.002191504,0.010007367,0.000037112208,0.00024489762,0.00057345856,0.00019007042,0.9378505,0.047256615,0.0010986137,0.00034943502,0.00007647448],"about_ca_topic_score_codex":0.008831939,"about_ca_topic_score_gemma":0.00404708,"teacher_disagreement_score":0.008831939,"about_ca_system_score_codex":0.00080721703,"about_ca_system_score_gemma":0.00091286947,"threshold_uncertainty_score":0.017561078},"labels":[],"label_agreement":null},{"id":"W2124026871","doi":"10.1109/tcomm.2008.050087","title":"Ldpc codes for non-coherent block fading channels with correlation: analysis and design","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"York University","funders":"","keywords":"Fading; Low-density parity-check code; Algorithm; Decoding methods; Block (permutation group theory); Computer science; Smoothing; Block code; Kalman filter; Electronic engineering; Mathematics; Engineering","score_opus":0.06159042362997631,"score_gpt":0.2916499387937162,"score_spread":0.2300595151637399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124026871","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.014321315,0.0008964473,0.9816036,0.00018716024,0.000028650074,0.00005303399,0.000083133236,0.0002369149,0.0025897974],"genre_scores_gemma":[0.5984228,0.0037105654,0.3902468,0.00018040324,0.00011482425,0.00044244152,0.00041799934,0.00017693618,0.006287214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00024951258,0.00003383662,0.00007378863,0.00038508925,0.00006865091],"domain_scores_gemma":[0.99708027,0.0015243836,0.00043765464,0.00026426255,0.00064937293,0.000044046526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083609036,0.000829392,0.00049032824,0.00080227625,0.00045800826,0.0009846822,0.00063242315,0.000791839,0.0015749572],"category_scores_gemma":[0.0044249045,0.00037173595,0.00032534494,0.0013130922,0.00072793284,0.0008044231,0.00059033977,0.0008159695,0.000656289],"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.00008597163,0.00004537651,0.0009652808,0.00020779448,0.00005063129,0.00014445484,0.00013067244,0.7954036,0.010085223,0.099361405,0.0013901734,0.0921293],"study_design_scores_gemma":[0.00001150233,0.000037262893,0.0001945312,0.00003594919,0.00001305532,0.000095970245,0.000009950242,0.97708863,0.004360446,0.01662001,0.0015160028,0.000016729824],"about_ca_topic_score_codex":0.0028330577,"about_ca_topic_score_gemma":0.004395649,"teacher_disagreement_score":0.0028330577,"about_ca_system_score_codex":0.0013091804,"about_ca_system_score_gemma":0.0021948144,"threshold_uncertainty_score":0.009498835},"labels":[],"label_agreement":null},{"id":"W2124252154","doi":"10.1109/tcomm.2003.814206","title":"Iterative semi-blind multiuser detection for coded mc-cdma uplink system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Telecommunications link; Code division multiple access; Multiuser detection; Single antenna interference cancellation; Interference (communication); Computer science; Iterative method; Decoding methods; Algorithm; Iterative and incremental development; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.06708335593216987,"score_gpt":0.32691003492508536,"score_spread":0.2598266789929155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124252154","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.015626002,0.00014790309,0.9831597,0.00005175198,0.000012796863,0.000026750124,0.00000933473,0.0003039626,0.0006617869],"genre_scores_gemma":[0.45526928,0.00022433333,0.5420151,0.000116467636,0.00004483805,0.00009127685,0.000044367047,0.00002798707,0.002166332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.0002622139,0.000038284987,0.000079145386,0.00048183603,0.00008083426],"domain_scores_gemma":[0.99847335,0.0005468967,0.000192764,0.00021585167,0.00051807537,0.000053116273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837087,0.0005763076,0.00053761574,0.00036707037,0.00032119424,0.00063433644,0.0010338874,0.00080696243,0.0006277945],"category_scores_gemma":[0.0029924803,0.00027135375,0.00036768403,0.0002700589,0.0006355564,0.0006945745,0.000723968,0.00064617774,0.0003871348],"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.0005361323,0.00018543315,0.0020194366,0.0002892002,0.00012039537,0.00030885916,0.0005167339,0.49609423,0.09544064,0.028836448,0.002054194,0.3735983],"study_design_scores_gemma":[0.000019743016,0.0000999864,0.00011949004,0.0000063178168,0.000013847537,0.000115357034,0.000008749889,0.981077,0.016028857,0.0017200651,0.0007719255,0.000018614255],"about_ca_topic_score_codex":0.0011307682,"about_ca_topic_score_gemma":0.0011243883,"teacher_disagreement_score":0.0011307682,"about_ca_system_score_codex":0.00037675945,"about_ca_system_score_gemma":0.00080318877,"threshold_uncertainty_score":0.0046736},"labels":[],"label_agreement":null},{"id":"W2124369868","doi":"10.1109/tcomm.2004.836510","title":"Envelope-Aided Viterbi Receivers for GMSK Signals With Limiter-Discriminator Detection","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","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":"University of Toronto","funders":"","keywords":"Minimum-shift keying; Discriminator; Envelope detector; Electronic engineering; Viterbi algorithm; Envelope (radar); Continuous phase modulation; Detector; Computer science; Frequency modulation; Fading; Demodulation; Algorithm; Phase-shift keying; Speech recognition; Engineering; Telecommunications; Bit error rate; Radio frequency; Channel (broadcasting); Amplifier; Radar; Decoding methods","score_opus":0.02949351342467163,"score_gpt":0.2630555231966033,"score_spread":0.23356200977193167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124369868","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.04804752,0.0006975823,0.94910526,0.0001086261,0.000026716132,0.000029826264,0.000017628654,0.00017806789,0.0017887518],"genre_scores_gemma":[0.6973945,0.00063280883,0.29886314,0.00009747856,0.00006616766,0.00006195228,0.00005371308,0.000044648048,0.0027855805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.0003174719,0.00003736966,0.00007468784,0.00033804894,0.0000681669],"domain_scores_gemma":[0.9977799,0.0014928456,0.00023520848,0.00020861342,0.00025659497,0.000026970733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016484226,0.00059565343,0.0006131641,0.0005891389,0.00029020486,0.000792572,0.00081907696,0.0010280497,0.0007235842],"category_scores_gemma":[0.006975762,0.00038993845,0.000352612,0.0005875514,0.00060570467,0.0013417803,0.0007799437,0.0008442131,0.00044701473],"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.0007316381,0.00012684026,0.0035233558,0.0003402115,0.00018984351,0.00019949161,0.00045442698,0.5594025,0.13538702,0.11052354,0.00061243156,0.18850878],"study_design_scores_gemma":[0.000029934576,0.0001569655,0.00043715382,0.000029017954,0.000026648926,0.00025081701,0.000012981322,0.9559554,0.03248053,0.009306474,0.0012895565,0.00002440185],"about_ca_topic_score_codex":0.00054884475,"about_ca_topic_score_gemma":0.0007798999,"teacher_disagreement_score":0.0016484226,"about_ca_system_score_codex":0.0007731539,"about_ca_system_score_gemma":0.00058806594,"threshold_uncertainty_score":0.008717835},"labels":[],"label_agreement":null},{"id":"W2124586345","doi":"10.1109/tcomm.2006.888522","title":"Error Rate of Quadrature Subbranch Hybrid Selection/ Maximal-Ratio Combining in Rayleigh Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Maximal-ratio combining; Quadrature (astronomy); Rayleigh fading; Quadrature amplitude modulation; Diversity combining; Mathematics; Phase-shift keying; Keying; Pulse-amplitude modulation; Binary number; Amplitude and phase-shift keying; Algorithm; Fading; Electronic engineering; Bit error rate; Statistics; Telecommunications; Computer science; Pulse (music); Engineering; Detector; Arithmetic; Decoding methods","score_opus":0.024488407449556538,"score_gpt":0.28500574859999556,"score_spread":0.260517341150439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124586345","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.7837251,0.0021081222,0.20481052,0.00041511943,0.000057837868,0.000038288334,0.00012656939,0.00034910752,0.008369285],"genre_scores_gemma":[0.9943627,0.00021473007,0.0048480593,0.000038730912,0.00001634234,0.000007704445,0.000034853514,0.00001187137,0.00046497287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998055,0.0009501447,0.000058052687,0.00011473175,0.0005484723,0.00027363302],"domain_scores_gemma":[0.9880348,0.009456626,0.0008345479,0.00057730754,0.0009782625,0.00011844254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037794223,0.0007640466,0.0008011544,0.0004566375,0.00033764302,0.0006053656,0.00047951264,0.0007949425,0.00087916927],"category_scores_gemma":[0.008604786,0.00018908299,0.0002406518,0.0004200968,0.00086868677,0.00074973505,0.00084019615,0.00034410294,0.00024334303],"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.003506588,0.000096223885,0.014705017,0.0002443071,0.00027920498,0.0007999902,0.0001872162,0.8430936,0.05611139,0.013677085,0.0009529618,0.066346504],"study_design_scores_gemma":[0.00008262558,0.0006594198,0.0035011407,0.000019055113,0.0001059141,0.0005070361,0.00004832606,0.9664002,0.025184816,0.0030855306,0.00036422096,0.00004175059],"about_ca_topic_score_codex":0.0010223084,"about_ca_topic_score_gemma":0.0006859942,"teacher_disagreement_score":0.0037794223,"about_ca_system_score_codex":0.00051070726,"about_ca_system_score_gemma":0.000473005,"threshold_uncertainty_score":0.019987762},"labels":[],"label_agreement":null},{"id":"W2124793012","doi":"10.1109/tcomm.2008.060652","title":"On the peak-to-mean envelope power ratio of phase-shifted binary codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BCH code; Phase-shift keying; Mathematics; Convolutional code; Upper and lower bounds; Binary code; Algorithm; Binary number; Block code; Code (set theory); Decoding methods; Discrete mathematics; Computer science; Arithmetic; Bit error rate; Mathematical analysis","score_opus":0.048479907221555665,"score_gpt":0.28304441038330197,"score_spread":0.23456450316174632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124793012","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.07291335,0.0094159935,0.8777417,0.0010269695,0.0002581657,0.00006734956,0.00032805547,0.00040365366,0.037844844],"genre_scores_gemma":[0.89123154,0.0115031395,0.08927128,0.0005290248,0.00082859804,0.0003160856,0.00038652564,0.00023113475,0.0057026595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623257,0.0014997245,0.00013365675,0.0005363332,0.0011674917,0.0004301801],"domain_scores_gemma":[0.9838553,0.013037923,0.00093084923,0.0007642461,0.0012071718,0.00020444262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003052588,0.0021403225,0.0013288775,0.0014368184,0.00061954925,0.001744854,0.0011384777,0.001228325,0.0026870703],"category_scores_gemma":[0.02609019,0.0006444913,0.00071641227,0.0020066136,0.0027609917,0.002898787,0.0018150875,0.0019409289,0.0014017439],"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.000999309,0.00015040934,0.0013253889,0.00078152027,0.00013146151,0.0005680862,0.0005783749,0.49064267,0.03720147,0.3682171,0.004635101,0.09476908],"study_design_scores_gemma":[0.00003626645,0.00038638493,0.00089736155,0.00020468934,0.00006511633,0.000589915,0.00014614586,0.80634874,0.015160855,0.1712449,0.0048063416,0.00011328636],"about_ca_topic_score_codex":0.00081792654,"about_ca_topic_score_gemma":0.00035590926,"teacher_disagreement_score":0.003052588,"about_ca_system_score_codex":0.0013405605,"about_ca_system_score_gemma":0.0007614321,"threshold_uncertainty_score":0.016143858},"labels":[],"label_agreement":null},{"id":"W2125332127","doi":"10.1109/tcomm.2004.838730","title":"Graph-Based Message-Passing Schedules for Decoding LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":62,"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":"Low-density parity-check code; Tanner graph; Decoding methods; Factor graph; Belief propagation; Additive white Gaussian noise; Algorithm; Message passing; Mathematics; Probabilistic logic; Computer science; Bipartite graph; Graph; Channel (broadcasting); Discrete mathematics; Parallel computing; Statistics","score_opus":0.05850431123779526,"score_gpt":0.3256316168387922,"score_spread":0.26712730560099696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125332127","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.030749457,0.00017926739,0.96696275,0.000077585886,0.000026366071,0.000098592136,0.000070077294,0.00034474707,0.0014911799],"genre_scores_gemma":[0.6121942,0.0005998246,0.38423043,0.00007534195,0.00006287508,0.0004111784,0.0002885618,0.0001506492,0.0019868796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00033380688,0.00004561387,0.000080540645,0.00022554,0.00006589535],"domain_scores_gemma":[0.9963194,0.00235757,0.00043358895,0.00037661617,0.00041681546,0.00009600515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014121829,0.00079330715,0.0005193739,0.00090209284,0.00047297703,0.00064442004,0.00086987455,0.0005100666,0.00091768935],"category_scores_gemma":[0.0076085515,0.0003072582,0.00047200397,0.0010072658,0.0008591671,0.00079478533,0.0004773365,0.0006635313,0.00033890625],"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.0001552717,0.000036580906,0.0004947459,0.000099443096,0.000024908473,0.00006119521,0.00014834807,0.86389846,0.004462978,0.08746345,0.0007819154,0.042372707],"study_design_scores_gemma":[0.00003369607,0.000111591,0.000089141526,0.000013719089,0.000013067694,0.000029540515,0.00001482349,0.96020025,0.0034023905,0.034831204,0.0012486895,0.000011947028],"about_ca_topic_score_codex":0.0023234896,"about_ca_topic_score_gemma":0.002601002,"teacher_disagreement_score":0.0023234896,"about_ca_system_score_codex":0.0011980793,"about_ca_system_score_gemma":0.0012684852,"threshold_uncertainty_score":0.008692741},"labels":[],"label_agreement":null},{"id":"W2125378220","doi":"10.1109/tcomm.2008.050310","title":"M-ary orthogonal coded/balanced ultra-wideband transmitted-reference systems in multipath","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multipath propagation; Ultra-wideband; Interference (communication); Electronic engineering; Multipath interference; Wideband; Communications system; Single antenna interference cancellation; Algorithm; Decoding methods; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.033606144129861376,"score_gpt":0.24435633721090896,"score_spread":0.2107501930810476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125378220","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.08832267,0.0006407977,0.90316534,0.0002615038,0.00010071769,0.000077323675,0.00008873094,0.0005590102,0.0067838663],"genre_scores_gemma":[0.67282754,0.0005102004,0.32129046,0.0001768559,0.000082534156,0.00008113928,0.000114047136,0.000030092999,0.0048870756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993437,0.00015174245,0.00003747417,0.000079668454,0.0002901796,0.00009711859],"domain_scores_gemma":[0.9994319,0.00013495075,0.00011760616,0.00010015833,0.00018830136,0.000027095477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030736,0.00068876654,0.00042859785,0.00036767562,0.00034118444,0.0009870313,0.0008545072,0.00073612895,0.0011891219],"category_scores_gemma":[0.0012032476,0.00024927148,0.0002468946,0.0006100246,0.00043819554,0.0009366433,0.0009633174,0.00058022724,0.0005628958],"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.0011771935,0.00016039133,0.0014564666,0.00040721887,0.00009217151,0.0008382373,0.0005014799,0.15562336,0.38728893,0.18414985,0.002769508,0.2655352],"study_design_scores_gemma":[0.00011539302,0.00070686394,0.000504661,0.000074605865,0.00008319195,0.0009879878,0.00007848464,0.83911407,0.13506839,0.011759793,0.011415786,0.000090772075],"about_ca_topic_score_codex":0.0011462573,"about_ca_topic_score_gemma":0.0018547827,"teacher_disagreement_score":0.0011891219,"about_ca_system_score_codex":0.000520718,"about_ca_system_score_gemma":0.00078419875,"threshold_uncertainty_score":0.0039779544},"labels":[],"label_agreement":null},{"id":"W2126107131","doi":"10.1109/26.871383","title":"Autocovariance preserving estimator (APE) interpretation of the MLSD metric for Rayleigh fading channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Toronto","funders":"","keywords":"Autocovariance; Estimator; Mathematics; Rayleigh fading; Algorithm; Fading; Statistics; Metric (unit); Mathematical analysis; Decoding methods; Engineering","score_opus":0.024934081755209468,"score_gpt":0.2856395354433955,"score_spread":0.26070545368818604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126107131","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.0012214434,0.00044236777,0.9965753,0.00014047342,0.00007705945,0.0000084577705,0.000048452053,0.00009804165,0.0013884626],"genre_scores_gemma":[0.16717179,0.0018693657,0.8247267,0.00040421815,0.0005989771,0.00011785575,0.0003258474,0.00023249626,0.004552751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972561,0.0010578528,0.00021352946,0.00047145842,0.0009363163,0.000064767664],"domain_scores_gemma":[0.9961671,0.0015826026,0.00038656464,0.0006843419,0.0011089854,0.00007033699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022688566,0.00089671375,0.0007578394,0.0015093008,0.00029885065,0.0019392734,0.00096757535,0.0011256562,0.0013996203],"category_scores_gemma":[0.010240557,0.00028748243,0.0004949857,0.0011859614,0.0016225259,0.0030269383,0.0014338789,0.0015502453,0.0009703064],"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.00013196285,0.00003524166,0.0013263122,0.00035353974,0.00010114778,0.0003280565,0.00017958468,0.07560019,0.019131185,0.59504724,0.0044670925,0.3032984],"study_design_scores_gemma":[0.000032766122,0.00027030482,0.0017494551,0.0000937472,0.00005730427,0.0024732815,0.000105691084,0.63745517,0.031328253,0.25174466,0.07455694,0.00013246319],"about_ca_topic_score_codex":0.0004658734,"about_ca_topic_score_gemma":0.00046988018,"teacher_disagreement_score":0.0022688566,"about_ca_system_score_codex":0.0004944559,"about_ca_system_score_gemma":0.0007421457,"threshold_uncertainty_score":0.011998951},"labels":[],"label_agreement":null},{"id":"W2126110344","doi":"10.1109/tcomm.2005.861648","title":"Effects of channel-estimation errors on receiver selection-combining schemes for Alamouti MIMO systems with BPSK","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":33,"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":"Phase-shift keying; Rayleigh fading; Selection (genetic algorithm); Maximal-ratio combining; Bit error rate; Algorithm; Channel (broadcasting); Diversity combining; Signal-to-noise ratio (imaging); Fading; Mathematics; Diversity gain; MIMO; Statistics; Computer science; Telecommunications; Electronic engineering; Engineering","score_opus":0.012070343490993505,"score_gpt":0.24551581785002966,"score_spread":0.23344547435903615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126110344","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.59546566,0.0025132706,0.39534712,0.00074798235,0.00012389601,0.00010556544,0.00017615537,0.00094512943,0.004575258],"genre_scores_gemma":[0.96578616,0.0005570471,0.03277615,0.00007792093,0.00004906497,0.000035259043,0.000058533093,0.00008054666,0.000579373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99354255,0.0027342604,0.00038478067,0.00038984822,0.0022835438,0.0006650405],"domain_scores_gemma":[0.93507296,0.05453017,0.0045960825,0.0025230418,0.0030588317,0.0002188897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072814184,0.0017765946,0.001038035,0.00081910664,0.0010128851,0.0011456476,0.0007118084,0.0013483693,0.0010379466],"category_scores_gemma":[0.040986713,0.0006273602,0.0004561615,0.0012859722,0.0014627702,0.0022222488,0.0013239748,0.0012029982,0.0002760768],"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.0036996747,0.00026007308,0.013906433,0.0004081987,0.00034302517,0.00062757614,0.00072981365,0.8352057,0.038629495,0.008525309,0.0005498559,0.097114794],"study_design_scores_gemma":[0.00010723725,0.00096031424,0.0061739944,0.000092506634,0.0002743321,0.0007438425,0.0001608373,0.8913458,0.095854975,0.0034391123,0.00071726384,0.00012974434],"about_ca_topic_score_codex":0.001520654,"about_ca_topic_score_gemma":0.00204027,"teacher_disagreement_score":0.0072814184,"about_ca_system_score_codex":0.0013761556,"about_ca_system_score_gemma":0.00066383113,"threshold_uncertainty_score":0.038508296},"labels":[],"label_agreement":null},{"id":"W2126195483","doi":"10.1109/tcomm.2003.813183","title":"On the SNR penalty of MPSK with hybrid selection/maximal ratio combining over i.i.d. rayleigh fading channels","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":78,"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":"Maximal-ratio combining; Upper and lower bounds; Signal-to-noise ratio (imaging); Mathematics; Rayleigh fading; Modulation (music); Diversity combining; Phase-shift keying; Selection (genetic algorithm); Fading; Algorithm; Telecommunications; Statistics; Control theory (sociology); Computer science; Bit error rate; Physics; Mathematical analysis; Acoustics; Decoding methods","score_opus":0.02369243854555452,"score_gpt":0.2532405879033361,"score_spread":0.22954814935778156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126195483","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.2370116,0.0028074346,0.7338079,0.00093616184,0.00018905678,0.00005131248,0.00019483182,0.00051291025,0.024488874],"genre_scores_gemma":[0.9620086,0.00107087,0.03348263,0.00017900873,0.00015707,0.000055165998,0.00011175745,0.00011866254,0.002816149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981579,0.00058009004,0.000056843593,0.00012803868,0.0007834477,0.0002936447],"domain_scores_gemma":[0.9847238,0.012777558,0.0010671768,0.00054197264,0.00075235544,0.00013716315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031030818,0.0015057642,0.0007218596,0.0006541468,0.00041152549,0.0011184525,0.00072270207,0.00070481864,0.0019794558],"category_scores_gemma":[0.015516208,0.0003090597,0.00030278743,0.00092097366,0.0014138718,0.0018492461,0.0013046564,0.0010459004,0.00063243427],"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.0015222406,0.00008196181,0.002556498,0.0002611546,0.000072329865,0.00047209417,0.00014945192,0.861278,0.021513464,0.05280335,0.0014967207,0.057792712],"study_design_scores_gemma":[0.000028579283,0.00032426987,0.0013738427,0.000051577754,0.000050613544,0.0005063365,0.00005304557,0.96595675,0.012201896,0.018065618,0.001348966,0.00003848955],"about_ca_topic_score_codex":0.00063974725,"about_ca_topic_score_gemma":0.0006065692,"teacher_disagreement_score":0.0031030818,"about_ca_system_score_codex":0.0011103906,"about_ca_system_score_gemma":0.0005269618,"threshold_uncertainty_score":0.016410828},"labels":[],"label_agreement":null},{"id":"W2126252670","doi":"10.1110/tcomm.2010.062510.080615","title":"SER Analysis and PDF Derivation for Multi-Hop Amplify-and-Forward Relay Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"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":"Moment-generating function; Relay; Hop (telecommunications); Random variable; Cumulative distribution function; Probability density function; Erlang (programming language); Expression (computer science); Mathematics; Topology (electrical circuits); Probability of error; Bit error rate; Computer science; Algorithm; Telecommunications; Statistics; Combinatorics; Physics; Decoding methods; Theoretical computer science; Quantum mechanics","score_opus":0.06593631995843402,"score_gpt":0.3211921444500576,"score_spread":0.2552558244916236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126252670","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.01086043,0.002590339,0.976904,0.00016200189,0.00007999547,0.000039564773,0.00013834111,0.00032672271,0.008898714],"genre_scores_gemma":[0.84184927,0.010272541,0.13670045,0.00025903588,0.0003768576,0.00020136005,0.00039585857,0.00023700207,0.009707707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990368,0.00027435608,0.000049174985,0.00009462296,0.00043599683,0.00010906191],"domain_scores_gemma":[0.9948435,0.0032001429,0.00039716577,0.00042248314,0.0010804418,0.000056332177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022293366,0.0011911375,0.0012848104,0.0014503297,0.00045413492,0.0017446862,0.00077301904,0.000958853,0.0030869057],"category_scores_gemma":[0.009532327,0.0005765884,0.0007922344,0.0013328297,0.00089851615,0.0017787893,0.0007070037,0.0012499737,0.0011436042],"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.00004669564,0.000019246547,0.00042595988,0.00019794943,0.000035578014,0.00038452883,0.00014139901,0.8692173,0.0031740607,0.10415023,0.0016691594,0.02053798],"study_design_scores_gemma":[0.0000035952041,0.00002435614,0.00020768214,0.00003420002,0.000011863184,0.00019619286,0.000025462945,0.97956926,0.0008525473,0.017901484,0.0011566491,0.00001669977],"about_ca_topic_score_codex":0.0023603905,"about_ca_topic_score_gemma":0.0010794064,"teacher_disagreement_score":0.0030869057,"about_ca_system_score_codex":0.0015191047,"about_ca_system_score_gemma":0.00090473203,"threshold_uncertainty_score":0.011789978},"labels":[],"label_agreement":null},{"id":"W2126372870","doi":"10.1109/tcomm.2011.022811.090576","title":"On Adaptive Lattice Reduction over Correlated Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":17,"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":"Lattice reduction; Fading; Rayleigh fading; Lattice (music); Reduction (mathematics); MIMO; Algorithm; Computer science; Mathematics; Electronic engineering; Computational complexity theory; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Decoding methods; Physics; Engineering; Combinatorics; Acoustics","score_opus":0.058594518977533726,"score_gpt":0.27226044215273904,"score_spread":0.2136659231752053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126372870","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.041528475,0.00041172787,0.9526446,0.00021124801,0.00006861156,0.000035210116,0.00007129209,0.00029377814,0.004735053],"genre_scores_gemma":[0.60719025,0.0011850116,0.3842833,0.00022194952,0.00016456023,0.0001449643,0.0003128638,0.00015374654,0.0063433577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.0003226867,0.000019327588,0.000060846574,0.00029438623,0.000080478494],"domain_scores_gemma":[0.99895847,0.0006394378,0.00007107847,0.00017083652,0.00011873925,0.00004145646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743527,0.0007087252,0.00085079105,0.00034497352,0.00034838266,0.00056826544,0.0006446538,0.00040958836,0.0014225771],"category_scores_gemma":[0.0024573244,0.00027617635,0.0003746752,0.0005635631,0.0011442122,0.0010081813,0.0010884529,0.0010944188,0.00062228035],"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.00041008036,0.00009489727,0.0004675366,0.00009889243,0.000037289752,0.00019021572,0.00011326855,0.7544616,0.020352153,0.105408564,0.0028422493,0.11552321],"study_design_scores_gemma":[0.000017354503,0.00004203931,0.000042949447,0.000004731588,0.0000028781742,0.000037623464,0.0000075368093,0.97580147,0.002289687,0.02091635,0.0008257681,0.000011707632],"about_ca_topic_score_codex":0.0014838094,"about_ca_topic_score_gemma":0.0016026717,"teacher_disagreement_score":0.0014838094,"about_ca_system_score_codex":0.00032823265,"about_ca_system_score_gemma":0.0004917615,"threshold_uncertainty_score":0.0047590137},"labels":[],"label_agreement":null},{"id":"W2127204517","doi":"10.1109/tcomm.2004.838738","title":"Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":41,"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":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Mathematics; Convergence (economics); Binary number; Computer science; Discrete mathematics; Arithmetic","score_opus":0.06376592848633332,"score_gpt":0.2991063240944776,"score_spread":0.2353403956081443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127204517","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.406587,0.00081719575,0.5850883,0.00033218486,0.000042815194,0.00007890209,0.000056598095,0.00035371198,0.0066432436],"genre_scores_gemma":[0.9146738,0.0003767134,0.08316242,0.00005382065,0.00002438033,0.00008663359,0.00006629126,0.000082036175,0.0014738851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927765,0.00023997862,0.000034936915,0.00010590075,0.00025910634,0.000082445935],"domain_scores_gemma":[0.9908794,0.007096189,0.00052357506,0.0005024226,0.0008523152,0.00014610124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017376753,0.00035580544,0.00052430015,0.0007164188,0.00051193405,0.00094868685,0.00077918783,0.00083998527,0.00097575434],"category_scores_gemma":[0.017748907,0.00027690717,0.00037400023,0.00052129384,0.0014258674,0.0016545109,0.00073450536,0.0011226914,0.00023268751],"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.00025355295,0.0000795282,0.0043765446,0.00015399854,0.00004903386,0.00013472661,0.000560296,0.597047,0.017498232,0.3339552,0.0007735551,0.04511834],"study_design_scores_gemma":[0.000009262715,0.00003098672,0.00029985266,0.0000122728825,0.0000056853974,0.000056795205,0.000027795182,0.96531695,0.0046912204,0.029243566,0.0002946065,0.00001099788],"about_ca_topic_score_codex":0.000737221,"about_ca_topic_score_gemma":0.00051665405,"teacher_disagreement_score":0.0017376753,"about_ca_system_score_codex":0.0012891294,"about_ca_system_score_gemma":0.00062826613,"threshold_uncertainty_score":0.00935334},"labels":[],"label_agreement":null},{"id":"W2127384100","doi":"10.1109/tcomm.2008.060609","title":"Power reduction techniques for multiple-subcarrier modulated diffuse wireless optical channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Optical wireless; Optical power; Electronic engineering; Computer science; Subcarrier; Optical performance monitoring; Bandwidth (computing); Optical wireless communications; Optical attenuator; Optical modulation amplitude; Electrical engineering; Wireless; Telecommunications; Multi-mode optical fiber; Materials science; Orthogonal frequency-division multiplexing; Engineering; Optoelectronics; Optical fiber; Wavelength-division multiplexing; Physics; Optical amplifier; Optics; Channel (broadcasting); Laser","score_opus":0.03395860612867826,"score_gpt":0.25954867307515955,"score_spread":0.2255900669464813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127384100","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.09125721,0.0007841339,0.90144295,0.00015995996,0.000051380397,0.00004137754,0.000029808156,0.0002973067,0.005935949],"genre_scores_gemma":[0.73777616,0.0010282276,0.25418913,0.000117173964,0.00013752903,0.00007459318,0.00007130565,0.00006697652,0.006538909],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.000038035316,0.0000092113005,0.000029646464,0.00013850308,0.000025074109],"domain_scores_gemma":[0.99963856,0.00015199407,0.000072397575,0.000055059896,0.00007064533,0.000011225155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015603725,0.0004196637,0.00023435203,0.0003424991,0.00023117801,0.00033067248,0.00053808716,0.00024657373,0.0016110926],"category_scores_gemma":[0.00065555825,0.00015580011,0.00025880072,0.00031432795,0.00033946533,0.0005420824,0.00032727965,0.00053784257,0.00033784655],"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.00018550453,0.00008714453,0.0005118377,0.00022349566,0.000035201043,0.00016986363,0.00016583796,0.027743613,0.6364083,0.018393073,0.00078353006,0.3152927],"study_design_scores_gemma":[0.000048089452,0.0004564885,0.00085131323,0.00003356157,0.000044869757,0.00072621595,0.00006197326,0.3377976,0.64071876,0.006479075,0.0127488915,0.000033183667],"about_ca_topic_score_codex":0.00020786803,"about_ca_topic_score_gemma":0.00044677148,"teacher_disagreement_score":0.0016110926,"about_ca_system_score_codex":0.00024472977,"about_ca_system_score_gemma":0.00016367901,"threshold_uncertainty_score":0.005389631},"labels":[],"label_agreement":null},{"id":"W2127421917","doi":"10.1109/tcomm.2004.836563","title":"On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":279,"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":"Low-density parity-check code; Algorithm; Decoding methods; Quantization (signal processing); Mathematics; Parity-check matrix; Belief propagation; Computer science","score_opus":0.054948146900187844,"score_gpt":0.34937265992529287,"score_spread":0.29442451302510503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127421917","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.04195786,0.0006222971,0.95329404,0.00014258908,0.00009566617,0.00009111891,0.000044499935,0.000830417,0.0029214877],"genre_scores_gemma":[0.25548518,0.00052095845,0.74158645,0.000105098545,0.000057720437,0.000105891224,0.00016393387,0.00009615739,0.0018786627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988323,0.0004216084,0.0000676762,0.000103904706,0.00050611567,0.0000684075],"domain_scores_gemma":[0.9979091,0.0010185065,0.00014190911,0.00039098674,0.00049867673,0.000040771214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014796406,0.00083336496,0.0005988985,0.00049853825,0.0004554346,0.0008915663,0.0011653656,0.0005893818,0.001430647],"category_scores_gemma":[0.005271513,0.0003021902,0.00037580688,0.0007745938,0.0006074358,0.0009205859,0.0006298729,0.0011603135,0.0005588564],"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.00093522976,0.0002210616,0.0022892894,0.00033338997,0.00020739305,0.00020205007,0.00027928472,0.3673942,0.06540892,0.04410826,0.0028048467,0.51581603],"study_design_scores_gemma":[0.00003402579,0.00025658,0.0003889636,0.000015547064,0.00003243097,0.00020407396,0.00002468917,0.94831663,0.04331989,0.0046588117,0.0027190147,0.000029302093],"about_ca_topic_score_codex":0.001895864,"about_ca_topic_score_gemma":0.0027995303,"teacher_disagreement_score":0.001895864,"about_ca_system_score_codex":0.00065520906,"about_ca_system_score_gemma":0.00086277135,"threshold_uncertainty_score":0.007825196},"labels":[],"label_agreement":null},{"id":"W2127605483","doi":"10.1109/26.930624","title":"Bandwidth-constrained signature waveforms for maximizing the network capacity of synchronous CDMA systems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"University of Manitoba","funders":"","keywords":"Code division multiple access; Waveform; Bandwidth (computing); Signature (topology); Spread spectrum; Electronic engineering; Computer science; Interference (communication); Synchronous CDMA; Mathematics; Telecommunications; Engineering; Multiuser detection","score_opus":0.052505117688830656,"score_gpt":0.2836236825426637,"score_spread":0.23111856485383303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127605483","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.040593226,0.0010500856,0.9486305,0.0003531271,0.000037855734,0.000057748155,0.00006642925,0.00012556504,0.009085476],"genre_scores_gemma":[0.86320204,0.0016254472,0.13254546,0.00009850988,0.000096374664,0.0001778399,0.000101485726,0.00007455194,0.0020781886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993832,0.0003070608,0.000021286374,0.000048071935,0.00018237777,0.00005789874],"domain_scores_gemma":[0.99878603,0.0007693866,0.00014184741,0.000081475235,0.0001829846,0.000038345603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009882264,0.0007565409,0.0005731972,0.00059439725,0.0003275709,0.0009656887,0.0006188612,0.0010374408,0.0018776524],"category_scores_gemma":[0.0054728733,0.0003022118,0.00018716979,0.0011424783,0.0008345394,0.0013799354,0.000693467,0.0005548476,0.000456498],"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.00022575953,0.000042615047,0.00019514524,0.0002015504,0.000017063006,0.00011299118,0.00014043084,0.7473628,0.014362733,0.15050049,0.0011735897,0.08566478],"study_design_scores_gemma":[0.000022925795,0.00006202599,0.000070893686,0.000024690382,0.00000927734,0.000049122405,0.000029534067,0.94058454,0.0040590796,0.0539993,0.0010732405,0.000015468935],"about_ca_topic_score_codex":0.00063658966,"about_ca_topic_score_gemma":0.000776488,"teacher_disagreement_score":0.0018776524,"about_ca_system_score_codex":0.00074757263,"about_ca_system_score_gemma":0.0010276551,"threshold_uncertainty_score":0.0062814355},"labels":[],"label_agreement":null},{"id":"W2127644918","doi":"10.1109/tcomm.2009.07.070359","title":"A unified approach to computing error probabilities of diversity combining schemes over correlated fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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 Alberta","funders":"","keywords":"Fading; Maximal-ratio combining; Diversity combining; Algorithm; Bit error rate; Channel state information; Diversity gain; Channel (broadcasting); Diversity scheme; Mathematics; Computer science; Superposition principle; Electronic engineering; Statistics; Telecommunications; Engineering; Decoding methods","score_opus":0.054951487819529826,"score_gpt":0.28563780697568664,"score_spread":0.2306863191561568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127644918","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.014640807,0.00015226235,0.98390436,0.00002517638,0.0000082702445,0.000023475897,0.000037630438,0.00021785797,0.0009901671],"genre_scores_gemma":[0.64974976,0.0011801625,0.34597865,0.000047858248,0.000060359784,0.00024342118,0.00021311296,0.00014529799,0.0023813976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857223,0.0004460687,0.00009050645,0.00015725975,0.0005922144,0.00014178824],"domain_scores_gemma":[0.9931458,0.0050660768,0.00053638074,0.0004926963,0.00069821137,0.000060875936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026506241,0.001281773,0.0013321686,0.0015384913,0.00042782023,0.0019185625,0.0013164268,0.001116705,0.0019718262],"category_scores_gemma":[0.01920766,0.0007212486,0.0008299806,0.0016357657,0.00097521057,0.0023571183,0.0008946736,0.0011994484,0.0004957632],"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.000034351655,0.000014789178,0.0003438269,0.000032268454,0.00002009478,0.000049441427,0.00002895125,0.9623628,0.0011585571,0.02387477,0.00010808459,0.011972006],"study_design_scores_gemma":[0.0000026962355,0.000014882367,0.00008651457,0.000004737771,0.000005515043,0.0000272564,0.000003790965,0.99460465,0.0009119578,0.0042329566,0.00009883346,0.000006128126],"about_ca_topic_score_codex":0.0018760704,"about_ca_topic_score_gemma":0.001285229,"teacher_disagreement_score":0.0026506241,"about_ca_system_score_codex":0.0010715235,"about_ca_system_score_gemma":0.0011025922,"threshold_uncertainty_score":0.014017999},"labels":[],"label_agreement":null},{"id":"W2127774185","doi":"10.1109/tcomm.2011.060911.100581","title":"Direct Sequence and Time-Hopping Sequence Designs for Narrowband Interference Mitigation in Impulse Radio UWB Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":36,"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":"Narrowband; Bandwidth (computing); Cognitive radio; Computer science; Electronic engineering; Frequency-hopping spread spectrum; Direct-sequence spread spectrum; Time-hopping; Spread spectrum; Wireless; Spectral efficiency; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.08390413285939638,"score_gpt":0.271634088328772,"score_spread":0.18772995546937563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127774185","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.025021091,0.00125489,0.96969056,0.00008372688,0.00011026599,0.00006609423,0.000032450524,0.00012187804,0.0036190443],"genre_scores_gemma":[0.5923915,0.0017142107,0.3993936,0.00017302549,0.00025768124,0.0003042243,0.00013536174,0.000031782354,0.005598664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.00021394179,0.00003617492,0.000056730038,0.00020842357,0.00003980258],"domain_scores_gemma":[0.99901056,0.00041738068,0.00014810941,0.000078363584,0.000316324,0.000029201961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007447557,0.00074717484,0.00036106646,0.00062581623,0.00026967062,0.0005491271,0.000535011,0.00061966357,0.0021103283],"category_scores_gemma":[0.0019535257,0.00021475357,0.0003015694,0.00044566064,0.00038846603,0.0005125832,0.00035066082,0.0004321486,0.00042038242],"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.00061649625,0.00015925127,0.0011040115,0.00052405556,0.00015281634,0.00030797266,0.00030088064,0.266336,0.10222067,0.10047768,0.002121998,0.52567816],"study_design_scores_gemma":[0.00019690438,0.0016542504,0.00080411445,0.000098913755,0.00011141012,0.0009753532,0.000080945836,0.89979774,0.04533527,0.037675064,0.013186721,0.000083296436],"about_ca_topic_score_codex":0.00038017076,"about_ca_topic_score_gemma":0.0005604054,"teacher_disagreement_score":0.0021103283,"about_ca_system_score_codex":0.00032713488,"about_ca_system_score_gemma":0.0004917964,"threshold_uncertainty_score":0.007059753},"labels":[],"label_agreement":null},{"id":"W2128626239","doi":"10.1109/26.974248","title":"Hexacode-based quantization of the Gaussian source at 1/2 bit per sample","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Binary Golay code; Decoding methods; Binary number; Quantization (signal processing); Algorithm; Gaussian; Bit (key); Algebraic number; Computer science; Mathematics; Binary code; Theoretical computer science; Discrete mathematics; Arithmetic; Physics","score_opus":0.03932801141443842,"score_gpt":0.2963049526388216,"score_spread":0.2569769412243832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128626239","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.3997039,0.0020043193,0.5788256,0.00080056634,0.00014037473,0.000112516536,0.00040975865,0.0009230421,0.01707998],"genre_scores_gemma":[0.8038695,0.0003953106,0.19214836,0.00012297352,0.00002058181,0.000039317147,0.00021511549,0.000032491833,0.0031563034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992092,0.00030014932,0.000037870108,0.00008237616,0.00028744098,0.0000829795],"domain_scores_gemma":[0.9986305,0.0005939827,0.00016006688,0.00020104859,0.0003660147,0.000048279555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791835,0.00048617084,0.0008975048,0.00024883507,0.00042609536,0.00083610264,0.0005340984,0.0005629827,0.0022085758],"category_scores_gemma":[0.003185821,0.00013892024,0.00020163629,0.00060780765,0.0008993856,0.0007112134,0.0007277535,0.00053583516,0.00052394246],"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.0040014954,0.00018701523,0.005021748,0.0003268931,0.00020371177,0.00030436853,0.00032926034,0.55493003,0.07547972,0.10565501,0.0039594243,0.24960122],"study_design_scores_gemma":[0.00010598712,0.00040031676,0.00088896905,0.000032199237,0.000035812514,0.00027602434,0.00006774868,0.9068319,0.076236926,0.012646225,0.0024217777,0.000056030643],"about_ca_topic_score_codex":0.0029826972,"about_ca_topic_score_gemma":0.004700132,"teacher_disagreement_score":0.0029826972,"about_ca_system_score_codex":0.00073879736,"about_ca_system_score_gemma":0.001238841,"threshold_uncertainty_score":0.0073884726},"labels":[],"label_agreement":null},{"id":"W2128874299","doi":"10.1109/tcomm.2010.080310.090292","title":"Performance Analysis of Bidirectional Communication Protocols Based on Decode-and-Forward Relaying","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":100,"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; Relay; Outage probability; Linear network coding; Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer network; Coding (social sciences); Protocol (science); Diversity gain; Asymptotic analysis; Power (physics); Channel (broadcasting); Fading; Mathematics; Telecommunications; Network packet; Statistics","score_opus":0.048973838145291555,"score_gpt":0.3224145168985834,"score_spread":0.27344067875329187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128874299","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.5587141,0.0024753741,0.41118675,0.0006300909,0.000060821007,0.0001674039,0.00021186731,0.0003431452,0.026210448],"genre_scores_gemma":[0.98980296,0.00050713966,0.008696677,0.000026961583,0.00001532657,0.000062318235,0.000042505166,0.000024387396,0.00082165597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796677,0.0008592232,0.00007747189,0.0001545501,0.0006269555,0.00031504745],"domain_scores_gemma":[0.985059,0.011242437,0.001443135,0.00062279304,0.0014684201,0.00016409186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037348843,0.0010234519,0.0009800708,0.0011643752,0.0007132208,0.0012873975,0.00088478933,0.0009328884,0.0013572345],"category_scores_gemma":[0.014928212,0.00034200004,0.0004250941,0.0009770031,0.0015063536,0.0015950637,0.0016453798,0.0008390033,0.0002758011],"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.00030332356,0.000120452285,0.0026860884,0.00016220564,0.00008131212,0.0002359581,0.00035301704,0.87773615,0.012089554,0.08284882,0.0005622411,0.022820927],"study_design_scores_gemma":[0.000009957045,0.00014298785,0.00025311447,0.000011448319,0.000024708146,0.00009796251,0.00006691946,0.9888653,0.0027703575,0.007468447,0.00027107555,0.000017611514],"about_ca_topic_score_codex":0.0025333527,"about_ca_topic_score_gemma":0.0019761822,"teacher_disagreement_score":0.0037348843,"about_ca_system_score_codex":0.0015612734,"about_ca_system_score_gemma":0.0014460188,"threshold_uncertainty_score":0.019752204},"labels":[],"label_agreement":null},{"id":"W2129369422","doi":"10.1109/tcomm.2009.10.080025","title":"Design of scalable decoders for sensor networks via Bayesian network learning","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Bayesian Modeling and Causal Inference","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":"University of Manitoba","funders":"","keywords":"Factor graph; Scalability; Minimum mean square error; Decoding methods; Computer science; Gaussian; Computational complexity theory; Wireless sensor network; Algorithm; Quantization (signal processing); Graph; Bayesian network; Mathematics; Theoretical computer science; Artificial intelligence; Estimator; Statistics","score_opus":0.04594662418572424,"score_gpt":0.28384216330827117,"score_spread":0.23789553912254693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129369422","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.0031359368,0.00007486071,0.99612373,0.000063003885,0.000009125017,0.000020395968,0.000031401923,0.00013559377,0.0004058968],"genre_scores_gemma":[0.37137437,0.0004513612,0.62538415,0.00020546581,0.000067825,0.0003211445,0.0002801315,0.00011197488,0.0018035021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988876,0.00041254377,0.00006153568,0.00021091341,0.00034161244,0.00008575406],"domain_scores_gemma":[0.99715984,0.0019342579,0.00023410392,0.00022836402,0.00037087227,0.00007257687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882442,0.00094421586,0.001235339,0.0005488312,0.00042513237,0.0008325418,0.001166564,0.0010443969,0.0014647696],"category_scores_gemma":[0.0077736476,0.00062416174,0.00047839302,0.00074148783,0.0010532968,0.0020247812,0.0014024162,0.0012493684,0.00047931593],"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.00011803382,0.000033588123,0.00033815892,0.000087772285,0.000044334676,0.00010003845,0.000084885905,0.87345856,0.006755862,0.04852709,0.001152465,0.06929919],"study_design_scores_gemma":[0.000011450359,0.000021283788,0.00003589008,0.000005952692,0.0000052668665,0.000019683666,0.000007224717,0.98380166,0.001170052,0.014514582,0.00040053346,0.000006448086],"about_ca_topic_score_codex":0.0023149082,"about_ca_topic_score_gemma":0.004058073,"teacher_disagreement_score":0.0023149082,"about_ca_system_score_codex":0.0008791005,"about_ca_system_score_gemma":0.0016325247,"threshold_uncertainty_score":0.009955466},"labels":[],"label_agreement":null},{"id":"W2130092083","doi":"10.1109/tcomm.2009.07.070619","title":"Identical-capacity channel decomposition for design of universal LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Code (set theory); Channel (broadcasting); Conjecture; Computer science; Regular polygon; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Telecommunications; Programming language","score_opus":0.07968733975742756,"score_gpt":0.3290297916985942,"score_spread":0.24934245194116664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130092083","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.022679476,0.00030685795,0.969177,0.00017840651,0.00003854972,0.000099651275,0.00020255765,0.00029801205,0.007019455],"genre_scores_gemma":[0.7159848,0.0006079442,0.27743044,0.00030296686,0.00008258249,0.00043324556,0.00055811985,0.00012340564,0.0044763875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907565,0.00032878984,0.00004261693,0.00016697668,0.00022737605,0.00015856551],"domain_scores_gemma":[0.9987103,0.00056430994,0.00012891612,0.00022635689,0.0002708432,0.00009930364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011821109,0.0009954197,0.0006732383,0.0007282034,0.00051592843,0.00092102325,0.0006409275,0.0007132541,0.003330519],"category_scores_gemma":[0.0034227236,0.00043988044,0.0005359376,0.0008403062,0.001047614,0.00092862995,0.001103302,0.0010693984,0.0006213413],"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.00033845825,0.00008559752,0.00055640837,0.00029693457,0.00004940143,0.00012318381,0.00016802165,0.7151192,0.018483654,0.1987614,0.004471436,0.06154637],"study_design_scores_gemma":[0.000026278853,0.00006618724,0.00010120039,0.000030742405,0.000014326342,0.000048568247,0.000025056956,0.9480444,0.0053017433,0.04407757,0.0022436718,0.000020237667],"about_ca_topic_score_codex":0.0017098514,"about_ca_topic_score_gemma":0.0019530654,"teacher_disagreement_score":0.003330519,"about_ca_system_score_codex":0.0013735043,"about_ca_system_score_gemma":0.0021401534,"threshold_uncertainty_score":0.011141717},"labels":[],"label_agreement":null},{"id":"W2130098973","doi":"10.1109/26.905889","title":"Simple and accurate methods for outage analysis in cellular mobile radio systems-a unified approach","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":147,"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":"Rician fading; Nakagami distribution; Fading; Computer science; Interference (communication); Algorithm; Outage probability; Fading distribution; Random variable; Mathematics; Electronic engineering; Statistics; Channel (broadcasting); Telecommunications; Rayleigh fading; Engineering","score_opus":0.051052115170956175,"score_gpt":0.3358924471817224,"score_spread":0.2848403320107662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130098973","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.0005225474,0.00045941345,0.9980263,0.000025168127,0.000022186556,0.000021700855,0.000022407701,0.000102590566,0.0007975948],"genre_scores_gemma":[0.14744408,0.006158701,0.83694464,0.00018304831,0.0004498638,0.0006426578,0.00037526744,0.0004133331,0.007388415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986541,0.0003752725,0.00009061242,0.00008472444,0.0007169725,0.00007817845],"domain_scores_gemma":[0.9978721,0.0010326325,0.00015172288,0.00035209305,0.00054646365,0.000045039335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917145,0.0017982167,0.0016103779,0.0027083936,0.00059504964,0.0014156839,0.0014405806,0.001131751,0.0027282021],"category_scores_gemma":[0.0075336276,0.00059389323,0.0012499713,0.0020162268,0.0008799235,0.0018715701,0.0014652655,0.0017252006,0.0019009843],"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.000019832789,0.000064145024,0.00049140747,0.0003153664,0.00006151442,0.00018714638,0.00020709231,0.6270533,0.005036333,0.25668526,0.004166432,0.105712205],"study_design_scores_gemma":[0.000004720013,0.000014193508,0.00010545331,0.000029609642,0.000010309761,0.000054084652,0.000019802548,0.9622261,0.00054749096,0.033930495,0.003042915,0.000014853464],"about_ca_topic_score_codex":0.0031083536,"about_ca_topic_score_gemma":0.0037314636,"teacher_disagreement_score":0.0031083536,"about_ca_system_score_codex":0.0011090677,"about_ca_system_score_gemma":0.0010732159,"threshold_uncertainty_score":0.010138929},"labels":[],"label_agreement":null},{"id":"W2131566996","doi":"10.1109/tcomm.2006.881398","title":"Performance Analysis of Generalized Selection Combining in Generalized Correlated Nakagami-$m$ Fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Nakagami distribution; Mathematics; Selection (genetic algorithm); Statistics; Maximal-ratio combining; Correlation; Fading distribution; Algorithm; Applied mathematics; Computer science; Artificial intelligence","score_opus":0.018943163637527873,"score_gpt":0.2611658133059284,"score_spread":0.24222264966840054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131566996","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.52673274,0.0020044465,0.45318606,0.00039931227,0.00004176378,0.000057183595,0.00020012975,0.00064307137,0.01673523],"genre_scores_gemma":[0.98825514,0.00054851064,0.010347656,0.000042603337,0.000024850826,0.000020398034,0.000063165244,0.00001744154,0.0006801936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990614,0.0003902101,0.000027906228,0.000077511315,0.0002681977,0.00017479373],"domain_scores_gemma":[0.9971967,0.0018630989,0.0002782328,0.0002758399,0.0003225529,0.00006355999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823227,0.001198073,0.0008547096,0.0005077319,0.00036373848,0.0009788004,0.00074712536,0.0006083669,0.0013998275],"category_scores_gemma":[0.0036611508,0.00027171566,0.0004976751,0.0012999034,0.001131752,0.0007253786,0.0009140039,0.00035634908,0.0002680299],"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.00017551816,0.000010886126,0.0015725351,0.00007713175,0.00007502034,0.00022784724,0.00007417801,0.9634311,0.0068759704,0.01675167,0.00026520932,0.010462877],"study_design_scores_gemma":[0.000016531229,0.00010602566,0.0010803428,0.000011155346,0.000045996698,0.00016400543,0.000026806414,0.9901681,0.0027030553,0.0054328255,0.00022526029,0.000019919617],"about_ca_topic_score_codex":0.0024544902,"about_ca_topic_score_gemma":0.0022117714,"teacher_disagreement_score":0.0024544902,"about_ca_system_score_codex":0.0011249074,"about_ca_system_score_gemma":0.0010665715,"threshold_uncertainty_score":0.008161783},"labels":[],"label_agreement":null},{"id":"W2131828276","doi":"10.1109/tcomm.2007.894092","title":"Coded Unitary Space–Time Modulation With Iterative Decoding: Error Performance and Mapping Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":32,"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; University of Saskatchewan","funders":"","keywords":"Decoding methods; Phase-shift keying; Algorithm; Unitary state; Mathematics; Transmitter; Constellation; Quadrature amplitude modulation; Keying; Fading; Computer science; Unitary matrix; Error detection and correction; Channel (broadcasting); Bit error rate; Telecommunications; Physics","score_opus":0.03961834163067597,"score_gpt":0.2645241426640996,"score_spread":0.22490580103342367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131828276","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.066569746,0.00081083237,0.9273696,0.00020977586,0.00002892441,0.00005231354,0.000039639177,0.00015124494,0.0047678947],"genre_scores_gemma":[0.88193977,0.0007629767,0.11523279,0.00006829245,0.000045753288,0.00011627423,0.00007733546,0.00004507429,0.0017117753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974063,0.0012713058,0.00008501962,0.0001710836,0.0008860325,0.00018019951],"domain_scores_gemma":[0.98941225,0.007927482,0.00073425216,0.00076965266,0.0010802004,0.000076273616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028390358,0.001132923,0.00074956537,0.0006706796,0.00033913588,0.0012191364,0.0010246831,0.0013169127,0.000838336],"category_scores_gemma":[0.021047367,0.00031297188,0.00028536908,0.0010080857,0.0015656152,0.0021639038,0.0011180728,0.0007726369,0.00033150578],"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.00028335451,0.000058732443,0.0011703874,0.000175162,0.000056150202,0.00016165545,0.00022174271,0.8203176,0.009416909,0.103351206,0.0004056173,0.064381585],"study_design_scores_gemma":[0.000014194491,0.000077727,0.00016191899,0.000020244788,0.0000109913335,0.00013346062,0.000014414832,0.97759944,0.0062396615,0.015325256,0.00038679442,0.000015875563],"about_ca_topic_score_codex":0.0010125397,"about_ca_topic_score_gemma":0.00055072684,"teacher_disagreement_score":0.0028390358,"about_ca_system_score_codex":0.00095514837,"about_ca_system_score_gemma":0.0009940668,"threshold_uncertainty_score":0.01501441},"labels":[],"label_agreement":null},{"id":"W2132078810","doi":"10.1109/tcomm.2005.852845","title":"Analytical Modeling of Offset-Induced Priority in Multiclass OBS Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":29,"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":"Offset (computer science); Robustness (evolution); Jitter; Scaling; Blocking (statistics); Computer science; Optical burst switching; Control theory (sociology); Mathematics; Wavelength; Telecommunications; Computer network; Physics; Wavelength-division multiplexing; Optical performance monitoring; Artificial intelligence","score_opus":0.04112625151022743,"score_gpt":0.28530575208235054,"score_spread":0.24417950057212312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132078810","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.22543947,0.0010709399,0.75775397,0.00054573413,0.000096186894,0.000067360415,0.00014615478,0.00031674138,0.014563446],"genre_scores_gemma":[0.9810104,0.00047491674,0.014657114,0.000053669737,0.00004406016,0.000030469966,0.000042050924,0.000040899584,0.0036464613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00006866053,0.000012175673,0.000046817855,0.00018609407,0.000117078416],"domain_scores_gemma":[0.99928385,0.00032159287,0.00014079477,0.000059171503,0.00015230253,0.000042229207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155566,0.00049693487,0.00044385393,0.0004637049,0.0004596918,0.00086558296,0.0011781343,0.0007638726,0.0011977712],"category_scores_gemma":[0.0027044858,0.00036993896,0.00030055217,0.00044858234,0.00065840874,0.0015834287,0.0005932107,0.00075848354,0.0002049983],"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.000035712383,0.00002809574,0.0007530604,0.00003193121,0.000008365291,0.00010445755,0.00008589904,0.9473086,0.0054476103,0.041292887,0.00029206323,0.0046113078],"study_design_scores_gemma":[0.0000017674516,0.0000042477072,0.00007986825,0.000001604517,0.0000016188327,0.000010269394,0.0000058017654,0.99629706,0.00021847899,0.0032433984,0.00013385726,0.000002081455],"about_ca_topic_score_codex":0.0056057395,"about_ca_topic_score_gemma":0.0033399437,"teacher_disagreement_score":0.0056057395,"about_ca_system_score_codex":0.0018707685,"about_ca_system_score_gemma":0.00101588,"threshold_uncertainty_score":0.013573408},"labels":[],"label_agreement":null},{"id":"W2132553172","doi":"10.1109/tcomm.2009.12.070539","title":"Limit theorem on the sum of identically distributed equally and positively correlated joint lognormals","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":33,"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":"Independent and identically distributed random variables; Mathematics; Log-normal distribution; Limit (mathematics); Central limit theorem; Random variable; Illustration of the central limit theorem; Joint probability distribution; Discrete mathematics; Distribution (mathematics); Combinatorics; Applied mathematics; Mathematical analysis; Statistics; Sum of normally distributed random variables","score_opus":0.15526412220446667,"score_gpt":0.3566107570205999,"score_spread":0.20134663481613324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132553172","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.024306826,0.001014883,0.9676462,0.0006835363,0.00008764442,0.00005942144,0.0001649049,0.00020605192,0.005830526],"genre_scores_gemma":[0.7229532,0.0048495224,0.2479075,0.0016055783,0.00073885656,0.0016393359,0.00080825295,0.00046781977,0.0190299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529403,0.0021341557,0.00021166539,0.00065607316,0.0012332207,0.00047084957],"domain_scores_gemma":[0.9435547,0.042711694,0.0037876442,0.0029296095,0.005385659,0.0016306449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016772818,0.0018992868,0.002682558,0.0033710648,0.0014671701,0.003141901,0.0044660005,0.0020271402,0.007320737],"category_scores_gemma":[0.07015763,0.0009682476,0.0020102034,0.002854845,0.0070776315,0.008395104,0.004309895,0.004274513,0.0014256157],"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.00009580447,0.00004568704,0.0020559041,0.00019792868,0.00014394193,0.000460289,0.00036953023,0.05922013,0.0013502539,0.92239076,0.0019562992,0.011713591],"study_design_scores_gemma":[0.000068730966,0.000085207896,0.0011286798,0.00015489441,0.000086913664,0.0008558509,0.00011979739,0.50656676,0.001136972,0.4872838,0.0023992485,0.00011313345],"about_ca_topic_score_codex":0.0020866354,"about_ca_topic_score_gemma":0.0012669035,"teacher_disagreement_score":0.016772818,"about_ca_system_score_codex":0.0018830764,"about_ca_system_score_gemma":0.0015783252,"threshold_uncertainty_score":0.08870423},"labels":[],"label_agreement":null},{"id":"W2132947734","doi":"10.1109/26.891208","title":"Frame synchronization in guided scrambling line codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"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 Alberta","funders":"Dalhousie University","keywords":"Scrambling; Synchronizing; Computer science; Line code; Algorithm; Code word; Synchronization (alternating current); Decoding methods; Theoretical computer science; Telecommunications; Baseband","score_opus":0.04064479655014228,"score_gpt":0.29999418819685075,"score_spread":0.25934939164670845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132947734","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.28816292,0.000376322,0.7068738,0.00006386376,0.000031209656,0.000034310036,0.000027381882,0.0003614886,0.0040686945],"genre_scores_gemma":[0.9595165,0.00013897795,0.039241575,0.00002187165,0.000012788037,0.00003057757,0.000020582343,0.000029026256,0.0009880794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997695,0.00006211137,0.000009597542,0.000036275364,0.000081488055,0.00004093032],"domain_scores_gemma":[0.99937505,0.00023723078,0.00016460069,0.00007932304,0.00012086291,0.000022868773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025173606,0.00018675531,0.00019709273,0.00031883558,0.00021199144,0.00035581717,0.00030182852,0.00041802134,0.00046421526],"category_scores_gemma":[0.0016001497,0.00014587397,0.00016413255,0.00024369432,0.0005052634,0.0003803096,0.00025487418,0.00025201007,0.00016913911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036118197,0.00005719308,0.0016826558,0.00013300567,0.000028345426,0.0005864021,0.000630807,0.5056899,0.18714271,0.22566862,0.0011777745,0.07684144],"study_design_scores_gemma":[0.00002597262,0.00014055778,0.0005371968,0.00001591297,0.000009052267,0.00015182418,0.000052846375,0.9383496,0.038627494,0.020237649,0.0018233433,0.000028558603],"about_ca_topic_score_codex":0.0010051558,"about_ca_topic_score_gemma":0.0006129453,"teacher_disagreement_score":0.0010051558,"about_ca_system_score_codex":0.00036741752,"about_ca_system_score_gemma":0.0002771005,"threshold_uncertainty_score":0.0026658177},"labels":[],"label_agreement":null},{"id":"W2133539287","doi":"10.1109/tcomm.2005.843416","title":"Kalman Filter-Trained Recurrent Neural Equalizers for Time-Varying Channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Ottawa","funders":"","keywords":"Kalman filter; Recurrent neural network; Extended Kalman filter; Computer science; Convergence (economics); Control theory (sociology); Equalization (audio); Channel (broadcasting); Artificial neural network; Gradient descent; Invariant extended Kalman filter; Artificial intelligence; Telecommunications","score_opus":0.06137283117714596,"score_gpt":0.31443673816023904,"score_spread":0.25306390698309306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133539287","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.012374189,0.00041516504,0.98469824,0.00006417153,0.00007498965,0.000026283053,0.00002182273,0.00060363975,0.0017214145],"genre_scores_gemma":[0.62261313,0.0009355709,0.36556807,0.00014094691,0.000116903386,0.00012276573,0.00016354446,0.00010395896,0.010235109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996086,0.000109468514,0.000038943705,0.000083729996,0.00011377128,0.000045495646],"domain_scores_gemma":[0.99940526,0.00028615977,0.00006001874,0.000072178984,0.00016567486,0.000010611005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008573172,0.0005893739,0.0005916458,0.0002470863,0.00028838063,0.0005126961,0.00077880407,0.0006448458,0.0019709922],"category_scores_gemma":[0.0021709795,0.00025778587,0.00036878505,0.00029223724,0.00034265537,0.0011989853,0.0003743241,0.00077538664,0.0006840892],"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.00039360696,0.00013114503,0.00077586534,0.0002197458,0.00019494577,0.00018388135,0.00021040163,0.4372275,0.05407723,0.027567808,0.0029595436,0.4760584],"study_design_scores_gemma":[0.000022563596,0.00009620658,0.00016273498,0.0000126639,0.000034537366,0.00007228591,0.00000976151,0.97808444,0.017469775,0.0019382496,0.0020829034,0.00001377576],"about_ca_topic_score_codex":0.0023204994,"about_ca_topic_score_gemma":0.005377741,"teacher_disagreement_score":0.0023204994,"about_ca_system_score_codex":0.00037871586,"about_ca_system_score_gemma":0.0004217037,"threshold_uncertainty_score":0.0065936446},"labels":[],"label_agreement":null},{"id":"W2134198979","doi":"10.1109/tcomm.2013.110413.120762","title":"Multi-Way MIMO Amplify-and-Forward Relay Networks with Zero-Forcing Transmission","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"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":"MIMO; Relay; Transmission (telecommunications); Pairwise comparison; Pairwise error probability; Relay channel; Multiplexing; Node (physics); Channel state information; Topology (electrical circuits); Signal-to-noise ratio (imaging); Computer science; Channel (broadcasting); Electronic engineering; Mathematics; Control theory (sociology); Telecommunications; Engineering; Wireless; Physics; Power (physics)","score_opus":0.04130863413088687,"score_gpt":0.27266169821131425,"score_spread":0.23135306408042738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134198979","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.060286444,0.000655847,0.9287778,0.00019456775,0.000046344005,0.00006644255,0.000072304996,0.0001683776,0.009731762],"genre_scores_gemma":[0.9261954,0.0005843259,0.07111173,0.000052691343,0.000029310593,0.0000932237,0.000032085773,0.00000840806,0.0018928556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.0003015302,0.00003750123,0.00009983823,0.00020444256,0.00008536352],"domain_scores_gemma":[0.99810433,0.0012732414,0.00022346934,0.00015715566,0.00020496707,0.000036800124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587738,0.0009962711,0.0006749913,0.0003864038,0.00050741574,0.00085543556,0.0010342746,0.00073532516,0.0014192754],"category_scores_gemma":[0.0025714599,0.0003802695,0.0005446027,0.0005321509,0.0006475174,0.0011550027,0.00097470434,0.0006219382,0.00038295577],"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.00035381984,0.00007744754,0.0011383385,0.00043270472,0.00011253043,0.0009209248,0.00032550443,0.76186806,0.033406273,0.1305106,0.0010490837,0.06980464],"study_design_scores_gemma":[0.00001704266,0.00015812855,0.00017764211,0.000022682138,0.000043186963,0.00033272893,0.00003780174,0.97828263,0.00542517,0.014694375,0.0007820287,0.000026565642],"about_ca_topic_score_codex":0.0007178451,"about_ca_topic_score_gemma":0.0012583068,"teacher_disagreement_score":0.0014192754,"about_ca_system_score_codex":0.0006306346,"about_ca_system_score_gemma":0.000537654,"threshold_uncertainty_score":0.0061282516},"labels":[],"label_agreement":null},{"id":"W2134332777","doi":"10.1109/tcomm.2011.050911.100069","title":"Multi-Hop Coherent Free-Space Optical Communications over Atmospheric Turbulence Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":48,"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":"Fading; Diversity gain; Electronic engineering; Relay; Multiplexing; Computer science; Diversity scheme; Free-space optical communication; Bit error rate; Communications system; Antenna diversity; Transmission (telecommunications); Signal-to-noise ratio (imaging); Optical communication; Heterodyne detection; Time diversity; Topology (electrical circuits); Telecommunications; Wireless; Engineering; Physics; Electrical engineering; Power (physics); Channel (broadcasting); Optics","score_opus":0.05902566054176014,"score_gpt":0.26609284337468464,"score_spread":0.2070671828329245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134332777","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.62926257,0.0008529508,0.36417255,0.0002447863,0.000031548527,0.000027576696,0.000044846558,0.000058345973,0.005304766],"genre_scores_gemma":[0.9888859,0.00019713941,0.01046236,0.000016304924,0.00001307343,0.0000052591267,0.000006085481,0.0000023897405,0.0004113975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.00003761807,0.000003738333,0.00001766668,0.000055770503,0.000024059127],"domain_scores_gemma":[0.99934787,0.00044116355,0.00011459741,0.00003831514,0.000043417775,0.000014699823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020829916,0.00034504375,0.00021390874,0.0001671195,0.00031208544,0.00029502687,0.00030537075,0.00039155717,0.0003316474],"category_scores_gemma":[0.0009118154,0.00009697289,0.00015634643,0.00022683674,0.00055167306,0.0006529556,0.00032069336,0.0001914658,0.000058291378],"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.000111225425,0.00006275852,0.0025136096,0.00009420953,0.000039792798,0.0005711343,0.0001480241,0.8470976,0.06744724,0.061795205,0.00023288948,0.019886361],"study_design_scores_gemma":[0.0000072421553,0.00010715483,0.0008162677,0.0000036699812,0.000009892662,0.0001649867,0.0000383732,0.9838382,0.007599677,0.006998093,0.00040353014,0.000012915414],"about_ca_topic_score_codex":0.0005983151,"about_ca_topic_score_gemma":0.0010430098,"teacher_disagreement_score":0.0005983151,"about_ca_system_score_codex":0.00030875314,"about_ca_system_score_gemma":0.00020875824,"threshold_uncertainty_score":0.002240181},"labels":[],"label_agreement":null},{"id":"W2134713051","doi":"10.1109/tcomm.2010.05.080640","title":"Accurate computation of the MGF of the lognormal distribution and its application to sum of lognormals","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":39,"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":"Log-normal distribution; Mathematics; Function (biology); Expression (computer science); Applied mathematics; Cumulative distribution function; Saddle point; Method of steepest descent; Convergence (economics); Algorithm; Distribution (mathematics); Moment (physics); Mathematical optimization; Mathematical analysis; Probability density function; Computer science; Statistics; Geometry","score_opus":0.05811279964581716,"score_gpt":0.3563313375717895,"score_spread":0.2982185379259723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134713051","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.009552133,0.00017377644,0.98844844,0.000071607086,0.000022130986,0.000011385582,0.000025238009,0.00034424377,0.0013510028],"genre_scores_gemma":[0.3825359,0.0007679645,0.61188054,0.00011636381,0.00009663574,0.00009929374,0.00020459386,0.0005014601,0.0037972108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996012,0.00011164507,0.000023991977,0.000049389073,0.00017376998,0.000040070554],"domain_scores_gemma":[0.9959008,0.0029694512,0.000261338,0.00041176076,0.0003923047,0.000064358945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875883,0.00054248783,0.00066260557,0.0010653696,0.00037646524,0.000983692,0.0007992922,0.00077041134,0.0020787606],"category_scores_gemma":[0.012557933,0.00029442416,0.0005775944,0.00063954695,0.0007380339,0.0014966127,0.000777639,0.0014114731,0.0009559965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001037998,0.00002994353,0.0028705741,0.00010456503,0.000028051656,0.00026193252,0.00020479206,0.6610111,0.009022236,0.15523742,0.0019887676,0.1691369],"study_design_scores_gemma":[0.0000037389857,0.0000070714555,0.00024632175,0.000010526564,0.00000261476,0.00006849117,0.000009013805,0.978399,0.0014517201,0.018709255,0.0010850916,0.000007199081],"about_ca_topic_score_codex":0.0023840475,"about_ca_topic_score_gemma":0.0019698762,"teacher_disagreement_score":0.0023840475,"about_ca_system_score_codex":0.0006898469,"about_ca_system_score_gemma":0.000825151,"threshold_uncertainty_score":0.0089249015},"labels":[],"label_agreement":null},{"id":"W2134864194","doi":"10.1109/tcomm.2010.07.090273","title":"Convolutionally Coded Transmission over Markov-Gaussian Channels: Analysis and Decoding Metrics","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":35,"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":"Computer science; Additive white Gaussian noise; Algorithm; Decoding methods; Markov chain; Noise (video); Gaussian noise; Markov process; Interference (communication); Interleaving; Channel (broadcasting); Gaussian; Transmission (telecommunications); Electronic engineering; Mathematics; Statistics; Telecommunications; Artificial intelligence; Engineering; Physics","score_opus":0.01965295760201848,"score_gpt":0.2652761580552627,"score_spread":0.24562320045324423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134864194","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.20990658,0.0019005599,0.780835,0.00038949013,0.000026092506,0.00007576444,0.00027139406,0.0003839751,0.0062111164],"genre_scores_gemma":[0.9374103,0.0012305541,0.059495047,0.000055058008,0.000035829322,0.000094276606,0.00022397899,0.00005898042,0.0013959999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853206,0.00046631548,0.00007829304,0.00011433974,0.0006263354,0.00018259663],"domain_scores_gemma":[0.98599064,0.009914732,0.001775499,0.00053494534,0.001614879,0.00016926296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023044916,0.0010517502,0.00082676596,0.0012797303,0.00036677238,0.0012248795,0.00093448075,0.0010477499,0.00088265305],"category_scores_gemma":[0.013337097,0.00033580812,0.00032762584,0.0012729659,0.0013027441,0.0014589903,0.0010154103,0.0007081794,0.000182733],"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.00009918271,0.000025607942,0.0013963627,0.000084210435,0.000023809433,0.00012939663,0.0001273599,0.91627085,0.0040739262,0.0635564,0.00034496095,0.0138679305],"study_design_scores_gemma":[0.0000016737213,0.000016501512,0.0002130047,0.000011688665,0.000005353891,0.00004351564,0.000007841698,0.99216,0.0014858274,0.0059490004,0.00009767163,0.000007812705],"about_ca_topic_score_codex":0.005399679,"about_ca_topic_score_gemma":0.0041017444,"teacher_disagreement_score":0.005399679,"about_ca_system_score_codex":0.002786225,"about_ca_system_score_gemma":0.0016865539,"threshold_uncertainty_score":0.020215511},"labels":[],"label_agreement":null},{"id":"W2134868944","doi":"10.1109/tcomm.2011.092011.090171","title":"Novel Representations for the Bivariate Rician Distribution","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":23,"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":"Rician fading; Cumulative distribution function; Mathematics; Bivariate analysis; Independent and identically distributed random variables; Probability density function; Random variable; Joint probability distribution; Applied mathematics; Moment-generating function; Expression (computer science); Statistics; Fading; Computer science","score_opus":0.08392605327693733,"score_gpt":0.3013827566129275,"score_spread":0.21745670333599018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134868944","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.0034751827,0.0006039748,0.9892764,0.000222602,0.00010445362,0.000017040416,0.00006337009,0.00010032903,0.006136736],"genre_scores_gemma":[0.47979757,0.0066120094,0.4886364,0.00079628825,0.0009898633,0.00027540672,0.00048324923,0.00035642897,0.022052782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993549,0.0001426976,0.000031190128,0.00007726289,0.0003153852,0.00007863176],"domain_scores_gemma":[0.99863476,0.00053227757,0.00018641102,0.00018868448,0.0003919571,0.00006589803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014869501,0.0009246106,0.00057278184,0.0015632364,0.00034088304,0.0018677828,0.0010046939,0.0010285543,0.0031786424],"category_scores_gemma":[0.0053400993,0.0003022193,0.0007579492,0.001548166,0.000925914,0.0022738164,0.00092223857,0.001958642,0.0010955756],"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.000017531434,0.00002323269,0.0002741659,0.00006823618,0.000015397296,0.00016677202,0.000100959216,0.047554567,0.003501918,0.9171602,0.0032277124,0.027889436],"study_design_scores_gemma":[0.000009960233,0.000028902698,0.00034327336,0.000041094256,0.000020472613,0.0008590976,0.00005703974,0.7016317,0.0016716084,0.28303733,0.01225645,0.000042963566],"about_ca_topic_score_codex":0.0006603905,"about_ca_topic_score_gemma":0.0006432655,"teacher_disagreement_score":0.0031786424,"about_ca_system_score_codex":0.0010634906,"about_ca_system_score_gemma":0.0009744597,"threshold_uncertainty_score":0.010633647},"labels":[],"label_agreement":null},{"id":"W2135016653","doi":"10.1109/tcomm.2002.806548","title":"Multiuser receivers that are robust to delay mismatch","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Queen's University","funders":"","keywords":"Detector; Decorrelation; Computer science; Single antenna interference cancellation; Asynchronous communication; Telecommunications link; Robustness (evolution); Chip; Multiuser detection; Code division multiple access; Electronic engineering; Algorithm; SIGNAL (programming language); Block (permutation group theory); Residual; Telecommunications; Mathematics; Engineering","score_opus":0.1408921385955292,"score_gpt":0.2982669960133088,"score_spread":0.1573748574177796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135016653","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.012489157,0.00030175276,0.98587495,0.000052667405,0.00003751606,0.000025873655,0.000025029534,0.00026376432,0.000929315],"genre_scores_gemma":[0.40038747,0.0004672787,0.59542376,0.0002476514,0.00015253344,0.00009742673,0.00014267582,0.000063890235,0.003017289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988318,0.00024534645,0.000055806304,0.0001890256,0.0005803195,0.000097623815],"domain_scores_gemma":[0.9978796,0.0008907728,0.00037381085,0.00034030055,0.0004546391,0.000060891736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392636,0.00071941025,0.0010352288,0.00048503882,0.00019854867,0.0007384102,0.0009860956,0.0015498372,0.00075934705],"category_scores_gemma":[0.005374801,0.00046247613,0.0005493802,0.0005437715,0.00043527875,0.0012455276,0.00075882516,0.0008367797,0.00074818375],"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.00052469363,0.0001621993,0.0022013183,0.00036377602,0.00031295905,0.00038838852,0.0001650201,0.43838027,0.238396,0.078409515,0.001840919,0.23885489],"study_design_scores_gemma":[0.000023922003,0.00016638135,0.0002508046,0.000009776059,0.000033880682,0.00018580926,0.000008537458,0.9584311,0.033858843,0.0047918623,0.0022090368,0.000029999392],"about_ca_topic_score_codex":0.00025194758,"about_ca_topic_score_gemma":0.00033531367,"teacher_disagreement_score":0.0015498372,"about_ca_system_score_codex":0.0003385554,"about_ca_system_score_gemma":0.00050045224,"threshold_uncertainty_score":0.007365048},"labels":[],"label_agreement":null},{"id":"W2135287429","doi":"10.1109/tcomm.2010.01.080142","title":"On space-time coding for free-space optical systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":68,"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":"Fading; Pairwise error probability; Free-space optical communication; Coding gain; Computer science; Coding (social sciences); Optical communication; Electronic engineering; Communications system; Space–time code; Optics; Decoding methods; Mathematics; Algorithm; Telecommunications; Physics; Engineering; Statistics","score_opus":0.021066653209366834,"score_gpt":0.25252979653940416,"score_spread":0.2314631433300373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135287429","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.026321823,0.008505869,0.9359242,0.0017250474,0.00029291073,0.000063046726,0.00017656315,0.00008972172,0.02690076],"genre_scores_gemma":[0.854259,0.014570454,0.11852046,0.000554556,0.0009490819,0.00036592374,0.0003097781,0.00009185054,0.010378894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864703,0.0005407734,0.00004162805,0.00008362775,0.0005527992,0.00013413242],"domain_scores_gemma":[0.99548584,0.003549593,0.00020394428,0.00022846252,0.0004851987,0.000046778525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490131,0.0010294155,0.0006117081,0.0009323517,0.0005619041,0.0013898285,0.00062374165,0.0012418482,0.0025005236],"category_scores_gemma":[0.0068020723,0.0003065676,0.00042876066,0.0016251683,0.001813677,0.0015879521,0.0013445504,0.0015792354,0.00050623866],"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.000035350306,0.00001221159,0.00024466938,0.000114664064,0.000015803862,0.0001415306,0.00012151512,0.34057865,0.0013608665,0.6336273,0.0019178524,0.021829618],"study_design_scores_gemma":[0.000008265465,0.000024664214,0.000113823655,0.000070665345,0.0000061670235,0.000070588154,0.000022103757,0.7901121,0.0004970342,0.20618844,0.0028696675,0.000016491416],"about_ca_topic_score_codex":0.0050304923,"about_ca_topic_score_gemma":0.0043671606,"teacher_disagreement_score":0.0050304923,"about_ca_system_score_codex":0.0019454899,"about_ca_system_score_gemma":0.0015193499,"threshold_uncertainty_score":0.014115632},"labels":[],"label_agreement":null},{"id":"W2135301077","doi":"10.1109/tcomm.2008.060123","title":"Fast convenient numerical computation of lognormal characteristic functions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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 Alberta","funders":"","keywords":"Log-normal distribution; Computation; Mathematics; Characteristic function (probability theory); Numerical integration; Function (biology); Applied mathematics; Expression (computer science); Numerical analysis; Closed-form expression; Simple (philosophy); Algorithm; Probability density function; Computer science; Mathematical analysis; Statistics","score_opus":0.021491841216344825,"score_gpt":0.25064158787164376,"score_spread":0.22914974665529894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135301077","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.0039768857,0.00010298969,0.9919274,0.000053193267,0.000026437152,0.000020036323,0.000047353325,0.00059170666,0.0032540655],"genre_scores_gemma":[0.14944962,0.00045238584,0.8425241,0.000076695556,0.00003441791,0.00014611363,0.00024603558,0.0005353526,0.006535223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994168,0.00009805535,0.00003062892,0.000049757386,0.00035416635,0.00005054384],"domain_scores_gemma":[0.9979499,0.00092210405,0.000119728946,0.00031177112,0.00063699886,0.00005950971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011569776,0.0006390836,0.0006616842,0.0009469976,0.00049507443,0.0009423735,0.0009824828,0.0005040416,0.006215561],"category_scores_gemma":[0.0072416374,0.00025458058,0.0003672414,0.00082089845,0.0004590632,0.0016178123,0.0011064959,0.0012405749,0.0027883467],"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.00018539788,0.00008893914,0.001978197,0.0003353656,0.00003442789,0.00041244755,0.00035855296,0.30172038,0.030761719,0.35542443,0.009521032,0.29917914],"study_design_scores_gemma":[0.000018622046,0.00001585112,0.0003043827,0.000027659557,0.0000051249963,0.00019855637,0.00003354677,0.93817085,0.0064731925,0.046986047,0.0077450224,0.000021115815],"about_ca_topic_score_codex":0.0018035115,"about_ca_topic_score_gemma":0.002842076,"teacher_disagreement_score":0.006215561,"about_ca_system_score_codex":0.0007350357,"about_ca_system_score_gemma":0.0012652503,"threshold_uncertainty_score":0.02079314},"labels":[],"label_agreement":null},{"id":"W2136335103","doi":"10.1109/tcomm.2010.04.090075","title":"An analytical approach for performance evaluation of BICM transmission over Nakagami-m fading channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Nakagami distribution; Algorithm; Phase-shift keying; Additive white Gaussian noise; Multipath propagation; Computer science; Bit error rate; Electronic engineering; Mathematics; Telecommunications; Decoding methods; White noise; Channel (broadcasting); Engineering","score_opus":0.062125052958099905,"score_gpt":0.34407638931417145,"score_spread":0.28195133635607156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136335103","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.04599931,0.001819721,0.9394995,0.0002332112,0.000055466735,0.00007078308,0.00012807334,0.0005301223,0.011663736],"genre_scores_gemma":[0.8744198,0.0027771208,0.12014062,0.00019008933,0.00007645889,0.00019685327,0.00014246174,0.0001248777,0.0019317821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986576,0.00054839876,0.000047596975,0.0000699206,0.00056668837,0.000109744986],"domain_scores_gemma":[0.9968472,0.0020298911,0.00030079586,0.0002707102,0.00052145316,0.000029908575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014114623,0.0012443915,0.00081511587,0.0013281622,0.00060764694,0.0008225557,0.0009630192,0.0012157421,0.0012843963],"category_scores_gemma":[0.01123685,0.00030253522,0.00042802154,0.001205213,0.0010587958,0.0011911177,0.000815589,0.0010758564,0.000586783],"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.00006236614,0.000047750702,0.0006371461,0.00020353872,0.000028679739,0.00015727247,0.00019101519,0.9166392,0.01398441,0.05102588,0.00058698055,0.016435757],"study_design_scores_gemma":[0.0000029016403,0.000072074174,0.00018958001,0.000037474623,0.000009624682,0.00016434782,0.000032407992,0.9895723,0.0042038127,0.005004151,0.0006958457,0.000015669046],"about_ca_topic_score_codex":0.0014989553,"about_ca_topic_score_gemma":0.0009725022,"teacher_disagreement_score":0.0014989553,"about_ca_system_score_codex":0.0011201479,"about_ca_system_score_gemma":0.0006766784,"threshold_uncertainty_score":0.008127272},"labels":[],"label_agreement":null},{"id":"W2137048573","doi":"10.1109/tcomm.2010.01.060685","title":"LDPC code design considerations for non-uniform channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Alberta","funders":"","keywords":"Low-density parity-check code; Concatenated error correction code; Transmitter; Decoding methods; Computer science; Channel capacity; Channel (broadcasting); Theoretical computer science; Code (set theory); Block code; Linear code; Turbo code; Integer programming; Forward error correction; Algorithm; Telecommunications","score_opus":0.08745486694520799,"score_gpt":0.32500439269825104,"score_spread":0.23754952575304306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137048573","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.03865232,0.0006695597,0.95370466,0.00032124048,0.00003970096,0.00004546215,0.00008725807,0.00011836399,0.006361396],"genre_scores_gemma":[0.74469215,0.0014755348,0.24976301,0.00018795006,0.00008048723,0.0002054945,0.00014153431,0.000077995726,0.003375689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00042844328,0.00004518891,0.00011404769,0.00025335545,0.00008468397],"domain_scores_gemma":[0.99633056,0.0022368177,0.00032051222,0.00049750565,0.00054295926,0.000071609575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010418097,0.00046136652,0.000480904,0.0004632366,0.00037412235,0.00078971544,0.0005836416,0.00067679293,0.0013151636],"category_scores_gemma":[0.005901254,0.0002744366,0.00024304716,0.0007821736,0.00095546833,0.00088550616,0.00063942693,0.0007348862,0.00030732615],"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.00012566538,0.000035247776,0.00082131266,0.00023915195,0.000024880736,0.00020727712,0.00011183585,0.75364196,0.013041394,0.18480577,0.0009749079,0.045970608],"study_design_scores_gemma":[0.00001697191,0.000067377325,0.00016849095,0.000023645689,0.000010790214,0.00016414661,0.000020837138,0.9406141,0.0055487123,0.05109748,0.0022529785,0.000014484787],"about_ca_topic_score_codex":0.0007132857,"about_ca_topic_score_gemma":0.0010598424,"teacher_disagreement_score":0.0013151636,"about_ca_system_score_codex":0.0006293395,"about_ca_system_score_gemma":0.0009487854,"threshold_uncertainty_score":0.005509734},"labels":[],"label_agreement":null},{"id":"W2138057312","doi":"10.1109/tcomm.2012.050912.110147","title":"Two Useful Bounds Related to Weighted Sums of Rayleigh Random Variables with Applications to Interference Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Cumulative distribution function; Mathematics; Rayleigh distribution; Random variable; Rayleigh scattering; Upper and lower bounds; Context (archaeology); Function (biology); Constant (computer programming); Probability density function; Applied mathematics; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis; Computer science; Physics","score_opus":0.023797860561646598,"score_gpt":0.27497698142799293,"score_spread":0.2511791208663463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138057312","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.004774111,0.005849884,0.9770314,0.0008222945,0.00057277,0.00005379089,0.00010874797,0.0001667058,0.010620286],"genre_scores_gemma":[0.43192294,0.020365342,0.52313405,0.0024606087,0.005989027,0.0007693213,0.0005635506,0.000782973,0.014012293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920896,0.0026347488,0.00039000847,0.0009824951,0.0029542507,0.00094877783],"domain_scores_gemma":[0.949101,0.037857376,0.003824488,0.0032179996,0.004990404,0.00100862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077445144,0.0038787406,0.0019281685,0.0053204508,0.001201964,0.0045065186,0.0032879347,0.002768537,0.0046566105],"category_scores_gemma":[0.069000825,0.0009818415,0.0017259751,0.004379207,0.004246609,0.008092532,0.0047415416,0.008721247,0.001675357],"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.0001914324,0.00012644695,0.0009949731,0.00056031754,0.00013974488,0.0005472961,0.0006426146,0.13908987,0.0073555023,0.75343454,0.007599479,0.08931788],"study_design_scores_gemma":[0.000028298928,0.0001543996,0.0009629485,0.00030781585,0.00013107824,0.0011497472,0.0001860408,0.5302732,0.0072198412,0.44102874,0.018370925,0.0001869844],"about_ca_topic_score_codex":0.0012368124,"about_ca_topic_score_gemma":0.0009905325,"teacher_disagreement_score":0.0077445144,"about_ca_system_score_codex":0.0025866427,"about_ca_system_score_gemma":0.0013439525,"threshold_uncertainty_score":0.04095745},"labels":[],"label_agreement":null},{"id":"W2138410336","doi":"10.1109/tcomm.2009.08.070350","title":"Optimality of threshold policies for transmission scheduling in correlated fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":60,"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":"Fading; Computer science; Network packet; Scheduling (production processes); Channel state information; Computer network; Transmission (telecommunications); Channel (broadcasting); Upper and lower bounds; Mathematical optimization; Dynamic priority scheduling; Wireless; Real-time computing; Mathematics; Telecommunications; Quality of service","score_opus":0.03317226548997994,"score_gpt":0.29012426326394336,"score_spread":0.25695199777396344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138410336","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.15842986,0.0004422931,0.835384,0.00043838745,0.000060690727,0.00008688026,0.00015795438,0.00019768077,0.004802266],"genre_scores_gemma":[0.9538571,0.00042729784,0.044290468,0.0000948003,0.000030556694,0.00008697565,0.00009972188,0.000062586136,0.0010504271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893755,0.0003772169,0.00006510619,0.00013238401,0.00020826353,0.00027941738],"domain_scores_gemma":[0.9942872,0.004182196,0.0006395752,0.00021024981,0.00035763707,0.0003232039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026263588,0.0008633297,0.0010674231,0.0006523013,0.0004154843,0.0015169004,0.00092490093,0.00077923905,0.0017221868],"category_scores_gemma":[0.008619329,0.00044264807,0.0004835844,0.00075144775,0.0012776885,0.0017796211,0.0010565756,0.0009997755,0.00022546298],"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.00020721737,0.00006440812,0.00039219222,0.00007602069,0.000025379784,0.000063657564,0.00006826568,0.9217289,0.002504816,0.0665916,0.00071175734,0.00756583],"study_design_scores_gemma":[0.000020163712,0.000040295992,0.00008349882,0.0000075968233,0.0000041081726,0.000010531404,0.000015042298,0.98029774,0.0006082973,0.01879609,0.00011023653,0.000006280234],"about_ca_topic_score_codex":0.0027970138,"about_ca_topic_score_gemma":0.0011787192,"teacher_disagreement_score":0.0027970138,"about_ca_system_score_codex":0.0018069304,"about_ca_system_score_gemma":0.0024869412,"threshold_uncertainty_score":0.01388967},"labels":[],"label_agreement":null},{"id":"W2138553475","doi":"10.1109/tcomm.2008.060298","title":"High-rate diversity across time and frequency using linear dispersion","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Orthogonal frequency-division multiplexing; Cyclic prefix; Fading; Guard interval; Computer science; Decoding methods; Diversity scheme; Algorithm; Telecommunications; Electronic engineering; Channel (broadcasting); Engineering","score_opus":0.04097787146392237,"score_gpt":0.27585412651282487,"score_spread":0.2348762550489025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138553475","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.18656719,0.0005346674,0.8062943,0.00021174335,0.000024096658,0.000021736283,0.00003415927,0.00034748664,0.0059646033],"genre_scores_gemma":[0.88396335,0.00022691608,0.11357134,0.000049484082,0.00003383293,0.00002390718,0.0000491048,0.000015971793,0.0020660975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.00009818191,0.000015137728,0.00006129383,0.00019044771,0.00004806729],"domain_scores_gemma":[0.9989298,0.000603692,0.00012689825,0.00016364135,0.0001501391,0.000025803722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035681413,0.00028263812,0.00027144692,0.0003964531,0.00031523488,0.00049632066,0.00035638033,0.00032407077,0.00059100834],"category_scores_gemma":[0.0016716525,0.00018017036,0.00018915927,0.00045280939,0.00045520088,0.0006327233,0.00068646384,0.00039565342,0.0002050849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046067388,0.00012444312,0.0047790967,0.000145632,0.00008209216,0.00038102915,0.00057537685,0.25798073,0.20513427,0.05653585,0.00089555304,0.4729053],"study_design_scores_gemma":[0.00004796884,0.00031396828,0.001290403,0.000031389325,0.0000297533,0.00053150044,0.00005437718,0.8731983,0.101887695,0.017848339,0.004715362,0.00005091765],"about_ca_topic_score_codex":0.0004942846,"about_ca_topic_score_gemma":0.0007970056,"teacher_disagreement_score":0.00059100834,"about_ca_system_score_codex":0.00031425396,"about_ca_system_score_gemma":0.0003829618,"threshold_uncertainty_score":0.0022800565},"labels":[],"label_agreement":null},{"id":"W2138680197","doi":"10.1109/26.843121","title":"Generalized Markov modeling for flat fading","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Fading; Additive white Gaussian noise; Fading distribution; Context (archaeology); Algorithm; Markov model; Markov chain; Computer science; White noise; Mathematics; Covariance; Markov process; Hidden Markov model; Mathematical optimization; Statistics; Speech recognition; Rayleigh fading; Decoding methods","score_opus":0.03993385808510536,"score_gpt":0.29143603720808386,"score_spread":0.2515021791229785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138680197","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.009373583,0.00022785169,0.98849535,0.000086130145,0.00003170044,0.00003586123,0.0001225163,0.00019366552,0.0014333766],"genre_scores_gemma":[0.6643305,0.002125028,0.31994405,0.00030710033,0.00023409506,0.00062060857,0.0011187645,0.00020784224,0.011112032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.0003927093,0.00004247069,0.00015399014,0.000313191,0.00013957646],"domain_scores_gemma":[0.99643195,0.0024309023,0.0003068772,0.0003953842,0.00034981227,0.00008510067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960008,0.0008722562,0.0011301058,0.00083405484,0.00047213043,0.0011071597,0.0012772012,0.00096297835,0.0031246268],"category_scores_gemma":[0.008114129,0.0004924853,0.0010056635,0.0008675589,0.00085737364,0.0014980921,0.0008461379,0.0014987141,0.00077722524],"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.000049393813,0.000016642973,0.00041979938,0.00005914513,0.000033868066,0.000121709236,0.000093953684,0.7307868,0.0011220537,0.25447544,0.00076550874,0.012055682],"study_design_scores_gemma":[0.000006758712,0.000010711652,0.00009223077,0.000008166999,0.000005617712,0.000026182915,0.0000056565477,0.9436982,0.00015566846,0.05538913,0.00059275655,0.000008885227],"about_ca_topic_score_codex":0.0088943355,"about_ca_topic_score_gemma":0.007244157,"teacher_disagreement_score":0.0088943355,"about_ca_system_score_codex":0.0012545609,"about_ca_system_score_gemma":0.0011831429,"threshold_uncertainty_score":0.017685115},"labels":[],"label_agreement":null},{"id":"W2138681964","doi":"10.1109/tcomm.2009.02.060671","title":"A new framework for soft decision equalization in frequency selective MIMO channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Simon Fraser University","funders":"","keywords":"Factor graph; MIMO; Equalization (audio); Computer science; Low-density parity-check code; Decoding methods; Algorithm; Computational complexity theory; Channel (broadcasting); Belief propagation; Multipath propagation; Adaptive equalizer; Multiuser detection; Bit error rate; Code division multiple access; Telecommunications","score_opus":0.04868654231185577,"score_gpt":0.3483338355548701,"score_spread":0.2996472932430143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138681964","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.00057331973,0.00009084226,0.99812883,0.00004860294,0.000030711042,0.000008009361,0.000018713636,0.00006059848,0.0010403799],"genre_scores_gemma":[0.15539336,0.0011107678,0.83583266,0.00022640167,0.00033050092,0.00016626113,0.00014442386,0.000098403456,0.0066973376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957675,0.00010453776,0.000016748594,0.0000700349,0.00018808544,0.0000438713],"domain_scores_gemma":[0.99973863,0.00011433922,0.000022433947,0.000039228355,0.00007012558,0.000015298563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047026147,0.00078779313,0.0005881363,0.00047517347,0.0003662071,0.0008890031,0.0010744117,0.0007829048,0.002456628],"category_scores_gemma":[0.0010043465,0.00027803122,0.0006107489,0.00057750795,0.0008581329,0.0011218447,0.000821748,0.0011864868,0.00073331455],"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.00004706511,0.00004102149,0.00017991145,0.00012223348,0.000042296375,0.00017443103,0.000080444115,0.47827446,0.0104534095,0.42371958,0.0026668909,0.08419829],"study_design_scores_gemma":[0.000011724176,0.000035934772,0.000071958384,0.0000124832,0.000011094723,0.00007839883,0.000009938097,0.90939224,0.002068564,0.08186883,0.006423118,0.000015656455],"about_ca_topic_score_codex":0.0015420875,"about_ca_topic_score_gemma":0.0019675181,"teacher_disagreement_score":0.002456628,"about_ca_system_score_codex":0.0005081892,"about_ca_system_score_gemma":0.0009531644,"threshold_uncertainty_score":0.008218288},"labels":[],"label_agreement":null},{"id":"W2139057119","doi":"10.1109/tcomm.2009.04.070230","title":"A novel zonal UWB receiver with superior performance","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":19,"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":"Rake receiver; Radio receiver design; Multipath propagation; Electronic engineering; Fading; Bandwidth (computing); Computer science; Interference (communication); Matched filter; Telecommunications; Channel (broadcasting); Engineering; Transmitter","score_opus":0.017088466368379074,"score_gpt":0.21940603475022236,"score_spread":0.20231756838184328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139057119","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.045655012,0.0020861095,0.9437718,0.00034068932,0.00016485919,0.00004589445,0.00007156033,0.0015755619,0.0062885834],"genre_scores_gemma":[0.4382866,0.0010758665,0.5461681,0.0005307064,0.00036556722,0.000071344344,0.00020961542,0.00008502218,0.013207208],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945253,0.00008420712,0.00002431283,0.00011562248,0.00026035612,0.00006302481],"domain_scores_gemma":[0.999335,0.00011312084,0.00011020615,0.000091192014,0.00031453575,0.000035953894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005416762,0.00047100306,0.0007385426,0.0005048222,0.00037770256,0.0009301614,0.00089601334,0.0010914427,0.0022541122],"category_scores_gemma":[0.0010168367,0.00028997168,0.00028432327,0.00056254177,0.0003041368,0.0012383898,0.0007965656,0.0006846472,0.0014900443],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007663099,0.00007892618,0.0018026223,0.00042261113,0.00009133081,0.00022558066,0.00015856096,0.0143678645,0.62080115,0.020661045,0.0028462922,0.3377778],"study_design_scores_gemma":[0.00027350866,0.00177961,0.0035094104,0.00010394604,0.0003411498,0.0052969223,0.00009276132,0.53365225,0.3887884,0.0042763483,0.061589323,0.00029637347],"about_ca_topic_score_codex":0.00037938997,"about_ca_topic_score_gemma":0.0007813936,"teacher_disagreement_score":0.0022541122,"about_ca_system_score_codex":0.00035138283,"about_ca_system_score_gemma":0.0006532385,"threshold_uncertainty_score":0.007540703},"labels":[],"label_agreement":null},{"id":"W2139188356","doi":"10.1109/tcomm.2011.082911.080032","title":"Gains in Error-Constrained Data Throughput from Extremely Fast Adaptation of Symbol Durations over Multi-Path Fading Channels: Coded and Uncoded Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fading; Throughput; Computer science; Symbol (formal); Communications system; Adaptation (eye); Error detection and correction; Algorithm; Path loss; Electronic engineering; Decoding methods; Telecommunications; Wireless; Engineering","score_opus":0.20257623037894787,"score_gpt":0.32058713034558406,"score_spread":0.11801089996663619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139188356","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.70290685,0.0012123459,0.28820983,0.00029905574,0.0000566733,0.0000364408,0.00015195053,0.0004592379,0.006667556],"genre_scores_gemma":[0.9954419,0.00014998976,0.004177923,0.00001875869,0.000010466814,0.000011215542,0.000017434288,0.000013969619,0.00015836713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932253,0.00016613118,0.000030032637,0.000073120485,0.00024143516,0.00016675882],"domain_scores_gemma":[0.99360025,0.0047391816,0.0005033491,0.00056447444,0.0004946617,0.00009803269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011542811,0.0007262055,0.0005156103,0.00039520505,0.00033510054,0.00075816736,0.00051979814,0.00047270188,0.00071767264],"category_scores_gemma":[0.009538974,0.00021129264,0.00023460733,0.0005761,0.0012163474,0.0013825162,0.00081471476,0.00072235713,0.00011598878],"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.00039538956,0.000050701983,0.0016994291,0.00009988294,0.0000414746,0.00022978672,0.00013768802,0.92756236,0.034257904,0.019183544,0.00021696494,0.01612488],"study_design_scores_gemma":[0.000029907857,0.00020524647,0.0023867856,0.00003322958,0.000045412427,0.00024709167,0.00008845988,0.9587481,0.028666375,0.008969454,0.0005243892,0.000055539535],"about_ca_topic_score_codex":0.0011344802,"about_ca_topic_score_gemma":0.0008376613,"teacher_disagreement_score":0.0011542811,"about_ca_system_score_codex":0.0011200925,"about_ca_system_score_gemma":0.00071783166,"threshold_uncertainty_score":0.008126855},"labels":[],"label_agreement":null},{"id":"W2139450743","doi":"10.1109/tcomm.2008.060056","title":"Effect of Channel Estimation Error on Bit Error Probability in OFDM Systems over Rayleigh and Ricean Fading Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Alberta","funders":"","keywords":"Fading; Orthogonal frequency-division multiplexing; Rayleigh fading; Bit error rate; Mathematics; Algorithm; Channel (broadcasting); Maximal-ratio combining; Statistics; Computer science; Electronic engineering; Telecommunications; Engineering; Decoding methods","score_opus":0.03729548531080171,"score_gpt":0.2932029443817528,"score_spread":0.25590745907095114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139450743","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.48594114,0.0016763676,0.5094972,0.00022953504,0.000052866468,0.00003001275,0.00008664441,0.000508208,0.0019779848],"genre_scores_gemma":[0.9766666,0.0006625639,0.022207443,0.000035003744,0.000017865874,0.000019417654,0.000042140477,0.00003830061,0.00031073907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730563,0.00094113545,0.00013425639,0.0002219136,0.001131175,0.0002658345],"domain_scores_gemma":[0.9560463,0.039444044,0.0018019853,0.00096817716,0.0016229573,0.000116638155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035204964,0.00072138227,0.0008410897,0.0006734671,0.0004245945,0.00074198126,0.000417424,0.0010304992,0.0005449685],"category_scores_gemma":[0.028302688,0.00032229975,0.00031017137,0.00083050947,0.0011822714,0.0017052015,0.0008830955,0.0006714503,0.00012996327],"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.0010094609,0.000054573902,0.008853722,0.00020942213,0.00008737051,0.00055702764,0.00030161388,0.90289026,0.01721504,0.0063078073,0.00022086693,0.06229288],"study_design_scores_gemma":[0.000011639659,0.00021475159,0.0029963716,0.00002678198,0.000051876894,0.00040995795,0.000041758023,0.9693989,0.025390754,0.0012553215,0.00016184535,0.000039989525],"about_ca_topic_score_codex":0.0014872963,"about_ca_topic_score_gemma":0.0010987954,"teacher_disagreement_score":0.0035204964,"about_ca_system_score_codex":0.00076940696,"about_ca_system_score_gemma":0.0005742235,"threshold_uncertainty_score":0.018618405},"labels":[],"label_agreement":null},{"id":"W2139813817","doi":"10.1109/tcomm.2009.03.070113","title":"New simple closed-form BER expressions for MRC diversity BPSK in correlated rayleigh fading and CCI","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Phase-shift keying; Rayleigh fading; Maximal-ratio combining; Fading; Additive white Gaussian noise; Fading distribution; Keying; Diversity combining; Bit error rate; Mathematics; Amplitude and phase-shift keying; Binary number; Electronic engineering; Interference (communication); Diversity scheme; Telecommunications; Algorithm; Computer science; White noise; Statistics; Channel (broadcasting); Decoding methods; Engineering; Arithmetic","score_opus":0.028540480061101103,"score_gpt":0.2782190233074575,"score_spread":0.2496785432463564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139813817","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.0029691735,0.0046120733,0.96843195,0.00040157954,0.0004057148,0.00017500916,0.00047262164,0.0009209779,0.021610927],"genre_scores_gemma":[0.24100241,0.016150722,0.69118094,0.001760763,0.0012633663,0.0015423513,0.0020124295,0.0017055568,0.04338148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748045,0.0006057613,0.00016324662,0.00025330542,0.0012532874,0.00024394668],"domain_scores_gemma":[0.99212235,0.004935742,0.00063319394,0.00060768705,0.0016290902,0.00007191931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00460948,0.0038735343,0.0023317735,0.002981549,0.0010314515,0.0033717363,0.0031540003,0.0024632954,0.02059246],"category_scores_gemma":[0.017622871,0.0011501493,0.0014081629,0.0027167175,0.0021116652,0.004382957,0.0015824717,0.0026141428,0.009437845],"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.00011650935,0.00019844042,0.00068803516,0.0019126612,0.00013777721,0.0007396732,0.00054908963,0.4534347,0.009311759,0.37403288,0.022948157,0.13593034],"study_design_scores_gemma":[0.00004638889,0.00015741934,0.00085543963,0.0007981738,0.00013220284,0.001483906,0.00021346155,0.79522556,0.006200257,0.17190517,0.02279017,0.00019182055],"about_ca_topic_score_codex":0.0017394447,"about_ca_topic_score_gemma":0.0047263564,"teacher_disagreement_score":0.02059246,"about_ca_system_score_codex":0.0033099297,"about_ca_system_score_gemma":0.001793715,"threshold_uncertainty_score":0.068888605},"labels":[],"label_agreement":null},{"id":"W2140891240","doi":"10.1109/tcomm.2008.060147","title":"Asymptotic Error Rate Analysis of Dual-Branch Diversity over Correlated Rician Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Rician fading; Dual (grammatical number); Selection (genetic algorithm); Diversity combining; Channel (broadcasting); Word error rate; Mathematics; Bit error rate; Diversity scheme; Diversity (politics); Computer science; Statistics; Algorithm; Applied mathematics; Telecommunications; Orthogonal frequency-division multiplexing; Fading; Speech recognition; Artificial intelligence","score_opus":0.03911144538716488,"score_gpt":0.26946030496944295,"score_spread":0.23034885958227808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140891240","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.04373492,0.0037366098,0.93787634,0.0003282641,0.000099136865,0.000046869463,0.00015821718,0.00038896155,0.013630749],"genre_scores_gemma":[0.9053686,0.0063412082,0.08051476,0.00026041173,0.00026163,0.00023172193,0.00046656784,0.00018675879,0.0063683074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754864,0.0006671931,0.00009717583,0.00019709443,0.0011361585,0.0003537716],"domain_scores_gemma":[0.9866223,0.0090024555,0.00096878054,0.0009086801,0.0023843057,0.00011354975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004331498,0.0019120505,0.001455751,0.0019967174,0.00058063824,0.001510958,0.0014751591,0.001256967,0.0032779905],"category_scores_gemma":[0.021554373,0.00048442822,0.0008196669,0.0018969235,0.0017689881,0.0022725933,0.002136689,0.0016240198,0.0010305763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027276113,0.000053658394,0.0015070764,0.0002988259,0.00011238238,0.00026729825,0.00028047315,0.831965,0.010023662,0.11656167,0.0015355088,0.0371216],"study_design_scores_gemma":[0.000010917886,0.000066910914,0.00056972884,0.000054376243,0.000038592232,0.00023823546,0.000057359088,0.97311753,0.0034495958,0.0217835,0.0005783171,0.000034845525],"about_ca_topic_score_codex":0.0021309918,"about_ca_topic_score_gemma":0.0011461148,"teacher_disagreement_score":0.004331498,"about_ca_system_score_codex":0.0018758043,"about_ca_system_score_gemma":0.0012229268,"threshold_uncertainty_score":0.022907436},"labels":[],"label_agreement":null},{"id":"W2141334121","doi":"10.1109/tcomm.2011.02.090283","title":"Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Toronto","funders":"","keywords":"Telecommunications link; Duality (order theory); Mathematical optimization; Computer science; Convex optimization; Power (physics); Constraint (computer-aided design); Regular polygon; Iterative method; Optimization problem; Mathematics; Computer network; Discrete mathematics","score_opus":0.037152539709148245,"score_gpt":0.25501200758629167,"score_spread":0.21785946787714341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141334121","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.020896973,0.00013760725,0.97002,0.000286875,0.000041901778,0.00004135212,0.00008614634,0.000110042136,0.008379053],"genre_scores_gemma":[0.6349782,0.00060917006,0.35678262,0.00057714013,0.00018540761,0.00033216228,0.00023765407,0.0003696456,0.005927896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587244,0.0015541351,0.0003165757,0.00072267966,0.0011028347,0.00043121062],"domain_scores_gemma":[0.995784,0.0023069826,0.00045711183,0.00054986816,0.00079713884,0.00010492887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029411104,0.0013623027,0.0018700011,0.00065219495,0.000599072,0.0030293914,0.0009931414,0.0014201034,0.0027744411],"category_scores_gemma":[0.011830484,0.00059221865,0.0005464556,0.0011025061,0.0015971739,0.0027311929,0.0023689892,0.0015134586,0.0013532129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029191052,0.00028776692,0.0018900277,0.00042325104,0.00015156083,0.00029892934,0.0002689498,0.43290308,0.032902706,0.3975029,0.003863388,0.12921564],"study_design_scores_gemma":[0.00006516307,0.00032017345,0.0010728948,0.00006368241,0.00004485863,0.0007252103,0.00014757813,0.7748927,0.038668793,0.18038274,0.0035699962,0.00004613796],"about_ca_topic_score_codex":0.0003298636,"about_ca_topic_score_gemma":0.000327549,"teacher_disagreement_score":0.0030293914,"about_ca_system_score_codex":0.0008064224,"about_ca_system_score_gemma":0.001542924,"threshold_uncertainty_score":0.015554309},"labels":[],"label_agreement":null},{"id":"W2141578547","doi":"10.1109/tcomm.2003.818099","title":"Techniques for early stopping and error detection in turbo decoding","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":71,"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":"Turbo code; Convolutional code; Decoding methods; Serial concatenated convolutional codes; Computer science; Redundancy (engineering); Algorithm; Cyclic redundancy check; Turbo; Encoder; Error detection and correction; Concatenated error correction code; Block code; Engineering","score_opus":0.0342274945587065,"score_gpt":0.2920470509046826,"score_spread":0.2578195563459761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141578547","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.003159386,0.00047323853,0.9952583,0.00007545106,0.000046647074,0.0000356306,0.000011932127,0.00024133059,0.0006980868],"genre_scores_gemma":[0.19202898,0.00077158905,0.80445427,0.0002055235,0.00021856154,0.00021225936,0.00007485269,0.00022643233,0.0018073801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99358636,0.0020624448,0.00050706975,0.00047538584,0.003024589,0.00034413705],"domain_scores_gemma":[0.9759783,0.014560065,0.0021988754,0.0020467958,0.0047917343,0.00042420925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006211462,0.0014543884,0.0019769657,0.0030047928,0.0008497544,0.0020834873,0.0018768045,0.0021759195,0.0009963685],"category_scores_gemma":[0.03780651,0.0006466028,0.00078068505,0.0013592902,0.0025899382,0.0029883916,0.0027100309,0.0028209356,0.00071879965],"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.00079920824,0.00011361607,0.0026197422,0.00066970504,0.00013006496,0.0004627406,0.0008624935,0.15919673,0.038723398,0.36474937,0.003576971,0.428096],"study_design_scores_gemma":[0.00007488004,0.0003102321,0.0006076964,0.00014860576,0.00004806007,0.0005037755,0.0000495161,0.8337238,0.04763549,0.10991493,0.0068233786,0.00015960002],"about_ca_topic_score_codex":0.0006083475,"about_ca_topic_score_gemma":0.0006806562,"teacher_disagreement_score":0.006211462,"about_ca_system_score_codex":0.0011972282,"about_ca_system_score_gemma":0.0015749219,"threshold_uncertainty_score":0.03284973},"labels":[],"label_agreement":null},{"id":"W2141983993","doi":"10.1109/tcomm.2002.1006559","title":"Optimum threshold detection in real-time scalable high-speed multi-wavelength optical code-division multiple-access LANs","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","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":"University of Toronto","funders":"","keywords":"Computer science; Division (mathematics); Code (set theory); Scalability; Code division multiple access; Electronic engineering; Maximization; Wavelength-division multiplexing; Wavelength; Computer network; Optics; Mathematics; Mathematical optimization; Engineering; Physics","score_opus":0.04787473468796925,"score_gpt":0.263618913198702,"score_spread":0.21574417851073274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141983993","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.16941269,0.00031568555,0.8278247,0.00021830581,0.000023416675,0.000025821922,0.000017652348,0.00027068253,0.0018909875],"genre_scores_gemma":[0.9421788,0.00012507684,0.056985017,0.000030299816,0.0000128985985,0.000021111971,0.00001298705,0.00001769012,0.00061602413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.000259478,0.000021488895,0.00008049868,0.00024488615,0.000094060444],"domain_scores_gemma":[0.99833715,0.0010290899,0.00027372479,0.000101948855,0.00020760845,0.000050491548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087793864,0.00026437998,0.00041387812,0.00028148713,0.00020717175,0.00061819295,0.0004802281,0.00040125108,0.0004353848],"category_scores_gemma":[0.0035314618,0.00019832939,0.00012981315,0.00037285252,0.0007128582,0.0010023874,0.00044833266,0.00045241223,0.000092892515],"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.00029691076,0.00006738369,0.0009133945,0.00009553574,0.000025625528,0.00024244798,0.00016705196,0.7853829,0.10314317,0.05718936,0.0006933517,0.05178285],"study_design_scores_gemma":[0.000012634474,0.000048131566,0.00010416068,0.0000030841518,0.0000034647521,0.00003745335,0.00001212567,0.9780393,0.013506282,0.007949529,0.0002767214,0.000007090853],"about_ca_topic_score_codex":0.0005054325,"about_ca_topic_score_gemma":0.0006006469,"teacher_disagreement_score":0.00087793864,"about_ca_system_score_codex":0.0006532002,"about_ca_system_score_gemma":0.0004254403,"threshold_uncertainty_score":0.004739344},"labels":[],"label_agreement":null},{"id":"W2142009305","doi":"10.1109/tcomm.2006.876875","title":"V-BLAST Without Optimal Ordering: Analytical Performance Evaluation for Rayleigh Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","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":"École de Technologie Supérieure; University of Ottawa","funders":"Medical Research Council","keywords":"Monte Carlo method; Rayleigh fading; Fading; Algorithm; Signal-to-noise ratio (imaging); Bit error rate; Computer science; Independent and identically distributed random variables; Mathematics; Statistics; Telecommunications; Random variable; Decoding methods","score_opus":0.04606116449402705,"score_gpt":0.3112665671320339,"score_spread":0.26520540263800685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142009305","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.07620873,0.0026450036,0.89525086,0.00035865087,0.000054023512,0.000099706835,0.00020364572,0.0010435181,0.024135893],"genre_scores_gemma":[0.8643606,0.0030317376,0.12639365,0.00015416666,0.0001066904,0.00012773274,0.00023284864,0.00021079983,0.00538191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983694,0.0006053034,0.00004611227,0.00006579996,0.0006899971,0.00022337609],"domain_scores_gemma":[0.9951959,0.0035208184,0.00028505942,0.00029609195,0.00063873886,0.0000633017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023988811,0.00142305,0.0011359358,0.001093285,0.000529538,0.0013065943,0.0007438974,0.0009450624,0.0027012469],"category_scores_gemma":[0.011438977,0.0003867213,0.00046895928,0.0015355326,0.0011479908,0.0014632472,0.0009868573,0.00068500807,0.00095544825],"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.00019111685,0.000046183504,0.0005702872,0.0001290056,0.000025739972,0.0001652312,0.000088721856,0.9400202,0.0051777065,0.025487619,0.0009630083,0.02713513],"study_design_scores_gemma":[0.000009869107,0.00008004112,0.00016506278,0.00001936225,0.000008368696,0.00014702663,0.000027181635,0.9910444,0.0026974145,0.005460569,0.0003268056,0.000013815687],"about_ca_topic_score_codex":0.0028583235,"about_ca_topic_score_gemma":0.0024450365,"teacher_disagreement_score":0.0028583235,"about_ca_system_score_codex":0.0011136391,"about_ca_system_score_gemma":0.001395485,"threshold_uncertainty_score":0.01268661},"labels":[],"label_agreement":null},{"id":"W2142813958","doi":"10.1109/tcomm.2010.083110.090070","title":"Lower Bounds to the Performance of Bit Synchronization for Bandwidth Efficient Pulse-Shaping","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Synchronizer; Upper and lower bounds; Intersymbol interference; Algorithm; Synchronization (alternating current); Pulse-amplitude modulation; Bandwidth (computing); Mathematics; Computer science; Cramér–Rao bound; Decoding methods; Pulse (music); Control theory (sociology); Topology (electrical circuits); Telecommunications; Detector; Combinatorics","score_opus":0.02082678238678572,"score_gpt":0.2703305581404115,"score_spread":0.24950377575362578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142813958","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.0144528225,0.0050743734,0.9657898,0.00055921124,0.00017480653,0.000063653395,0.00017237614,0.00044658125,0.01326633],"genre_scores_gemma":[0.62579083,0.00818933,0.35451612,0.0008115323,0.0007280049,0.0006025631,0.0009279549,0.0006550395,0.0077786017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993115,0.0014663525,0.00031685556,0.0006837113,0.0036507924,0.0007673527],"domain_scores_gemma":[0.96307063,0.029436965,0.0016009432,0.0019712823,0.003520562,0.00039963183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070472923,0.0028644975,0.0020047943,0.003000856,0.0010227711,0.003272354,0.0017972018,0.0027591216,0.0057959147],"category_scores_gemma":[0.043587327,0.000728243,0.0009334685,0.002826095,0.0025793347,0.0033716818,0.0028449828,0.0032527153,0.0022768886],"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.00050099974,0.00018325783,0.001120245,0.0009174565,0.00015462351,0.00021259375,0.00031032358,0.59788615,0.035132132,0.24695222,0.004786956,0.111843035],"study_design_scores_gemma":[0.000029726321,0.0002680988,0.00073635584,0.00025013852,0.000047293244,0.00030444658,0.00006497397,0.8941245,0.026694762,0.07274748,0.0046471534,0.00008507752],"about_ca_topic_score_codex":0.0010752273,"about_ca_topic_score_gemma":0.0012079616,"teacher_disagreement_score":0.0070472923,"about_ca_system_score_codex":0.0026030145,"about_ca_system_score_gemma":0.0019855024,"threshold_uncertainty_score":0.03727013},"labels":[],"label_agreement":null},{"id":"W2144165159","doi":"10.1109/tcomm.2009.11.060557","title":"A low-complexity generalized sphere decoding approach for underdetermined linear communication systems: performance and complexity evaluation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":35,"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":"Underdetermined system; Decoding methods; Computational complexity theory; MIMO; Algorithm; Mathematics; Cholesky decomposition; Reduction (mathematics); Communication complexity; Rank (graph theory); Computer science; Theoretical computer science; Eigenvalues and eigenvectors; Beamforming; Statistics; Combinatorics","score_opus":0.12489104865201725,"score_gpt":0.3292791908695439,"score_spread":0.20438814221752663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144165159","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.014547205,0.00043631834,0.98287946,0.00014293147,0.000026195905,0.000039550825,0.000044397086,0.00023633045,0.0016476567],"genre_scores_gemma":[0.29276955,0.0010264451,0.7041961,0.00010096824,0.000079878846,0.000102153244,0.00023363139,0.000055505814,0.0014357542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783295,0.0010551148,0.000080370424,0.00015756999,0.0007602207,0.000113776034],"domain_scores_gemma":[0.9969535,0.0017338922,0.00019998109,0.0004277703,0.0005963351,0.00008839485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585241,0.0012378042,0.0010338012,0.0008245328,0.00045930786,0.0011018178,0.0006529904,0.00083205407,0.0013939663],"category_scores_gemma":[0.0057432665,0.00024706227,0.00046316683,0.0012512285,0.0009711846,0.0012380035,0.0014474032,0.0008299142,0.00054105796],"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.00045487398,0.00010279706,0.0012085644,0.00029454054,0.00014526365,0.0002272502,0.00023957399,0.6217228,0.014838179,0.058959737,0.0027501378,0.29905626],"study_design_scores_gemma":[0.000022447482,0.00010821823,0.00015863343,0.000009440109,0.000012601892,0.00018603398,0.000023345317,0.9875416,0.0058196723,0.0049501243,0.0011403861,0.00002751459],"about_ca_topic_score_codex":0.002869428,"about_ca_topic_score_gemma":0.003717392,"teacher_disagreement_score":0.002869428,"about_ca_system_score_codex":0.0007989583,"about_ca_system_score_gemma":0.0016766831,"threshold_uncertainty_score":0.008242369},"labels":[],"label_agreement":null},{"id":"W2144216682","doi":"10.1109/tcomm.2008.060596","title":"Statistical analysis of mobile radio reception: an extension of clarke's model","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autocorrelation; Fading; Wireless; Spectral density; Channel (broadcasting); Computer science; Statistical model; Electronic engineering; Doppler effect; Telecommunications; Statistical physics; Algorithm; Mathematics; Statistics; Engineering; Physics; Artificial intelligence","score_opus":0.041698612710820065,"score_gpt":0.2898219552091321,"score_spread":0.24812334249831206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144216682","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.0050483253,0.00020517079,0.99266374,0.00012692461,0.000034170745,0.000018006582,0.000050742572,0.00007783083,0.0017750771],"genre_scores_gemma":[0.7882668,0.0036100082,0.19687437,0.00034750978,0.0005606221,0.00022864396,0.0003611306,0.00024030243,0.009510678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987931,0.0003770865,0.00004273681,0.00020106521,0.00047282403,0.00011314396],"domain_scores_gemma":[0.99573416,0.0028398791,0.00047635054,0.00031694616,0.0005673131,0.00006544191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013974466,0.0008273121,0.00081781397,0.00089297123,0.0002595982,0.00093751645,0.0016702993,0.0008115774,0.001466582],"category_scores_gemma":[0.0067294147,0.0004812704,0.0006860707,0.0015032107,0.0013501117,0.0017786252,0.00077492965,0.0013464637,0.0006347331],"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.000055237437,0.000035975652,0.0016481319,0.00010749485,0.000043165175,0.00026910723,0.0001561546,0.6652496,0.0035177148,0.30445823,0.0019084491,0.022550754],"study_design_scores_gemma":[0.0000051800466,0.00003530809,0.00034368597,0.0000075782796,0.000011414631,0.000117760006,0.00001071177,0.9650797,0.00052354526,0.03245752,0.0013884197,0.000019128165],"about_ca_topic_score_codex":0.0021032167,"about_ca_topic_score_gemma":0.0012539165,"teacher_disagreement_score":0.0021032167,"about_ca_system_score_codex":0.0008266569,"about_ca_system_score_gemma":0.0008777627,"threshold_uncertainty_score":0.007390499},"labels":[],"label_agreement":null},{"id":"W2144406178","doi":"10.1109/tcomm.2009.04.070075","title":"Exact method for the error probability calculation of three-dimensional signal constellations","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":23,"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":"Additive white Gaussian noise; Upper and lower bounds; Mathematics; Algorithm; Computation; Constellation diagram; White noise; Applied mathematics; Channel (broadcasting); Function (biology); Constellation; SIGNAL (programming language); Statistics; Mathematical analysis; Computer science; Telecommunications; Bit error rate; Physics; Decoding methods","score_opus":0.057339579943286784,"score_gpt":0.3285521754032389,"score_spread":0.27121259545995213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144406178","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.0033378252,0.00010828763,0.9952721,0.000015412552,0.000012558129,0.00000945708,0.00001986637,0.00020897447,0.0010154833],"genre_scores_gemma":[0.37757346,0.0006682121,0.61843127,0.000087631124,0.00003399625,0.00014866763,0.00018017544,0.00020748231,0.0026690708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907744,0.00020875625,0.000046052515,0.00007164946,0.0005365051,0.00005950319],"domain_scores_gemma":[0.9985751,0.0007055971,0.00009458005,0.00032435355,0.0002775039,0.000022859578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009683823,0.0005395336,0.00076276186,0.0010964157,0.0003177665,0.00093897135,0.00111927,0.00066741527,0.0033253299],"category_scores_gemma":[0.005532564,0.0002871444,0.000520176,0.0010444919,0.0006640637,0.0015340325,0.0010814397,0.00086156867,0.00095404114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010031859,0.000028396396,0.0005649444,0.0001678459,0.000043063694,0.00023231885,0.00016129162,0.77053654,0.009447587,0.12214764,0.00100751,0.0955625],"study_design_scores_gemma":[0.0000049228447,0.000014518999,0.00011451137,0.0000131387815,0.0000037289794,0.000116073876,0.000010652172,0.9822948,0.0025390212,0.014057899,0.00082058954,0.000010129972],"about_ca_topic_score_codex":0.0009914596,"about_ca_topic_score_gemma":0.00067923183,"teacher_disagreement_score":0.0033253299,"about_ca_system_score_codex":0.0006090539,"about_ca_system_score_gemma":0.00064003933,"threshold_uncertainty_score":0.0111243725},"labels":[],"label_agreement":null},{"id":"W2144624975","doi":"10.1109/tcomm.2009.10.080090","title":"Strict suboptimality of selection amplify-and-forward relaying under global channel information","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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 Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Channel (broadcasting); Upper and lower bounds; Outage probability; Constant (computer programming); Relay channel; Mathematical optimization; Power (physics); Computer science; Mathematics; Control theory (sociology); Telecommunications; Fading; Physics","score_opus":0.047567399892368856,"score_gpt":0.30338906514648195,"score_spread":0.2558216652541131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144624975","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.16497259,0.0010324616,0.8126093,0.0007321808,0.0000805974,0.000118051976,0.0003002229,0.00036481427,0.019789806],"genre_scores_gemma":[0.9747667,0.0005646169,0.022503514,0.00013172651,0.000033372635,0.00006487389,0.00010517498,0.000046725178,0.0017833691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979699,0.0008986792,0.00013626234,0.00029345448,0.00039857352,0.0003031274],"domain_scores_gemma":[0.9883691,0.009284185,0.00085423497,0.00060249167,0.0007075208,0.0001824203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003485431,0.0014465399,0.0015012166,0.00069485686,0.00063139416,0.0019143333,0.00070162595,0.001014251,0.0015250767],"category_scores_gemma":[0.013921572,0.0006168428,0.00050800154,0.0008169798,0.0026684604,0.0015946164,0.0015154046,0.0010454197,0.00038165084],"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.00048457962,0.000046903617,0.0021028153,0.00032180647,0.00013114774,0.00060359325,0.00047950807,0.73614043,0.018996505,0.21308023,0.0023767285,0.025235793],"study_design_scores_gemma":[0.00003826237,0.00014605171,0.0005631542,0.000036458434,0.00004366734,0.00022253009,0.00006484399,0.9185656,0.0058854655,0.07386587,0.00053731084,0.000030746614],"about_ca_topic_score_codex":0.0020111506,"about_ca_topic_score_gemma":0.0021924973,"teacher_disagreement_score":0.003485431,"about_ca_system_score_codex":0.0016782937,"about_ca_system_score_gemma":0.0021987045,"threshold_uncertainty_score":0.018432915},"labels":[],"label_agreement":null},{"id":"W2144857775","doi":"10.1109/tcomm.2012.100512.110649","title":"Power Allocation in Two-Dimensional Superposition Modulation Based Cooperative Wireless Communication System","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 British Columbia","funders":"","keywords":"Rayleigh fading; Spectral efficiency; Superposition principle; Link adaptation; Computer science; Transmission (telecommunications); Modulation (music); Relay; Electronic engineering; Wireless; Bit error rate; Symbol rate; Node (physics); Fading; Quadrature amplitude modulation; Communications system; Power (physics); Topology (electrical circuits); Computer network; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.037498846544489345,"score_gpt":0.2950147410092691,"score_spread":0.25751589446477974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144857775","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.16476865,0.00068307994,0.82766867,0.00033224304,0.00003439404,0.00005857574,0.000042973043,0.00016842784,0.0062430315],"genre_scores_gemma":[0.9741037,0.00021987253,0.024712602,0.000050000443,0.000018628254,0.000044873992,0.000015589385,0.000005250278,0.0008294243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.00042177105,0.000039985964,0.00010537853,0.00024324116,0.00007631204],"domain_scores_gemma":[0.9991762,0.00042330922,0.00014343554,0.000079774836,0.00014486343,0.00003249113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007510465,0.0004986573,0.0006451765,0.00035138536,0.0005646682,0.00057390187,0.00060330617,0.0006812227,0.00057786977],"category_scores_gemma":[0.0012878274,0.0002795351,0.00029296838,0.0009234542,0.0010581118,0.00084120035,0.0008582703,0.00034554134,0.00015907503],"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.00035589735,0.00011296741,0.0029155083,0.00020769211,0.00010978475,0.0008995715,0.0006375022,0.7913113,0.08598374,0.051701944,0.0012537506,0.0645103],"study_design_scores_gemma":[0.00001888446,0.00009693212,0.00027056146,0.000007446889,0.000018407249,0.00014272062,0.000028087305,0.99030775,0.0030588477,0.0056726015,0.0003618555,0.000015915084],"about_ca_topic_score_codex":0.00093275774,"about_ca_topic_score_gemma":0.00119022,"teacher_disagreement_score":0.00093275774,"about_ca_system_score_codex":0.00066762837,"about_ca_system_score_gemma":0.00037602155,"threshold_uncertainty_score":0.00484401},"labels":[],"label_agreement":null},{"id":"W2145502169","doi":"10.1109/tcomm.2007.902531","title":"Stochastic Differential Equation Theory Applied to Wireless Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fading; Autoregressive model; Wireless; Multipath propagation; Stochastic process; Stochastic differential equation; Computer science; Channel (broadcasting); Rayleigh fading; Stochastic modelling; Markov process; Channel state information; Mathematics; Applied mathematics; Telecommunications; Statistics","score_opus":0.025354993590031995,"score_gpt":0.2581639917742672,"score_spread":0.2328089981842352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145502169","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.0038000427,0.0053294636,0.96683675,0.0017319843,0.00059075723,0.00003324122,0.00025039594,0.00015139014,0.021276021],"genre_scores_gemma":[0.68870234,0.027341446,0.21872304,0.0014361145,0.0024104987,0.00054409355,0.0008746753,0.000293587,0.0596742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996381,0.00014534869,0.000019844665,0.00004628293,0.000120896104,0.000029397794],"domain_scores_gemma":[0.9994148,0.00034677814,0.000053486387,0.00003484245,0.00012732594,0.000022720142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056412036,0.00084267324,0.0008426925,0.0005998496,0.00038110476,0.0011896171,0.0005569116,0.00089082617,0.0038400257],"category_scores_gemma":[0.0016681778,0.00027558347,0.00090246083,0.0010425692,0.00093112263,0.0009761345,0.0009135528,0.0017684123,0.00090456137],"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.000009164819,0.000013468585,0.00044180432,0.00013814551,0.00004809336,0.00016888486,0.000104788814,0.19535093,0.001024781,0.7786933,0.0054459306,0.018560676],"study_design_scores_gemma":[0.000008760551,0.000013895665,0.00023693904,0.00002949246,0.00001097011,0.000074990196,0.000029065586,0.63985574,0.00023166245,0.34460214,0.014891988,0.000014374848],"about_ca_topic_score_codex":0.004638842,"about_ca_topic_score_gemma":0.0021186098,"teacher_disagreement_score":0.004638842,"about_ca_system_score_codex":0.0009837778,"about_ca_system_score_gemma":0.00096409,"threshold_uncertainty_score":0.012846172},"labels":[],"label_agreement":null},{"id":"W2145605192","doi":"10.1109/tcomm.2011.020411.090488","title":"Tracking Nonlinear Noisy Dynamic Systems over Noisy Communication Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Target Tracking and Data Fusion in 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":"University of Ottawa","funders":"","keywords":"Bounded function; Nonlinear system; Tracking (education); Control theory (sociology); Lipschitz continuity; Computer science; Tracking error; Binary number; Transmission (telecommunications); SIGNAL (programming language); Channel (broadcasting); Stochastic process; Mathematics; Noise measurement; Algorithm; Telecommunications; Artificial intelligence; Mathematical analysis; Statistics; Physics","score_opus":0.054303057029064274,"score_gpt":0.2782233065486557,"score_spread":0.2239202495195914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145605192","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.062373158,0.0004050439,0.93485093,0.00017701952,0.000033534518,0.000023649445,0.00005966816,0.00013293866,0.0019440753],"genre_scores_gemma":[0.9690467,0.0008251181,0.025935467,0.000049595452,0.00007735246,0.000081147286,0.000092363065,0.000029654759,0.0038626506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.0002643045,0.00004712916,0.00023126065,0.00036017055,0.00008525334],"domain_scores_gemma":[0.997869,0.0011656599,0.00055892713,0.00015950158,0.00019991714,0.000046861944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177086,0.00063393,0.0009064599,0.0003650215,0.00048293787,0.0008693264,0.0007089468,0.00073902763,0.00061743014],"category_scores_gemma":[0.0048455293,0.0003022265,0.00028779314,0.0007396132,0.0012246823,0.0011596074,0.0012399364,0.0006339248,0.00019339785],"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.00011308168,0.000013863113,0.00049780955,0.000102482416,0.000023091829,0.00012111213,0.00008310383,0.956899,0.004840883,0.02506649,0.00015957115,0.012079561],"study_design_scores_gemma":[0.0000123562295,0.00004752314,0.00024651378,0.0000058646574,0.000008704031,0.00003848993,0.000018902121,0.9872056,0.0017009232,0.010356101,0.00034960007,0.00000942294],"about_ca_topic_score_codex":0.0021643816,"about_ca_topic_score_gemma":0.0014077734,"teacher_disagreement_score":0.0021643816,"about_ca_system_score_codex":0.0006329513,"about_ca_system_score_gemma":0.0005870098,"threshold_uncertainty_score":0.00538218},"labels":[],"label_agreement":null},{"id":"W2145845506","doi":"10.1109/tcomm.2012.051412.110343","title":"Exact Analysis of Multihop Amplify-and-Forward Relaying Systems over General Fading Links","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"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":"Fading; Probability density function; Ergodic theory; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel (broadcasting); Outage probability; Computer science; Spread spectrum; Probability of error; Communications system; Fading distribution; Mathematics; Telecommunications; Algorithm; Rayleigh fading; Statistics; Mathematical analysis; Combinatorics","score_opus":0.06770129181002757,"score_gpt":0.32344586955251564,"score_spread":0.25574457774248804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145845506","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.054888353,0.001264534,0.9335333,0.0003330598,0.000051093815,0.00004618645,0.00010451237,0.00015766846,0.009621243],"genre_scores_gemma":[0.9579418,0.00139689,0.035157748,0.000108342676,0.00007237145,0.000083415885,0.00011400252,0.00007617874,0.005049288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00012758258,0.000027776267,0.000052228224,0.00033737996,0.00011600208],"domain_scores_gemma":[0.9977991,0.0013041736,0.00022572868,0.00019541525,0.0004226379,0.000052906147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147045,0.0007726976,0.0008080628,0.0008963934,0.00040258057,0.0010734714,0.0010343884,0.0010022197,0.0020732682],"category_scores_gemma":[0.006455451,0.00039905615,0.0005685548,0.0009592308,0.0011525325,0.0026139165,0.00091026985,0.0010604686,0.0003590822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035862475,0.000015401769,0.00034351286,0.000097299584,0.00002087143,0.0001693275,0.00015212952,0.84856105,0.0025056277,0.13482314,0.00061049906,0.01266531],"study_design_scores_gemma":[0.0000036720992,0.0000085292595,0.000087340624,0.0000066075477,0.0000032391117,0.00006020807,0.00001628388,0.9744305,0.0002757106,0.024886921,0.00021492441,0.00000611395],"about_ca_topic_score_codex":0.0027365661,"about_ca_topic_score_gemma":0.0016511416,"teacher_disagreement_score":0.0027365661,"about_ca_system_score_codex":0.0018056845,"about_ca_system_score_gemma":0.0012953244,"threshold_uncertainty_score":0.0131011605},"labels":[],"label_agreement":null},{"id":"W2147072043","doi":"10.1109/tcomm.2004.836596","title":"Distribution Functions of Selection Combiner Output in Equally Correlated Rayleigh, Rician, and Nakagami-<tex>$m$</tex>Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":273,"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":"Rician fading; Nakagami distribution; Rayleigh fading; Fading; Fading distribution; Cumulative distribution function; Mathematics; Statistics; Signal-to-noise ratio (imaging); Channel capacity; Rayleigh distribution; Channel (broadcasting); Algorithm; Telecommunications; Probability density function; Computer science","score_opus":0.03565044146017216,"score_gpt":0.2724362698078587,"score_spread":0.23678582834768652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147072043","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.3381652,0.00054515275,0.6473097,0.00034544553,0.000020077629,0.0000503661,0.0005703421,0.00055603194,0.012437764],"genre_scores_gemma":[0.9738626,0.0006117454,0.022489145,0.000050474962,0.000026894062,0.00006322085,0.00028284942,0.000072763425,0.0025402019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.00010901504,0.00001448512,0.000044332624,0.00013950313,0.00007223315],"domain_scores_gemma":[0.996326,0.0024465173,0.00044649138,0.00019937856,0.00051093067,0.000070585695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012073755,0.00078037864,0.00044375492,0.0007583401,0.00027333465,0.0008576428,0.00052208646,0.00046483363,0.0022743032],"category_scores_gemma":[0.0044196392,0.0002535767,0.00041883602,0.0010290904,0.0010375566,0.0008116099,0.0005354722,0.0005622909,0.0007553765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032121188,0.00004391882,0.0070862626,0.00016965762,0.000060283026,0.00071560487,0.000465653,0.8411961,0.024710877,0.092183255,0.0010646657,0.031982385],"study_design_scores_gemma":[0.000017070714,0.00004693549,0.0030576522,0.000031181684,0.000024208523,0.0002939004,0.00006478326,0.96731013,0.0098554315,0.018746302,0.00051222864,0.00004016803],"about_ca_topic_score_codex":0.0016236487,"about_ca_topic_score_gemma":0.001062931,"teacher_disagreement_score":0.0022743032,"about_ca_system_score_codex":0.0009474791,"about_ca_system_score_gemma":0.0006507195,"threshold_uncertainty_score":0.0076082945},"labels":[],"label_agreement":null},{"id":"W2147213649","doi":"10.1109/tcomm.2004.838739","title":"Parametric Construction of Nyquist-I Pulses","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":120,"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; University of Alberta","funders":"","keywords":"Nyquist ISI criterion; Intersymbol interference; Pulse shaping; Raised-cosine filter; Nyquist–Shannon sampling theorem; Bandwidth (computing); Parametric statistics; Nyquist frequency; Mathematics; Nyquist stability criterion; Pulse (music); Frequency domain; Optics; Electronic engineering; Algorithm; Telecommunications; Computer science; Physics; Mathematical analysis; Engineering; Low-pass filter; Statistics","score_opus":0.021167871986279375,"score_gpt":0.23903445973199233,"score_spread":0.21786658774571296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147213649","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.09955068,0.00041825822,0.88045233,0.00012796168,0.000091765825,0.00010081513,0.00010780079,0.00032599966,0.018824419],"genre_scores_gemma":[0.6385812,0.00067381543,0.3535451,0.000079327685,0.00003794192,0.00021459052,0.00014565224,0.000091659036,0.0066306633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996588,0.000076791126,0.000017200431,0.000041454674,0.0001613234,0.000044387427],"domain_scores_gemma":[0.9992557,0.00021484256,0.00012984737,0.00015100557,0.00018040283,0.00006828649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047786866,0.00027172084,0.00027085928,0.00055743253,0.0005738646,0.0006687629,0.0006483189,0.0003610238,0.0015109241],"category_scores_gemma":[0.0015482744,0.00024529276,0.00022505943,0.00046017297,0.0005744119,0.00079674355,0.0008337811,0.0008782608,0.00032073035],"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.0002208959,0.00008969971,0.0010225575,0.00024396398,0.000027124772,0.0004895173,0.00063361204,0.04491209,0.18134737,0.6524904,0.001194217,0.117328644],"study_design_scores_gemma":[0.000046192315,0.0004601677,0.00090925547,0.00010253727,0.000030659583,0.0019394296,0.0002025637,0.5079906,0.27391252,0.17323826,0.04105795,0.00010982886],"about_ca_topic_score_codex":0.0001227022,"about_ca_topic_score_gemma":0.00013782486,"teacher_disagreement_score":0.0015109241,"about_ca_system_score_codex":0.00042371,"about_ca_system_score_gemma":0.00036896265,"threshold_uncertainty_score":0.0050545335},"labels":[],"label_agreement":null},{"id":"W2147317567","doi":"10.1109/tcomm.2009.09.070577","title":"Antenna/relay selection for coded cooperative networks with AF relaying","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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":"Relay; Computer science; Bit error rate; Selection (genetic algorithm); Transmission (telecommunications); Antenna (radio); Phase-shift keying; Relay channel; Electronic engineering; Reliability (semiconductor); Cooperative diversity; Telecommunications; Decoding methods; Topology (electrical circuits); Fading; Engineering; Power (physics); Electrical engineering","score_opus":0.04437427375651506,"score_gpt":0.2944433003551277,"score_spread":0.2500690265986127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147317567","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.06959992,0.0007349377,0.9245744,0.00013784238,0.000031318516,0.000037416572,0.000019861258,0.00008049511,0.004783866],"genre_scores_gemma":[0.9499201,0.00051555183,0.0479267,0.000053471686,0.00003645291,0.00005869525,0.000017500357,0.0000148415575,0.0014567481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993923,0.00029711117,0.000014181667,0.000054284417,0.00018088886,0.00006130189],"domain_scores_gemma":[0.9982253,0.0012296312,0.00015578358,0.00011669564,0.00024647542,0.00002620018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381343,0.00073222315,0.0004477139,0.00033420528,0.000335526,0.00065043266,0.0007201655,0.0006651398,0.00063764444],"category_scores_gemma":[0.0035846839,0.00021828411,0.0003582228,0.0005377639,0.0009102265,0.0008297406,0.00053020474,0.0005046346,0.00018678718],"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.00007872424,0.00002889322,0.00041135022,0.0000679324,0.00002479605,0.00035269142,0.0001329698,0.9295697,0.008067072,0.04746857,0.0004842612,0.013313032],"study_design_scores_gemma":[0.0000050267677,0.00003590094,0.000060003043,0.0000044238172,0.000008218375,0.00007234899,0.00001784268,0.9939359,0.00068501255,0.0049098106,0.00026039238,0.000005210269],"about_ca_topic_score_codex":0.0012723276,"about_ca_topic_score_gemma":0.001384879,"teacher_disagreement_score":0.0012723276,"about_ca_system_score_codex":0.00077158393,"about_ca_system_score_gemma":0.00047391013,"threshold_uncertainty_score":0.0065479875},"labels":[],"label_agreement":null},{"id":"W2147600250","doi":"10.1109/tcomm.2013.072913.120881","title":"Opportunistic Spectrum Access Using Partially Overlapping Channels: Graphical Game and Uncoupled Learning","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":77,"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":"Throughput; Computer science; Interference (communication); Potential game; Channel (broadcasting); Selection (genetic algorithm); Aggregate (composite); Convergence (economics); Heterogeneous network; Computer network; Game theory; Point (geometry); Distributed computing; Mathematical optimization; Wireless; Wireless network; Nash equilibrium; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.06002980338865202,"score_gpt":0.2928954113969637,"score_spread":0.23286560800831166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147600250","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.08500165,0.00013970026,0.90919274,0.00028763514,0.000024451689,0.00008915374,0.00004406399,0.0000986603,0.0051218593],"genre_scores_gemma":[0.9655748,0.00011197465,0.03236393,0.00006336761,0.000013626573,0.000099501565,0.000021691754,0.000010750862,0.0017404079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861133,0.00071250857,0.00004188484,0.00019980062,0.00023951507,0.00019496145],"domain_scores_gemma":[0.99732864,0.001920693,0.0002876334,0.00013291188,0.00015168336,0.000178438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493613,0.0009342898,0.000956006,0.00049323577,0.0004907937,0.0010581127,0.0014332489,0.0010545604,0.0010688921],"category_scores_gemma":[0.0041162246,0.00035673523,0.00053262844,0.00056157506,0.0017002036,0.0017795652,0.0015545075,0.0010157184,0.000121998106],"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.0001604649,0.00008110427,0.0006369655,0.00006215729,0.000053169348,0.00019197004,0.00011708937,0.9350416,0.0017303292,0.045523167,0.0004138924,0.01598808],"study_design_scores_gemma":[0.00001951228,0.00003619231,0.00007031984,0.000003888383,0.0000070165734,0.000032002557,0.000015986081,0.985897,0.000231784,0.01348838,0.00019111688,0.0000068057566],"about_ca_topic_score_codex":0.0024913324,"about_ca_topic_score_gemma":0.00238857,"teacher_disagreement_score":0.0024913324,"about_ca_system_score_codex":0.0011802579,"about_ca_system_score_gemma":0.0010030722,"threshold_uncertainty_score":0.008563459},"labels":[],"label_agreement":null},{"id":"W2147646614","doi":"10.1109/tcomm.2009.09.080077","title":"Data detection and kalman estimation for multiple space-time trellis codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","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":"Trellis (graph); Kalman filter; Algorithm; Fading; Computer science; Convolutional code; Channel (broadcasting); Maximum a posteriori estimation; Sequential estimation; Space–time trellis code; Mathematics; Decoding methods; Statistics; Maximum likelihood; Artificial intelligence; Telecommunications; Block code; Concatenated error correction code","score_opus":0.04166796513633517,"score_gpt":0.2989855706011391,"score_spread":0.257317605464804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147646614","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.004902464,0.00010944219,0.99451363,0.000034142446,0.000015892998,0.000007020453,0.000014461938,0.00018348929,0.00021946785],"genre_scores_gemma":[0.30412364,0.0003697341,0.6927041,0.00007129065,0.0000729562,0.00010700207,0.00018919392,0.000058707385,0.0023034168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991166,0.00016509635,0.000059952672,0.00021845177,0.00035717548,0.00008271094],"domain_scores_gemma":[0.99760336,0.0013350851,0.00027280796,0.0002702511,0.00047659525,0.000041926683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082450925,0.00062681816,0.0007243293,0.000809622,0.00050300296,0.0006954826,0.0007264391,0.0006351749,0.00086384034],"category_scores_gemma":[0.0056679756,0.00042846447,0.00055769266,0.000823188,0.00059792266,0.001457358,0.0007645688,0.0010576335,0.00042938095],"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.00033707256,0.00005212374,0.002525129,0.00016593745,0.000109027205,0.00014206856,0.00021950252,0.44588724,0.024584675,0.038382694,0.0013625316,0.48623195],"study_design_scores_gemma":[0.000014213335,0.00005117691,0.00035063276,0.000009063982,0.0000145934055,0.00007539144,0.000013821607,0.98285884,0.009822993,0.005192261,0.0015733741,0.000023659552],"about_ca_topic_score_codex":0.0050837356,"about_ca_topic_score_gemma":0.004837004,"teacher_disagreement_score":0.0050837356,"about_ca_system_score_codex":0.0007200745,"about_ca_system_score_gemma":0.0016032127,"threshold_uncertainty_score":0.010108292},"labels":[],"label_agreement":null},{"id":"W2148095386","doi":"10.1109/tcomm.2004.838718","title":"A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"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":"Low-density parity-check code; Decoding methods; Algorithm; Noisy-channel coding theorem; Additive white Gaussian noise; Gaussian; Mathematics; Computer science; Variable (mathematics); Turbo code; Limit (mathematics); Code (set theory); Range (aeronautics); Node (physics); Convergence (economics); Random variable; White noise; Statistics; Error floor","score_opus":0.05692893816505234,"score_gpt":0.3093812915881105,"score_spread":0.25245235342305816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148095386","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.010509953,0.00009745061,0.98714894,0.000071246635,0.000017626271,0.000018306446,0.000046575475,0.00013056735,0.0019592894],"genre_scores_gemma":[0.41339743,0.000599157,0.5824735,0.00015012613,0.00004452553,0.00018323612,0.00020565809,0.00020037538,0.002745939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993741,0.00018011148,0.000033013483,0.00007211983,0.00030395394,0.0000367889],"domain_scores_gemma":[0.998379,0.00073270925,0.00019318395,0.00030305766,0.00035480666,0.000037290396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778793,0.00057742046,0.00066572294,0.0007688408,0.0004797205,0.00086872274,0.00048007112,0.00051795086,0.0011961978],"category_scores_gemma":[0.0038089894,0.0003993511,0.00048740135,0.00057328294,0.00081173325,0.0010121521,0.00064702757,0.0009975662,0.0004724816],"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.00003097642,0.000018385785,0.00065229763,0.00009003462,0.000019527717,0.00005072684,0.00007793548,0.884919,0.015876338,0.07175558,0.0007282838,0.025780866],"study_design_scores_gemma":[0.0000021479475,0.000009191897,0.000063755084,0.000005320182,0.0000025488368,0.000023582117,0.0000052903665,0.9861022,0.0030907474,0.009522501,0.0011641909,0.0000085505835],"about_ca_topic_score_codex":0.0011861658,"about_ca_topic_score_gemma":0.0010308174,"teacher_disagreement_score":0.0011961978,"about_ca_system_score_codex":0.00096123666,"about_ca_system_score_gemma":0.00086195004,"threshold_uncertainty_score":0.0069742203},"labels":[],"label_agreement":null},{"id":"W2148795300","doi":"10.1109/tcomm.2009.12.0701392","title":"The BER optimal linear rake receiver for signal detection in symmetric alpha-stable noise","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":45,"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":"Rake receiver; Bit error rate; Noise (video); Rake; Signal-to-noise ratio (imaging); Detection theory; Mathematics; SIGNAL (programming language); Algorithm; Computer science; Electronic engineering; Control theory (sociology); Fading; Telecommunications; Statistics; Engineering; Decoding methods","score_opus":0.024432725713716744,"score_gpt":0.2647302186608785,"score_spread":0.24029749294716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148795300","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.03173904,0.0017666108,0.9579979,0.00035136755,0.00005448895,0.000028595987,0.00007686959,0.0003021786,0.0076830117],"genre_scores_gemma":[0.7429678,0.0017271228,0.24961342,0.00019638594,0.00014628569,0.000046730034,0.00012778334,0.000058775815,0.0051156026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991304,0.00025170884,0.000043219432,0.00013740806,0.00033506798,0.000102235674],"domain_scores_gemma":[0.9994797,0.00021636597,0.00007412938,0.000052128486,0.00015811792,0.000019568737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007990542,0.0006573093,0.00077389984,0.000417377,0.0003167798,0.0009804239,0.0004947845,0.0008850937,0.0016488865],"category_scores_gemma":[0.0024173015,0.00035540506,0.00029323163,0.00041570235,0.0007591441,0.0009811326,0.0005921467,0.00057014805,0.0009503682],"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.0010495599,0.00010022389,0.0021939264,0.00075984455,0.00018951221,0.0005060804,0.00038490893,0.36277795,0.18495554,0.23667279,0.005975834,0.2044338],"study_design_scores_gemma":[0.00007424551,0.00039084605,0.0011838726,0.00010026294,0.000099076606,0.0010491312,0.00010838353,0.86173564,0.077296376,0.052721415,0.00514437,0.00009636255],"about_ca_topic_score_codex":0.0004076013,"about_ca_topic_score_gemma":0.00078323943,"teacher_disagreement_score":0.0016488865,"about_ca_system_score_codex":0.00060657295,"about_ca_system_score_gemma":0.00086760765,"threshold_uncertainty_score":0.0055160522},"labels":[],"label_agreement":null},{"id":"W2148920021","doi":"10.1109/tcomm.2010.01.070632","title":"Multiple description quantizer design for multiple-antenna systems with MAP detection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Qualcomm (Canada); Queen's University","funders":"","keywords":"Transmitter; Algorithm; Maximum a posteriori estimation; Detector; Phase-shift keying; Computer science; Rayleigh fading; Block code; Keying; Decoding methods; Coding (social sciences); Channel (broadcasting); Electronic engineering; Mathematics; Theoretical computer science; Fading; Telecommunications; Bit error rate; Engineering","score_opus":0.048979690092596284,"score_gpt":0.26207504738492987,"score_spread":0.2130953572923336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148920021","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.0065378263,0.00056944235,0.9917515,0.00014790037,0.000026803127,0.00003822871,0.000039877174,0.00007257897,0.00081588805],"genre_scores_gemma":[0.6986695,0.0009887904,0.2965494,0.00020453356,0.00013415392,0.00024812724,0.00017991128,0.000052189367,0.0029734422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.0002648505,0.00004580605,0.000102005986,0.00029000884,0.00006534475],"domain_scores_gemma":[0.9981445,0.0011388984,0.0002218183,0.000101308375,0.00035634573,0.00003716804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001957465,0.0006456397,0.00072258327,0.00033745077,0.00029580083,0.0010152527,0.0012531087,0.0006357194,0.0020500997],"category_scores_gemma":[0.0034962061,0.00037331876,0.00026300352,0.0005801581,0.0005359575,0.0017512519,0.00077346823,0.00094046874,0.00038128448],"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.00025553565,0.000071456685,0.00080677087,0.00037090317,0.00008427704,0.00013894009,0.00020089145,0.7249917,0.013706396,0.100538,0.002354117,0.15648112],"study_design_scores_gemma":[0.000020156787,0.000051152805,0.000047178404,0.000008920787,0.000009402767,0.000021052452,0.000008341059,0.9907224,0.0020705333,0.006164331,0.0008673502,0.00000919319],"about_ca_topic_score_codex":0.0015535924,"about_ca_topic_score_gemma":0.0020031484,"teacher_disagreement_score":0.0020500997,"about_ca_system_score_codex":0.0010565398,"about_ca_system_score_gemma":0.00096895534,"threshold_uncertainty_score":0.010352194},"labels":[],"label_agreement":null},{"id":"W2148972467","doi":"10.1109/tcomm.2011.011811.090548","title":"Linear Precoding for Orthogonal Space-Time Block Coded MIMO-OFDM Cognitive Radio","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Precoding; Orthogonal frequency-division multiplexing; MIMO; Transmitter; Subcarrier; Cognitive radio; MIMO-OFDM; Transmitter power output; Rayleigh fading; Computer science; Convex optimization; Algorithm; Mathematics; Electronic engineering; Control theory (sociology); Fading; Telecommunications; Beamforming; Wireless; Engineering; Regular polygon; Decoding methods; Channel (broadcasting)","score_opus":0.05589669650676737,"score_gpt":0.28413643639808667,"score_spread":0.2282397398913193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148972467","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.004153277,0.00017648606,0.9932666,0.00006132774,0.000038264698,0.00002983766,0.00002641706,0.000116035044,0.002131876],"genre_scores_gemma":[0.55049163,0.0008019201,0.44202068,0.00023432724,0.00012704467,0.00021183473,0.00014470017,0.000037696638,0.0059301294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996512,0.000101801306,0.000014828446,0.00004740372,0.00014372148,0.000041093965],"domain_scores_gemma":[0.9996271,0.00017234308,0.000045633766,0.000035773563,0.000108011656,0.000011177915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033854166,0.00048401556,0.00027553015,0.00016474232,0.00026013187,0.00052533014,0.00044059957,0.00044680745,0.0015333871],"category_scores_gemma":[0.0013670061,0.00017870068,0.0002252464,0.0003251536,0.0003213765,0.00027330886,0.0003592274,0.00050684967,0.0006671631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018792637,0.00010561114,0.0006693523,0.00026257124,0.000078285964,0.00041876134,0.00018539523,0.5797554,0.056257825,0.037923742,0.004748694,0.31940636],"study_design_scores_gemma":[0.000016336859,0.00014957706,0.00018941141,0.00001957109,0.000019280958,0.000114345174,0.0000178057,0.983959,0.008986713,0.0035732698,0.0029412825,0.000013335599],"about_ca_topic_score_codex":0.0021674517,"about_ca_topic_score_gemma":0.0049622473,"teacher_disagreement_score":0.0021674517,"about_ca_system_score_codex":0.00035730755,"about_ca_system_score_gemma":0.00078602275,"threshold_uncertainty_score":0.005129695},"labels":[],"label_agreement":null},{"id":"W2149024062","doi":"10.1109/tcomm.2013.022713.120129","title":"Relay Beamforming Designs in Multi-User Wireless Relay Networks Based on Throughput Maximin Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"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 Saskatchewan","funders":"","keywords":"Beamforming; Relay; Mathematical optimization; Computer science; Optimization problem; Wireless; Computational complexity theory; Convex optimization; Minimax; Wireless network; Algorithm; Mathematics; Regular polygon; Telecommunications","score_opus":0.08093831440962014,"score_gpt":0.2975022704308457,"score_spread":0.21656395602122558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149024062","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.00315792,0.00015201082,0.9957846,0.000041484705,0.000008137448,0.000018926741,0.000008101195,0.00007580624,0.00075303944],"genre_scores_gemma":[0.45945618,0.0012675562,0.5353658,0.00013958932,0.00008260784,0.0003757786,0.000080475904,0.00011616502,0.003115779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993056,0.0003855606,0.000029260937,0.0000920138,0.00014206638,0.000045434124],"domain_scores_gemma":[0.9992269,0.0005394631,0.00008771176,0.000039965733,0.00008784394,0.000018127328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014080155,0.0012587694,0.0010577943,0.0005383729,0.0003431814,0.0008908559,0.00075600116,0.0010557948,0.0016191794],"category_scores_gemma":[0.0028514916,0.00066833885,0.00047843682,0.0007845624,0.0007304452,0.001428375,0.0008620683,0.00072610064,0.0006350393],"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.00008757744,0.000031941192,0.00022581038,0.00012231298,0.000038497103,0.00007853858,0.000108683926,0.9102812,0.0071255625,0.026219264,0.0009017636,0.054778922],"study_design_scores_gemma":[0.000010331645,0.000046304147,0.000047372665,0.0000081719445,0.0000065749896,0.000033741773,0.000010530015,0.9913327,0.0015294964,0.0065304115,0.0004365729,0.000007764879],"about_ca_topic_score_codex":0.0004929242,"about_ca_topic_score_gemma":0.00063156086,"teacher_disagreement_score":0.0016191794,"about_ca_system_score_codex":0.00062101096,"about_ca_system_score_gemma":0.0005502095,"threshold_uncertainty_score":0.0074463487},"labels":[],"label_agreement":null},{"id":"W2149332137","doi":"10.1109/26.950349","title":"Nonlinear group-blind multiuser detection","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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 Calgary","funders":"","keywords":"Multiuser detection; Subspace topology; Telecommunications link; Interference (communication); Algorithm; Single antenna interference cancellation; Nonlinear system; Mathematics; Computational complexity theory; Detector; Computer science; Control theory (sociology); Mathematical optimization; Artificial intelligence; Telecommunications; Decoding methods","score_opus":0.06638866280194984,"score_gpt":0.3262858007003942,"score_spread":0.2598971378984444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149332137","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.006203362,0.00012434376,0.99256504,0.000048745056,0.000021166004,0.000020193738,0.0000128453,0.00013395173,0.0008702132],"genre_scores_gemma":[0.40153667,0.00036223896,0.5927714,0.00012868777,0.000067028115,0.00012451834,0.00006749135,0.000033032862,0.0049088886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00009252171,0.000009704068,0.000045975525,0.00017710552,0.000033573597],"domain_scores_gemma":[0.9996051,0.00014240674,0.00007010625,0.00007316781,0.00008743072,0.0000217424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048752915,0.0004239603,0.0005421028,0.00038274648,0.0003399871,0.00036816997,0.0006838177,0.0005554241,0.0009195269],"category_scores_gemma":[0.0014416476,0.00016612587,0.0003307267,0.00043863562,0.0007636721,0.0006915785,0.0009933444,0.000554662,0.0006040426],"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.00039429223,0.00013669797,0.0016350085,0.00028187814,0.00012075467,0.0002281956,0.00024389483,0.4581784,0.07933992,0.052469544,0.0031187085,0.40385264],"study_design_scores_gemma":[0.000018485018,0.00007650284,0.00018311884,0.0000043129044,0.000008287788,0.00013924412,0.000009920347,0.9823826,0.010380842,0.004964727,0.0018168548,0.000015071601],"about_ca_topic_score_codex":0.00090931373,"about_ca_topic_score_gemma":0.0011802319,"teacher_disagreement_score":0.0009195269,"about_ca_system_score_codex":0.00036808944,"about_ca_system_score_gemma":0.0005606351,"threshold_uncertainty_score":0.0030760765},"labels":[],"label_agreement":null},{"id":"W2149333620","doi":"10.1109/tcomm.2004.842001","title":"A New Choice of Penalty Function for Robust Multiuser Detection Based on<tex>$M$</tex>-Estimation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","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":"University of Toronto","funders":"","keywords":"Minimax; Detector; Gaussian noise; Algorithm; Noise (video); Gaussian; Multiuser detection; Parametric statistics; Mathematics; Function (biology); Control theory (sociology); Mathematical optimization; Computer science; Applied mathematics; Statistics; Telecommunications; Physics; Artificial intelligence","score_opus":0.06852001951557384,"score_gpt":0.29668751881170075,"score_spread":0.2281674992961269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149333620","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.004626188,0.00017547126,0.9946792,0.000059792255,0.000037659578,0.000011950402,0.000011459712,0.000094103394,0.00030416052],"genre_scores_gemma":[0.18926577,0.00033339017,0.80732626,0.00017951362,0.00009502589,0.00008499686,0.00009824881,0.000120573895,0.0024962544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993037,0.00022757135,0.0000479237,0.00013559144,0.00023925178,0.000046072128],"domain_scores_gemma":[0.9992448,0.00028483698,0.000093894334,0.000097909164,0.00022831614,0.000050289662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224417,0.00078300625,0.0008583447,0.00040855692,0.00025863273,0.00053139316,0.0009215355,0.00092832424,0.0008416309],"category_scores_gemma":[0.0025111767,0.00031333612,0.0003867943,0.00043550454,0.000499636,0.0012286222,0.00089905655,0.0011865518,0.00048095582],"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.0007318904,0.0002990922,0.001974534,0.0004319935,0.00021034133,0.00031542024,0.00009722092,0.22909424,0.17659695,0.07591134,0.004557753,0.50977916],"study_design_scores_gemma":[0.000018928493,0.00007912192,0.0002641148,0.0000127794265,0.000014402524,0.00020306892,0.0000047192157,0.9791738,0.0146679245,0.0031004855,0.0024351347,0.000025595406],"about_ca_topic_score_codex":0.00028027457,"about_ca_topic_score_gemma":0.00052635465,"teacher_disagreement_score":0.0011224417,"about_ca_system_score_codex":0.0003476398,"about_ca_system_score_gemma":0.0005132021,"threshold_uncertainty_score":0.005936146},"labels":[],"label_agreement":null},{"id":"W2149719491","doi":"10.1109/tcomm.2010.04.080345","title":"An analytical method for calculating the bit error rate performance of rake reception in UWB multipath fading channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":20,"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":"Fading; Multipath propagation; Bit error rate; Rake receiver; Additive white Gaussian noise; Computer science; Rake; Electronic engineering; Bandwidth (computing); Algorithm; Multipath interference; Ultra-wideband; Delay spread; Gaussian noise; Channel (broadcasting); Telecommunications; Engineering; Decoding methods","score_opus":0.044655320033360014,"score_gpt":0.3332573940208434,"score_spread":0.2886020739874834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149719491","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.006262657,0.0005583898,0.99006665,0.000049877573,0.00005183302,0.000030379199,0.000037555397,0.00059045275,0.0023522298],"genre_scores_gemma":[0.48793036,0.0034363235,0.5017522,0.00013690106,0.00010933374,0.0002747528,0.0001767308,0.00025270856,0.0059306636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914217,0.00020597874,0.000031006242,0.00006461148,0.0005006575,0.000055630782],"domain_scores_gemma":[0.9986104,0.000656203,0.00014167931,0.00018105253,0.00039279473,0.000017882421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510135,0.0010200104,0.0006569777,0.0012559198,0.00037373183,0.0006773446,0.0012316956,0.00079964305,0.0022060175],"category_scores_gemma":[0.0064049163,0.00029901395,0.000479989,0.00088229816,0.0005503514,0.0011638213,0.00049247633,0.00093481387,0.0014060141],"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.000106499705,0.00008982974,0.0007941582,0.00042366635,0.00006421924,0.00023530153,0.0002186516,0.7742997,0.035172768,0.057180345,0.0026496616,0.12876521],"study_design_scores_gemma":[0.0000054466886,0.00006184695,0.00017674126,0.00002831927,0.000011992986,0.00020624716,0.000019227788,0.98766345,0.0069108205,0.0032451751,0.0016503228,0.000020289928],"about_ca_topic_score_codex":0.0016400137,"about_ca_topic_score_gemma":0.0016875474,"teacher_disagreement_score":0.0022060175,"about_ca_system_score_codex":0.0008596998,"about_ca_system_score_gemma":0.0007231116,"threshold_uncertainty_score":0.0073798895},"labels":[],"label_agreement":null},{"id":"W2150513644","doi":"10.1109/tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"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":"Hop (telecommunications); Beamforming; Relay; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Electronic engineering; Probability density function; Control theory (sociology); Topology (electrical circuits); Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Engineering; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150513644","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.058452837,0.001312244,0.9293237,0.0001874732,0.00002489807,0.00004257545,0.00011551551,0.00022166534,0.0103191035],"genre_scores_gemma":[0.95393527,0.0016045696,0.0415049,0.00005866787,0.000043823275,0.00008087916,0.00009790131,0.000032251777,0.0026417708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935323,0.0002038678,0.000025769448,0.00006035828,0.00027102584,0.0000857766],"domain_scores_gemma":[0.99799573,0.0012756105,0.00017456102,0.0001055995,0.0004085377,0.000039964558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953082,0.0011128776,0.00065225153,0.0006900007,0.0003983363,0.00097527093,0.0005709167,0.0007895225,0.0018494151],"category_scores_gemma":[0.0037328675,0.00031041275,0.00042919684,0.00068692485,0.000520007,0.00087130093,0.00073410926,0.0005734857,0.0005826631],"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.0000599356,0.000017651997,0.0005185631,0.000063286556,0.00002373814,0.000109553745,0.00005015721,0.9593461,0.008028603,0.017749282,0.0003404522,0.013692653],"study_design_scores_gemma":[0.0000024156482,0.00004789472,0.00020853702,0.0000068647087,0.0000090501535,0.00007965894,0.000016442644,0.99489504,0.0012434857,0.003250928,0.00023015638,0.0000094637435],"about_ca_topic_score_codex":0.0019330824,"about_ca_topic_score_gemma":0.0016052336,"teacher_disagreement_score":0.0019330824,"about_ca_system_score_codex":0.0009824033,"about_ca_system_score_gemma":0.0006408738,"threshold_uncertainty_score":0.007127881},"labels":[],"label_agreement":null},{"id":"W2150673229","doi":"10.1109/tcomm.2009.06.070334","title":"Performance degradation of source matching in optical CDMA due to source coherence effects","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","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":"Université Laval","funders":"","keywords":"Coherence (philosophical gambling strategy); Computer science; Bit error rate; Coherence time; Electronic engineering; Binary number; Channel (broadcasting); Code division multiple access; Source code; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.012011184077959428,"score_gpt":0.22656550522105787,"score_spread":0.21455432114309844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150673229","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.96256626,0.00032981145,0.035583053,0.000055980556,0.000008230354,0.000010026802,0.000018900078,0.00015831122,0.001269465],"genre_scores_gemma":[0.9979031,0.00007705917,0.001812807,0.000009228482,0.000003828626,0.0000030906676,0.000009759934,0.00000911049,0.00017196186],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993673,0.00014845449,0.000020003932,0.00007434943,0.00027368026,0.00011623715],"domain_scores_gemma":[0.9965305,0.002337201,0.0005027002,0.0002050508,0.00035652288,0.000067995454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006403466,0.00035835602,0.0003565188,0.00036115872,0.0002498304,0.00044292622,0.0003122402,0.0005556727,0.00042212062],"category_scores_gemma":[0.004899697,0.0001481988,0.00018121928,0.0004404996,0.00053497194,0.0006499983,0.0004909561,0.0003118734,0.00013873941],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013498516,0.0001886877,0.013777074,0.00023838489,0.00012822487,0.0008153256,0.00031101628,0.3118739,0.6196437,0.005953277,0.00019758145,0.045523014],"study_design_scores_gemma":[0.000030622166,0.000643051,0.007334558,0.000015817785,0.00006264665,0.00051988993,0.00005433743,0.8083333,0.18094847,0.0017620723,0.00026103144,0.00003422019],"about_ca_topic_score_codex":0.0008845823,"about_ca_topic_score_gemma":0.0004381529,"teacher_disagreement_score":0.0008845823,"about_ca_system_score_codex":0.0005018796,"about_ca_system_score_gemma":0.00026084465,"threshold_uncertainty_score":0.0036414266},"labels":[],"label_agreement":null},{"id":"W2151198875","doi":"10.1109/tcomm.2011.083011.100771","title":"Efficient Network Protection Design Models using Pre-Cross-Connected Trails","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Scalability; Survivability; Computer science; Column generation; Redundancy (engineering); Distributed computing; Simple (philosophy); Network planning and design; Computation; Key (lock); Computer network; Mathematical optimization; Algorithm; Mathematics","score_opus":0.12180800975309011,"score_gpt":0.2823235851989959,"score_spread":0.1605155754459058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151198875","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.02348838,0.00020972501,0.9703939,0.00016313007,0.000024018012,0.00011226691,0.00016335737,0.00014455996,0.005300664],"genre_scores_gemma":[0.680071,0.00076791714,0.30988032,0.00012659363,0.00003296285,0.00047114256,0.0003579863,0.00009184227,0.008200206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997279,0.000091855116,0.000011171136,0.00004210052,0.0000800375,0.000046827525],"domain_scores_gemma":[0.9995455,0.00024577547,0.00007052459,0.000043292017,0.00007250325,0.00002237428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006526467,0.00077351095,0.00041407094,0.00044204842,0.00025585978,0.0007828007,0.0007268736,0.000622412,0.0033923294],"category_scores_gemma":[0.0011342214,0.00037726693,0.00059935276,0.0005103873,0.0005781719,0.0009168124,0.0005589278,0.00079126266,0.0003115866],"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.000012698261,0.000017180877,0.00009237208,0.0000378373,0.0000042335714,0.000030407211,0.000013606341,0.9814503,0.00095659745,0.011142584,0.00031907734,0.0059231343],"study_design_scores_gemma":[0.000006265368,0.000014950054,0.00001799704,0.0000045366423,0.000002787116,0.000007918989,0.0000048911866,0.9928364,0.00034620127,0.0061566117,0.0005998994,0.0000015502875],"about_ca_topic_score_codex":0.0018772457,"about_ca_topic_score_gemma":0.002577233,"teacher_disagreement_score":0.0033923294,"about_ca_system_score_codex":0.00083682925,"about_ca_system_score_gemma":0.0010554875,"threshold_uncertainty_score":0.011348486},"labels":[],"label_agreement":null},{"id":"W2151258080","doi":"10.1109/tcomm.2003.813179","title":"On diagonal algebraic space-time block codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Block code; Diagonal; Algebraic number; Mathematics; Coding (social sciences); Decoding methods; Algorithm; Block matrix; Block (permutation group theory); Space–time block code; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry; Statistics; Eigenvalues and eigenvectors; Physics","score_opus":0.015753382618571062,"score_gpt":0.2503578648488415,"score_spread":0.23460448223027042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151258080","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.074709006,0.0009677832,0.8957301,0.00026482184,0.00006542048,0.00008073298,0.00020060156,0.00025773182,0.027723866],"genre_scores_gemma":[0.74864197,0.0031069738,0.23479813,0.00019371328,0.00018422058,0.00021097502,0.00055340887,0.000091403635,0.012219191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986688,0.0004759672,0.000053258056,0.000106779386,0.00052057835,0.00017460296],"domain_scores_gemma":[0.99734384,0.0014444727,0.0002778114,0.00027106216,0.00061791885,0.000044919772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006336772,0.00060068234,0.00037441618,0.00052021124,0.00043196062,0.0010168576,0.00040933443,0.00045944515,0.0024365042],"category_scores_gemma":[0.0045815906,0.00021458532,0.00022442921,0.0013088556,0.0010699292,0.0013043551,0.00088844594,0.0006288415,0.00090292486],"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.00040351317,0.00003053175,0.0005951192,0.00015912074,0.000021607948,0.00023408236,0.0002389249,0.2563239,0.01500497,0.6158005,0.0022875343,0.10890013],"study_design_scores_gemma":[0.000042496846,0.0002043258,0.0004311323,0.00007521996,0.000025535666,0.00057190045,0.00011191762,0.75861645,0.016119728,0.2116118,0.012138277,0.000051094255],"about_ca_topic_score_codex":0.002213318,"about_ca_topic_score_gemma":0.0022948387,"teacher_disagreement_score":0.0024365042,"about_ca_system_score_codex":0.0007323453,"about_ca_system_score_gemma":0.000956135,"threshold_uncertainty_score":0.008150995},"labels":[],"label_agreement":null},{"id":"W2151308565","doi":"10.1109/tcomm.2007.896040","title":"Performance of Two Dual-Branch Postdetection Switch-and-Stay Combining Schemes in Correlated Rayleigh and Rician Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Frequency-shift keying; Rayleigh fading; Fading; Phase-shift keying; Bit error rate; Mathematics; Keying; Fading distribution; Electronic engineering; Statistics; Computer science; Telecommunications; Engineering; Channel (broadcasting); Demodulation; Decoding methods","score_opus":0.01631804951401708,"score_gpt":0.2691363877751058,"score_spread":0.2528183382610887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151308565","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.8889665,0.001017497,0.102165565,0.000262852,0.00003661402,0.00004619115,0.000106176194,0.00038712466,0.0070114024],"genre_scores_gemma":[0.9868355,0.00020392999,0.01196095,0.00004521501,0.000014446458,0.00001806145,0.000060955714,0.000009647399,0.0008513187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885094,0.00026670893,0.000057786223,0.00010405479,0.00044133316,0.0002792331],"domain_scores_gemma":[0.996145,0.0019797268,0.00059588044,0.00035652757,0.0007532398,0.00016963313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014656535,0.0010637069,0.0007392981,0.0006210062,0.00042599015,0.0009574732,0.00069943245,0.000827594,0.0013618338],"category_scores_gemma":[0.0039043743,0.00024240336,0.00033586414,0.0008126357,0.0006500416,0.0008371641,0.00079036097,0.00046052577,0.0002691079],"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.0077431495,0.0004160188,0.035469595,0.0004331748,0.0005778323,0.0007485175,0.0005611534,0.49494335,0.23274574,0.022071362,0.0012108419,0.2030793],"study_design_scores_gemma":[0.00024184215,0.001878334,0.009261757,0.000046246754,0.00027843827,0.00074168,0.00015573888,0.86757016,0.113259785,0.004981185,0.0014926087,0.000092121874],"about_ca_topic_score_codex":0.001503527,"about_ca_topic_score_gemma":0.0020194887,"teacher_disagreement_score":0.001503527,"about_ca_system_score_codex":0.0007363892,"about_ca_system_score_gemma":0.00093057496,"threshold_uncertainty_score":0.007751167},"labels":[],"label_agreement":null},{"id":"W2151575149","doi":"10.1109/tcomm.2004.831359","title":"Error Performance Analysis of a Jointly Optimal Single-Cochannel-Interferer BPSK Receiver","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Keying; Signal-to-noise ratio (imaging); Bit error rate; Computer science; SIGNAL (programming language); Binary number; Algorithm; Electronic engineering; Amplitude and phase-shift keying; Phase (matter); Noise (video); Gaussian noise; White noise; Mathematics; Telecommunications; Decoding methods; Physics; Engineering; Arithmetic","score_opus":0.04052935710068363,"score_gpt":0.26904716124103506,"score_spread":0.22851780414035144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151575149","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.061206836,0.0013442908,0.9265035,0.00038568187,0.000051146322,0.000044639593,0.00011452622,0.00047680616,0.009872622],"genre_scores_gemma":[0.918391,0.0011390081,0.07429424,0.00012785321,0.000107372194,0.00009916451,0.0001720461,0.00013891762,0.0055304454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781466,0.0006643534,0.00007862349,0.00025000866,0.0009083528,0.00028398508],"domain_scores_gemma":[0.9971083,0.0018030594,0.0002469837,0.00018250033,0.0005997742,0.00005938342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027263267,0.0016609044,0.0016018974,0.00075616076,0.0005361458,0.0015895049,0.0009709686,0.0016394164,0.002341981],"category_scores_gemma":[0.0073185405,0.0006587414,0.00078444125,0.0008206778,0.0013807688,0.0013502177,0.0014504443,0.00094996253,0.0010584812],"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.00015133187,0.000028079385,0.00046396052,0.000112225775,0.00006893882,0.00009763278,0.00011158417,0.95473975,0.008388314,0.021537736,0.00044669778,0.013853714],"study_design_scores_gemma":[0.0000069070634,0.000044936955,0.00018436665,0.000014501795,0.000017632017,0.000069114816,0.000015688316,0.99462163,0.0019529649,0.0028217877,0.00023470244,0.00001574254],"about_ca_topic_score_codex":0.0032284078,"about_ca_topic_score_gemma":0.0016585514,"teacher_disagreement_score":0.0032284078,"about_ca_system_score_codex":0.0017396808,"about_ca_system_score_gemma":0.0016427024,"threshold_uncertainty_score":0.014418364},"labels":[],"label_agreement":null},{"id":"W2151666308","doi":"10.1109/tcomm.2009.04.070065","title":"Envelope and phase distribution of two correlated gaussian variables","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radio Frequency Integrated Circuit Design","field":"Engineering","cited_by":51,"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":"Mathematics; Additive white Gaussian noise; Gaussian noise; Probability density function; Phase-shift keying; Gaussian; Statistics; Random variable; Amplitude; Bit error rate; Quadrature amplitude modulation; Series (stratigraphy); Closed-form expression; White noise; Statistical physics; Mathematical analysis; Physics; Algorithm; Quantum mechanics","score_opus":0.023926949229493368,"score_gpt":0.27215533459423347,"score_spread":0.2482283853647401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151666308","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.0492723,0.00059383165,0.9409261,0.00019081362,0.00006683493,0.000041764004,0.00017194638,0.0002850162,0.008451375],"genre_scores_gemma":[0.92044884,0.0014996408,0.068671346,0.000121611556,0.00011871278,0.000108827,0.00039844142,0.000098063516,0.008534491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925643,0.00020088436,0.000025196001,0.00011347639,0.00032093204,0.00008296942],"domain_scores_gemma":[0.99629253,0.0022583497,0.00035932823,0.00040085847,0.0006324306,0.000056529698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001486667,0.0005614897,0.0005676478,0.0007878168,0.00027977853,0.0011577498,0.00071269926,0.0008183288,0.002603735],"category_scores_gemma":[0.0074987574,0.00030669538,0.00040601456,0.0010900005,0.001206187,0.0012893049,0.00044004485,0.00078037824,0.0009387074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028322559,0.00009120902,0.00440459,0.00023480516,0.00007841949,0.0008944133,0.00030080538,0.5877065,0.017924905,0.3399055,0.0015601955,0.046615448],"study_design_scores_gemma":[0.000013577562,0.000044753106,0.0012451774,0.000026278729,0.000014711775,0.0004494944,0.000035884834,0.96201473,0.0037479827,0.031135347,0.0012405087,0.000031573927],"about_ca_topic_score_codex":0.0007755739,"about_ca_topic_score_gemma":0.0004340012,"teacher_disagreement_score":0.002603735,"about_ca_system_score_codex":0.0008129838,"about_ca_system_score_gemma":0.0005521218,"threshold_uncertainty_score":0.008710384},"labels":[],"label_agreement":null},{"id":"W2152382476","doi":"10.1109/tcomm.2009.10.080005","title":"Comments on successive relaxation for decoding of LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Additive white Gaussian noise; Code word; Belief propagation; Binary number; Relaxation (psychology); Computer science; Bit error rate; Mathematics; Frequency domain; Channel (broadcasting); Arithmetic; Telecommunications","score_opus":0.054695428228613424,"score_gpt":0.3447178290045503,"score_spread":0.2900224007759369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152382476","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011729538,0.01944779,0.57687324,0.22517237,0.051573955,0.00038141262,0.0016250133,0.0014710713,0.111725576],"genre_scores_gemma":[0.3756494,0.028309068,0.29110426,0.1258369,0.07646167,0.0013467969,0.0013408529,0.0028291603,0.09712183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99451905,0.0025493125,0.00032764755,0.0004751827,0.0019200499,0.00020872119],"domain_scores_gemma":[0.98350835,0.012247494,0.00049265433,0.00084256515,0.0027702735,0.00013868656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052555823,0.0009771897,0.00081177655,0.0009295333,0.0012161928,0.00123319,0.0021880632,0.0029709407,0.010125129],"category_scores_gemma":[0.040913377,0.00041409084,0.0011516502,0.0014247098,0.0027614317,0.0025487999,0.001059846,0.006469531,0.0038315372],"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.00047652645,0.00003298749,0.00048920506,0.0011508694,0.000084329426,0.0011137383,0.00074778235,0.03623128,0.003885288,0.613752,0.26351383,0.07852208],"study_design_scores_gemma":[0.00013268564,0.0003100328,0.000972229,0.00070580834,0.000056274712,0.00085029955,0.00020510636,0.12989502,0.009079221,0.40056676,0.45701182,0.00021473142],"about_ca_topic_score_codex":0.0046920637,"about_ca_topic_score_gemma":0.0016340533,"teacher_disagreement_score":0.010125129,"about_ca_system_score_codex":0.0018509148,"about_ca_system_score_gemma":0.0010455836,"threshold_uncertainty_score":0.03387195},"labels":[],"label_agreement":null},{"id":"W2152556510","doi":"10.1109/tcomm.2009.05.070599","title":"Performance Analysis of the IEEE 802.15.4a UWB System","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":44,"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":"Convolutional code; Computer science; Pulse-position modulation; Decoding methods; Bit error rate; Ultra-wideband; Phase-shift keying; Algorithm; Electronic engineering; Concatenated error correction code; Time-hopping; Code rate; Coding gain; Telecommunications; Block code; Pulse-amplitude modulation; Detector; Engineering; Pulse (music)","score_opus":0.014716095053885422,"score_gpt":0.2252945437196761,"score_spread":0.21057844866579067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152556510","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.73760253,0.0048440825,0.21939254,0.00069366075,0.00011093947,0.00012231656,0.00050915364,0.0010743076,0.03565042],"genre_scores_gemma":[0.9950381,0.00043316043,0.003073456,0.000040147148,0.000023448598,0.000024076382,0.00009055759,0.000029394925,0.0012475759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998787,0.00045613264,0.000056526736,0.00012860364,0.00033387137,0.00023787073],"domain_scores_gemma":[0.9978218,0.0012359942,0.00019597902,0.00016525423,0.00053518993,0.000045776054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012484916,0.00086751423,0.00063510466,0.001096068,0.00056068244,0.0009326542,0.00040400206,0.00082423235,0.0017520816],"category_scores_gemma":[0.0030035533,0.00017404393,0.00045769557,0.00072454195,0.0006578135,0.0007354813,0.0007463856,0.0004430149,0.00047412567],"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.00044071005,0.00007006081,0.007322227,0.00018432706,0.0001234889,0.00040163938,0.00023028032,0.9194193,0.020851035,0.012717688,0.0010517593,0.037187524],"study_design_scores_gemma":[0.000008849152,0.00033683542,0.004381355,0.000032900738,0.000047726517,0.00030055575,0.00010274565,0.98712164,0.0050752675,0.0017492907,0.0008102095,0.000032592005],"about_ca_topic_score_codex":0.0042945263,"about_ca_topic_score_gemma":0.0017469199,"teacher_disagreement_score":0.0042945263,"about_ca_system_score_codex":0.0010896958,"about_ca_system_score_gemma":0.0006024265,"threshold_uncertainty_score":0.008539021},"labels":[],"label_agreement":null},{"id":"W2152610779","doi":"10.1109/tcomm.2011.012711.090592","title":"Asymptotically-Exact Performance Bounds of AF Multi-Hop Relaying over Nakagami Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"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":"Independent and identically distributed random variables; Nakagami distribution; Fading; Rayleigh fading; Moment-generating function; Mathematics; Hop (telecommunications); Relay; Upper and lower bounds; Harmonic mean; Topology (electrical circuits); Cumulative distribution function; Maximal-ratio combining; Asymptotically optimal algorithm; Algorithm; Statistics; Probability density function; Computer science; Telecommunications; Combinatorics; Random variable; Mathematical analysis; Physics; Decoding methods","score_opus":0.0978336611917214,"score_gpt":0.30068319812078037,"score_spread":0.20284953692905897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152610779","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.061365996,0.009746058,0.90248567,0.0004172581,0.00015772608,0.000046510806,0.00025681828,0.00082672003,0.0246972],"genre_scores_gemma":[0.9398728,0.005097918,0.051373612,0.000172902,0.00027074773,0.00012824062,0.00023756237,0.00013313058,0.0027131585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971113,0.0006936667,0.0001148673,0.00023996542,0.0013546033,0.0004855809],"domain_scores_gemma":[0.98769903,0.008442526,0.00079428003,0.0013672145,0.0015435775,0.00015333417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038339419,0.0019366799,0.0014278698,0.0016728888,0.00064574095,0.002320431,0.0012721956,0.0010951088,0.0030386152],"category_scores_gemma":[0.022995317,0.00045386425,0.0007029732,0.0013103412,0.0016642555,0.0030904703,0.0019834852,0.001970647,0.00087039894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002303202,0.000049336104,0.00078139897,0.0002860559,0.000061446684,0.00019737941,0.00024179467,0.84792006,0.008338154,0.08670449,0.0014871719,0.053702388],"study_design_scores_gemma":[0.000013299331,0.00013507807,0.0006510266,0.00010385398,0.00003684569,0.0002643419,0.000073186384,0.9407434,0.005442274,0.050702453,0.0017833094,0.00005099497],"about_ca_topic_score_codex":0.0021056843,"about_ca_topic_score_gemma":0.0017923726,"teacher_disagreement_score":0.0038339419,"about_ca_system_score_codex":0.0021647473,"about_ca_system_score_gemma":0.0010186436,"threshold_uncertainty_score":0.02027601},"labels":[],"label_agreement":null},{"id":"W2153279511","doi":"10.1109/tcomm.2004.836424","title":"Accurate Evaluation of Multiple-Access Performance in TH-PPM and TH-BPSK UWB Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":179,"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":"Phase-shift keying; Pulse-position modulation; Additive white Gaussian noise; Bit error rate; Modulation (music); Algorithm; Electronic engineering; Computer science; Interference (communication); Gaussian noise; Keying; Gaussian; Time-hopping; Mathematics; White noise; Telecommunications; Decoding methods; Physics; Pulse-amplitude modulation; Engineering; Pulse (music); Detector; Acoustics","score_opus":0.061669499479615635,"score_gpt":0.30058252815116454,"score_spread":0.2389130286715489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153279511","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.1757549,0.00061567675,0.8204571,0.00007835091,0.000019947754,0.00002971334,0.000052820837,0.00042504893,0.0025663548],"genre_scores_gemma":[0.9514688,0.00024840777,0.047585912,0.000016755368,0.00001087129,0.000034062534,0.000036351612,0.000029031386,0.00056976563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991234,0.00025599785,0.000040565974,0.00006251006,0.00044803374,0.0000693678],"domain_scores_gemma":[0.9967866,0.0022067598,0.000230144,0.0003373603,0.00040157794,0.000037495454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014017713,0.00044131203,0.0005717272,0.00059327425,0.00025764754,0.0006111824,0.00056310295,0.00084208726,0.00041750396],"category_scores_gemma":[0.007250531,0.0002107289,0.00026397218,0.00055704557,0.00050954614,0.0011848429,0.00050269766,0.00049714925,0.00019760926],"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.00018444358,0.00003265053,0.0023523646,0.00010253708,0.00003073145,0.00015547889,0.0001278014,0.9224085,0.022518879,0.016319787,0.00014314224,0.03562372],"study_design_scores_gemma":[0.0000028845034,0.000034562305,0.00039811275,0.000004386471,0.0000031814438,0.000070379116,0.0000061642963,0.9926951,0.005570543,0.001080159,0.00012735555,0.0000072076864],"about_ca_topic_score_codex":0.00092272944,"about_ca_topic_score_gemma":0.0005647517,"teacher_disagreement_score":0.0014017713,"about_ca_system_score_codex":0.00063443015,"about_ca_system_score_gemma":0.0004345586,"threshold_uncertainty_score":0.0074133277},"labels":[],"label_agreement":null},{"id":"W2153342212","doi":"10.1109/tcomm.2012.100312.110480","title":"Collaborative Sub-Channel Allocation in Cognitive LTE Femto-Cells: A Cooperative Game-Theoretic Approach","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":70,"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":"Throughput; Femtocell; Computer science; Computer network; Telecommunications link; Resource allocation; Game theory; Femto-; Resource management (computing); Channel (broadcasting); Channel allocation schemes; Non-cooperative game; Base station; Wireless; Telecommunications; Mathematics","score_opus":0.022966472054573518,"score_gpt":0.2640205141335729,"score_spread":0.2410540420789994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153342212","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.04711891,0.00023320167,0.94475573,0.00038322053,0.00003617274,0.00008438284,0.000027463188,0.000041663483,0.007319251],"genre_scores_gemma":[0.9535847,0.0002217292,0.042768985,0.00011333766,0.00003585777,0.00014251794,0.000014267003,0.000013739076,0.0031050018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989893,0.0004901059,0.000023740427,0.00011490183,0.00022382237,0.00015828288],"domain_scores_gemma":[0.99883753,0.00076631183,0.00012183372,0.000060750208,0.00012015736,0.000093420276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014852243,0.00074419705,0.00084915216,0.00052139495,0.0006472428,0.0013311381,0.0016911783,0.0013752575,0.0010835439],"category_scores_gemma":[0.002878466,0.00037181127,0.0006487639,0.00048701913,0.0017917678,0.001336182,0.0011768467,0.0007247702,0.00013473789],"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.000047537786,0.00004387785,0.00026604443,0.000032323274,0.000036292888,0.00012533237,0.00010108458,0.9308319,0.0012817614,0.062129054,0.00032967507,0.004775057],"study_design_scores_gemma":[0.0000089611,0.000021159414,0.000053425476,0.0000025548125,0.000006626022,0.000020435937,0.000029199713,0.9857961,0.00018110218,0.013633583,0.00024197617,0.000004790278],"about_ca_topic_score_codex":0.0046250154,"about_ca_topic_score_gemma":0.0039566546,"teacher_disagreement_score":0.0046250154,"about_ca_system_score_codex":0.0016267783,"about_ca_system_score_gemma":0.0014035846,"threshold_uncertainty_score":0.01180315},"labels":[],"label_agreement":null},{"id":"W2153443706","doi":"10.1109/tcomm.2005.849797","title":"Tight Error Bounds for Space-Time Orthogonal Block Codes Under Slow Rayleigh Flat Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":29,"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":"Pairwise error probability; Upper and lower bounds; Rayleigh fading; Mathematics; Block code; Algorithm; Fading; Bit error rate; Decoding methods; Chernoff bound; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.029150210371875027,"score_gpt":0.2864121138004663,"score_spread":0.25726190342859123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153443706","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.07898462,0.0064571323,0.9023146,0.0007831512,0.000210373,0.00008545842,0.0003620693,0.00045463952,0.010347939],"genre_scores_gemma":[0.9007014,0.0053472067,0.08902897,0.00024980473,0.00027064688,0.00039373763,0.00044907662,0.00017837949,0.003380698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950393,0.0016265176,0.00023871977,0.00034775847,0.002028891,0.00071887387],"domain_scores_gemma":[0.9579355,0.03185743,0.00352614,0.0020790652,0.0041154264,0.0004864157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008294527,0.0025948724,0.0014605388,0.0023065985,0.00091960403,0.0026553255,0.0011262917,0.0012944908,0.0035994737],"category_scores_gemma":[0.057499092,0.0006951867,0.0005381472,0.0023358448,0.0030797806,0.0039229575,0.003243681,0.0017943119,0.00095348456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004087629,0.000037562186,0.0016340993,0.00031962284,0.00006441162,0.00021266997,0.0002834006,0.82124084,0.007148027,0.12267413,0.0015543497,0.04442213],"study_design_scores_gemma":[0.000025238518,0.00019400315,0.00077907514,0.00013191263,0.000022130484,0.00017610211,0.00008245463,0.91581297,0.0059897597,0.07530874,0.0014100011,0.00006750018],"about_ca_topic_score_codex":0.0030198281,"about_ca_topic_score_gemma":0.0027177471,"teacher_disagreement_score":0.008294527,"about_ca_system_score_codex":0.002683828,"about_ca_system_score_gemma":0.0022917534,"threshold_uncertainty_score":0.043866158},"labels":[],"label_agreement":null},{"id":"W2153505774","doi":"10.1109/tcomm.2013.012913.110340","title":"Stochastic Decoding of LDPC Codes over GF(q)","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"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":"Low-density parity-check code; Decoding methods; Algorithm; Code word; Computational complexity theory; List decoding; Computer science; Galois theory; Mathematics; Block code; Concatenated error correction code; Discrete mathematics","score_opus":0.03690478225068595,"score_gpt":0.29877855041684437,"score_spread":0.2618737681661584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153505774","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.08535616,0.00015808741,0.910216,0.00014426895,0.00001968949,0.000060758935,0.00011273846,0.00048124496,0.003451042],"genre_scores_gemma":[0.70419705,0.00029259888,0.29192954,0.00010214404,0.000026589281,0.00008956022,0.00035235038,0.000104660794,0.0029054664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998735,0.00037204914,0.00007402386,0.000112143294,0.0005944154,0.00011231475],"domain_scores_gemma":[0.9977374,0.0011702207,0.00027112567,0.00034822623,0.0004268081,0.00004621723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865941,0.00038085197,0.00040676614,0.00041976155,0.00040068955,0.00063064275,0.00049575727,0.00040928452,0.00066828565],"category_scores_gemma":[0.0048596216,0.00021354461,0.0002726686,0.0006276515,0.0005484889,0.0006054427,0.00065455935,0.0004950464,0.00027482255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029783294,0.00006253259,0.0019031672,0.00019740743,0.0000629957,0.00016030755,0.0001950287,0.744656,0.037270773,0.10119362,0.0011925987,0.11280774],"study_design_scores_gemma":[0.000016587313,0.000042529744,0.0002379387,0.000013119593,0.0000059804433,0.00007816116,0.000011575438,0.9707817,0.015520489,0.012391229,0.0008917287,0.000008974678],"about_ca_topic_score_codex":0.003042276,"about_ca_topic_score_gemma":0.0049859467,"teacher_disagreement_score":0.003042276,"about_ca_system_score_codex":0.00074031093,"about_ca_system_score_gemma":0.0021424692,"threshold_uncertainty_score":0.006049156},"labels":[],"label_agreement":null},{"id":"W2153907020","doi":"10.1109/tcomm.2009.09.070005","title":"Some comments on the use of markov models in communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","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":"Western University","funders":"","keywords":"Computer science; Markov chain; Markov process; Stochastic differential equation; Channel (broadcasting); Field (mathematics); Markov model; Electronic engineering; Telecommunications; Mathematics; Engineering; Applied mathematics; Machine learning; Statistics","score_opus":0.12481479231560719,"score_gpt":0.2983842211223395,"score_spread":0.1735694288067323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153907020","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013374267,0.011669766,0.020047754,0.9135371,0.02905476,0.000032548378,0.00048069225,0.00015414384,0.023685886],"genre_scores_gemma":[0.111781485,0.04373815,0.021909725,0.6466676,0.1036999,0.00022602394,0.00043590818,0.00045309193,0.071088076],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963632,0.0012396817,0.00031260788,0.0004379927,0.0013218233,0.00032468277],"domain_scores_gemma":[0.9734476,0.020435205,0.0010264533,0.00083338644,0.0037171724,0.00054024096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052532046,0.0010556902,0.00077541464,0.0010977058,0.0023479816,0.002157922,0.0032614665,0.0073048384,0.020007176],"category_scores_gemma":[0.025665924,0.0005756722,0.0011716104,0.0018474049,0.003753835,0.008434868,0.0017994324,0.009531665,0.004491844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000884488,0.000031427415,0.0005465002,0.00055543886,0.000035171972,0.0007691377,0.00062774797,0.002632698,0.0005075195,0.45316702,0.52375615,0.017282793],"study_design_scores_gemma":[0.000032828008,0.000078002915,0.0008909296,0.00046072644,0.000019792564,0.0007899717,0.00038144947,0.0046090023,0.0009114636,0.30741063,0.68431205,0.00010319241],"about_ca_topic_score_codex":0.010561705,"about_ca_topic_score_gemma":0.0064250547,"teacher_disagreement_score":0.020007176,"about_ca_system_score_codex":0.0026516067,"about_ca_system_score_gemma":0.0014327978,"threshold_uncertainty_score":0.06693065},"labels":[],"label_agreement":null},{"id":"W2154104609","doi":"10.1109/tcomm.2006.884852","title":"A Comparison of DCT-Based OFDM and DFT-Based OFDM in Frequency Offset and Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":164,"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":"Orthogonal frequency-division multiplexing; Additive white Gaussian noise; Discrete cosine transform; Rayleigh fading; Fading; Carrier frequency offset; Frequency offset; Algorithm; Mathematics; Bit error rate; Computer science; Guard interval; Quadrature amplitude modulation; Discrete Fourier transform (general); Electronic engineering; Phase-shift keying; Multipath propagation; Telecommunications; White noise; Engineering; Fourier transform; Fractional Fourier transform; Channel (broadcasting); Decoding methods","score_opus":0.03248814429921955,"score_gpt":0.30472097599279085,"score_spread":0.2722328316935713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154104609","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.20779969,0.0023455776,0.7780176,0.00027195775,0.00024911424,0.00010131575,0.00016987775,0.00048048998,0.01056437],"genre_scores_gemma":[0.80610615,0.0013754307,0.18993473,0.00008221916,0.00012188982,0.00005038982,0.0002061102,0.0000395955,0.0020835209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992424,0.00015094642,0.000038915,0.00006226498,0.00044977182,0.000055632914],"domain_scores_gemma":[0.9973122,0.0015964832,0.0001689974,0.00022588916,0.0006500463,0.000046402143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010327848,0.00035276348,0.0003797323,0.000647763,0.00022708991,0.00048185428,0.00043572066,0.00055872294,0.0010279439],"category_scores_gemma":[0.0072783683,0.00013931768,0.00016122249,0.0006216772,0.0003178989,0.0009813831,0.00031949312,0.0003210029,0.0002509479],"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.003205165,0.00019421888,0.010316834,0.0006078519,0.0001461578,0.000851288,0.00022017708,0.30466214,0.10385254,0.04845243,0.0027186295,0.5247726],"study_design_scores_gemma":[0.00005709321,0.00048962067,0.0040290966,0.000026986007,0.000044680684,0.0011984463,0.00004358007,0.9438943,0.04516447,0.0022128376,0.002799835,0.000039112932],"about_ca_topic_score_codex":0.0011402153,"about_ca_topic_score_gemma":0.001396062,"teacher_disagreement_score":0.0011402153,"about_ca_system_score_codex":0.00035470544,"about_ca_system_score_gemma":0.00041170092,"threshold_uncertainty_score":0.005461931},"labels":[],"label_agreement":null},{"id":"W2154165522","doi":"10.1109/tcomm.2009.11.070210","title":"Waterfall Performance Analysis of Finite-Length LDPC Codes on Symmetric Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"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":"Low-density parity-check code; Decoding methods; Algorithm; Binary symmetric channel; Code word; Mathematics; Channel (broadcasting); Channel capacity; Waterfall; Block code; Computer science; Telecommunications","score_opus":0.04406269363340806,"score_gpt":0.29347941317687143,"score_spread":0.24941671954346337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154165522","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.4920294,0.00054258405,0.5041676,0.000104353916,0.000010062092,0.0000463376,0.00018699825,0.0004777108,0.0024349405],"genre_scores_gemma":[0.98849225,0.0001813379,0.010824734,0.0000100397365,0.0000063695943,0.000029512903,0.000074110496,0.000028440782,0.0003532325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.0002937345,0.000030399171,0.000078122655,0.00029193546,0.0001378026],"domain_scores_gemma":[0.99485636,0.0033492846,0.00071551197,0.00047967755,0.0005090985,0.00009001432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010819127,0.0006177842,0.0005732163,0.00089304394,0.00030679716,0.0004942512,0.00069348677,0.0005635719,0.00064571906],"category_scores_gemma":[0.007089699,0.000284194,0.00037774,0.00077244325,0.0012176625,0.0013635053,0.0005824618,0.00055691926,0.00017472],"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.000085517284,0.00001246348,0.00090733264,0.00003456377,0.000020472695,0.00016943262,0.00006463789,0.9712362,0.008374043,0.013789286,0.000118826516,0.005187173],"study_design_scores_gemma":[0.0000016306966,0.00001752255,0.00025116664,0.000003320643,0.0000020900316,0.000029711133,0.000005653325,0.9943499,0.0021163207,0.003180346,0.000035723027,0.000006659695],"about_ca_topic_score_codex":0.0033924454,"about_ca_topic_score_gemma":0.0014228948,"teacher_disagreement_score":0.0033924454,"about_ca_system_score_codex":0.0012116665,"about_ca_system_score_gemma":0.00073756,"threshold_uncertainty_score":0.0087913275},"labels":[],"label_agreement":null},{"id":"W2154188754","doi":"10.1109/tcomm.2008.060106","title":"Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Fading; Rayleigh fading; Markov decision process; Link adaptation; Physical layer; Transmitter; Automatic repeat request; Block Error Rate; Markov process; Telecommunications link; Channel (broadcasting); Computer network; Wireless; Telecommunications; Mathematics","score_opus":0.04680008209293217,"score_gpt":0.2642501974351741,"score_spread":0.2174501153422419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154188754","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.02397453,0.00040594817,0.9730093,0.00019148644,0.000032964334,0.00005270831,0.000025420733,0.00014554105,0.0021620456],"genre_scores_gemma":[0.95075345,0.00041918966,0.04643216,0.00011628261,0.000044706612,0.0001285518,0.000028753897,0.000043386834,0.0020334804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923444,0.00028956073,0.00003626255,0.000105451625,0.00018281396,0.00015147285],"domain_scores_gemma":[0.9982235,0.0010610396,0.00027263258,0.0000841737,0.0002983907,0.00006025809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021341152,0.0010861472,0.0011961642,0.0005097762,0.0005012177,0.0011843324,0.001493406,0.00086144754,0.0018050333],"category_scores_gemma":[0.0029318125,0.0006987473,0.00064819993,0.00051599037,0.0011566371,0.0010168629,0.0011676496,0.0011258315,0.00020999758],"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.000038406244,0.00003265382,0.00020721964,0.000036463458,0.000027079748,0.00004940399,0.000042119507,0.9816157,0.0012671094,0.007913527,0.0002513506,0.00851897],"study_design_scores_gemma":[0.000004024261,0.000014582563,0.000027623799,0.0000018622596,0.000004754531,0.0000062644394,0.0000043402356,0.9988925,0.00018992576,0.00080829265,0.000043133343,0.000002749285],"about_ca_topic_score_codex":0.0045361444,"about_ca_topic_score_gemma":0.0029781726,"teacher_disagreement_score":0.0045361444,"about_ca_system_score_codex":0.0013025749,"about_ca_system_score_gemma":0.0012047275,"threshold_uncertainty_score":0.0112864375},"labels":[],"label_agreement":null},{"id":"W2154766530","doi":"10.1109/tcomm.2003.822187","title":"Precise Error-Rate Analysis of Bandwidth-Efficient BPSK in Nakagami Fading and Cochannel Interference","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":108,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; University of Victoria","keywords":"Fading; Phase-shift keying; Bit error rate; Electronic engineering; Fading distribution; Interference (communication); Bandwidth (computing); Bandlimiting; Algorithm; Computer science; Nakagami distribution; Word error rate; Mathematics; Telecommunications; Rayleigh fading; Engineering; Speech recognition; Fourier transform; Decoding methods","score_opus":0.030617110309637333,"score_gpt":0.2863406210239537,"score_spread":0.25572351071431637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154766530","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.1511099,0.002471535,0.8400083,0.0001826454,0.000053470903,0.000035391626,0.00012101678,0.0005168775,0.0055007394],"genre_scores_gemma":[0.9676244,0.001320261,0.029333878,0.000041998563,0.000037910497,0.000043200405,0.00010275974,0.00009052581,0.0014051306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795026,0.00049195177,0.000095426425,0.00013971944,0.0011242935,0.0001983043],"domain_scores_gemma":[0.9937336,0.0044095204,0.00052282366,0.00052827166,0.000756886,0.000049045713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028605927,0.000951542,0.001080187,0.000969382,0.00042191503,0.0008481571,0.0007613711,0.0009242575,0.00074411265],"category_scores_gemma":[0.012777828,0.0003822081,0.00043157843,0.00093835784,0.0012705226,0.0015933955,0.0009342907,0.00092433277,0.00034947123],"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.00015553052,0.000021567375,0.0006854356,0.0001415213,0.0000307418,0.00015728842,0.00015232488,0.92964673,0.016353536,0.039424237,0.00022858063,0.013002501],"study_design_scores_gemma":[0.0000056842327,0.000050444858,0.0006502677,0.000017294922,0.000013327848,0.0001252337,0.00001991704,0.9844512,0.007866311,0.006497337,0.00027848745,0.000024637082],"about_ca_topic_score_codex":0.0017777652,"about_ca_topic_score_gemma":0.0008557302,"teacher_disagreement_score":0.0028605927,"about_ca_system_score_codex":0.001239587,"about_ca_system_score_gemma":0.00060388516,"threshold_uncertainty_score":0.015128434},"labels":[],"label_agreement":null},{"id":"W2154993501","doi":"10.1109/tcomm.2012.100912.120503","title":"Message-Passing Algorithms for Counting Short Cycles in a Graph","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":63,"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":"Bipartite graph; Message passing; Algorithm; Computer science; Computational complexity theory; Graph theory; Matrix multiplication; Graph; Theoretical computer science; Mathematics; Combinatorics; Parallel computing","score_opus":0.08365801311970401,"score_gpt":0.3494965390896761,"score_spread":0.2658385259699721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154993501","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.002725198,0.000115589886,0.9957748,0.00005499321,0.000026188558,0.00006744241,0.0000422575,0.0006424237,0.00055114285],"genre_scores_gemma":[0.068247095,0.00041137048,0.927599,0.000081864986,0.00009368813,0.00038747257,0.0003156532,0.00017021027,0.0026935313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786407,0.0006050911,0.0001964458,0.00035638106,0.0007487528,0.00022934753],"domain_scores_gemma":[0.9945773,0.002290587,0.00068968826,0.001077602,0.0011732709,0.00019155732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018026559,0.0018278499,0.0011088225,0.003394455,0.0012028448,0.002094264,0.0026830265,0.0014307302,0.0032308302],"category_scores_gemma":[0.009092033,0.00062392594,0.00094068254,0.0036167211,0.0011396577,0.0041604755,0.0017616944,0.0019251253,0.0013998728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034782113,0.00015350255,0.0012188654,0.0003355577,0.00010837314,0.00014110305,0.0004688258,0.2445532,0.01224116,0.21273994,0.0069516944,0.52073985],"study_design_scores_gemma":[0.000060332317,0.00013091534,0.0002171693,0.00005150874,0.000042772066,0.00019242703,0.00006489475,0.8270379,0.014681497,0.14785846,0.009609111,0.000053054428],"about_ca_topic_score_codex":0.0026126239,"about_ca_topic_score_gemma":0.0031145036,"teacher_disagreement_score":0.003394455,"about_ca_system_score_codex":0.0015327156,"about_ca_system_score_gemma":0.0021088377,"threshold_uncertainty_score":0.011120677},"labels":[],"label_agreement":null},{"id":"W2155165039","doi":"10.1109/tcomm.2012.081012.100156","title":"Performance Analysis for Multihop Relaying Channels with Nakagami-m Fading: Ergodic Capacity Upper-Bounds and Outage Probability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Upper and lower bounds; Topology (electrical circuits); Independent and identically distributed random variables; Moment-generating function; Computer science; Signal-to-noise ratio (imaging); Channel state information; Context (archaeology); Mathematics; Channel capacity; Channel (broadcasting); Telecommunications; Probability density function; Wireless; Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.09869369265298683,"score_gpt":0.292406410548786,"score_spread":0.1937127178957992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155165039","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.09856321,0.008101884,0.8743542,0.0006332012,0.0000774781,0.00005896702,0.00030264913,0.0005540293,0.017354414],"genre_scores_gemma":[0.97825086,0.0034444425,0.016247345,0.000105355306,0.00012807777,0.00007747734,0.00012614673,0.00008390899,0.0015364146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841666,0.0004649925,0.00005976031,0.00015119756,0.00056320196,0.00034419706],"domain_scores_gemma":[0.988641,0.008549115,0.0010361475,0.0006103466,0.0010040224,0.00015938524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021868881,0.0015838697,0.0013551415,0.0017874567,0.00072574714,0.0018338854,0.0010946159,0.0011552772,0.0018898947],"category_scores_gemma":[0.015271093,0.00047524873,0.00070337794,0.0015698232,0.001671748,0.0021595745,0.0015652574,0.0011205134,0.00045740945],"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.000060925744,0.000028188375,0.00083375594,0.00015220176,0.000048740596,0.00026672558,0.00017604012,0.93413305,0.003125756,0.05027517,0.00076891354,0.010130618],"study_design_scores_gemma":[0.0000034731913,0.00003514811,0.0005361367,0.00003507113,0.000023622384,0.00016724784,0.000043764852,0.98214716,0.0016062333,0.014928057,0.00044698382,0.000027073178],"about_ca_topic_score_codex":0.0042795027,"about_ca_topic_score_gemma":0.0024113217,"teacher_disagreement_score":0.0042795027,"about_ca_system_score_codex":0.0024738547,"about_ca_system_score_gemma":0.0009799196,"threshold_uncertainty_score":0.017949224},"labels":[],"label_agreement":null},{"id":"W2155199613","doi":"10.1109/tcomm.2004.826415","title":"Subspace-Based Active User Identification for a Collision-Free Slotted Ad Hoc Network","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":34,"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; Transmitter; Wireless ad hoc network; Identifier; Subspace topology; Computer network; False alarm; Bandwidth (computing); Interference (communication); Node (physics); Algorithm; Wireless; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.04568657033656958,"score_gpt":0.313073654544155,"score_spread":0.2673870842075854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155199613","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.007806444,0.00022218932,0.9910727,0.000056636265,0.00002131296,0.000019004598,0.000011332978,0.00023405645,0.00055628235],"genre_scores_gemma":[0.45328203,0.0006087163,0.54392654,0.0000830363,0.00006830054,0.00014080324,0.000063937085,0.000029744908,0.0017968909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994572,0.00025486905,0.000017383602,0.00004749551,0.00018593099,0.000037032034],"domain_scores_gemma":[0.99903166,0.00046706235,0.000096683565,0.00012936677,0.00023032386,0.00004493421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067112304,0.00039307293,0.00043387234,0.00033906734,0.00047209466,0.0004904124,0.0006950013,0.00043143984,0.0007432908],"category_scores_gemma":[0.0021235915,0.00017430302,0.00020086065,0.00052058796,0.0006449681,0.0011342701,0.0005659142,0.00054709037,0.00035847953],"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.00039024453,0.000104628496,0.0014596211,0.00023061017,0.0000651461,0.00025096317,0.00031343458,0.45179823,0.04120114,0.13993399,0.0035248226,0.36072722],"study_design_scores_gemma":[0.000009852019,0.0000839042,0.00009180512,0.0000040596465,0.000008668594,0.00008968163,0.000015584063,0.98467654,0.0029861836,0.0099162925,0.0021070943,0.000010370724],"about_ca_topic_score_codex":0.0006687351,"about_ca_topic_score_gemma":0.001047994,"teacher_disagreement_score":0.0007432908,"about_ca_system_score_codex":0.00039560854,"about_ca_system_score_gemma":0.0005962384,"threshold_uncertainty_score":0.0035492778},"labels":[],"label_agreement":null},{"id":"W2155215189","doi":"10.1109/tcomm.2008.060641","title":"A Nash game approach for OSNR optimization with capacity constraint in optical links","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":9,"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":"Nash equilibrium; Wavelength-division multiplexing; Computer science; Convergence (economics); Mathematical optimization; Constraint (computer-aided design); Multiplexing; Mathematics; Telecommunications; Wavelength; Optics; Physics","score_opus":0.045229168508986006,"score_gpt":0.2304290169166437,"score_spread":0.18519984840765769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155215189","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.009466725,0.00020070992,0.9835956,0.00018374615,0.000048179427,0.000076263685,0.000023755885,0.00003652791,0.006368431],"genre_scores_gemma":[0.64768684,0.0008498929,0.33413047,0.00022715342,0.00014043007,0.00056703313,0.00006671951,0.00009246089,0.016239053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989838,0.00058648275,0.0000249411,0.000096261705,0.00020528508,0.00010322056],"domain_scores_gemma":[0.9985707,0.0010901343,0.0000830905,0.000037191214,0.00015835544,0.000060611084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018301203,0.0013098607,0.0013069598,0.0007037702,0.0006908907,0.0013121202,0.0016184881,0.0014398867,0.0029447805],"category_scores_gemma":[0.0038069892,0.0006393023,0.0007940567,0.0006249517,0.002152278,0.0021118713,0.0013772872,0.0016929504,0.000307955],"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.000032571676,0.000028484994,0.00011547815,0.000043791664,0.000016129115,0.00006520659,0.000065648856,0.8999893,0.00059894193,0.09357693,0.00030879604,0.0051586796],"study_design_scores_gemma":[0.000009237217,0.000017252227,0.00001750425,0.0000042439374,0.0000031042855,0.0000082023935,0.000008615773,0.9847622,0.00011698922,0.014673695,0.000374004,0.000004980363],"about_ca_topic_score_codex":0.0086026145,"about_ca_topic_score_gemma":0.0063000047,"teacher_disagreement_score":0.0086026145,"about_ca_system_score_codex":0.0017598238,"about_ca_system_score_gemma":0.002132289,"threshold_uncertainty_score":0.017105103},"labels":[],"label_agreement":null},{"id":"W2155439723","doi":"10.1109/tcomm.2006.881338","title":"Performance of an ultra-wideband communication system in the presence of narrowband BPSK- and QPSK-modulated OFDM interference","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":28,"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":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Narrowband; Electronic engineering; Keying; Wideband; Bit error rate; Minimum-shift keying; Gaussian noise; Computer science; Modulation (music); Ultra-wideband; Orthogonal frequency-division multiplexing; Adjacent-channel interference; Communications system; Telecommunications; White noise; Physics; Algorithm; Engineering; Acoustics; Decoding methods; Channel (broadcasting)","score_opus":0.012295237255100849,"score_gpt":0.22224062955813925,"score_spread":0.2099453923030384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155439723","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.6698024,0.00094468927,0.32167104,0.00031377331,0.00006258749,0.00005146908,0.00011967787,0.0012232465,0.0058111],"genre_scores_gemma":[0.99161947,0.0001609465,0.0075592822,0.0000350846,0.000018939414,0.000019027344,0.000039640283,0.00001875942,0.0005288389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990152,0.0002889343,0.00004691837,0.00010799908,0.00038111585,0.0001598655],"domain_scores_gemma":[0.9958923,0.0028270988,0.00031745515,0.00021217855,0.00068154495,0.000069455156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009495622,0.0006957823,0.00096820743,0.00050216727,0.000745739,0.0010036683,0.00050752744,0.0011888638,0.0009762885],"category_scores_gemma":[0.0046623913,0.00020961271,0.00035121368,0.0003972385,0.0007548123,0.00076926843,0.00055941014,0.0005371724,0.0003790744],"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.0023591712,0.000128824,0.009156101,0.0003768243,0.00036523218,0.000878751,0.00053179555,0.7583133,0.15388703,0.009998705,0.0005071013,0.06349711],"study_design_scores_gemma":[0.000036701447,0.0008147256,0.003269301,0.000034165987,0.00015975181,0.00071062107,0.000061792955,0.9572198,0.035615098,0.0014755694,0.00056128396,0.00004117657],"about_ca_topic_score_codex":0.0015205989,"about_ca_topic_score_gemma":0.0007755584,"teacher_disagreement_score":0.0015205989,"about_ca_system_score_codex":0.000695647,"about_ca_system_score_gemma":0.0005202276,"threshold_uncertainty_score":0.0050472617},"labels":[],"label_agreement":null},{"id":"W2155605600","doi":"10.1109/tcomm.2011.022811.090261","title":"Efficient LLR Calculation for Non-Binary Modulations over Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":40,"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":"Fading; Binary number; Measure (data warehouse); Computation; Convexity; Algorithm; Mathematics; Piecewise linear function; Computer science; Applied mathematics; Mathematical analysis; Decoding methods","score_opus":0.07647538349100345,"score_gpt":0.3129384104109315,"score_spread":0.23646302691992804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155605600","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.0064282194,0.00020291637,0.9905629,0.00012983069,0.000017711352,0.00002330426,0.000055432363,0.0006349376,0.0019448238],"genre_scores_gemma":[0.27764815,0.00079160806,0.71679956,0.00015789445,0.000055995875,0.00011596176,0.000328121,0.00051077385,0.0035919237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846363,0.00044030498,0.00011433213,0.000106266016,0.00074888975,0.00012652467],"domain_scores_gemma":[0.99659485,0.0019720423,0.000280265,0.00068075204,0.0004259737,0.00004606473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192504,0.0010099155,0.0008698799,0.0009345359,0.0003249779,0.0017966459,0.0008059661,0.0005381846,0.0040685646],"category_scores_gemma":[0.012227456,0.00032516418,0.00043938908,0.0009867512,0.0006307548,0.0022859103,0.0009776917,0.0013109953,0.0019775266],"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.00022758941,0.000056483626,0.0010544253,0.00040261823,0.00006657398,0.00026746668,0.00022489404,0.5925761,0.03894233,0.119004615,0.0039354446,0.24324143],"study_design_scores_gemma":[0.000011619696,0.000045110475,0.00027486277,0.000033014043,0.000012896788,0.00018150575,0.000025096893,0.9436668,0.020289151,0.033173025,0.0022664508,0.000020423018],"about_ca_topic_score_codex":0.00086148403,"about_ca_topic_score_gemma":0.0017152441,"teacher_disagreement_score":0.0040685646,"about_ca_system_score_codex":0.0009973862,"about_ca_system_score_gemma":0.0010749989,"threshold_uncertainty_score":0.013610661},"labels":[],"label_agreement":null},{"id":"W2155681377","doi":"10.1109/tcomm.2011.072011.100067","title":"A Spectrally Efficient Detect-and-Forward Scheme with Two-Tier Adaptive Cooperation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Computer science; Fading; Maximization; Scheme (mathematics); Signal-to-noise ratio (imaging); Electronic engineering; Spectral efficiency; Decoding methods; Computer network; Telecommunications; Mathematics; Channel (broadcasting); Mathematical optimization; Engineering","score_opus":0.0627042138644134,"score_gpt":0.2679042200404214,"score_spread":0.20520000617600803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155681377","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.034689523,0.00028827917,0.96103936,0.0001936903,0.000078605175,0.00019687657,0.00007557179,0.00041686202,0.0030212016],"genre_scores_gemma":[0.71654165,0.00020990787,0.28002256,0.00022101362,0.000053213204,0.00019299297,0.000090109424,0.000017690272,0.0026509876],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00023397616,0.00004805494,0.00013621377,0.00027835643,0.0001116184],"domain_scores_gemma":[0.9991283,0.00020324581,0.00009837554,0.00031232476,0.00018429219,0.00007350196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876419,0.00087606313,0.0008121093,0.000575226,0.0005187174,0.00068280153,0.0019100651,0.0010350001,0.0011412824],"category_scores_gemma":[0.0010249224,0.00025595128,0.0005039556,0.00053640496,0.00084849744,0.00087350875,0.0014271642,0.0007420697,0.00056959264],"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.00060944987,0.0005379181,0.0016100045,0.00033351427,0.0002532889,0.0007539555,0.0004830078,0.14443822,0.47143242,0.12023881,0.004047489,0.25526196],"study_design_scores_gemma":[0.00015192949,0.00054652145,0.0007106894,0.00001985799,0.00009763219,0.0011613226,0.000045487526,0.90376186,0.06883184,0.01766218,0.0068689194,0.00014183388],"about_ca_topic_score_codex":0.0007320003,"about_ca_topic_score_gemma":0.0010662179,"teacher_disagreement_score":0.0019100651,"about_ca_system_score_codex":0.00042274073,"about_ca_system_score_gemma":0.00072573783,"threshold_uncertainty_score":0.005223274},"labels":[],"label_agreement":null},{"id":"W2155981314","doi":"10.1109/tcomm.2011.121410.100281","title":"Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"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":"Decoding methods; Computer science; Metric (unit); Algorithm; Bit error rate; Scaling; Clipping (morphology); Theoretical computer science; Mathematics","score_opus":0.03668611409472764,"score_gpt":0.29146219594098866,"score_spread":0.254776081846261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155981314","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.0694213,0.00090327865,0.9238784,0.00032964753,0.00010120743,0.00006211332,0.00006338601,0.00066765124,0.004572975],"genre_scores_gemma":[0.5836036,0.00048093553,0.4137071,0.00013939914,0.000053304684,0.000059509814,0.00008136944,0.000082169536,0.0017926564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782526,0.0007128751,0.00014642467,0.00017045696,0.0010231262,0.00012187773],"domain_scores_gemma":[0.99421704,0.0023875441,0.0008473641,0.0013523553,0.0010796909,0.000115926414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719554,0.0010175088,0.0006908519,0.0008409434,0.0003661989,0.0009360103,0.0008940076,0.0009314456,0.0009827727],"category_scores_gemma":[0.014694898,0.00021610556,0.0002566301,0.0017819903,0.000979928,0.001860744,0.0014809368,0.00091776234,0.0005016307],"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.0006642378,0.000107790474,0.004017156,0.00035781873,0.000108920656,0.00055622257,0.00040938586,0.42277277,0.08260205,0.21199676,0.0019632052,0.27444372],"study_design_scores_gemma":[0.000016146958,0.00012954768,0.0004839708,0.000035100926,0.000020775638,0.0004822067,0.000025597936,0.90783405,0.06406234,0.024115862,0.0027509332,0.000043496202],"about_ca_topic_score_codex":0.0004911705,"about_ca_topic_score_gemma":0.0006043487,"teacher_disagreement_score":0.001719554,"about_ca_system_score_codex":0.0009610088,"about_ca_system_score_gemma":0.0005443873,"threshold_uncertainty_score":0.00909394},"labels":[],"label_agreement":null},{"id":"W2156188675","doi":"10.1109/tcomm.2008.050646","title":"Statistics of general order selection in correlated Nakagami fading channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"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":"Fading; Nakagami distribution; Fading distribution; Cumulative distribution function; Statistics; Mathematics; Signal-to-noise ratio (imaging); Order statistic; Algorithm; Applied mathematics; Statistical physics; Probability density function; Physics; Rayleigh fading","score_opus":0.02962727651438725,"score_gpt":0.2738377184433825,"score_spread":0.24421044192899527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156188675","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.66173106,0.00093757105,0.32984993,0.00042350593,0.000050863746,0.00009519034,0.00057289534,0.00040347953,0.0059353984],"genre_scores_gemma":[0.9932899,0.00048698732,0.004980358,0.00004538219,0.00003492902,0.00004037253,0.00020341465,0.000028789069,0.00088993856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.0003090852,0.000046959132,0.00011504928,0.0003275743,0.00018079471],"domain_scores_gemma":[0.9866767,0.009251949,0.002009565,0.0009094437,0.00093106565,0.00022125673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022351355,0.00071051193,0.0010345284,0.0011022398,0.00049349916,0.001511692,0.00071899936,0.00069215934,0.0011360823],"category_scores_gemma":[0.013102021,0.00046974243,0.00037429555,0.001739106,0.0019261781,0.0014352485,0.0007215934,0.0006880164,0.00030775715],"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.00022307095,0.000023188024,0.007007829,0.00011643797,0.000061939085,0.0006416328,0.00022221402,0.89471555,0.0042898688,0.08533039,0.0006896584,0.0066781067],"study_design_scores_gemma":[0.00003217765,0.00007513977,0.0062629348,0.000028929591,0.000035117555,0.00040871702,0.0000660633,0.94702476,0.002604827,0.04293253,0.0004605143,0.00006822046],"about_ca_topic_score_codex":0.0022036375,"about_ca_topic_score_gemma":0.0020268634,"teacher_disagreement_score":0.0022351355,"about_ca_system_score_codex":0.0011025592,"about_ca_system_score_gemma":0.0009384347,"threshold_uncertainty_score":0.011820614},"labels":[],"label_agreement":null},{"id":"W2156541068","doi":"10.1109/tcomm.2009.06.070048","title":"Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":36,"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":"Enumeration; Low-density parity-check code; Decoding methods; Binary number; Algorithm; Code (set theory); Discrete mathematics; Parity (physics); Mathematics; Word error rate; Computer science; Combinatorics; Statistics; Arithmetic; Artificial intelligence; Physics","score_opus":0.053480811009255086,"score_gpt":0.32590949501043415,"score_spread":0.27242868400117903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156541068","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.31728575,0.0002933683,0.6776155,0.0002506031,0.000024371946,0.000054816595,0.00016823139,0.00046476544,0.0038425333],"genre_scores_gemma":[0.9325389,0.00029043245,0.06544276,0.000041825442,0.000019208324,0.0000661486,0.00022965984,0.000038011673,0.0013330467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919313,0.00037965272,0.00003176499,0.00006704062,0.00024583156,0.000082512575],"domain_scores_gemma":[0.99660134,0.0024657978,0.0002803783,0.00025464175,0.00033978524,0.000057989037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011313624,0.0005718019,0.00054109306,0.00091665867,0.00028777527,0.0007573586,0.000700984,0.0005917791,0.0005839148],"category_scores_gemma":[0.009120594,0.00034573555,0.00024053552,0.0007983959,0.00060767034,0.0011254117,0.0009307811,0.00054428977,0.00027718215],"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.0003209546,0.000046662226,0.0026357386,0.00008463373,0.000024549008,0.000115203,0.00007732542,0.92128766,0.010396446,0.028489169,0.0004468258,0.036074776],"study_design_scores_gemma":[0.0000039987685,0.000006104649,0.00016853443,0.0000048335246,0.0000013833284,0.000009173643,0.0000031508002,0.99485993,0.0019984131,0.0028873899,0.00005193229,0.0000052611013],"about_ca_topic_score_codex":0.0030840016,"about_ca_topic_score_gemma":0.002336704,"teacher_disagreement_score":0.0030840016,"about_ca_system_score_codex":0.0008887021,"about_ca_system_score_gemma":0.0011800554,"threshold_uncertainty_score":0.0064480305},"labels":[],"label_agreement":null},{"id":"W2156717389","doi":"10.1109/tcomm.2009.06.070469","title":"Intercarrier interference reduction in OFDM systems using low complexity selective mapping","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","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":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Interference (communication); Reduction (mathematics); Fast Fourier transform; Computational complexity theory; Computer science; Electronic engineering; Fourier transform; Inverse; Algorithm; Telecommunications; Mathematics; Engineering; Channel (broadcasting)","score_opus":0.0877712318335284,"score_gpt":0.29897598432897105,"score_spread":0.21120475249544263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156717389","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.30166757,0.00073562824,0.69252455,0.00014654256,0.00003168395,0.000046969188,0.000030300926,0.0004912938,0.0043254592],"genre_scores_gemma":[0.76917833,0.00047772136,0.22818533,0.00005911537,0.000058387668,0.000042797496,0.000056675523,0.00003106854,0.0019105667],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989426,0.00002709876,0.000004650903,0.000013068535,0.000048191054,0.000012793517],"domain_scores_gemma":[0.9998228,0.00009231674,0.000030680014,0.000029450428,0.000019021409,0.000005721839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015342627,0.00041222377,0.000288514,0.0002525751,0.00017410949,0.00024134644,0.00027153752,0.00016769527,0.00072123174],"category_scores_gemma":[0.0005829228,0.00008644201,0.0001848013,0.00029031138,0.0003113066,0.00038691692,0.00033750047,0.0002569572,0.00027347388],"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.0002777499,0.00011214706,0.0011104424,0.00019169523,0.00003889725,0.00026171113,0.00023240472,0.030825974,0.48812205,0.009572834,0.0006428685,0.46861124],"study_design_scores_gemma":[0.00006039813,0.0010541183,0.0038241607,0.000021196238,0.000056915957,0.0015020325,0.00009370753,0.38021713,0.59945726,0.0059745875,0.007702198,0.000036463538],"about_ca_topic_score_codex":0.00018151327,"about_ca_topic_score_gemma":0.00040357272,"teacher_disagreement_score":0.00072123174,"about_ca_system_score_codex":0.00009261116,"about_ca_system_score_gemma":0.00023628467,"threshold_uncertainty_score":0.002412796},"labels":[],"label_agreement":null},{"id":"W2156922722","doi":"10.1109/tcomm.2006.869879","title":"Exact expression for the BER of rectangular QAM with arbitrary constellation mapping","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Quadrature amplitude modulation; QAM; Gray code; Mathematics; Bit error rate; Algorithm; Expression (computer science); Signal-to-noise ratio (imaging); Upper and lower bounds; Bounding overwatch; Phase-shift keying; Constellation diagram; Electronic engineering; Computer science; Statistics; Mathematical analysis; Artificial intelligence; Engineering","score_opus":0.02028480927255559,"score_gpt":0.24495127601168515,"score_spread":0.22466646673912954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156922722","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.01329773,0.0020039554,0.96345764,0.00044482935,0.00018144354,0.000038641803,0.00029792218,0.00075524085,0.019522602],"genre_scores_gemma":[0.55579126,0.0045501757,0.41864064,0.00069816783,0.0003087362,0.00028774003,0.0006240754,0.0006713382,0.018427858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991478,0.00021945064,0.000046873785,0.000098609555,0.0004022974,0.000084934785],"domain_scores_gemma":[0.9985631,0.0007329376,0.00011458935,0.0002508006,0.00031095638,0.000027572558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017617599,0.0011140445,0.0008178896,0.0011211861,0.00037868842,0.0010518433,0.0011173727,0.0012938307,0.0068702656],"category_scores_gemma":[0.008252113,0.00030127884,0.0003686717,0.00086002087,0.0013419956,0.0025308754,0.0013488067,0.0010867092,0.003130303],"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.00018051152,0.000057860132,0.0006249395,0.0006239712,0.000036397985,0.00041010202,0.00031839893,0.40368062,0.025036233,0.4698267,0.007391234,0.09181305],"study_design_scores_gemma":[0.000015068859,0.00005207085,0.00042786446,0.00012969541,0.000015945026,0.0004887605,0.00002983384,0.83629847,0.0070723016,0.15036504,0.0050602593,0.000044774923],"about_ca_topic_score_codex":0.0005187844,"about_ca_topic_score_gemma":0.00061969546,"teacher_disagreement_score":0.0068702656,"about_ca_system_score_codex":0.0009941525,"about_ca_system_score_gemma":0.00066140335,"threshold_uncertainty_score":0.022983313},"labels":[],"label_agreement":null},{"id":"W2157179077","doi":"10.1109/tcomm.2006.876869","title":"Optimal Periodic Training Signal for Frequency Offset Estimation in Frequency-Selective Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":81,"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":"Frequency offset; Fading; Rayleigh fading; Channel (broadcasting); Carrier frequency offset; Multipath propagation; SIGNAL (programming language); Offset (computer science); Computer science; Control theory (sociology); Mathematics; Statistics; Algorithm; Telecommunications; Orthogonal frequency-division multiplexing; Artificial intelligence","score_opus":0.032733241364087555,"score_gpt":0.28357684725981763,"score_spread":0.25084360589573007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157179077","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.03009548,0.00021131984,0.9686858,0.00007751577,0.000025025438,0.000020948095,0.000025899586,0.000098825476,0.0007592377],"genre_scores_gemma":[0.5075715,0.0004026229,0.49022874,0.000086860455,0.000106570515,0.00009521631,0.00014286615,0.000039415827,0.0013260632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00017473611,0.000025669347,0.000060368293,0.00012932663,0.000039597893],"domain_scores_gemma":[0.9989743,0.0005671512,0.00014195699,0.0001123029,0.00017594751,0.000028405559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005009183,0.0005392853,0.0004244262,0.00032553764,0.00022649979,0.00028104708,0.00037007793,0.00057651475,0.0009383605],"category_scores_gemma":[0.00327927,0.00022885903,0.00016529855,0.0004024294,0.00037056673,0.00050673034,0.00029591395,0.00041863922,0.0002993745],"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.0007981924,0.000096880685,0.0011348362,0.00020911306,0.00005099108,0.0001327602,0.00016728007,0.37849513,0.09659385,0.020261034,0.001394593,0.5006653],"study_design_scores_gemma":[0.000043467855,0.00031860365,0.0005549442,0.000025381478,0.000023521716,0.00012083988,0.000015045717,0.9716698,0.021439543,0.0041983975,0.0015731712,0.00001739478],"about_ca_topic_score_codex":0.0007246831,"about_ca_topic_score_gemma":0.0010009949,"teacher_disagreement_score":0.0009383605,"about_ca_system_score_codex":0.00020679855,"about_ca_system_score_gemma":0.0005424807,"threshold_uncertainty_score":0.0031391382},"labels":[],"label_agreement":null},{"id":"W2157298719","doi":"10.1109/tcomm.2010.01.080157","title":"Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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 British Columbia","funders":"","keywords":"Cognitive radio; Computer science; Fading; Channel (broadcasting); Transmission (telecommunications); Computer network; Markov process; Time division multiple access; Nash equilibrium; Mathematical optimization; Markov chain; Telecommunications; Mathematics; Wireless; Statistics","score_opus":0.013665531496353083,"score_gpt":0.28892201780945703,"score_spread":0.27525648631310395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157298719","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.055454716,0.0003034674,0.9351178,0.0008654282,0.0000576583,0.00007923596,0.000121912075,0.00020137127,0.0077984007],"genre_scores_gemma":[0.94952357,0.00072211993,0.043150328,0.00028010167,0.000099221405,0.000277946,0.000142831,0.00011101857,0.0056928853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731416,0.0009998848,0.00009463618,0.00046441925,0.0005210781,0.0006058029],"domain_scores_gemma":[0.98723525,0.00980256,0.0013337285,0.0004099303,0.00066429767,0.0005542114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004168079,0.0013303591,0.002124938,0.0010958558,0.00094475097,0.0027602133,0.0026372394,0.0021751628,0.0034707154],"category_scores_gemma":[0.016127158,0.00093388796,0.001249492,0.00112277,0.0033137172,0.003938122,0.0020264266,0.0027467571,0.00053112884],"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.000109404245,0.0000868123,0.00038295388,0.000061241655,0.000050589868,0.000093082555,0.0001519797,0.7005179,0.0009921078,0.2916529,0.0009735627,0.0049275504],"study_design_scores_gemma":[0.000022496053,0.000017158809,0.00004924323,0.0000068189524,0.000007160991,0.00001163102,0.000014621995,0.94506043,0.00011430127,0.054520182,0.0001670121,0.000008930391],"about_ca_topic_score_codex":0.008305749,"about_ca_topic_score_gemma":0.005086802,"teacher_disagreement_score":0.008305749,"about_ca_system_score_codex":0.0037392357,"about_ca_system_score_gemma":0.003725841,"threshold_uncertainty_score":0.027130187},"labels":[],"label_agreement":null},{"id":"W2157308659","doi":"10.1109/tcomm.2004.838722","title":"SER and Outage of Threshold-Based Hybrid Selection/Maximal-Ratio Combining Over Generalized Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Maximal-ratio combining; Fading; Moment-generating function; Nakagami distribution; Independent and identically distributed random variables; Mathematics; Diversity combining; Random variable; Algorithm; Signal-to-noise ratio (imaging); Statistics; Fading distribution; Selection (genetic algorithm); Topology (electrical circuits); Computer science; Combinatorics; Decoding methods; Rayleigh fading","score_opus":0.026550988439321542,"score_gpt":0.2726052357981235,"score_spread":0.24605424735880196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157308659","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.53795177,0.0023341507,0.44857398,0.00040234794,0.000052961397,0.00004057289,0.00021691437,0.0003965678,0.010030815],"genre_scores_gemma":[0.9942228,0.00040461335,0.004957552,0.000021925525,0.000026919804,0.000012907926,0.000040532184,0.000017567121,0.00029513886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984389,0.0007461295,0.000050765644,0.000098932054,0.0004509544,0.00021423766],"domain_scores_gemma":[0.9908229,0.0068100137,0.00085553946,0.0006096315,0.0007549167,0.00014700471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035692302,0.001092663,0.0010800497,0.0008319225,0.00041948375,0.0011480231,0.0006297964,0.00064595975,0.0007336956],"category_scores_gemma":[0.008849998,0.0003538413,0.00052214216,0.0010707256,0.0017277211,0.0012281758,0.0010031664,0.00050518056,0.00018828061],"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.0003452715,0.000020186857,0.0024096167,0.00010348142,0.000081265345,0.0003397597,0.00010888762,0.9516979,0.0044616577,0.02760699,0.00046003258,0.0123649705],"study_design_scores_gemma":[0.000011869618,0.000070271286,0.0008819048,0.000010691364,0.000036942816,0.00013986728,0.000024396717,0.98927605,0.0013674237,0.00803732,0.00012754605,0.000015581783],"about_ca_topic_score_codex":0.0015322646,"about_ca_topic_score_gemma":0.0010174012,"teacher_disagreement_score":0.0035692302,"about_ca_system_score_codex":0.0014130601,"about_ca_system_score_gemma":0.0007875413,"threshold_uncertainty_score":0.018876135},"labels":[],"label_agreement":null},{"id":"W2157634894","doi":"10.1109/tcomm.2004.826247","title":"Call Admission Control for Integrated On/Off Voice and Best-Effort Data Services in Mobile Cellular Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":46,"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; Quality of service; Call Admission Control; Handover; Admission control; Partition (number theory); Computer network; Provisioning; Markov process; Real-time computing; Telecommunications; Mathematics; Wireless","score_opus":0.06221408652698515,"score_gpt":0.3406307085928149,"score_spread":0.27841662206582973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157634894","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.10449641,0.0012293827,0.88921434,0.00042921866,0.00010814859,0.000057505025,0.000022555894,0.0005033482,0.0039390177],"genre_scores_gemma":[0.9790212,0.00022905358,0.019374669,0.000054553846,0.000055447992,0.000035719604,0.000015874515,0.000015565336,0.0011979789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.00029823484,0.000028634542,0.00009231662,0.00033929225,0.00016735298],"domain_scores_gemma":[0.9990132,0.00057939626,0.00011059215,0.000060075232,0.00017541202,0.00006130552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009913222,0.00053617725,0.00054673123,0.0005613968,0.0008403675,0.001110186,0.001257867,0.00079898495,0.00072637957],"category_scores_gemma":[0.0037709267,0.00025943713,0.00034279685,0.0004352095,0.00095805357,0.00097543816,0.0008479599,0.00084351393,0.00013244386],"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.0002727136,0.000121643076,0.0015149448,0.000069579546,0.000052088923,0.0001724676,0.0002485512,0.83456624,0.01216581,0.05292937,0.001384466,0.09650222],"study_design_scores_gemma":[0.000008781211,0.000020954289,0.00010950736,0.000002916483,0.0000073096408,0.000023620756,0.000011849407,0.99482024,0.0007715827,0.00393115,0.00028675076,0.000005393493],"about_ca_topic_score_codex":0.0098991385,"about_ca_topic_score_gemma":0.0062154667,"teacher_disagreement_score":0.0098991385,"about_ca_system_score_codex":0.0019011436,"about_ca_system_score_gemma":0.0018846052,"threshold_uncertainty_score":0.019683063},"labels":[],"label_agreement":null},{"id":"W2157665660","doi":"10.1109/tcomm.2010.10.080336","title":"A Novel High Data Rate Modulation Scheme Based on Chaotic Signal Separation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","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":"University of Calgary","funders":"","keywords":"Additive white Gaussian noise; Computer science; Chaotic; Transmission (telecommunications); Modulation (music); Channel (broadcasting); Electronic engineering; Gaussian noise; SIGNAL (programming language); Data transmission; Noise (video); Signal-to-noise ratio (imaging); Algorithm; Telecommunications; Computer network; Engineering; Artificial intelligence; Acoustics; Physics","score_opus":0.0406786402846217,"score_gpt":0.2968420914863423,"score_spread":0.25616345120172057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157665660","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.108271636,0.0018782774,0.87819993,0.00041455356,0.00029436394,0.00015096636,0.000074807926,0.0005387519,0.010176706],"genre_scores_gemma":[0.70647573,0.00074770243,0.28724456,0.00019756728,0.00020428673,0.00013103758,0.000095234376,0.000033803837,0.004870114],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998312,0.000032738535,0.000012015737,0.0000328179,0.0000713968,0.000019804274],"domain_scores_gemma":[0.9998503,0.00003494987,0.00003103216,0.000026855043,0.000036787624,0.000020047259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017844886,0.0003135734,0.00037245604,0.00042671646,0.00036305355,0.00029965292,0.0005506426,0.00046531463,0.0011988658],"category_scores_gemma":[0.00041867135,0.0001142317,0.00017112648,0.00038760377,0.00033499132,0.00076330395,0.00052563316,0.0005157637,0.0003453406],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051300117,0.00013583234,0.00081603305,0.00032952608,0.000037005873,0.00028548556,0.00029188854,0.008481267,0.6004443,0.06481317,0.0017292718,0.3221233],"study_design_scores_gemma":[0.0003887649,0.0018104628,0.0022688885,0.00010930109,0.00012904067,0.0034968378,0.00008335068,0.44197515,0.4706329,0.019176396,0.059769098,0.00015984256],"about_ca_topic_score_codex":0.000117727075,"about_ca_topic_score_gemma":0.0001325136,"teacher_disagreement_score":0.0011988658,"about_ca_system_score_codex":0.00020338935,"about_ca_system_score_gemma":0.00016863893,"threshold_uncertainty_score":0.004010558},"labels":[],"label_agreement":null},{"id":"W2157833158","doi":"10.1109/tcomm.2003.813261","title":"New analytical probability of error expressions for classes of orthogonal signals in rayleigh fading","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":17,"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":"Biorthogonal system; Rayleigh fading; Fading; Bit error rate; Mathematics; Probability of error; Phase-shift keying; Algorithm; Fading distribution; Rayleigh scattering; Electronic engineering; Topology (electrical circuits); Computer science; Decoding methods; Physics; Combinatorics; Engineering; Optics; Wavelet; Wavelet transform","score_opus":0.08878234410684217,"score_gpt":0.34360750796606476,"score_spread":0.2548251638592226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157833158","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.004788013,0.0017658208,0.9860547,0.00021715047,0.0001674789,0.00006435659,0.0001607992,0.00028795018,0.0064936853],"genre_scores_gemma":[0.39411563,0.014192011,0.5657356,0.0008410768,0.001133162,0.0011375006,0.0011194777,0.0006617639,0.021063752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952591,0.000966694,0.000342539,0.0003922015,0.0025750936,0.0004643759],"domain_scores_gemma":[0.9836638,0.010716885,0.0011232329,0.001402969,0.0029583424,0.0001347064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056395736,0.0020360576,0.0014100705,0.0030515708,0.00075474364,0.003114807,0.002609053,0.0017304503,0.006296814],"category_scores_gemma":[0.03680379,0.0008205938,0.0011271712,0.0022391607,0.0021095371,0.005588966,0.0018182228,0.0028554054,0.0021758243],"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.00011246802,0.000060243325,0.0005850725,0.00032147873,0.000051985964,0.00021502853,0.0003149119,0.40199134,0.0030215457,0.5073951,0.005307172,0.08062369],"study_design_scores_gemma":[0.000014781032,0.000042189404,0.0002629129,0.00011908816,0.000025790063,0.00034651556,0.000066024004,0.8420266,0.0019134574,0.15081163,0.0043098,0.000061143626],"about_ca_topic_score_codex":0.001400095,"about_ca_topic_score_gemma":0.0017416644,"teacher_disagreement_score":0.006296814,"about_ca_system_score_codex":0.0024707292,"about_ca_system_score_gemma":0.0011399987,"threshold_uncertainty_score":0.02982527},"labels":[],"label_agreement":null},{"id":"W2157877316","doi":"10.1109/tcomm.2010.03.080456","title":"Index assignment optimization for joint source-channel MAP decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Algorithm; List decoding; Simulated annealing; Hamming distance; Computer science; Sequential decoding; Assignment problem; Gaussian; Markov chain; Mathematical optimization; Mathematics; Statistics; Concatenated error correction code; Block code; Maximum likelihood","score_opus":0.04814961760117752,"score_gpt":0.2931908962022027,"score_spread":0.24504127860102515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157877316","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.022323616,0.00016234814,0.9752151,0.00011746947,0.000014788923,0.000022666587,0.000044973163,0.00017718965,0.0019218044],"genre_scores_gemma":[0.6301982,0.00028538614,0.36542445,0.000080136015,0.00003866833,0.00009823603,0.00014181079,0.00012193382,0.0036112815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991725,0.00033552016,0.000038764454,0.00013858435,0.0002322631,0.00008242956],"domain_scores_gemma":[0.9990507,0.00061409385,0.00010761459,0.00008775569,0.000108584994,0.00003122125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999198,0.0006573093,0.000789346,0.0004442887,0.00036692695,0.000775697,0.0005684548,0.0006879105,0.0015407725],"category_scores_gemma":[0.004027171,0.00029950181,0.000265618,0.00090092595,0.0007411597,0.0011670942,0.001070672,0.00070150226,0.00039549958],"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.00017345851,0.000053320327,0.00036723373,0.000090766014,0.000031627154,0.0000671656,0.0001388702,0.8703697,0.011199216,0.041677117,0.0011096052,0.0747219],"study_design_scores_gemma":[0.000011644652,0.000028722396,0.00008062704,0.0000050479007,0.000006179877,0.000029792658,0.000013300715,0.97761506,0.004984569,0.016734863,0.00048266503,0.0000074601503],"about_ca_topic_score_codex":0.0010942229,"about_ca_topic_score_gemma":0.0011681836,"teacher_disagreement_score":0.0015407725,"about_ca_system_score_codex":0.0007921495,"about_ca_system_score_gemma":0.0012212942,"threshold_uncertainty_score":0.0057474375},"labels":[],"label_agreement":null},{"id":"W2158628801","doi":"10.1109/tcomm.2004.823584","title":"Optimization of Linear Iterative Interference-Cancellation Receivers for CDMA Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Single antenna interference cancellation; Eigendecomposition of a matrix; Iterative method; Decorrelation; Convergence (economics); Interference (communication); Code division multiple access; Multiuser detection; Eigenvalues and eigenvectors; Computer science; Spread spectrum; Algorithm; Mathematics; Channel (broadcasting); Mathematical optimization; Telecommunications; Decoding methods","score_opus":0.0832216226944393,"score_gpt":0.34061162102383974,"score_spread":0.25738999832940046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158628801","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.006775714,0.0003792727,0.9890564,0.00013346512,0.00001971611,0.000025984269,0.000026931615,0.0001514081,0.0034311493],"genre_scores_gemma":[0.49989328,0.0011993353,0.48692745,0.00017623043,0.000093497234,0.00036584024,0.00018363589,0.00016082579,0.010999903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944323,0.00025269046,0.000019629702,0.0000647733,0.00016971891,0.00005001003],"domain_scores_gemma":[0.99917656,0.00056373497,0.0000670078,0.00003501777,0.00014228733,0.000015297634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008550036,0.0008187758,0.00060346577,0.00031282124,0.00028879032,0.00078919897,0.0005679614,0.00082640134,0.0019565392],"category_scores_gemma":[0.0028353718,0.00049696426,0.00030561397,0.0005509586,0.0006848661,0.0006287765,0.00072222186,0.0007303631,0.0007672295],"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.000050826104,0.000028161263,0.00016910896,0.000058126774,0.000023342813,0.000025753854,0.00005041706,0.9452732,0.0031515232,0.015075393,0.00097237364,0.035121717],"study_design_scores_gemma":[0.000009434797,0.00001921654,0.000050643903,0.000003850428,0.0000042568404,0.0000066980106,0.0000052599567,0.99357975,0.0008613377,0.0049330066,0.0005210462,0.0000054727134],"about_ca_topic_score_codex":0.0021453376,"about_ca_topic_score_gemma":0.0024945436,"teacher_disagreement_score":0.0021453376,"about_ca_system_score_codex":0.0008460399,"about_ca_system_score_gemma":0.0010687623,"threshold_uncertainty_score":0.0065453053},"labels":[],"label_agreement":null},{"id":"W2158946869","doi":"10.1109/tcomm.2013.112213.130302","title":"MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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":"Codebook; Degrees of freedom (physics and chemistry); Secrecy; MIMO; Channel (broadcasting); Artificial noise; Computer science; Linear subspace; Subspace topology; Information-theoretic security; Computer network; Transmitter; Mathematics; Computer security; Algorithm; Artificial intelligence; Physics","score_opus":0.025662316516211533,"score_gpt":0.2507151855061691,"score_spread":0.22505286898995758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158946869","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.14313409,0.001059443,0.84021574,0.0010968938,0.00010014194,0.000049615424,0.00043058212,0.0001505633,0.01376294],"genre_scores_gemma":[0.98030627,0.0010061029,0.013833725,0.0000999435,0.00011683286,0.00006159736,0.00010080693,0.000021306938,0.0044533983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998497,0.0005622754,0.00004024366,0.00017670605,0.0004254193,0.00029831822],"domain_scores_gemma":[0.9940439,0.004117889,0.00071855105,0.00042359374,0.0005470625,0.00014890435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017691002,0.0011257275,0.001383047,0.00055859814,0.0007491419,0.0014617111,0.0008129048,0.0015776024,0.0014723149],"category_scores_gemma":[0.0053719995,0.0005918722,0.0007135899,0.0011065803,0.0030158036,0.002019356,0.0015081255,0.0015137929,0.00038073616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033010764,0.000058222573,0.0011212126,0.00020738081,0.00007469206,0.0012072026,0.00022353565,0.8079529,0.010337368,0.17129572,0.0012162484,0.0059754336],"study_design_scores_gemma":[0.00005204875,0.00009285207,0.0004259269,0.000019465748,0.000042489253,0.00032530376,0.00009640109,0.96503586,0.0025776988,0.030728443,0.00056876626,0.00003470886],"about_ca_topic_score_codex":0.0027635137,"about_ca_topic_score_gemma":0.0015179623,"teacher_disagreement_score":0.0027635137,"about_ca_system_score_codex":0.0011756631,"about_ca_system_score_gemma":0.0008950104,"threshold_uncertainty_score":0.009355962},"labels":[],"label_agreement":null},{"id":"W2159041520","doi":"10.1109/tcomm.2011.081111.100300","title":"On Computation of Performance Bounds of Optimal Index Assignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","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":"Blackberry (Canada); McMaster University","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Assignment problem; Heuristic; Computation; Index (typography); Computer science; Resilience (materials science); Channel (broadcasting); Weapon target assignment problem; Upper and lower bounds; Quadratic equation; Optimization problem; Algorithm; Frequency assignment; Mathematics; Telecommunications","score_opus":0.053607851987623335,"score_gpt":0.27326439195972874,"score_spread":0.2196565399721054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159041520","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.032942574,0.002109484,0.9431233,0.0009125654,0.0001735243,0.0000978058,0.00021143103,0.00056604715,0.019863307],"genre_scores_gemma":[0.7038089,0.002652409,0.28646818,0.0005248663,0.00048534814,0.00053166796,0.00070491014,0.00077656144,0.0040472304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491274,0.0018766026,0.00017286885,0.000584264,0.0017238674,0.0007295013],"domain_scores_gemma":[0.95298624,0.04012959,0.0014832816,0.0027410632,0.0020040262,0.0006558178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007439691,0.0030702355,0.0020497786,0.0027273654,0.0010190954,0.0037791634,0.0017177794,0.0020876375,0.005852801],"category_scores_gemma":[0.060594965,0.0007862988,0.00095298764,0.0024355925,0.0031403094,0.0037150967,0.0031610485,0.0039301454,0.0014080937],"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.00026850007,0.00008706917,0.00052701624,0.00020751933,0.00003813352,0.000055575878,0.00014271999,0.8668476,0.0038524605,0.090880364,0.0025698652,0.034523223],"study_design_scores_gemma":[0.000014291397,0.0000648041,0.00016976238,0.000057866524,0.0000107435235,0.000028957182,0.00002927827,0.9519748,0.0027020206,0.044290613,0.0006421957,0.000014631659],"about_ca_topic_score_codex":0.0017012019,"about_ca_topic_score_gemma":0.0014345674,"teacher_disagreement_score":0.007439691,"about_ca_system_score_codex":0.003360005,"about_ca_system_score_gemma":0.0025184506,"threshold_uncertainty_score":0.039345324},"labels":[],"label_agreement":null},{"id":"W2159453617","doi":"10.1109/tcomm.2011.112811.100146a","title":"Design of Pre-Rake DS-UWB Downlink with Pre-Equalization","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":20,"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":"Rake; Rake receiver; Telecommunications link; Computer science; Electronic engineering; Transmitter; Intersymbol interference; Equalization (audio); Base station; Ultra-wideband; Channel (broadcasting); Engineering; Fading; Telecommunications","score_opus":0.044577978631153085,"score_gpt":0.24496479696618023,"score_spread":0.20038681833502714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159453617","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.017238824,0.00027124473,0.97881866,0.00008279577,0.000030038758,0.000064152824,0.000044104752,0.00014830292,0.0033019343],"genre_scores_gemma":[0.66283566,0.0008107468,0.33068967,0.00014195415,0.000077682744,0.00026017174,0.00013559034,0.000044986642,0.0050035743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995065,0.00013010409,0.00002574925,0.00009549769,0.00017733466,0.00006494218],"domain_scores_gemma":[0.99965644,0.00007935037,0.000055845296,0.00003356652,0.0001533424,0.000021387457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046840444,0.00089836126,0.0007107029,0.0002676277,0.00033062362,0.00103458,0.0006665695,0.0008125737,0.0011836191],"category_scores_gemma":[0.0008396523,0.00037972667,0.0003453877,0.00027444473,0.00038885063,0.00046947587,0.0004691542,0.00055028213,0.00077392603],"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.00027532162,0.0001216924,0.0017823317,0.00031712258,0.00010360908,0.00028013592,0.00015357474,0.7480512,0.09538686,0.01782165,0.001535131,0.13417137],"study_design_scores_gemma":[0.000031387433,0.00025172898,0.00039899317,0.00001886398,0.000034093908,0.00015690963,0.000041703435,0.9646185,0.029010575,0.0020398642,0.0033751302,0.000022168855],"about_ca_topic_score_codex":0.0013044551,"about_ca_topic_score_gemma":0.0014535146,"teacher_disagreement_score":0.0013044551,"about_ca_system_score_codex":0.000624049,"about_ca_system_score_gemma":0.00093160896,"threshold_uncertainty_score":0.0045278072},"labels":[],"label_agreement":null},{"id":"W2159478385","doi":"10.1109/tcomm.2004.833044","title":"High-Order Spectral-Null Multimode Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"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":"Scrambling; Multi-mode optical fiber; Coding (social sciences); Null (SQL); Algorithm; Mathematics; Computer science; Concatenated error correction code; Block code; Decoding methods; Telecommunications; Optical fiber; Statistics","score_opus":0.024820448395127773,"score_gpt":0.26444082072791125,"score_spread":0.2396203723327835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159478385","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.16934933,0.0013007977,0.8060825,0.00033878497,0.0002649672,0.00006410709,0.00023735294,0.00049183064,0.021870313],"genre_scores_gemma":[0.7384917,0.0013361208,0.24393424,0.00027849653,0.00022897952,0.00012576392,0.00033613574,0.00009298675,0.01517561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971384,0.00004622521,0.000015355015,0.000043279077,0.0001349416,0.00004629906],"domain_scores_gemma":[0.9990859,0.00024905914,0.00012847761,0.0001646774,0.00030670024,0.000065163826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026421418,0.00034927108,0.00029137894,0.00079085067,0.0003226696,0.0005854465,0.00034498586,0.0004553504,0.0011994884],"category_scores_gemma":[0.0011411563,0.000119552285,0.00019863331,0.00046026052,0.0006128845,0.0006994138,0.00044293868,0.0005803848,0.0004461184],"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.00030156987,0.0000617335,0.0016863889,0.00016320687,0.000022971377,0.00034243465,0.00022678013,0.021707615,0.15662237,0.6529126,0.002412392,0.16353986],"study_design_scores_gemma":[0.00006906166,0.0003511541,0.0019434553,0.000088562745,0.000030523042,0.0025234919,0.00008184773,0.41539064,0.232319,0.2942868,0.05275431,0.00016117473],"about_ca_topic_score_codex":0.0002818013,"about_ca_topic_score_gemma":0.00033292372,"teacher_disagreement_score":0.0011994884,"about_ca_system_score_codex":0.00037975347,"about_ca_system_score_gemma":0.0004956838,"threshold_uncertainty_score":0.0040126443},"labels":[],"label_agreement":null},{"id":"W2159519002","doi":"10.1109/tcomm.2009.11.080180","title":"Performance of BICM-SC and BICM-OFDM systems with diversity reception in non-gaussian noise and interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":40,"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":"Fading; Algorithm; Additive white Gaussian noise; Nakagami distribution; Orthogonal frequency-division multiplexing; Bit error rate; Mathematics; Gaussian noise; Interference (communication); Topology (electrical circuits); Electronic engineering; Telecommunications; Computer science; Statistics; Decoding methods; Channel (broadcasting); White noise; Combinatorics; Engineering","score_opus":0.016931323295998675,"score_gpt":0.23450784083588655,"score_spread":0.21757651753988788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159519002","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.5863108,0.0020541283,0.3922194,0.00066737755,0.000071388546,0.00004798348,0.0003935919,0.00044278143,0.017792564],"genre_scores_gemma":[0.99112755,0.00024737537,0.007757481,0.000055736084,0.000014928976,0.000018038516,0.0000676526,0.000016099562,0.00069518416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849105,0.0005268739,0.0000582047,0.00013141046,0.00049831875,0.0002940908],"domain_scores_gemma":[0.99588555,0.0025029967,0.000336718,0.00028135936,0.0009136227,0.00007976495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017994805,0.00082653324,0.00080522423,0.0007196431,0.00064003293,0.0010802725,0.00061455776,0.0012214599,0.0012060566],"category_scores_gemma":[0.00743463,0.0002698818,0.00036668062,0.00089940656,0.0011791252,0.0010849042,0.0009174218,0.00058014644,0.00033646793],"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.00040729894,0.00004609027,0.0034140046,0.00014451897,0.000082518,0.00026087326,0.00025615245,0.93072253,0.012333784,0.033582706,0.0005129776,0.018236471],"study_design_scores_gemma":[0.000009243189,0.000081611826,0.0011205206,0.000015945838,0.00001621217,0.00014130067,0.000047771708,0.9908957,0.003211446,0.004244461,0.00019137826,0.000024479461],"about_ca_topic_score_codex":0.0036195044,"about_ca_topic_score_gemma":0.0031325433,"teacher_disagreement_score":0.0036195044,"about_ca_system_score_codex":0.0012828546,"about_ca_system_score_gemma":0.0010719616,"threshold_uncertainty_score":0.009516656},"labels":[],"label_agreement":null},{"id":"W2159690431","doi":"10.1109/tcomm.2009.12.080231","title":"Approximate BER Expressions of Distributed Alamouti's Code in Dissimilar Cooperative Networks with Blind Relays","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"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":"Bit error rate; Code (set theory); Algorithm; Signal-to-noise ratio (imaging); Computer science; Transmission (telecommunications); Channel (broadcasting); Range (aeronautics); Expression (computer science); Topology (electrical circuits); Mathematics; Theoretical computer science; Telecommunications; Decoding methods; Combinatorics; Engineering","score_opus":0.04440532180878933,"score_gpt":0.2974751012675554,"score_spread":0.2530697794587661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159690431","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.061314754,0.0015552286,0.9279034,0.00030694704,0.000032251002,0.000029294104,0.000117000556,0.0002621964,0.008478867],"genre_scores_gemma":[0.8585315,0.0019573765,0.13351186,0.00017657025,0.000048137936,0.00012989213,0.00018806598,0.00014137762,0.0053152945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905926,0.0003217181,0.000038144957,0.00010103846,0.00039761607,0.00008218663],"domain_scores_gemma":[0.9969394,0.0018633618,0.00027397837,0.00023066669,0.0006562665,0.000036328493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754739,0.00076725835,0.00061771733,0.0008586871,0.0003526727,0.0008357964,0.0007586787,0.00096483383,0.0010539221],"category_scores_gemma":[0.0066441526,0.00027410738,0.00039039727,0.00076144154,0.0011093403,0.0014512575,0.0006814474,0.0007468751,0.00038780927],"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.00005139034,0.000011242107,0.00042072215,0.00008831553,0.000017191296,0.00010138828,0.00018502172,0.9193249,0.0038466472,0.0650255,0.0005549689,0.010372703],"study_design_scores_gemma":[0.000003488412,0.000011754509,0.0001277465,0.000012061385,0.0000039062247,0.000051528623,0.000021334212,0.98535776,0.00080341625,0.013324331,0.00027318002,0.000009543853],"about_ca_topic_score_codex":0.0030713023,"about_ca_topic_score_gemma":0.0022773382,"teacher_disagreement_score":0.0030713023,"about_ca_system_score_codex":0.0015740381,"about_ca_system_score_gemma":0.00085610175,"threshold_uncertainty_score":0.011420488},"labels":[],"label_agreement":null},{"id":"W2159690504","doi":"10.1109/tcomm.2004.836560","title":"Near-Capacity Coding in Multicarrier Modulation Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":33,"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":"Low-density parity-check code; Quadrature amplitude modulation; Algorithm; Coding gain; QAM; Noisy-channel coding theorem; Decoding methods; Code rate; Additive white Gaussian noise; Constellation diagram; Variable-length code; Mathematics; Computer science; Bit error rate; Forward error correction; Channel capacity; Channel (broadcasting); Telecommunications; Error floor","score_opus":0.04124309118670567,"score_gpt":0.27208558495783325,"score_spread":0.2308424937711276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159690504","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.14757916,0.001170131,0.8367002,0.000499378,0.00008097627,0.000055355158,0.000088460576,0.000564122,0.0132622495],"genre_scores_gemma":[0.9227492,0.0004559815,0.0738679,0.000109935354,0.000050669925,0.00008046273,0.00007406722,0.00003697015,0.0025748294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994043,0.00020383915,0.000012867621,0.000042457377,0.00026841924,0.00006816293],"domain_scores_gemma":[0.99878305,0.0007347421,0.00009346866,0.0001450035,0.00020400833,0.000039801347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066839304,0.00029790166,0.0003903487,0.00039291635,0.0003651332,0.0004637175,0.0004897021,0.00053827744,0.00085365924],"category_scores_gemma":[0.0029022344,0.00017785348,0.00014193835,0.0006541699,0.0009792662,0.0007861741,0.00081674,0.0004974607,0.00029643238],"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.00009681636,0.000031840962,0.00041013182,0.0001192572,0.000013742079,0.00017417276,0.00024776135,0.7296962,0.016730612,0.18843256,0.001145731,0.06290123],"study_design_scores_gemma":[0.00000880709,0.00003441476,0.00014138281,0.000014812688,0.0000037112648,0.000062029554,0.000018744413,0.9353663,0.005960909,0.05650927,0.0018664695,0.0000131411225],"about_ca_topic_score_codex":0.0015715716,"about_ca_topic_score_gemma":0.001249535,"teacher_disagreement_score":0.0015715716,"about_ca_system_score_codex":0.0007390322,"about_ca_system_score_gemma":0.0004325651,"threshold_uncertainty_score":0.0053620934},"labels":[],"label_agreement":null},{"id":"W2160220809","doi":"10.1109/26.886468","title":"Further analytical results on the joint detection of cochannel signals using diversity arrays","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Simon Fraser University","funders":"","keywords":"Fading; Computer science; Joint (building); Antenna diversity; Electronic engineering; Antenna (radio); Diversity combining; Algorithm; Binary number; Channel (broadcasting); Cooperative diversity; Keying; Phase-shift keying; Base station; Telecommunications; Mathematics; Bit error rate; Engineering; Arithmetic","score_opus":0.1372381799922359,"score_gpt":0.31412351537987143,"score_spread":0.17688533538763554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160220809","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.0051547806,0.00053870765,0.98556477,0.00029122192,0.000054350345,0.000039485287,0.000050528466,0.00022566532,0.008080407],"genre_scores_gemma":[0.573936,0.0030935695,0.41004723,0.0011166565,0.00042857873,0.00050555274,0.00033958672,0.00037756856,0.010155286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959073,0.0011011735,0.0001596097,0.00037002,0.0019087218,0.0005532888],"domain_scores_gemma":[0.9819962,0.013554271,0.0011442963,0.0013047297,0.0018063436,0.00019418745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004818152,0.0022637888,0.0014639134,0.0014858581,0.0008064401,0.002375861,0.0017517387,0.0014794293,0.005739099],"category_scores_gemma":[0.03017736,0.00072139024,0.001131938,0.0017890527,0.0023689384,0.0041702404,0.0037465843,0.00271173,0.0021139495],"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.00014561582,0.00015679718,0.00073340687,0.0003896105,0.00009392264,0.00024635755,0.00034890953,0.59667575,0.01498799,0.31864384,0.0033730152,0.064204715],"study_design_scores_gemma":[0.000009960733,0.00007323466,0.0003015937,0.00009999581,0.000027251719,0.00026721528,0.000051933428,0.8742119,0.007584083,0.11476671,0.0025680242,0.00003808847],"about_ca_topic_score_codex":0.0007381728,"about_ca_topic_score_gemma":0.00071450043,"teacher_disagreement_score":0.005739099,"about_ca_system_score_codex":0.0014557601,"about_ca_system_score_gemma":0.0011962451,"threshold_uncertainty_score":0.025481164},"labels":[],"label_agreement":null},{"id":"W2161238678","doi":"10.1109/tcomm.2013.052013.120256","title":"Asynchronous Compute-and-Forward","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"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":"Asynchronous communication; Computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.038793094402356475,"score_gpt":0.27601687934020247,"score_spread":0.237223784937846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161238678","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.048981167,0.0004944896,0.93528575,0.00040383014,0.00009277487,0.00007456633,0.00014767752,0.00048600006,0.014033694],"genre_scores_gemma":[0.9064638,0.00037611488,0.08684512,0.00014249036,0.000058850983,0.00008916564,0.00010527675,0.00004632382,0.0058728764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990396,0.0002364673,0.000043184806,0.00018253968,0.00031598675,0.00018222292],"domain_scores_gemma":[0.99796486,0.0009855625,0.00016641892,0.00044298798,0.000361064,0.000079090794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012943071,0.0010828355,0.0007395684,0.00044970965,0.000940166,0.0014772803,0.0011102543,0.00082360976,0.003367611],"category_scores_gemma":[0.0041613034,0.0002503266,0.000256681,0.00060272537,0.0008013165,0.0019640052,0.0012588312,0.0007771068,0.0008153349],"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.0008247554,0.0001544761,0.0009483091,0.00020498336,0.000052666128,0.00039359563,0.0002563409,0.52909493,0.029662661,0.33451596,0.005229335,0.098661974],"study_design_scores_gemma":[0.000035509634,0.000090348934,0.000099306235,0.0000101831065,0.00001803819,0.00013127827,0.00003161505,0.9427627,0.013292914,0.041430682,0.0020790275,0.000018469917],"about_ca_topic_score_codex":0.0019827858,"about_ca_topic_score_gemma":0.0030990338,"teacher_disagreement_score":0.003367611,"about_ca_system_score_codex":0.00083325536,"about_ca_system_score_gemma":0.0015357418,"threshold_uncertainty_score":0.011265755},"labels":[],"label_agreement":null},{"id":"W2161272050","doi":"10.1109/tcomm.2006.877962","title":"Dual methods for nonconvex spectrum optimization of multicarrier systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1634,"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":"Mathematical optimization; Optimization problem; Duality gap; Convexity; Duality (order theory); Computer science; Strong duality; Dual (grammatical number); Convex optimization; Maximization; Mathematics; Algorithm; Regular polygon","score_opus":0.020313368459116538,"score_gpt":0.299815892806152,"score_spread":0.2795025243470355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161272050","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.0026043092,0.00036674758,0.9947832,0.00012829914,0.000038050068,0.000019291001,0.000012277741,0.000040345098,0.002007496],"genre_scores_gemma":[0.30935618,0.0013714887,0.6785722,0.00021645207,0.00019140706,0.0003954086,0.00012188686,0.00022676974,0.009548251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995453,0.00023006172,0.000013558123,0.000040348852,0.00013573215,0.00003497248],"domain_scores_gemma":[0.9989969,0.0006837808,0.00008152547,0.00006628214,0.00013211352,0.000039369337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015455759,0.0010062045,0.0007507127,0.00076943263,0.0004944234,0.0010072058,0.0007915892,0.0009636644,0.0023524817],"category_scores_gemma":[0.0034914648,0.00048273054,0.00053996785,0.0006457212,0.0010818976,0.0009459155,0.0014377814,0.0017691195,0.00048018646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007076369,0.000052239808,0.0002746356,0.00013361241,0.000034473593,0.000057816702,0.00007096602,0.8095708,0.0021831908,0.14478816,0.0014164498,0.041346923],"study_design_scores_gemma":[0.000009033591,0.0000073443484,0.000021586797,0.0000061429205,0.0000017914089,0.000007180391,0.000005225505,0.9862853,0.0003074407,0.0124363545,0.00090952957,0.0000030238978],"about_ca_topic_score_codex":0.0016539351,"about_ca_topic_score_gemma":0.0015367029,"teacher_disagreement_score":0.0023524817,"about_ca_system_score_codex":0.0008370581,"about_ca_system_score_gemma":0.0010018985,"threshold_uncertainty_score":0.008173883},"labels":[],"label_agreement":null},{"id":"W2162104643","doi":"10.1109/tcomm.2005.863788","title":"Service differentiation in multirate wireless networks with weighted round-robin scheduling and ARQ-based error control","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":47,"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; Scheduling (production processes); Fading; Computer network; Link adaptation; Wireless network; Automatic repeat request; Hybrid automatic repeat request; Wireless; Physical layer; Weighted round robin; Round-robin scheduling; Quality of service; Channel (broadcasting); Fair-share scheduling; Telecommunications; Telecommunications link; Mathematical optimization; Mathematics","score_opus":0.010117588710305284,"score_gpt":0.2130373673373874,"score_spread":0.2029197786270821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162104643","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.10064666,0.0005382754,0.89630145,0.00017592964,0.000044891352,0.00003987582,0.000026789137,0.00022808889,0.0019980704],"genre_scores_gemma":[0.9520741,0.0003217067,0.046313655,0.000059807488,0.000041018855,0.000038491486,0.000025419731,0.000035952264,0.0010898922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986767,0.0005928011,0.000048269267,0.00011277573,0.0003761597,0.00019324599],"domain_scores_gemma":[0.99653983,0.0020560022,0.0005868792,0.00021128294,0.00050324266,0.000102842816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028833628,0.00078522804,0.00070379575,0.00054007774,0.00034069867,0.0008709681,0.0010160519,0.000534701,0.0005425006],"category_scores_gemma":[0.007612394,0.00044992595,0.0003362178,0.00088138855,0.0010144458,0.0014831468,0.0007738176,0.00072889286,0.00016662339],"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.00012410675,0.000037320337,0.000553133,0.00005143138,0.0000189732,0.00015843945,0.00008292799,0.9396669,0.005097348,0.04232538,0.00024198837,0.011642064],"study_design_scores_gemma":[0.00000340047,0.000014533841,0.00003942228,0.0000012313876,0.0000020330497,0.000015159095,0.0000041853864,0.9976793,0.00028759212,0.0019017484,0.000048450893,0.0000029136816],"about_ca_topic_score_codex":0.0029787521,"about_ca_topic_score_gemma":0.0021436233,"teacher_disagreement_score":0.0029787521,"about_ca_system_score_codex":0.0013905294,"about_ca_system_score_gemma":0.00094326644,"threshold_uncertainty_score":0.015248835},"labels":[],"label_agreement":null},{"id":"W2162184199","doi":"10.1109/tcomm.2010.072710.090036","title":"A Low Complexity Receiver for Noncoherent Amplify-and-Forward Cooperative Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"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":"Relay; Frequency-shift keying; Diversity gain; Computer science; Keying; Signal-to-noise ratio (imaging); Time diversity; Antenna diversity; Channel (broadcasting); Electronic engineering; Bit error rate; Diversity combining; Diversity scheme; Energy (signal processing); Telecommunications; Mathematics; MIMO; Orthogonal frequency-division multiplexing; Wireless; Fading; Engineering; Demodulation; Power (physics); Statistics; Physics","score_opus":0.08433162697910217,"score_gpt":0.32220483267574895,"score_spread":0.23787320569664677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162184199","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.0032136557,0.00031447504,0.99543273,0.000081359045,0.000033382967,0.000032842974,0.000018378212,0.00016713385,0.0007061],"genre_scores_gemma":[0.37651384,0.00081923965,0.61486304,0.00033113486,0.00027883807,0.00023232428,0.00014320033,0.000052248568,0.006766202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902296,0.0002506903,0.000055913366,0.00011062688,0.00050900306,0.00005080639],"domain_scores_gemma":[0.9991522,0.00036507123,0.00012676767,0.00012809144,0.00020496438,0.000022887518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013499227,0.0007864183,0.0008137546,0.00038212157,0.0005038468,0.00094534154,0.0015129008,0.0011079082,0.0018944172],"category_scores_gemma":[0.0018017697,0.0004570183,0.00033771645,0.0003953416,0.00039401726,0.00093777373,0.0009141854,0.0012828326,0.0013968518],"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.00047554332,0.0002191662,0.001817774,0.0006802742,0.00017815741,0.0005502371,0.00035530276,0.11288969,0.30014738,0.14406979,0.0051417984,0.43347496],"study_design_scores_gemma":[0.00009670031,0.00067147135,0.0006039857,0.000051610787,0.0000773595,0.00076597603,0.000038094953,0.912104,0.062087078,0.010167466,0.0132639725,0.00007221813],"about_ca_topic_score_codex":0.00018461286,"about_ca_topic_score_gemma":0.0005192398,"teacher_disagreement_score":0.0018944172,"about_ca_system_score_codex":0.00039371537,"about_ca_system_score_gemma":0.00061416987,"threshold_uncertainty_score":0.007139206},"labels":[],"label_agreement":null},{"id":"W2162344044","doi":"10.1109/tcomm.2010.04.090007","title":"Coded multipulse pulse-position modulation for free-space optical communications","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":59,"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":"Pulse-position modulation; Computer science; Electronic engineering; Bandwidth (computing); Coding (social sciences); Modulation (music); Pulse-amplitude modulation; Transmission (telecommunications); Optical communication; Binary number; Constellation; Algorithm; Telecommunications; Pulse (music); Mathematics; Engineering; Physics","score_opus":0.04177386960490998,"score_gpt":0.3161985241301165,"score_spread":0.27442465452520654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162344044","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.10679408,0.0022172618,0.876917,0.0011517168,0.00018375453,0.00005712893,0.00007697713,0.0002612346,0.0123408735],"genre_scores_gemma":[0.85519326,0.0010158565,0.14135408,0.00018827108,0.000071226954,0.000050880797,0.000055556524,0.000020131914,0.0020506908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000045361237,0.0000054765874,0.000015964786,0.00009066699,0.000016034197],"domain_scores_gemma":[0.99935955,0.00033468136,0.00006360583,0.000114801216,0.00010988079,0.000017507944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030231956,0.00017576065,0.00017684292,0.00023399833,0.00021118288,0.0004218871,0.00048604733,0.0004942304,0.0014567558],"category_scores_gemma":[0.0015993721,0.0000906669,0.00011790818,0.00033130485,0.00033270416,0.0006340581,0.00036075752,0.00053156767,0.0002586236],"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.00028495412,0.00009415815,0.0010791427,0.00054513826,0.00004368305,0.00020610368,0.0002664429,0.20456709,0.11804966,0.3777383,0.0026681009,0.29445717],"study_design_scores_gemma":[0.000024197088,0.00019298731,0.00035861402,0.00005403708,0.000022353179,0.00016675463,0.000033416287,0.89981675,0.03889032,0.050797515,0.009616459,0.00002663061],"about_ca_topic_score_codex":0.00046189898,"about_ca_topic_score_gemma":0.0009094423,"teacher_disagreement_score":0.0014567558,"about_ca_system_score_codex":0.00041210474,"about_ca_system_score_gemma":0.0005162196,"threshold_uncertainty_score":0.004873395},"labels":[],"label_agreement":null},{"id":"W2162490297","doi":"10.1109/tcomm.2006.873983","title":"Decision-feedback detection for block differential space-time modulation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Alberta","funders":"","keywords":"Fading; Differential (mechanical device); Modulation (music); Bandwidth (computing); Rayleigh fading; Control theory (sociology); Computer science; Electronic engineering; Signal-to-noise ratio (imaging); Mathematics; Algorithm; Channel (broadcasting); Telecommunications; Physics; Engineering; Acoustics","score_opus":0.012780574054879614,"score_gpt":0.24795844608900752,"score_spread":0.2351778720341279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162490297","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.09947215,0.0011587967,0.8949499,0.00033896798,0.00016264063,0.0000710691,0.000080664664,0.00025304378,0.0035127145],"genre_scores_gemma":[0.92234087,0.0004332563,0.07560356,0.0001484227,0.00006820321,0.000046430952,0.00005517084,0.000009326644,0.0012949085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992349,0.00021770412,0.000033225286,0.00008425481,0.0003376675,0.00009215149],"domain_scores_gemma":[0.9986092,0.0007856211,0.00015554416,0.00014368865,0.00027352222,0.000032364234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008270717,0.00033948186,0.00036427513,0.00033551065,0.00031962292,0.00045149005,0.00056436,0.0004836429,0.0012975853],"category_scores_gemma":[0.0034486987,0.00016477736,0.0001238026,0.0004373638,0.00036381284,0.00074529106,0.0005882493,0.00033115895,0.00022244075],"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.0016708904,0.00020038994,0.0029848688,0.0006034625,0.00010220101,0.0005721815,0.0004055432,0.19616394,0.25978246,0.07770147,0.0044868225,0.45532578],"study_design_scores_gemma":[0.000048105787,0.0004008118,0.0008108908,0.000028130164,0.000025514264,0.00037543138,0.00002648857,0.9532718,0.031275913,0.010081767,0.003625947,0.000029270637],"about_ca_topic_score_codex":0.00058115367,"about_ca_topic_score_gemma":0.00095259777,"teacher_disagreement_score":0.0012975853,"about_ca_system_score_codex":0.00048256954,"about_ca_system_score_gemma":0.000506326,"threshold_uncertainty_score":0.0043740273},"labels":[],"label_agreement":null},{"id":"W2162973902","doi":"10.1109/tcomm.2010.03.080151","title":"Efficient power allocation schemes for nonconvex sum-rate maximization on gaussian cognitive MAC","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"University of British Columbia","funders":"Korea Advanced Institute of Science and Technology","keywords":"Cognitive radio; Mathematical optimization; Quadratic growth; Maximization; Relaxation (psychology); Gaussian; Quadratic equation; Interference (communication); Quadratic programming; Computer science; Quadratically constrained quadratic program; Channel (broadcasting); Simple (philosophy); Mathematics; Wireless; Algorithm; Telecommunications","score_opus":0.021656402379905064,"score_gpt":0.2764396514206182,"score_spread":0.25478324904071314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162973902","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.012925456,0.00028044218,0.9831108,0.00013251309,0.00003720423,0.000044541393,0.000026127163,0.000098908786,0.0033440266],"genre_scores_gemma":[0.8309905,0.00058653136,0.16446403,0.0002416518,0.0001213323,0.0001956051,0.00006931857,0.00008014208,0.0032508394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.0006881588,0.000057285593,0.00017416629,0.0003964114,0.00022736547],"domain_scores_gemma":[0.99867624,0.0008479433,0.00011541022,0.00012490405,0.00018968139,0.00004593373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024316378,0.0012610285,0.0013607143,0.0005236172,0.0005257011,0.0011234334,0.0017823373,0.0007936353,0.001511882],"category_scores_gemma":[0.0044700643,0.00046714768,0.0005342726,0.001264914,0.0011697013,0.0013044707,0.0018733632,0.0010751197,0.00033791034],"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.00014986547,0.000088718545,0.00012053762,0.00012575607,0.000046416775,0.00010221868,0.00013790003,0.87257195,0.0031008904,0.06437513,0.0022806996,0.056899942],"study_design_scores_gemma":[0.000015440282,0.000027154032,0.000022933207,0.0000038096823,0.000005693819,0.000014968603,0.000011227529,0.9883371,0.0003243665,0.010935846,0.00029672185,0.0000046666028],"about_ca_topic_score_codex":0.0020433704,"about_ca_topic_score_gemma":0.002598904,"teacher_disagreement_score":0.0024316378,"about_ca_system_score_codex":0.0009647999,"about_ca_system_score_gemma":0.0011651958,"threshold_uncertainty_score":0.012859821},"labels":[],"label_agreement":null},{"id":"W2162982100","doi":"10.1109/tcomm.2005.852816","title":"Estimators Using Noisy Channel Samples for Fading Distribution Parameters","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":20,"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":"Estimator; Fading; Channel (broadcasting); Moment (physics); Mathematics; Nakagami distribution; Noise (video); Statistics; Algorithm; M-estimator; Computer science; Telecommunications; Artificial intelligence","score_opus":0.07328313596317222,"score_gpt":0.3144403952948271,"score_spread":0.24115725933165488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162982100","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.006440453,0.00035039752,0.99268895,0.000042151183,0.000044208875,0.000019035337,0.00003300033,0.00012559391,0.00025620477],"genre_scores_gemma":[0.2814732,0.001182593,0.7146159,0.00013238624,0.00032804988,0.00023261091,0.0003999735,0.0000877596,0.0015475696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998184,0.0007863703,0.0001252741,0.0002526683,0.0005698265,0.000081771876],"domain_scores_gemma":[0.98773557,0.008073753,0.0013719425,0.001393877,0.0013269096,0.000097929944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041264268,0.0010943693,0.0014419099,0.0011565248,0.0002878642,0.0012118228,0.0009721386,0.0013939178,0.0010544915],"category_scores_gemma":[0.029540956,0.0006570322,0.00058774435,0.0011140698,0.00082969555,0.0027161129,0.0011924579,0.0012097942,0.00066339126],"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.00071368203,0.00009385347,0.0035012334,0.00044446802,0.00032791228,0.00018618253,0.00017195601,0.69035465,0.01639334,0.04559968,0.0016940371,0.24051885],"study_design_scores_gemma":[0.000063374966,0.000091899,0.00060969434,0.000037956233,0.00005251064,0.00017561768,0.000016545438,0.97701526,0.008085223,0.012363486,0.0014425797,0.000045948862],"about_ca_topic_score_codex":0.0003993701,"about_ca_topic_score_gemma":0.00045071603,"teacher_disagreement_score":0.0041264268,"about_ca_system_score_codex":0.00052986137,"about_ca_system_score_gemma":0.0006184469,"threshold_uncertainty_score":0.02182293},"labels":[],"label_agreement":null},{"id":"W2163039436","doi":"10.1109/tcomm.2009.02.070293","title":"Optical impulse modulation for indoor diffuse wireless communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Keying; Optical wireless; Channel (broadcasting); Electronic engineering; Low-pass filter; Computer science; On-off keying; High-pass filter; Wireless; Telecommunications; Bit error rate; Phase-shift keying; Bandwidth (computing); Engineering","score_opus":0.0333006113602244,"score_gpt":0.281511006509677,"score_spread":0.2482103951494526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163039436","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.088407256,0.0056484924,0.8800578,0.0007273529,0.00014235568,0.0000447187,0.00005719668,0.0003279889,0.024586927],"genre_scores_gemma":[0.82913023,0.005819728,0.15016657,0.00021058519,0.00025615594,0.000067775225,0.00009728334,0.00003524572,0.014216455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987376,0.000033982345,0.000003134213,0.000015703772,0.000057892696,0.000015492718],"domain_scores_gemma":[0.9998473,0.00006738434,0.000028903556,0.000021999322,0.000028310444,0.000006137985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001874618,0.00022131317,0.00016705466,0.00016946778,0.0001461792,0.00036828197,0.00023966904,0.00039511386,0.0019260085],"category_scores_gemma":[0.0003957917,0.000095632706,0.00015262754,0.00033420563,0.00036410568,0.0004461312,0.0003036802,0.0005620426,0.0003832748],"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.00025744684,0.00012819999,0.0020244278,0.0004429681,0.000031707972,0.000311854,0.00015007077,0.12194503,0.16846928,0.3402718,0.0052001253,0.36076704],"study_design_scores_gemma":[0.00004806548,0.00075963367,0.0026399472,0.00013453596,0.00006803116,0.0007832662,0.00015110454,0.8162729,0.04908079,0.07081669,0.05918576,0.00005932737],"about_ca_topic_score_codex":0.0005435549,"about_ca_topic_score_gemma":0.0008427343,"teacher_disagreement_score":0.0019260085,"about_ca_system_score_codex":0.0004679354,"about_ca_system_score_gemma":0.00038069914,"threshold_uncertainty_score":0.006443143},"labels":[],"label_agreement":null},{"id":"W2163192769","doi":"10.1109/tcomm.2011.062311.100352","title":"New Representations for the Gaussian Class Multivariate Weibull Distribution with Constant Correlation and Applications","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Weibull distribution; Mathematics; Cumulative distribution function; Fading; Fading distribution; Exponentiated Weibull distribution; Random variable; Gaussian; Applied mathematics; Weibull fading; Statistics; Additive white Gaussian noise; Probability density function; White noise; Rayleigh fading","score_opus":0.032815388097343474,"score_gpt":0.27276503831320453,"score_spread":0.23994965021586107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163192769","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.0013717657,0.0008215424,0.99482477,0.00014497116,0.000097746306,0.000015848243,0.00006131333,0.00014085179,0.0025212653],"genre_scores_gemma":[0.24475564,0.010251322,0.7241213,0.00050484523,0.0011539129,0.0003917245,0.0007304101,0.00049205567,0.0175989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993284,0.00014155514,0.00003573028,0.00007622248,0.00035679902,0.000061328086],"domain_scores_gemma":[0.9984578,0.0006057552,0.0001899938,0.00018893335,0.0005125623,0.000045009114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014545899,0.0011987415,0.00067018793,0.00227215,0.00039242918,0.0016767165,0.0012098674,0.0013132147,0.0032082333],"category_scores_gemma":[0.005795797,0.0004408157,0.0010904814,0.0023502023,0.00084111455,0.0024620572,0.00086091016,0.002239018,0.0014818318],"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.000045290995,0.00005072066,0.0007498727,0.00022059843,0.00004379476,0.00034238308,0.00018091605,0.19776197,0.006920373,0.67912287,0.008881457,0.10567967],"study_design_scores_gemma":[0.00000879407,0.000025041203,0.0004668432,0.000049222956,0.00002159463,0.00075488153,0.000051574738,0.85629696,0.0018028882,0.12509617,0.01537658,0.00004934605],"about_ca_topic_score_codex":0.0012471289,"about_ca_topic_score_gemma":0.0012079991,"teacher_disagreement_score":0.0032082333,"about_ca_system_score_codex":0.0009678219,"about_ca_system_score_gemma":0.0009130538,"threshold_uncertainty_score":0.010732591},"labels":[],"label_agreement":null},{"id":"W2163628514","doi":"10.1109/tcomm.2009.080143","title":"Data extraction from wireless sensor networks using distributed fountain codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":15,"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":"Computer science; Decoding methods; Fountain code; Wireless sensor network; Concatenation (mathematics); Channel (broadcasting); Wireless; Channel capacity; Real-time computing; Algorithm; Computer network; Concatenated error correction code; Telecommunications; Block code; Mathematics","score_opus":0.0694098788457642,"score_gpt":0.3317089390505193,"score_spread":0.2622990602047551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163628514","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.01955387,0.00014582666,0.97925824,0.00009123372,0.0000145876675,0.000022653952,0.00003736416,0.00020884063,0.0006673726],"genre_scores_gemma":[0.3905971,0.0003756313,0.60535204,0.00010560999,0.000036716097,0.00014988035,0.00023306857,0.000063581094,0.0030862615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.0001494375,0.000029280145,0.000078782585,0.00027924165,0.0000451401],"domain_scores_gemma":[0.9986494,0.00067406386,0.00017160553,0.00027924837,0.00018939794,0.00003629442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005510871,0.0005334368,0.0005286716,0.00055898615,0.00037278215,0.0005390199,0.0007125275,0.0006850365,0.00056732056],"category_scores_gemma":[0.0038234827,0.00026768973,0.00039002972,0.0007841098,0.00078050507,0.0012659042,0.0015056237,0.00078526547,0.00032876947],"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.0005636759,0.00008629933,0.0012516391,0.00025501556,0.00007003825,0.00037909276,0.00042065576,0.398819,0.13270703,0.062377173,0.0015471261,0.40152335],"study_design_scores_gemma":[0.000025676036,0.00006527139,0.0002544661,0.000021291356,0.000010148228,0.0002494584,0.000030363251,0.9112484,0.07091948,0.014269969,0.0028784384,0.000027013775],"about_ca_topic_score_codex":0.0012005566,"about_ca_topic_score_gemma":0.0016649957,"teacher_disagreement_score":0.0012005566,"about_ca_system_score_codex":0.00056118343,"about_ca_system_score_gemma":0.0007198327,"threshold_uncertainty_score":0.004071653},"labels":[],"label_agreement":null},{"id":"W2163850973","doi":"10.1109/tcomm.2008.060229","title":"Synchronization and Integration Region Optimization for UWB Signals with Non-coherent Detection and Auto-correlation Detection","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":29,"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":"Synchronization (alternating current); Integrator; Computer science; Bit error rate; Detection theory; Electronic engineering; Signal-to-noise ratio (imaging); Algorithm; Bandwidth (computing); Engineering; Detector; Telecommunications; Decoding methods","score_opus":0.016248104424547372,"score_gpt":0.21407982939087902,"score_spread":0.19783172496633164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163850973","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.02589094,0.00041080374,0.97300386,0.00003214506,0.000013535195,0.000012303186,0.000008337694,0.000101637095,0.0005264457],"genre_scores_gemma":[0.49727222,0.00037876138,0.50050634,0.00004695144,0.00004481087,0.00006624853,0.000062905194,0.000081657534,0.00154013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934,0.00022822361,0.000033752927,0.00012516872,0.00023580258,0.000037131304],"domain_scores_gemma":[0.9989197,0.0006288464,0.00023227015,0.000077952034,0.000118954624,0.000022264689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989734,0.00051436573,0.00051208946,0.0004887063,0.00020837664,0.0004927093,0.00053326617,0.0003950459,0.00062890124],"category_scores_gemma":[0.0034117508,0.00038334972,0.00031924012,0.0005626817,0.00048432712,0.0007429357,0.0006081522,0.00036696438,0.00018244784],"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.0006990688,0.00014036354,0.0015577145,0.00028483206,0.00011883145,0.00024125134,0.00030132371,0.45976785,0.14549573,0.05545804,0.0008926194,0.33504245],"study_design_scores_gemma":[0.00004272619,0.00015630499,0.0005880813,0.000011380711,0.00003005842,0.00013409722,0.000013812869,0.96268266,0.030774126,0.0044466658,0.0011004286,0.00001965655],"about_ca_topic_score_codex":0.00040574663,"about_ca_topic_score_gemma":0.0006749153,"teacher_disagreement_score":0.000989734,"about_ca_system_score_codex":0.00041331237,"about_ca_system_score_gemma":0.0008039886,"threshold_uncertainty_score":0.005234301},"labels":[],"label_agreement":null},{"id":"W2164196656","doi":"10.1109/26.905883","title":"NCFSK bit-error rate with unsynchronized slowly fading interferers","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bit error rate; Rician fading; Rayleigh fading; Additive white Gaussian noise; Interference (communication); Phase-shift keying; Algorithm; SIGNAL (programming language); Electronic engineering; Computer science; Mathematics; Fading; White noise; Telecommunications; Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.030604634206609548,"score_gpt":0.274525224788351,"score_spread":0.24392059058174145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164196656","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.3559389,0.001450496,0.61687875,0.000630311,0.00021946026,0.00015316383,0.0009444703,0.0013735143,0.022411088],"genre_scores_gemma":[0.93600833,0.00071480556,0.057210226,0.00010370452,0.000034685385,0.00014980065,0.00044472894,0.000073313095,0.0052603357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980938,0.0002709185,0.00013571832,0.0001959091,0.0010834745,0.00022014117],"domain_scores_gemma":[0.9947583,0.0024572765,0.0005882799,0.0006015142,0.0015485416,0.00004596669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001813615,0.00092875154,0.0007335275,0.0009154449,0.0006204799,0.0007405434,0.0007981133,0.0011469164,0.0021222136],"category_scores_gemma":[0.011289458,0.0001460254,0.00022395358,0.0012457892,0.0007654024,0.0012828655,0.0005677408,0.00043022068,0.0011417331],"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.00081052055,0.00013541892,0.007823917,0.0003038212,0.00008924867,0.0007135595,0.00027858696,0.7769035,0.04590874,0.044588342,0.004312468,0.11813182],"study_design_scores_gemma":[0.000029473806,0.00012932805,0.002368926,0.000044844954,0.00002773435,0.0006101255,0.00007826919,0.9533509,0.03390531,0.0070852283,0.00231046,0.000059332688],"about_ca_topic_score_codex":0.0065976297,"about_ca_topic_score_gemma":0.006186226,"teacher_disagreement_score":0.0065976297,"about_ca_system_score_codex":0.001824039,"about_ca_system_score_gemma":0.0012221211,"threshold_uncertainty_score":0.013234377},"labels":[],"label_agreement":null},{"id":"W2164982903","doi":"10.1109/tcomm.2014.2315791","title":"Probabilistic Availability Quantification of PON and WiMAX Based FiWi Access Networks for Future Smart Grid Applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Computer science; Backhaul (telecommunications); WiMAX; Base station; Probabilistic logic; Smart grid; Quality of service; Reachability; Grid; Distributed computing; Wireless; Engineering; Telecommunications","score_opus":0.030926663115607638,"score_gpt":0.276351501480081,"score_spread":0.24542483836447335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164982903","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.13711756,0.0010880558,0.8545687,0.0005098445,0.00004568909,0.000064231324,0.00024482573,0.00027643985,0.0060846736],"genre_scores_gemma":[0.9863165,0.0003022938,0.0124656325,0.000028459544,0.000029469971,0.00004592172,0.00008035199,0.000021312246,0.000710013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987281,0.00045012758,0.000048758386,0.00016125945,0.00043930873,0.00017232032],"domain_scores_gemma":[0.99597377,0.0027737778,0.0005594004,0.00019640378,0.000410166,0.000086354106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019085683,0.0006607556,0.00053789024,0.0008562791,0.0004495603,0.0010653005,0.00088052155,0.0006746922,0.0012281875],"category_scores_gemma":[0.0071109612,0.0004061245,0.00053159223,0.00064615835,0.00074567966,0.0021797586,0.0008739978,0.000820776,0.00009268008],"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.000035804507,0.000019587693,0.0007464603,0.000047153,0.000017684602,0.00005198497,0.0000278264,0.966355,0.0021146853,0.025931178,0.00023781498,0.0044148345],"study_design_scores_gemma":[8.126966e-7,0.000009879733,0.00019486062,0.0000030422389,0.000003293428,0.000015480455,0.0000059365943,0.99540186,0.00020227546,0.004051648,0.00010802469,0.0000028364873],"about_ca_topic_score_codex":0.0033355104,"about_ca_topic_score_gemma":0.00269025,"teacher_disagreement_score":0.0033355104,"about_ca_system_score_codex":0.001530732,"about_ca_system_score_gemma":0.0006748623,"threshold_uncertainty_score":0.011106312},"labels":[],"label_agreement":null},{"id":"W2165415702","doi":"10.1109/tcomm.2005.863766","title":"An enhanced widely linear CDMA receiver with OQPSK modulation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Phase-shift keying; Minimum-shift keying; Electronic engineering; Code division multiple access; Computer science; Asynchronous communication; Demodulation; Keying; Radio receiver design; Fading; Pulse-position modulation; Modulation (music); Telecommunications; Bit error rate; Pulse-amplitude modulation; Engineering; Transmitter; Detector; Physics; Channel (broadcasting); Pulse (music)","score_opus":0.03211758633553163,"score_gpt":0.30144709951128534,"score_spread":0.2693295131757537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165415702","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.045380622,0.00055284065,0.9506334,0.00008930773,0.00003684559,0.000041762913,0.00001869321,0.0002880388,0.0029584416],"genre_scores_gemma":[0.66966933,0.0005572554,0.32312793,0.00018767371,0.00011590063,0.000047903297,0.00005545175,0.0000263467,0.0062122773],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00018781386,0.000039069793,0.00015909197,0.00035174217,0.000065932836],"domain_scores_gemma":[0.9992493,0.0003075838,0.00011517937,0.00008231805,0.0002231546,0.000022549446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006625967,0.00044904806,0.00039727826,0.000294571,0.00017269353,0.00063322164,0.0008249588,0.0006395595,0.001024141],"category_scores_gemma":[0.0013137283,0.00020105822,0.00032665805,0.0003449204,0.00033397914,0.0007961368,0.00063170475,0.0005861117,0.0007091434],"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.0006776584,0.00015401343,0.002650952,0.00037720264,0.00011936984,0.0004305069,0.00025183216,0.11274574,0.53507835,0.021536542,0.00074328476,0.3252346],"study_design_scores_gemma":[0.000057572524,0.0008970208,0.00074568077,0.00003937219,0.00008132636,0.00078142836,0.00003939679,0.873577,0.11476085,0.0017145628,0.007263036,0.000042661548],"about_ca_topic_score_codex":0.00041988198,"about_ca_topic_score_gemma":0.00052170566,"teacher_disagreement_score":0.001024141,"about_ca_system_score_codex":0.00028709046,"about_ca_system_score_gemma":0.00040263546,"threshold_uncertainty_score":0.003504157},"labels":[],"label_agreement":null},{"id":"W2165441308","doi":"10.1109/tcomm.2010.12.100002","title":"Two-Way MIMO Relay Precoder Design with Channel State Information","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"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":"Precoding; Relay; Relay channel; Channel state information; MIMO; Optimization problem; Computer science; Channel (broadcasting); Convex optimization; Control theory (sociology); Mathematical optimization; Wireless; Mathematics; Algorithm; Regular polygon; Computer network; Telecommunications","score_opus":0.04479262687496076,"score_gpt":0.27523187501586266,"score_spread":0.2304392481409019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165441308","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.004814516,0.00016516534,0.9933308,0.00007215388,0.00003066648,0.000050720526,0.00004361234,0.00011876677,0.0013736726],"genre_scores_gemma":[0.5840173,0.00087632536,0.40944368,0.00019455621,0.00011564389,0.0003738423,0.00020176021,0.000046798115,0.004730068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.00029337374,0.000045932484,0.00019195475,0.0002055087,0.00008253296],"domain_scores_gemma":[0.9993112,0.0002882247,0.00008844393,0.00010396602,0.0001782185,0.00002996101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786315,0.0012880585,0.0009827745,0.00032270435,0.00030246083,0.0010072083,0.00087142753,0.0010344456,0.0014954852],"category_scores_gemma":[0.0017719446,0.00041141623,0.00051437406,0.0005419434,0.00052235526,0.0009275476,0.00070044975,0.00077095703,0.0007135315],"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.00026675488,0.00013924338,0.0006129707,0.0005473228,0.00019792306,0.00044747486,0.00031770294,0.7385231,0.057446215,0.054513548,0.0028105131,0.14417726],"study_design_scores_gemma":[0.00007139995,0.00027464397,0.00017302838,0.000022482724,0.000047259593,0.00028588483,0.00003278156,0.97732633,0.01225858,0.006124443,0.0033489226,0.00003418979],"about_ca_topic_score_codex":0.0009379037,"about_ca_topic_score_gemma":0.0015111695,"teacher_disagreement_score":0.0014954852,"about_ca_system_score_codex":0.00045133708,"about_ca_system_score_gemma":0.0009723637,"threshold_uncertainty_score":0.0050028563},"labels":[],"label_agreement":null},{"id":"W2165479285","doi":"10.1109/tcomm.2012.082812.110813","title":"Double-Loop Receiver-Initiated MAC for Cooperative Data Dissemination via Roadside WLANs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant 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":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Network packet; Roaming; Node (physics); Local area network; Overhead (engineering); Relay; Dissemination; Channel (broadcasting); Wi-Fi; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.1748730875254381,"score_gpt":0.369360642529684,"score_spread":0.1944875550042459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165479285","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.080065385,0.0012014052,0.91569275,0.00012930932,0.00004178603,0.000064700216,0.000015906888,0.00027843026,0.0025103283],"genre_scores_gemma":[0.9499666,0.0004980583,0.048203085,0.000047749545,0.00003814383,0.00007326825,0.000022462855,0.000012785456,0.0011377811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994091,0.00021742976,0.000026669906,0.00010265729,0.00016551252,0.0000786175],"domain_scores_gemma":[0.99821436,0.0008988611,0.000344169,0.00013890695,0.00035067808,0.000053033462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011285702,0.00043703124,0.00048295883,0.00052710646,0.0004558746,0.0005871259,0.0010024393,0.00042198983,0.0005813088],"category_scores_gemma":[0.0027633156,0.00017011701,0.00030485616,0.00047168284,0.00055254134,0.0008067699,0.0007001907,0.00042944174,0.00014061815],"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.0004010415,0.00024665968,0.004205032,0.000545592,0.00018043436,0.000775845,0.0011571223,0.7071858,0.0825115,0.05880763,0.0018630112,0.14212042],"study_design_scores_gemma":[0.000010641009,0.00017594431,0.00020220461,0.000006003312,0.00002285446,0.00009174518,0.00005116879,0.9926495,0.0036807028,0.0015869088,0.001510098,0.0000122771135],"about_ca_topic_score_codex":0.0011305964,"about_ca_topic_score_gemma":0.0010797081,"teacher_disagreement_score":0.0011305964,"about_ca_system_score_codex":0.00056944555,"about_ca_system_score_gemma":0.0005451662,"threshold_uncertainty_score":0.005968511},"labels":[],"label_agreement":null},{"id":"W2165621383","doi":"10.1109/tcomm.2011.051311.100311","title":"Precise BER Computation for Binary Data Detection in Bandlimited White Laplace Noise","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":27,"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":"Detector; Bit error rate; Bandlimiting; Algorithm; Noise (video); Electronic engineering; Computer science; White noise; Fading; Matched filter; Mathematics; Telecommunications; Engineering; Decoding methods","score_opus":0.07761552155626805,"score_gpt":0.2766512451577495,"score_spread":0.19903572360148147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165621383","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.04636689,0.00059393066,0.9474966,0.0001832069,0.000044107575,0.000022911838,0.000055791614,0.00036475685,0.004871755],"genre_scores_gemma":[0.75719565,0.00082211295,0.23650016,0.00011227867,0.000043804477,0.00006956798,0.00014501036,0.00011816814,0.0049932296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.00016351047,0.000030347785,0.000062606516,0.0003746542,0.000046505516],"domain_scores_gemma":[0.9975963,0.0017284061,0.00014182107,0.00016057443,0.00034181113,0.000031048512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015762824,0.00048982236,0.0009185935,0.0008966612,0.0004193328,0.00095356716,0.000503391,0.00093168527,0.0031997554],"category_scores_gemma":[0.0076855742,0.00026382727,0.00035752254,0.0005592971,0.0007916745,0.00158052,0.000626273,0.0007679047,0.0006898419],"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.00031422847,0.00006658649,0.0010556453,0.0003991202,0.00003933199,0.00033170913,0.0003473132,0.74345124,0.026486281,0.17191245,0.0013315,0.05426456],"study_design_scores_gemma":[0.0000070269907,0.000018486537,0.00021944044,0.000019713698,0.0000045993247,0.00010593509,0.000014643397,0.9834795,0.003675169,0.012114712,0.00033089047,0.000009845195],"about_ca_topic_score_codex":0.0012165629,"about_ca_topic_score_gemma":0.0015849303,"teacher_disagreement_score":0.0031997554,"about_ca_system_score_codex":0.0009932125,"about_ca_system_score_gemma":0.0008092599,"threshold_uncertainty_score":0.010704279},"labels":[],"label_agreement":null},{"id":"W2166346249","doi":"10.1109/tcomm.2013.112513.130143","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel&amp;#x2014;Part II: Binary Inputs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Binary number; Poisson distribution; Channel (broadcasting); Current (fluid); Channel capacity; Mathematics; Applied mathematics; Binary Independence Model; Topology (electrical circuits); Work (physics); Probability mass function; Mathematical optimization; Computer science; Probability distribution; Statistical physics; Algorithm; Physics; Telecommunications; Statistics; Combinatorics","score_opus":0.03810030262917415,"score_gpt":0.2596301644287842,"score_spread":0.22152986179961007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166346249","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.14679833,0.0013958069,0.78544223,0.001581023,0.00012485178,0.00016880094,0.000870184,0.0003640277,0.06325466],"genre_scores_gemma":[0.96523994,0.00085278065,0.028406944,0.00015932959,0.000081898994,0.00013673602,0.0001778944,0.000052945532,0.004891574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990637,0.00029860993,0.000030015066,0.00007903755,0.00030168585,0.00022699588],"domain_scores_gemma":[0.99200386,0.006028742,0.0006792264,0.00032395907,0.0007426898,0.00022154202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022659786,0.000624826,0.00060460885,0.0008247564,0.00067777565,0.0020457853,0.0009851172,0.0008408978,0.0058092647],"category_scores_gemma":[0.010263519,0.00033912554,0.00044760076,0.0012643322,0.001913425,0.0014782132,0.0010945597,0.001326506,0.00066708465],"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.00019148043,0.000073964984,0.0008551086,0.00023914361,0.000023535375,0.00021704819,0.00023050618,0.40031907,0.00488999,0.57435817,0.0031485436,0.015453553],"study_design_scores_gemma":[0.000023239081,0.000044715798,0.00040347344,0.000040906223,0.000008835386,0.00016203013,0.00012726153,0.88489777,0.0028940863,0.11007568,0.0012887733,0.00003317974],"about_ca_topic_score_codex":0.0013897344,"about_ca_topic_score_gemma":0.0010044872,"teacher_disagreement_score":0.0058092647,"about_ca_system_score_codex":0.002327324,"about_ca_system_score_gemma":0.0011552568,"threshold_uncertainty_score":0.019433975},"labels":[],"label_agreement":null},{"id":"W2166478505","doi":"10.1109/tcomm.2007.910589","title":"Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":52,"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":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Bit error rate; Parity bit; Error detection and correction; Binary number; Computer science; Mathematics; Arithmetic","score_opus":0.04991802552880289,"score_gpt":0.3278226457086265,"score_spread":0.27790462017982365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166478505","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.17082587,0.00014661648,0.82741535,0.000043308388,0.00000889824,0.000047296187,0.00012101647,0.00036851366,0.0010231212],"genre_scores_gemma":[0.80729616,0.00023992886,0.19153121,0.000016338392,0.000011416744,0.00009817902,0.00019425733,0.000051634477,0.0005607631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.00047399994,0.00004499507,0.00012197312,0.00045467124,0.000073459196],"domain_scores_gemma":[0.99226284,0.005467298,0.00073269074,0.0006650095,0.0007861254,0.00008608653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017722035,0.0006895505,0.0006792021,0.0013319117,0.00032207675,0.0006944881,0.00076167815,0.00074943894,0.00045883132],"category_scores_gemma":[0.016185991,0.00033076896,0.0002643704,0.0006139591,0.0009619289,0.0011793262,0.0006285989,0.0006083434,0.00023120886],"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.00031134835,0.000042348478,0.004619724,0.000084601335,0.00003990617,0.00010889653,0.000112954374,0.91320896,0.01870821,0.014123998,0.00020803601,0.04843108],"study_design_scores_gemma":[0.000005819491,0.000015412037,0.0006051732,0.0000069066195,0.000003883633,0.000030382549,0.0000053035096,0.98690367,0.010100327,0.0022325292,0.00007553001,0.00001493511],"about_ca_topic_score_codex":0.0027014934,"about_ca_topic_score_gemma":0.001622702,"teacher_disagreement_score":0.0027014934,"about_ca_system_score_codex":0.000828136,"about_ca_system_score_gemma":0.0008386576,"threshold_uncertainty_score":0.009372473},"labels":[],"label_agreement":null},{"id":"W2166527432","doi":"10.1109/tcomm.2012.030712.110086","title":"Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Encoder; Binary number; Channel (broadcasting); Computer science; Decoding methods; Binary code; Turbo code; Block code; Concatenated error correction code; Mathematics; Topology (electrical circuits); Telecommunications; Arithmetic; Combinatorics","score_opus":0.05597118724263235,"score_gpt":0.29642800139864084,"score_spread":0.2404568141560085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166527432","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.2357046,0.00015695534,0.7609681,0.00018332813,0.000033410837,0.00005567849,0.00010317569,0.00040959264,0.0023852624],"genre_scores_gemma":[0.81914407,0.00015608229,0.17926913,0.00006303054,0.000020192798,0.000081500155,0.00012235533,0.000041351457,0.0011022581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000059436272,0.00000981411,0.000025641819,0.000059502287,0.000029491886],"domain_scores_gemma":[0.99935097,0.00020192562,0.00015390359,0.00013954376,0.00010486828,0.00004876396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025922965,0.00026415422,0.00025328915,0.0003455278,0.00024039429,0.0002445159,0.00037204847,0.00027780203,0.0004805894],"category_scores_gemma":[0.0010646168,0.00017824801,0.00021541372,0.00037108694,0.0004934895,0.0002919089,0.00047882547,0.00034180595,0.00016872997],"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.0004328933,0.0000875717,0.0024825144,0.0003048844,0.000053666456,0.00043387723,0.00030997267,0.5681492,0.19680706,0.08925523,0.0014258968,0.14025721],"study_design_scores_gemma":[0.000050198083,0.00032097203,0.0006733158,0.000019525958,0.000016250511,0.00026964833,0.000034752793,0.9361037,0.04367011,0.01535408,0.0034552712,0.000032123124],"about_ca_topic_score_codex":0.00039154594,"about_ca_topic_score_gemma":0.0006290421,"teacher_disagreement_score":0.0004805894,"about_ca_system_score_codex":0.0002991434,"about_ca_system_score_gemma":0.00057418464,"threshold_uncertainty_score":0.0021704435},"labels":[],"label_agreement":null},{"id":"W2166757187","doi":"10.1109/tcomm.2010.092810.090322","title":"On the Performance of Cooperative-Diversity Networks with the Nth Best-Relay Selection Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":147,"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; University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Expression (computer science); Cooperative diversity; Moment-generating function; Diversity combining; Signal-to-noise ratio (imaging); Node (physics); Maximal-ratio combining; Selection (genetic algorithm); Closed-form expression; Probability density function; Topology (electrical circuits); Computer science; Function (biology); Mathematics; Algorithm; Fading; Telecommunications; Statistics; Combinatorics; Channel (broadcasting); Engineering; Physics; Artificial intelligence; Power (physics)","score_opus":0.034647051076152055,"score_gpt":0.25618566852892566,"score_spread":0.2215386174527736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166757187","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.67255646,0.0058259685,0.27970353,0.0016116695,0.00020102446,0.00007830286,0.00044142478,0.00036940785,0.039212238],"genre_scores_gemma":[0.99494606,0.0006897634,0.0030258223,0.00005946342,0.000045830337,0.000019510127,0.00006125336,0.000017868517,0.0011344198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00065406994,0.000033775614,0.00015407747,0.00032412427,0.00035842706],"domain_scores_gemma":[0.99359846,0.004305086,0.00051695015,0.0003451607,0.0010876216,0.00014682778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025469868,0.0015840598,0.0010564247,0.0009305842,0.0008076505,0.0012210243,0.0011659941,0.0014402439,0.0012909262],"category_scores_gemma":[0.010263137,0.00038893535,0.00056827604,0.0011102279,0.0022051854,0.0016712508,0.00153424,0.00070958247,0.00034876],"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.00015036137,0.00002947668,0.0008239985,0.00005756599,0.000036251335,0.0001610552,0.00011142008,0.97512096,0.0020568133,0.016891267,0.00046142362,0.00409941],"study_design_scores_gemma":[0.000010871182,0.000076212615,0.00039123758,0.000017537544,0.000020375519,0.00008549461,0.00005817263,0.9931369,0.0007180792,0.005287186,0.00017838857,0.000019679273],"about_ca_topic_score_codex":0.00918331,"about_ca_topic_score_gemma":0.0064769094,"teacher_disagreement_score":0.00918331,"about_ca_system_score_codex":0.0022901958,"about_ca_system_score_gemma":0.001261202,"threshold_uncertainty_score":0.018259704},"labels":[],"label_agreement":null},{"id":"W2167040808","doi":"10.1109/tcomm.2009.09.070595","title":"Relay ordering in a multi-hop cooperative diversity network","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"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":"Relay; Hop (telecommunications); Expression (computer science); Algorithm; Computer science; Computational complexity theory; Signal-to-noise ratio (imaging); Bit error rate; Diversity combining; Outage probability; Cooperative diversity; Probability of error; Selection (genetic algorithm); Mathematics; Mathematical optimization; Telecommunications; Decoding methods; Fading; Artificial intelligence","score_opus":0.0871327742830498,"score_gpt":0.3105994923613186,"score_spread":0.22346671807826882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167040808","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.074431464,0.00046480176,0.9228842,0.00012056207,0.00001930585,0.000032718315,0.000022823187,0.00018878939,0.0018353269],"genre_scores_gemma":[0.79627794,0.00026463735,0.20171629,0.000054935805,0.000020058713,0.00004934431,0.000037629932,0.000024834417,0.0015543532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899775,0.00046962427,0.000042494295,0.00013077735,0.00024922058,0.00011011738],"domain_scores_gemma":[0.9989686,0.00052588596,0.00014033297,0.00016499948,0.00015245761,0.000047819532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689038,0.0004290029,0.00063636224,0.00043539313,0.00046963902,0.00061093114,0.0006662396,0.0005654419,0.0005407584],"category_scores_gemma":[0.0023516337,0.0003164375,0.0001992496,0.00057912024,0.0005929922,0.0012275523,0.0007079796,0.0004937005,0.00020556142],"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.00028463462,0.000046236877,0.00078580313,0.00006652258,0.000021143765,0.00023805686,0.00022720249,0.8640791,0.0156160835,0.032892298,0.0006922428,0.085050605],"study_design_scores_gemma":[0.000020031135,0.00008885148,0.00012228351,0.0000052839796,0.000008405052,0.00008991255,0.000024012777,0.98359585,0.004412121,0.010830197,0.00079263485,0.000010373094],"about_ca_topic_score_codex":0.00094466546,"about_ca_topic_score_gemma":0.0011918753,"teacher_disagreement_score":0.0010689038,"about_ca_system_score_codex":0.00063042337,"about_ca_system_score_gemma":0.00057793804,"threshold_uncertainty_score":0.005652964},"labels":[],"label_agreement":null},{"id":"W2167340446","doi":"10.1109/tcomm.2011.121410.090612","title":"Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","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":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Sequential decoding; List decoding; Parity-check matrix; Berlekamp–Welch algorithm; Algorithm; Computer science; Low-density parity-check code; Binary number; Concatenated error correction code; Binary symmetric channel; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.025563512691039552,"score_gpt":0.3060731576643248,"score_spread":0.28050964497328523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167340446","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.00241316,0.00029418553,0.9962478,0.000040958625,0.000023827948,0.000029744488,0.000017998393,0.0002454587,0.000686773],"genre_scores_gemma":[0.069906,0.0006970785,0.9265738,0.00005879856,0.00005121654,0.00018248858,0.000112238435,0.000080422615,0.0023380588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852246,0.000386452,0.00009055651,0.0001077131,0.0007962349,0.00009654862],"domain_scores_gemma":[0.99821377,0.00093878136,0.0001926549,0.00019489667,0.0004134151,0.00004647936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052826,0.001195393,0.00077732676,0.0014431071,0.0004392377,0.0007545005,0.0013155557,0.0008111959,0.0016162882],"category_scores_gemma":[0.0038601332,0.000555808,0.00085628446,0.0010317999,0.00070396473,0.0011025796,0.0013429852,0.0016297712,0.0010966486],"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.00031503534,0.00010622875,0.0008559061,0.000604529,0.00017797739,0.0003201829,0.00058560364,0.14739199,0.07159094,0.08753776,0.0028502208,0.6876636],"study_design_scores_gemma":[0.0000618118,0.0001388759,0.0003235632,0.000067907065,0.000043972606,0.00046397734,0.00003785152,0.9118726,0.053402398,0.026712323,0.0068094414,0.00006526561],"about_ca_topic_score_codex":0.00089054153,"about_ca_topic_score_gemma":0.0014009192,"teacher_disagreement_score":0.0016162882,"about_ca_system_score_codex":0.0006951556,"about_ca_system_score_gemma":0.001033048,"threshold_uncertainty_score":0.0054070354},"labels":[],"label_agreement":null},{"id":"W2167969644","doi":"10.1109/tcomm.2005.855020","title":"SER of Threshold-Based Hybrid Selection/Maximal-Ratio Combining in Correlated Nakagami Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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 Alberta","funders":"","keywords":"Nakagami distribution; Fading; Maximal-ratio combining; Mathematics; Algorithm; Modulation (music); Phase-shift keying; Statistics; Selection (genetic algorithm); Fading distribution; Bit error rate; Topology (electrical circuits); Computer science; Combinatorics; Physics; Decoding methods","score_opus":0.022247214505831312,"score_gpt":0.26589564940156657,"score_spread":0.24364843489573526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167969644","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.23427291,0.001796654,0.7444472,0.00035981688,0.00008697667,0.000058710768,0.00018019752,0.000543084,0.01825443],"genre_scores_gemma":[0.9825147,0.00041747268,0.016190456,0.000046378842,0.000028232369,0.000024568928,0.000045147135,0.000032856235,0.00070013036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986394,0.00061414606,0.000052381194,0.00011864247,0.0004161465,0.0001592853],"domain_scores_gemma":[0.99645585,0.00237134,0.00033713342,0.00038206755,0.00037547108,0.000078074234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033113144,0.0010020259,0.00095778296,0.0006171868,0.00042564896,0.0014253482,0.00064016867,0.0007352652,0.0011225386],"category_scores_gemma":[0.006390673,0.0003692234,0.00050853175,0.0008152541,0.0016505003,0.0011401322,0.0010382339,0.00053966505,0.00041280128],"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.0004246044,0.000024755866,0.0017125786,0.00015840151,0.00009894379,0.0002903536,0.00014020193,0.8803049,0.015644489,0.08397045,0.00063848414,0.016591841],"study_design_scores_gemma":[0.000014712409,0.0000684123,0.00048118076,0.000023794393,0.000035225847,0.00016556102,0.000023266348,0.979552,0.0053591817,0.01396013,0.0002945708,0.00002200932],"about_ca_topic_score_codex":0.0009958071,"about_ca_topic_score_gemma":0.00076819333,"teacher_disagreement_score":0.0033113144,"about_ca_system_score_codex":0.0012368438,"about_ca_system_score_gemma":0.0008645592,"threshold_uncertainty_score":0.017512143},"labels":[],"label_agreement":null},{"id":"W2168020874","doi":"10.1109/tcomm.2004.840639","title":"High-Rate Punctured Convolutional Self-Doubly Orthogonal Codes for Iterative Threshold Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Puncturing; Sequential decoding; Serial concatenated convolutional codes; Algorithm; Decoding methods; Turbo code; Viterbi decoder; Concatenated error correction code; Computer science; List decoding; Linear code; Mathematics; Block code; Telecommunications","score_opus":0.027152906773087012,"score_gpt":0.2813389561534958,"score_spread":0.2541860493804088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168020874","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.08462987,0.0006059414,0.9102143,0.00007046789,0.00002290827,0.000054545988,0.000041246883,0.00026547327,0.004095214],"genre_scores_gemma":[0.6217411,0.0006300993,0.37556496,0.000049893915,0.000024354393,0.00007269131,0.00009692225,0.00007324586,0.0017465459],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958867,0.00013562352,0.000025500627,0.00003071976,0.00019132259,0.000028145256],"domain_scores_gemma":[0.9982351,0.0010418312,0.00020973357,0.00023635171,0.00024743006,0.000029665523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048597623,0.00035172148,0.0003346826,0.00026998087,0.0002174824,0.00044836113,0.00034838583,0.00037716283,0.0007412533],"category_scores_gemma":[0.0030448677,0.0001463178,0.00029853822,0.00041000827,0.0005771987,0.00045363588,0.00036995413,0.0004702895,0.0002758595],"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.0003556503,0.000058947157,0.0032704368,0.00053286477,0.000071167546,0.00062905,0.0005549243,0.17132902,0.43573073,0.22054124,0.001335105,0.16559091],"study_design_scores_gemma":[0.000019801184,0.00025183073,0.0010229538,0.00006258957,0.000037084683,0.0010586032,0.00003458849,0.6698298,0.30213013,0.018871162,0.006639366,0.000041999374],"about_ca_topic_score_codex":0.00038543457,"about_ca_topic_score_gemma":0.00047154975,"teacher_disagreement_score":0.0007412533,"about_ca_system_score_codex":0.00047507728,"about_ca_system_score_gemma":0.0005834269,"threshold_uncertainty_score":0.0034469366},"labels":[],"label_agreement":null},{"id":"W2168253435","doi":"10.1109/tcomm.2011.022811.090623","title":"Resource Management in Spectrum-Sharing Cognitive Radio Broadcast Channels: Adaptive Time and Power Allocation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":40,"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":"Cognitive radio; Transmitter; Computer science; Computer network; Fading; Base station; Transmission (telecommunications); Resource allocation; Channel (broadcasting); Interference (communication); Transmitter power output; Channel state information; Resource management (computing); Electronic engineering; Telecommunications; Wireless; Engineering","score_opus":0.04012262094412388,"score_gpt":0.24617390776058143,"score_spread":0.20605128681645754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168253435","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.063183345,0.001001034,0.9291457,0.0003581157,0.00009529564,0.00007005423,0.000033025226,0.00011642698,0.00599701],"genre_scores_gemma":[0.96626395,0.000442346,0.031827006,0.00007833786,0.00009530784,0.00006380489,0.00001078543,0.000017358389,0.0012011526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992415,0.00026672008,0.00002385883,0.000113988586,0.00019557105,0.00015845547],"domain_scores_gemma":[0.99879444,0.0007285614,0.00016713388,0.000095495125,0.00015409492,0.00006021521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012620043,0.00066620717,0.00075804524,0.00035926249,0.00049558317,0.0012171611,0.0011904417,0.0008383169,0.0009069874],"category_scores_gemma":[0.003293078,0.000263343,0.0003598644,0.00066131604,0.0013487296,0.0011053043,0.0007183569,0.00063953904,0.00014684098],"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.00018466558,0.00012794352,0.00062436785,0.00012855322,0.000056838897,0.00017673286,0.00018477868,0.9027133,0.00814038,0.050157897,0.00074986217,0.036754604],"study_design_scores_gemma":[0.000024648638,0.000053195028,0.00015658942,0.000005488134,0.000016172096,0.0000444861,0.000037522368,0.98592037,0.00096868834,0.012306316,0.0004548166,0.000011700697],"about_ca_topic_score_codex":0.0031237733,"about_ca_topic_score_gemma":0.0025253443,"teacher_disagreement_score":0.0031237733,"about_ca_system_score_codex":0.00095487357,"about_ca_system_score_gemma":0.0009436026,"threshold_uncertainty_score":0.0069280863},"labels":[],"label_agreement":null},{"id":"W2168590314","doi":"10.1109/26.923811","title":"Performance of multidimensional multicode DS-CDMA using code diversity and error detection","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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 Victoria","funders":"","keywords":"Computer science; Diversity scheme; Diversity gain; Electronic engineering; Precoding; Fading; Multipath propagation; Code division multiple access; Channel (broadcasting); Algorithm; Telecommunications; MIMO; Engineering","score_opus":0.05725839522726844,"score_gpt":0.28440142048473144,"score_spread":0.227143025257463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168590314","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.74986464,0.001688495,0.23002459,0.0004511518,0.00018521238,0.00007046152,0.00015353474,0.001297437,0.01626458],"genre_scores_gemma":[0.9794998,0.00023571713,0.018907672,0.0000733971,0.000039475886,0.000026117934,0.00007795463,0.000027225751,0.001112707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.00045346297,0.000071757364,0.00026698573,0.000921371,0.0002964496],"domain_scores_gemma":[0.99621993,0.0016484825,0.00037768448,0.00050701277,0.0011159915,0.00013095661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019435753,0.0010023883,0.00070788484,0.00070439593,0.00059891073,0.0011546391,0.0005823753,0.0014839217,0.0011549906],"category_scores_gemma":[0.0060418984,0.00030038485,0.00026917103,0.00064310426,0.0008022785,0.0011438886,0.0008687935,0.0005745236,0.00049769285],"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.003665442,0.0005347689,0.019046634,0.00051725213,0.0004778538,0.0006469541,0.0006764097,0.35268205,0.3523282,0.032185584,0.0021817915,0.23505706],"study_design_scores_gemma":[0.00015654536,0.0012677943,0.004249194,0.0000382629,0.00010065466,0.00072037376,0.000074689844,0.8329761,0.1533644,0.0044568838,0.0025028584,0.00009223307],"about_ca_topic_score_codex":0.0019314123,"about_ca_topic_score_gemma":0.0016006884,"teacher_disagreement_score":0.0019435753,"about_ca_system_score_codex":0.0006838738,"about_ca_system_score_gemma":0.0009814448,"threshold_uncertainty_score":0.010278702},"labels":[],"label_agreement":null},{"id":"W2168825220","doi":"10.1109/tcomm.2011.062311.100108","title":"Novel Representations for the Equicorrelated Multivariate Non-Central Chi-Square Distribution and Applications to MIMO Systems in Correlated Rician Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Cumulative distribution function; Mathematics; Fading; MIMO; Probability density function; Square (algebra); Fading distribution; Degrees of freedom (physics and chemistry); Multivariate statistics; Applied mathematics; Wishart distribution; Representation (politics); Algorithm; Statistics; Rayleigh fading","score_opus":0.050920027505430066,"score_gpt":0.29711512392165457,"score_spread":0.2461950964162245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168825220","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.0017225808,0.00037255627,0.9961765,0.00012676566,0.00007841225,0.000013358098,0.000039830164,0.00008902321,0.0013810472],"genre_scores_gemma":[0.24457859,0.004885929,0.733573,0.00064151536,0.0009413946,0.0003905449,0.00057700963,0.0004036456,0.014008301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994204,0.00015968252,0.00002801098,0.00006298986,0.00026924632,0.0000596583],"domain_scores_gemma":[0.99773705,0.0011618052,0.00026227816,0.00022305861,0.0005367206,0.00007905751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014131571,0.0012310025,0.0005742137,0.0012109454,0.0002842037,0.0015281556,0.0011760158,0.0012066041,0.0036609594],"category_scores_gemma":[0.0074339863,0.00032939442,0.0007890716,0.0016086807,0.0009803902,0.0023972918,0.00084059534,0.0023744034,0.0014728212],"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.00005366272,0.000078660414,0.0006973903,0.00022427188,0.00004135916,0.00037094395,0.00022741401,0.20471998,0.0080648335,0.68445337,0.008637967,0.09243018],"study_design_scores_gemma":[0.000008624385,0.000032626253,0.00028929207,0.000031066433,0.000012118176,0.0006208845,0.000047266953,0.8876107,0.0012253588,0.10412702,0.005958624,0.00003641676],"about_ca_topic_score_codex":0.00091350067,"about_ca_topic_score_gemma":0.0013319541,"teacher_disagreement_score":0.0036609594,"about_ca_system_score_codex":0.00080440164,"about_ca_system_score_gemma":0.0010052305,"threshold_uncertainty_score":0.012247086},"labels":[],"label_agreement":null},{"id":"W2169235621","doi":"10.1109/tcomm.2004.833015","title":"Performance of Digital Linear Modulations on Weibull Slow-Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":105,"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":"Fading; Weibull distribution; Fading distribution; Weibull fading; Diversity combining; Moment-generating function; Mathematics; Maximal-ratio combining; Electronic engineering; Diversity scheme; Channel (broadcasting); Statistics; Computer science; Algorithm; Topology (electrical circuits); Probability density function; Telecommunications; Engineering; Rayleigh fading; Combinatorics","score_opus":0.02838365057344143,"score_gpt":0.2648190963710286,"score_spread":0.23643544579758713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169235621","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.7514732,0.0033194101,0.23506661,0.00045386556,0.00009041029,0.000061848565,0.00035264104,0.0007781775,0.00840386],"genre_scores_gemma":[0.9944143,0.0005234483,0.004139182,0.000039384322,0.000023653058,0.000016477748,0.0000683578,0.000020292073,0.00075481646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985795,0.00045850876,0.00005899563,0.00011704652,0.00041910977,0.0003667944],"domain_scores_gemma":[0.99112016,0.0065038796,0.00063583604,0.00046383424,0.0011407449,0.00013546784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018245999,0.0011212096,0.0007307415,0.00089967827,0.0007219435,0.0010199809,0.0004783148,0.0009861591,0.0014328423],"category_scores_gemma":[0.008177071,0.0002738903,0.00033401034,0.0011720391,0.0010053435,0.00091908505,0.0008627866,0.0005297142,0.0004910263],"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.0017819776,0.000059113838,0.008968498,0.00020871431,0.00012528537,0.0002920633,0.00020026295,0.9033381,0.022973528,0.012031166,0.00068935554,0.049331963],"study_design_scores_gemma":[0.000038485978,0.00045005977,0.0033427333,0.00003922275,0.000059051155,0.00027686424,0.00008185511,0.97433597,0.0152532365,0.0055277217,0.00053523504,0.000059493985],"about_ca_topic_score_codex":0.0019644352,"about_ca_topic_score_gemma":0.0012523052,"teacher_disagreement_score":0.0019644352,"about_ca_system_score_codex":0.0009255732,"about_ca_system_score_gemma":0.00047902568,"threshold_uncertainty_score":0.009649515},"labels":[],"label_agreement":null},{"id":"W2169313213","doi":"10.1109/tcomm.2011.030411.100418","title":"Capacity and Delay Analysis of Next-Generation Passive Optical Networks (NG-PONs)","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":86,"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 à Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Passive optical network; Computer network; Network packet; Computer science; Throughput; Pons; Ethernet; Electronic engineering; Wavelength-division multiplexing; Engineering; Wavelength; Telecommunications; Optics; Physics","score_opus":0.10889000672371393,"score_gpt":0.26353542155707166,"score_spread":0.15464541483335772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169313213","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.13473222,0.0030760178,0.8449433,0.0008278987,0.00006616185,0.0000601465,0.00050946436,0.00029729918,0.0154875135],"genre_scores_gemma":[0.97463924,0.0017122986,0.0202084,0.00009159153,0.00008887961,0.000085772,0.00022479241,0.00009823395,0.0028507027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00019787649,0.000023777979,0.00010775125,0.00028640105,0.00020327147],"domain_scores_gemma":[0.99586946,0.002869741,0.00040241034,0.00017438956,0.0005722885,0.000111590154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001659097,0.0007081311,0.00054500176,0.001359435,0.0005522978,0.00086588523,0.0013850201,0.00062755315,0.0020159627],"category_scores_gemma":[0.006909719,0.0004425605,0.00055833725,0.0010881211,0.0009926056,0.0023172386,0.0008462984,0.0009940247,0.0002613916],"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.000032864693,0.000015848753,0.00048803215,0.000044425447,0.00001599188,0.000052697542,0.000032802913,0.95037055,0.0022797114,0.042406913,0.0004555776,0.0038046294],"study_design_scores_gemma":[0.000001208888,0.0000063362104,0.00019819684,0.0000059884974,0.000003731337,0.000023422139,0.0000071926283,0.98914284,0.0005293032,0.009786701,0.00029029604,0.0000047545177],"about_ca_topic_score_codex":0.005410589,"about_ca_topic_score_gemma":0.0023129464,"teacher_disagreement_score":0.005410589,"about_ca_system_score_codex":0.0030397275,"about_ca_system_score_gemma":0.0012012463,"threshold_uncertainty_score":0.02205491},"labels":[],"label_agreement":null},{"id":"W2169353059","doi":"10.1109/tcomm.2005.843432","title":"Comparison of CP-Based Single Carrier and OFDM With Power Allocation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":36,"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":"Orthogonal frequency-division multiplexing; Cyclic prefix; Fading; Bit error rate; Transmission (telecommunications); Computer science; Electronic engineering; Power (physics); Block (permutation group theory); Mathematics; Algorithm; Telecommunications; Engineering; Physics; Channel (broadcasting)","score_opus":0.030179735045351784,"score_gpt":0.2959450030354976,"score_spread":0.2657652679901458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169353059","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.5924554,0.0036619564,0.38291156,0.00040481408,0.00017813189,0.00018809829,0.00030499557,0.0008154721,0.019079668],"genre_scores_gemma":[0.95036507,0.00077174086,0.04771262,0.000049930488,0.00003857295,0.00007365594,0.00014042294,0.000049625625,0.0007984845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998406,0.00055732985,0.000073837975,0.000101190446,0.00070490397,0.00015677288],"domain_scores_gemma":[0.99162453,0.005953501,0.00042507172,0.00067169714,0.0012229165,0.00010229536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026814102,0.0005102428,0.00097548566,0.00096630905,0.00040813434,0.0007905516,0.0009282951,0.0008485456,0.0011592507],"category_scores_gemma":[0.012597369,0.00018590252,0.00023889015,0.0016035897,0.0005348093,0.0018006344,0.00054735976,0.0005447475,0.00020605241],"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.002174128,0.00023357509,0.0022605406,0.00055468874,0.0001775775,0.00020668126,0.00011779848,0.7924865,0.021007627,0.01959551,0.0011614002,0.1600241],"study_design_scores_gemma":[0.00006377082,0.0005455019,0.0010036584,0.000025202506,0.00004219768,0.00016544094,0.000032451426,0.9793682,0.015489138,0.0025606556,0.00067688944,0.00002687261],"about_ca_topic_score_codex":0.0018946085,"about_ca_topic_score_gemma":0.00155105,"teacher_disagreement_score":0.0026814102,"about_ca_system_score_codex":0.00080032187,"about_ca_system_score_gemma":0.0008880054,"threshold_uncertainty_score":0.014180779},"labels":[],"label_agreement":null},{"id":"W2169435309","doi":"10.1109/tcomm.2009.08.070324","title":"Exact BER analysis of distributed alamouti's code for cooperative diversity networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"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":"Bit error rate; Rayleigh fading; QAM; Quadrature amplitude modulation; Mathematics; Diversity combining; Expression (computer science); Maximal-ratio combining; Gray code; Modulation (music); Algorithm; Topology (electrical circuits); Computer science; Fading; Physics; Decoding methods; Combinatorics","score_opus":0.0583457954210946,"score_gpt":0.30976082451972825,"score_spread":0.25141502909863367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169435309","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.283303,0.0018801609,0.70231944,0.00034506174,0.00005567493,0.000039343002,0.00010632797,0.00033856308,0.01161247],"genre_scores_gemma":[0.9716859,0.00046877857,0.026170881,0.000047107897,0.000023002736,0.000037915914,0.0000637509,0.00003036486,0.0014722904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989525,0.00028845167,0.000026165711,0.00006860953,0.00055912865,0.0001051216],"domain_scores_gemma":[0.9966331,0.0020010911,0.00025152476,0.00032539415,0.0007347845,0.000054075103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017151403,0.0007024608,0.00063142634,0.0007192084,0.00045130934,0.00061546895,0.0007396198,0.00085868983,0.0009508419],"category_scores_gemma":[0.0073273587,0.00025438017,0.00030667052,0.00066121266,0.0011113669,0.0011082496,0.0006676017,0.0005136646,0.00022643566],"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.00004272813,0.000012468271,0.00045536223,0.000043277338,0.000013206649,0.00008773098,0.000085553664,0.9618142,0.0030398765,0.027154723,0.00025928198,0.006991486],"study_design_scores_gemma":[0.0000033083768,0.000011787166,0.000118902295,0.0000053186764,0.000002598204,0.000029512084,0.000009024217,0.9945192,0.00045947032,0.0047499295,0.000086066146,0.0000050232943],"about_ca_topic_score_codex":0.0036868227,"about_ca_topic_score_gemma":0.0025304265,"teacher_disagreement_score":0.0036868227,"about_ca_system_score_codex":0.001679929,"about_ca_system_score_gemma":0.0010514215,"threshold_uncertainty_score":0.012188792},"labels":[],"label_agreement":null},{"id":"W2169567855","doi":"10.1109/tcomm.2005.861657","title":"Integer-based constellation-shaping method for PAPR reduction in OFDM systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","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":"University of Waterloo","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Hadamard transform; Algorithm; Spectral efficiency; Computational complexity theory; Mathematics; Constellation; Multiplexing; Integer (computer science); Matrix decomposition; Constellation diagram; Computer science; Electronic engineering; Telecommunications; Bit error rate; Decoding methods; Engineering; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.05374440825190632,"score_gpt":0.3084018098456184,"score_spread":0.2546574015937121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169567855","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.008082471,0.00025248318,0.9901766,0.000053168398,0.00002182008,0.000014227807,0.000008149556,0.00012497358,0.0012660075],"genre_scores_gemma":[0.24811639,0.00087278493,0.7487262,0.00007568094,0.000066491346,0.000063361775,0.000048110964,0.000049234786,0.0019817075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997726,0.00008005238,0.000012101141,0.000031098774,0.000091080765,0.000012977578],"domain_scores_gemma":[0.9996457,0.0001911812,0.00004239059,0.00005705393,0.000054007636,0.000009695695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003907819,0.00039936937,0.00034124707,0.00038418602,0.00022459125,0.00032444112,0.0003519989,0.00026962848,0.0012999041],"category_scores_gemma":[0.0012543084,0.00013170799,0.0001858809,0.00041234327,0.00048696762,0.0005620399,0.00030052807,0.00046825156,0.00034472928],"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.0003247963,0.00009982115,0.0003894663,0.00035718866,0.00003215575,0.00016281755,0.00030393488,0.13871387,0.1178518,0.08285655,0.001478965,0.65742856],"study_design_scores_gemma":[0.000059915717,0.00036763502,0.0003451376,0.000043157772,0.000030116458,0.0005989347,0.00006941231,0.8900784,0.06661606,0.028761085,0.0129894195,0.000040784886],"about_ca_topic_score_codex":0.00022202903,"about_ca_topic_score_gemma":0.0002695737,"teacher_disagreement_score":0.0012999041,"about_ca_system_score_codex":0.00022233771,"about_ca_system_score_gemma":0.0003684533,"threshold_uncertainty_score":0.0043486357},"labels":[],"label_agreement":null},{"id":"W2170260879","doi":"10.1109/tcomm.2009.04.070118","title":"Fast multiple-symbol detection for free-space optical communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":78,"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":"Computer science; Keying; Symbol (formal); Metric (unit); Channel (broadcasting); Detection theory; Algorithm; Bit error rate; Channel state information; Upper and lower bounds; Modulation (music); Phase-shift keying; Electronic engineering; Mathematics; Telecommunications; Detector; Engineering","score_opus":0.03127390575902961,"score_gpt":0.26656531226350183,"score_spread":0.23529140650447222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170260879","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.051127903,0.0018660682,0.94409555,0.00036414317,0.000078460325,0.000039236278,0.0000256838,0.0000715674,0.0023313721],"genre_scores_gemma":[0.7159146,0.001979466,0.27934176,0.00014070202,0.0002353039,0.00007941132,0.00004292782,0.000023119821,0.0022426394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933726,0.0002836405,0.000015901662,0.00006845475,0.00024711335,0.000047733545],"domain_scores_gemma":[0.997317,0.0021872655,0.00017983197,0.00014497567,0.00014536221,0.000025460127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011049444,0.0004719981,0.00045254658,0.00032294073,0.00032376414,0.0007227024,0.00045523778,0.00083315774,0.00091896206],"category_scores_gemma":[0.0043115774,0.00024316701,0.00025074507,0.00041367105,0.0007380138,0.0013536667,0.0005124276,0.0006754066,0.00018498376],"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.0001919128,0.00011380453,0.0012345216,0.00031683693,0.00004954627,0.00015613154,0.00020891255,0.49399972,0.032137133,0.35596013,0.00093209866,0.11469928],"study_design_scores_gemma":[0.000009431877,0.00006712955,0.00016489782,0.000008922771,0.000005970264,0.000046518348,0.000012655548,0.97096103,0.0030515862,0.024509126,0.0011524751,0.000010281679],"about_ca_topic_score_codex":0.0004461106,"about_ca_topic_score_gemma":0.00062371726,"teacher_disagreement_score":0.0011049444,"about_ca_system_score_codex":0.000830762,"about_ca_system_score_gemma":0.0007601304,"threshold_uncertainty_score":0.0060275793},"labels":[],"label_agreement":null},{"id":"W2170452593","doi":"10.1109/tcomm.2004.841981","title":"A Wideband Crosstalk Canceller for xDSL Using Common-Mode Information","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":17,"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":"Digital subscriber line; Wideband; Common-mode signal; Crosstalk; Electronic engineering; Computer science; Asymmetric digital subscriber line; Telecommunications; Digital signal processing; Engineering; Analog signal","score_opus":0.03253038155207603,"score_gpt":0.30335077414394473,"score_spread":0.2708203925918687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170452593","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.18904956,0.00076181366,0.80207646,0.00033545657,0.00026352945,0.000069411864,0.00004647244,0.0014756754,0.005921666],"genre_scores_gemma":[0.8029598,0.0003351193,0.19007066,0.00027739065,0.000105021914,0.000025782743,0.00006234205,0.0000465625,0.0061173136],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982613,0.00002720639,0.000008319833,0.000030824704,0.00008555749,0.000021951282],"domain_scores_gemma":[0.99977356,0.00007346509,0.000037017482,0.0000268313,0.00007422517,0.000014886687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029280587,0.00040265295,0.00019515987,0.00027090654,0.00040636328,0.00032219346,0.0006819083,0.00037769173,0.0011066687],"category_scores_gemma":[0.00057189155,0.00012277815,0.00018713695,0.00022417343,0.0002836369,0.00039742692,0.00027201948,0.0004276781,0.00034548764],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033650288,0.00009378934,0.0021619885,0.0001254297,0.000059228063,0.0004294847,0.00017177085,0.01995612,0.7766666,0.009744461,0.00096867554,0.189286],"study_design_scores_gemma":[0.000109919856,0.0012493721,0.0021398112,0.000036234553,0.00017629284,0.002102854,0.00007254139,0.26693845,0.7033812,0.0021654372,0.021557566,0.00007032737],"about_ca_topic_score_codex":0.00092071964,"about_ca_topic_score_gemma":0.0026807524,"teacher_disagreement_score":0.0011066687,"about_ca_system_score_codex":0.0003204342,"about_ca_system_score_gemma":0.00035978635,"threshold_uncertainty_score":0.0037022233},"labels":[],"label_agreement":null},{"id":"W2170678650","doi":"10.1109/tcomm.2012.12.100671","title":"Partial and Opportunistic Relay Selection with Outdated Channel Estimates","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"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":"Relay; Relay channel; Channel state information; Channel (broadcasting); Selection (genetic algorithm); Computer science; Signal-to-noise ratio (imaging); Scheduling (production processes); Outage probability; Bit error rate; Control theory (sociology); Telecommunications; Mathematics; Fading; Wireless; Mathematical optimization; Power (physics); Physics","score_opus":0.07913082268188901,"score_gpt":0.30184955950842934,"score_spread":0.22271873682654034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170678650","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.6793751,0.0013734415,0.31510592,0.00019551384,0.000058416008,0.00005821408,0.00017968567,0.00051373476,0.003140001],"genre_scores_gemma":[0.99262697,0.00015774816,0.00688965,0.000019260977,0.000012443045,0.000010138774,0.000030751962,0.00000840994,0.0002445883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975848,0.000992301,0.00012066677,0.00027032185,0.0006492577,0.00038255003],"domain_scores_gemma":[0.97746724,0.017239816,0.0018952326,0.0020973661,0.0010198198,0.0002805747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026148802,0.0010852716,0.0010907806,0.0004436957,0.00044820065,0.0010156168,0.0009661194,0.0005835123,0.00052849954],"category_scores_gemma":[0.0148173785,0.0004369252,0.0003329955,0.0006494141,0.00086996524,0.001663347,0.0010531738,0.00039666443,0.00011196974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012115813,0.000056286968,0.005921728,0.00014033608,0.00017502106,0.00068811857,0.00017092691,0.9260139,0.009831209,0.005367141,0.0003019617,0.050121848],"study_design_scores_gemma":[0.000050027928,0.0006089008,0.003399841,0.00002238021,0.00012277745,0.00065649877,0.00012441605,0.9800648,0.010571957,0.003827832,0.00051542476,0.000035134082],"about_ca_topic_score_codex":0.0025528544,"about_ca_topic_score_gemma":0.0042201704,"teacher_disagreement_score":0.0026148802,"about_ca_system_score_codex":0.00048804178,"about_ca_system_score_gemma":0.0009878894,"threshold_uncertainty_score":0.013828993},"labels":[],"label_agreement":null},{"id":"W2170692378","doi":"10.1109/tcomm.2008.060584","title":"P-order metric UWB receiver structures with superior performance","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":57,"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":"Rake receiver; Bandwidth (computing); Multipath propagation; Computer science; Radio receiver design; Electronic engineering; Ultra-wideband; Matched filter; Additive white Gaussian noise; Interference (communication); Algorithm; Telecommunications; Channel (broadcasting); Transmitter; Engineering","score_opus":0.01979123438359709,"score_gpt":0.2177861083471962,"score_spread":0.1979948739635991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170692378","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.011725953,0.00061436783,0.98416686,0.00010362644,0.000044362278,0.000032152955,0.000026734964,0.00063220976,0.0026537413],"genre_scores_gemma":[0.38366413,0.00073004473,0.6101129,0.00028675084,0.00016946364,0.00010043472,0.00015506933,0.00008621496,0.0046950798],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987582,0.0004072106,0.00007563895,0.0001530863,0.0005308947,0.00007498036],"domain_scores_gemma":[0.9978097,0.0006536905,0.00040689218,0.00039292246,0.00066964247,0.00006704243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013656451,0.0010445327,0.0010993053,0.0007156647,0.00038132444,0.0011143076,0.0011374251,0.001307675,0.0016620925],"category_scores_gemma":[0.0043147863,0.0003102243,0.0005340447,0.00089651346,0.0005845513,0.0020030988,0.0007239025,0.0012109736,0.0014102075],"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.00084023504,0.00023177055,0.0026385142,0.0005832142,0.00024115061,0.00051204546,0.00031376412,0.22165415,0.14351542,0.22959466,0.004549872,0.39532527],"study_design_scores_gemma":[0.00005539618,0.0009136937,0.00073378184,0.000036288184,0.00006360211,0.0020963512,0.000039998937,0.9204913,0.04810918,0.01848567,0.008883717,0.00009109408],"about_ca_topic_score_codex":0.00044823677,"about_ca_topic_score_gemma":0.0005530669,"teacher_disagreement_score":0.0016620925,"about_ca_system_score_codex":0.00080794387,"about_ca_system_score_gemma":0.0007062178,"threshold_uncertainty_score":0.007222295},"labels":[],"label_agreement":null},{"id":"W2170734840","doi":"10.1109/tcomm.2009.06.070109","title":"On the capacity of log-normal fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Ericsson (Canada)","funders":"","keywords":"Log-normal distribution; Fading; Truncation (statistics); Expression (computer science); Mathematics; Channel capacity; Series (stratigraphy); Ergodic theory; Remainder; Channel (broadcasting); Maximal-ratio combining; Statistics; Random variable; Fading distribution; Algorithm; Applied mathematics; Computer science; Telecommunications; Mathematical analysis; Rayleigh fading; Decoding methods","score_opus":0.04269886501188365,"score_gpt":0.2688345528964887,"score_spread":0.22613568788460509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170734840","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.1255856,0.0077043027,0.8128463,0.0021033236,0.0003052659,0.000049582068,0.0004906996,0.0004354999,0.050479453],"genre_scores_gemma":[0.96837246,0.0061007417,0.018624807,0.00032296657,0.0004646281,0.00014089141,0.0002501602,0.00010861515,0.0056147752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988715,0.0003651445,0.000027710657,0.00012454673,0.0004124679,0.00019856442],"domain_scores_gemma":[0.9935868,0.004625569,0.00031668486,0.00042863973,0.00094206544,0.00010013832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015078534,0.00095937203,0.00076192647,0.0014671966,0.00044553643,0.0014549695,0.0008331009,0.0007716001,0.0035933636],"category_scores_gemma":[0.012935734,0.00030867424,0.0003184616,0.0014295875,0.002396554,0.003436544,0.0011848335,0.0013747646,0.00094303186],"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.000119322816,0.00003222243,0.00053008524,0.00015321048,0.000027811904,0.00032661483,0.0001829996,0.44416463,0.004865633,0.532175,0.0026737906,0.014748651],"study_design_scores_gemma":[0.000009481424,0.000021669153,0.00039591198,0.00010851113,0.0000110505725,0.00024143037,0.000060483664,0.78620994,0.0017304957,0.20891386,0.0022537988,0.000043352342],"about_ca_topic_score_codex":0.0024520212,"about_ca_topic_score_gemma":0.0010545729,"teacher_disagreement_score":0.0035933636,"about_ca_system_score_codex":0.0016095403,"about_ca_system_score_gemma":0.00087488943,"threshold_uncertainty_score":0.012020946},"labels":[],"label_agreement":null},{"id":"W2171227687","doi":"10.1109/tcomm.2010.093010.090216","title":"Performance of an AFC Loop in the Presence of a Single Interferer in a Fading Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Rician fading; Fading; Independent and identically distributed random variables; Nakagami distribution; Rayleigh fading; Channel (broadcasting); Fading distribution; Computer science; Control theory (sociology); Loop (graph theory); Lock (firearm); Electronic engineering; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Statistics; Engineering; Random variable; Control (management)","score_opus":0.03221807304165422,"score_gpt":0.2777821394061698,"score_spread":0.24556406636451558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171227687","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.941333,0.00038713822,0.053364653,0.0001431689,0.00003790987,0.000026483256,0.00004173332,0.00026344144,0.0044025187],"genre_scores_gemma":[0.99853444,0.000038125967,0.001248128,0.000009628426,0.0000050300296,0.0000038483613,0.0000076382,0.0000048428806,0.00014831197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00022518505,0.000033374286,0.000105700354,0.00019362003,0.00024174525],"domain_scores_gemma":[0.9942334,0.0039189635,0.00062183326,0.00022618534,0.00078369817,0.00021585885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014025825,0.00086378434,0.0007102283,0.0006058225,0.0010114782,0.0010310457,0.0005778202,0.0012955774,0.00068586186],"category_scores_gemma":[0.005957303,0.00017180614,0.0002853386,0.0005077566,0.0011613707,0.0008226148,0.0007141965,0.00057465857,0.000145457],"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.0018940491,0.00019123901,0.008675307,0.00015356143,0.00010046219,0.00065671554,0.0002537536,0.9160038,0.042603705,0.0030673724,0.00032263566,0.026077474],"study_design_scores_gemma":[0.000029591456,0.0007371293,0.0015878163,0.000010006446,0.000038446124,0.00017494804,0.000058830676,0.9889243,0.007737388,0.00058371323,0.00009901471,0.000018753859],"about_ca_topic_score_codex":0.004964659,"about_ca_topic_score_gemma":0.0022816642,"teacher_disagreement_score":0.004964659,"about_ca_system_score_codex":0.0006400229,"about_ca_system_score_gemma":0.0005553182,"threshold_uncertainty_score":0.009871483},"labels":[],"label_agreement":null},{"id":"W2171250293","doi":"10.1109/tcomm.2005.849638","title":"Iterative Tree Search Detection for MIMO Wireless Systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":173,"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; Turbo; Computer science; Quadrature amplitude modulation; Turbo code; Algorithm; Computational complexity theory; Tree (set theory); Wireless; Detection theory; Bit error rate; QAM; Electronic engineering; Mathematics; Decoding methods; Channel (broadcasting); Telecommunications; Engineering; Detector","score_opus":0.03672285389025646,"score_gpt":0.29790987980322453,"score_spread":0.26118702591296805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171250293","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.012752585,0.0004066509,0.9849526,0.0000899227,0.000022663997,0.000016076374,0.000018028313,0.00016143585,0.0015799975],"genre_scores_gemma":[0.538376,0.0007716395,0.45704708,0.00016242109,0.000080258396,0.000103045866,0.000088449924,0.000046724927,0.0033243555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999342,0.00025982334,0.000026870666,0.000053441756,0.0002666358,0.000051141073],"domain_scores_gemma":[0.9988488,0.00073522294,0.000103231716,0.00011796236,0.00016635741,0.000028396953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063608296,0.00037492355,0.00050966465,0.00042168907,0.00023546428,0.0005858726,0.0004866435,0.0006238757,0.001096308],"category_scores_gemma":[0.0030044229,0.00020088881,0.00022498498,0.00060895574,0.00055585435,0.0007358522,0.00055454834,0.0005589962,0.0004596217],"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.00038578117,0.000052532698,0.00063809915,0.0002446701,0.000067493726,0.00020864124,0.00020320476,0.50750166,0.04895859,0.1633841,0.0024498438,0.2759054],"study_design_scores_gemma":[0.0000186574,0.0000793841,0.00009036488,0.000010015792,0.000007099375,0.00008326249,0.0000064451447,0.96991503,0.0067814724,0.021461513,0.0015329279,0.0000137723055],"about_ca_topic_score_codex":0.00049764424,"about_ca_topic_score_gemma":0.00062853744,"teacher_disagreement_score":0.001096308,"about_ca_system_score_codex":0.00038018776,"about_ca_system_score_gemma":0.00052552973,"threshold_uncertainty_score":0.0036675334},"labels":[],"label_agreement":null},{"id":"W2171275970","doi":"10.1109/26.864163","title":"Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (\"p-cycles\")","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":137,"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":"Spare part; Bounding overwatch; Computer science; Set (abstract data type); Upper and lower bounds; Work (physics); Computer network; Span (engineering); Mathematical optimization; Mathematics; Engineering; Structural engineering; Operations management; Artificial intelligence","score_opus":0.042304511881844586,"score_gpt":0.29279207949562897,"score_spread":0.2504875676137844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171275970","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.06804574,0.0011891961,0.89389324,0.0012368938,0.00008797442,0.000109846646,0.00017339745,0.0002822881,0.034981493],"genre_scores_gemma":[0.8695459,0.002320297,0.1222223,0.00037778838,0.00022362865,0.00039707645,0.00019512307,0.00022268777,0.00449528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998268,0.0003885776,0.0001164916,0.00029248864,0.00066294736,0.00027142433],"domain_scores_gemma":[0.9863435,0.0100760115,0.0006875028,0.0017137821,0.0009389579,0.00024015264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028863256,0.00060562213,0.0005336122,0.0019386912,0.0010143279,0.0023234575,0.001975917,0.0013073543,0.006234109],"category_scores_gemma":[0.018129202,0.00062519294,0.000635517,0.0014250728,0.0050471523,0.005457556,0.0020547055,0.001915076,0.00081534113],"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.000045293167,0.00004641735,0.0003131927,0.0001048928,0.000008759095,0.000060109884,0.00011285813,0.06654831,0.0023849236,0.9145548,0.0008891247,0.014931453],"study_design_scores_gemma":[0.000027553499,0.00009541173,0.0003872328,0.000072520175,0.000014907351,0.00028522627,0.000084536,0.26735762,0.006772439,0.71969557,0.0051758015,0.000031116502],"about_ca_topic_score_codex":0.0010708154,"about_ca_topic_score_gemma":0.0005530284,"teacher_disagreement_score":0.006234109,"about_ca_system_score_codex":0.0017886551,"about_ca_system_score_gemma":0.0009404411,"threshold_uncertainty_score":0.020855188},"labels":[],"label_agreement":null},{"id":"W2171323387","doi":"10.1109/tcomm.2010.080310.090066","title":"Bypassing Orthogonal Relaying Transmissions via Spatial Signal Separation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"University of British Columbia","funders":"","keywords":"Space-division multiple access; Computer science; Spectral efficiency; Antenna diversity; Coding (social sciences); MIMO; Topology (electrical circuits); Relay; Electronic engineering; Algorithm; Antenna (radio); Mathematics; Telecommunications; Base station; Engineering; Channel (broadcasting); Electrical engineering; Statistics; Physics","score_opus":0.04214836407210019,"score_gpt":0.31640642984982165,"score_spread":0.27425806577772144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171323387","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.028150018,0.00028963236,0.9649908,0.00022135311,0.000033656932,0.000023657292,0.000016350241,0.000078072684,0.0061964793],"genre_scores_gemma":[0.8860784,0.00067322707,0.10969675,0.00018663898,0.00009207686,0.00006801058,0.000028911687,0.000016845843,0.0031589996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.00026543636,0.000032547305,0.00009801702,0.00022008992,0.00008428083],"domain_scores_gemma":[0.99813145,0.0010506455,0.0002820512,0.00031282596,0.00018362085,0.000039461782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009613498,0.00068917003,0.00041605398,0.00033868806,0.00036588655,0.0008761157,0.0008839079,0.000748326,0.0010641929],"category_scores_gemma":[0.0023124316,0.00023789325,0.00042732153,0.0005022249,0.0010755208,0.0018038189,0.0012364873,0.00078839244,0.00032250784],"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.00015639608,0.00011621163,0.0009823716,0.00022708086,0.000067280904,0.00051980687,0.00037724414,0.3284823,0.04356366,0.54087263,0.0012005876,0.083434545],"study_design_scores_gemma":[0.000032004227,0.00027154657,0.00022419551,0.00002346952,0.00005024045,0.0006447453,0.00006882699,0.89077425,0.015144272,0.08764253,0.005095085,0.000028908995],"about_ca_topic_score_codex":0.0006477661,"about_ca_topic_score_gemma":0.00085051265,"teacher_disagreement_score":0.0010641929,"about_ca_system_score_codex":0.00044319037,"about_ca_system_score_gemma":0.00075429317,"threshold_uncertainty_score":0.005084157},"labels":[],"label_agreement":null},{"id":"W2171567428","doi":"10.1109/tcomm.2009.11.070197","title":"On the integrated cross-noise term in correlation detectors","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Noise (video); Gaussian noise; Autocorrelation; Probability density function; Algorithm; Cross-correlation; Noise measurement; SIGNAL (programming language); Component (thermodynamics); Gaussian; Mathematics; Signal processing; Statistics; Computer science; Noise reduction; Physics; Artificial intelligence; Telecommunications","score_opus":0.016380758193675984,"score_gpt":0.25425361890666487,"score_spread":0.23787286071298888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171567428","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.010359432,0.004841277,0.9700981,0.00053254963,0.00024875798,0.000031709227,0.0000841939,0.00030367167,0.013500201],"genre_scores_gemma":[0.66392136,0.012853498,0.2932606,0.0027562159,0.001711105,0.00023932116,0.00048339175,0.0011591548,0.023615321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592197,0.0015275171,0.0001162797,0.00045769167,0.0017162105,0.00026033906],"domain_scores_gemma":[0.987951,0.009205597,0.0004626345,0.00079028035,0.0014597367,0.00013074174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064958385,0.0014644084,0.0012823739,0.0016628514,0.0008317651,0.002335968,0.0017769549,0.0022597322,0.002360358],"category_scores_gemma":[0.024360709,0.00091119314,0.00097116566,0.00270669,0.0032098317,0.0045554605,0.001843791,0.0031954814,0.0008830678],"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.00018422058,0.000050050974,0.001364195,0.00031605145,0.00008915661,0.0004927014,0.0002615075,0.23858456,0.0047770045,0.7181516,0.0041533546,0.031575542],"study_design_scores_gemma":[0.000009557023,0.000053253527,0.00045135894,0.00009586138,0.00004475403,0.0003919364,0.000024950692,0.8762182,0.0027533968,0.11661843,0.003285785,0.000052519234],"about_ca_topic_score_codex":0.0034273982,"about_ca_topic_score_gemma":0.0027872503,"teacher_disagreement_score":0.0064958385,"about_ca_system_score_codex":0.0022864486,"about_ca_system_score_gemma":0.0013204927,"threshold_uncertainty_score":0.034353673},"labels":[],"label_agreement":null},{"id":"W2171915411","doi":"10.1109/tcomm.2010.101210.090367","title":"Robust L_p-Norm Decoding for BICM-Based Secondary User Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Weibull fading; Decoding methods; Fading; Algorithm; Computer science; Nakagami distribution; Gaussian noise; Rayleigh fading; Bit error rate; Mathematics; Electronic engineering; Engineering","score_opus":0.03296156520620366,"score_gpt":0.2444072024845561,"score_spread":0.21144563727835244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171915411","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.019062907,0.00047426648,0.9747809,0.0002558388,0.000039649978,0.000034110533,0.00010263914,0.00033427545,0.0049153967],"genre_scores_gemma":[0.74225867,0.0006575059,0.25251952,0.00025133233,0.00007469751,0.00014383075,0.00032265892,0.00008396337,0.0036878497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820566,0.0006941671,0.00007905,0.00015939266,0.00065898086,0.00020279379],"domain_scores_gemma":[0.9980088,0.0009256106,0.00020234947,0.00016980941,0.0006296886,0.00006370173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013710056,0.0011000606,0.0012886684,0.00066475134,0.00057387556,0.0014727595,0.0010474664,0.0012953121,0.0013919895],"category_scores_gemma":[0.006071638,0.00032076554,0.00043961196,0.0009931286,0.0009235611,0.001016306,0.0013803567,0.001004399,0.0010453395],"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.00027911103,0.000074539756,0.0006296773,0.00016971471,0.000054898203,0.00018728786,0.00017471671,0.85403556,0.013479365,0.055751134,0.0023060704,0.07285797],"study_design_scores_gemma":[0.0000056980266,0.000046545367,0.00006448246,0.0000103614175,0.0000046691744,0.000058697282,0.000010704534,0.99033034,0.00308844,0.0058659404,0.00050076423,0.000013405179],"about_ca_topic_score_codex":0.0030915695,"about_ca_topic_score_gemma":0.002860084,"teacher_disagreement_score":0.0030915695,"about_ca_system_score_codex":0.0012500582,"about_ca_system_score_gemma":0.0016650399,"threshold_uncertainty_score":0.00906986},"labels":[],"label_agreement":null},{"id":"W2172242942","doi":"10.1109/tcomm.2009.04.070310","title":"Iterative decoding of serially concatenated CPM in fading channels with noisy channel state information","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","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":"University of Toronto","funders":"","keywords":"Fading; Channel state information; Algorithm; Decoding methods; Factor graph; Computer science; Continuous phase modulation; Channel (broadcasting); Telecommunications; Wireless","score_opus":0.016933775635755124,"score_gpt":0.25290947863846724,"score_spread":0.23597570300271212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172242942","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.035910092,0.0001352331,0.9625436,0.000103742794,0.000024729474,0.000026313795,0.000044424844,0.00024281236,0.000969114],"genre_scores_gemma":[0.45071667,0.0002760461,0.5438871,0.000110724395,0.00006137591,0.00012860446,0.00021563914,0.00007429744,0.0045295786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916446,0.00030461792,0.00005164362,0.00012547396,0.00026119014,0.00009253529],"domain_scores_gemma":[0.9980411,0.0011642987,0.0002739794,0.00021004927,0.00026646754,0.00004405438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092694984,0.00087227573,0.00078440167,0.00043394993,0.00035341704,0.00074402575,0.0008444456,0.0010700265,0.00081195333],"category_scores_gemma":[0.0045849825,0.00049230835,0.0004729964,0.000867718,0.00082519144,0.0009998955,0.0010240049,0.0008611722,0.00043335487],"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.00042602763,0.000071265385,0.0013455411,0.00020307448,0.00010325741,0.0005839547,0.00027449036,0.74682146,0.037509147,0.039803077,0.0008976996,0.17196096],"study_design_scores_gemma":[0.000014655885,0.00006556852,0.00013429315,0.000009127912,0.000012350111,0.0001239427,0.00001145246,0.9775695,0.015243526,0.006305243,0.00050035294,0.000010040263],"about_ca_topic_score_codex":0.0021988773,"about_ca_topic_score_gemma":0.0026668862,"teacher_disagreement_score":0.0021988773,"about_ca_system_score_codex":0.0005198796,"about_ca_system_score_gemma":0.0017000644,"threshold_uncertainty_score":0.0049022436},"labels":[],"label_agreement":null},{"id":"W2174416479","doi":"10.1109/tcomm.2015.2497239","title":"Downlink Power Control in Two-Tier Cellular Networks With Energy-Harvesting Small Cells as Stochastic Games","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":29,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macrocell; Computer science; Power control; Base station; Stochastic geometry; Small cell; Energy harvesting; Telecommunications link; Transmitter power output; Mathematical optimization; Computer network; Energy (signal processing); Power (physics); Channel (broadcasting); Mathematics","score_opus":0.0178297000712583,"score_gpt":0.2229465426090453,"score_spread":0.205116842537787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174416479","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.06889072,0.00071696733,0.91704726,0.00075992354,0.00010475463,0.00011073468,0.00021041202,0.00016503053,0.01199424],"genre_scores_gemma":[0.9778191,0.00043863943,0.0148972375,0.00018186102,0.00004233417,0.00016203137,0.00007714866,0.0000345198,0.00634721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907863,0.00032474808,0.000035336983,0.00017654747,0.00020085876,0.00018384401],"domain_scores_gemma":[0.9984274,0.0009978022,0.00020096781,0.000039957908,0.0002231953,0.000110814915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011613701,0.0011841767,0.0012953264,0.00051061064,0.000535793,0.0020857193,0.0011851427,0.0011764028,0.0017247482],"category_scores_gemma":[0.0029030102,0.00063692586,0.0007522803,0.00066244457,0.0016301707,0.0010011232,0.0013677335,0.0011502879,0.00019687334],"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.000040588995,0.00002258338,0.00029275796,0.000031467753,0.000023950499,0.00009321408,0.000040814673,0.9729723,0.0008214829,0.02271737,0.00044386482,0.002499558],"study_design_scores_gemma":[0.000008721611,0.0000102198155,0.000060468836,0.0000026807215,0.0000041450353,0.0000073008964,0.00000906617,0.9955272,0.000059213646,0.0041744974,0.00013312351,0.0000034171917],"about_ca_topic_score_codex":0.012136177,"about_ca_topic_score_gemma":0.008856965,"teacher_disagreement_score":0.012136177,"about_ca_system_score_codex":0.0022098413,"about_ca_system_score_gemma":0.0016973902,"threshold_uncertainty_score":0.02413112},"labels":[],"label_agreement":null},{"id":"W2182209980","doi":"10.1109/tcomm.2015.2477082","title":"An Incremental Redundancy Hybrid ARQ Scheme via Puncturing and Extending of Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":72,"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":"Puncturing; Hybrid automatic repeat request; Algorithm; Computer science; Automatic repeat request; Redundancy (engineering); Polar code; Polar; Coding (social sciences); Error detection and correction; Decoding methods; Forward error correction; Mathematics; Transmission (telecommunications); Telecommunications","score_opus":0.05324886164437508,"score_gpt":0.3161911413478035,"score_spread":0.2629422797034284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182209980","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.048667658,0.00035441303,0.9467818,0.00013067566,0.000080384954,0.00007629517,0.000077819255,0.000481231,0.003349687],"genre_scores_gemma":[0.58848095,0.00040653962,0.40776393,0.00020901703,0.00007404766,0.00012213216,0.00012827422,0.000053433803,0.0027616997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.0001489503,0.000027909104,0.00007244595,0.00015715283,0.00005555234],"domain_scores_gemma":[0.9987889,0.00035485587,0.0001740059,0.0003781516,0.00024291326,0.00006129679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559273,0.0005679555,0.00042417197,0.00041792728,0.000465106,0.00053883286,0.00079540623,0.00045244175,0.00093125884],"category_scores_gemma":[0.0017190686,0.00020553143,0.0003404266,0.0005376842,0.00070437643,0.00088593154,0.0011940673,0.000813693,0.00049549603],"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.0010354348,0.00014492297,0.0023054834,0.00040751268,0.00009401438,0.0015883897,0.0006888302,0.151368,0.29785103,0.19221202,0.0031384353,0.34916583],"study_design_scores_gemma":[0.00015468072,0.0010114654,0.0012343277,0.00008777147,0.00009847448,0.0026702012,0.00011972421,0.7568432,0.17053954,0.047457162,0.019612918,0.0001705551],"about_ca_topic_score_codex":0.00019753465,"about_ca_topic_score_gemma":0.00016729248,"teacher_disagreement_score":0.00093125884,"about_ca_system_score_codex":0.00018816775,"about_ca_system_score_gemma":0.00039441336,"threshold_uncertainty_score":0.0034689307},"labels":[],"label_agreement":null},{"id":"W2182484825","doi":"10.1109/tcomm.2015.2469690","title":"Rate Maximization Through Structured Spectrum Allocation and User Association in Heterogeneous Cellular Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Bell Canada Enterprises","keywords":"Mathematical optimization; Telecommunications link; Computer science; Association scheme; Frequency allocation; Maximization; Nash equilibrium; Geometric programming; Convex optimization; Base station; Association (psychology); Stochastic geometry; Regular polygon; Mathematics; Statistics; Computer network","score_opus":0.019791996952064145,"score_gpt":0.23176952567860368,"score_spread":0.21197752872653952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182484825","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.076066285,0.0002801582,0.91998476,0.00015876364,0.000020711193,0.00003145837,0.000030473053,0.00007831171,0.0033490662],"genre_scores_gemma":[0.9699119,0.00021220387,0.028653055,0.000044013188,0.000029148676,0.00003982818,0.000025857145,0.000019492216,0.0010645713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880147,0.00059875974,0.000027063721,0.00013021333,0.00023161029,0.00021097911],"domain_scores_gemma":[0.99874604,0.0007736343,0.00018134102,0.00008310033,0.00015025787,0.00006561126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894996,0.0010067583,0.00095822057,0.00041977433,0.00038555087,0.0010101887,0.0009856429,0.0006682615,0.00065793295],"category_scores_gemma":[0.0032063383,0.0003750503,0.0005173062,0.00078838755,0.001173559,0.0011232407,0.0013218505,0.0006225972,0.0001635255],"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.000042529286,0.000028275846,0.00031738056,0.000022559105,0.000019576488,0.00009631347,0.000030067089,0.9775914,0.0020478151,0.013366721,0.00020529344,0.0062321615],"study_design_scores_gemma":[0.0000040965574,0.00001825018,0.000059670903,0.000001203039,0.0000034103095,0.000014573672,0.000007735296,0.9955349,0.00029898743,0.003991639,0.000063083906,0.000002518209],"about_ca_topic_score_codex":0.0021584323,"about_ca_topic_score_gemma":0.0015091333,"teacher_disagreement_score":0.0021584323,"about_ca_system_score_codex":0.00096427655,"about_ca_system_score_gemma":0.0006817988,"threshold_uncertainty_score":0.00787735},"labels":[],"label_agreement":null},{"id":"W2187647323","doi":"10.1109/tcomm.2015.2475417","title":"Closed-Form Expressions for the BER/SER of OFDM Systems With an Integer Time Offset","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"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","keywords":"Orthogonal frequency-division multiplexing; Phase-shift keying; Bit error rate; Carrier frequency offset; Rayleigh fading; Quadrature amplitude modulation; Additive white Gaussian noise; QAM; Algorithm; Mathematics; Fading; Modulation (music); Integer (computer science); Offset (computer science); Computer science; Frequency offset; Telecommunications; White noise; Statistics; Channel (broadcasting); Decoding methods; Physics","score_opus":0.051555165475320415,"score_gpt":0.2915583506110149,"score_spread":0.24000318513569452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187647323","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.010852535,0.003674782,0.97224885,0.0002479534,0.000119095705,0.000046281028,0.00024186842,0.00030709925,0.01226147],"genre_scores_gemma":[0.56953025,0.015560859,0.39625314,0.0006230099,0.0004569977,0.0004013905,0.00065530295,0.00045009804,0.0160689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869055,0.00033769684,0.00008596105,0.00015639667,0.00058662123,0.0001428047],"domain_scores_gemma":[0.9938287,0.00417317,0.00054308074,0.00039110857,0.00102605,0.000037806505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111396,0.0014521368,0.0009695247,0.0014094469,0.00054051547,0.0018126088,0.0010343194,0.0012653224,0.0052114218],"category_scores_gemma":[0.011575437,0.00044445004,0.0006282326,0.001230918,0.0011446635,0.0025962417,0.00094555726,0.0015707636,0.0021054037],"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.00009486815,0.00007083484,0.0008765469,0.00081693684,0.00006253084,0.0003916195,0.00033342975,0.7360912,0.010220845,0.16886015,0.003626586,0.0785545],"study_design_scores_gemma":[0.000008770229,0.000060906503,0.0005051019,0.00017204117,0.000029370834,0.0005195174,0.00008471576,0.94997585,0.003999276,0.040384028,0.004219852,0.0000405558],"about_ca_topic_score_codex":0.0011581779,"about_ca_topic_score_gemma":0.0013481837,"teacher_disagreement_score":0.0052114218,"about_ca_system_score_codex":0.0011605422,"about_ca_system_score_gemma":0.00081113866,"threshold_uncertainty_score":0.017433941},"labels":[],"label_agreement":null},{"id":"W2188722487","doi":"10.1109/tcomm.2015.2469685","title":"Performance Analysis of Parallel Relaying in Free-Space Optical Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":17,"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":"Diversity gain; Fading; Computer science; Relay; Multiplexing; Coding gain; Electronic engineering; Outage probability; Decoding methods; Coding (social sciences); Antenna diversity; Free-space optical communication; Optical communication; Computer network; Telecommunications; Wireless; Physics; Engineering; Mathematics; Power (physics)","score_opus":0.05161129614597985,"score_gpt":0.26492821529230715,"score_spread":0.2133169191463273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188722487","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.5240224,0.0019562133,0.45215383,0.0006715108,0.000051601073,0.00009031155,0.00021717323,0.0002896288,0.020547325],"genre_scores_gemma":[0.99280494,0.00041551987,0.0055434676,0.000033495515,0.000030863725,0.00001676528,0.000032610966,0.000013880095,0.0011084107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00031604504,0.000033366065,0.00010864038,0.00037625834,0.00019718005],"domain_scores_gemma":[0.9930534,0.004911199,0.0007572531,0.00042258506,0.0007440427,0.00011146196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016882095,0.0012362979,0.00081274606,0.0008194653,0.00055689353,0.0013001579,0.0008323673,0.000990507,0.0018100783],"category_scores_gemma":[0.006955791,0.00033442237,0.00048126213,0.00080164574,0.0014318015,0.0021176392,0.0010869716,0.00057974237,0.00027950923],"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.00012567056,0.000033963024,0.0008320458,0.000066364606,0.00003812576,0.00022197675,0.00009589935,0.94972485,0.0072323047,0.03345939,0.00022607138,0.007943428],"study_design_scores_gemma":[0.000007176559,0.00007407231,0.00028881308,0.00000728291,0.000012977434,0.0001430728,0.000027813303,0.98760706,0.0019809287,0.009634225,0.00020289788,0.000013716893],"about_ca_topic_score_codex":0.0021160499,"about_ca_topic_score_gemma":0.001308377,"teacher_disagreement_score":0.0021160499,"about_ca_system_score_codex":0.001805529,"about_ca_system_score_gemma":0.00083968433,"threshold_uncertainty_score":0.013100088},"labels":[],"label_agreement":null},{"id":"W2214742514","doi":"10.1109/tcomm.2015.2495286","title":"Distributed Collaborative Beamforming Design for Maximized Throughput in Interfered and Scattered Environments","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Overhead (engineering); Computer science; Channel (broadcasting); Topology (electrical circuits); Throughput; Wireless; Wireless network; Algorithm; Electronic engineering; Computer engineering; Mathematics; Computer network; Telecommunications; Engineering; Combinatorics","score_opus":0.0562185055676709,"score_gpt":0.2757258060062247,"score_spread":0.21950730043855382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214742514","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.011728825,0.00014496935,0.98555344,0.00007932174,0.000019708526,0.000025662415,0.000033117027,0.0001053189,0.0023095813],"genre_scores_gemma":[0.7608981,0.00044597202,0.23472339,0.00011711051,0.000064417996,0.00019275547,0.0000868214,0.000047030167,0.0034244054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.00021084724,0.000022177275,0.00016268852,0.00022859481,0.00013469998],"domain_scores_gemma":[0.9992188,0.00035097054,0.0001049908,0.000059556973,0.00021812062,0.000047587273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007628433,0.0011805041,0.0008928372,0.000387175,0.00041735874,0.00094568444,0.0010298387,0.0009200418,0.0018497882],"category_scores_gemma":[0.0018732955,0.00039678166,0.00034691475,0.000871276,0.00072623766,0.0009230381,0.00072201603,0.0005298748,0.0006642166],"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.00021854177,0.0000881449,0.00048137258,0.00013902984,0.00006335944,0.00015810905,0.00011587004,0.8759102,0.029130626,0.03862924,0.0015167044,0.05354875],"study_design_scores_gemma":[0.000026075211,0.00007696906,0.00010664502,0.000007969877,0.000015213046,0.000045989436,0.000027060041,0.9900949,0.0030608939,0.0058686263,0.0006592318,0.000010309852],"about_ca_topic_score_codex":0.0018203252,"about_ca_topic_score_gemma":0.0022263953,"teacher_disagreement_score":0.0018497882,"about_ca_system_score_codex":0.0009598064,"about_ca_system_score_gemma":0.0011586683,"threshold_uncertainty_score":0.0069639683},"labels":[],"label_agreement":null},{"id":"W2216941018","doi":"10.1109/tcomm.2015.2496260","title":"Energy-Efficient Adaptive Rate Control for Streaming Media Transmission Over Cognitive Radio","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Cognitive radio; Transmission (telecommunications); Markov decision process; Computer network; Markov process; Mathematical optimization; Wireless; Telecommunications","score_opus":0.04068414524718479,"score_gpt":0.2707951690183008,"score_spread":0.23011102377111603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216941018","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.022583626,0.0004654407,0.9753277,0.000120907775,0.000040896626,0.000026235617,0.000013446156,0.00013150676,0.0012901461],"genre_scores_gemma":[0.96095616,0.00038672533,0.03778175,0.00004425288,0.000032310738,0.000039375016,0.000016488568,0.000018173612,0.0007247629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965394,0.00009527762,0.000016720234,0.00007721013,0.00010596275,0.00005097806],"domain_scores_gemma":[0.999476,0.00031490164,0.00008049601,0.000025156563,0.000077396304,0.000025912106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080478314,0.0005681368,0.00045844555,0.0003722702,0.00040423247,0.0005906637,0.0008791144,0.00046005123,0.0007925082],"category_scores_gemma":[0.002052657,0.00022953471,0.0004002059,0.00037267464,0.00058505015,0.00061284483,0.0006332684,0.00073237665,0.000112454996],"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.00023580136,0.00009116529,0.00049232616,0.0001401951,0.000049101072,0.00023236555,0.00014870416,0.85033137,0.027331736,0.041669175,0.0008868127,0.07839141],"study_design_scores_gemma":[0.000006133792,0.000024826486,0.00003371363,0.0000021693595,0.00000388552,0.000015590773,0.0000037155316,0.99728775,0.00071239495,0.001795449,0.00011028087,0.000004157533],"about_ca_topic_score_codex":0.0033160232,"about_ca_topic_score_gemma":0.0028035506,"teacher_disagreement_score":0.0033160232,"about_ca_system_score_codex":0.00070935395,"about_ca_system_score_gemma":0.000733877,"threshold_uncertainty_score":0.006593406},"labels":[],"label_agreement":null},{"id":"W2243098549","doi":"10.1109/tcomm.2015.2502952","title":"A New Class of Rateless Codes Based on Reed–Solomon Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Overhead (engineering); Online codes; Block code; Notation; Computer science; Class (philosophy); Raptor code; Discrete mathematics; Luby transform code; Coding (social sciences); Fountain code; Algorithm; Mathematics; Decoding methods; Theoretical computer science; Linear code; Arithmetic; Programming language; Statistics; Artificial intelligence","score_opus":0.06090656670449825,"score_gpt":0.2920649838029278,"score_spread":0.23115841709842955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243098549","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.03205207,0.005605845,0.9498566,0.00054416934,0.00040842395,0.00018670606,0.00019091651,0.00095166214,0.010203678],"genre_scores_gemma":[0.50772536,0.00897515,0.46002787,0.0012814761,0.0010951357,0.0006595512,0.00074634014,0.0002913071,0.019197851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991209,0.00015120537,0.00006548714,0.0001959234,0.00036220127,0.00010433236],"domain_scores_gemma":[0.99827504,0.00056679174,0.00031013731,0.00034501808,0.0004048612,0.00009817526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000790087,0.00093761605,0.00079279323,0.0016383249,0.0006066238,0.0009649258,0.0010726409,0.00092704175,0.0010090268],"category_scores_gemma":[0.0024391273,0.00031103694,0.0008409475,0.00082000706,0.0009332996,0.0021553126,0.0010389403,0.0016245254,0.00078388536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064836204,0.0002528113,0.002351987,0.0007451425,0.00017009245,0.00078747893,0.00041552505,0.074461475,0.11518201,0.29965588,0.0097338995,0.49559534],"study_design_scores_gemma":[0.0002297665,0.0009950094,0.001697212,0.00018058659,0.00016843312,0.004225622,0.00008201325,0.6778828,0.09510495,0.0689876,0.15017042,0.0002755605],"about_ca_topic_score_codex":0.00065109506,"about_ca_topic_score_gemma":0.00057879824,"teacher_disagreement_score":0.0016383249,"about_ca_system_score_codex":0.00047914122,"about_ca_system_score_gemma":0.0009144002,"threshold_uncertainty_score":0.0041784644},"labels":[],"label_agreement":null},{"id":"W2246689711","doi":"10.1109/tcomm.2016.2555908","title":"Analysis of Massive MIMO-Enabled Downlink Wireless Backhauling for Full-Duplex Small Cells","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":137,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Telecommunications link; Computer network; MIMO; Stochastic geometry; Computer science; Wireless; Wireless network; Base station; Zero-forcing precoding; Multi-user MIMO; Precoding; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.031504866662656665,"score_gpt":0.2509358748837726,"score_spread":0.21943100822111594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246689711","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.18652888,0.0011756461,0.7949592,0.00043308086,0.00006861404,0.00006598284,0.00028264493,0.00026812448,0.01621784],"genre_scores_gemma":[0.9908003,0.00044265602,0.006221658,0.00005771371,0.000027502165,0.00003622011,0.00007418133,0.0000301825,0.002309416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00011187732,0.0000105162335,0.000062148385,0.00016534462,0.00012977712],"domain_scores_gemma":[0.99877053,0.00067792326,0.00020262523,0.000049667768,0.00022016987,0.000079065765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008688283,0.0008181336,0.0006846723,0.00055854145,0.0003475124,0.0010047178,0.00085694884,0.0007894626,0.0014909308],"category_scores_gemma":[0.002283154,0.00042969378,0.00068509916,0.0005391943,0.0009065873,0.0006576668,0.00076032564,0.00053498603,0.00021920617],"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.000015098566,0.00001004584,0.0006128076,0.000024233377,0.000013695999,0.000101349244,0.000023551947,0.9884227,0.0014978776,0.007571942,0.0002422387,0.0014645195],"study_design_scores_gemma":[8.338232e-7,0.0000055768137,0.00015031121,0.0000017088378,0.0000021505045,0.000012216259,0.000006978674,0.9990263,0.000115580224,0.0006239544,0.00005235039,0.000002032985],"about_ca_topic_score_codex":0.00887445,"about_ca_topic_score_gemma":0.003948239,"teacher_disagreement_score":0.00887445,"about_ca_system_score_codex":0.0017479082,"about_ca_system_score_gemma":0.0009302615,"threshold_uncertainty_score":0.017645597},"labels":[],"label_agreement":null},{"id":"W2275669737","doi":"10.1109/tcomm.2015.2514089","title":"Design of a Short Reference Noncoherent Chaos-Based Communication Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":171,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Keying; Chaotic; Energy (signal processing); SIGNAL (programming language); Bit error rate; Electronic engineering; Additive white Gaussian noise; Data transmission; Transmission (telecommunications); Multipath propagation; Algorithm; Communications system; Telecommunications; Mathematics; Decoding methods; White noise; Statistics; Channel (broadcasting); Engineering; Computer network","score_opus":0.05790060647622867,"score_gpt":0.282197505951102,"score_spread":0.22429689947487333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275669737","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.055184655,0.00086098845,0.9380996,0.00028817944,0.00013569962,0.00020083433,0.00007321542,0.00024855963,0.0049081603],"genre_scores_gemma":[0.8133242,0.0006185257,0.18143463,0.000115745475,0.00009733889,0.00028155805,0.0000794353,0.000021612048,0.0040269396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.000070884584,0.00002652191,0.00007283373,0.00010730491,0.000024499253],"domain_scores_gemma":[0.99965036,0.000054081793,0.00008958123,0.000030563035,0.00014956734,0.000025837755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038238065,0.00037811196,0.00043862307,0.00028004192,0.0004915253,0.00068821374,0.00085184065,0.0005989247,0.0015118439],"category_scores_gemma":[0.00058622984,0.00020885999,0.00020871687,0.00031056697,0.00032121353,0.0005254361,0.00045975883,0.00038320705,0.00046798048],"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.0007852608,0.00020597057,0.0015642019,0.0007427992,0.00012564256,0.0006295788,0.0005711134,0.20449479,0.45104688,0.07468485,0.0029638244,0.2621851],"study_design_scores_gemma":[0.00010505583,0.0011815964,0.00079624075,0.000053340376,0.00005853012,0.00035116094,0.00005571651,0.92658514,0.056000005,0.0044124974,0.010347958,0.000052712254],"about_ca_topic_score_codex":0.0006039309,"about_ca_topic_score_gemma":0.00086776685,"teacher_disagreement_score":0.0015118439,"about_ca_system_score_codex":0.00054720044,"about_ca_system_score_gemma":0.00062844163,"threshold_uncertainty_score":0.005057633},"labels":[],"label_agreement":null},{"id":"W2287608525","doi":"10.1109/tcomm.2015.2506698","title":"Energy Efficiency of Adaptive HARQ","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"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; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Transmitter; Rayleigh fading; Decoding methods; Transmission (telecommunications); Channel state information; Channel (broadcasting); Fading; Automatic repeat request; Transmitter power output; Link adaptation; Adaptive coding; Real-time computing; Computer network; Electronic engineering; Algorithm; Wireless; Telecommunications; Engineering","score_opus":0.10757928056429754,"score_gpt":0.30315965570770315,"score_spread":0.1955803751434056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287608525","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.12990722,0.0018085422,0.855702,0.00035427776,0.00009358701,0.00008644833,0.000064596075,0.00026676533,0.011716667],"genre_scores_gemma":[0.9675704,0.00057399645,0.030014694,0.000085093336,0.000027945114,0.000053235726,0.000044540477,0.000038775164,0.0015914472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985043,0.0005707791,0.000059079463,0.00018692728,0.0004924385,0.00018661913],"domain_scores_gemma":[0.99446714,0.0041037025,0.00022238525,0.00056629657,0.00057816785,0.00006228974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031196,0.00059206516,0.00062485994,0.0004325426,0.00048234325,0.0010654579,0.0012834534,0.00063800154,0.0020066022],"category_scores_gemma":[0.008406993,0.00020073488,0.00023047683,0.0006602574,0.0011443158,0.0015347331,0.0013283436,0.0005893253,0.0003257146],"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.00048935896,0.00013116254,0.0015745173,0.00018846238,0.00006316505,0.00022073192,0.00016733665,0.7675639,0.016523192,0.10370794,0.0011616618,0.10820862],"study_design_scores_gemma":[0.000023005445,0.00016388785,0.00039375413,0.000018870274,0.000019098501,0.00016196952,0.00006706389,0.96896654,0.004214804,0.025021981,0.0009270934,0.000021946547],"about_ca_topic_score_codex":0.0007436713,"about_ca_topic_score_gemma":0.0005703709,"teacher_disagreement_score":0.002031196,"about_ca_system_score_codex":0.00058660435,"about_ca_system_score_gemma":0.0006856034,"threshold_uncertainty_score":0.010742128},"labels":[],"label_agreement":null},{"id":"W2316613882","doi":"10.1109/tcomm.2016.2550524","title":"Error Probability Analysis and Applications of Amplitude-Coherent Detection in Flat Rayleigh Fading Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Detector; Fading; Rayleigh fading; Algorithm; Multipath propagation; Electronic engineering; Monte Carlo method; Detection theory; Mathematics; Probability density function; Computer science; Diversity combining; Quadrature amplitude modulation; Bit error rate; Statistics; Channel (broadcasting); Telecommunications; Engineering; Decoding methods","score_opus":0.028290653831806203,"score_gpt":0.27922137724872487,"score_spread":0.2509307234169187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316613882","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.012104737,0.000967789,0.98427725,0.00012343987,0.000028483051,0.000017668668,0.000031237076,0.00010992337,0.0023394166],"genre_scores_gemma":[0.7707243,0.0040635834,0.222108,0.00017159196,0.0002521527,0.000094770854,0.00013976044,0.000108632434,0.0023372858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780566,0.0006686627,0.000107114654,0.0002630796,0.0010287132,0.00012682799],"domain_scores_gemma":[0.99154776,0.0065077683,0.0004951892,0.00053353945,0.0008669593,0.000048810914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021331557,0.0009708854,0.0007934607,0.0012743094,0.00033253865,0.0009643533,0.00070739794,0.0008436988,0.0011510552],"category_scores_gemma":[0.015597141,0.00037728655,0.0005450093,0.0010686412,0.0011215968,0.0015246673,0.001165022,0.0007893389,0.00034682566],"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.00012045074,0.00004181538,0.00139995,0.00021122555,0.000062871775,0.00017269676,0.00013320075,0.797257,0.0112327505,0.113115504,0.0005709011,0.07568162],"study_design_scores_gemma":[0.000004317084,0.00005100601,0.00039007375,0.000017272207,0.000012940691,0.00014902538,0.000010762181,0.98153573,0.0038341528,0.0133728115,0.0006043644,0.000017492597],"about_ca_topic_score_codex":0.0008236015,"about_ca_topic_score_gemma":0.00048260405,"teacher_disagreement_score":0.0021331557,"about_ca_system_score_codex":0.0008332978,"about_ca_system_score_gemma":0.0007939996,"threshold_uncertainty_score":0.011281371},"labels":[],"label_agreement":null},{"id":"W2325466454","doi":"10.1109/tcomm.2016.2520458","title":"Optimal Power Allocation for Maximum Throughput of General MU-MIMO Multiple Access Channels With Mixed Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"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":"Throughput; MIMO; Computer science; Power (physics); Electronic engineering; Computer network; Max-min fairness; Channel (broadcasting); Mathematical optimization; Engineering; Resource allocation; Telecommunications; Mathematics; Wireless; Physics","score_opus":0.031902309385347306,"score_gpt":0.2768430419197617,"score_spread":0.24494073253441442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325466454","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.007850205,0.00018102523,0.98931307,0.00008133164,0.000014655654,0.00003235982,0.000033188688,0.000063323445,0.0024309189],"genre_scores_gemma":[0.65039176,0.00066341273,0.34454858,0.0001565062,0.00007526608,0.0003442265,0.00014987988,0.0001453725,0.0035249651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992943,0.00028522487,0.00001893507,0.00010539441,0.0001522761,0.00014391825],"domain_scores_gemma":[0.9992906,0.00050829333,0.000055470144,0.000032425876,0.00008678302,0.000026292453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011321396,0.001248299,0.0011743534,0.0004880962,0.0004398507,0.0010591515,0.0010323687,0.00084343564,0.0019505993],"category_scores_gemma":[0.0029929471,0.0005595573,0.0007554412,0.0008697879,0.0009600519,0.0012031914,0.0010883071,0.0010466609,0.00031126564],"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.000059255548,0.000022492111,0.00015611653,0.00008529511,0.000025961643,0.000046241752,0.00005225036,0.9562555,0.0016303632,0.023984231,0.0007055697,0.016976755],"study_design_scores_gemma":[0.000007154628,0.000015741585,0.000036664842,0.000004875246,0.0000035601795,0.000009261152,0.000006991411,0.99088895,0.00047166855,0.008312786,0.00023909735,0.0000032448247],"about_ca_topic_score_codex":0.002860685,"about_ca_topic_score_gemma":0.0026392972,"teacher_disagreement_score":0.002860685,"about_ca_system_score_codex":0.0009887071,"about_ca_system_score_gemma":0.0018849281,"threshold_uncertainty_score":0.007173598},"labels":[],"label_agreement":null},{"id":"W2325575128","doi":"10.1109/tcomm.2016.2538769","title":"Effect of Antenna Configuration on MIMO-Based Access Points in a Short Tunnel With Infrastructure","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":13,"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":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"MIMO; Multipath propagation; Decorrelation; Antenna (radio); Engineering; Electronic engineering; 3G MIMO; Channel (broadcasting); Computer science; Telecommunications","score_opus":0.015364707965673468,"score_gpt":0.261540475856653,"score_spread":0.24617576789097956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325575128","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.9940468,0.00006434386,0.005036848,0.000027179973,0.000009047673,0.0000082835595,0.00003791407,0.00005794027,0.0007117639],"genre_scores_gemma":[0.9991154,0.000022769354,0.0007473339,0.0000048496145,0.0000013857734,0.0000027848753,0.000014810383,0.0000026451946,0.00008806261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928206,0.0002577965,0.00002956769,0.00008603839,0.00013299784,0.00021158632],"domain_scores_gemma":[0.997101,0.001494031,0.00043121463,0.00026165345,0.00048009455,0.00023198924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030275,0.00062616495,0.00049513817,0.00044437425,0.00036343953,0.0005474928,0.000524136,0.0005479577,0.0007491369],"category_scores_gemma":[0.002261736,0.00026955057,0.00030172037,0.000503166,0.0006296779,0.00059128157,0.00071494177,0.00033271272,0.00019919794],"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.0021080559,0.00026585863,0.044863768,0.00021420943,0.00012387267,0.0021191125,0.0002980983,0.76904845,0.16161744,0.001428276,0.00042166683,0.017491236],"study_design_scores_gemma":[0.00013048915,0.0046971077,0.06383164,0.000068804075,0.00022728839,0.0023559039,0.0011320887,0.80128664,0.124219075,0.0011034519,0.00080527813,0.00014225706],"about_ca_topic_score_codex":0.0012258622,"about_ca_topic_score_gemma":0.0015471367,"teacher_disagreement_score":0.0012258622,"about_ca_system_score_codex":0.0003210629,"about_ca_system_score_gemma":0.000282939,"threshold_uncertainty_score":0.003717959},"labels":[],"label_agreement":null},{"id":"W2338352961","doi":"10.1109/tcomm.2016.2592519","title":"Bandlimited Optical Intensity Modulation Under Average and Peak Power Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bandlimiting; Clipping (morphology); Amplitude; Bandwidth (computing); Intensity modulation; Mathematics; Pulse-amplitude modulation; Spectral density; Amplitude modulation; Optical communication; Optics; Physics; Phase modulation; Frequency modulation; Computer science; Mathematical analysis; Fourier transform; Telecommunications; Statistics; Pulse (music); Detector","score_opus":0.025035927424638366,"score_gpt":0.23926420542901952,"score_spread":0.21422827800438116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338352961","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.07815283,0.00019431466,0.9129591,0.00009752508,0.00001974851,0.000031612883,0.00006473601,0.0002003724,0.008279768],"genre_scores_gemma":[0.9589978,0.0002334102,0.038473368,0.000049365342,0.00002508738,0.000044008983,0.000055054737,0.00002051947,0.0021014793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931026,0.00021046025,0.000023679171,0.0000698427,0.00030423788,0.00008144394],"domain_scores_gemma":[0.9986638,0.0007182465,0.00021624994,0.00024047728,0.00013243245,0.000028878652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178266,0.0004824458,0.0005209585,0.00023657954,0.00023396869,0.0007328622,0.00057954295,0.00044828144,0.0013056882],"category_scores_gemma":[0.002880618,0.00020077967,0.00028229796,0.00047651655,0.0006193305,0.0013828278,0.0005619796,0.0005737298,0.00031452492],"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.00020722263,0.000071343464,0.0010935983,0.00012045028,0.000034082303,0.00033224578,0.00010073092,0.7325564,0.050379917,0.15978505,0.0008142158,0.054504782],"study_design_scores_gemma":[0.0000053187227,0.000049869686,0.00018033678,0.0000055184414,0.0000034270668,0.000121041914,0.000011162144,0.9799284,0.0074366126,0.011608083,0.000642465,0.000007740505],"about_ca_topic_score_codex":0.00047884585,"about_ca_topic_score_gemma":0.00042115958,"teacher_disagreement_score":0.0013056882,"about_ca_system_score_codex":0.00043466905,"about_ca_system_score_gemma":0.00047053726,"threshold_uncertainty_score":0.004368007},"labels":[],"label_agreement":null},{"id":"W2344765023","doi":"10.1109/tcomm.2016.2519513","title":"Spectral-Efficiency Analysis of Massive MIMO Systems in Centralized and Distributed Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Spectral efficiency; Electronic engineering; Telecommunications; Computer network; Distributed computing; Engineering; Beamforming","score_opus":0.01607228095544152,"score_gpt":0.25155018990841926,"score_spread":0.23547790895297774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344765023","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.14692242,0.0013566758,0.8360231,0.00028527962,0.00003534526,0.000038677346,0.000099931625,0.00021669509,0.01502185],"genre_scores_gemma":[0.9864283,0.00038510657,0.011728455,0.00005351958,0.00003660154,0.000024552592,0.000040723,0.00002450772,0.0012782932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986395,0.00042919148,0.00003677806,0.00015486298,0.00052908994,0.00021052608],"domain_scores_gemma":[0.9961808,0.0023073794,0.00034632318,0.00046810714,0.0006119409,0.00008549697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019632706,0.0006982434,0.0008433163,0.00069103,0.00041367105,0.0011412812,0.0008413984,0.0006768274,0.0014047821],"category_scores_gemma":[0.0058739586,0.00030844627,0.0005640486,0.00084206404,0.0011061777,0.0015252192,0.0010362566,0.00056198955,0.0004126437],"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.000077619006,0.000041240957,0.0009208695,0.000058564874,0.000043579574,0.0000945012,0.0000660891,0.9426216,0.0050129876,0.037333097,0.00042204166,0.013307883],"study_design_scores_gemma":[0.0000037800687,0.000039999017,0.00049879,0.000008510608,0.0000096433305,0.00006460186,0.00003262368,0.99123716,0.0015165498,0.0063195094,0.00025958562,0.000009261994],"about_ca_topic_score_codex":0.0012873631,"about_ca_topic_score_gemma":0.0009731863,"teacher_disagreement_score":0.0019632706,"about_ca_system_score_codex":0.0013329916,"about_ca_system_score_gemma":0.0006783068,"threshold_uncertainty_score":0.010382891},"labels":[],"label_agreement":null},{"id":"W2409452000","doi":"10.1109/tcomm.2017.2737018","title":"Continuous Transmission of Spatially Coupled LDPC Code Chains","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Instituto de Investigación Sanitaria Gregorio Marañón; National Science Foundation; Ministerio de Economía y Competitividad; Universidad Carlos III de Madrid","keywords":"Low-density parity-check code; Decoding methods; Transmission (telecommunications); Computer science; Encoding (memory); Code (set theory); Chain (unit); Concatenated error correction code; Algorithm; Theoretical computer science; Parallel computing; Telecommunications; Block code; Physics","score_opus":0.04624845525456713,"score_gpt":0.3185063007431408,"score_spread":0.2722578454885737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409452000","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.39332822,0.00037981372,0.5981436,0.0001889695,0.00007091514,0.00008225171,0.00008572979,0.00059758476,0.007122975],"genre_scores_gemma":[0.91025573,0.00012900562,0.08773956,0.000054312906,0.000019487918,0.000049158487,0.000047092653,0.000029514098,0.0016761957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997392,0.00007236821,0.000013670306,0.000045770033,0.000094501316,0.000034400855],"domain_scores_gemma":[0.9990951,0.00025284706,0.00015477989,0.0002467255,0.00018618366,0.00006441703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027904086,0.00030889033,0.00024888938,0.00027884435,0.00033800164,0.00036430953,0.00056362484,0.00034798103,0.0010569904],"category_scores_gemma":[0.00085789216,0.00016477358,0.0001564741,0.00035645594,0.0005560896,0.0004862723,0.0005652805,0.00042892256,0.00029196875],"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.00048203598,0.0001481623,0.0020415038,0.00023507506,0.000061038954,0.00066435186,0.00041817452,0.2499043,0.5824357,0.066060424,0.0011632626,0.09638592],"study_design_scores_gemma":[0.00003466279,0.0002301283,0.00032656646,0.000016934444,0.000023642231,0.00019999135,0.000028331528,0.86086214,0.12831654,0.0068016807,0.0031217423,0.00003766908],"about_ca_topic_score_codex":0.0005429529,"about_ca_topic_score_gemma":0.00075726805,"teacher_disagreement_score":0.0010569904,"about_ca_system_score_codex":0.00032203348,"about_ca_system_score_gemma":0.00033777347,"threshold_uncertainty_score":0.003535986},"labels":[],"label_agreement":null},{"id":"W2429501648","doi":"10.1109/tcomm.2008.060585","title":"A blind carrier frequency offset estimation scheme for OFDM systems with constant modulus signaling","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":57,"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":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Frequency offset; Identifiability; Frequency domain; Control theory (sociology); Mathematics; MIMO; Frequency-division multiplexing; Electronic engineering; Algorithm; Channel (broadcasting); Computer science; Telecommunications; Engineering; Statistics","score_opus":0.04470431198106362,"score_gpt":0.2741929415919258,"score_spread":0.2294886296108622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429501648","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.007843947,0.0001994063,0.9912914,0.00005945924,0.00004090933,0.000022944158,0.000018811033,0.00011081974,0.00041229065],"genre_scores_gemma":[0.3628912,0.00036169158,0.63395613,0.00012643349,0.0001457385,0.00008424832,0.00009270622,0.000022809467,0.0023189778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994336,0.00013590646,0.000042206786,0.000086468186,0.00025069885,0.000051182065],"domain_scores_gemma":[0.9991559,0.00032606607,0.0001667272,0.00013001604,0.00018860173,0.000032724874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079090765,0.00067665393,0.00062151125,0.00048315243,0.0005358921,0.000568377,0.0007097699,0.0009813453,0.00081335695],"category_scores_gemma":[0.0027782156,0.00025291223,0.00030890506,0.00049073086,0.0005230792,0.0014802326,0.0007773586,0.0008477321,0.0003751411],"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.000812522,0.00015236001,0.0011178172,0.00025053276,0.000086207794,0.00019470068,0.00020899095,0.13406575,0.12168789,0.050285235,0.002444929,0.688693],"study_design_scores_gemma":[0.000058934347,0.00021072397,0.00037769004,0.000024380768,0.00003790535,0.00027246805,0.000016743095,0.9576944,0.03139767,0.006558767,0.0032931278,0.00005717154],"about_ca_topic_score_codex":0.000889782,"about_ca_topic_score_gemma":0.0013204237,"teacher_disagreement_score":0.0009813453,"about_ca_system_score_codex":0.0004257965,"about_ca_system_score_gemma":0.0008186642,"threshold_uncertainty_score":0.004182756},"labels":[],"label_agreement":null},{"id":"W2440761015","doi":"10.1109/tcomm.2016.2581163","title":"A Class of Binary Locally Repairable Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":36,"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":"Erasure code; Binary number; Locality; Binary code; Block code; Erasure; Code (set theory); Computer science; Mathematics; Discrete mathematics; Algorithm; Arithmetic; Decoding methods","score_opus":0.03640963298082039,"score_gpt":0.28290905033410435,"score_spread":0.24649941735328396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440761015","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.20417196,0.003685279,0.7624794,0.0008228143,0.00018388627,0.00020067475,0.0009848803,0.00095163996,0.026519489],"genre_scores_gemma":[0.8750635,0.0016277417,0.11027865,0.00034809837,0.00015647936,0.00033578722,0.000736086,0.00010525945,0.011348372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993156,0.00010193906,0.00004283418,0.00014969832,0.00026197158,0.00012795269],"domain_scores_gemma":[0.9978123,0.0007906362,0.00045716704,0.0004034658,0.00041986746,0.00011655507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041739017,0.000433253,0.0004499815,0.0011276176,0.000633675,0.0008636008,0.00070048845,0.00069769094,0.0023889225],"category_scores_gemma":[0.0036176408,0.00018813096,0.0002971848,0.0009047148,0.0008854687,0.0012876508,0.00097164,0.0010022045,0.0007546663],"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.0005877612,0.00014940018,0.0026996,0.00052250724,0.000044642038,0.00045743166,0.00033906905,0.109248,0.044687327,0.5722605,0.008299139,0.26070467],"study_design_scores_gemma":[0.00014510498,0.00046034093,0.0022080652,0.00020185698,0.000039361345,0.0023125422,0.00016244322,0.6164816,0.033508625,0.30419254,0.040158205,0.00012929853],"about_ca_topic_score_codex":0.0010069578,"about_ca_topic_score_gemma":0.00063442194,"teacher_disagreement_score":0.0023889225,"about_ca_system_score_codex":0.00065907795,"about_ca_system_score_gemma":0.0010060755,"threshold_uncertainty_score":0.007991731},"labels":[],"label_agreement":null},{"id":"W2461905345","doi":"10.1109/tcomm.2016.2587284","title":"In-band full duplex broadband power line communications","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":65,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Power-line communication; Digital subscriber line; Electronic engineering; Broadband; Wireless; MIMO; Channel (broadcasting); Data transmission; Ethernet; Power (physics); Communications system; Computer network; Telecommunications; Engineering","score_opus":0.02932094541761794,"score_gpt":0.27170775729637187,"score_spread":0.24238681187875394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461905345","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.056873888,0.0013070288,0.9037588,0.0004821554,0.00032669117,0.00008222548,0.00014085573,0.00077794417,0.03625044],"genre_scores_gemma":[0.7687253,0.0017119467,0.20824075,0.00054602476,0.00025261744,0.000083154446,0.00015450132,0.00007325872,0.02021244],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998505,0.000029803636,0.0000067527913,0.000025593541,0.000063034815,0.00002423832],"domain_scores_gemma":[0.99988174,0.00002784903,0.000017649141,0.000025363262,0.000036920723,0.000010451148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000839817,0.0003256596,0.00019615908,0.0001511128,0.00028549018,0.00057525013,0.00046533815,0.0005075567,0.0034259665],"category_scores_gemma":[0.00025419274,0.000111747984,0.0001196312,0.0001909617,0.00026656454,0.0007063514,0.0003923188,0.0004094,0.0008887321],"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.00021151095,0.00023836129,0.0020853756,0.00041796264,0.00003961036,0.00063889544,0.00025536728,0.03769983,0.52335125,0.09505307,0.006080439,0.3339283],"study_design_scores_gemma":[0.00003220991,0.00080871495,0.0018450907,0.00008573851,0.00004947742,0.0032827475,0.00011503395,0.3213082,0.45654574,0.01700232,0.19886197,0.00006278951],"about_ca_topic_score_codex":0.00017345978,"about_ca_topic_score_gemma":0.00024602376,"teacher_disagreement_score":0.0034259665,"about_ca_system_score_codex":0.00020253901,"about_ca_system_score_gemma":0.00014801534,"threshold_uncertainty_score":0.01146096},"labels":[],"label_agreement":null},{"id":"W2463130876","doi":"10.1109/tcomm.2016.2590436","title":"Accurate Range-Free Localization in Multi-Hop Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue; Université du Québec à Montréal; Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Hop (telecommunications); Range (aeronautics); Wireless; Computer network; Real-time computing; Algorithm; Telecommunications; Engineering","score_opus":0.031939828820753864,"score_gpt":0.2588538454936258,"score_spread":0.22691401667287192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463130876","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.014563656,0.0007702553,0.98363584,0.000070919596,0.000026280648,0.000009200914,0.000010052889,0.0003005224,0.0006132752],"genre_scores_gemma":[0.7615433,0.0012325344,0.23555739,0.00009118538,0.00008156261,0.00005325328,0.00007683889,0.000066270484,0.0012976999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878556,0.00039381607,0.00005776437,0.00017425655,0.0005250693,0.000063529544],"domain_scores_gemma":[0.9982845,0.0008726914,0.00025352242,0.0003316105,0.00022962937,0.000028015616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777802,0.0005427418,0.0005242557,0.0007047629,0.00037640907,0.0005096338,0.0008815755,0.000735062,0.00026652843],"category_scores_gemma":[0.004949444,0.00034553077,0.0003084298,0.0008110162,0.00060275843,0.0018891268,0.0012271514,0.00052936893,0.00022379948],"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.00014940096,0.000045217417,0.0017665558,0.00027624742,0.00007151069,0.00021525745,0.00026299673,0.732448,0.029816462,0.024825597,0.0012337306,0.20888896],"study_design_scores_gemma":[0.000011641543,0.000083332285,0.00057637156,0.000019278268,0.0000169071,0.00024270618,0.000035474528,0.97855717,0.00975747,0.008874466,0.0018018185,0.000023318164],"about_ca_topic_score_codex":0.0006775416,"about_ca_topic_score_gemma":0.0005931233,"teacher_disagreement_score":0.0009777802,"about_ca_system_score_codex":0.000286669,"about_ca_system_score_gemma":0.0002997029,"threshold_uncertainty_score":0.0051710606},"labels":[],"label_agreement":null},{"id":"W2468432040","doi":"10.1109/tcomm.2016.2582873","title":"Source-Interference Recovery Over Broadcast Channels: Asymptotic Bounds and Analog Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Encoder; Algorithm; Gaussian; Mathematics; Fading; Decoding methods; Dirty paper coding; Distortion (music); Computer science; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Precoding; MIMO; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.024505061057995353,"score_gpt":0.2561437748499788,"score_spread":0.23163871379198345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468432040","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.022854943,0.0018022212,0.96515614,0.00036500272,0.000033290642,0.000027518303,0.000055491728,0.00014696337,0.009558422],"genre_scores_gemma":[0.89944154,0.0027953861,0.0932484,0.00018328211,0.00013796912,0.00012938894,0.00015140219,0.0000803841,0.0038322294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873954,0.00033306872,0.00003686223,0.0001047207,0.0006430251,0.00014276337],"domain_scores_gemma":[0.9920557,0.0063627,0.00047598392,0.00035810738,0.00063619745,0.00011121976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024043212,0.0011077198,0.0008542642,0.0010247441,0.00044971803,0.0015618578,0.0010621683,0.0010810173,0.0020555838],"category_scores_gemma":[0.016516702,0.00033498363,0.00043910852,0.0012834747,0.002026708,0.002662172,0.002487076,0.0016630033,0.00030504633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012346043,0.00004483773,0.0006249267,0.00023674796,0.000045618934,0.00012372422,0.00016357971,0.8235338,0.0031488598,0.13850644,0.00081787515,0.032630112],"study_design_scores_gemma":[0.000005845312,0.000023318342,0.00007462595,0.000021918615,0.000008943391,0.000048979226,0.000027110567,0.97183686,0.0011730024,0.026456725,0.00031473037,0.000007964444],"about_ca_topic_score_codex":0.0022913641,"about_ca_topic_score_gemma":0.0012795446,"teacher_disagreement_score":0.0024043212,"about_ca_system_score_codex":0.0019620415,"about_ca_system_score_gemma":0.0010389413,"threshold_uncertainty_score":0.014235616},"labels":[],"label_agreement":null},{"id":"W2476647282","doi":"10.1109/tcomm.2005.852828","title":"Pulse Position Amplitude Modulation for Time-Hopping Multiple-Access UWB Communications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":62,"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":"Pulse-position modulation; Pulse-amplitude modulation; Time-hopping; Modulation (music); Computer science; Amplitude modulation; Ultra-wideband; Electronic engineering; Position (finance); Pulse (music); Amplitude; Communications system; Pulse-width modulation; Telecommunications; Frequency modulation; Physics; Engineering; Optics; Bandwidth (computing); Acoustics; Power (physics); Detector","score_opus":0.03631279053491899,"score_gpt":0.2925206503429353,"score_spread":0.2562078598080163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476647282","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.030246913,0.010351845,0.9471211,0.00082668813,0.00041499292,0.000049785594,0.000028211687,0.00022719297,0.010733218],"genre_scores_gemma":[0.73101145,0.008117714,0.25320435,0.00047632388,0.0010418197,0.00015174926,0.0000708488,0.000029686747,0.0058960016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.00008176297,0.000011222853,0.000025713363,0.0001345059,0.00001864007],"domain_scores_gemma":[0.9995043,0.00025956435,0.000048387512,0.00006840237,0.00010358486,0.000015739282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034379866,0.00029992987,0.00028028365,0.0003029422,0.00037717054,0.0005186274,0.00039585508,0.0006773985,0.0017904465],"category_scores_gemma":[0.0012081676,0.00011541947,0.000121806996,0.0003899704,0.0003590278,0.00073512824,0.00038069228,0.0006817985,0.00057769625],"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.00031582807,0.00008034755,0.0010116213,0.00054957485,0.00006233845,0.0008502489,0.00019140492,0.058954738,0.15379302,0.34539816,0.0041173114,0.43467537],"study_design_scores_gemma":[0.00007511376,0.0005582942,0.0009071867,0.00013229893,0.0000774442,0.0018859267,0.00005730273,0.7800905,0.05078524,0.10557834,0.059792202,0.000060191553],"about_ca_topic_score_codex":0.00012093252,"about_ca_topic_score_gemma":0.000229545,"teacher_disagreement_score":0.0017904465,"about_ca_system_score_codex":0.00027040413,"about_ca_system_score_gemma":0.00025353633,"threshold_uncertainty_score":0.005989611},"labels":[],"label_agreement":null},{"id":"W2480531776","doi":"10.1109/tcomm.2005.861658","title":"Reduced-dimension MAP turbo-BLAST detection","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":20,"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":"Detector; Maximum a posteriori estimation; Single antenna interference cancellation; Minimum mean square error; Rayleigh fading; Transmitter; Bit error rate; Computer science; Turbo; Turbo code; Electronic engineering; Interference (communication); Fading; Algorithm; Decoding methods; Telecommunications; Mathematics; Engineering; Statistics; Channel (broadcasting); Estimator","score_opus":0.01361716291401347,"score_gpt":0.24148859328577651,"score_spread":0.22787143037176305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480531776","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.043552354,0.0003357702,0.95056677,0.00022501101,0.000067172325,0.000034366785,0.00013493857,0.00079786265,0.0042857123],"genre_scores_gemma":[0.6129368,0.00032395433,0.3802038,0.00021293457,0.000057459445,0.000073270676,0.0002583171,0.00004148397,0.005892028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931633,0.00018885413,0.000028392911,0.00006717459,0.00034239082,0.00005689117],"domain_scores_gemma":[0.99901545,0.00032653523,0.000105652274,0.00018088173,0.00034075155,0.00003074366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045248403,0.00044730352,0.00064640754,0.00047384846,0.000268161,0.0006247346,0.00056890794,0.0006024144,0.0013684538],"category_scores_gemma":[0.0023142518,0.00023839825,0.00028978655,0.0004848144,0.00036198963,0.0007635407,0.00070205197,0.00044599996,0.0007400926],"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.001388159,0.00011427699,0.0035425713,0.00026940476,0.00018010779,0.00050049135,0.0002668327,0.2997055,0.13141151,0.06994377,0.0077420706,0.48493537],"study_design_scores_gemma":[0.000039031136,0.0001865911,0.000646658,0.00001325796,0.000029237151,0.00052378024,0.000018905965,0.9259086,0.05999272,0.008798126,0.0037991197,0.000043960456],"about_ca_topic_score_codex":0.0005908321,"about_ca_topic_score_gemma":0.000874561,"teacher_disagreement_score":0.0013684538,"about_ca_system_score_codex":0.00031083266,"about_ca_system_score_gemma":0.00067431387,"threshold_uncertainty_score":0.0045779943},"labels":[],"label_agreement":null},{"id":"W2483668669","doi":"10.1109/tcomm.2010.03.080011","title":"Dynamics of analog decoders for different message representation domains","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"","keywords":"Representation (politics); Computer science; Decoding methods; Message passing; Theoretical computer science; Electronic engineering; Domain (mathematical analysis); Algorithm; Parallel computing; Mathematics; Engineering","score_opus":0.03419981396875891,"score_gpt":0.3279826731685508,"score_spread":0.29378285919979186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483668669","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.22219987,0.00044162062,0.7412748,0.0007454399,0.000100064106,0.00007493362,0.00011572425,0.00019504188,0.034852467],"genre_scores_gemma":[0.93980056,0.00044503855,0.041985527,0.00018429183,0.00003970298,0.0000861911,0.000089902955,0.0000720416,0.017296817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.000054366243,0.000010973545,0.000041553856,0.00009045409,0.000043027583],"domain_scores_gemma":[0.99922,0.00041853116,0.00011985081,0.00007356761,0.00012437174,0.000043675293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977758,0.00035391806,0.00036149062,0.00043426646,0.00041840723,0.0010696949,0.0005285383,0.00084744464,0.0032963005],"category_scores_gemma":[0.0027809965,0.00026870027,0.00036058194,0.00026812215,0.0010869975,0.0016125728,0.00076785195,0.0010894041,0.00042193715],"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.000095133284,0.000057893398,0.00070152,0.00007476431,0.0000214704,0.00025946676,0.00038297527,0.27075183,0.024409369,0.6893277,0.0006775855,0.013240244],"study_design_scores_gemma":[0.000019959765,0.000030097244,0.00017268426,0.0000152068915,0.0000095152045,0.000104245424,0.000053842974,0.92865694,0.0060350327,0.06352809,0.00135409,0.000020304466],"about_ca_topic_score_codex":0.0014886212,"about_ca_topic_score_gemma":0.0011534244,"teacher_disagreement_score":0.0032963005,"about_ca_system_score_codex":0.00088438473,"about_ca_system_score_gemma":0.00049823255,"threshold_uncertainty_score":0.011027157},"labels":[],"label_agreement":null},{"id":"W2493697552","doi":"10.1109/tcomm.2005.860092","title":"Multiple-Symbol Differential Sphere Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":110,"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":"Fading; Decoding methods; Rayleigh fading; Algorithm; Channel state information; Symbol (formal); Computational complexity theory; Mathematics; Computer science; Rayleigh scattering; Channel (broadcasting); Differential (mechanical device); Telecommunications; Theoretical computer science; Wireless; Engineering; Optics; Physics","score_opus":0.026107716833235046,"score_gpt":0.2690791408217206,"score_spread":0.24297142398848554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493697552","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.010582162,0.000544571,0.98407537,0.00017429273,0.00006814656,0.000029903857,0.00008874943,0.00037733998,0.0040593976],"genre_scores_gemma":[0.4387214,0.0010720389,0.55431825,0.00027496717,0.000102840226,0.00009462988,0.0003991313,0.00008312988,0.0049335985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990395,0.00033493523,0.000067277266,0.00015617197,0.00032593138,0.00007617938],"domain_scores_gemma":[0.9983747,0.0007791854,0.00011462729,0.00039867207,0.00028245963,0.000050354283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007952755,0.0005901288,0.0009321985,0.00057537376,0.0004941878,0.0009055402,0.0006768903,0.0007111365,0.0013189185],"category_scores_gemma":[0.0038884638,0.00022605492,0.00037243863,0.0012045434,0.00088337995,0.0009965631,0.0014851989,0.00060050923,0.00095207524],"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.00040750907,0.00007375437,0.002065385,0.00032987088,0.00007948023,0.00041091244,0.00035624098,0.20653081,0.03361892,0.21781588,0.006540529,0.5317707],"study_design_scores_gemma":[0.000027329668,0.000105827334,0.0003269425,0.000024262024,0.000014920127,0.000548616,0.000032302334,0.90823317,0.03376838,0.045909863,0.010980904,0.000027329981],"about_ca_topic_score_codex":0.00079944305,"about_ca_topic_score_gemma":0.0010000941,"teacher_disagreement_score":0.0013189185,"about_ca_system_score_codex":0.0005531381,"about_ca_system_score_gemma":0.00091071095,"threshold_uncertainty_score":0.0044122934},"labels":[],"label_agreement":null},{"id":"W2496222037","doi":"10.1109/tcomm.2016.2594759","title":"Energy-Efficient Resource Allocation for Downlink Non-Orthogonal Multiple Access Network","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":492,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Mathematical optimization; Efficient energy use; Resource allocation; Single antenna interference cancellation; Convex optimization; Spectral efficiency; Optimization problem; Maximization; Base station; Noma; Multiplexing; Channel (broadcasting); Algorithm; Mathematics; Regular polygon; Computer network; Engineering; Telecommunications","score_opus":0.031359220935228714,"score_gpt":0.2715286323733495,"score_spread":0.2401694114381208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496222037","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.020617519,0.0006566504,0.97630876,0.00013632252,0.000027930764,0.00002821506,0.000020148187,0.000094963645,0.0021094792],"genre_scores_gemma":[0.80377567,0.0008298281,0.19267282,0.00011153327,0.00004057862,0.00014045513,0.00006558648,0.00003687122,0.0023267588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949396,0.0002353747,0.000017189639,0.00006211552,0.00012955151,0.00006191396],"domain_scores_gemma":[0.9996792,0.00018961476,0.00004281137,0.000030750038,0.0000457278,0.000011952975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940948,0.00048146772,0.00054506416,0.0003103867,0.00045124008,0.00058894884,0.0005368474,0.00033961117,0.0007145436],"category_scores_gemma":[0.0013060097,0.00020928858,0.0002752518,0.00054360385,0.00044289517,0.00057091506,0.00058938237,0.0004373861,0.00021944393],"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.0001395837,0.00010712884,0.00069036934,0.00012252117,0.000040825846,0.00016905906,0.00007806555,0.82553905,0.01422318,0.026609588,0.0020525493,0.13022809],"study_design_scores_gemma":[0.0000055593114,0.000020977262,0.00009746262,0.0000030391188,0.00000402773,0.00003106465,0.000009595777,0.9943346,0.0014452223,0.0035563398,0.0004883338,0.000003861583],"about_ca_topic_score_codex":0.0015007464,"about_ca_topic_score_gemma":0.0024107574,"teacher_disagreement_score":0.0015007464,"about_ca_system_score_codex":0.0005048703,"about_ca_system_score_gemma":0.00075172674,"threshold_uncertainty_score":0.003663063},"labels":[],"label_agreement":null},{"id":"W2510173137","doi":"10.1109/tcomm.2017.2650992","title":"Optimal Joint Power and Subcarrier Allocation for Full-Duplex Multicarrier Non-Orthogonal Multiple Access Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":593,"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":"Engineering and Physical Sciences Research Council","keywords":"Subcarrier; Telecommunications link; Computer science; Resource allocation; Base station; Mathematical optimization; Benchmark (surveying); Computational complexity theory; Optimization problem; Maximization; Convex optimization; Throughput; Orthogonal frequency-division multiplexing; Algorithm; Computer network; Mathematics; Regular polygon; Wireless; Telecommunications","score_opus":0.05177138249031417,"score_gpt":0.2963507919404115,"score_spread":0.24457940945009732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510173137","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.029755753,0.00036157534,0.96802,0.00009034527,0.000016466,0.000032126773,0.000014640191,0.00006665322,0.0016424314],"genre_scores_gemma":[0.79614365,0.0004634911,0.20128448,0.000064279106,0.000040568055,0.00009205792,0.000031167227,0.000032645134,0.0018476436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938786,0.00028239517,0.000025241405,0.000080884114,0.00014688422,0.000076670374],"domain_scores_gemma":[0.99893624,0.0007210993,0.00012994718,0.000059031558,0.00012816762,0.000025638949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009154202,0.0005917109,0.0006845326,0.00030383974,0.00033099955,0.0009047774,0.0005139844,0.00047990982,0.0008451463],"category_scores_gemma":[0.003292358,0.0003733558,0.00024709172,0.00044262927,0.0006064889,0.0008273929,0.00052243593,0.000505026,0.0002344443],"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.00006224987,0.00004819141,0.00039403813,0.000062605126,0.00002689428,0.00004882313,0.00005598625,0.94521743,0.003947729,0.012702373,0.00037019036,0.03706343],"study_design_scores_gemma":[0.000004706768,0.000015726499,0.00004644895,0.0000017752748,0.0000022950287,0.000009185974,0.0000066088605,0.99765575,0.0006248643,0.0014909591,0.00013956129,0.0000019805302],"about_ca_topic_score_codex":0.0015945535,"about_ca_topic_score_gemma":0.0016239462,"teacher_disagreement_score":0.0015945535,"about_ca_system_score_codex":0.0006282907,"about_ca_system_score_gemma":0.0010726976,"threshold_uncertainty_score":0.004841268},"labels":[],"label_agreement":null},{"id":"W2510935666","doi":"10.1109/tcomm.2016.2603981","title":"Decoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sliding window protocol; Computer science; Sequential decoding; Relay; Fading; List decoding; Channel state information; Algorithm; Context (archaeology); Channel (broadcasting); Real-time computing; Telecommunications; Computer network; Electronic engineering; Block code; Wireless; Engineering; Window (computing); Concatenated error correction code","score_opus":0.04001104619709668,"score_gpt":0.26583161348524575,"score_spread":0.2258205672881491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510935666","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.4701108,0.0035236431,0.509672,0.00057262246,0.00009875,0.000051537394,0.00038217154,0.00038128765,0.015207184],"genre_scores_gemma":[0.98602676,0.0009302673,0.0113851745,0.000040264345,0.000032196152,0.000022266517,0.00011504952,0.000043727217,0.0014042438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941576,0.00010811248,0.000028337681,0.00008773018,0.00021399249,0.0001461118],"domain_scores_gemma":[0.9949155,0.0035695846,0.00041923227,0.000337535,0.0006709293,0.00008720622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014329412,0.0008967962,0.00057017006,0.00067466585,0.00034822646,0.00090253266,0.00061582186,0.0005591521,0.0016457747],"category_scores_gemma":[0.0077942275,0.00025799905,0.0003386445,0.0006561305,0.0009986069,0.0015155006,0.0007159748,0.00073637237,0.00033623833],"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.00034383833,0.00006996894,0.0025010277,0.00015102889,0.000050457616,0.0002502527,0.00021190358,0.89734536,0.020186007,0.05523991,0.0008243125,0.022825886],"study_design_scores_gemma":[0.000009424022,0.000102261045,0.0006175379,0.000020115205,0.000028149318,0.00018128667,0.00006496209,0.9824667,0.007731288,0.0083744,0.00038458276,0.0000194006],"about_ca_topic_score_codex":0.003437086,"about_ca_topic_score_gemma":0.0024145148,"teacher_disagreement_score":0.003437086,"about_ca_system_score_codex":0.0016598665,"about_ca_system_score_gemma":0.0013993478,"threshold_uncertainty_score":0.012043238},"labels":[],"label_agreement":null},{"id":"W2512920678","doi":"10.1109/tcomm.2016.2602341","title":"Ambient Backscatter Communication Systems: Detection and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":445,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Backscatter (email); Electronic engineering; Computer science; Remote sensing; Telecommunications; Electrical engineering; Engineering; Wireless; Geology","score_opus":0.014493826952490855,"score_gpt":0.21314515182205118,"score_spread":0.19865132486956033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512920678","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.09981141,0.0073125646,0.8827703,0.000548878,0.00006170633,0.000061664556,0.000098772456,0.00030585224,0.009028839],"genre_scores_gemma":[0.9586502,0.0041648867,0.034186922,0.000114610055,0.00011422574,0.00005979299,0.00010248761,0.00004995534,0.0025569021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857545,0.0003571908,0.000052615997,0.00019043472,0.000681837,0.00014247322],"domain_scores_gemma":[0.99695754,0.0017337686,0.00039371563,0.00023052617,0.0006422048,0.00004217246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151851,0.000935327,0.00073829974,0.0006308032,0.00030652055,0.0009637893,0.00060879125,0.001191309,0.0009022837],"category_scores_gemma":[0.0044826274,0.00033357056,0.00036474687,0.0010235475,0.0008265041,0.0016811738,0.00080613745,0.0009079705,0.0004474099],"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.00023417032,0.00014876186,0.004023669,0.0005608012,0.00013023516,0.0004808723,0.0003459688,0.78569466,0.06143546,0.0722463,0.0019281599,0.072770886],"study_design_scores_gemma":[0.0000038688563,0.00008914167,0.00067548803,0.000018873425,0.000017133767,0.000245708,0.00003751736,0.98791283,0.0055953884,0.0045640427,0.0008199005,0.000020125786],"about_ca_topic_score_codex":0.00148362,"about_ca_topic_score_gemma":0.0008408369,"teacher_disagreement_score":0.00148362,"about_ca_system_score_codex":0.00089841516,"about_ca_system_score_gemma":0.0005033272,"threshold_uncertainty_score":0.0065185428},"labels":[],"label_agreement":null},{"id":"W2516258115","doi":"10.1109/tcomm.2016.2602863","title":"QoS-Aware Throughput Maximization in Wireless Powered Underground Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":56,"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":"National Natural Science Foundation of China","keywords":"Quality of service; Computer science; Throughput; Optimization problem; Reliability (semiconductor); Wireless; Computer network; Wireless sensor network; Resource allocation; Convex optimization; Maximization; Distributed computing; Real-time computing; Mathematical optimization; Telecommunications","score_opus":0.021964110672200974,"score_gpt":0.23410363464526046,"score_spread":0.2121395239730595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516258115","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.090958536,0.0010039163,0.90110683,0.00065805577,0.00006309111,0.00004870818,0.00009346126,0.00015752506,0.0059098667],"genre_scores_gemma":[0.9693403,0.00084287435,0.0280815,0.00007132866,0.000056887697,0.00006192794,0.000045787117,0.00004122887,0.0014581727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934906,0.00031804523,0.000018040944,0.00008192167,0.00012126674,0.00011165502],"domain_scores_gemma":[0.99862075,0.0010411479,0.00013651243,0.000038741426,0.00012415274,0.000038682574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011326779,0.0009027442,0.0007718395,0.00040518597,0.00040395066,0.0009098714,0.0006978116,0.000726537,0.0010066566],"category_scores_gemma":[0.0031872126,0.00034075227,0.0003070573,0.0009330671,0.0010585412,0.0014714621,0.0006964537,0.0006472018,0.00013093774],"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.00004958961,0.000024483124,0.00022930527,0.00006399807,0.000015703263,0.000078889345,0.00005354378,0.96928287,0.003983463,0.018336903,0.0005044781,0.00737684],"study_design_scores_gemma":[0.00000406006,0.0000144769565,0.000049179765,0.000003398939,0.0000027508913,0.000010483676,0.000014515277,0.9934295,0.0005603519,0.0057661138,0.00014181134,0.000003416058],"about_ca_topic_score_codex":0.0018958325,"about_ca_topic_score_gemma":0.0014795744,"teacher_disagreement_score":0.0018958325,"about_ca_system_score_codex":0.0012516243,"about_ca_system_score_gemma":0.0007663749,"threshold_uncertainty_score":0.009081185},"labels":[],"label_agreement":null},{"id":"W2516324260","doi":"10.1109/tcomm.2016.2602342","title":"Approximation of Achievable Rates in Additive Gaussian Mixture Noise Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Entropy (arrow of time); Gaussian noise; Gaussian; Amplitude; Upper and lower bounds; Differential entropy; Piecewise; Binary entropy function; Control theory (sociology); Algorithm; Principle of maximum entropy; Mathematical analysis; Computer science; Statistics; Physics","score_opus":0.020544935675273403,"score_gpt":0.2573660085841491,"score_spread":0.2368210729088757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516324260","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.0066096005,0.0003940509,0.98907745,0.00006964591,0.000017020117,0.000024302888,0.000043380027,0.00023468942,0.0035298672],"genre_scores_gemma":[0.6518138,0.0022734127,0.33910316,0.00015371702,0.000090537666,0.00033677503,0.0002969822,0.0003562789,0.005575303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710613,0.0010890727,0.00010748946,0.0002473058,0.0011332289,0.00031680887],"domain_scores_gemma":[0.9941772,0.0042920955,0.0003715613,0.00052450417,0.00055655936,0.00007811403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035967883,0.002171182,0.0015208906,0.0020767308,0.0005786678,0.0020260795,0.0018841343,0.0012187138,0.002482494],"category_scores_gemma":[0.0155664375,0.0006688391,0.0012661581,0.0014134424,0.0021946388,0.0029146273,0.0017919383,0.0021129418,0.00096332986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066292596,0.00001872006,0.00028701493,0.00011117442,0.000028208655,0.000097212025,0.00010737623,0.86643785,0.0020119955,0.118640035,0.0003628643,0.011831234],"study_design_scores_gemma":[0.0000020617647,0.000007685674,0.00003596963,0.000018753479,0.000004492798,0.000037889826,0.0000093858425,0.98006105,0.0010082042,0.01848009,0.00032530472,0.000009116211],"about_ca_topic_score_codex":0.0024856215,"about_ca_topic_score_gemma":0.0015660347,"teacher_disagreement_score":0.0035967883,"about_ca_system_score_codex":0.0022085654,"about_ca_system_score_gemma":0.0012066035,"threshold_uncertainty_score":0.01902181},"labels":[],"label_agreement":null},{"id":"W2520624197","doi":"10.1109/tcomm.2017.2664860","title":"Robust Resource Allocation for MIMO Wireless Powered Communication Networks Based on a Non-Linear EH Model","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":349,"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":"Australian Research Council; Alexander von Humboldt-Stiftung","keywords":"Computer science; Robustness (evolution); Channel state information; MIMO; Resource allocation; Maximization; Wireless; Mathematical optimization; Convex optimization; Throughput; Transmitter power output; Wireless network; Computer network; Channel (broadcasting); Regular polygon; Telecommunications; Mathematics; Transmitter","score_opus":0.050879311781171846,"score_gpt":0.2678242946319973,"score_spread":0.21694498285082547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520624197","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.020925488,0.00032682577,0.97488225,0.00015515734,0.000033017484,0.000030521307,0.000044737077,0.00010101558,0.0035010243],"genre_scores_gemma":[0.97073823,0.00035287716,0.025546405,0.000100962345,0.000031767337,0.00007783677,0.00004112928,0.000020017455,0.0030908035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991534,0.0002981504,0.000029695871,0.00017877827,0.00018881541,0.00015121116],"domain_scores_gemma":[0.9990018,0.0006556404,0.00013682342,0.00007029135,0.000104789164,0.000030683314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093603524,0.0009071109,0.00090578216,0.00031038196,0.00037896598,0.0012430049,0.0010172868,0.00082596875,0.0016576318],"category_scores_gemma":[0.0020953144,0.00037521406,0.0004172034,0.00068295054,0.0009013973,0.0012895562,0.0009719455,0.0008006263,0.00031514294],"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.000036844336,0.000021016107,0.00010487681,0.00004434982,0.000019932331,0.00009102188,0.000027320526,0.9790906,0.0022140995,0.011917114,0.00026622048,0.006166663],"study_design_scores_gemma":[0.000003666619,0.000017108641,0.00004160603,0.0000022785605,0.0000043399195,0.000015166959,0.00000760173,0.9968479,0.00029200123,0.0026605825,0.00010352892,0.0000040990744],"about_ca_topic_score_codex":0.0016665077,"about_ca_topic_score_gemma":0.0015953053,"teacher_disagreement_score":0.0016665077,"about_ca_system_score_codex":0.0008448726,"about_ca_system_score_gemma":0.00056385587,"threshold_uncertainty_score":0.00612998},"labels":[],"label_agreement":null},{"id":"W2522427612","doi":"10.1109/tcomm.2016.2611669","title":"Improved Coarse Timing Estimation in OFDM Systems Using High-Order Statistics","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"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":"Intersymbol interference; Orthogonal frequency-division multiplexing; Fading; Computer science; False alarm; Multipath propagation; Preamble; Robustness (evolution); Algorithm; Carrier frequency offset; Frequency offset; Statistics; Electronic engineering; Mathematics; Decoding methods; Estimator; Telecommunications; Artificial intelligence; Engineering","score_opus":0.037946694580337836,"score_gpt":0.29658902064746695,"score_spread":0.2586423260671291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522427612","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.016698126,0.00027424033,0.98236096,0.00003336919,0.000025311001,0.000014480994,0.000019534293,0.00020882631,0.0003651168],"genre_scores_gemma":[0.4249711,0.00058553537,0.57309717,0.00007384413,0.00012901892,0.00005302799,0.00011171962,0.00007203846,0.00090659445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991499,0.00024223726,0.000054714747,0.00009977728,0.00039695838,0.000056409608],"domain_scores_gemma":[0.9970018,0.0017673229,0.00056278426,0.00033419667,0.0002710491,0.000062767285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094426726,0.0008174077,0.0006871412,0.0010554342,0.0003020381,0.0007542885,0.0005072907,0.00042423056,0.00046628146],"category_scores_gemma":[0.005871161,0.00028524097,0.0002689935,0.0008332188,0.0005268609,0.0015572698,0.00071591674,0.0006792102,0.00019538421],"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.00039689234,0.00009393922,0.0037143587,0.0002296568,0.00007056621,0.0002111517,0.00024619178,0.34167692,0.09139202,0.032859147,0.0008934057,0.52821577],"study_design_scores_gemma":[0.000016566937,0.00015098852,0.0014471059,0.000016964306,0.00001956703,0.0001885135,0.000017670463,0.9614897,0.029958166,0.0053236815,0.0013309426,0.000040072817],"about_ca_topic_score_codex":0.0009526218,"about_ca_topic_score_gemma":0.0015605994,"teacher_disagreement_score":0.0010554342,"about_ca_system_score_codex":0.000591001,"about_ca_system_score_gemma":0.00088243815,"threshold_uncertainty_score":0.004993856},"labels":[],"label_agreement":null},{"id":"W2525987021","doi":"10.1109/tcomm.2016.2613520","title":"Optimal Energy Management in Hybrid Energy Small Cell Access Points","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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 à Montréal; École de Technologie Supérieure; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Telecommunications link; Decoding methods; Network packet; Mathematical optimization; Online algorithm; Real-time computing; Algorithm; Computer network; Mathematics","score_opus":0.023883692680783653,"score_gpt":0.23538518328888122,"score_spread":0.21150149060809756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525987021","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.08193758,0.0003624014,0.91456145,0.0001721862,0.000036013727,0.00005479489,0.000039199673,0.00012963798,0.0027067],"genre_scores_gemma":[0.96596444,0.00015304537,0.031971272,0.000043299337,0.000016523558,0.000059038244,0.0000274596,0.000018544531,0.0017464142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.00013629512,0.000015822492,0.00009912721,0.00009437835,0.000097506934],"domain_scores_gemma":[0.999418,0.00035385534,0.00007522879,0.000034045013,0.00007592851,0.000043010503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006513691,0.00062484,0.00095092476,0.00035338302,0.00048149182,0.0014909287,0.0008666299,0.00087584986,0.0016714146],"category_scores_gemma":[0.0013068583,0.0004029786,0.00034263593,0.00057502126,0.0007423211,0.0012026649,0.0010760762,0.00069184834,0.00021709065],"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.00011809442,0.000045696233,0.0004177462,0.000029108158,0.000019990486,0.000089537505,0.00003196409,0.9795323,0.0020823695,0.005840236,0.0002845295,0.011508351],"study_design_scores_gemma":[0.000007835052,0.000020988953,0.000046944635,0.0000014190009,0.0000029681212,0.000008596328,0.000014593145,0.99708766,0.00031071962,0.002387384,0.0001081872,0.0000027982146],"about_ca_topic_score_codex":0.0027569288,"about_ca_topic_score_gemma":0.002132287,"teacher_disagreement_score":0.0027569288,"about_ca_system_score_codex":0.00073258433,"about_ca_system_score_gemma":0.0005696746,"threshold_uncertainty_score":0.0055913925},"labels":[],"label_agreement":null},{"id":"W2531628009","doi":"10.1109/tcomm.2016.2617335","title":"Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":63,"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":"Huawei Technologies","keywords":"Low-density parity-check code; Mathematics; Circulant matrix; Block code; Girth (graph theory); Permutation matrix; Permutation (music); Discrete mathematics; Combinatorics; Turbo code; Raptor code; Concatenated error correction code; Linear code; Algorithm; Decoding methods","score_opus":0.04413507167374254,"score_gpt":0.30240792962932656,"score_spread":0.258272857955584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531628009","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.041695826,0.00064424466,0.9476565,0.0002257187,0.00010996256,0.00013002183,0.00014105125,0.0004244724,0.0089721875],"genre_scores_gemma":[0.53346336,0.0006843699,0.46107072,0.0002607482,0.00008344017,0.00021248267,0.00035554633,0.00009913623,0.0037701435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989225,0.00030497808,0.000067153815,0.00012288876,0.00046536856,0.00011700524],"domain_scores_gemma":[0.9979997,0.0006368159,0.0002780548,0.00061545364,0.0003925259,0.00007751184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086503226,0.0005348922,0.00041663426,0.00075976364,0.0006149199,0.00065309345,0.0011351478,0.000600395,0.002230734],"category_scores_gemma":[0.002760883,0.00029583127,0.0006171868,0.0007458559,0.0011544395,0.0010168881,0.0010197505,0.0011992668,0.0007436069],"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.00027255612,0.00009886761,0.0010473264,0.00045414132,0.00006353407,0.0004665239,0.0003204099,0.12760445,0.06474594,0.6750873,0.002780217,0.12705879],"study_design_scores_gemma":[0.00009610632,0.000360078,0.0006426257,0.00009957344,0.000067358764,0.0014673357,0.00008255362,0.7340925,0.07361774,0.16757849,0.021757243,0.00013849688],"about_ca_topic_score_codex":0.00073817524,"about_ca_topic_score_gemma":0.0011445306,"teacher_disagreement_score":0.002230734,"about_ca_system_score_codex":0.00074738386,"about_ca_system_score_gemma":0.001388471,"threshold_uncertainty_score":0.007462561},"labels":[],"label_agreement":null},{"id":"W2539200098","doi":"10.1109/tcomm.2016.2619707","title":"Design of Simultaneous Wireless Information and Power Transfer Scheme for Short Reference DCSK Communication Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Rayleigh fading; Energy (signal processing); Maximum power transfer theorem; Wireless; Bit error rate; Electronic engineering; Transmission (telecommunications); Data transmission; Power (physics); Fading; Telecommunications; Computer network; Engineering; Mathematics","score_opus":0.03174950240713562,"score_gpt":0.24115739863684812,"score_spread":0.2094078962297125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539200098","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.035218257,0.00047252473,0.9595678,0.00022476572,0.00006703239,0.00010360173,0.000036897098,0.00016059774,0.0041485117],"genre_scores_gemma":[0.85645974,0.00043010883,0.13944736,0.0001162214,0.000046982415,0.00019311735,0.000054085813,0.000019808926,0.0032325066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996363,0.00008457079,0.000028200117,0.00009882651,0.000118583215,0.00003352413],"domain_scores_gemma":[0.9997279,0.000061948536,0.00006227053,0.000029635066,0.00010158566,0.00001658951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003723183,0.00040105986,0.00040448245,0.00028512024,0.00045717144,0.0005420865,0.0007724771,0.0005032144,0.0017355765],"category_scores_gemma":[0.00056345266,0.00021418183,0.00026048155,0.00038603897,0.00045075963,0.0007166704,0.00053502957,0.00045428105,0.0004468511],"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.000733783,0.00018576876,0.0015122567,0.0007391665,0.000115116,0.00051769486,0.00079631875,0.17359398,0.3880824,0.12901387,0.0034888843,0.30122083],"study_design_scores_gemma":[0.00008513289,0.0004990742,0.0003952654,0.000037180136,0.000038437112,0.0004455946,0.00006767343,0.936045,0.044911485,0.0073805,0.010051546,0.0000431066],"about_ca_topic_score_codex":0.00039556896,"about_ca_topic_score_gemma":0.00061147753,"teacher_disagreement_score":0.0017355765,"about_ca_system_score_codex":0.00057725754,"about_ca_system_score_gemma":0.0005049127,"threshold_uncertainty_score":0.005806029},"labels":[],"label_agreement":null},{"id":"W2547852178","doi":"10.1109/tcomm.2016.2625257","title":"Secure Full-Duplex Spectrum-Sharing Wiretap Networks with Different Antenna Reception Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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":"Natural Science Foundation of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering","keywords":"Jamming; Secrecy; Computer science; Beamforming; Topology (electrical circuits); Antenna (radio); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Computer network; Mathematics; Physics; Computer security","score_opus":0.021100030737998283,"score_gpt":0.23986032186122833,"score_spread":0.21876029112323003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547852178","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.28451484,0.0008111243,0.70479006,0.000250529,0.0000337982,0.00005522998,0.000091920345,0.0001672849,0.00928519],"genre_scores_gemma":[0.98488796,0.00028578605,0.013968714,0.000020503727,0.000013235563,0.000025420193,0.000024352401,0.000008690041,0.0007653982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867517,0.0005735496,0.000042725485,0.00013764075,0.0003687362,0.00020218165],"domain_scores_gemma":[0.9962406,0.0024064996,0.00044692704,0.00038607477,0.00043863244,0.00008135793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012740417,0.0008463355,0.0007142002,0.00043047624,0.0004565413,0.00096334354,0.0006796217,0.0006939989,0.0009957858],"category_scores_gemma":[0.003927917,0.0002996829,0.0004359706,0.0007885582,0.0015677416,0.0023035628,0.0012363507,0.0006199592,0.00022337782],"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.00043877485,0.000067751185,0.0015341111,0.0001430663,0.000080270365,0.00041138032,0.00020333838,0.86049247,0.018660653,0.099178545,0.00043427947,0.01835533],"study_design_scores_gemma":[0.0000100947855,0.000099825695,0.00013849663,0.0000061469723,0.000020074385,0.00013382584,0.00004083346,0.9888465,0.0044925124,0.00600921,0.00018844414,0.000013955803],"about_ca_topic_score_codex":0.00059163925,"about_ca_topic_score_gemma":0.0005091711,"teacher_disagreement_score":0.0012740417,"about_ca_system_score_codex":0.0009096972,"about_ca_system_score_gemma":0.00051171007,"threshold_uncertainty_score":0.0067378283},"labels":[],"label_agreement":null},{"id":"W2559855608","doi":"10.1109/tcomm.2016.2636289","title":"Quadrature Spatial Modulation in MIMO Cognitive Radio Systems With Imperfect Channel Estimation and Limited Feedback","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise error probability; Rayleigh fading; MIMO; Robustness (evolution); Channel state information; Transmitter; Cognitive radio; Electronic engineering; Antenna diversity; Quadrature amplitude modulation; Computer science; Control theory (sociology); Channel (broadcasting); Algorithm; Mathematics; Fading; Telecommunications; Bit error rate; Antenna (radio); Engineering; Wireless","score_opus":0.016617499654793488,"score_gpt":0.23555080061474445,"score_spread":0.21893330095995098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559855608","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.07496065,0.0031523064,0.91618806,0.000345117,0.00011614173,0.000030466505,0.00004751452,0.00012615774,0.005033628],"genre_scores_gemma":[0.97987056,0.0011746614,0.017841296,0.000078122226,0.00009195361,0.000023031083,0.000015471425,0.000008052968,0.0008968925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990746,0.0003378689,0.000029289124,0.00011604374,0.0002909643,0.00015123068],"domain_scores_gemma":[0.99846137,0.0010067377,0.00022275886,0.00010164504,0.00018309409,0.000024368022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133966,0.00067676295,0.0007335952,0.00033759957,0.00037410096,0.00096991647,0.00069931516,0.0007309637,0.0004085104],"category_scores_gemma":[0.0035682586,0.00029508202,0.00039807285,0.0007697986,0.0009803781,0.0008127569,0.00066018756,0.00063606515,0.000102784856],"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.00018321657,0.00005170789,0.0015653719,0.0002596271,0.00009013511,0.00061157724,0.00022634931,0.8875896,0.00976965,0.06064575,0.00062503875,0.03838202],"study_design_scores_gemma":[0.000008714926,0.00007138246,0.0003163256,0.00001082765,0.000022862883,0.000111046764,0.000021124273,0.9916535,0.00073492376,0.006683696,0.00035611127,0.000009547652],"about_ca_topic_score_codex":0.0026778255,"about_ca_topic_score_gemma":0.0026917935,"teacher_disagreement_score":0.0026778255,"about_ca_system_score_codex":0.00078860845,"about_ca_system_score_gemma":0.00060213485,"threshold_uncertainty_score":0.007084906},"labels":[],"label_agreement":null},{"id":"W2564729533","doi":"10.1109/tcomm.2016.2638907","title":"Novel Water-Filling for Maximum Throughput of Power Grid, MIMO, and Energy Harvesting Coexisting System With Mixed Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"MIMO; Computer science; Power budget; Maximum power principle; Energy harvesting; Interior point method; Mathematical optimization; Maximization; Upper and lower bounds; Power (physics); Electronic engineering; Algorithm; Energy (signal processing); Mathematics; Power control; Electrical engineering; Engineering; Channel (broadcasting); Telecommunications; Photovoltaic system","score_opus":0.025380190050919925,"score_gpt":0.22285349919832,"score_spread":0.19747330914740008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564729533","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.010354659,0.00021320474,0.9860816,0.0001653503,0.000027298845,0.000041849107,0.000060113645,0.00014280225,0.0029131838],"genre_scores_gemma":[0.69380265,0.0005068371,0.29984194,0.00022543865,0.000077408564,0.0002351208,0.00017370083,0.0001178704,0.0050190752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00015480966,0.000019864943,0.00009410101,0.00009110265,0.00012112576],"domain_scores_gemma":[0.9992962,0.00051198853,0.00005064881,0.000034002576,0.00007625195,0.000030886265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153555,0.0010943792,0.0011504677,0.00034803725,0.0006239016,0.0012276524,0.0010971334,0.0009779787,0.003437844],"category_scores_gemma":[0.002212003,0.00046465377,0.0006418249,0.0008599763,0.0009440649,0.0014310776,0.0015923475,0.0011795739,0.00037966733],"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.00018015772,0.000073977906,0.0005179512,0.00025838884,0.000039694314,0.0002680178,0.0003064912,0.8457041,0.0063101575,0.07805715,0.003481237,0.06480278],"study_design_scores_gemma":[0.000010244522,0.00002691189,0.000025075218,0.000006434759,0.0000044954645,0.000025408595,0.000015919728,0.98746246,0.00072420633,0.011178269,0.00051538204,0.0000052335076],"about_ca_topic_score_codex":0.0023351894,"about_ca_topic_score_gemma":0.0022923443,"teacher_disagreement_score":0.003437844,"about_ca_system_score_codex":0.0010191848,"about_ca_system_score_gemma":0.0013696236,"threshold_uncertainty_score":0.011500716},"labels":[],"label_agreement":null},{"id":"W2565767594","doi":"10.1109/tcomm.2016.2638906","title":"Interference-Aware Energy Efficiency Maximization in 5G Ultra-Dense Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":103,"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":"Engineering and Physical Sciences Research Council","keywords":"Scalability; Maximization; Bargaining problem; Nash equilibrium; Computer science; Mathematical optimization; Interference (communication); Spectral efficiency; Efficient energy use; Game theory; Scheme (mathematics); Distributed computing; Computer network; Mathematics; Beamforming; Telecommunications; Engineering; Mathematical economics","score_opus":0.016994730102252317,"score_gpt":0.23147196014308996,"score_spread":0.21447723004083763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565767594","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.055203304,0.00026465324,0.9396328,0.00018020267,0.000013508602,0.00003386463,0.000017599816,0.00007114241,0.0045829406],"genre_scores_gemma":[0.962218,0.00017011816,0.036285564,0.000050166942,0.000009943551,0.000038303155,0.000012762708,0.000011271302,0.0012036972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995926,0.00018594571,0.000011125366,0.000049989274,0.00009094399,0.00006945382],"domain_scores_gemma":[0.9996153,0.00021999031,0.00005714847,0.0000275216,0.00005472844,0.000025203151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088694,0.00054255384,0.00053317857,0.00039007602,0.0003785812,0.0007048925,0.0009403433,0.0005400502,0.0007580218],"category_scores_gemma":[0.0015776437,0.00024326834,0.00028222828,0.00057170214,0.0006792202,0.00088748103,0.0009846644,0.0004220699,0.000117966316],"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.000059959984,0.00003390422,0.00047945877,0.000037432506,0.000019133791,0.000076346936,0.00008688772,0.94212365,0.002812259,0.032905675,0.0005566887,0.020808535],"study_design_scores_gemma":[0.0000049819523,0.00001411854,0.000074031406,0.000003291444,0.000003427231,0.00001622081,0.000018826631,0.99115634,0.00056550367,0.007914948,0.0002251458,0.0000031093446],"about_ca_topic_score_codex":0.0025096794,"about_ca_topic_score_gemma":0.0025763188,"teacher_disagreement_score":0.0025096794,"about_ca_system_score_codex":0.0008956075,"about_ca_system_score_gemma":0.0007106135,"threshold_uncertainty_score":0.0064980984},"labels":[],"label_agreement":null},{"id":"W2582747851","doi":"10.1109/tcomm.2017.2712186","title":"On the Average Locality of Locally Repairable Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":13,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Locality; Computer science; Telecommunications","score_opus":0.05614801475095951,"score_gpt":0.3056711569567056,"score_spread":0.2495231422057461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582747851","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.26850325,0.0036794604,0.71168566,0.0009446117,0.00005455595,0.00009195712,0.00041565552,0.000901688,0.013723185],"genre_scores_gemma":[0.93879086,0.0013562213,0.056323633,0.00017233376,0.00013149704,0.00023652478,0.00028131306,0.00015962332,0.0025479873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975228,0.0006456907,0.00012728052,0.00038014769,0.0008745615,0.00044950566],"domain_scores_gemma":[0.97376615,0.017769571,0.0026251306,0.002771464,0.0023104686,0.0007572041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019515351,0.00069761346,0.0009023869,0.0012452939,0.0010576416,0.0012466985,0.001726316,0.0010089821,0.0016341521],"category_scores_gemma":[0.020472456,0.00050258456,0.00039210552,0.001529511,0.002180632,0.0028461423,0.0019113098,0.001517989,0.00062608946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001199303,0.00017461351,0.0058444296,0.00044131087,0.0000899189,0.0004604272,0.00061950745,0.6833584,0.039339114,0.19291727,0.00422761,0.07132807],"study_design_scores_gemma":[0.000055597906,0.00033072516,0.0014343342,0.00008021062,0.00004405289,0.0005306498,0.00015662285,0.89366734,0.017791037,0.082620814,0.0032019771,0.00008660943],"about_ca_topic_score_codex":0.0024852396,"about_ca_topic_score_gemma":0.0020648667,"teacher_disagreement_score":0.0024852396,"about_ca_system_score_codex":0.0017852639,"about_ca_system_score_gemma":0.0016830764,"threshold_uncertainty_score":0.012953043},"labels":[],"label_agreement":null},{"id":"W2593423258","doi":"10.1109/tcomm.2017.2679194","title":"Optimal Training Design for MIMO-OFDM Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Relay; MIMO; Fading; Orthogonal frequency-division multiplexing; Node (physics); Channel (broadcasting); Computer science; Minimum mean square error; Relay channel; Mean squared error; Signal-to-noise ratio (imaging); Convex optimization; Computational complexity theory; Control theory (sociology); Mathematical optimization; Mathematics; Algorithm; Power (physics); Regular polygon; Telecommunications; Engineering; Statistics","score_opus":0.18213757611971593,"score_gpt":0.3540135723578985,"score_spread":0.17187599623818256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593423258","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.017301442,0.00054935174,0.9791925,0.00021014838,0.000031974094,0.000049720067,0.000047514124,0.000097039985,0.0025202709],"genre_scores_gemma":[0.8574324,0.0010513644,0.13750747,0.00015258277,0.00008603663,0.00024443402,0.00010804613,0.00004805449,0.0033695966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.0003793543,0.000042103547,0.00019596229,0.00017532274,0.00012805876],"domain_scores_gemma":[0.99775606,0.0016323994,0.00023456088,0.00008514845,0.00023889447,0.000053014275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147346,0.0013031599,0.0012878426,0.000429479,0.00038346704,0.0009978794,0.0008414856,0.0017420622,0.0017903041],"category_scores_gemma":[0.0047863913,0.00066809624,0.00043148056,0.0006692704,0.0010246314,0.0012063454,0.0008928078,0.0009234445,0.00041179644],"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.00006183927,0.000040035222,0.00023131497,0.00012071317,0.000028881368,0.000100968675,0.0000887922,0.96210766,0.0033267643,0.011615374,0.0005007931,0.021776902],"study_design_scores_gemma":[0.000011646734,0.000040736122,0.00005863776,0.000007518377,0.0000081819435,0.000026587937,0.000011002483,0.99621576,0.0006483571,0.002715211,0.00025024515,0.000006162682],"about_ca_topic_score_codex":0.0019508074,"about_ca_topic_score_gemma":0.0015139781,"teacher_disagreement_score":0.0019508074,"about_ca_system_score_codex":0.0008617485,"about_ca_system_score_gemma":0.0009341705,"threshold_uncertainty_score":0.0069530606},"labels":[],"label_agreement":null},{"id":"W2609366403","doi":"10.1109/tcomm.2017.2699183","title":"Downlink spectrum allocation for in-band and out-band wireless backhauling of full-duplex small cells","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":90,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Computer science; Computer network; Telecommunications link; Wireless; Base station; Wireless network; Telecommunications","score_opus":0.044218852651344794,"score_gpt":0.2690305192250262,"score_spread":0.2248116665736814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609366403","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.18220377,0.00038087048,0.8101982,0.00010840045,0.000032626933,0.000050938717,0.00006236566,0.00015329264,0.006809616],"genre_scores_gemma":[0.9744803,0.00011977865,0.024577769,0.000025222811,0.0000096063695,0.000022647433,0.000023472656,0.000011049695,0.0007301634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996779,0.000106224616,0.000009904627,0.000052693882,0.00007174622,0.00008156121],"domain_scores_gemma":[0.9995586,0.00022983366,0.000059340033,0.00004910237,0.00006768422,0.000035446938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238593,0.00036226545,0.00043213068,0.00023379586,0.0002777337,0.00067846105,0.0005646163,0.00036321642,0.0010582226],"category_scores_gemma":[0.0009975234,0.00018247568,0.00026865772,0.00036897953,0.00034199172,0.0005380197,0.0005061479,0.00029919558,0.00013251131],"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.00020342304,0.00013991304,0.0013332675,0.000107679705,0.000037525086,0.00012785343,0.000080462465,0.8656255,0.026294714,0.014262571,0.00092415203,0.0908629],"study_design_scores_gemma":[0.000007696881,0.00006242062,0.00040714946,0.0000034442382,0.0000070601122,0.00004673555,0.000037061232,0.99197865,0.004006633,0.0029976259,0.00044093333,0.000004556069],"about_ca_topic_score_codex":0.0014226368,"about_ca_topic_score_gemma":0.0021282285,"teacher_disagreement_score":0.0014226368,"about_ca_system_score_codex":0.00063534296,"about_ca_system_score_gemma":0.0005738247,"threshold_uncertainty_score":0.0046097636},"labels":[],"label_agreement":null},{"id":"W2614571185","doi":"10.1109/tcomm.2017.2704585","title":"On the Design of Symmetric Entropy-constrained Multiple Description Scalar Quantizer with Linear Joint Decoders","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Mathematics; Encoder; Mathematical optimization; Quantization (signal processing); Decoding methods; Entropy (arrow of time); Vector quantization; Computer science","score_opus":0.10785868372587035,"score_gpt":0.3037160328637489,"score_spread":0.19585734913787853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614571185","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.0042417995,0.0001939165,0.99439055,0.00007728169,0.00001416873,0.00003575888,0.000026598716,0.0001132372,0.00090675545],"genre_scores_gemma":[0.46686596,0.00050085667,0.52849257,0.0002021553,0.00005387357,0.00020006487,0.0001968716,0.000060637623,0.0034269525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885356,0.00039948418,0.000079371224,0.00018860995,0.00039724767,0.00008164619],"domain_scores_gemma":[0.99904305,0.00044228774,0.00013401949,0.00011021168,0.0002379317,0.000032481406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016951617,0.0006664403,0.0009106515,0.00034472777,0.0003132283,0.00087892346,0.0010722445,0.0006405795,0.0021085055],"category_scores_gemma":[0.0027335032,0.00042441906,0.0004374793,0.00057482533,0.0007306879,0.0012176317,0.0010209471,0.00080201135,0.00056006527],"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.0002706885,0.000077217024,0.0006798887,0.00034955874,0.000077848854,0.00017126513,0.00018886005,0.64787066,0.025925798,0.09717359,0.0025109064,0.22470368],"study_design_scores_gemma":[0.000022109078,0.00007422772,0.00004912487,0.000012354013,0.000008968368,0.000048702197,0.000009227086,0.98925436,0.0040827566,0.0051490944,0.0012777086,0.000011293065],"about_ca_topic_score_codex":0.0014928309,"about_ca_topic_score_gemma":0.001593554,"teacher_disagreement_score":0.0021085055,"about_ca_system_score_codex":0.00068540085,"about_ca_system_score_gemma":0.001514601,"threshold_uncertainty_score":0.008964956},"labels":[],"label_agreement":null},{"id":"W2614864174","doi":"10.1109/tcomm.2017.2706261","title":"Performance Analysis of Multiple Association in Ultra-Dense Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Base station; Backhaul (telecommunications); Computer science; Fading; Cellular network; Computation; Shadow mapping; Electronic engineering; Computer network; Context (archaeology); Channel (broadcasting); Topology (electrical circuits); Algorithm; Engineering; Electrical engineering","score_opus":0.020080083456787884,"score_gpt":0.2561134467304341,"score_spread":0.23603336327364624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614864174","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.05056189,0.0016226571,0.94115865,0.00044019704,0.00009238231,0.000050283033,0.00007435242,0.00016503216,0.005834609],"genre_scores_gemma":[0.95764345,0.0018819674,0.037250612,0.00015463281,0.00015221107,0.00010279246,0.00009508154,0.00005159185,0.0026676871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975552,0.00088216586,0.00006926065,0.00031707526,0.000806968,0.00036938748],"domain_scores_gemma":[0.9911277,0.0056121703,0.001195064,0.00045091566,0.0013625541,0.00025149612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037742087,0.0012264935,0.0012848342,0.0014582701,0.000803351,0.0019381791,0.0021624393,0.0011254482,0.0017502378],"category_scores_gemma":[0.013724772,0.00064993545,0.00065218157,0.0017614856,0.0018280161,0.0028169118,0.0022037108,0.0013911506,0.000335389],"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.0000319022,0.000026301466,0.0006690095,0.000072634386,0.000025474197,0.00010657256,0.00006344318,0.9474035,0.00085953006,0.043263704,0.0004096025,0.007068292],"study_design_scores_gemma":[0.0000018306241,0.000020180978,0.00012004577,0.000006218992,0.0000050451627,0.000039584815,0.000015297004,0.99509686,0.00017298777,0.0043364484,0.00018009114,0.0000054533116],"about_ca_topic_score_codex":0.003357041,"about_ca_topic_score_gemma":0.0018685743,"teacher_disagreement_score":0.0037742087,"about_ca_system_score_codex":0.002227442,"about_ca_system_score_gemma":0.0013474136,"threshold_uncertainty_score":0.019960165},"labels":[],"label_agreement":null},{"id":"W2616584085","doi":"10.1109/tcomm.2017.2704609","title":"Pre-equalized Faster-than-Nyquist Transmission","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spectral efficiency; Precoding; Nyquist–Shannon sampling theorem; Intersymbol interference; Transmission (telecommunications); Computer science; Equalization (audio); Algorithm; Transmitter; Electronic engineering; Nyquist ISI criterion; Bit error rate; Nyquist rate; Interference (communication); Control theory (sociology); MIMO; Telecommunications; Decoding methods; Sampling (signal processing); Engineering; Beamforming","score_opus":0.04824429144813847,"score_gpt":0.31939884666660523,"score_spread":0.27115455521846676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616584085","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.10079141,0.00033131285,0.8919726,0.00015675339,0.0000918287,0.00006899586,0.00007182787,0.0002836278,0.0062315725],"genre_scores_gemma":[0.6079325,0.00037591162,0.3861406,0.000090619505,0.000047679496,0.000062320076,0.000109351364,0.000039878687,0.005201033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979454,0.000040467214,0.000011850357,0.0000331517,0.000089788315,0.0000303326],"domain_scores_gemma":[0.99964225,0.00013272425,0.000061054234,0.000069554706,0.00008295761,0.000011446658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002960443,0.00047394692,0.00032485492,0.00022026188,0.00030221813,0.00047941876,0.00043523934,0.00051256927,0.0020220706],"category_scores_gemma":[0.0010293513,0.00012083016,0.00022631718,0.00028618018,0.00042576485,0.0007094871,0.000378023,0.00053741777,0.00030638094],"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.00071216153,0.00018007561,0.0018252968,0.0003396614,0.000059213748,0.0005353326,0.00046789355,0.23066776,0.32167727,0.09380425,0.0018116364,0.3479195],"study_design_scores_gemma":[0.000030953513,0.00023098668,0.00076453696,0.000032074568,0.000019056162,0.00036288012,0.00005133289,0.8476329,0.13885435,0.007843415,0.0041380664,0.000039508115],"about_ca_topic_score_codex":0.0010113625,"about_ca_topic_score_gemma":0.0018264652,"teacher_disagreement_score":0.0020220706,"about_ca_system_score_codex":0.00043164325,"about_ca_system_score_gemma":0.0007635713,"threshold_uncertainty_score":0.0067644715},"labels":[],"label_agreement":null},{"id":"W2617309511","doi":"10.1109/tcomm.2017.2708110","title":"Joint Transceiver Design for Secure Downlink Communications Over an Amplify-and-Forward MIMO Relay","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Relay; Artificial noise; Telecommunications link; Computer science; Beamforming; Base station; Transceiver; MIMO; Mathematical optimization; Constraint (computer-aided design); Covariance matrix; Computer network; Wireless; Power (physics); Algorithm; Mathematics; Telecommunications; Physical layer","score_opus":0.09634926893443778,"score_gpt":0.326003359148615,"score_spread":0.2296540902141772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617309511","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.006996878,0.000077239514,0.99186325,0.000054468328,0.000011745434,0.000020902507,0.000016468533,0.000079755235,0.0008793829],"genre_scores_gemma":[0.6928549,0.0004973757,0.30215588,0.00011181133,0.000060791866,0.00022424337,0.00012945614,0.00006479177,0.0039007682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.00035504744,0.000051233623,0.00015953451,0.0003529787,0.00010339749],"domain_scores_gemma":[0.99924314,0.00032528446,0.00013440925,0.0000818901,0.0001731728,0.000042092754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273921,0.0011767717,0.0008500966,0.0003889242,0.00039188896,0.0009962796,0.000766234,0.0008724482,0.0018124724],"category_scores_gemma":[0.0022185629,0.0004160931,0.0005299612,0.00055997027,0.00058338826,0.0010502908,0.001149922,0.0009381312,0.00067589217],"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.00010179989,0.000060036626,0.0005577634,0.00013585706,0.000053174892,0.00023297583,0.00013607657,0.9034907,0.019086812,0.023000052,0.0010981411,0.052046604],"study_design_scores_gemma":[0.000011818726,0.00007928474,0.000049962833,0.0000045501765,0.000012511357,0.000059447197,0.000014618905,0.99444604,0.0028289198,0.0019549185,0.00053037895,0.000007490706],"about_ca_topic_score_codex":0.0010570297,"about_ca_topic_score_gemma":0.0011782438,"teacher_disagreement_score":0.0018124724,"about_ca_system_score_codex":0.0005390964,"about_ca_system_score_gemma":0.0012167089,"threshold_uncertainty_score":0.0067371726},"labels":[],"label_agreement":null},{"id":"W2622829522","doi":"10.1109/tcomm.2017.2712601","title":"TAS-Based Incremental Hybrid Decode–Amplify–Forward Relaying for Physical Layer Security Enhancement","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"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":"Australian Research Council; National Natural Science Foundation of China","keywords":"Relay; Physical layer; Computer science; Overhead (engineering); Transmission (telecommunications); Computer network; Channel state information; Secure transmission; Secrecy; Scheme (mathematics); Electronic engineering; Topology (electrical circuits); Wireless; Engineering; Telecommunications; Power (physics); Mathematics; Electrical engineering","score_opus":0.08509650198207858,"score_gpt":0.35777423591280727,"score_spread":0.2726777339307287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622829522","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.046555556,0.00076161907,0.9474487,0.00018723341,0.00008349601,0.00006955739,0.000089943154,0.00051420025,0.0042897495],"genre_scores_gemma":[0.90689194,0.0006212594,0.090290464,0.0001309361,0.00006137612,0.000054959834,0.00008201425,0.000017976445,0.0018490704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00016869264,0.000032669548,0.00008178577,0.00019652737,0.00009201456],"domain_scores_gemma":[0.9988875,0.0005364844,0.00012868075,0.00017414591,0.00023173497,0.000041483807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072449015,0.00085120666,0.0005441637,0.00055503246,0.00042127157,0.00061822,0.0009300892,0.00044006438,0.00097599695],"category_scores_gemma":[0.0017256227,0.00022303454,0.0005268111,0.000509972,0.00065650954,0.0010718466,0.00095261505,0.0006069358,0.00030133774],"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.00089147035,0.00014090312,0.0034256792,0.00048737772,0.00025585532,0.0011461709,0.0008805774,0.31373063,0.18115355,0.13616125,0.0038172647,0.35790926],"study_design_scores_gemma":[0.000054760316,0.00053908944,0.00062375725,0.000035958856,0.00016248357,0.0013103492,0.00009902157,0.9272334,0.04323938,0.019220728,0.007419723,0.000061474624],"about_ca_topic_score_codex":0.00090027944,"about_ca_topic_score_gemma":0.0016129913,"teacher_disagreement_score":0.00097599695,"about_ca_system_score_codex":0.00040315703,"about_ca_system_score_gemma":0.00059694034,"threshold_uncertainty_score":0.0038315654},"labels":[],"label_agreement":null},{"id":"W2663297862","doi":"10.1109/tcomm.2017.2717831","title":"Digitally Controlled Analog Cancellation for Full Duplex Broadband Power Line Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":29,"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":"Computer science; Echo (communications protocol); Electronic engineering; Dynamic range; Broadband; Successive approximation ADC; Communications system; Analog-to-digital converter; Power (physics); Telecommunications; Electrical engineering; Engineering; Computer network; Capacitor; Voltage; Physics","score_opus":0.04355917880615724,"score_gpt":0.29511871439821996,"score_spread":0.25155953559206273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2663297862","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.017960612,0.0004923052,0.97361577,0.00015224879,0.000084263906,0.00004421621,0.000024225365,0.00054011995,0.0070862784],"genre_scores_gemma":[0.6538704,0.00085643446,0.33075824,0.00035218915,0.00018465125,0.00008383203,0.00008698284,0.00008551581,0.013721701],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968743,0.000060828697,0.000012526833,0.000030224624,0.00018711113,0.000021872074],"domain_scores_gemma":[0.999706,0.0001216965,0.000040180457,0.000034376622,0.00008694752,0.000010758299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263648,0.0003234112,0.0001986549,0.00026246594,0.0003178374,0.0005744978,0.0005219068,0.00043891647,0.0034519895],"category_scores_gemma":[0.00080634945,0.00015280752,0.00018496683,0.00025066955,0.00027935844,0.00070349965,0.00047057736,0.0004671405,0.00083101535],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021386684,0.00014308651,0.0006412576,0.00038901885,0.000036422553,0.00020661087,0.00022014347,0.05685619,0.5144429,0.02979936,0.0034192125,0.39363196],"study_design_scores_gemma":[0.000059719347,0.00042555633,0.00061292155,0.00007318706,0.000044360146,0.0006792373,0.000065697735,0.71060467,0.24463484,0.009972665,0.032766227,0.000060918177],"about_ca_topic_score_codex":0.000334068,"about_ca_topic_score_gemma":0.00071347365,"teacher_disagreement_score":0.0034519895,"about_ca_system_score_codex":0.000329477,"about_ca_system_score_gemma":0.0003215055,"threshold_uncertainty_score":0.011548102},"labels":[],"label_agreement":null},{"id":"W2699584971","doi":"10.1109/tcomm.2017.2764892","title":"Secure Broadcasting Using Independent Secret Keys","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"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":"National Science Foundation","keywords":"Computer science; Broadcasting (networking); Computer network; Transmitter; Channel (broadcasting); Coding (social sciences); Channel capacity; Encryption; Computer security; Topology (electrical circuits); Mathematics","score_opus":0.07183492949968856,"score_gpt":0.31641869231116115,"score_spread":0.2445837628114726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2699584971","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.0454591,0.00084435457,0.9381218,0.0008515119,0.00008163548,0.00007520161,0.00018429538,0.00020431257,0.014177783],"genre_scores_gemma":[0.8832252,0.0025496213,0.10202983,0.00017066076,0.00024989614,0.00019613862,0.00029421775,0.00011673145,0.01116779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974617,0.000886241,0.00010757713,0.00035625958,0.00072454807,0.00046366453],"domain_scores_gemma":[0.99333763,0.0048845243,0.0005552917,0.0006624024,0.00043441888,0.0001257904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018704971,0.0010185767,0.0014070837,0.0008767307,0.0009404831,0.0021574856,0.0012760413,0.0019164801,0.0035134829],"category_scores_gemma":[0.008956195,0.00065124495,0.0008171386,0.0018262871,0.0022409076,0.005772461,0.0024435727,0.0022390287,0.000890441],"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.00046847842,0.000060093873,0.00036533497,0.0004667891,0.00007810796,0.00042972266,0.00044025722,0.28991115,0.01450375,0.6588752,0.0030254265,0.03137564],"study_design_scores_gemma":[0.000057045494,0.00010705338,0.00015026635,0.000038627124,0.00004739763,0.0002891944,0.00012526162,0.7281634,0.0065842005,0.26005492,0.004345858,0.0000367388],"about_ca_topic_score_codex":0.0011198801,"about_ca_topic_score_gemma":0.00066389126,"teacher_disagreement_score":0.0035134829,"about_ca_system_score_codex":0.002007972,"about_ca_system_score_gemma":0.0014492957,"threshold_uncertainty_score":0.0145689845},"labels":[],"label_agreement":null},{"id":"W2726729862","doi":"10.1109/tcomm.2017.2723565","title":"Secure Massive MIMO Relaying Systems in a Poisson Field of Eavesdroppers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Relay; Channel state information; Computer network; Telecommunications link; Computer science; MIMO; Transmission (telecommunications); Reliability (semiconductor); Secure transmission; Poisson point process; Signal-to-noise ratio (imaging); Channel (broadcasting); Antenna (radio); Power (physics); Wireless; Poisson distribution; Telecommunications; Mathematics; Encryption; Physics; Statistics","score_opus":0.030768441062426512,"score_gpt":0.3004351606004512,"score_spread":0.26966671953802474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726729862","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.18765423,0.0017880575,0.798541,0.00073625706,0.00018956221,0.00013171339,0.00027430413,0.0002592301,0.01042556],"genre_scores_gemma":[0.9845675,0.0009773782,0.0095623415,0.00008546665,0.000085492735,0.00006972026,0.0000635625,0.000012572714,0.0045758653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984855,0.000548413,0.00007212391,0.00025416174,0.00034899422,0.0002908454],"domain_scores_gemma":[0.99418145,0.0034950455,0.0011240679,0.00029803076,0.00066196447,0.00023943608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204556,0.0013723294,0.002407377,0.00095851003,0.0011992982,0.0020125513,0.0019809448,0.0018287549,0.0011621718],"category_scores_gemma":[0.004568952,0.00096654607,0.0010722271,0.0015785377,0.0021756566,0.0017864141,0.0023150987,0.0011381226,0.00039573226],"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.00022373474,0.00005072607,0.0010883178,0.000136393,0.00009551707,0.0017462476,0.00022373219,0.8968389,0.004889956,0.08875094,0.00073840463,0.005217135],"study_design_scores_gemma":[0.000020931098,0.00008338161,0.00018416725,0.000007324937,0.000027818623,0.00013731998,0.000056004377,0.99156946,0.00048871816,0.007185364,0.00021682167,0.000022704682],"about_ca_topic_score_codex":0.004943234,"about_ca_topic_score_gemma":0.002588569,"teacher_disagreement_score":0.004943234,"about_ca_system_score_codex":0.0017293937,"about_ca_system_score_gemma":0.0007471321,"threshold_uncertainty_score":0.012547731},"labels":[],"label_agreement":null},{"id":"W2736716964","doi":"10.1109/tcomm.2017.2729552","title":"Average Error Rates and Achievable Capacity in Large Office Indoor Wireless Environments","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"York University; University of Calgary","funders":"","keywords":"Fading; Bit error rate; Channel (broadcasting); Computer science; Path loss; Joint (building); Wireless; Signal-to-noise ratio (imaging); Modulation (music); Electronic engineering; Statistics; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.045564642704518855,"score_gpt":0.28555879766553544,"score_spread":0.2399941549610166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736716964","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.70902115,0.001529248,0.2800572,0.000256678,0.000037030466,0.00003525888,0.0004095535,0.00094804994,0.0077058175],"genre_scores_gemma":[0.99515605,0.00034467957,0.0040642237,0.000011266451,0.000012315735,0.000018142173,0.00006534294,0.000029619265,0.00029839945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984432,0.00049857964,0.000041339954,0.00015798243,0.00047728402,0.00038170817],"domain_scores_gemma":[0.9822939,0.014067005,0.0014819588,0.00096429494,0.0010047758,0.00018795783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016656329,0.0012004308,0.001074795,0.0008861189,0.00072949013,0.0013149519,0.0011243568,0.001009269,0.00086145126],"category_scores_gemma":[0.014586279,0.0003376852,0.0003989947,0.0017263875,0.0016322325,0.0021671464,0.0012075314,0.00087188976,0.00017385486],"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.0001400963,0.00003642789,0.0016325107,0.0000451454,0.000019056719,0.00017631856,0.000061863066,0.9837014,0.0023910245,0.006104609,0.00022268272,0.005468894],"study_design_scores_gemma":[0.00000538012,0.000068705216,0.0010991953,0.000010466842,0.000017032578,0.00010943447,0.00007056712,0.9920517,0.0030909977,0.0032978598,0.000161411,0.000017160339],"about_ca_topic_score_codex":0.005173991,"about_ca_topic_score_gemma":0.0034705356,"teacher_disagreement_score":0.005173991,"about_ca_system_score_codex":0.0016013865,"about_ca_system_score_gemma":0.0007663691,"threshold_uncertainty_score":0.011618912},"labels":[],"label_agreement":null},{"id":"W2738829458","doi":"10.1109/tcomm.2017.2731315","title":"Superposition Signaling in Broadcast Interference Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Superposition principle; Interference (communication); Gaussian; Rate of convergence; Computer science; Single antenna interference cancellation; Topology (electrical circuits); Quadratic equation; Zero-forcing precoding; Mathematical optimization; Convergence (economics); Mathematics; Algorithm; Telecommunications; Decoding methods; MIMO; Precoding; Beamforming; Physics","score_opus":0.031652230011379165,"score_gpt":0.27217589690280014,"score_spread":0.24052366689142096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738829458","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.028676469,0.0010438168,0.95622796,0.0003599494,0.00003593303,0.00002539005,0.00003788161,0.00018369546,0.013408991],"genre_scores_gemma":[0.9264065,0.001601861,0.06884313,0.00013969388,0.0000645831,0.00007583632,0.000055226737,0.000032784574,0.0027804135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.0005312631,0.00002386172,0.00007326734,0.00033239624,0.00011515715],"domain_scores_gemma":[0.99878484,0.000881817,0.0000898341,0.00007659949,0.00013595211,0.000030991137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013847656,0.00055348437,0.00077432476,0.0004419115,0.00053868914,0.0012137498,0.0006308252,0.0007913988,0.0015417733],"category_scores_gemma":[0.0029327967,0.0003228807,0.00041089242,0.0011942699,0.0014449891,0.00112034,0.0011732717,0.001060611,0.00030867453],"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.00012195441,0.000027430335,0.00031756767,0.000112421476,0.000029480478,0.00014582633,0.000114612885,0.7930945,0.005440583,0.15869357,0.0013083406,0.040593732],"study_design_scores_gemma":[0.000009964069,0.000031903208,0.00006216156,0.000011630971,0.000009081988,0.000038345748,0.000018188444,0.960536,0.001208796,0.037375815,0.0006902459,0.000007781798],"about_ca_topic_score_codex":0.0018660876,"about_ca_topic_score_gemma":0.001573793,"teacher_disagreement_score":0.0018660876,"about_ca_system_score_codex":0.0011707714,"about_ca_system_score_gemma":0.000843411,"threshold_uncertainty_score":0.008494556},"labels":[],"label_agreement":null},{"id":"W2742528185","doi":"10.1109/tcomm.2017.2736549","title":"A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"McGill University","funders":"National Natural Science Foundation of China","keywords":"MIMO; Spatial multiplexing; Computer science; Multiplexing; Algorithm; Electronic engineering; Beamforming; Telecommunications; Engineering","score_opus":0.08740658906341649,"score_gpt":0.32649771827796065,"score_spread":0.23909112921454417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742528185","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.004687021,0.00016080956,0.9933929,0.00004444197,0.000014609079,0.000028541632,0.000020641828,0.000092629525,0.0015585357],"genre_scores_gemma":[0.2317174,0.0004272094,0.7634281,0.00010778644,0.00006499799,0.00026376924,0.00017268353,0.000058441514,0.0037596815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.0002149007,0.000075516415,0.00014534005,0.0004183596,0.000077206736],"domain_scores_gemma":[0.999166,0.0003659526,0.00011303906,0.000108023014,0.00022251061,0.000024522322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126946,0.0011774169,0.0007795094,0.0007805199,0.00045756667,0.0012160955,0.0010828457,0.00080244784,0.0020037415],"category_scores_gemma":[0.0027725776,0.00044230683,0.0006208494,0.0013228089,0.0004634022,0.0015279694,0.0013420352,0.00082134205,0.00088871486],"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.0001636197,0.000048346385,0.0005576432,0.0001112848,0.00010419442,0.00010113461,0.00014475305,0.4962727,0.014925586,0.041370433,0.0016391897,0.44456112],"study_design_scores_gemma":[0.0000145110325,0.000075974465,0.00011158367,0.000008527172,0.000019552761,0.00010401773,0.000010424699,0.9849377,0.003165752,0.009601325,0.0019353773,0.00001532976],"about_ca_topic_score_codex":0.0010406128,"about_ca_topic_score_gemma":0.0012408143,"teacher_disagreement_score":0.0020037415,"about_ca_system_score_codex":0.00062329177,"about_ca_system_score_gemma":0.00085552025,"threshold_uncertainty_score":0.0067031384},"labels":[],"label_agreement":null},{"id":"W2743594601","doi":"10.1109/tcomm.2017.2734882","title":"Energy Management for Energy Harvesting Wireless Sensors With Adaptive Retransmission","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","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":"Université du Québec à Montréal; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Pairwise error probability; Retransmission; Network packet; Decoding methods; Automatic repeat request; Energy (signal processing); Wireless sensor network; Real-time computing; Computer network; Algorithm; Telecommunications link; Fading; Hybrid automatic repeat request; Mathematics; Statistics","score_opus":0.036179044799372485,"score_gpt":0.25351807744900734,"score_spread":0.21733903264963486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743594601","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.05608307,0.0011500644,0.94034964,0.00023569427,0.000047176538,0.000042729727,0.000024608646,0.00012593434,0.0019410097],"genre_scores_gemma":[0.9666,0.0006627621,0.030610202,0.00006172119,0.000036817815,0.00005735829,0.000022409107,0.00002428235,0.0019244641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999676,0.00010883953,0.000016135518,0.00006980752,0.00009325942,0.000035997044],"domain_scores_gemma":[0.9996598,0.00017606957,0.0000675827,0.000029375451,0.00005669031,0.000010501804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082562,0.00045484825,0.00045696512,0.00021195244,0.00027094685,0.0005793571,0.00083026657,0.0004150534,0.00067062274],"category_scores_gemma":[0.0013195417,0.00019466608,0.00029830777,0.0003414462,0.00045716338,0.001033719,0.00055037154,0.00040215577,0.000119352495],"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.00018819257,0.000092150585,0.0010807232,0.00020620578,0.000051213086,0.0002951638,0.00017918544,0.85558945,0.025618624,0.041752946,0.0009756075,0.07397048],"study_design_scores_gemma":[0.000004631949,0.00004472595,0.00013596585,0.0000039258953,0.000006666929,0.000032943364,0.00001440481,0.9928455,0.0013955943,0.005263958,0.0002474591,0.0000042297715],"about_ca_topic_score_codex":0.00050718436,"about_ca_topic_score_gemma":0.00069592154,"teacher_disagreement_score":0.00083026657,"about_ca_system_score_codex":0.0005019605,"about_ca_system_score_gemma":0.0003725681,"threshold_uncertainty_score":0.0036420226},"labels":[],"label_agreement":null},{"id":"W2753098368","doi":"10.1109/tcomm.2017.2749398","title":"Efficient Access Control for Broadband Power Line Communications in Home Area Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preamble; Computer science; Computer network; Broadband; Power-line communication; Media access control; Random access; Access control; Power (physics); Transmission (telecommunications); Broadband networks; Telecommunications; Channel (broadcasting); Wireless","score_opus":0.05208247449884817,"score_gpt":0.3171129007563936,"score_spread":0.2650304262575454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753098368","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.036038965,0.0006190058,0.96002287,0.00014313057,0.000025544865,0.000027230799,0.000022723842,0.00027638543,0.0028241593],"genre_scores_gemma":[0.9518297,0.00051780505,0.045639377,0.00005690467,0.00005058031,0.000046416964,0.000033678814,0.000029719833,0.0017958643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.0001678104,0.000016465703,0.000060934814,0.00016504669,0.00006476081],"domain_scores_gemma":[0.99950814,0.00026347645,0.00007970566,0.000048577498,0.000084918844,0.000015133491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213597,0.00035854755,0.00031353516,0.00030075051,0.00033082793,0.00060731836,0.000514376,0.00028485857,0.0012397475],"category_scores_gemma":[0.001940796,0.00012303083,0.000114393675,0.00042796563,0.00043162596,0.0008051885,0.0005507625,0.00037189136,0.00020285713],"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.00013472204,0.00012379141,0.0009842184,0.000196851,0.000039311857,0.00016476923,0.00015690978,0.71360976,0.032007623,0.070416726,0.0023094486,0.17985588],"study_design_scores_gemma":[0.000012189832,0.000066320965,0.00019939913,0.000008251601,0.000009975159,0.00006248039,0.00003126313,0.98561686,0.0032232113,0.0089688385,0.001794137,0.0000069979087],"about_ca_topic_score_codex":0.0010500632,"about_ca_topic_score_gemma":0.0012900352,"teacher_disagreement_score":0.0012397475,"about_ca_system_score_codex":0.00042810725,"about_ca_system_score_gemma":0.0004130772,"threshold_uncertainty_score":0.004147351},"labels":[],"label_agreement":null},{"id":"W2755368128","doi":"10.1109/tcomm.2017.2753773","title":"Impact of Residual Additive Transceiver Hardware Impairments on Rayleigh-Product MIMO Channels With Linear Receivers: Exact and Asymptotic Analyses","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Horizon 2020 Framework Programme; South African National Space Agency; Imperial College London","keywords":"Transceiver; Residual; Ergodic theory; Channel (broadcasting); MIMO; Computer science; Signal-to-noise ratio (imaging); Mathematics; Control theory (sociology); Electronic engineering; Algorithm; Telecommunications; Engineering; Wireless","score_opus":0.05009689214093845,"score_gpt":0.3309077766235376,"score_spread":0.28081088448259917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755368128","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.19764765,0.0028447448,0.77633286,0.00034328585,0.000069919835,0.00007521942,0.00028055918,0.0006017321,0.021803964],"genre_scores_gemma":[0.97103095,0.0016836259,0.024723556,0.00009119223,0.000083079554,0.00005107553,0.00011585641,0.00008164307,0.0021391024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978377,0.0005234756,0.00006676012,0.0001432576,0.0010644727,0.00036438898],"domain_scores_gemma":[0.99113476,0.006164106,0.00087126024,0.00076842634,0.0009491486,0.000112261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023362192,0.0013774079,0.0011134843,0.000924272,0.0004474679,0.001160267,0.00097587286,0.0010644833,0.0020459925],"category_scores_gemma":[0.014389598,0.00052890246,0.00064003875,0.0011042709,0.002911485,0.002415011,0.0015843487,0.001149173,0.00049408677],"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.00007876814,0.000040093862,0.0009866755,0.00015322788,0.000036864123,0.00026266515,0.00010594107,0.9565596,0.0035104346,0.03007643,0.0003766375,0.007812576],"study_design_scores_gemma":[0.000005177456,0.00005022929,0.00049021275,0.00003238667,0.000024200348,0.0002221415,0.00005866085,0.98775536,0.003035343,0.008068154,0.0002380414,0.000020136285],"about_ca_topic_score_codex":0.0030298035,"about_ca_topic_score_gemma":0.0032097767,"teacher_disagreement_score":0.0030298035,"about_ca_system_score_codex":0.0011571782,"about_ca_system_score_gemma":0.0012729148,"threshold_uncertainty_score":0.012355268},"labels":[],"label_agreement":null},{"id":"W2760934367","doi":"10.1109/tcomm.2017.2762671","title":"Triangular Constellations for Adaptive Modulation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Quadrature amplitude modulation; Additive white Gaussian noise; Constellation diagram; Rayleigh fading; Link adaptation; Delta modulation; Modulation (music); Pulse-amplitude modulation; Mathematics; Phase-shift keying; Algorithm; Bit error rate; Spectral efficiency; Electronic engineering; Topology (electrical circuits); Computer science; Fading; White noise; Telecommunications; Physics; Statistics; Decoding methods; Acoustics; Channel (broadcasting); Engineering; Combinatorics","score_opus":0.070179575828978,"score_gpt":0.3184287914922459,"score_spread":0.2482492156632679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760934367","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.008828773,0.0022574903,0.97473663,0.00027937975,0.0002707082,0.00006006764,0.00009451795,0.00033606333,0.013136405],"genre_scores_gemma":[0.5060053,0.004756413,0.4776027,0.0006735787,0.0005344065,0.00025426707,0.00039703224,0.00016725001,0.009609132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952173,0.00015524076,0.000029311483,0.00008220476,0.00016572261,0.000045727797],"domain_scores_gemma":[0.99917597,0.0003446918,0.00010499681,0.00017558706,0.00016696891,0.00003164453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039159972,0.00044832585,0.0004093647,0.0006504972,0.00038217148,0.00078720145,0.0005610759,0.0005735671,0.005672476],"category_scores_gemma":[0.0030033262,0.00014790008,0.0002886857,0.0015753778,0.000848897,0.0010871026,0.00072330737,0.0011988773,0.001569877],"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.00025931987,0.000041492956,0.00046755365,0.0003940844,0.000028193166,0.00035581278,0.00026871686,0.04867029,0.0415674,0.5723294,0.008834808,0.3267829],"study_design_scores_gemma":[0.00005188279,0.00038309643,0.00049292715,0.00016664296,0.000028304361,0.0016033532,0.00013325817,0.50897354,0.024263062,0.34763896,0.11619275,0.00007221646],"about_ca_topic_score_codex":0.00033498392,"about_ca_topic_score_gemma":0.0002901849,"teacher_disagreement_score":0.005672476,"about_ca_system_score_codex":0.0003647853,"about_ca_system_score_gemma":0.00029169137,"threshold_uncertainty_score":0.01897633},"labels":[],"label_agreement":null},{"id":"W2762855506","doi":"10.1109/tcomm.2017.2761867","title":"Joint Relay Beamforming and Receiver Processing for Multi-Way Multi-Antenna Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Relay; Beamforming; Computer science; Relay channel; Signal-to-noise ratio (imaging); Optimization problem; Channel state information; Channel (broadcasting); Interference (communication); Convex optimization; Electronic engineering; Power (physics); Algorithm; Telecommunications; Wireless; Mathematics; Engineering; Regular polygon","score_opus":0.16765956673449453,"score_gpt":0.35076821495119004,"score_spread":0.1831086482166955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762855506","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.005822405,0.00035000223,0.9924845,0.00006746032,0.000011745686,0.0000152021075,0.000017802444,0.00009140552,0.0011394782],"genre_scores_gemma":[0.6029835,0.0015751227,0.39100483,0.00010000575,0.00007471743,0.00015250294,0.00010417883,0.000050467508,0.0039547235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992975,0.00035030843,0.0000275011,0.00010115647,0.0001639536,0.000059548882],"domain_scores_gemma":[0.9995154,0.00028448892,0.000059349808,0.00004546031,0.00008158933,0.0000137292445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078873965,0.0009370758,0.0007296921,0.00023331531,0.00026943214,0.00066250766,0.0006367059,0.0009828489,0.0014277766],"category_scores_gemma":[0.0013067363,0.00035563775,0.0006037672,0.00048226418,0.0005392056,0.00095761043,0.00051725865,0.00060865574,0.0005406546],"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.00008911968,0.000033234708,0.00038590183,0.0001473417,0.00004772094,0.0002144887,0.000082233324,0.91772926,0.014914693,0.019432593,0.0006285243,0.046294942],"study_design_scores_gemma":[0.000010653505,0.00007269541,0.00009055713,0.0000053200692,0.000015252965,0.000061455146,0.000011244085,0.9910356,0.0031984563,0.004637436,0.0008510727,0.00001025342],"about_ca_topic_score_codex":0.00084110454,"about_ca_topic_score_gemma":0.0012218805,"teacher_disagreement_score":0.0014277766,"about_ca_system_score_codex":0.0004623234,"about_ca_system_score_gemma":0.00044340352,"threshold_uncertainty_score":0.0047763586},"labels":[],"label_agreement":null},{"id":"W2766032087","doi":"10.1109/tcomm.2017.2768516","title":"Security Optimization of Exposure Region-Based Beamforming With a Uniform Circular Array","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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":"Queen's University; Queen's University Belfast; Rice University","keywords":"Beamforming; Computer science; Wireless; Context (archaeology); Information leakage; Metric (unit); Algorithm; Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Computer network; Telecommunications; Combinatorics","score_opus":0.02513715767388952,"score_gpt":0.2514067566561165,"score_spread":0.22626959898222698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766032087","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.017841958,0.00019944213,0.977724,0.000102204394,0.000013960674,0.000017186043,0.000019922492,0.00009759602,0.003983722],"genre_scores_gemma":[0.77341634,0.000684166,0.22226372,0.00014330377,0.00004518246,0.000092935625,0.000058696827,0.0000611061,0.0032344817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992918,0.00032516077,0.000026637546,0.00013110311,0.00013644973,0.00008882019],"domain_scores_gemma":[0.9990441,0.000540297,0.00015297219,0.000091829585,0.0001265491,0.00004427273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260073,0.0007916341,0.0005571067,0.00028066445,0.00024032233,0.00064056116,0.000427249,0.000571627,0.0015965893],"category_scores_gemma":[0.002148391,0.0003434172,0.0004333371,0.0005197429,0.0008448456,0.0010429476,0.0011275627,0.00051747414,0.0005303341],"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.00031680285,0.00004672922,0.0010147111,0.00014667693,0.000071783645,0.00020864,0.00012577583,0.8237073,0.05887494,0.05338641,0.00090835715,0.061191913],"study_design_scores_gemma":[0.00002168829,0.0002205974,0.00036662837,0.000017838805,0.00002803597,0.00018678502,0.0000431575,0.97609484,0.013113787,0.008562154,0.001316478,0.000028010152],"about_ca_topic_score_codex":0.0003342996,"about_ca_topic_score_gemma":0.00026248622,"teacher_disagreement_score":0.0015965893,"about_ca_system_score_codex":0.0004232331,"about_ca_system_score_gemma":0.0004032443,"threshold_uncertainty_score":0.005341172},"labels":[],"label_agreement":null},{"id":"W2767012393","doi":"10.1109/tcomm.2017.2765637","title":"Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Jamming; Artificial noise; Computer science; Quality of service; Transmission (telecommunications); Transmitter power output; Secure transmission; Precoding; Covariance; Mathematical optimization; Optimization problem; Signal-to-noise ratio (imaging); Secrecy; Computer network; Channel (broadcasting); MIMO; Transmitter; Telecommunications; Mathematics; Algorithm; Computer security","score_opus":0.03821635600304873,"score_gpt":0.27179020867265397,"score_spread":0.23357385266960523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767012393","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.008828077,0.00021087904,0.9886541,0.00015801717,0.000020820018,0.0000241042,0.000023060173,0.00009204745,0.0019888117],"genre_scores_gemma":[0.79595095,0.00079204614,0.20021492,0.00020220681,0.00008547176,0.00020841314,0.00007271695,0.000057677862,0.0024155758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986438,0.000519447,0.00006680055,0.0001807148,0.00041902845,0.00017020515],"domain_scores_gemma":[0.9983991,0.0008552893,0.00032108635,0.00012982405,0.0002373789,0.000057375557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00150233,0.0021813596,0.0008947149,0.0005672676,0.00044209248,0.0009414671,0.0006532678,0.0009968798,0.001356084],"category_scores_gemma":[0.003620273,0.00053457974,0.00065454154,0.00085940113,0.0011764477,0.0014754708,0.0010230688,0.0009597112,0.00061233423],"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.0002834294,0.00006323151,0.00044547202,0.00019944906,0.00006710642,0.00015068449,0.00014105113,0.8654685,0.024543103,0.06998007,0.00088442204,0.037773456],"study_design_scores_gemma":[0.000023890614,0.00015074154,0.00009993851,0.000017809109,0.00001926796,0.000069195616,0.0000320846,0.98347753,0.005277254,0.010197272,0.000610895,0.000024150708],"about_ca_topic_score_codex":0.00066771364,"about_ca_topic_score_gemma":0.0006866529,"teacher_disagreement_score":0.0021813596,"about_ca_system_score_codex":0.00070925866,"about_ca_system_score_gemma":0.00081002567,"threshold_uncertainty_score":0.00794518},"labels":[],"label_agreement":null},{"id":"W2769390761","doi":"10.1109/tcomm.2017.2776114","title":"Cooperative Secure Communication in Two-Hop Buffer-Aided Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Buffer (optical fiber); Hop (telecommunications); Spread spectrum; Telecommunications; Code division multiple access","score_opus":0.030481619510830667,"score_gpt":0.31254329822400323,"score_spread":0.28206167871317256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769390761","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.07945147,0.0005498465,0.91772467,0.00017492136,0.000051116876,0.00005782774,0.000050182043,0.00023121701,0.0017087085],"genre_scores_gemma":[0.96127206,0.0002608516,0.037110183,0.000062076804,0.00001579991,0.00006773759,0.000029595407,0.00000998278,0.0011717303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.00022664733,0.00004309968,0.00012623561,0.00018091266,0.00015582146],"domain_scores_gemma":[0.9985089,0.0008347353,0.0002266015,0.00017768658,0.0001918672,0.000060150596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013782122,0.0009104888,0.0009014008,0.0005662569,0.00062019384,0.0012088496,0.0016349544,0.0007179915,0.00089959294],"category_scores_gemma":[0.0021673443,0.00038401486,0.0004218046,0.0006944679,0.00096616725,0.0017373502,0.0014598249,0.0006286885,0.00018537628],"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.00043455683,0.00014841631,0.000983058,0.0001739817,0.00008544463,0.000348047,0.00040415922,0.8584634,0.026357213,0.072057106,0.00096083566,0.03958392],"study_design_scores_gemma":[0.000018590285,0.00010007769,0.00006112209,0.000006931488,0.000016559728,0.00004755528,0.000019920399,0.99058086,0.003898176,0.0048604743,0.00037431624,0.000015401381],"about_ca_topic_score_codex":0.0012064886,"about_ca_topic_score_gemma":0.0015104014,"teacher_disagreement_score":0.0016349544,"about_ca_system_score_codex":0.00075096777,"about_ca_system_score_gemma":0.0010711674,"threshold_uncertainty_score":0.007288754},"labels":[],"label_agreement":null},{"id":"W2774657019","doi":"10.1109/tcomm.2017.2780833","title":"Robust Fairness Transceiver Design for a Full-Duplex MIMO Multi-Cell System","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":12,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Robustness (evolution); Beamforming; Channel state information; Optimization problem; Precoding; Base station; Maximization; Mathematical optimization; Transceiver; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.11939781567782852,"score_gpt":0.2769340351306583,"score_spread":0.15753621945282975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774657019","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.015837986,0.00020548434,0.9796723,0.00016492528,0.0000340912,0.00004083515,0.00004670873,0.00011302496,0.003884633],"genre_scores_gemma":[0.84970266,0.00034719025,0.14463346,0.00016041235,0.00006452702,0.00017716737,0.000069620204,0.00003588224,0.0048090173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.0002152832,0.000020183857,0.00012056524,0.00021439216,0.000085736785],"domain_scores_gemma":[0.9993855,0.00025668822,0.000097536715,0.00005323105,0.00017190029,0.000035095443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011614686,0.00070034456,0.0006939936,0.00031462446,0.00042498732,0.0012716202,0.000872563,0.0010818616,0.0020211162],"category_scores_gemma":[0.0017882753,0.00033797088,0.0004196779,0.0004066977,0.000709733,0.00067358074,0.00089753134,0.0007015747,0.00049070513],"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.00005716389,0.000034969256,0.0003088869,0.000067540655,0.000027267219,0.00012639198,0.00008104569,0.9583292,0.007453939,0.017324897,0.0006303781,0.015558331],"study_design_scores_gemma":[0.000008877521,0.00003910273,0.000050908468,0.0000036805238,0.000007258722,0.000027287331,0.000009924544,0.9965618,0.00086021423,0.0020760463,0.00034884174,0.0000060059956],"about_ca_topic_score_codex":0.0018507007,"about_ca_topic_score_gemma":0.0017052753,"teacher_disagreement_score":0.0020211162,"about_ca_system_score_codex":0.0009544543,"about_ca_system_score_gemma":0.0012883726,"threshold_uncertainty_score":0.0069250464},"labels":[],"label_agreement":null},{"id":"W2777247283","doi":"10.1109/tcomm.2017.2786665","title":"On the Distribution Function of the Generalized Beckmann Random Variable and Its Applications in Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Nanjing University of Posts and Telecommunications; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cumulative distribution function; Nakagami distribution; Rician fading; Random variable; Probability density function; Closed-form expression; Gaussian; Mathematics; Range (aeronautics); Computer science; Mathematical optimization; Applied mathematics; Algorithm; Mathematical analysis; Statistics; Engineering; Physics","score_opus":0.05474097748380429,"score_gpt":0.2795210171380336,"score_spread":0.22478003965422932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777247283","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.012733364,0.0015342649,0.9823727,0.00023530948,0.000051534895,0.000018052395,0.000060919458,0.00013246677,0.0028614134],"genre_scores_gemma":[0.7748316,0.015103762,0.20298766,0.00035482505,0.0004628149,0.00020032268,0.00048657972,0.0001507693,0.0054217065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994673,0.00021290855,0.00002299794,0.0000735934,0.00015391814,0.00006920927],"domain_scores_gemma":[0.9969073,0.0022247122,0.00020299468,0.00022249065,0.00037850958,0.00006402611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017928684,0.000999197,0.0005813914,0.001376277,0.00046985399,0.0012666091,0.0005940064,0.00069950183,0.0018451745],"category_scores_gemma":[0.0077156057,0.00033357154,0.00066301617,0.0022092569,0.001687284,0.0025754108,0.00084001647,0.0015891758,0.00055940746],"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.00006917768,0.000035990262,0.0022478981,0.00016163687,0.00004197604,0.00024816827,0.00013604388,0.45365262,0.0043393965,0.48697388,0.0028167975,0.049276553],"study_design_scores_gemma":[0.0000065897943,0.000019817433,0.00056683813,0.000035305355,0.000011270783,0.00012767727,0.000034278248,0.91335994,0.0013187353,0.08261867,0.0018653857,0.000035461188],"about_ca_topic_score_codex":0.004045024,"about_ca_topic_score_gemma":0.0017862178,"teacher_disagreement_score":0.004045024,"about_ca_system_score_codex":0.0011130102,"about_ca_system_score_gemma":0.0010733273,"threshold_uncertainty_score":0.0094816685},"labels":[],"label_agreement":null},{"id":"W2777541168","doi":"10.1109/tcomm.2017.2785765","title":"Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Repeated game; Nash equilibrium; Distributed algorithm; Mathematical optimization; Stackelberg competition; Game theory; Power control; Non-cooperative game; Duplex (building); Private information retrieval; Power (physics); Mathematical economics; Distributed computing; Mathematics; Computer security","score_opus":0.04956796327051696,"score_gpt":0.2771206207554552,"score_spread":0.22755265748493822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777541168","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.10701381,0.0000798474,0.8905474,0.00025638432,0.000018891391,0.00006528232,0.000021976135,0.00009527808,0.0019011544],"genre_scores_gemma":[0.9801865,0.00004637687,0.018643754,0.000041934745,0.000011024025,0.000058420686,0.00001077115,0.000009838252,0.0009913901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00050407014,0.000052280528,0.00027425893,0.00026852527,0.00019015488],"domain_scores_gemma":[0.9961902,0.0023211634,0.0005832627,0.00038424318,0.00035380028,0.00016740034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015814638,0.00059876806,0.00087413576,0.0002829541,0.00044841607,0.0012103232,0.001541336,0.0011419996,0.0007552092],"category_scores_gemma":[0.004841778,0.00033824198,0.000515127,0.00038725437,0.0019002733,0.0014945072,0.0012128922,0.0010561032,0.000108361484],"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.00014578248,0.00008564203,0.000977638,0.000047897505,0.00005939712,0.00031613046,0.00017417905,0.9452664,0.0064472505,0.033934552,0.00034852224,0.012196596],"study_design_scores_gemma":[0.000011169489,0.000027748052,0.00006797804,0.0000014928315,0.0000044526973,0.000019231498,0.000010816831,0.99399006,0.00047594105,0.0053079976,0.000078506084,0.0000046950854],"about_ca_topic_score_codex":0.002877947,"about_ca_topic_score_gemma":0.0016368398,"teacher_disagreement_score":0.002877947,"about_ca_system_score_codex":0.0010338273,"about_ca_system_score_gemma":0.00091131206,"threshold_uncertainty_score":0.008363664},"labels":[],"label_agreement":null},{"id":"W2778278155","doi":"10.1109/tcomm.2017.2787568","title":"Joint Optimal Mode Switching and Power Adaptation for Nonlinear Energy Harvesting SWIPT System Over Fading Channel","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Maximum power transfer theorem; Fading; Transmitter; Energy harvesting; Channel (broadcasting); Nonlinear system; Computer science; Electronic engineering; Transmitter power output; Power (physics); Control theory (sociology); Wireless; Energy (signal processing); Decoding methods; Engineering; Telecommunications; Mathematics; Physics","score_opus":0.04078802545739735,"score_gpt":0.2628997440097425,"score_spread":0.22211171855234513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778278155","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.056178495,0.00059939176,0.93824446,0.0002719245,0.000042959517,0.000048852187,0.00005021657,0.0001173874,0.0044463314],"genre_scores_gemma":[0.95771235,0.0005606452,0.038434993,0.00008872641,0.00004156477,0.00007137749,0.000037727175,0.000028127914,0.0030245867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.00009913558,0.000017620916,0.00011124512,0.000067016525,0.00007050054],"domain_scores_gemma":[0.9995778,0.00024303024,0.00006814226,0.000033288714,0.000060444094,0.000017292257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055166986,0.00088280067,0.000901375,0.00019384666,0.00034506564,0.0008874375,0.0006750099,0.000688279,0.0011846353],"category_scores_gemma":[0.0011109419,0.0003650848,0.00042947778,0.00046187855,0.00083864166,0.0010254347,0.00063548493,0.0007500273,0.0002031963],"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.00024138659,0.00009859991,0.0010828313,0.00033677122,0.000097675795,0.00043509217,0.00029883336,0.85704005,0.040848773,0.030931408,0.0014549086,0.0671336],"study_design_scores_gemma":[0.000012292344,0.00004969994,0.0001482851,0.000006519108,0.0000146123675,0.000060501057,0.00002889507,0.99127215,0.0021890907,0.005891644,0.00031471447,0.000011657341],"about_ca_topic_score_codex":0.0015476275,"about_ca_topic_score_gemma":0.0015320932,"teacher_disagreement_score":0.0015476275,"about_ca_system_score_codex":0.00058398885,"about_ca_system_score_gemma":0.0005807763,"threshold_uncertainty_score":0.004237175},"labels":[],"label_agreement":null},{"id":"W2780395788","doi":"10.1109/tcomm.2017.2788012","title":"On Base Station Coordination in Cache- and Energy Harvesting-Enabled HetNets: A Stochastic Geometry Study","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":28,"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; National Natural Science Foundation of China","keywords":"Macrocell; Stochastic geometry; Base station; Computer science; Cache; Coverage probability; Heterogeneous network; Transmission (telecommunications); Interference (communication); Cellular network; Computer network; Energy harvesting; Wireless network; Wireless; Energy (signal processing); Channel (broadcasting); Telecommunications; Mathematics; Statistics","score_opus":0.02547354959278848,"score_gpt":0.2719022820426341,"score_spread":0.24642873244984564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780395788","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.21261081,0.004066324,0.75963366,0.0018080978,0.00027054086,0.00020608846,0.0005110808,0.0003381806,0.020555228],"genre_scores_gemma":[0.9789043,0.0025333443,0.014693523,0.00021599644,0.00015437555,0.00010192085,0.00017578498,0.000089299974,0.0031314075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981504,0.0008342932,0.000047589365,0.00024509866,0.00028656982,0.00043609965],"domain_scores_gemma":[0.9911221,0.0058769286,0.0013764519,0.00032854252,0.0008776052,0.00041831066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026277644,0.0021398875,0.0019412709,0.0015898668,0.0010303898,0.0017367037,0.001784806,0.0016241518,0.0019988175],"category_scores_gemma":[0.008870957,0.0009401181,0.0014471118,0.001414851,0.0026016035,0.0023259602,0.0022404192,0.0010964897,0.00046512796],"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.000055132627,0.000024007919,0.0010505891,0.000044561835,0.000047657286,0.00022702046,0.000068187044,0.9657328,0.0013055842,0.029298197,0.00066241855,0.001483985],"study_design_scores_gemma":[0.000008650076,0.000058168673,0.00043656555,0.00000898975,0.000021686994,0.000077763194,0.00004939287,0.9934994,0.00029441013,0.0052391216,0.00029050573,0.000015356867],"about_ca_topic_score_codex":0.0100617595,"about_ca_topic_score_gemma":0.0049346383,"teacher_disagreement_score":0.0100617595,"about_ca_system_score_codex":0.002611804,"about_ca_system_score_gemma":0.0012108145,"threshold_uncertainty_score":0.020006418},"labels":[],"label_agreement":null},{"id":"W2782666205","doi":"10.1109/tcomm.2017.2789211","title":"Stair Matrix and Its Applications to Massive MIMO Uplink Data Detection","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"MIMO; Telecommunications link; Diagonal; Computer science; Algorithm; Matrix (chemical analysis); Computational complexity theory; Base station; Convergence (economics); Iterative method; Channel (broadcasting); Performance improvement; Transmission (telecommunications); Data transmission; Diagonal matrix; Mathematical optimization; Computer engineering; Mathematics; Telecommunications; Engineering; Computer network","score_opus":0.04023690209758715,"score_gpt":0.311482366768363,"score_spread":0.2712454646707758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782666205","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.01020278,0.00040484974,0.98625284,0.0001515785,0.00004219991,0.000031526404,0.000022018592,0.00012093377,0.0027714255],"genre_scores_gemma":[0.6182293,0.001596217,0.3745163,0.00025448736,0.00012905947,0.00012869664,0.00007295964,0.00004257375,0.0050303806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00022424667,0.000022304002,0.00008810272,0.00022245871,0.000054421987],"domain_scores_gemma":[0.9984059,0.00088621496,0.0001711099,0.00019255182,0.00028345935,0.000060762424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007504223,0.00072651485,0.00040512302,0.000603278,0.00046462208,0.00074752874,0.0006355812,0.0006658134,0.0015321384],"category_scores_gemma":[0.0031478012,0.0002483042,0.0003597356,0.0009324561,0.0009650389,0.0010335137,0.0008043952,0.0007991304,0.0004425588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003398301,0.00015515859,0.001574336,0.00042576485,0.00007950706,0.0005397019,0.0003634999,0.39968756,0.07481692,0.37730253,0.0025136783,0.14220153],"study_design_scores_gemma":[0.000010336582,0.00015911202,0.00017428202,0.000011930282,0.0000086072,0.00024757456,0.000034797744,0.9638327,0.0115829,0.021703152,0.002207593,0.000026971054],"about_ca_topic_score_codex":0.00081033295,"about_ca_topic_score_gemma":0.00090227893,"teacher_disagreement_score":0.0015321384,"about_ca_system_score_codex":0.00042854412,"about_ca_system_score_gemma":0.00064238947,"threshold_uncertainty_score":0.0051255226},"labels":[],"label_agreement":null},{"id":"W2784065132","doi":"10.1109/tcomm.2017.2789221","title":"Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Entropy (arrow of time); Algorithm; Cross-entropy method; Gaussian; Mathematical optimization; Combinatorics; Optimization problem; Discrete mathematics; Statistics; Quadratic assignment problem","score_opus":0.05727282685408157,"score_gpt":0.3120925061258664,"score_spread":0.25481967927178484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784065132","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.0029822977,0.000074340496,0.99602675,0.00004277566,0.000008136447,0.00002117999,0.000017000335,0.000106248954,0.00072123273],"genre_scores_gemma":[0.21756744,0.00031308553,0.77923435,0.00008803176,0.000026333046,0.00014835066,0.00012424428,0.00007163562,0.0024265111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964535,0.000067986526,0.000022706881,0.000086703694,0.00014430309,0.00003289489],"domain_scores_gemma":[0.99956995,0.00019800129,0.000064151776,0.00003165961,0.00011884751,0.000017459035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537598,0.0007482867,0.0006021311,0.00043415802,0.00035864,0.00078045303,0.00073559245,0.00059589616,0.0030007944],"category_scores_gemma":[0.0018041279,0.0003978357,0.0003365215,0.00043373276,0.0005171031,0.0010759532,0.0010047078,0.0007717947,0.00062159484],"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.00036252246,0.000048157064,0.00075332914,0.00026255968,0.000051667306,0.000110592846,0.00023633787,0.4519984,0.05473287,0.058735605,0.0030032594,0.42970464],"study_design_scores_gemma":[0.000044595115,0.00006958915,0.00011371071,0.000014107106,0.000013816464,0.00006441544,0.000027632332,0.9770931,0.011739627,0.008451951,0.0023501555,0.000017172022],"about_ca_topic_score_codex":0.0014279092,"about_ca_topic_score_gemma":0.0017566944,"teacher_disagreement_score":0.0030007944,"about_ca_system_score_codex":0.000621169,"about_ca_system_score_gemma":0.0011369609,"threshold_uncertainty_score":0.010038674},"labels":[],"label_agreement":null},{"id":"W2786400303","doi":"10.1109/tcomm.2018.2801789","title":"Efficient LTE/Wi-Fi Coexistence in Unlicensed Spectrum Using Virtual Network Entity: Optimization and Performance Analysis","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Spectrum management; Computer science; Computer network; Scheduling (production processes); Throughput; Time division multiple access; Optimization problem; Admission control; Duty cycle; Quality of service; Wireless; Cognitive radio; Mathematical optimization; Algorithm; Engineering; Telecommunications; Mathematics","score_opus":0.03563410528360565,"score_gpt":0.2854527882261712,"score_spread":0.24981868294256554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786400303","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.1524025,0.0008949094,0.8354248,0.00028981228,0.000028100649,0.00006435941,0.000052584553,0.00013520739,0.010707747],"genre_scores_gemma":[0.96382105,0.00038530448,0.034260627,0.00002755353,0.000017040378,0.000052422827,0.00003494225,0.000023181254,0.0013779243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995759,0.00016546203,0.000009149221,0.00003940065,0.00011052883,0.0000994502],"domain_scores_gemma":[0.99931514,0.00044308865,0.00008636728,0.000027192591,0.000094528725,0.00003364886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010381602,0.00071068393,0.00066068734,0.000391169,0.00035664494,0.0011076634,0.0006199568,0.0007734207,0.0011056035],"category_scores_gemma":[0.0017562372,0.000297161,0.00040000433,0.00065004133,0.00078085065,0.00079252623,0.00071207975,0.00052558485,0.00013310234],"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.00003516116,0.000028196959,0.00027758654,0.000023410144,0.0000108824515,0.000025141348,0.000014568761,0.98711294,0.0013299678,0.0062567983,0.00017289673,0.0047124033],"study_design_scores_gemma":[8.7311065e-7,0.000008697553,0.00003536667,6.564372e-7,0.000001738484,0.0000028967454,0.0000032882733,0.999426,0.00015071247,0.0003349396,0.000033625358,0.0000011192429],"about_ca_topic_score_codex":0.0042244224,"about_ca_topic_score_gemma":0.0028174464,"teacher_disagreement_score":0.0042244224,"about_ca_system_score_codex":0.0012391873,"about_ca_system_score_gemma":0.0010772239,"threshold_uncertainty_score":0.008990943},"labels":[],"label_agreement":null},{"id":"W2788407677","doi":"10.1109/tcomm.2018.2858263","title":"Cost-Efficient QoS-Aware Data Acquisition Point Placement for Advanced Metering Infrastructure","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":13,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metering mode; Computer science; Quality of service; Point (geometry); Data quality; Computer security; Computer network; Business; Engineering; Service (business)","score_opus":0.05600881956924331,"score_gpt":0.3166498761207665,"score_spread":0.2606410565515232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788407677","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.08588922,0.00027326256,0.9098999,0.0002816587,0.000039720337,0.000095857875,0.00010198016,0.00066918146,0.002749342],"genre_scores_gemma":[0.75251025,0.00013036489,0.24610466,0.000025442996,0.000015273305,0.00005237899,0.00012124501,0.000047824466,0.0009926349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.0001044664,0.000013582959,0.000047638194,0.000078825746,0.000056803787],"domain_scores_gemma":[0.9993475,0.00032895835,0.000095198186,0.00006832794,0.00010538273,0.000054570577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503612,0.00073353585,0.00059029396,0.0006414714,0.00048312644,0.00056584546,0.0006893697,0.0005140873,0.0015558285],"category_scores_gemma":[0.0018941369,0.00034494427,0.00025290935,0.00082942523,0.00034223244,0.00067578716,0.0006488795,0.00041422847,0.0003136254],"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.00011113613,0.00004552838,0.00083467516,0.000063242274,0.000011006632,0.00009039794,0.000058752306,0.9318463,0.0066351406,0.0044628973,0.001323452,0.054517493],"study_design_scores_gemma":[0.0000131081,0.000040262283,0.00018593775,0.0000025212978,0.000004033251,0.000034284338,0.000038012902,0.99572796,0.0015457221,0.0019248239,0.0004784818,0.0000048607167],"about_ca_topic_score_codex":0.0037611267,"about_ca_topic_score_gemma":0.0051500006,"teacher_disagreement_score":0.0037611267,"about_ca_system_score_codex":0.00083956914,"about_ca_system_score_gemma":0.0009951679,"threshold_uncertainty_score":0.007478416},"labels":[],"label_agreement":null},{"id":"W2790037810","doi":"10.1109/tcomm.2018.2816070","title":"Index Mapping for Bit-Error Resilient Multiple Description Lattice Vector Quantizer","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"","keywords":"Voronoi diagram; Algorithm; Decoding methods; Binary number; Coset; Hamming distance; Computer science; Lattice (music); Error detection and correction; Hamming bound; Mathematics; Binary erasure channel; Topology (electrical circuits); Channel (broadcasting); Theoretical computer science; Discrete mathematics; Hamming code; Block code; Combinatorics; Channel capacity; Arithmetic; Geometry; Telecommunications","score_opus":0.10861044294155325,"score_gpt":0.3431401829890115,"score_spread":0.23452974004745825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790037810","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.026670072,0.0004946083,0.97028154,0.00021438536,0.000053631775,0.000054499265,0.00009927719,0.00046741142,0.0016646037],"genre_scores_gemma":[0.6627103,0.00041169475,0.3330038,0.00021791583,0.000045525732,0.00014041032,0.00025456442,0.00006469326,0.0031510193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00016984364,0.000058665162,0.00011785566,0.00038314186,0.00008132161],"domain_scores_gemma":[0.9987987,0.0005038869,0.00015737931,0.00026160374,0.00022898467,0.000049359922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719836,0.00049745856,0.0005610941,0.0004175788,0.00037216625,0.0007440846,0.0011929492,0.000549956,0.001722724],"category_scores_gemma":[0.0037519045,0.00023058892,0.00021104136,0.00067053677,0.0005915967,0.0016813386,0.0012465133,0.0008306761,0.00046784396],"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.0005484554,0.00013216818,0.0012312963,0.00031956847,0.000039790193,0.00036958233,0.00027200507,0.45514613,0.05344083,0.15145598,0.003599482,0.33344468],"study_design_scores_gemma":[0.000022866994,0.00010070809,0.000092867995,0.000015387675,0.0000068809277,0.00011715871,0.000020171432,0.96249247,0.018492717,0.016531719,0.0020897482,0.000017364864],"about_ca_topic_score_codex":0.001331038,"about_ca_topic_score_gemma":0.0013974813,"teacher_disagreement_score":0.001722724,"about_ca_system_score_codex":0.00075237924,"about_ca_system_score_gemma":0.0009842957,"threshold_uncertainty_score":0.005763054},"labels":[],"label_agreement":null},{"id":"W2792934834","doi":"10.1109/tcomm.2018.2799217","title":"Wireless Power Transfer in mmWave Massive MIMO Systems With/Without Rain Attenuation","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; MIMO; Fading; Channel (broadcasting); Wireless; Path loss; RADIUS; Attenuation; Energy (signal processing); Computer science; Electronic engineering; Topology (electrical circuits); Electrical engineering; Physics; Telecommunications; Computer network; Mathematics; Engineering; Statistics","score_opus":0.020394160950649883,"score_gpt":0.24066975886303424,"score_spread":0.22027559791238435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792934834","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.4819737,0.0013107598,0.5056494,0.0002368691,0.00008464108,0.000044545537,0.00012095864,0.00037408705,0.010204978],"genre_scores_gemma":[0.9945305,0.0004045238,0.0039406186,0.00003845645,0.000025420633,0.000015197951,0.00003130942,0.000011003697,0.0010030945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956745,0.00009315374,0.0000144659525,0.000065409775,0.00014368861,0.00011588318],"domain_scores_gemma":[0.99881494,0.00077950145,0.00014167913,0.000078877834,0.00015264,0.00003240565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470834,0.00059333566,0.0005600754,0.00022794613,0.00029813065,0.0006027995,0.0003510875,0.00052483816,0.0009641879],"category_scores_gemma":[0.0024546622,0.00019069585,0.00026801124,0.0004276657,0.00059830054,0.0011664262,0.00062094675,0.00042176544,0.0002954015],"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.00033549394,0.00006698408,0.0026424113,0.00020587894,0.00008201428,0.0005285279,0.00017229657,0.9263388,0.023323357,0.0075844848,0.0004955258,0.038224287],"study_design_scores_gemma":[0.000010891946,0.00021162012,0.0015415283,0.00001156557,0.000028326855,0.00021973219,0.00006646335,0.9871547,0.008142748,0.0022282668,0.0003712944,0.000012848973],"about_ca_topic_score_codex":0.00081304845,"about_ca_topic_score_gemma":0.0004951948,"teacher_disagreement_score":0.0009641879,"about_ca_system_score_codex":0.00033124138,"about_ca_system_score_gemma":0.00018605255,"threshold_uncertainty_score":0.003225565},"labels":[],"label_agreement":null},{"id":"W2796862611","doi":"10.1109/tcomm.2018.2854613","title":"Unified Analysis and Optimization of D2D Communications in Cellular Networks Over Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":25,"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":"Fading; Cellular network; Telecommunications link; Computer science; Stochastic geometry; Power control; Spectral efficiency; Transmitter power output; Cellular communication; Interference (communication); Electronic engineering; Signal-to-noise ratio (imaging); Computer network; Telecommunications; Power (physics); Base station; Engineering; Transmitter; Mathematics; Channel (broadcasting); Statistics","score_opus":0.023220725895469158,"score_gpt":0.2619273742864944,"score_spread":0.2387066483910252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796862611","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.022779804,0.0008684796,0.9696139,0.00033479804,0.000040485018,0.000025456045,0.0001151436,0.000058226415,0.006163707],"genre_scores_gemma":[0.9624553,0.0020657703,0.03142472,0.00013730164,0.00009082445,0.000121548816,0.00011815525,0.00005649635,0.003529906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993486,0.00024331376,0.000021954047,0.00009155645,0.00018124099,0.0001133737],"domain_scores_gemma":[0.9989791,0.0006824077,0.00011786888,0.00005021026,0.0001230212,0.000047352467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088289817,0.0012476661,0.0008818381,0.00078542455,0.0004170879,0.0014455395,0.0007769483,0.0009314123,0.0011162141],"category_scores_gemma":[0.0029081767,0.00045314533,0.0005918172,0.0011993587,0.0011565787,0.0012096951,0.0015381917,0.0007380634,0.00018597167],"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.0000099985045,0.000006393254,0.00020600365,0.000024262526,0.0000107891765,0.00003699202,0.00001562679,0.9769468,0.0005210255,0.018905014,0.000239185,0.0030779769],"study_design_scores_gemma":[0.000001600051,0.000009274141,0.00008376303,0.0000028551235,0.0000039207666,0.000009313262,0.000010077878,0.99409443,0.00012885667,0.0054530343,0.00019949718,0.000003399048],"about_ca_topic_score_codex":0.0055458155,"about_ca_topic_score_gemma":0.0032376877,"teacher_disagreement_score":0.0055458155,"about_ca_system_score_codex":0.0016024787,"about_ca_system_score_gemma":0.0010998647,"threshold_uncertainty_score":0.011626899},"labels":[],"label_agreement":null},{"id":"W2802514696","doi":"10.1109/tcomm.2018.2832207","title":"Decoder Partitioning: Towards Practical List Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":51,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Polar; Algorithm; Concatenated error correction code; Electronic engineering; Theoretical computer science; Parallel computing; Block code; Engineering","score_opus":0.08444422761163856,"score_gpt":0.3729335643544408,"score_spread":0.28848933674280225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802514696","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.011195192,0.00023514987,0.98523384,0.00015159369,0.000032657117,0.00006797804,0.0001054948,0.0006442255,0.0023338613],"genre_scores_gemma":[0.17819676,0.00058969937,0.8168149,0.00031199396,0.00009790566,0.00022352429,0.00060316804,0.00020493733,0.0029570842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.00045221983,0.00009186457,0.0001473251,0.00047104034,0.00016448899],"domain_scores_gemma":[0.99753344,0.0012214442,0.0001624779,0.00043661098,0.0005663686,0.000079704085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083567813,0.001211839,0.00083220954,0.0008631085,0.0005992602,0.0012796072,0.0011118435,0.0008200114,0.0022999658],"category_scores_gemma":[0.005325581,0.0004359357,0.00043279628,0.0010412227,0.00070919615,0.0016185328,0.0023506829,0.0012912651,0.0019831585],"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.0009904149,0.00016599889,0.0010323751,0.00063486455,0.00006969854,0.0006699626,0.0005310399,0.34400153,0.103964396,0.12176079,0.008406311,0.4177726],"study_design_scores_gemma":[0.00009479633,0.00022982746,0.00017537053,0.00006474753,0.00002637291,0.00036098532,0.00010135352,0.89044005,0.048931625,0.05166973,0.007869699,0.00003546823],"about_ca_topic_score_codex":0.0013979306,"about_ca_topic_score_gemma":0.0021800585,"teacher_disagreement_score":0.0022999658,"about_ca_system_score_codex":0.0007020336,"about_ca_system_score_gemma":0.0019705214,"threshold_uncertainty_score":0.007694125},"labels":[],"label_agreement":null},{"id":"W2803003303","doi":"10.1109/tcomm.2018.2827053","title":"Improving the Update Complexity of Locally Repairable Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Direct-sequence spread spectrum; Locality; Distributed data store; Code (set theory); Distributed computing; Spread spectrum; RAID; Parallel computing; Operating system; Computer network; Code division multiple access; Programming language","score_opus":0.06153721891667427,"score_gpt":0.29612880835058936,"score_spread":0.2345915894339151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803003303","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.13656566,0.0011595639,0.8557847,0.00051924976,0.00012058247,0.0001287216,0.00016199687,0.001525286,0.00403422],"genre_scores_gemma":[0.74776524,0.0005731969,0.24680571,0.00018761773,0.000119852826,0.00019364481,0.00027217713,0.0002680535,0.0038145385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978441,0.00043735735,0.00013653653,0.00031158442,0.000993543,0.0002769392],"domain_scores_gemma":[0.97828156,0.014035918,0.0016505909,0.0027689147,0.002825551,0.00043730362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001481554,0.0007736687,0.0009296413,0.0007991018,0.0006720085,0.0011022651,0.0014515975,0.00087895145,0.0017456473],"category_scores_gemma":[0.022701243,0.0003678032,0.00036277418,0.001020826,0.0007777713,0.0022587003,0.0013801897,0.0015452544,0.000548697],"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.00051675766,0.00017441994,0.003238608,0.00024919398,0.000048957114,0.00013929172,0.00028527703,0.70547086,0.029148007,0.02890665,0.0055108257,0.2263111],"study_design_scores_gemma":[0.000025860032,0.00011237961,0.00020986788,0.000011735714,0.0000109880075,0.00009155875,0.00003274559,0.98366773,0.008315402,0.0065290164,0.000978543,0.000014205876],"about_ca_topic_score_codex":0.0029777468,"about_ca_topic_score_gemma":0.0038156845,"teacher_disagreement_score":0.0029777468,"about_ca_system_score_codex":0.0012661972,"about_ca_system_score_gemma":0.0023008161,"threshold_uncertainty_score":0.0091869235},"labels":[],"label_agreement":null},{"id":"W2807209692","doi":"10.1109/tcomm.2019.2906622","title":"UAV-Enabled Communication Using NOMA","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"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":"Institute for Computational Science and Technology; Queen's University; Queen's University Belfast; British Council; Royal Society; Australian Research Council; King Fahd University of Petroleum and Minerals; Royal Academy of Engineering; Newton Fund; National Science Foundation","keywords":"Beamwidth; Computer science; Optimization problem; Base station; Transmitter power output; Dirty paper coding; Convex optimization; Wireless; Mathematical optimization; Bandwidth (computing); Real-time computing; Computer network; Algorithm; Antenna (radio); Telecommunications; Channel (broadcasting); MIMO; Regular polygon; Mathematics; Precoding","score_opus":0.03897177894309839,"score_gpt":0.26767038077322597,"score_spread":0.22869860183012758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807209692","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.08533742,0.0017124832,0.89454824,0.00031229763,0.00023581916,0.00006402901,0.00016918099,0.00050578034,0.017114777],"genre_scores_gemma":[0.9367764,0.0006539162,0.059472755,0.00009750783,0.000063607804,0.000071880895,0.00012701954,0.000021258453,0.0027155022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999559,0.00018344453,0.000018585833,0.000058607402,0.00008838759,0.000091952825],"domain_scores_gemma":[0.999413,0.00028501672,0.000081879196,0.00009351976,0.00009361434,0.00003298355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041058054,0.00075195567,0.0005106783,0.00040275007,0.0005114748,0.00079182995,0.0004915916,0.00044202333,0.0011873754],"category_scores_gemma":[0.0013483737,0.0001810452,0.0003455718,0.0005343581,0.0003740045,0.0008386528,0.0011233285,0.0005865789,0.00034269766],"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.00020273653,0.00006735535,0.0010904275,0.00019082114,0.000077334575,0.00036846442,0.00010050151,0.85916466,0.0108103985,0.02656378,0.003144396,0.098219216],"study_design_scores_gemma":[0.0000114782115,0.0000870111,0.00021451394,0.000013583932,0.000013274981,0.00008125237,0.000026829961,0.99099255,0.0020279803,0.0040561827,0.0024653005,0.000010183505],"about_ca_topic_score_codex":0.0024369159,"about_ca_topic_score_gemma":0.0038025589,"teacher_disagreement_score":0.0024369159,"about_ca_system_score_codex":0.00035165745,"about_ca_system_score_gemma":0.00055859203,"threshold_uncertainty_score":0.0048455},"labels":[],"label_agreement":null},{"id":"W2809074861","doi":"10.1109/tcomm.2018.2848271","title":"Optimum ConvergeCast Scheduling in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Schedule; Real-time computing; Upper and lower bounds; Computer network; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.027679195477960467,"score_gpt":0.26718935985903997,"score_spread":0.2395101643810795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809074861","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.028163197,0.00018769337,0.9691112,0.00009502689,0.000026878,0.00005460485,0.00004697649,0.00021406123,0.0021003557],"genre_scores_gemma":[0.68858546,0.00065074465,0.30697405,0.000079783655,0.00006074635,0.00021387242,0.00019991265,0.00018635471,0.0030490905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.00024770622,0.000027053553,0.000110179666,0.0001906541,0.000100911864],"domain_scores_gemma":[0.9989235,0.0006415557,0.00013599187,0.00011504205,0.000115610776,0.000068314584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012027153,0.0007454743,0.000955899,0.0006523939,0.00047721475,0.00077738485,0.00087344216,0.0007439308,0.00090791116],"category_scores_gemma":[0.0035163488,0.0005818684,0.0005111392,0.00077921007,0.0009291499,0.0012360628,0.00090576406,0.0010804619,0.00021705545],"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.000091687434,0.000038814313,0.00013651201,0.00004915947,0.00001171937,0.000027768532,0.00006319754,0.95780766,0.0024120165,0.020504268,0.0006430173,0.018214185],"study_design_scores_gemma":[0.000013540745,0.0000336517,0.000033551885,0.0000041631833,0.0000030567828,0.000010544749,0.00001273192,0.98743606,0.0009110185,0.011135909,0.00040281386,0.0000029351606],"about_ca_topic_score_codex":0.0021095935,"about_ca_topic_score_gemma":0.0020040064,"teacher_disagreement_score":0.0021095935,"about_ca_system_score_codex":0.00091024075,"about_ca_system_score_gemma":0.0012215751,"threshold_uncertainty_score":0.0066042542},"labels":[],"label_agreement":null},{"id":"W2883352791","doi":"10.1109/tcomm.2018.2855193","title":"Optimizing the MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling?","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spatial multiplexing; Telecommunications link; Beamforming; Computer science; MIMO; Multiplexing; Interference (communication); Base station; Context (archaeology); Cellular network; Stochastic geometry; Antenna diversity; Enhanced Data Rates for GSM Evolution; Electronic engineering; Antenna (radio); Computer network; Engineering; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.04885017103795134,"score_gpt":0.2682494096700022,"score_spread":0.21939923863205088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883352791","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.17413151,0.004214507,0.79721856,0.0027642879,0.00021049888,0.000051566327,0.0002213537,0.00027518268,0.020912535],"genre_scores_gemma":[0.9745593,0.0015097571,0.022158876,0.0003129141,0.00015979163,0.00002028398,0.000038460566,0.000028963885,0.0012116012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952805,0.00021940377,0.000014962,0.000051594863,0.0000796173,0.00010635211],"domain_scores_gemma":[0.9991161,0.00053259684,0.000116535215,0.00006461238,0.00009864029,0.00007157526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730563,0.0007621123,0.0006936626,0.00021390223,0.00020753435,0.00094902545,0.000531708,0.0007261674,0.0010127472],"category_scores_gemma":[0.0030439848,0.0002643994,0.00021115267,0.0004844183,0.00078497967,0.0014391073,0.0006341152,0.00034516532,0.00022914178],"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.0002124192,0.00009312186,0.0031017764,0.00021838701,0.000105984815,0.00020467995,0.00006935954,0.85553414,0.014496622,0.05603859,0.0029666675,0.066958226],"study_design_scores_gemma":[0.000024050818,0.00015709568,0.00083854503,0.000023766015,0.000034913694,0.00015403205,0.00008475897,0.9624018,0.0032564427,0.031776607,0.0012269749,0.000020964557],"about_ca_topic_score_codex":0.0012892288,"about_ca_topic_score_gemma":0.0015257695,"teacher_disagreement_score":0.0012892288,"about_ca_system_score_codex":0.0005770095,"about_ca_system_score_gemma":0.00056410965,"threshold_uncertainty_score":0.0041864514},"labels":[],"label_agreement":null},{"id":"W2883569077","doi":"10.1109/tcomm.2018.2859937","title":"Distributed Massive MIMO Systems With Non-Reciprocal Channels: Impacts and Robust Beamforming","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Telecommunications link; Beamforming; Precoding; MIMO; Computer science; Maximization; Overhead (engineering); Channel (broadcasting); Sensitivity (control systems); Multiplexing; Channel state information; Calibration; Measure (data warehouse); Control theory (sociology); Electronic engineering; Algorithm; Real-time computing; Mathematics; Mathematical optimization; Wireless; Engineering; Statistics; Computer network; Telecommunications","score_opus":0.020988579502902633,"score_gpt":0.2397483013288274,"score_spread":0.21875972182592476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883569077","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.053327397,0.0008030849,0.93985254,0.00029094104,0.000042162996,0.00003748195,0.000057638168,0.00025299753,0.0053358325],"genre_scores_gemma":[0.939606,0.0008419163,0.058179382,0.000118398326,0.00005974543,0.0000497192,0.000044147346,0.000037977414,0.0010627757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983323,0.00059780426,0.000052125328,0.00018510583,0.0006338252,0.0001988437],"domain_scores_gemma":[0.995805,0.0025161388,0.0006688932,0.0005740055,0.00036462076,0.000071160044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447792,0.0013315444,0.0006659558,0.0002846167,0.00031835536,0.0009538493,0.00055920193,0.0010169477,0.0008352144],"category_scores_gemma":[0.0085571855,0.00037949777,0.0004385971,0.0006372152,0.0013365244,0.0016691881,0.0012837315,0.0012001283,0.0002913898],"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.00010680188,0.000037446785,0.0006642183,0.0001346253,0.000037777434,0.00021849152,0.00008510175,0.92941755,0.018703448,0.02592466,0.00042501398,0.024244858],"study_design_scores_gemma":[0.000010669074,0.00013815165,0.00056789484,0.000023880515,0.000022907963,0.00019342729,0.000045066423,0.98137385,0.009855038,0.007187971,0.00055542745,0.000025720032],"about_ca_topic_score_codex":0.00082452735,"about_ca_topic_score_gemma":0.00094557443,"teacher_disagreement_score":0.0017447792,"about_ca_system_score_codex":0.00060208375,"about_ca_system_score_gemma":0.00059103704,"threshold_uncertainty_score":0.009227395},"labels":[],"label_agreement":null},{"id":"W2885059027","doi":"10.1109/tcomm.2018.2864281","title":"Partially Blind Joint Channel Estimation and Symbol Detection in Amplify-and-Forward Two-Way Relay Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"Isfahan University of Technology; Iran National Science Foundation","keywords":"Algorithm; Channel (broadcasting); Relay; Block (permutation group theory); Convergence (economics); Computational complexity theory; Computer science; Detector; Mathematics; Reciprocal; Joint (building); Symbol (formal); Telecommunications; Engineering","score_opus":0.07112185769842491,"score_gpt":0.30747490699559554,"score_spread":0.23635304929717063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885059027","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.09360473,0.0004884479,0.903981,0.00014014113,0.000016995795,0.000031764437,0.00004183464,0.00017162428,0.0015235464],"genre_scores_gemma":[0.9264027,0.0003262657,0.071851075,0.00003673907,0.000024163473,0.000053030548,0.000027364513,0.00001489222,0.001263743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00053949887,0.00003860523,0.00012907964,0.00025742187,0.000091435984],"domain_scores_gemma":[0.9980253,0.0014024293,0.0002029264,0.00012969329,0.00019747597,0.000042126776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929345,0.00057952275,0.0009569606,0.00030268237,0.0002531291,0.0007287546,0.000501057,0.0011180339,0.00046382868],"category_scores_gemma":[0.0040044277,0.00042271477,0.00044612525,0.00042029284,0.000983589,0.0010355484,0.0009332338,0.00054843375,0.00014931468],"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.0001606336,0.00003144242,0.0004519204,0.00008219838,0.000043309636,0.00015906892,0.000116682146,0.95353806,0.009553934,0.021359885,0.00021741937,0.014285483],"study_design_scores_gemma":[0.000007757544,0.000025802266,0.000073303185,0.0000015801944,0.000004798411,0.000026064872,0.000006298196,0.9961366,0.0012967837,0.0023516412,0.00006262753,0.0000066965727],"about_ca_topic_score_codex":0.0020059615,"about_ca_topic_score_gemma":0.0010027121,"teacher_disagreement_score":0.0020059615,"about_ca_system_score_codex":0.00046761055,"about_ca_system_score_gemma":0.00062813686,"threshold_uncertainty_score":0.0068377256},"labels":[],"label_agreement":null},{"id":"W2885421144","doi":"10.1109/tcomm.2018.2885800","title":"Robust Distributed Compression of Symmetrically Correlated Gaussian Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compression (physics); Gaussian; Computer science; Gaussian process; Electronic engineering; Engineering; Physics","score_opus":0.03926466377736963,"score_gpt":0.2615554079986081,"score_spread":0.22229074422123846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885421144","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.0857424,0.00041259997,0.9108758,0.0002363339,0.0000192494,0.000029122997,0.00009871218,0.00012534781,0.0024603775],"genre_scores_gemma":[0.944413,0.0004384656,0.052728724,0.00006907864,0.00003458436,0.000048293652,0.00013122657,0.000021332526,0.0021151514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00014448375,0.000023577892,0.00010683131,0.00015220382,0.00006590825],"domain_scores_gemma":[0.9988422,0.00067282486,0.00018889907,0.000119404904,0.00014104588,0.000035730645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081672595,0.0007435055,0.00081316935,0.0002930589,0.00017015221,0.0006351558,0.00079712825,0.00067829585,0.0008147489],"category_scores_gemma":[0.0028416705,0.000280593,0.00028403633,0.00050939753,0.0007678055,0.0010607353,0.000937575,0.0006034186,0.00021255472],"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.00036123287,0.000041385938,0.0005126867,0.00011488609,0.000043545788,0.0003603156,0.00010263134,0.9059052,0.017561335,0.04910788,0.0005157128,0.025373187],"study_design_scores_gemma":[0.000017073215,0.00006308587,0.00016122512,0.0000074430245,0.000008149267,0.00008740899,0.000016284106,0.9868852,0.0042471145,0.008320056,0.00017745492,0.000009561328],"about_ca_topic_score_codex":0.0008177921,"about_ca_topic_score_gemma":0.0007180817,"teacher_disagreement_score":0.0008177921,"about_ca_system_score_codex":0.0006450204,"about_ca_system_score_gemma":0.0005140677,"threshold_uncertainty_score":0.0046800375},"labels":[],"label_agreement":null},{"id":"W2886581636","doi":"10.1109/tcomm.2018.2873322","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":68,"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":"Algorithm; Decoding methods; Computer science; Error detection and correction; Bit error rate; Sorting; List decoding; Code (set theory); Concatenated error correction code; Block code","score_opus":0.039094336960628716,"score_gpt":0.3243455029031874,"score_spread":0.2852511659425587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886581636","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.009440602,0.00015155949,0.9885029,0.00005024138,0.000040582774,0.000056288067,0.000049203885,0.00044676274,0.0012618497],"genre_scores_gemma":[0.14073715,0.00030586973,0.8558608,0.00009244586,0.00003246904,0.00014765568,0.0002875875,0.00005819505,0.0024777458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993007,0.0001306649,0.000050166396,0.000102220634,0.0003571071,0.000059090395],"domain_scores_gemma":[0.9991924,0.00027768343,0.0000629103,0.00010722681,0.00033669363,0.000023076316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054232316,0.0006805343,0.0005569431,0.0008737997,0.00037946034,0.0006304763,0.0007933231,0.00067622523,0.0020512568],"category_scores_gemma":[0.0022692485,0.00018699246,0.00044555045,0.0010324985,0.00041639185,0.00063980854,0.00063852954,0.00079891225,0.0010192367],"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.00045085922,0.000074536714,0.0013184045,0.00018937673,0.000057057576,0.0003270848,0.00022275187,0.22662792,0.09730414,0.041878384,0.0029383947,0.6286111],"study_design_scores_gemma":[0.00003468596,0.000089694724,0.0002666671,0.000016365264,0.000012366114,0.00027843786,0.0000134526235,0.9578536,0.03370965,0.0044564656,0.0032424212,0.00002617487],"about_ca_topic_score_codex":0.0029389453,"about_ca_topic_score_gemma":0.0030239956,"teacher_disagreement_score":0.0029389453,"about_ca_system_score_codex":0.00059634814,"about_ca_system_score_gemma":0.0013146488,"threshold_uncertainty_score":0.0068621635},"labels":[],"label_agreement":null},{"id":"W2887906137","doi":"10.1109/tcomm.2018.2881117","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Physical layer; Computer science; Authentication (law); Robustness (evolution); Authentication protocol; Lightweight Extensible Authentication Protocol; Distributed computing; Wireless","score_opus":0.03787961938960948,"score_gpt":0.336655443153291,"score_spread":0.2987758237636815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887906137","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.014307657,0.000094015704,0.984446,0.00010059342,0.000028783745,0.000027077036,0.00001021093,0.0003145174,0.00067111896],"genre_scores_gemma":[0.8835822,0.00015416351,0.11378717,0.000106418534,0.00004541204,0.000056829398,0.00003806768,0.000027028855,0.0022027893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985012,0.0003969801,0.000098952005,0.0003445418,0.0004807034,0.0001777932],"domain_scores_gemma":[0.9979938,0.0007823785,0.0003258894,0.00045920492,0.00038705827,0.000051736133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015333103,0.0006445484,0.0008718424,0.00044577132,0.00058080343,0.0011182842,0.0011577852,0.0010696898,0.0011869424],"category_scores_gemma":[0.0041284673,0.00028886079,0.0005991046,0.0005484761,0.0013262389,0.0025297706,0.0015082555,0.0014398434,0.0005984871],"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.0005007849,0.00016608881,0.0019831527,0.00014692779,0.00008229154,0.00017789559,0.00023231219,0.6113425,0.04428464,0.038227506,0.0012363703,0.30161962],"study_design_scores_gemma":[0.00000708115,0.00006736816,0.00018566776,0.0000036399713,0.000008597439,0.00004493524,0.0000070446763,0.9898316,0.0056246733,0.003780812,0.00042797616,0.000010595562],"about_ca_topic_score_codex":0.0009466841,"about_ca_topic_score_gemma":0.0007609145,"teacher_disagreement_score":0.0015333103,"about_ca_system_score_codex":0.00056519976,"about_ca_system_score_gemma":0.0010982967,"threshold_uncertainty_score":0.008109033},"labels":[],"label_agreement":null},{"id":"W2888993486","doi":"10.1109/tcomm.2018.2867475","title":"Polar Codes: Bounds on Bhattacharyya Parameters and Their Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bhattacharyya distance; Upper and lower bounds; Merge (version control); Binary number; Binary symmetric channel; Cardinality (data modeling); Channel (broadcasting); Polar; Mathematics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Channel capacity; Combinatorics; Telecommunications; Physics; Mathematical analysis; Arithmetic","score_opus":0.03945787012498194,"score_gpt":0.30332605850138084,"score_spread":0.2638681883763989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888993486","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.027092608,0.004020721,0.9427567,0.0005451957,0.00010414813,0.000050139137,0.00010902106,0.00028181984,0.025039602],"genre_scores_gemma":[0.76876307,0.006116724,0.21744798,0.0005421604,0.00035853346,0.00043005001,0.00031406156,0.0004062912,0.005621183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980623,0.00051211205,0.00013352846,0.00037226026,0.00065203337,0.0002677875],"domain_scores_gemma":[0.99306655,0.0045916913,0.00050878146,0.0009970334,0.000605987,0.00022993698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019376923,0.0012750627,0.0008764062,0.0015417264,0.0010796624,0.0020690814,0.0012280593,0.0012135948,0.003912024],"category_scores_gemma":[0.011654609,0.0005634497,0.0005255931,0.001584747,0.002820827,0.005046331,0.0032590956,0.0043809307,0.0009415828],"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.0002003599,0.000037309535,0.0005890719,0.00024370906,0.00002002177,0.00011162369,0.000315698,0.06483036,0.014274818,0.87566674,0.0013065623,0.042403795],"study_design_scores_gemma":[0.000024760007,0.00013559533,0.0003789868,0.00024765643,0.000029550007,0.00035506045,0.00020735434,0.2700848,0.033655424,0.680741,0.014042483,0.00009739684],"about_ca_topic_score_codex":0.00047485903,"about_ca_topic_score_gemma":0.00042813315,"teacher_disagreement_score":0.003912024,"about_ca_system_score_codex":0.0015882538,"about_ca_system_score_gemma":0.0008834023,"threshold_uncertainty_score":0.013087034},"labels":[],"label_agreement":null},{"id":"W2889062623","doi":"10.1109/tcomm.2018.2867436","title":"Performance Analysis and Improvement of Online Fountain Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"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":"Beijing Council of Science and Technology; National Natural Science Foundation of China","keywords":"Fountain code; Fountain; Computer science; Telecommunications; Electronic engineering; Engineering; Decoding methods; Block code; Concatenated error correction code; History","score_opus":0.02961203989107317,"score_gpt":0.3069218964144205,"score_spread":0.27730985652334733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889062623","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.1945816,0.002431675,0.7918318,0.000513022,0.000088399924,0.00007763355,0.000102344246,0.00145672,0.008916832],"genre_scores_gemma":[0.9490402,0.0004798521,0.049040888,0.0001065505,0.000041086554,0.00004131949,0.000054670876,0.00008018086,0.0011152513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997239,0.00087228883,0.00008411411,0.00027340648,0.0010148231,0.00051627075],"domain_scores_gemma":[0.988988,0.0064325863,0.0010096487,0.0017696581,0.0015740558,0.00022604177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010745,0.0011577389,0.00088916154,0.0010133369,0.0005723922,0.0011086361,0.0013515095,0.0010484079,0.0014134477],"category_scores_gemma":[0.015166996,0.00029435847,0.00041463203,0.0010170698,0.0014706181,0.0022480867,0.0016147908,0.0012122049,0.00027014336],"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.00073026767,0.00014264544,0.0018246642,0.00014631994,0.000051554376,0.00027095975,0.00023105596,0.82356185,0.015867705,0.046219047,0.0016184045,0.10933555],"study_design_scores_gemma":[0.000012863796,0.00011291832,0.00026387235,0.00001584208,0.000012327322,0.00014932125,0.000024958938,0.98531693,0.006428679,0.0071197106,0.00052070885,0.00002190051],"about_ca_topic_score_codex":0.0034205578,"about_ca_topic_score_gemma":0.0022821873,"teacher_disagreement_score":0.0034205578,"about_ca_system_score_codex":0.0017899009,"about_ca_system_score_gemma":0.001745452,"threshold_uncertainty_score":0.01298666},"labels":[],"label_agreement":null},{"id":"W2890182058","doi":"10.1109/tcomm.2018.2869864","title":"Design of Optimal Scalar Quantizer for Sequential Coding of Correlated Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Coding (social sciences); Algorithm; Scalar (mathematics); Electronic engineering; Mathematics; Control theory (sociology); Statistics; Engineering; Artificial intelligence","score_opus":0.08850073956349497,"score_gpt":0.3438400994164779,"score_spread":0.25533935985298295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890182058","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.0072494154,0.00012035545,0.9916368,0.00007808783,0.00001978305,0.000030779407,0.00003772093,0.00011515875,0.00071193144],"genre_scores_gemma":[0.5479893,0.0005018276,0.44720453,0.00016375358,0.0000650739,0.00019293635,0.00020513126,0.000058885715,0.0036185817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947673,0.00012840168,0.000034985693,0.00015054214,0.0001696136,0.000039604754],"domain_scores_gemma":[0.99941635,0.00024887413,0.00010127198,0.000045914494,0.00016670642,0.000020990958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008484021,0.00061534194,0.00056288665,0.0003227659,0.00026793918,0.0006053835,0.0007059826,0.00048474973,0.002103407],"category_scores_gemma":[0.001733165,0.00032021338,0.00028796057,0.00046372676,0.00049302215,0.001086025,0.000594056,0.0006216173,0.00045487343],"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.0005100114,0.00009718359,0.0011584719,0.00043237032,0.00009123017,0.0001571961,0.00025013127,0.43828866,0.10199143,0.10080792,0.0033882821,0.35282716],"study_design_scores_gemma":[0.000044390803,0.00014685636,0.00018808687,0.000020116471,0.000017203183,0.000058965335,0.000025420291,0.9712587,0.015189583,0.010443293,0.0025889718,0.000018370503],"about_ca_topic_score_codex":0.0012429394,"about_ca_topic_score_gemma":0.0018190545,"teacher_disagreement_score":0.002103407,"about_ca_system_score_codex":0.0005929605,"about_ca_system_score_gemma":0.0012457737,"threshold_uncertainty_score":0.0070366263},"labels":[],"label_agreement":null},{"id":"W2890765637","doi":"10.1109/tcomm.2018.2870875","title":"Stochastic Geometry-Based Modeling and Analysis of Massive MIMO-Enabled Millimeter Wave Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Path loss; Stochastic geometry; Beamwidth; Fading; Poisson point process; Computer science; Base station; Spatial multiplexing; Electronic engineering; Cellular network; Precoding; Moment-generating function; Topology (electrical circuits); 3G MIMO; Spectral efficiency; Extremely high frequency; Non-line-of-sight propagation; Antenna (radio); Computer network; Point process; Telecommunications; Wireless; Channel (broadcasting); Mathematics; Engineering; Random variable; Electrical engineering; Statistics","score_opus":0.03687239025430546,"score_gpt":0.24204921227441387,"score_spread":0.2051768220201084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890765637","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.1323199,0.0009270233,0.8541814,0.0009327391,0.000113980204,0.00006338541,0.00066505146,0.00034320477,0.010453379],"genre_scores_gemma":[0.98566866,0.00086232694,0.009637,0.000097829456,0.00006830254,0.00007765599,0.00027651666,0.000042408195,0.0032693679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.00016935306,0.00001780378,0.000067301706,0.00013757283,0.000111077374],"domain_scores_gemma":[0.99889934,0.00048355298,0.00027280365,0.000070050744,0.00020236381,0.000071901355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077762647,0.0008855277,0.0008406823,0.0006468265,0.00038150643,0.0010481292,0.0011167241,0.0009938783,0.0007302782],"category_scores_gemma":[0.0019155344,0.00049625325,0.00070415664,0.0006742859,0.001044272,0.0008751353,0.0009764108,0.00071906415,0.00026051086],"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.000006642755,0.000003986487,0.00033871862,0.000007114548,0.0000065677755,0.00003976533,0.000011890085,0.98948705,0.00046290527,0.008993924,0.00013952071,0.00050181017],"study_design_scores_gemma":[0.0000012455968,0.0000051319876,0.00016464663,0.0000015175423,0.0000019105244,0.000009360481,0.000004888471,0.9979803,0.00006349582,0.0016684491,0.00009570043,0.000003379818],"about_ca_topic_score_codex":0.013105659,"about_ca_topic_score_gemma":0.005675368,"teacher_disagreement_score":0.013105659,"about_ca_system_score_codex":0.0015942248,"about_ca_system_score_gemma":0.00082185684,"threshold_uncertainty_score":0.026058733},"labels":[],"label_agreement":null},{"id":"W2890830402","doi":"10.1109/tcomm.2018.2871448","title":"Hybrid mmWave MIMO-OFDM Channel Estimation Based on the Multi-Band Sparse Structure of Channel","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Estimator; Channel (broadcasting); Compressed sensing; MIMO; Computer science; Electronic engineering; MIMO-OFDM; Bandwidth (computing); Algorithm; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.05597804358014283,"score_gpt":0.26213347179651,"score_spread":0.20615542821636715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890830402","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.0131997755,0.000112132446,0.9856278,0.000053194,0.000025382895,0.000013076978,0.000054775366,0.00019239417,0.00072148157],"genre_scores_gemma":[0.52795655,0.0005114068,0.4682165,0.00017645856,0.00013185405,0.000091195114,0.00030765912,0.00005453169,0.0025538406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.000063026484,0.000010148016,0.000047559915,0.00010901961,0.00003378568],"domain_scores_gemma":[0.99952626,0.00021397474,0.00007123508,0.00008039709,0.000086257845,0.000021806634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351607,0.00051365455,0.0005651149,0.0003802639,0.00023625989,0.00052332756,0.00052949414,0.0004628129,0.0008401978],"category_scores_gemma":[0.0012508932,0.0002543821,0.00035723535,0.00042530766,0.0002890768,0.0009992574,0.0006156341,0.0005344643,0.00034273116],"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.00041090354,0.00014238892,0.0038965554,0.00024875306,0.00020261636,0.00021880167,0.00015802057,0.52395755,0.08275551,0.029182943,0.0022636969,0.35656226],"study_design_scores_gemma":[0.00000792351,0.000041663494,0.00033014425,0.000006098781,0.000012546208,0.00007583721,0.000009579515,0.98880774,0.008425385,0.0016306475,0.0006396946,0.000012591195],"about_ca_topic_score_codex":0.0008256335,"about_ca_topic_score_gemma":0.0017816705,"teacher_disagreement_score":0.0008401978,"about_ca_system_score_codex":0.0002096103,"about_ca_system_score_gemma":0.00035934008,"threshold_uncertainty_score":0.0028107166},"labels":[],"label_agreement":null},{"id":"W2891340028","doi":"10.1109/tcomm.2018.2869820","title":"A Hierarchical Game With Strategy Evolution for Mobile Sponsored Content and Service Markets","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Mobile telephony; Game theory; Service (business); Computer science; Telecommunications; Business; Mobile radio; Marketing; Economics; Microeconomics","score_opus":0.051917396532306384,"score_gpt":0.24354219684632147,"score_spread":0.19162480031401508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891340028","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.09799863,0.00017844325,0.8807876,0.0007346429,0.0000572117,0.0003498854,0.00016484207,0.00013044049,0.01959827],"genre_scores_gemma":[0.9174996,0.00018330809,0.07272626,0.0001462126,0.000032078573,0.00035787706,0.00008969056,0.000017549368,0.00894754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882406,0.0006016485,0.000036296886,0.00019040529,0.00019206014,0.00015552406],"domain_scores_gemma":[0.99907875,0.0005562537,0.000108715285,0.000039910905,0.00008253068,0.0001337805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404617,0.0008215718,0.0008579252,0.0005161357,0.00076199067,0.0014136181,0.0018016676,0.0018846358,0.0049098535],"category_scores_gemma":[0.0038465832,0.00037091982,0.0007617935,0.0005874128,0.0015416361,0.0019064415,0.0014200461,0.0013003158,0.0003791705],"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.00017185663,0.00013531273,0.00097113586,0.00010924038,0.00005358635,0.00061059924,0.00048339268,0.6332892,0.0029603667,0.3461335,0.0016590876,0.013422652],"study_design_scores_gemma":[0.000046406287,0.000063416446,0.00014654626,0.000005508096,0.000011023385,0.000052859945,0.000052453885,0.96715987,0.00011734909,0.03149695,0.0008353112,0.000012205626],"about_ca_topic_score_codex":0.007916949,"about_ca_topic_score_gemma":0.0068700574,"teacher_disagreement_score":0.007916949,"about_ca_system_score_codex":0.0020976348,"about_ca_system_score_gemma":0.0018947104,"threshold_uncertainty_score":0.016425073},"labels":[],"label_agreement":null},{"id":"W2891725399","doi":"10.1109/tcomm.2018.2870378","title":"Interference and Outage Analysis of Random D2D Networks Underlaying Millimeter-Wave Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":43,"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":"Huawei Technologies","keywords":"Stochastic geometry; Fading; Poisson point process; Path loss; Nakagami distribution; Topology (electrical circuits); Computer science; Power control; Cellular network; Coverage probability; Interference (communication); Transmitter power output; Node (physics); Signal-to-interference-plus-noise ratio; Electronic engineering; Transmitter; Point process; Computer network; Telecommunications; Physics; Mathematics; Power (physics); Engineering; Electrical engineering; Wireless; Statistics; Acoustics","score_opus":0.04733548736544642,"score_gpt":0.252116374281727,"score_spread":0.2047808869162806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891725399","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.42569298,0.0017994074,0.55771846,0.0010396675,0.000081134385,0.00006425331,0.0006005176,0.00033133954,0.0126723545],"genre_scores_gemma":[0.994518,0.00045350048,0.0038848522,0.00004320118,0.000033387263,0.0000284964,0.00010641957,0.000016333577,0.00091568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909747,0.00031891448,0.000040635274,0.000104821884,0.00024231305,0.0001958863],"domain_scores_gemma":[0.994941,0.0034048494,0.0007589038,0.0002370983,0.00052503624,0.00013302064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326915,0.00077530934,0.0007581363,0.0010152559,0.00058702665,0.00085205585,0.0009947361,0.0007164341,0.0009633908],"category_scores_gemma":[0.0065323417,0.0003676041,0.0005068579,0.0011281047,0.0010992152,0.001031451,0.001135861,0.0006543978,0.00016604402],"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.000058279285,0.00001599198,0.0022851357,0.00003953213,0.000025118468,0.00019152829,0.00006347272,0.96993273,0.001173755,0.02304945,0.00049135485,0.0026736113],"study_design_scores_gemma":[0.000003723203,0.000011255941,0.00051025325,0.000003879291,0.000007282944,0.000042808766,0.000027196485,0.9960366,0.00018103146,0.0030491198,0.00012132211,0.0000055122377],"about_ca_topic_score_codex":0.006599793,"about_ca_topic_score_gemma":0.0032482645,"teacher_disagreement_score":0.006599793,"about_ca_system_score_codex":0.002043952,"about_ca_system_score_gemma":0.00062569545,"threshold_uncertainty_score":0.014829934},"labels":[],"label_agreement":null},{"id":"W2894564570","doi":"10.1109/tcomm.2018.2873735","title":"Joint User Scheduling and RRU Association for ODFMA-Based Networks With Inter-BBU Coordination","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Joint (building); Association (psychology); Computer network; Distributed computing; Engineering; Operations management","score_opus":0.020691434397632675,"score_gpt":0.24778567525383596,"score_spread":0.22709424085620328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894564570","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.023162331,0.00050986005,0.97257024,0.0001715064,0.000072008464,0.00005051915,0.000042211617,0.0001572592,0.003264024],"genre_scores_gemma":[0.84961015,0.00037419578,0.14763689,0.000109680856,0.00012546606,0.000105014136,0.00007577328,0.00005214993,0.001910673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822086,0.00082029565,0.000043714794,0.00027512645,0.00030881597,0.00033123916],"domain_scores_gemma":[0.9982028,0.0010721628,0.00024594134,0.00020129066,0.0001535041,0.0001242782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020942162,0.0010297907,0.0015011202,0.0004201861,0.0007874543,0.00154345,0.0013528636,0.0008806843,0.0016623283],"category_scores_gemma":[0.004602124,0.00046351063,0.0005388406,0.0010978518,0.0010819394,0.0012470144,0.0013616353,0.0011657986,0.00035465977],"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.00011483022,0.00006686806,0.00042156287,0.000059513222,0.00002789946,0.000090893904,0.000049812115,0.9336354,0.0018857629,0.025686568,0.0010937429,0.036867157],"study_design_scores_gemma":[0.000007964152,0.000030156516,0.00006594922,0.0000025505187,0.0000059186077,0.00002088821,0.000015242638,0.9947625,0.0003937578,0.0042896383,0.00040026498,0.000005152789],"about_ca_topic_score_codex":0.004281923,"about_ca_topic_score_gemma":0.004638439,"teacher_disagreement_score":0.004281923,"about_ca_system_score_codex":0.0012939182,"about_ca_system_score_gemma":0.0021790275,"threshold_uncertainty_score":0.011075377},"labels":[],"label_agreement":null},{"id":"W2894957266","doi":"10.1109/tcomm.2018.2873345","title":"Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Variable (mathematics); Sequence (biology); State (computer science); Computer science; Set (abstract data type); Code (set theory); Algorithm; Finite-state machine; Mathematics","score_opus":0.09192691104221765,"score_gpt":0.32281140746618825,"score_spread":0.2308844964239706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894957266","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.04057191,0.00010305516,0.9531664,0.00010112369,0.000018680259,0.000083956504,0.00016990097,0.0002850629,0.0054999115],"genre_scores_gemma":[0.49175304,0.00021989315,0.50358033,0.00011847738,0.000028133116,0.0005394595,0.00058264524,0.0001860289,0.0029919671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989711,0.00024963735,0.000075702854,0.00013892159,0.00044848205,0.00011614575],"domain_scores_gemma":[0.99768806,0.0013708794,0.00023284151,0.0002659278,0.00035286875,0.000089340945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216273,0.0004769228,0.0004351981,0.000836486,0.0006690332,0.00083046634,0.00079778134,0.0005554439,0.0024345892],"category_scores_gemma":[0.0048678815,0.00040086624,0.0005357392,0.0005263564,0.0010792217,0.0011258272,0.0013955834,0.0011397076,0.000545261],"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.00017404107,0.0000632598,0.0004932727,0.00018684276,0.000019066068,0.00014348252,0.00029610944,0.21392836,0.033445455,0.6831464,0.0015578779,0.06654579],"study_design_scores_gemma":[0.000037430727,0.00017456022,0.00027167975,0.00009067472,0.000015269814,0.00018999071,0.000082297716,0.5512966,0.054273497,0.38303766,0.010469271,0.00006116676],"about_ca_topic_score_codex":0.0006144643,"about_ca_topic_score_gemma":0.00081262906,"teacher_disagreement_score":0.0024345892,"about_ca_system_score_codex":0.00084050366,"about_ca_system_score_gemma":0.0012011818,"threshold_uncertainty_score":0.008144498},"labels":[],"label_agreement":null},{"id":"W2896569878","doi":"10.1109/tcomm.2018.2875486","title":"Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Algorithm; Minification; Scalar (mathematics); Directed acyclic graph; Dynamic programming; Source code; Partition (number theory); Mathematics; Property (philosophy); Optimization problem; Encoder; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.041390576054619765,"score_gpt":0.27514921807884907,"score_spread":0.2337586420242293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896569878","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.008927987,0.00019065705,0.9886812,0.00009231794,0.0000229413,0.000041877283,0.000039673316,0.0001250437,0.0018782968],"genre_scores_gemma":[0.55374765,0.0003678901,0.4401143,0.00012613185,0.000036311423,0.0001826596,0.00014076353,0.00004970696,0.0052345153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937445,0.00013893316,0.000041175466,0.00018081769,0.00019395725,0.00007069951],"domain_scores_gemma":[0.99950874,0.00023142686,0.00008862302,0.000040868596,0.000107920416,0.000022384043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009530517,0.00080396445,0.00083514594,0.00030455523,0.000363553,0.0010620109,0.0010401094,0.0007913788,0.0030266878],"category_scores_gemma":[0.0012060485,0.00047671326,0.00044383807,0.000427257,0.00066191284,0.0014914846,0.0008015892,0.00086552935,0.0004715089],"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.0005684095,0.00013242985,0.00062306173,0.00046502837,0.0001134393,0.00014635462,0.0002487818,0.5859148,0.09067956,0.09556744,0.0023151054,0.22322555],"study_design_scores_gemma":[0.000046150297,0.00015982971,0.00010868145,0.000016885993,0.000021346876,0.00005112456,0.000020241368,0.9759329,0.014737859,0.007168692,0.0017127057,0.000023471757],"about_ca_topic_score_codex":0.0014803684,"about_ca_topic_score_gemma":0.002653057,"teacher_disagreement_score":0.0030266878,"about_ca_system_score_codex":0.00089934486,"about_ca_system_score_gemma":0.001243776,"threshold_uncertainty_score":0.010125279},"labels":[],"label_agreement":null},{"id":"W2897434454","doi":"10.1109/tcomm.2018.2874239","title":"Cooperative Non-Orthogonal Layered Multicast Multiple Access for Heterogeneous Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":43,"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 Alberta","funders":"Natural Science Basic Research Program of Shaanxi Province; Engineering and Physical Sciences Research Council; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Royal Society","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Reliability (semiconductor); Xcast; Channel (broadcasting); Base station; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Physics","score_opus":0.04884232698886927,"score_gpt":0.3142361201314315,"score_spread":0.26539379314256223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897434454","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.013827552,0.00048372726,0.9840507,0.00009527644,0.000028417433,0.000026692831,0.000013148293,0.00008038843,0.0013940715],"genre_scores_gemma":[0.87141067,0.00060816424,0.12642384,0.00013922363,0.00007610123,0.00010671368,0.000031237538,0.000016534692,0.0011875037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987281,0.0005398037,0.0000563645,0.00012531012,0.00039622563,0.00015426805],"domain_scores_gemma":[0.99893767,0.0004774867,0.00017718002,0.00013897856,0.00021314019,0.000055514578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012379964,0.0008190006,0.0006331212,0.0005046384,0.0006018113,0.00096124545,0.0016237707,0.0006949685,0.0005688033],"category_scores_gemma":[0.002322231,0.00028535764,0.0005726696,0.000503811,0.00065954233,0.0011474682,0.0013979306,0.00067930983,0.00017757168],"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.00025173114,0.00018512618,0.0028053727,0.00041150273,0.00030033215,0.001273425,0.00060632214,0.60308206,0.07202581,0.15458389,0.0021326698,0.1623418],"study_design_scores_gemma":[0.0000094938205,0.00007208153,0.00010176998,0.000008356944,0.000027902026,0.00013531641,0.000026857206,0.9886885,0.0018106482,0.008140768,0.0009659885,0.000012306273],"about_ca_topic_score_codex":0.00093873247,"about_ca_topic_score_gemma":0.0012939976,"teacher_disagreement_score":0.0016237707,"about_ca_system_score_codex":0.0008120926,"about_ca_system_score_gemma":0.0005080466,"threshold_uncertainty_score":0.006547272},"labels":[],"label_agreement":null},{"id":"W2899538333","doi":"10.1109/tcomm.2018.2880204","title":"Throughput-Based Design for Polar-Coded Modulation","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Throughput; Algorithm; Decoding methods; Coding gain; Code rate; Quadrature amplitude modulation; Polar code; Automatic repeat request; Real-time computing; Bit error rate; Telecommunications link; Computer network; Telecommunications; Wireless","score_opus":0.12284797493317359,"score_gpt":0.3495131739354024,"score_spread":0.22666519900222878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899538333","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.0077272197,0.00028519952,0.9857287,0.00010166989,0.000043420496,0.00007595488,0.00007194282,0.0005215784,0.005444473],"genre_scores_gemma":[0.6879741,0.00080728665,0.30575922,0.00020041481,0.00011440908,0.00025942703,0.00022485673,0.00017568246,0.004484599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894756,0.00027414432,0.000044009324,0.00014515177,0.0004982586,0.00009083722],"domain_scores_gemma":[0.9985379,0.0004940158,0.00019717081,0.00014968112,0.00057973556,0.000041587708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083493313,0.0009642044,0.00046795566,0.0008765849,0.00053867936,0.0011163083,0.00086266414,0.00049344293,0.0021355108],"category_scores_gemma":[0.0035397003,0.00030749966,0.00025173533,0.0007477703,0.0005493977,0.0007368136,0.0007818219,0.0007353773,0.0010977932],"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.00038322012,0.000114448165,0.0012836689,0.0003010373,0.00006962829,0.00026456238,0.0002631738,0.53640175,0.14132212,0.13236916,0.0040537785,0.18317342],"study_design_scores_gemma":[0.000024907064,0.00017330512,0.0003087215,0.00004315613,0.000032433734,0.00023140505,0.000023416593,0.91357017,0.058164086,0.020919196,0.006476449,0.00003275489],"about_ca_topic_score_codex":0.00090382784,"about_ca_topic_score_gemma":0.0009856209,"teacher_disagreement_score":0.0021355108,"about_ca_system_score_codex":0.0015195864,"about_ca_system_score_gemma":0.0010575554,"threshold_uncertainty_score":0.011025429},"labels":[],"label_agreement":null},{"id":"W2899567128","doi":"10.1109/tcomm.2018.2879088","title":"Systematic Fountain Codes for Massive Storage Using the Truncated Poisson Distribution","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Bombardier (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Fountain code; List decoding; Computer science; Overhead (engineering); Redundancy (engineering); Algorithm; Poisson distribution; Luby transform code; Erasure; Theoretical computer science; Hamming code; Mathematics; Concatenated error correction code; Block code; Statistics","score_opus":0.05223495903565117,"score_gpt":0.3216712573283314,"score_spread":0.26943629829268023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899567128","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.07486302,0.0004224509,0.9209836,0.0004057546,0.000048228176,0.00006794559,0.00007532729,0.00059399987,0.0025396838],"genre_scores_gemma":[0.8661463,0.0003701592,0.12977888,0.00018434608,0.00003777386,0.000120889854,0.000092519105,0.00007872119,0.003190319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927264,0.00021490459,0.00003538863,0.000073640986,0.00030099766,0.0001023637],"domain_scores_gemma":[0.99665064,0.001599831,0.0004117538,0.00067614706,0.0005755211,0.00008612288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012211808,0.0004662608,0.00046470072,0.00055632077,0.0007078096,0.0008612818,0.0011558919,0.000745578,0.001013178],"category_scores_gemma":[0.006275671,0.00023530626,0.0003863364,0.0009309421,0.0010914,0.0018074078,0.0011898108,0.0009082326,0.00031772107],"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.00034426292,0.000063214924,0.0018695691,0.00015837068,0.00006619411,0.0003801866,0.0004996329,0.66324925,0.024543677,0.21525845,0.0034040387,0.090163164],"study_design_scores_gemma":[0.000016282465,0.00006905528,0.00020511921,0.000018763374,0.000011269684,0.00015788557,0.000056645247,0.946765,0.009213984,0.0415878,0.0018721406,0.000025973066],"about_ca_topic_score_codex":0.0024914583,"about_ca_topic_score_gemma":0.0024524084,"teacher_disagreement_score":0.0024914583,"about_ca_system_score_codex":0.0013982886,"about_ca_system_score_gemma":0.0014051682,"threshold_uncertainty_score":0.010145366},"labels":[],"label_agreement":null},{"id":"W2905757196","doi":"10.1109/tcomm.2018.2889089","title":"Multi-Node ML Time and Frequency Synchronization for Distributed MIMO-Relay Beamforming Over Time-Varying Flat-Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Institut National de la Recherche Scientifique; University of Manitoba; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Relay; Carrier frequency offset; MIMO; Node (physics); Synchronization (alternating current); Fading; Electronic engineering; Channel (broadcasting); Frequency offset; Computer network; Orthogonal frequency-division multiplexing; Engineering; Telecommunications; Power (physics)","score_opus":0.04051896480186675,"score_gpt":0.29557336871957274,"score_spread":0.255054403917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905757196","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.018616717,0.00014033297,0.980027,0.00004565465,0.000014181401,0.000016256065,0.000013197231,0.000064887114,0.0010617299],"genre_scores_gemma":[0.8733866,0.000359444,0.12438146,0.000045122248,0.000048017955,0.00006081053,0.000037897295,0.00002647422,0.0016542405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.00014721588,0.00001510262,0.00008324682,0.00013595897,0.00003701164],"domain_scores_gemma":[0.9987872,0.00083697663,0.00015836848,0.00008143191,0.000114901486,0.000021076465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006913023,0.0005060346,0.0004354452,0.00017738891,0.00023056431,0.00039924812,0.0004056492,0.0004816284,0.0007004157],"category_scores_gemma":[0.002931655,0.0002300327,0.00028537234,0.00030779472,0.0005035993,0.0008038208,0.00051133806,0.00046516382,0.00022017852],"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.00008595306,0.000026094676,0.0008143629,0.0000823914,0.000029741093,0.00012549885,0.00015028985,0.92378265,0.019132713,0.020389238,0.00024222994,0.035138886],"study_design_scores_gemma":[0.0000069411294,0.00007292173,0.00017722389,0.0000047856834,0.000008527165,0.000049002545,0.000018233057,0.993628,0.004119626,0.0015285793,0.00037940644,0.000006794294],"about_ca_topic_score_codex":0.000954037,"about_ca_topic_score_gemma":0.0012432288,"teacher_disagreement_score":0.000954037,"about_ca_system_score_codex":0.0004832515,"about_ca_system_score_gemma":0.00044958922,"threshold_uncertainty_score":0.0036560297},"labels":[],"label_agreement":null},{"id":"W2907135405","doi":"10.1109/tcomm.2019.2892054","title":"Average SEP-Optimal Precoding for Correlated Massive MIMO With ZF Detection: An Asymptotic Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"McMaster University","funders":"","keywords":"Precoding; MIMO; Zero-forcing precoding; Computer science; Mathematics; Algorithm; Electronic engineering; Control theory (sociology); Statistics; Engineering; Beamforming; Artificial intelligence","score_opus":0.013241440794707961,"score_gpt":0.2380051838955041,"score_spread":0.22476374310079614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907135405","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.07229699,0.00070677,0.91977227,0.00038786628,0.000027036866,0.0000245026,0.00010621847,0.00025913207,0.00641922],"genre_scores_gemma":[0.93229276,0.001204912,0.06344591,0.00017497064,0.000110557696,0.00007756497,0.00019237706,0.000093776944,0.0024071168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.00039672822,0.000047651374,0.00014004034,0.00060922484,0.00011962487],"domain_scores_gemma":[0.9921359,0.0060612108,0.0005685033,0.00043352335,0.0007070032,0.00009386635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026630776,0.00082087575,0.00075147,0.0006600837,0.00029952294,0.0010782589,0.0008451963,0.00075285113,0.0015133115],"category_scores_gemma":[0.017747384,0.0005141081,0.0005168109,0.00064169767,0.0017790884,0.0019809457,0.0009428221,0.00084694737,0.00039994158],"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.000115862334,0.00005615623,0.0016921704,0.00019206501,0.000076477634,0.000289802,0.00012390767,0.84129435,0.006267247,0.13418633,0.0009866211,0.014719051],"study_design_scores_gemma":[0.000009186604,0.000039898623,0.00055352773,0.000026496518,0.000015006913,0.00015744871,0.00002576373,0.9653817,0.0018553108,0.031684287,0.00023806331,0.00001330881],"about_ca_topic_score_codex":0.00085012976,"about_ca_topic_score_gemma":0.00076133746,"teacher_disagreement_score":0.0026630776,"about_ca_system_score_codex":0.001212231,"about_ca_system_score_gemma":0.0011441719,"threshold_uncertainty_score":0.014083862},"labels":[],"label_agreement":null},{"id":"W2909012309","doi":"10.1109/tcomm.2019.2892756","title":"Interplay of Bit Rate, Linewidth, Bandwidth, and Reach on Optical DMT and PAM With IMDD","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bit error rate; Pulse-amplitude modulation; Laser linewidth; Bandwidth (computing); Electronic engineering; Computer science; Modulation (music); Optics; Intensity modulation; Laser; Physics; Phase modulation; Channel (broadcasting); Telecommunications; Phase noise; Pulse (music); Engineering","score_opus":0.008844575804206513,"score_gpt":0.22720534476259566,"score_spread":0.21836076895838916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909012309","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.87330735,0.003397195,0.08739351,0.0011679095,0.000069957314,0.00004885233,0.00021007769,0.00040100224,0.034004115],"genre_scores_gemma":[0.99569917,0.00046421494,0.0027854373,0.000044387314,0.000021599295,0.00001297159,0.000019196963,0.00003851317,0.00091441564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986375,0.00044295102,0.000027638695,0.00010560898,0.00051507587,0.0002711889],"domain_scores_gemma":[0.9921301,0.00624062,0.0006652132,0.00031640427,0.0005570646,0.00009066311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717454,0.00056632404,0.00078428356,0.000980309,0.00056667073,0.0012091352,0.0008261549,0.00096648635,0.0019209262],"category_scores_gemma":[0.00986799,0.00032239192,0.00042077314,0.000937885,0.0011336289,0.0021671094,0.0011168827,0.00054288126,0.0005322407],"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.00054492237,0.00013021103,0.003678786,0.00034063339,0.00006004666,0.00034601672,0.00024959052,0.89247537,0.042111948,0.037232406,0.0006985515,0.022131545],"study_design_scores_gemma":[0.000023707951,0.0004444512,0.0016940078,0.00010649859,0.00007764825,0.00029610237,0.00012662842,0.9411457,0.04573803,0.009090415,0.0011981417,0.000058660065],"about_ca_topic_score_codex":0.0017409531,"about_ca_topic_score_gemma":0.0016909924,"teacher_disagreement_score":0.0019209262,"about_ca_system_score_codex":0.00147395,"about_ca_system_score_gemma":0.0005218929,"threshold_uncertainty_score":0.010694265},"labels":[],"label_agreement":null},{"id":"W2910412414","doi":"10.1109/tcomm.2019.2893387","title":"Joint FSO Fronthaul and Millimeter-Wave Access Link Optimization in Cloud Small Cell Networks: A Statistical-QoS Aware Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Optimization problem; Telecommunications link; Scheduling (production processes); Radio access network; Computer network; Multiplexing; Access network; Quality of service; Mathematical optimization; Base station; Algorithm; Telecommunications; Mathematics","score_opus":0.04640435486142452,"score_gpt":0.2525790998737686,"score_spread":0.20617474501234406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910412414","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.021853628,0.00046533273,0.97332305,0.00039786816,0.000039731265,0.00005224534,0.000074941054,0.00011819661,0.0036750045],"genre_scores_gemma":[0.8250032,0.0010420987,0.16862535,0.00023106513,0.00018845467,0.00019317745,0.00015002464,0.00013233318,0.0044342787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948174,0.00016356229,0.00001159008,0.00007085716,0.00012583812,0.00014650865],"domain_scores_gemma":[0.9988096,0.00085463625,0.00011545194,0.00003905929,0.0001189558,0.00006224364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011432677,0.0012158446,0.0013191113,0.0007592124,0.0004467553,0.0013615511,0.0011199857,0.00083717133,0.0014312412],"category_scores_gemma":[0.0022988324,0.0006467976,0.0006777324,0.0011825789,0.0009047195,0.0010079036,0.00095848995,0.00085060345,0.00021087119],"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.000015750873,0.00001926388,0.0001881775,0.000018424318,0.0000105612735,0.00002076286,0.0000070940814,0.98900795,0.0003759283,0.00506879,0.00023095842,0.005036417],"study_design_scores_gemma":[0.0000014840714,0.000004001013,0.000032685,9.069265e-7,0.0000015123913,0.000001900542,0.0000032934702,0.99880564,0.00007628178,0.0010171976,0.00005398016,0.0000011036921],"about_ca_topic_score_codex":0.011535677,"about_ca_topic_score_gemma":0.008573832,"teacher_disagreement_score":0.011535677,"about_ca_system_score_codex":0.0017704024,"about_ca_system_score_gemma":0.0024321424,"threshold_uncertainty_score":0.02293706},"labels":[],"label_agreement":null},{"id":"W2910778537","doi":"10.1109/tcomm.2019.2892719","title":"Generalized Approximate Message Passing for Massive MIMO mmWave Channel Estimation With Laplacian Prior","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":86,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Message passing; Computer science; MIMO; Algorithm; Expectation propagation; Channel (broadcasting); Bayesian inference; Bayesian probability; Theoretical computer science; Mathematical optimization; Gaussian; Mathematics; Artificial intelligence; Gaussian process; Telecommunications","score_opus":0.030968454879707365,"score_gpt":0.2530233028250778,"score_spread":0.22205484794537042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910778537","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.0019822596,0.00007330038,0.9973827,0.00008107773,0.000011505421,0.0000080682,0.000016767739,0.00009163256,0.00035272457],"genre_scores_gemma":[0.366051,0.0008186774,0.62683505,0.00036582228,0.00018652667,0.0002472885,0.00036629356,0.00013623227,0.004993072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914396,0.00034338838,0.000037286492,0.00013127273,0.00027109313,0.00007301831],"domain_scores_gemma":[0.99820185,0.0012241243,0.00013642211,0.00018028116,0.00020764032,0.000049699975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014708702,0.0009918526,0.0010007547,0.0006894929,0.00043505165,0.00087340473,0.0012323252,0.0010368208,0.0014787792],"category_scores_gemma":[0.0055883643,0.00047704444,0.0006579339,0.0011015346,0.001111071,0.0017024736,0.0014257664,0.0014301499,0.0005004148],"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.00007283363,0.00002610414,0.00028040487,0.00009462424,0.000037554917,0.00007478516,0.00010930558,0.8788197,0.0021222536,0.049143583,0.0012382355,0.067980625],"study_design_scores_gemma":[0.000004737349,0.00001386665,0.00003844412,0.0000041729922,0.0000038419694,0.000016125761,0.000006500693,0.9862217,0.0005126252,0.012695947,0.00047635916,0.000005821629],"about_ca_topic_score_codex":0.0038238731,"about_ca_topic_score_gemma":0.0036641103,"teacher_disagreement_score":0.0038238731,"about_ca_system_score_codex":0.00086248084,"about_ca_system_score_gemma":0.0011977495,"threshold_uncertainty_score":0.007778764},"labels":[],"label_agreement":null},{"id":"W2911604477","doi":"10.1109/tcomm.2019.2941490","title":"FALP: Fast Beam Alignment in mmWave Systems With Low-Resolution Phase Shifters","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Computer science; Phased array; Antenna (radio); Overhead (engineering); Channel (broadcasting); Compressed sensing; Beam (structure); Electronic engineering; Phase (matter); Optics; Algorithm; Telecommunications; Physics; Engineering","score_opus":0.03283250671025887,"score_gpt":0.26320523962318904,"score_spread":0.23037273291293017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911604477","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.0028747185,0.00006832777,0.9953607,0.00006442952,0.000016308613,0.000022067426,0.00003634728,0.0006243851,0.0009327648],"genre_scores_gemma":[0.19563715,0.00023575926,0.8005976,0.00018750248,0.000069615446,0.00015502826,0.00027492797,0.00021593591,0.0026264254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00014258764,0.000024117213,0.000082499784,0.00023766633,0.00006341769],"domain_scores_gemma":[0.999658,0.00011363507,0.000054656444,0.00009554388,0.000058647765,0.000019446528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491713,0.00060668046,0.00041868072,0.00033198937,0.00031591905,0.0006976693,0.00080318924,0.0007110318,0.0023308585],"category_scores_gemma":[0.0014546362,0.0003009114,0.00021020434,0.0005412158,0.0005860042,0.0011721523,0.0013234686,0.0011589085,0.0009871982],"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.00041476137,0.00014643697,0.0008879167,0.0002359055,0.000040311785,0.00029427564,0.00017976327,0.2034011,0.081223324,0.15787862,0.011251053,0.5440465],"study_design_scores_gemma":[0.000037723024,0.00014720282,0.0003412585,0.000021911568,0.000005744281,0.00022623068,0.000037896243,0.9169884,0.036678046,0.03271492,0.012773772,0.000026993206],"about_ca_topic_score_codex":0.00083573826,"about_ca_topic_score_gemma":0.0010002838,"teacher_disagreement_score":0.0023308585,"about_ca_system_score_codex":0.0003224771,"about_ca_system_score_gemma":0.0006468078,"threshold_uncertainty_score":0.0077975392},"labels":[],"label_agreement":null},{"id":"W2911893217","doi":"10.1109/tcomm.2019.2894797","title":"Collaborative Multicast Beamforming for Content Delivery by Cache-Enabled Ultra Dense Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"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":"Institute for Information and Communications Technology Promotion; Institute for Computational Science and Technology; Ministry of Science and ICT, South Korea; Queen's University; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Multicast; Computer science; Backhaul (telecommunications); Computer network; Beamforming; Cache; Distributed computing; Base station; Telecommunications","score_opus":0.02909364837865125,"score_gpt":0.2518763374289379,"score_spread":0.22278268905028664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911893217","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.011025557,0.00023457859,0.986767,0.000134627,0.000022090684,0.000012863466,0.00002435641,0.000103356666,0.0016755672],"genre_scores_gemma":[0.705828,0.0011428013,0.2888359,0.00018918246,0.00007538016,0.00015033226,0.000105030136,0.00003869322,0.0036346528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.00008492704,0.000006915488,0.000026920361,0.000072989504,0.000028319744],"domain_scores_gemma":[0.9997002,0.00017073784,0.000040348874,0.000019555515,0.000057652527,0.000011487984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041314733,0.00048006972,0.00044817524,0.00031654313,0.0003315232,0.00045793797,0.00058950565,0.00062269653,0.0012363296],"category_scores_gemma":[0.0011272368,0.00023733753,0.00029641544,0.0006174754,0.00046659133,0.00078460504,0.0006114321,0.0005540314,0.00037451184],"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.00013091347,0.000054635962,0.0006210151,0.0001471372,0.00003548239,0.000171325,0.00012614523,0.80184555,0.034632754,0.048855685,0.0030935898,0.11028575],"study_design_scores_gemma":[0.0000068991435,0.000029394869,0.00006659758,0.000006176525,0.0000045693364,0.000026860836,0.000014722397,0.99146515,0.0016485774,0.0060121,0.0007133294,0.000005631991],"about_ca_topic_score_codex":0.0016055417,"about_ca_topic_score_gemma":0.002484326,"teacher_disagreement_score":0.0016055417,"about_ca_system_score_codex":0.00060324895,"about_ca_system_score_gemma":0.00048976537,"threshold_uncertainty_score":0.0043768883},"labels":[],"label_agreement":null},{"id":"W2912928774","doi":"10.1109/tcomm.2019.2894808","title":"Design of Successively Refinable Unrestricted Polar Quantizer","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Entropy (arrow of time); Combinatorics; Computer science; Mathematics; Discrete mathematics; Physics","score_opus":0.046837516925425794,"score_gpt":0.30398805775679216,"score_spread":0.25715054083136635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912928774","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.011543338,0.0001522459,0.9863702,0.00004840564,0.000019367286,0.0000407128,0.000033526598,0.00013320282,0.0016589522],"genre_scores_gemma":[0.55328834,0.0004418379,0.44105944,0.00010783258,0.00004802382,0.00018675615,0.00016193639,0.000043425727,0.0046623526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00008297426,0.000024666384,0.000105575426,0.00011050501,0.000040416988],"domain_scores_gemma":[0.9995633,0.00015237636,0.00008480593,0.00005418942,0.000115101895,0.000030146346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874996,0.0006379809,0.00055070163,0.00040071228,0.0002788792,0.00068974664,0.0009483127,0.00062494626,0.0031600178],"category_scores_gemma":[0.0016799562,0.00037597888,0.00034871127,0.00031852993,0.0005151353,0.0012402796,0.0010538102,0.0007855398,0.00059091114],"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.0009693114,0.00009055986,0.001319486,0.00035997614,0.00007672284,0.00027042275,0.0004145134,0.27799407,0.22674386,0.11510046,0.001990096,0.3746705],"study_design_scores_gemma":[0.000068938025,0.00027638106,0.00036923523,0.00003414649,0.000035964633,0.00012690289,0.00004564898,0.93760914,0.04578186,0.010063467,0.005541495,0.000046781184],"about_ca_topic_score_codex":0.0007450528,"about_ca_topic_score_gemma":0.00097534154,"teacher_disagreement_score":0.0031600178,"about_ca_system_score_codex":0.00040678246,"about_ca_system_score_gemma":0.0005151574,"threshold_uncertainty_score":0.010571361},"labels":[],"label_agreement":null},{"id":"W2913164447","doi":"10.1109/tcomm.2019.2896190","title":"Log-Likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes With Residual Phase Noise","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Huawei Technologies","keywords":"Quadrature amplitude modulation; Residual; Additive white Gaussian noise; Algorithm; Modulation (music); Bit error rate; Phase-shift keying; Signal-to-noise ratio (imaging); Computer science; Phase noise; Mathematics; Electronic engineering; Statistics; Decoding methods; White noise; Physics; Engineering","score_opus":0.04991518570806551,"score_gpt":0.3233230937693331,"score_spread":0.2734079080612676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164447","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.0072420095,0.00017516932,0.9902998,0.00005371344,0.000019350266,0.000021639406,0.000017670363,0.00030740802,0.0018631621],"genre_scores_gemma":[0.33298275,0.00053347624,0.66265154,0.00011694133,0.000052427742,0.000120598,0.00010965441,0.0002489109,0.003183707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.00036578096,0.000049675047,0.0000646792,0.00054299156,0.000048465034],"domain_scores_gemma":[0.99764025,0.0015503082,0.00021139304,0.0002758521,0.00029047785,0.000031815413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014003962,0.0006525061,0.00046127752,0.00065453746,0.00024487378,0.00079807144,0.0009798557,0.0006369426,0.0018442473],"category_scores_gemma":[0.008069454,0.0002480938,0.00037836423,0.00043386736,0.00049077644,0.001446644,0.0006512003,0.00081163,0.00087479816],"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.00028748345,0.00011709518,0.001961358,0.0003658075,0.0000784116,0.0007047749,0.00021558389,0.6642825,0.03737455,0.1058124,0.0018903875,0.18690959],"study_design_scores_gemma":[0.000007922578,0.000027303133,0.00013754451,0.000010259494,0.0000066329153,0.00017498559,0.000007741437,0.9863663,0.007813089,0.0044247215,0.0010128133,0.000010652347],"about_ca_topic_score_codex":0.00058953435,"about_ca_topic_score_gemma":0.00082082127,"teacher_disagreement_score":0.0018442473,"about_ca_system_score_codex":0.00059820275,"about_ca_system_score_gemma":0.00066517724,"threshold_uncertainty_score":0.0074061155},"labels":[],"label_agreement":null},{"id":"W2913330947","doi":"10.1109/tcomm.2019.2896960","title":"A Generalized Grouping Scheme in Coded Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Scheme (mathematics); Transmission rate; Wireless; Wireless network; Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.037457749790339986,"score_gpt":0.2701184905180824,"score_spread":0.2326607407277424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913330947","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.069825105,0.0009129698,0.92127675,0.00021628795,0.00012712901,0.00014090296,0.00007869897,0.0005401909,0.006881918],"genre_scores_gemma":[0.7085897,0.00066722464,0.28554922,0.00016215415,0.00008159176,0.000200063,0.00011503441,0.00007628972,0.004558712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.00025939994,0.000040555504,0.00010644757,0.00020305929,0.00012095635],"domain_scores_gemma":[0.99864906,0.00030408212,0.00014859559,0.00057660387,0.00024286928,0.000078860525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659686,0.0005718804,0.0007273906,0.0006424216,0.0008386057,0.0007484444,0.0012729724,0.0010484763,0.001638318],"category_scores_gemma":[0.0024965496,0.00022679953,0.0004806066,0.0015436485,0.0012500731,0.0021902649,0.0016147246,0.00088004547,0.000364875],"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.0005087756,0.00018451054,0.0010638769,0.00041257698,0.00007161968,0.00050605123,0.00085371913,0.17893323,0.07896436,0.48967433,0.006111223,0.24271575],"study_design_scores_gemma":[0.00007959758,0.00038917174,0.000592895,0.000071391034,0.000075158925,0.00062204595,0.00012465275,0.8929287,0.019137666,0.06941263,0.0164579,0.00010822421],"about_ca_topic_score_codex":0.0016263624,"about_ca_topic_score_gemma":0.0014535749,"teacher_disagreement_score":0.001638318,"about_ca_system_score_codex":0.0009620686,"about_ca_system_score_gemma":0.0008708681,"threshold_uncertainty_score":0.0069803},"labels":[],"label_agreement":null},{"id":"W2913563820","doi":"10.1109/tcomm.2019.2900634","title":"Energy Efficient Beamforming Design for MISO Non-Orthogonal Multiple Access Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":84,"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":"Engineering and Physical Sciences Research Council","keywords":"Beamforming; Telecommunications link; Mathematical optimization; Computer science; Maximization; Transmitter power output; Spectral efficiency; Efficient energy use; Transmission (telecommunications); Context (archaeology); Noma; WSDMA; Electronic engineering; Mathematics; Precoding; Engineering; Telecommunications; MIMO; Electrical engineering; Transmitter","score_opus":0.0421727387600164,"score_gpt":0.27498525830779985,"score_spread":0.23281251954778345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913563820","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.0037228805,0.00011300914,0.9951428,0.000041573065,0.00001145927,0.000015161809,0.000015609045,0.000035540208,0.00090198516],"genre_scores_gemma":[0.3016796,0.0010359939,0.69346344,0.00011654821,0.00006544299,0.00027354909,0.00013059915,0.000044913453,0.003189878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995023,0.00020048856,0.000027671944,0.00006412853,0.00016417983,0.000041203246],"domain_scores_gemma":[0.9996395,0.00018525861,0.00005559184,0.000023498918,0.00007963407,0.000016454685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917921,0.0010421263,0.00059650844,0.0003904529,0.00025580954,0.0006322176,0.0004063249,0.0005244811,0.0017896465],"category_scores_gemma":[0.0013676534,0.00035181924,0.00037494104,0.0005539633,0.00037202702,0.0005811695,0.0004527973,0.0004676649,0.00068021717],"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.00015335972,0.000049644666,0.0005941777,0.00018136557,0.000045782726,0.0001016619,0.000112802045,0.78499603,0.028307745,0.03245288,0.0013291907,0.15167539],"study_design_scores_gemma":[0.000021284157,0.00010202919,0.00019731738,0.000014411005,0.000011238276,0.00006287084,0.000026065958,0.9859,0.0047890083,0.0071508614,0.0017116113,0.000013339496],"about_ca_topic_score_codex":0.00059031276,"about_ca_topic_score_gemma":0.0011643303,"teacher_disagreement_score":0.0017896465,"about_ca_system_score_codex":0.0003645732,"about_ca_system_score_gemma":0.00061001384,"threshold_uncertainty_score":0.0059869885},"labels":[],"label_agreement":null},{"id":"W2920939123","doi":"10.1109/tcomm.2019.2904258","title":"The Security–Reliability Tradeoff of Multiuser Scheduling-Aided Energy Harvesting Cognitive Radio Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":41,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Southeast University; Natural Science Foundation of Jiangsu Province; China Postdoctoral Science Foundation; Royal Society","keywords":"Computer science; Cognitive radio; Scheduling (production processes); Transmitter; Computer network; Channel (broadcasting); Wireless; Telecommunications; Mathematics; Mathematical optimization","score_opus":0.012512460093844878,"score_gpt":0.2267806518809536,"score_spread":0.2142681917871087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920939123","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.4078066,0.0021096307,0.58155143,0.00064822345,0.000058854,0.00005234803,0.00007740249,0.00016030463,0.0075352886],"genre_scores_gemma":[0.9935315,0.00031578698,0.0056867627,0.000027440952,0.00001894653,0.000014972838,0.000009740541,0.000011521159,0.00038326738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875426,0.00054898375,0.0000370377,0.00012264142,0.000285426,0.00025174514],"domain_scores_gemma":[0.99214864,0.0057651936,0.0009937749,0.00036078467,0.0005746982,0.00015693405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026626165,0.0011667496,0.0008067011,0.00065127504,0.0004604257,0.0012756045,0.0009667221,0.0009783515,0.00065740204],"category_scores_gemma":[0.0088018775,0.00042455626,0.00045424813,0.00080536574,0.0014522922,0.0011133373,0.0011754424,0.000778689,0.00014489761],"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.00017823245,0.000039538165,0.0012636652,0.00007352433,0.00005130701,0.00017655964,0.00012725727,0.9614014,0.009117024,0.020155074,0.00022784693,0.0071884627],"study_design_scores_gemma":[0.0000062789354,0.000068878624,0.00027830235,0.000007768446,0.00001557929,0.000071651266,0.000029462999,0.99304116,0.0013810281,0.0049881977,0.00010079588,0.000010880216],"about_ca_topic_score_codex":0.001428626,"about_ca_topic_score_gemma":0.00092896394,"teacher_disagreement_score":0.0026626165,"about_ca_system_score_codex":0.0013242529,"about_ca_system_score_gemma":0.0007655261,"threshold_uncertainty_score":0.0140814185},"labels":[],"label_agreement":null},{"id":"W2923621805","doi":"10.1109/tcomm.2019.2906232","title":"Fast Successive-Cancellation-Based Decoders of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Sequential decoding; List decoding; Polar code; Algorithm; Latency (audio); Code (set theory); Parallel computing; Reduction (mathematics); Berlekamp–Welch algorithm; Concatenated error correction code; Mathematics; Telecommunications; Block code; Set (abstract data type)","score_opus":0.02210518038164526,"score_gpt":0.283981946344798,"score_spread":0.26187676596315274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923621805","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.0543311,0.00047514343,0.93583345,0.00019183602,0.0001134821,0.00010679828,0.00019398388,0.0017062534,0.0070480253],"genre_scores_gemma":[0.3876799,0.0005918041,0.60366213,0.00020637285,0.00009479111,0.00013847313,0.00047562842,0.00015808565,0.006992755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993874,0.00013167475,0.000040618816,0.00005546451,0.00031399805,0.00007076896],"domain_scores_gemma":[0.9983851,0.00056971953,0.00013462774,0.00020975248,0.0006537712,0.00004712152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071053556,0.0006175169,0.00041254103,0.0011010991,0.00044973454,0.00076070504,0.0006731344,0.00046485267,0.0028149916],"category_scores_gemma":[0.0023620147,0.00029575572,0.000334408,0.0008022464,0.00045893763,0.00093147525,0.0007503151,0.0007606101,0.0011298303],"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.0009784208,0.00011627909,0.0019707305,0.00040297958,0.0000796582,0.00046334235,0.0003332499,0.13079144,0.23592377,0.07660488,0.0057012774,0.5466341],"study_design_scores_gemma":[0.000098042125,0.0003024533,0.0005521805,0.000048861646,0.000035727968,0.00044202572,0.000053184987,0.7022778,0.27177083,0.013021622,0.011340089,0.000057237823],"about_ca_topic_score_codex":0.0024192412,"about_ca_topic_score_gemma":0.004010619,"teacher_disagreement_score":0.0028149916,"about_ca_system_score_codex":0.0006937036,"about_ca_system_score_gemma":0.0016413173,"threshold_uncertainty_score":0.009417057},"labels":[],"label_agreement":null},{"id":"W2923947164","doi":"10.1109/tcomm.2019.2906590","title":"Optimal Energy-Efficient Beamforming Designs for Cloud-RANs With Rate-Dependent Fronthaul Power","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Beamforming; Computer science; Efficient energy use; Mathematical optimization; Cloud computing; Telecommunications link; Reynolds-averaged Navier–Stokes equations; Relaxation (psychology); Transmitter power output; Karush–Kuhn–Tucker conditions; Remote radio head; Optimization problem; Algorithm; Wireless; Mathematics; Cognitive radio; Transmitter; Computer network; Engineering; Telecommunications; Computational fluid dynamics; Electrical engineering","score_opus":0.01710808998195311,"score_gpt":0.23506207642341417,"score_spread":0.21795398644146108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923947164","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.011167122,0.000421226,0.98591214,0.0001247746,0.000030766172,0.000030514644,0.000035529774,0.00007808456,0.0021998356],"genre_scores_gemma":[0.60083866,0.0017928944,0.3926843,0.00018201741,0.000105732506,0.00023971166,0.00018607227,0.00011274784,0.0038577633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.00013241051,0.000011638481,0.00005677937,0.00008997627,0.00006460587],"domain_scores_gemma":[0.9993794,0.00035737816,0.000086583634,0.00003296379,0.0001086773,0.00003496454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085811125,0.0014247267,0.0010409253,0.00032571953,0.00031038377,0.0010701157,0.0008085762,0.00090830884,0.0019581022],"category_scores_gemma":[0.0018074878,0.0005314202,0.0007025111,0.0006554183,0.00067157473,0.0007526281,0.00074040506,0.0011283192,0.0005426575],"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.000051741474,0.000028927676,0.00035264925,0.00009795192,0.00002494152,0.00009478645,0.000034344666,0.96720415,0.0035229665,0.009057663,0.00089849054,0.018631294],"study_design_scores_gemma":[0.0000027663618,0.000015006643,0.000031965603,0.000003945996,0.0000031542838,0.000010816571,0.0000080836035,0.998481,0.0003492556,0.000913031,0.00017853329,0.000002450573],"about_ca_topic_score_codex":0.0038331808,"about_ca_topic_score_gemma":0.0033946468,"teacher_disagreement_score":0.0038331808,"about_ca_system_score_codex":0.0005908332,"about_ca_system_score_gemma":0.0011269372,"threshold_uncertainty_score":0.0076217055},"labels":[],"label_agreement":null},{"id":"W2940469682","doi":"10.1109/tcomm.2019.2913413","title":"Reconfigurable and Traffic-Aware MAC Design for Virtualized Wireless Networks via Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Reinforcement learning; Partition (number theory); Scalability; Network packet; Wireless network; Wireless; Partition problem; Scheme (mathematics); Throughput; Monomial; Distributed computing; Computer network; Machine learning","score_opus":0.02175654600213309,"score_gpt":0.24307007761138175,"score_spread":0.22131353160924866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940469682","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.024991138,0.00014804429,0.9724143,0.00013804878,0.0000347428,0.00003387428,0.000012285569,0.00020430695,0.0020232408],"genre_scores_gemma":[0.9475213,0.00008908704,0.051214937,0.00006727016,0.00002126139,0.00006722674,0.000014893377,0.000022884571,0.0009811488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.00016108633,0.00002281041,0.00013691874,0.00013597624,0.000115257884],"domain_scores_gemma":[0.9990914,0.0004222196,0.00017850142,0.00009578669,0.00014441376,0.00006756238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076492,0.0006657528,0.00069613947,0.00033520823,0.00033506827,0.000899078,0.0014105533,0.0006611352,0.0011814283],"category_scores_gemma":[0.0020544748,0.0002800945,0.00033703118,0.00029273386,0.0010062404,0.0007862685,0.0007879925,0.00095909054,0.00019721435],"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.000058036974,0.000045282814,0.00032705098,0.000032396627,0.000024127603,0.000052984815,0.000039838957,0.9657949,0.004159258,0.011027357,0.00034752963,0.018091125],"study_design_scores_gemma":[0.0000022997397,0.000013902073,0.000018407492,0.000001121565,0.0000018247521,0.0000054634625,0.0000022963297,0.9988116,0.00023634256,0.00083150424,0.00007365005,0.0000015690102],"about_ca_topic_score_codex":0.0018882853,"about_ca_topic_score_gemma":0.0017596503,"teacher_disagreement_score":0.0018882853,"about_ca_system_score_codex":0.0009555985,"about_ca_system_score_gemma":0.0009948787,"threshold_uncertainty_score":0.006933391},"labels":[],"label_agreement":null},{"id":"W2941159701","doi":"10.1109/tcomm.2019.2910811","title":"Optimizing Forward Error Correction Codes for COFDM With Reduced PAPR","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ultra Electronics (Canada); École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Forward error correction; Computer science; Electronic engineering; Error detection and correction; Algorithm; Telecommunications; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.027689305843399556,"score_gpt":0.2721235979389611,"score_spread":0.24443429209556156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941159701","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.12036652,0.00047882262,0.8758544,0.00014570192,0.000027308028,0.00004431862,0.000034448556,0.00016984966,0.002878661],"genre_scores_gemma":[0.6954215,0.00038546103,0.30267847,0.000037414662,0.000015085652,0.000052814128,0.00004698479,0.000039290597,0.0013230356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995378,0.00009871129,0.000012272236,0.000067561436,0.00023791904,0.000045649664],"domain_scores_gemma":[0.99847025,0.00095543964,0.00019352874,0.00007089091,0.00029612935,0.000013783006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639456,0.00043755607,0.00029484523,0.0004150138,0.00024360396,0.00031502338,0.0003085648,0.00043255006,0.0006816705],"category_scores_gemma":[0.0028261205,0.00012830857,0.00024324632,0.00056277856,0.0003666932,0.0003540701,0.00020157824,0.00033973213,0.0001587538],"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.00013573037,0.000121781915,0.0025120745,0.00014164737,0.00004250564,0.00013037834,0.00013458321,0.81638825,0.050807647,0.016824964,0.0006263155,0.11213418],"study_design_scores_gemma":[0.000009498748,0.000053729516,0.0005611375,0.000011572854,0.000010940418,0.00008283135,0.000013241329,0.98513293,0.011739388,0.001621024,0.00075483636,0.0000089074765],"about_ca_topic_score_codex":0.003675139,"about_ca_topic_score_gemma":0.006056402,"teacher_disagreement_score":0.003675139,"about_ca_system_score_codex":0.0007466129,"about_ca_system_score_gemma":0.0013406599,"threshold_uncertainty_score":0.00730747},"labels":[],"label_agreement":null},{"id":"W2946247520","doi":"10.1109/tcomm.2019.2918454","title":"Space–Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decoding methods; Fading; Unavailability; Computer science; Block code; Algorithm; Transmitter; Upper and lower bounds; Polar code; Channel state information; Channel (broadcasting); Topology (electrical circuits); Mathematics; Wireless; Telecommunications; Statistics","score_opus":0.04316566747340052,"score_gpt":0.27858630622439107,"score_spread":0.23542063875099056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946247520","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.010429436,0.000109021385,0.98628366,0.00008616484,0.000012922918,0.000021039077,0.000033721306,0.000043720174,0.0029802702],"genre_scores_gemma":[0.58460027,0.00078015035,0.41155386,0.0001251571,0.00004833968,0.00016170231,0.00014588039,0.0000786454,0.0025060487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997396,0.00009968632,0.000010305753,0.000026960688,0.000094811345,0.000028618111],"domain_scores_gemma":[0.99966085,0.00016269572,0.00005399825,0.000026809425,0.00008061092,0.000015157818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872372,0.0004668841,0.00028855086,0.00028638134,0.00023746879,0.0005628301,0.0002954995,0.0004127983,0.0013139885],"category_scores_gemma":[0.0013898237,0.00018084057,0.00021349349,0.0004893111,0.0004709063,0.00041618335,0.0004899608,0.0005516896,0.0004039638],"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.000119201126,0.000030558163,0.00046578332,0.000106352934,0.000017267454,0.00010312042,0.00014110534,0.7361728,0.037490092,0.14472005,0.0013709065,0.079262815],"study_design_scores_gemma":[0.000008203042,0.00005450366,0.00007041354,0.000012495629,0.0000053857134,0.000045036482,0.000015065635,0.9774006,0.0047377674,0.016037662,0.0016050229,0.000007740856],"about_ca_topic_score_codex":0.0009487917,"about_ca_topic_score_gemma":0.001277615,"teacher_disagreement_score":0.0013139885,"about_ca_system_score_codex":0.00046712984,"about_ca_system_score_gemma":0.0005787555,"threshold_uncertainty_score":0.0043957233},"labels":[],"label_agreement":null},{"id":"W2947605383","doi":"10.1109/tcomm.2019.2919620","title":"Throughput Maximization in Energy Limited Full-Duplex Cognitive Radio Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Throughput; Computer science; Underlay; Transceiver; Interference (communication); MIMO; Electronic engineering; Computer network; Wireless; Signal-to-noise ratio (imaging); Telecommunications; Engineering","score_opus":0.01800218803861843,"score_gpt":0.22939767434334044,"score_spread":0.211395486304722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947605383","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.16861133,0.001063777,0.8216726,0.00030215722,0.000044322565,0.000029224464,0.00010577059,0.0002111821,0.00795958],"genre_scores_gemma":[0.9878864,0.0002694969,0.010667325,0.00004061103,0.000021958522,0.000026602649,0.000019386294,0.000013233651,0.0010549026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926835,0.00033499472,0.000019360523,0.00009261819,0.0001428816,0.0001417563],"domain_scores_gemma":[0.99862206,0.0010008777,0.00013006647,0.000060942617,0.00013400098,0.00005191267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033057,0.00056621636,0.00067239575,0.00037701975,0.0003325212,0.0010720075,0.00067181094,0.00060568564,0.0007112822],"category_scores_gemma":[0.00245824,0.00032293456,0.00027624637,0.0006249535,0.0009083755,0.0010041044,0.00071383076,0.0003558918,0.00012871872],"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.00010123474,0.000039684302,0.00042469706,0.00010483957,0.000042117572,0.0002333366,0.000106313084,0.95708674,0.006578863,0.024424503,0.00060580974,0.010251886],"study_design_scores_gemma":[0.0000069960147,0.000027272872,0.00016709289,0.0000039970732,0.000006642,0.000037892954,0.00002148782,0.9902317,0.00080291985,0.008502993,0.00018562486,0.000005460487],"about_ca_topic_score_codex":0.0014777882,"about_ca_topic_score_gemma":0.0010240669,"teacher_disagreement_score":0.0014777882,"about_ca_system_score_codex":0.000926824,"about_ca_system_score_gemma":0.00059576664,"threshold_uncertainty_score":0.006724596},"labels":[],"label_agreement":null},{"id":"W2949909152","doi":"10.1109/tcomm.2019.2922255","title":"Dual-Band Fading Multiple Access Relay Channels","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"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","keywords":"Relay; Telecommunications link; Computer science; Channel (broadcasting); Fading; Transmission (telecommunications); Microwave; Microwave transmission; Antenna (radio); Telecommunications; Path loss; Transmitter power output; Electronic engineering; Power (physics); Computer network; Physics; Wireless; Engineering; Transmitter","score_opus":0.12645867850581136,"score_gpt":0.3469772734044358,"score_spread":0.22051859489862444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949909152","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.1536671,0.0014111488,0.8211069,0.00046218347,0.00018033685,0.0000798236,0.00040436917,0.0003172692,0.022370912],"genre_scores_gemma":[0.973375,0.0007915795,0.020901073,0.00006708505,0.000071594965,0.00006429922,0.00006814643,0.000012630923,0.0046486566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994529,0.00018694969,0.000014928992,0.000114071,0.000106516156,0.0001246556],"domain_scores_gemma":[0.999276,0.0003035348,0.00012667086,0.00013270664,0.00012346685,0.000037727074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250193,0.00079623243,0.0007080333,0.0003543247,0.00036081357,0.0009792392,0.00084294996,0.0010626612,0.002305532],"category_scores_gemma":[0.001429062,0.00025707652,0.00042704443,0.00059158826,0.00087859563,0.0009306325,0.00087238086,0.0006828542,0.00056911376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042201468,0.00009528054,0.0013184382,0.00020101374,0.000074487245,0.0010690625,0.00019090861,0.6315114,0.029043188,0.3098992,0.0027128835,0.02346217],"study_design_scores_gemma":[0.000027380138,0.00008435043,0.00029772645,0.000010491371,0.000027533422,0.00032125754,0.000042931504,0.97473085,0.0032387648,0.01881059,0.0023812156,0.00002696974],"about_ca_topic_score_codex":0.0011722584,"about_ca_topic_score_gemma":0.0010745253,"teacher_disagreement_score":0.002305532,"about_ca_system_score_codex":0.00061254116,"about_ca_system_score_gemma":0.0003463581,"threshold_uncertainty_score":0.0077127814},"labels":[],"label_agreement":null},{"id":"W2950380080","doi":"10.1109/tcomm.2019.2910258","title":"User-Centric Base-Station Wireless Access Virtualization for Future 5G Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Computer science; Base station; Computer network; Overhead (engineering); Cellular network; Wireless network; Quality of service; Distributed computing; Cluster analysis; Virtualization; Wireless; MIMO; User equipment; Cloud computing; Telecommunications; Channel (broadcasting)","score_opus":0.018138040032396524,"score_gpt":0.2676087776828203,"score_spread":0.2494707376504238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950380080","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.069073975,0.0048117484,0.90951747,0.0011440036,0.00048241141,0.00007950947,0.000047884423,0.0007043003,0.014138683],"genre_scores_gemma":[0.9256043,0.0018702738,0.070474565,0.00020213368,0.00013584716,0.00004293512,0.00006708459,0.000031771793,0.0015711263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997017,0.000107285145,0.000010762665,0.000026401962,0.000090725815,0.00006319094],"domain_scores_gemma":[0.9998203,0.000034137407,0.000019122486,0.000055686964,0.000038065966,0.000032810127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050951843,0.00032407974,0.00017159102,0.0001602809,0.00035977058,0.0009821665,0.0007032268,0.0002943773,0.0008882703],"category_scores_gemma":[0.00057071756,0.00011664584,0.00024931997,0.00024078792,0.0003484712,0.0010433914,0.0007307878,0.0007370829,0.00024121418],"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.00017623886,0.00010241441,0.0029550814,0.00025684846,0.00010128594,0.0004135135,0.00034267845,0.23761784,0.058688324,0.36304826,0.016863355,0.31943426],"study_design_scores_gemma":[0.000014439217,0.00024111333,0.0013655636,0.000050794068,0.000055709486,0.0004362498,0.0002043716,0.87525576,0.013992896,0.048899148,0.059444617,0.000039349336],"about_ca_topic_score_codex":0.0013712699,"about_ca_topic_score_gemma":0.0023186766,"teacher_disagreement_score":0.0013712699,"about_ca_system_score_codex":0.0006096518,"about_ca_system_score_gemma":0.0008503927,"threshold_uncertainty_score":0.0044233203},"labels":[],"label_agreement":null},{"id":"W2950883843","doi":"10.1109/tcomm.2019.2921966","title":"Transmit Antenna Selection in Secure MIMO Systems Over $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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; Concordia University","funders":"","keywords":"Fading; Transmitter; MIMO; Channel state information; Secrecy; Computer science; Channel (broadcasting); Channel capacity; Antenna (radio); Topology (electrical circuits); Upper and lower bounds; Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Wireless; Computer security","score_opus":0.01944448894364269,"score_gpt":0.2558385507497109,"score_spread":0.2363940618060682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950883843","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.3833071,0.0015591424,0.60398763,0.00048538495,0.000061080646,0.000039125927,0.0001773925,0.0002805475,0.0101025],"genre_scores_gemma":[0.9958617,0.00048090285,0.003005643,0.000023731647,0.000025045565,0.000012757132,0.000015004005,0.000007806248,0.00056740403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.0005440644,0.000043374814,0.00012373268,0.00028532444,0.0002997258],"domain_scores_gemma":[0.99534625,0.0034088653,0.0006089929,0.0002290356,0.0003080389,0.00009891781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015896714,0.0010632925,0.0007459522,0.00044753533,0.0006657077,0.0013357768,0.00038739524,0.0006029673,0.00080601446],"category_scores_gemma":[0.005498307,0.00046176472,0.00028397268,0.0008761098,0.0016545501,0.0012398615,0.0008563387,0.0005354558,0.00026936614],"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.00019793512,0.000018733876,0.0018279472,0.000071432594,0.00004008549,0.00041831477,0.00015675498,0.9499995,0.0067757657,0.031593405,0.0003577188,0.008542329],"study_design_scores_gemma":[0.000010107215,0.0000879058,0.0005662496,0.000012880487,0.000020128355,0.0001450378,0.0000620169,0.9883338,0.0026445496,0.007917422,0.00018403973,0.000015810214],"about_ca_topic_score_codex":0.0021890088,"about_ca_topic_score_gemma":0.002148762,"teacher_disagreement_score":0.0021890088,"about_ca_system_score_codex":0.001031766,"about_ca_system_score_gemma":0.0007027019,"threshold_uncertainty_score":0.008407056},"labels":[],"label_agreement":null},{"id":"W2950903284","doi":"10.1109/tcomm.2007.904390","title":"Error Rate Analysis for Coded Multicarrier Systems Over Quasi-Static Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":32,"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":"Orthogonal frequency-division multiplexing; Subcarrier; Bit error rate; Electronic engineering; Computer science; Fading; Interleaving; Rayleigh fading; Spectral efficiency; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.05091493308955023,"score_gpt":0.330373571263112,"score_spread":0.27945863817356176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950903284","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.018573143,0.0012310479,0.97677416,0.00016219431,0.000035602356,0.000028080269,0.00007033574,0.00017645123,0.002948965],"genre_scores_gemma":[0.8714022,0.00495022,0.116129115,0.0001796943,0.00020389953,0.00020600873,0.00028967205,0.00020443693,0.006434649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982961,0.00047569518,0.000066781744,0.0001469233,0.00085076195,0.00016375087],"domain_scores_gemma":[0.9926872,0.0052555855,0.00056318496,0.00042694507,0.0010179947,0.00004915207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027535916,0.0011923624,0.00071831513,0.0013655222,0.00038973257,0.0009574029,0.0008774428,0.0007479178,0.0018712619],"category_scores_gemma":[0.013929121,0.00028834544,0.0004980127,0.0009450021,0.000932999,0.0015993309,0.00072025915,0.0010783657,0.0006063871],"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.00006481416,0.000026348842,0.00070311135,0.00013367526,0.0000349147,0.00012827355,0.00013452557,0.92235374,0.0049153194,0.05415252,0.0005844996,0.016768217],"study_design_scores_gemma":[0.0000017512986,0.000011887826,0.00014721867,0.0000085477295,0.000004661364,0.000037743353,0.000009640506,0.995295,0.00073729124,0.003532458,0.0002081691,0.0000056295244],"about_ca_topic_score_codex":0.004114642,"about_ca_topic_score_gemma":0.0018741917,"teacher_disagreement_score":0.004114642,"about_ca_system_score_codex":0.0014172317,"about_ca_system_score_gemma":0.00094729144,"threshold_uncertainty_score":0.014562547},"labels":[],"label_agreement":null},{"id":"W2951617530","doi":"10.1109/tcomm.2019.2923237","title":"A Relay-Assisted OFDM System for VLC Uplink Transmission","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":48,"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, Okanagan Campus; University of British Columbia","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Telecommunications link; Relay; Computer science; Orthogonal frequency-division multiplexing; Electronic engineering; Visible light communication; Transmission (telecommunications); Multiplexing; Spectral efficiency; Signal-to-noise ratio (imaging); Modulation (music); Power (physics); Computer network; Engineering; Telecommunications; Electrical engineering; Channel (broadcasting); Physics; Light-emitting diode","score_opus":0.025896517779648312,"score_gpt":0.2531809775467217,"score_spread":0.2272844597670734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951617530","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.11913062,0.0013637976,0.8652411,0.00044142798,0.00016893339,0.00018826374,0.00014982594,0.00096711796,0.012348917],"genre_scores_gemma":[0.9330574,0.00030105843,0.06440631,0.00006948296,0.000047451416,0.00007750483,0.000046643807,0.000007654678,0.0019864002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963903,0.00010509828,0.000026034795,0.00009846816,0.00008513488,0.00004632466],"domain_scores_gemma":[0.9996971,0.00008205617,0.000056251563,0.000056861143,0.000087836845,0.00001996254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003761881,0.0005751503,0.0007056355,0.00035024487,0.00080215203,0.0006896667,0.0010555524,0.0007348498,0.0015944017],"category_scores_gemma":[0.0007930638,0.00017405672,0.00031157202,0.00036196926,0.00034776196,0.000717245,0.00055995374,0.0005370268,0.00065285823],"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.0011315423,0.0003674291,0.0034985933,0.00074998505,0.00018528677,0.0020899144,0.0007271088,0.17534935,0.3441277,0.05452264,0.0076976465,0.4095528],"study_design_scores_gemma":[0.000059288996,0.00065832096,0.00041406634,0.00003067029,0.00009874297,0.0010254575,0.00006493799,0.94244134,0.044810344,0.00336679,0.006977445,0.0000525927],"about_ca_topic_score_codex":0.0011558644,"about_ca_topic_score_gemma":0.0015626922,"teacher_disagreement_score":0.0015944017,"about_ca_system_score_codex":0.00052555604,"about_ca_system_score_gemma":0.0005970616,"threshold_uncertainty_score":0.0053337812},"labels":[],"label_agreement":null},{"id":"W2952695922","doi":"10.1109/tcomm.2019.2923226","title":"Cross-Layer Cloud Offloading With Quality of Service Guarantees in Fog-RANs","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Quality of service; Computer network; Linear network coding; Edge device; Radio access network; Microservices; Distributed computing; Base station; Operating system","score_opus":0.08604028554765403,"score_gpt":0.3519697267116657,"score_spread":0.2659294411640117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952695922","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.09998592,0.00078527344,0.89172935,0.00027941912,0.00011877386,0.000119424105,0.00009596006,0.0006273258,0.0062584984],"genre_scores_gemma":[0.9245541,0.00027946386,0.07379299,0.000115451265,0.000028103233,0.00004646343,0.00007654025,0.0000442519,0.0010626506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905497,0.0002664512,0.000029314706,0.00014394347,0.00022397161,0.00028134134],"domain_scores_gemma":[0.998752,0.00063181686,0.00015793214,0.00017178543,0.00019597512,0.000090483554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151704,0.0010774836,0.0010187479,0.00036560255,0.00068070384,0.0011765457,0.0014038567,0.0009302873,0.0010883232],"category_scores_gemma":[0.0026005048,0.00034224792,0.00057364395,0.0006686791,0.0009421773,0.0013391867,0.001492261,0.0010138062,0.0001648718],"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.00016655479,0.00006783521,0.00047731696,0.00007533815,0.00003038808,0.00023811367,0.0000708182,0.950527,0.004480541,0.013071091,0.0014689869,0.029326089],"study_design_scores_gemma":[0.000005305541,0.000022936916,0.00006623365,0.0000037401946,0.000003820097,0.000026079622,0.000017012044,0.99692756,0.0005516414,0.0021514592,0.00022016867,0.0000039260167],"about_ca_topic_score_codex":0.010090068,"about_ca_topic_score_gemma":0.010865265,"teacher_disagreement_score":0.010090068,"about_ca_system_score_codex":0.0011365165,"about_ca_system_score_gemma":0.0016957669,"threshold_uncertainty_score":0.020062625},"labels":[],"label_agreement":null},{"id":"W2953731820","doi":"10.1109/tcomm.2019.2926454","title":"Energy-Efficient Power Allocation Maximization With Mixed Group Sum Power Bound and QoS Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maximization; Mathematical optimization; Computer science; Wireless; Computational complexity theory; Power (physics); Constraint (computer-aided design); Optimization problem; Efficient energy use; Algorithm; Mathematics; Engineering; Electrical engineering","score_opus":0.008504534674429748,"score_gpt":0.20696754954490076,"score_spread":0.19846301487047102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953731820","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.006739684,0.00011351626,0.99124885,0.00007510834,0.000015116574,0.000020415542,0.000022082844,0.000061549195,0.0017036122],"genre_scores_gemma":[0.61656076,0.00035480646,0.37822312,0.00018288534,0.000062968975,0.00026223314,0.00011788208,0.0001106017,0.0041247215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945384,0.00020076966,0.000022148328,0.000093833405,0.00014341902,0.00008596435],"domain_scores_gemma":[0.9995035,0.00032654084,0.000043174052,0.00003665871,0.00006695862,0.000023260154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084310054,0.0011526962,0.0013496347,0.00040332408,0.0004137507,0.00094681984,0.0010293748,0.00089493534,0.002054811],"category_scores_gemma":[0.0020446067,0.0003558938,0.00062812126,0.0011433776,0.000853719,0.001252307,0.0011620086,0.00077325926,0.00038423348],"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.00007102973,0.00003702506,0.00019737089,0.000085143714,0.000025351492,0.000079512596,0.000080920545,0.9418146,0.0028857486,0.025141934,0.0012638298,0.028317435],"study_design_scores_gemma":[0.000007307435,0.000016124548,0.000023495808,0.0000030457013,0.000002741441,0.000018194756,0.000008079597,0.99177814,0.0005510648,0.0073246593,0.00026421924,0.0000029783102],"about_ca_topic_score_codex":0.0013515204,"about_ca_topic_score_gemma":0.0009365879,"teacher_disagreement_score":0.002054811,"about_ca_system_score_codex":0.00059499807,"about_ca_system_score_gemma":0.0008257846,"threshold_uncertainty_score":0.006874025},"labels":[],"label_agreement":null},{"id":"W2962828372","doi":"10.1109/tcomm.2018.2867458","title":"Stochastic Modeling and Analysis of User-Centric Network MIMO Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":34,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Telecommunications link; MIMO; Base station; Computer science; Backhaul (telecommunications); Beamforming; Cluster analysis; Cellular network; Computer network; Channel state information; Duplex (building); Stochastic geometry; Distributed computing; Channel (broadcasting); Telecommunications; Mathematics; Wireless","score_opus":0.023848315059189884,"score_gpt":0.25475568532545223,"score_spread":0.23090737026626235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962828372","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.031830307,0.0004871465,0.9584,0.00045685127,0.000049213286,0.000043483786,0.00034101208,0.00015924058,0.008232657],"genre_scores_gemma":[0.96355593,0.0015892918,0.024539642,0.00017505925,0.00015084878,0.0001692232,0.00038723444,0.000064929634,0.009367809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990121,0.0003198561,0.00003446897,0.00013912618,0.00032587492,0.00016862417],"domain_scores_gemma":[0.99820447,0.0009839754,0.00034091197,0.00010765816,0.00029047503,0.00007248356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012936402,0.0009387289,0.0007936618,0.00056077755,0.00040033946,0.0013136669,0.0011054293,0.0010685134,0.001629208],"category_scores_gemma":[0.0034237355,0.00062528084,0.00049722724,0.0009907046,0.0009028216,0.0011425061,0.00095320656,0.001009545,0.00042064858],"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.000011396622,0.000009062225,0.00039183293,0.000018819192,0.000014712321,0.00005349399,0.00002944523,0.9516304,0.00057705725,0.045264628,0.00038985276,0.0016093686],"study_design_scores_gemma":[0.0000017426872,0.000004706624,0.00014296414,0.0000025624909,0.0000024813453,0.000013700304,0.0000072461853,0.9932405,0.000077881174,0.0062605855,0.00024114674,0.0000045779725],"about_ca_topic_score_codex":0.008906975,"about_ca_topic_score_gemma":0.0049294173,"teacher_disagreement_score":0.008906975,"about_ca_system_score_codex":0.0016946679,"about_ca_system_score_gemma":0.00089727266,"threshold_uncertainty_score":0.017710209},"labels":[],"label_agreement":null},{"id":"W2962835128","doi":"10.1109/tcomm.2016.2591530","title":"BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Converse; Bit error rate; Computer science; Erasure; Physical layer; Algorithm; Binary number; Transmission (telecommunications); Additive white Gaussian noise; Decoding methods; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Channel (broadcasting); Telecommunications; Arithmetic; Wireless; Combinatorics","score_opus":0.04125545553687764,"score_gpt":0.2765831914220022,"score_spread":0.23532773588512457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835128","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.018855825,0.0007454222,0.970051,0.00046073765,0.000104506085,0.000049831182,0.000047975678,0.00023250477,0.009452181],"genre_scores_gemma":[0.8404573,0.0014444236,0.15110391,0.0003999442,0.00023890895,0.00017122057,0.00007653398,0.000092023845,0.0060155857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997303,0.0009031822,0.00012850556,0.00034113688,0.0010210613,0.00030309154],"domain_scores_gemma":[0.9946849,0.002902468,0.0005978094,0.0009222621,0.0007294782,0.0001630501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024863097,0.0017936075,0.0011108689,0.0012684091,0.0008804133,0.00212382,0.0015426954,0.0014216122,0.0019455253],"category_scores_gemma":[0.0076299245,0.0006493541,0.000770029,0.00093538093,0.0036470126,0.00448453,0.0046794256,0.0026580899,0.0007341355],"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.00030187887,0.00011840319,0.0005433203,0.00034362116,0.00009258249,0.0005690056,0.00044533235,0.2314649,0.055180717,0.6563331,0.0017888991,0.052818198],"study_design_scores_gemma":[0.000028668002,0.00022112991,0.0001598241,0.00008859198,0.000045385787,0.0006730887,0.00006553191,0.8346579,0.025730291,0.13534991,0.0028650486,0.00011472124],"about_ca_topic_score_codex":0.00041577627,"about_ca_topic_score_gemma":0.0004947532,"teacher_disagreement_score":0.0024863097,"about_ca_system_score_codex":0.0011910916,"about_ca_system_score_gemma":0.0012421316,"threshold_uncertainty_score":0.013148963},"labels":[],"label_agreement":null},{"id":"W2962991496","doi":"10.1109/tcomm.2017.2732444","title":"Unified Stochastic Geometry Modeling and Analysis of Cellular Networks in LOS/NLOS and Shadowed Fading","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":36,"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; University of Toronto","funders":"","keywords":"Rician fading; Fading; Computer science; Stochastic geometry; Weibull fading; Rayleigh fading; Fading distribution; Moment-generating function; Nakagami distribution; Channel (broadcasting); Cumulative distribution function; Non-line-of-sight propagation; Channel state information; Algorithm; Electronic engineering; Wireless; Topology (electrical circuits); Probability density function; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.02837614367257191,"score_gpt":0.2637484674678252,"score_spread":0.2353723237952533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962991496","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.032480992,0.0014041506,0.95663446,0.0004936931,0.00006561809,0.00004634556,0.00036423447,0.00018300019,0.008327541],"genre_scores_gemma":[0.95762116,0.0031178463,0.033051815,0.00015446031,0.00013801793,0.00014790437,0.00035241962,0.0000759606,0.0053404043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993162,0.00024571415,0.000025210513,0.0000885377,0.00020196059,0.00012236778],"domain_scores_gemma":[0.9991084,0.0004217348,0.00016079034,0.00007196326,0.00019226255,0.000044910328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090897805,0.0010723865,0.00082575466,0.0010369428,0.0004126061,0.0013258562,0.0010721914,0.0008929329,0.0008683963],"category_scores_gemma":[0.0021785258,0.00042456517,0.00085612776,0.0010675706,0.0010041058,0.0010040461,0.0010015883,0.000767084,0.0003083901],"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.00000585396,0.0000041461653,0.00029399595,0.000011386444,0.000007933773,0.000043536493,0.000016123888,0.97328025,0.00040396352,0.024223842,0.00022597479,0.0014829714],"study_design_scores_gemma":[0.0000011553249,0.0000049471664,0.00014338132,0.0000028112427,0.0000034692998,0.000015329913,0.00000784527,0.9952129,0.00008429434,0.004237325,0.00028310335,0.000003445921],"about_ca_topic_score_codex":0.016264249,"about_ca_topic_score_gemma":0.0084362915,"teacher_disagreement_score":0.016264249,"about_ca_system_score_codex":0.0019896359,"about_ca_system_score_gemma":0.0010886602,"threshold_uncertainty_score":0.032339156},"labels":[],"label_agreement":null},{"id":"W2963011891","doi":"10.1109/tcomm.2019.2906307","title":"On the Performance of Network NOMA in Uplink CoMP Systems: A Stochastic Geometry Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":79,"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":"Engineering and Physical Sciences Research Council","keywords":"Noma; Telecommunications link; Base station; Stochastic geometry; Computer science; Spectral efficiency; Computer network; Bandwidth (computing); Transmission (telecommunications); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Engineering; Mathematics; Electrical engineering","score_opus":0.020461792980777865,"score_gpt":0.2244320215318485,"score_spread":0.20397022855107064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963011891","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.028039379,0.0013999402,0.96012914,0.0003406645,0.000108259075,0.00006502756,0.000102983024,0.00025691194,0.009557658],"genre_scores_gemma":[0.92690164,0.0032255047,0.06708558,0.0002144431,0.00027792688,0.00012016543,0.00011645867,0.00008807158,0.00197023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977895,0.0011982913,0.000057156976,0.00022992013,0.00049292576,0.00023212573],"domain_scores_gemma":[0.9960556,0.002543354,0.000461724,0.00030921327,0.0005166834,0.00011337036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002263957,0.0021410997,0.001290965,0.0012794927,0.0009192594,0.0015342839,0.0015941679,0.0009739562,0.001179329],"category_scores_gemma":[0.007644633,0.00080336945,0.00095874607,0.0015242202,0.00213808,0.0016340005,0.0017463404,0.0009518589,0.00045171328],"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.00005443377,0.000024128452,0.00050512893,0.000072412324,0.000034942623,0.00011945928,0.000049792667,0.9592427,0.0016968842,0.029784894,0.000527349,0.007887889],"study_design_scores_gemma":[0.0000031232862,0.00004256475,0.0001531147,0.00000633932,0.0000085696265,0.000056981833,0.000010413307,0.9951989,0.00041816698,0.0037804586,0.00031014174,0.000011170347],"about_ca_topic_score_codex":0.0049079945,"about_ca_topic_score_gemma":0.0037074587,"teacher_disagreement_score":0.0049079945,"about_ca_system_score_codex":0.0022146304,"about_ca_system_score_gemma":0.001402642,"threshold_uncertainty_score":0.01606828},"labels":[],"label_agreement":null},{"id":"W2963160721","doi":"10.1109/tcomm.2018.2859981","title":"Enhancing Cellular Performance Through Device-to-Device Distributed MIMO","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Science and Industry Endowment Fund","keywords":"Cellular network; Telecommunications link; Computer science; Computer network; MIMO; Spectral efficiency; Resource allocation; Cellular communication; Shared resource; Base station; Channel (broadcasting)","score_opus":0.027186157513654025,"score_gpt":0.2664900598111716,"score_spread":0.23930390229751755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963160721","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.19436152,0.0009273694,0.7814923,0.00035598638,0.000082005885,0.00003690958,0.000080806676,0.0005476152,0.022115497],"genre_scores_gemma":[0.98693836,0.00023573895,0.012114243,0.000039133884,0.000017023474,0.0000101649475,0.000013980122,0.0000069977755,0.00062436843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995652,0.00012850211,0.0000121834655,0.000058687023,0.00013053282,0.00010497512],"domain_scores_gemma":[0.99943334,0.00028090968,0.000064885426,0.000097242686,0.00009516952,0.000028318134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040247332,0.0007568128,0.00041682814,0.00022228724,0.000384957,0.00088194385,0.00050177344,0.00046407856,0.00087568007],"category_scores_gemma":[0.001210355,0.00017013842,0.0002152747,0.00045359912,0.0005111938,0.000564707,0.0010007913,0.00038228734,0.00028774046],"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.00016146112,0.00008502466,0.0014577465,0.00010499695,0.00004009212,0.0002516129,0.000083604275,0.849497,0.059372917,0.028080203,0.0012497857,0.059615575],"study_design_scores_gemma":[0.000016359389,0.00012951311,0.00038411946,0.000008050833,0.000024062132,0.00009421479,0.00003936573,0.9823276,0.010831768,0.0048679914,0.0012590097,0.000017925066],"about_ca_topic_score_codex":0.0010451837,"about_ca_topic_score_gemma":0.0016527332,"teacher_disagreement_score":0.0010451837,"about_ca_system_score_codex":0.00062631175,"about_ca_system_score_gemma":0.00043758837,"threshold_uncertainty_score":0.0045441985},"labels":[],"label_agreement":null},{"id":"W2963163286","doi":"10.1109/tcomm.2018.2863377","title":"Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Low-density parity-check code; Algorithm; Binary number; Generator matrix; Logarithm; Mathematics; Upper and lower bounds; Encoder; Estimator; Decoding methods; Computer science; Arithmetic; Statistics","score_opus":0.10097820859671244,"score_gpt":0.3284064398404089,"score_spread":0.22742823124369646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963163286","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.01764854,0.00044153596,0.97824246,0.00039213873,0.00003232395,0.000055701472,0.000054667675,0.00007473817,0.0030579886],"genre_scores_gemma":[0.7029395,0.0011650444,0.2893103,0.0003213168,0.00013508185,0.0003566377,0.00027989745,0.00010549602,0.0053866943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977157,0.00081318914,0.000063774794,0.0002044288,0.00091542513,0.00028746936],"domain_scores_gemma":[0.9947745,0.0035962532,0.0005134315,0.0003649324,0.0006330281,0.00011783443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024137625,0.00072411256,0.0007558269,0.00085101643,0.00058239436,0.0012067695,0.0010596284,0.0009498893,0.0026996392],"category_scores_gemma":[0.013450915,0.0003177065,0.000372024,0.001011979,0.001467539,0.0020105164,0.0015933986,0.0015224795,0.0005178909],"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.00021337594,0.000068818874,0.00094615173,0.00024563028,0.000030511874,0.00016970056,0.00018865085,0.648137,0.005615414,0.27871367,0.0027500014,0.06292103],"study_design_scores_gemma":[0.000019875348,0.000040286963,0.000103314575,0.00001997408,0.000004932102,0.00008533419,0.000025588422,0.9516189,0.0014613016,0.04575164,0.0008567498,0.000012183716],"about_ca_topic_score_codex":0.0014787377,"about_ca_topic_score_gemma":0.0009840445,"teacher_disagreement_score":0.0026996392,"about_ca_system_score_codex":0.0014159124,"about_ca_system_score_gemma":0.0021935261,"threshold_uncertainty_score":0.012765348},"labels":[],"label_agreement":null},{"id":"W2963354877","doi":"10.1109/tcomm.2019.2910265","title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Molecular communication; Symbol (formal); Algorithm; Detector; Intersymbol interference; Fusion center; Computer science; Transmitter; Detection theory; Interference (communication); Binary number; Sequence (biology); Communications system; Mathematics; Telecommunications; Decoding methods; Arithmetic; Wireless; Channel (broadcasting)","score_opus":0.008568695613415892,"score_gpt":0.22582022307120805,"score_spread":0.21725152745779217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963354877","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.007664165,0.00040095855,0.9907419,0.00016139846,0.000024984358,0.000026282652,0.00001535134,0.0001276616,0.00083730073],"genre_scores_gemma":[0.6386482,0.00072950893,0.35728785,0.00026833755,0.00010450096,0.00015614003,0.00008251835,0.000043462227,0.0026795284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984743,0.0006103215,0.00005109555,0.00024507017,0.0005273331,0.000091898684],"domain_scores_gemma":[0.99774975,0.0014490696,0.00025761258,0.00023095812,0.00026423603,0.000048271537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019095533,0.00069440936,0.0008908652,0.0005537162,0.00047997572,0.000902961,0.0014113702,0.0013209417,0.00083761656],"category_scores_gemma":[0.0056760055,0.00039866945,0.0004068402,0.0007286331,0.0014021537,0.0016608783,0.0011500069,0.0011428032,0.0003909628],"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.00033177546,0.00013512383,0.0016233032,0.00042382997,0.000120627374,0.00025906242,0.00038316144,0.6842952,0.03553112,0.10981633,0.0018766823,0.16520385],"study_design_scores_gemma":[0.000013433453,0.000061943276,0.00009158003,0.000007674332,0.000008917437,0.00006342105,0.000010519953,0.98595154,0.0036511582,0.009124362,0.0009999952,0.000015436102],"about_ca_topic_score_codex":0.00078923884,"about_ca_topic_score_gemma":0.0008462802,"teacher_disagreement_score":0.0019095533,"about_ca_system_score_codex":0.001037432,"about_ca_system_score_gemma":0.00090442214,"threshold_uncertainty_score":0.010098815},"labels":[],"label_agreement":null},{"id":"W2963415238","doi":"10.1109/tcomm.2018.2869596","title":"Mixed-ADC/DAC Multipair Massive MIMO Relaying Systems: Performance Analysis and Power Optimization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Beijing Municipal Science and Technology Commission; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Converters; Effective number of bits; Electronic engineering; MIMO; Computer science; Quantization (signal processing); Bandwidth (computing); Power (physics); Engineering; Electrical engineering; Voltage; Algorithm; Beamforming; CMOS; Telecommunications","score_opus":0.04484471352069685,"score_gpt":0.27558948873560074,"score_spread":0.23074477521490389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963415238","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.0559642,0.0022856453,0.9263895,0.00048676445,0.000042852498,0.000057875513,0.00008841692,0.00017072822,0.014513918],"genre_scores_gemma":[0.9196488,0.0018032104,0.07429601,0.00011064047,0.00007881114,0.000078036916,0.00006867059,0.0000378158,0.0038779483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.00028704805,0.000025263926,0.000091554735,0.00020695159,0.00008418176],"domain_scores_gemma":[0.9990602,0.00053416577,0.0001161282,0.00010439828,0.00015933144,0.000025804875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152688,0.0012438187,0.0007178652,0.0003507287,0.00032351236,0.0013871731,0.00074975076,0.0007994868,0.0020816687],"category_scores_gemma":[0.0021358228,0.00040608307,0.0003513649,0.0007933253,0.00071599183,0.0013678774,0.0008635811,0.0006755624,0.0005374144],"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.00011322871,0.00006307646,0.0005095965,0.00020212708,0.00005212533,0.0002410821,0.00009277407,0.8699102,0.01799943,0.073759265,0.0011342699,0.035922863],"study_design_scores_gemma":[0.0000045774636,0.000055774817,0.00011017158,0.000008480213,0.0000105105255,0.00008065492,0.000016864176,0.99086905,0.0020814524,0.0062470585,0.0005067001,0.000008768416],"about_ca_topic_score_codex":0.0008615322,"about_ca_topic_score_gemma":0.0012313249,"teacher_disagreement_score":0.0020816687,"about_ca_system_score_codex":0.00091563904,"about_ca_system_score_gemma":0.0005110579,"threshold_uncertainty_score":0.006963849},"labels":[],"label_agreement":null},{"id":"W2963624992","doi":"10.1109/tcomm.2018.2831222","title":"Framework of Channel Estimation for Hybrid Analog-and-Digital Processing Enabled Massive MIMO Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":17,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Precoding; Channel (broadcasting); MIMO; Computer science; Channel state information; Spatial correlation; Electronic engineering; Radio frequency; Algorithm; Telecommunications; Engineering; Wireless","score_opus":0.028499908156040817,"score_gpt":0.28784022768397516,"score_spread":0.25934031952793435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963624992","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.0025716505,0.0002746063,0.99572194,0.000079378966,0.000021545064,0.000015472782,0.000036499438,0.000048967995,0.0012299457],"genre_scores_gemma":[0.66487217,0.002257496,0.32587406,0.00022840487,0.00029974218,0.00026630567,0.00024948173,0.000056777608,0.0058955094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994143,0.00023402469,0.000019900426,0.00010219746,0.00016576076,0.000063890315],"domain_scores_gemma":[0.99923813,0.00043806696,0.000095855416,0.000068689784,0.00013314783,0.000026065858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095694594,0.0010469815,0.0008657801,0.00051949645,0.00035450718,0.0009551798,0.0010364683,0.00086444477,0.0015979444],"category_scores_gemma":[0.0020367487,0.00041256702,0.0006308844,0.0008408782,0.00090293266,0.001225286,0.001232388,0.0010453436,0.00037240775],"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.000039710743,0.000025733594,0.00027010543,0.000117890995,0.000050659233,0.000120326295,0.00005476713,0.9239316,0.0027914606,0.053363346,0.00067042024,0.018564032],"study_design_scores_gemma":[0.00000452784,0.000022365633,0.000052765023,0.0000047157037,0.000008675592,0.000022089218,0.000007235067,0.99367046,0.0004123939,0.005418291,0.00036856654,0.000007876273],"about_ca_topic_score_codex":0.0035289226,"about_ca_topic_score_gemma":0.0029790762,"teacher_disagreement_score":0.0035289226,"about_ca_system_score_codex":0.00065983844,"about_ca_system_score_gemma":0.0010150659,"threshold_uncertainty_score":0.007016778},"labels":[],"label_agreement":null},{"id":"W2963875807","doi":"10.1109/tcomm.2017.2734768","title":"Dynamic Spectrum Access in Time-Varying Environment: Distributed Learning Beyond Expectation Optimization","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":79,"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":"National Natural Science Foundation of China","keywords":"Computer science; Performance metric; Mathematical optimization; Metric (unit); Q-learning; Nash equilibrium; Quality of service; Ordinal optimization; Potential game; Convergence (economics); Reinforcement learning; Mathematics; Artificial intelligence; Ordinal regression; Machine learning; Computer network","score_opus":0.020409931767824598,"score_gpt":0.2739983472998319,"score_spread":0.25358841553200734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963875807","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.014359123,0.00022341168,0.9838928,0.00021664627,0.000015800986,0.000015759118,0.000009458127,0.00004664595,0.0012203205],"genre_scores_gemma":[0.9378625,0.0004403046,0.05958358,0.0001400394,0.000066696346,0.00009680985,0.0000393728,0.000028860448,0.0017418179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908006,0.00038837854,0.000035887144,0.0002101172,0.00016687457,0.00011874894],"domain_scores_gemma":[0.9971943,0.002138627,0.0002594524,0.00009931529,0.0002003041,0.0001079617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018587313,0.00075744884,0.0013750676,0.00036075097,0.00040794257,0.001166319,0.0011453022,0.0011840103,0.00077492854],"category_scores_gemma":[0.005524925,0.00036505662,0.00061015075,0.00062564743,0.001464598,0.0017711198,0.001327452,0.0013984177,0.00012466335],"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.000043155684,0.000050336068,0.0005100823,0.00004298309,0.00004202833,0.00008231652,0.000048120597,0.95842654,0.0006203881,0.027620269,0.00028694212,0.012226808],"study_design_scores_gemma":[0.0000040842133,0.000012896934,0.000037182064,0.0000015291515,0.00000271065,0.000008959569,0.0000038394724,0.993901,0.00007250898,0.0058791228,0.00007370338,0.0000024224717],"about_ca_topic_score_codex":0.0022084792,"about_ca_topic_score_gemma":0.0012809987,"teacher_disagreement_score":0.0022084792,"about_ca_system_score_codex":0.0009784069,"about_ca_system_score_gemma":0.0008662141,"threshold_uncertainty_score":0.009829998},"labels":[],"label_agreement":null},{"id":"W2963929289","doi":"10.1109/tcomm.2016.2605688","title":"Joint Transceiver Design Algorithms for Multiuser MISO Relay Systems with Energy Harvesting","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":33,"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":"Joint (building); Relay; Transceiver; Energy harvesting; Computer science; Electronic engineering; Energy (signal processing); Algorithm; Wireless; Engineering; Telecommunications; Mathematics; Physics","score_opus":0.06760657515605088,"score_gpt":0.23908669005100272,"score_spread":0.17148011489495185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963929289","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.0031223532,0.00021163389,0.9949058,0.00007118825,0.000014478794,0.000024594989,0.000023401184,0.000070716625,0.001555852],"genre_scores_gemma":[0.58968467,0.0013418663,0.3985649,0.00026479407,0.000106229796,0.0006072371,0.00026136366,0.00015806835,0.009010875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925846,0.0002922243,0.00004086097,0.00015231057,0.00017627438,0.00007986316],"domain_scores_gemma":[0.99877626,0.00076709106,0.00015047521,0.00007232574,0.00019773541,0.000036055826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014487492,0.001666261,0.0012065449,0.0004766908,0.00034472696,0.00144572,0.001051467,0.0012298849,0.0037751105],"category_scores_gemma":[0.0027506577,0.00073872064,0.0008254931,0.0006832129,0.00080219057,0.0012593319,0.0013790191,0.0012751033,0.0011026153],"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.000079564765,0.000049764865,0.00035486388,0.00017000141,0.000060607028,0.00009430626,0.00020606692,0.9118625,0.0035258909,0.033573586,0.0012078029,0.048815027],"study_design_scores_gemma":[0.000010114359,0.00004009255,0.000035284538,0.000007175151,0.000007332686,0.000023750925,0.000015522495,0.9940223,0.0005043075,0.004777474,0.0005494275,0.0000071091636],"about_ca_topic_score_codex":0.0010234412,"about_ca_topic_score_gemma":0.001099275,"teacher_disagreement_score":0.0037751105,"about_ca_system_score_codex":0.0007805322,"about_ca_system_score_gemma":0.0008799654,"threshold_uncertainty_score":0.012629032},"labels":[],"label_agreement":null},{"id":"W2963976549","doi":"10.1109/tcomm.2018.2842758","title":"Hybrid Data-Sharing and Compression Strategy for Downlink Cloud Radio Access Network","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Backhaul (telecommunications); Cloud computing; Computer network; Telecommunications link; Computer science; Radio access network; Data transmission; C-RAN; Base station","score_opus":0.10985973648751568,"score_gpt":0.34576621648552647,"score_spread":0.2359064799980108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963976549","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.34534895,0.0013715102,0.6412869,0.00033165395,0.00007090238,0.00014028915,0.00006910317,0.00013581415,0.01124486],"genre_scores_gemma":[0.9846832,0.00015639234,0.014412815,0.000036550693,0.000018759303,0.00001921417,0.000012314602,0.000006637074,0.00065401144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00009133121,0.000011763985,0.000042487583,0.00010288721,0.00011773115],"domain_scores_gemma":[0.99938464,0.00032645377,0.000085900625,0.00003802377,0.0001121482,0.000052903168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005556107,0.0008209989,0.0005315588,0.00041851072,0.00041004643,0.0006976347,0.00077657046,0.0004160084,0.0011197905],"category_scores_gemma":[0.0012211738,0.00013734312,0.00026586145,0.0005310812,0.0005567515,0.00073781837,0.00051661045,0.00035446,0.000106804124],"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.0002537243,0.0001696311,0.0013755334,0.00010190671,0.000061263185,0.00025071693,0.00008556456,0.89414304,0.02005373,0.020619538,0.000800852,0.062084362],"study_design_scores_gemma":[0.000012037425,0.00011207276,0.00021415354,0.0000045474476,0.000015493564,0.000070591785,0.000027844331,0.9952591,0.0024246569,0.0016493964,0.00020273021,0.000007319452],"about_ca_topic_score_codex":0.0041343374,"about_ca_topic_score_gemma":0.0030743186,"teacher_disagreement_score":0.0041343374,"about_ca_system_score_codex":0.0008806739,"about_ca_system_score_gemma":0.00072699314,"threshold_uncertainty_score":0.008220553},"labels":[],"label_agreement":null},{"id":"W2964028508","doi":"10.1109/tcomm.2017.2710185","title":"Massive Machine Type Communication With Data Aggregation and Resource Scheduling","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":75,"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":"Australian Research Council","keywords":"Scheduling (production processes); Computer science; Data aggregator; Stochastic geometry; Base station; Computer network; Schedule; Channel (broadcasting); Cellular network; Distributed computing; Mathematical optimization; Wireless sensor network; Mathematics","score_opus":0.05930264593296651,"score_gpt":0.3029590654112676,"score_spread":0.24365641947830108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964028508","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.0878911,0.0004627665,0.9050327,0.00030872456,0.00014593668,0.000088553905,0.00013576174,0.00034400713,0.005590469],"genre_scores_gemma":[0.96082276,0.00015185996,0.037687182,0.00006600261,0.000067812616,0.000050295104,0.00005889982,0.000016495935,0.0010787706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990767,0.0003234209,0.000038571645,0.0001637374,0.00020397222,0.0001934759],"domain_scores_gemma":[0.9978815,0.0010794981,0.0003962125,0.00031411363,0.00021809163,0.00011057026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010868091,0.00060218736,0.00084293506,0.0004423555,0.000619789,0.0011189273,0.0010895426,0.0007643335,0.0012991237],"category_scores_gemma":[0.002968779,0.00028619464,0.0005031677,0.001109753,0.0008582196,0.0013291985,0.0009039957,0.0005810274,0.0002360253],"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.0001240663,0.00005121177,0.0009854552,0.000075321164,0.000028218381,0.00037499488,0.00004267204,0.94030523,0.0045640487,0.035767883,0.0014933789,0.016187524],"study_design_scores_gemma":[0.0000057305447,0.00003177783,0.00015666512,0.0000019042346,0.0000035078422,0.000059682898,0.000008873034,0.99488455,0.0005122247,0.0039075045,0.0004222474,0.0000053353147],"about_ca_topic_score_codex":0.0023056418,"about_ca_topic_score_gemma":0.0022319644,"teacher_disagreement_score":0.0023056418,"about_ca_system_score_codex":0.000920044,"about_ca_system_score_gemma":0.000763125,"threshold_uncertainty_score":0.006675422},"labels":[],"label_agreement":null},{"id":"W2965337571","doi":"10.1109/tcomm.2019.2933217","title":"Joint Power Control and User Association for NOMA-Based Full-Duplex Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Telecommunications link; Computer science; Decoding methods; Power control; Mathematical optimization; Relaxation (psychology); Computational complexity theory; Benchmark (surveying); Transmitter power output; Algorithm; Convex optimization; Power (physics); Regular polygon; Mathematics; Computer network; Transmitter","score_opus":0.016680600826656965,"score_gpt":0.23414695849941664,"score_spread":0.21746635767275968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965337571","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.03366346,0.0005808935,0.9624084,0.00019766665,0.000048702106,0.000032707525,0.000036476784,0.00011505146,0.0029166234],"genre_scores_gemma":[0.9229805,0.00030957817,0.07428444,0.0000631797,0.000052897518,0.000060635102,0.000044678876,0.000025700385,0.0021783572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.0005213787,0.00003641336,0.00017244463,0.00025275277,0.00015445473],"domain_scores_gemma":[0.99844176,0.0009999247,0.0001899855,0.0001276208,0.00016927483,0.000071553906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014936514,0.00083422294,0.00089205103,0.00033945515,0.00048018576,0.0011615647,0.00088195904,0.00074492535,0.0012764102],"category_scores_gemma":[0.0037848607,0.0004772348,0.00038394768,0.00066554116,0.0010121694,0.0011552899,0.0010309343,0.00083088345,0.0002515096],"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.00013483649,0.00007731482,0.00036097952,0.00007669004,0.000027179996,0.00006309458,0.00006983214,0.9370079,0.002649651,0.016446488,0.00055602,0.042530064],"study_design_scores_gemma":[0.000006055702,0.000023608785,0.00004436537,0.0000016703906,0.000002204144,0.00001057972,0.0000054768693,0.9972363,0.00030275842,0.0021737076,0.00019024608,0.0000029370192],"about_ca_topic_score_codex":0.002833311,"about_ca_topic_score_gemma":0.0032163556,"teacher_disagreement_score":0.002833311,"about_ca_system_score_codex":0.0007372863,"about_ca_system_score_gemma":0.0014170678,"threshold_uncertainty_score":0.007899284},"labels":[],"label_agreement":null},{"id":"W2965447052","doi":"10.1109/tcomm.2019.2932072","title":"Maximum Likelihood Detection in a Four-Dimensional Stokes-Space Receiver","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Constellation; Symbol (formal); Detection theory; Signal-to-noise ratio (imaging); Phase (matter); Channel (broadcasting); Mathematics; Sequence (biology); Computer science; SIGNAL (programming language); Bit error rate; Monte Carlo method; Statistics; Telecommunications; Physics; Decoding methods; Detector","score_opus":0.015787134971566537,"score_gpt":0.22432012727589598,"score_spread":0.20853299230432945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965447052","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.02129278,0.0001265902,0.9758672,0.00011378942,0.000013003732,0.000026081792,0.000031870863,0.00023653726,0.0022920775],"genre_scores_gemma":[0.37036484,0.00023735121,0.62436503,0.00011147271,0.000025355203,0.0001064767,0.0000957233,0.000037706253,0.004656012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988587,0.00046327605,0.00005042849,0.00010731968,0.0004377766,0.00008245728],"domain_scores_gemma":[0.9988462,0.000692179,0.00014224598,0.000115620904,0.00018015031,0.00002351164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014557767,0.00043056716,0.0006693868,0.00043369722,0.0003922051,0.0012608982,0.0008047988,0.0009336562,0.0010529296],"category_scores_gemma":[0.0024687978,0.00044322544,0.00046823008,0.00056517415,0.0009097661,0.0011164577,0.0008912032,0.0007133173,0.0007023511],"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.00025981863,0.00008308477,0.0019347335,0.00016614205,0.00007457607,0.00037992952,0.00022604951,0.74279106,0.03049827,0.16318478,0.0011546102,0.05924704],"study_design_scores_gemma":[0.000016457125,0.00003304504,0.00009450941,0.000006719733,0.000006787502,0.000088859866,0.0000057953525,0.98295915,0.0064147827,0.00963406,0.00072422845,0.000015507349],"about_ca_topic_score_codex":0.00082648755,"about_ca_topic_score_gemma":0.0008467888,"teacher_disagreement_score":0.0014557767,"about_ca_system_score_codex":0.0007368817,"about_ca_system_score_gemma":0.0008592346,"threshold_uncertainty_score":0.0076990128},"labels":[],"label_agreement":null},{"id":"W2965808107","doi":"10.1109/tcomm.2019.2931972","title":"Robust Energy-Efficient Design for MISO Non-Orthogonal Multiple Access Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base station; Single antenna interference cancellation; Spectral efficiency; Interference (communication); Orthogonal frequency-division multiple access; Algorithm; Cluster analysis; Mathematical optimization; Orthogonal frequency-division multiplexing; Mathematics; Channel (broadcasting); Computer network; Decoding methods","score_opus":0.07363820651431688,"score_gpt":0.27196957154656787,"score_spread":0.198331365032251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965808107","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.010458729,0.00036824733,0.9862855,0.000091565635,0.00003501555,0.000030340738,0.00003436961,0.000105745174,0.0025904851],"genre_scores_gemma":[0.9188936,0.00062894274,0.07738291,0.00011195101,0.000058544043,0.00012955978,0.00006299119,0.000038582417,0.0026929937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892825,0.00033081326,0.000050916235,0.00020279606,0.00036482132,0.00012227526],"domain_scores_gemma":[0.99927276,0.000293548,0.00016828676,0.00005408777,0.00018596282,0.000025389743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823027,0.0013125007,0.0009340148,0.00037519028,0.0003702182,0.0012042904,0.0010091941,0.00077374466,0.0019093087],"category_scores_gemma":[0.0020450281,0.00046518733,0.0005591023,0.0004668572,0.0006989724,0.00069483474,0.0007662424,0.000631239,0.00047687467],"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.00019144359,0.000047856378,0.0004540149,0.00019905614,0.00009157706,0.00014270171,0.00011874675,0.9140562,0.014688965,0.028685799,0.0008131337,0.040510543],"study_design_scores_gemma":[0.000013200413,0.00008025801,0.00010480853,0.00001006362,0.000015555222,0.00002615168,0.000013047047,0.9946733,0.0017535731,0.002650454,0.0006495805,0.0000099667795],"about_ca_topic_score_codex":0.0011180093,"about_ca_topic_score_gemma":0.0011104626,"teacher_disagreement_score":0.0019093087,"about_ca_system_score_codex":0.00066605833,"about_ca_system_score_gemma":0.00059932587,"threshold_uncertainty_score":0.0063872933},"labels":[],"label_agreement":null},{"id":"W2966955883","doi":"10.1109/tcomm.2019.2935728","title":"Energy and Spectral Efficiency Analysis for a Device-to-Device-Enabled Millimeter-Wave OFDMA Cellular Network","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spectral efficiency; Cellular network; Stochastic geometry; Base station; Computer science; Path loss; Interference (communication); Electronic engineering; Efficient energy use; Bandwidth (computing); Transmitter power output; Coverage probability; Topology (electrical circuits); Computer network; Engineering; Mathematics; Electrical engineering; Telecommunications; Beamforming; Wireless; Statistics; Transmitter","score_opus":0.034248492588933706,"score_gpt":0.2414461284680043,"score_spread":0.2071976358790706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966955883","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.17783298,0.001043421,0.8123898,0.00031218884,0.000029367799,0.00004679982,0.000096736774,0.0001701573,0.008078511],"genre_scores_gemma":[0.9806183,0.00055114104,0.017488094,0.00004855152,0.000017002749,0.000035119712,0.000049692415,0.000018826699,0.0011733928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00013761735,0.000017557946,0.000047331556,0.00014386019,0.000080206984],"domain_scores_gemma":[0.9989579,0.000698304,0.00008424334,0.000063163134,0.00017698313,0.000019474279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080612814,0.00054826046,0.0005109736,0.00068617926,0.00033372326,0.0007941505,0.0005502722,0.00045942786,0.00086713734],"category_scores_gemma":[0.002362727,0.00018490017,0.00043864435,0.00080906134,0.00050979364,0.0007842328,0.00063624943,0.0003862127,0.00016385796],"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.000060749186,0.000027806029,0.0011440153,0.000044492805,0.000026010082,0.000089811365,0.00003908678,0.9608258,0.0064702523,0.017396064,0.00031406284,0.013561907],"study_design_scores_gemma":[0.000001027322,0.000024458164,0.00038236717,0.0000030459946,0.000005982178,0.000032422915,0.000012696791,0.99700624,0.0010916453,0.0012870112,0.00014974999,0.0000033350182],"about_ca_topic_score_codex":0.002097606,"about_ca_topic_score_gemma":0.0016804361,"teacher_disagreement_score":0.002097606,"about_ca_system_score_codex":0.0011765469,"about_ca_system_score_gemma":0.0005054202,"threshold_uncertainty_score":0.008536518},"labels":[],"label_agreement":null},{"id":"W2969090546","doi":"10.1109/tcomm.2019.2935714","title":"An Adaptive and Parameter-Free Recurrent Neural Structure for Wireless Channel Prediction","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":60,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Channel state information; Recurrent neural network; Wireless; Machine learning; Artificial neural network; Artificial intelligence; Data mining; Computer network; Telecommunications","score_opus":0.04435555621110145,"score_gpt":0.27633187079983973,"score_spread":0.23197631458873827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969090546","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.01501142,0.00051657716,0.98249453,0.000114071816,0.00007083765,0.000020899528,0.0000611218,0.0005756573,0.0011349112],"genre_scores_gemma":[0.7649743,0.00079751713,0.2298432,0.00016360135,0.00009990282,0.000100501224,0.00034638733,0.00008801658,0.0035864748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975854,0.000055703975,0.000017452607,0.00006438191,0.00007609162,0.000027983495],"domain_scores_gemma":[0.9996244,0.00014271894,0.000044409015,0.00004698729,0.00012763422,0.000013851769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005244426,0.0005868434,0.00051752647,0.00027761405,0.0002341481,0.0002991728,0.001087376,0.00064194784,0.0008618938],"category_scores_gemma":[0.0016918177,0.00030429807,0.00045617303,0.0003861976,0.0003115477,0.00087586907,0.0004329605,0.0008928223,0.00031573718],"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.000100472695,0.00006422304,0.0009915547,0.00008354961,0.00006450428,0.00013872929,0.0000699895,0.77561224,0.013479962,0.0061819614,0.0021676559,0.20104514],"study_design_scores_gemma":[0.0000018198051,0.000011800443,0.000059847916,0.0000022161553,0.0000040795553,0.000013400351,0.000001324938,0.9986682,0.0007016349,0.00038145517,0.0001509512,0.0000032871496],"about_ca_topic_score_codex":0.006100241,"about_ca_topic_score_gemma":0.0073110824,"teacher_disagreement_score":0.006100241,"about_ca_system_score_codex":0.0003705485,"about_ca_system_score_gemma":0.0005830359,"threshold_uncertainty_score":0.012129486},"labels":[],"label_agreement":null},{"id":"W2972189300","doi":"10.1109/tcomm.2019.2939473","title":"Joint Transmission Scheduling and Power Allocation in Non-Orthogonal Multiple Access","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":31,"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":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Telecommunications link; Efficient energy use; Base station; Single antenna interference cancellation; Throughput; Noma; Optimization problem; Heuristic; Multiplexing; Interference (communication); Mathematical optimization; Channel (broadcasting); Computer network; Wireless; Engineering; Algorithm; Telecommunications; Electrical engineering","score_opus":0.027388836741652513,"score_gpt":0.2731394315955342,"score_spread":0.2457505948538817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972189300","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.014057471,0.00055339833,0.983174,0.00010135767,0.000069862894,0.000038954444,0.000020506866,0.00016060383,0.0018238047],"genre_scores_gemma":[0.75033593,0.0008654157,0.24541098,0.00013514174,0.0001727746,0.00017890673,0.000059651873,0.000061074745,0.0027801082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811184,0.000978539,0.00008094726,0.00024706704,0.00036830336,0.00021340312],"domain_scores_gemma":[0.9985555,0.0008046917,0.00024303675,0.00016544198,0.00016994197,0.00006133596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388217,0.0009909671,0.0011428038,0.0005002317,0.0007896222,0.0009547926,0.0009812681,0.00061610073,0.00079428335],"category_scores_gemma":[0.0033272882,0.0006046131,0.00051162473,0.0011208571,0.0009664753,0.0012518622,0.0010383105,0.00083912956,0.00033460604],"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.0001827405,0.00012660613,0.0005038025,0.0001281331,0.00004797889,0.00013594594,0.00013575291,0.8603542,0.0038058304,0.035031952,0.0013705683,0.09817654],"study_design_scores_gemma":[0.000013138,0.000043640153,0.00007962321,0.000004454838,0.000007818833,0.000032691452,0.000012948062,0.99047077,0.0009371789,0.00789971,0.00049160304,0.0000064616115],"about_ca_topic_score_codex":0.0022452788,"about_ca_topic_score_gemma":0.0037176725,"teacher_disagreement_score":0.0022452788,"about_ca_system_score_codex":0.0006297868,"about_ca_system_score_gemma":0.0015321166,"threshold_uncertainty_score":0.0076093078},"labels":[],"label_agreement":null},{"id":"W2980169183","doi":"10.1109/tcomm.2019.2946814","title":"Generalized FFT-Based One-Bit Quantization System for Wideband Spectrum Sensing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantization (signal processing); Fast Fourier transform; Computer science; Wideband; Electronic engineering; Asynchronous communication; False alarm; Algorithm; Telecommunications; Engineering; Artificial intelligence","score_opus":0.034783312886199305,"score_gpt":0.2630398579170746,"score_spread":0.22825654503087534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980169183","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.017786428,0.0003665653,0.97886926,0.00011676556,0.00007089514,0.000042817366,0.00003343278,0.00024317332,0.002470606],"genre_scores_gemma":[0.75039816,0.00034963706,0.24674536,0.00020213364,0.00008120766,0.00007509664,0.000056752775,0.000018830733,0.0020728116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.00016875363,0.00003758141,0.00010683336,0.00017652201,0.000043081916],"domain_scores_gemma":[0.9995622,0.00017601176,0.000054263106,0.00007980946,0.00011146699,0.000016379438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046326462,0.00046712073,0.00043096585,0.00023349021,0.00036828985,0.000613516,0.00064014125,0.00060056447,0.0017650587],"category_scores_gemma":[0.0013617383,0.000120620185,0.00017970831,0.00033469475,0.00043812368,0.0010626935,0.0006181585,0.0006358372,0.0004371052],"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.0007417191,0.0001268559,0.0019043781,0.0004729936,0.00007321412,0.0005151989,0.0004856599,0.19434482,0.20429823,0.11135206,0.0036031548,0.48208168],"study_design_scores_gemma":[0.000038850038,0.000316925,0.0004480583,0.000048587706,0.000038358627,0.00060209207,0.000055574696,0.9491934,0.025480315,0.01803074,0.005704795,0.00004228706],"about_ca_topic_score_codex":0.0006786172,"about_ca_topic_score_gemma":0.0013957756,"teacher_disagreement_score":0.0017650587,"about_ca_system_score_codex":0.0003513073,"about_ca_system_score_gemma":0.00038181787,"threshold_uncertainty_score":0.005904734},"labels":[],"label_agreement":null},{"id":"W2980465753","doi":"10.1109/tcomm.2019.2947441","title":"Bridging the Gap Between MMSE-DFE and Optimal Detection of MIMO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"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","keywords":"MIMO; Computer science; Detector; Minimum mean square error; Algorithm; Computational complexity theory; Equalization (audio); Channel (broadcasting); Metric (unit); Decoding methods; Mathematics; Telecommunications; Engineering","score_opus":0.026824387930059857,"score_gpt":0.25985160676380686,"score_spread":0.233027218833747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980465753","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.0063845897,0.0016305401,0.98944867,0.00028729514,0.000045056044,0.000012770603,0.00001953508,0.0001603288,0.0020112547],"genre_scores_gemma":[0.46365753,0.0024476827,0.53039914,0.0004892889,0.0002469023,0.0000899967,0.00008086662,0.00005984585,0.0025287783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808514,0.00061643036,0.0000910605,0.00025234735,0.0008220604,0.00013304189],"domain_scores_gemma":[0.99679154,0.0025217498,0.00010858853,0.00028451538,0.00025496812,0.000038589114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016105713,0.0007655888,0.0013917821,0.00056291564,0.00042303343,0.0013587853,0.00078493665,0.0015673223,0.001715819],"category_scores_gemma":[0.0075385813,0.0006049665,0.00033946292,0.0005855921,0.0011573882,0.002161139,0.0013786856,0.0012696824,0.0005188845],"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.0005216313,0.00016171772,0.00140911,0.00061173434,0.00014168034,0.00026964713,0.0002591049,0.4250934,0.020601435,0.22080249,0.0030059002,0.32712212],"study_design_scores_gemma":[0.00002550477,0.00009250417,0.00027369085,0.000035407913,0.00001326679,0.00021310858,0.000026134412,0.9534153,0.0076642083,0.03562034,0.002593091,0.000027489374],"about_ca_topic_score_codex":0.00086979254,"about_ca_topic_score_gemma":0.0014895266,"teacher_disagreement_score":0.001715819,"about_ca_system_score_codex":0.000610318,"about_ca_system_score_gemma":0.0013508641,"threshold_uncertainty_score":0.008517623},"labels":[],"label_agreement":null},{"id":"W2981066294","doi":"10.1109/tcomm.2019.2947509","title":"A Game-Theoretic Analysis for Complementary and Substitutable IoT Services Delivery With Externalities","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Stackelberg competition; Computer science; Service provider; Internet of Things; Service (business); Computer network; Backward induction; Game theory; Computer security; Business; Marketing","score_opus":0.016440721435037043,"score_gpt":0.23686351490469432,"score_spread":0.22042279346965726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981066294","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.039856017,0.0007479217,0.908197,0.0017645785,0.00016596825,0.00026129704,0.0003255993,0.00010000097,0.048581615],"genre_scores_gemma":[0.91125965,0.001587846,0.06341584,0.00046133832,0.00020138068,0.00051705644,0.000188594,0.00007492271,0.02229335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998123,0.0008108241,0.000062062325,0.0002536105,0.0003521594,0.00039824707],"domain_scores_gemma":[0.99694437,0.0020594522,0.00029142745,0.000083425875,0.0003537057,0.00026767992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024146251,0.0022818358,0.0016659375,0.0014449292,0.0014476465,0.0031746093,0.0021327608,0.0024798457,0.006584733],"category_scores_gemma":[0.0055551934,0.0009447585,0.0018873124,0.0012862073,0.0028623613,0.004629575,0.002138833,0.0028655205,0.00059784314],"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.000068844594,0.00010279409,0.00037994894,0.00014513041,0.00007624888,0.00039046028,0.00020697547,0.39973244,0.0016923362,0.58943504,0.002548012,0.0052217455],"study_design_scores_gemma":[0.000027446205,0.00005406038,0.00017103845,0.00002688641,0.000034199336,0.000079463156,0.0000931006,0.8505542,0.00019809857,0.14700294,0.001727414,0.000031219253],"about_ca_topic_score_codex":0.010177783,"about_ca_topic_score_gemma":0.005980775,"teacher_disagreement_score":0.010177783,"about_ca_system_score_codex":0.0055307546,"about_ca_system_score_gemma":0.0034926778,"threshold_uncertainty_score":0.04012865},"labels":[],"label_agreement":null},{"id":"W2985618070","doi":"10.1109/tcomm.2019.2953601","title":"Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Computer science; Trapping; Algorithm; Theoretical computer science; Decoding methods; Biology","score_opus":0.017633620423915405,"score_gpt":0.27141470426903447,"score_spread":0.25378108384511905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985618070","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.12681618,0.00022759625,0.86807483,0.00014193916,0.000025019774,0.00011471061,0.00013277419,0.00059868535,0.003868243],"genre_scores_gemma":[0.5551936,0.00025537316,0.44207254,0.000082456034,0.00000981856,0.00017839434,0.00018321481,0.000069720794,0.0019549234],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.00004022835,0.000013207228,0.000032511613,0.00009807448,0.00003071101],"domain_scores_gemma":[0.9994708,0.00013578768,0.00011960625,0.00009349253,0.00014985926,0.00003041389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021904676,0.000327913,0.00030800048,0.00045257658,0.00026521992,0.00037770867,0.0005257682,0.00028128485,0.00055168144],"category_scores_gemma":[0.00071301655,0.00025038244,0.0002637503,0.00046287486,0.0004266863,0.00028822807,0.0004179842,0.00038884432,0.0002168019],"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.00017581107,0.00014287165,0.002364422,0.0004777318,0.00006686261,0.0004026544,0.00027781734,0.26205158,0.5043836,0.09267156,0.0018004118,0.1351846],"study_design_scores_gemma":[0.00006163946,0.00020595493,0.00065468263,0.000027388862,0.000030343579,0.0003406722,0.000025632298,0.8322357,0.15331246,0.0075305225,0.005538988,0.000036049496],"about_ca_topic_score_codex":0.0010422221,"about_ca_topic_score_gemma":0.0015732283,"teacher_disagreement_score":0.0010422221,"about_ca_system_score_codex":0.00056551304,"about_ca_system_score_gemma":0.001135966,"threshold_uncertainty_score":0.004103124},"labels":[],"label_agreement":null},{"id":"W2987600525","doi":"10.1109/tcomm.2019.2952135","title":"Monte-Carlo Integration Models for Multiple Scattering Based Optical Wireless Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monte Carlo method; Monte Carlo integration; Dynamic Monte Carlo method; Monte Carlo molecular modeling; Quasi-Monte Carlo method; Monte Carlo method in statistical physics; Computer science; Importance sampling; Hybrid Monte Carlo; Computation; Quantum Monte Carlo; Statistical physics; Impulse response; Physics; Markov chain Monte Carlo; Algorithm; Mathematics; Statistics; Mathematical analysis","score_opus":0.03525249529567703,"score_gpt":0.250834295183948,"score_spread":0.21558179988827098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987600525","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.011668414,0.0005041156,0.9841584,0.00016060128,0.000052113453,0.00004255226,0.000031771728,0.00014584181,0.003236159],"genre_scores_gemma":[0.7942595,0.0013998635,0.19478802,0.0002155445,0.000103618804,0.0003552779,0.00024001303,0.00017048308,0.008467669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991773,0.00028554196,0.000029345987,0.000084015985,0.00032421938,0.000099678815],"domain_scores_gemma":[0.9981521,0.0012563226,0.00013957347,0.00011066451,0.00028352544,0.000057782043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011854362,0.0007628804,0.0009826486,0.00070824247,0.000760489,0.000982642,0.0014264726,0.0010195416,0.0027318373],"category_scores_gemma":[0.003713826,0.0005084666,0.0010210264,0.0010487125,0.000909656,0.0016613939,0.00065740483,0.0014879155,0.00037243153],"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.000018807123,0.000015326668,0.0004234788,0.000026185064,0.000014754984,0.000048572874,0.000025091196,0.95407957,0.00045593912,0.039033093,0.0002933429,0.0055658813],"study_design_scores_gemma":[0.000001243649,0.0000032062158,0.000028160359,0.0000019255513,0.0000024336812,0.000010631779,0.00000216395,0.9967733,0.00009956663,0.0028903757,0.00018426152,0.0000026554999],"about_ca_topic_score_codex":0.010015471,"about_ca_topic_score_gemma":0.0058612716,"teacher_disagreement_score":0.010015471,"about_ca_system_score_codex":0.0015421375,"about_ca_system_score_gemma":0.0012402501,"threshold_uncertainty_score":0.019914329},"labels":[],"label_agreement":null},{"id":"W2990652809","doi":"10.1109/tcomm.2020.2978189","title":"Rate Analysis of Cell-Free Massive MIMO-NOMA With Three Linear Precoders","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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 Alberta","funders":"","keywords":"Precoding; MIMO; Rayleigh fading; Computer science; Spectral efficiency; Interference (communication); Single antenna interference cancellation; Imperfect; Noma; Algorithm; Mathematics; Topology (electrical circuits); Fading; Telecommunications; Beamforming; Decoding methods; Telecommunications link; Channel (broadcasting)","score_opus":0.0378847861004028,"score_gpt":0.26216948047485106,"score_spread":0.22428469437444826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990652809","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.23023386,0.004020382,0.722478,0.00089875027,0.0001486453,0.00021111671,0.0010093941,0.00087322254,0.040126618],"genre_scores_gemma":[0.9738931,0.0009797257,0.020638375,0.00011641419,0.00007796152,0.000118874974,0.000264827,0.00006946717,0.0038412088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863666,0.00045809575,0.00004681738,0.00012387762,0.00040357315,0.00033102275],"domain_scores_gemma":[0.99534166,0.0028826387,0.00045569162,0.00040008384,0.0007922605,0.000127647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020858184,0.0017430427,0.00093736016,0.0008631837,0.0006562709,0.0015777496,0.0014221043,0.00090088864,0.0029119097],"category_scores_gemma":[0.0056099165,0.00044275034,0.00081680267,0.001076674,0.0013558626,0.0011589768,0.0017679099,0.0009154297,0.00078494154],"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.00026095947,0.000053324467,0.0021058854,0.00019674278,0.00010971856,0.00046748787,0.00018043908,0.9359898,0.0091605745,0.039039668,0.0015263372,0.010909166],"study_design_scores_gemma":[0.000009962628,0.00005600369,0.0006210124,0.000014408789,0.000029207464,0.00017981649,0.000047054127,0.9934778,0.0015308536,0.0036697169,0.00034499174,0.000019081446],"about_ca_topic_score_codex":0.005348423,"about_ca_topic_score_gemma":0.0033461,"teacher_disagreement_score":0.005348423,"about_ca_system_score_codex":0.0013587278,"about_ca_system_score_gemma":0.0011411557,"threshold_uncertainty_score":0.011030972},"labels":[],"label_agreement":null},{"id":"W2991461063","doi":"10.1109/tcomm.2019.2955965","title":"Performance of Multi-Cell Massive MIMO Systems With Interference Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MIMO; Decoding methods; Interference (communication); Computer science; Electronic engineering; Single antenna interference cancellation; 3G MIMO; Telecommunications; Engineering; Beamforming; Channel (broadcasting)","score_opus":0.02133082664781102,"score_gpt":0.23477631723181425,"score_spread":0.21344549058400322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991461063","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.81361264,0.0015247795,0.16895321,0.0004829274,0.00010656098,0.000060409577,0.00027208237,0.00035257588,0.014634848],"genre_scores_gemma":[0.9963814,0.00013227352,0.003071016,0.000030382345,0.000013869782,0.000009612963,0.00002884322,0.0000067314154,0.00032577987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846965,0.0006046671,0.000058452544,0.00013258387,0.00034081412,0.00039386013],"domain_scores_gemma":[0.9941287,0.0037339758,0.0006444616,0.00037677164,0.00086587504,0.00025026352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020108838,0.0012788561,0.0011197409,0.00049232406,0.0007225568,0.0014726333,0.00076329627,0.0011630993,0.00094706164],"category_scores_gemma":[0.0053396486,0.00034209658,0.00046356898,0.00083346176,0.0014466826,0.0010140602,0.0016600704,0.0007278104,0.00018106832],"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.00029721268,0.000041435018,0.0015588492,0.000055419852,0.00005349346,0.00015521019,0.00006128477,0.9863579,0.003985075,0.0037404408,0.00015905841,0.003534586],"study_design_scores_gemma":[0.000015726859,0.00012275986,0.00047248797,0.0000071867044,0.000017942455,0.000050722934,0.000035142653,0.99643123,0.0018004626,0.0009721984,0.00005951295,0.000014688711],"about_ca_topic_score_codex":0.006323137,"about_ca_topic_score_gemma":0.003394147,"teacher_disagreement_score":0.006323137,"about_ca_system_score_codex":0.0011454931,"about_ca_system_score_gemma":0.0010604176,"threshold_uncertainty_score":0.012572646},"labels":[],"label_agreement":null},{"id":"W2992716901","doi":"10.1109/tcomm.2019.2957482","title":"Towards Optimal Power Control via Ensembling Deep Neural Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":279,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Power control; Artificial neural network; Channel state information; Fading; Generalization; Channel (broadcasting); Power (physics); Additive white Gaussian noise; Computational complexity theory; Interference (communication); Artificial intelligence; Machine learning; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.023973619432550834,"score_gpt":0.2596625151970172,"score_spread":0.2356888957644664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992716901","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.014459737,0.00028905328,0.9822097,0.00016282973,0.000039782237,0.000024851557,0.000027119399,0.00044218884,0.0023447424],"genre_scores_gemma":[0.82181793,0.00025736226,0.17296894,0.0003013444,0.00008765057,0.00012916548,0.000121172874,0.00012894456,0.0041873427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00008750647,0.000014399893,0.00007918484,0.000073457275,0.00004877199],"domain_scores_gemma":[0.99926704,0.0004221974,0.00006785841,0.000060347094,0.0001461143,0.000036356643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010624678,0.0012551999,0.0009837066,0.00041146038,0.0003274316,0.00073778705,0.0013839963,0.001052534,0.0016137487],"category_scores_gemma":[0.0027545465,0.000592182,0.00037558965,0.0003919037,0.00093223306,0.0010646675,0.0011450028,0.0015260595,0.0002702719],"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.00002922042,0.000021102514,0.00020257379,0.000020711175,0.00001785878,0.00002335423,0.000018405166,0.96700513,0.0009178879,0.0045615174,0.00060591614,0.026576394],"study_design_scores_gemma":[0.0000019697234,0.0000050754097,0.000011031296,0.0000015422277,0.0000012545997,0.0000023648336,8.4867315e-7,0.99840075,0.00013697943,0.0013714811,0.00006576809,9.251694e-7],"about_ca_topic_score_codex":0.0045756516,"about_ca_topic_score_gemma":0.006697852,"teacher_disagreement_score":0.0045756516,"about_ca_system_score_codex":0.00092034036,"about_ca_system_score_gemma":0.0011031643,"threshold_uncertainty_score":0.009097993},"labels":[],"label_agreement":null},{"id":"W2993252065","doi":"10.1109/tcomm.2019.2957767","title":"Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":37,"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, Okanagan Campus; University of British Columbia","funders":"Natural Science Basic Research Program of Shaanxi Province; Key Research and Development Projects of Shaanxi Province; National Science and Technology Major Project; National Mobile Communications Research Laboratory, Southeast University; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Telecommunications link; Random access; Multiplexing; Optimization problem; Computer network; Particle swarm optimization; Noma; Distributed computing; Algorithm; Wireless; Telecommunications","score_opus":0.026604280658252388,"score_gpt":0.30028973601207637,"score_spread":0.273685455353824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993252065","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.017410811,0.00060940854,0.9785825,0.00018451034,0.00008878065,0.00005406317,0.000030635078,0.0003733113,0.0026659863],"genre_scores_gemma":[0.90177006,0.0006612604,0.09506564,0.00017135496,0.00010787329,0.00017541836,0.00007607624,0.0000364722,0.0019360075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990382,0.00039114812,0.000051984105,0.00014505009,0.0002577436,0.000115936426],"domain_scores_gemma":[0.99891543,0.00042525053,0.00023724293,0.00014548526,0.00022346288,0.0000530782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010409832,0.0008014354,0.00066751736,0.00058935874,0.00061856216,0.0007442243,0.0014867292,0.0006600451,0.0009843704],"category_scores_gemma":[0.0023379037,0.00020746708,0.00052115374,0.0008029279,0.0006755328,0.00095921935,0.00092801295,0.00091445766,0.00032046964],"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.0005458529,0.00025264354,0.001149203,0.0003810826,0.00013113194,0.00077554706,0.0003146113,0.63368475,0.062656306,0.1127455,0.006469636,0.18089369],"study_design_scores_gemma":[0.000025293402,0.00011311202,0.00011341425,0.0000070660644,0.000018133047,0.00015402684,0.000010055936,0.9916917,0.0020493472,0.0046132654,0.0011855707,0.00001896409],"about_ca_topic_score_codex":0.0011071127,"about_ca_topic_score_gemma":0.0015932362,"teacher_disagreement_score":0.0014867292,"about_ca_system_score_codex":0.0007855993,"about_ca_system_score_gemma":0.0008087916,"threshold_uncertainty_score":0.005699992},"labels":[],"label_agreement":null},{"id":"W2995050929","doi":"10.1109/tcomm.2019.2960334","title":"Semi-Blind Interference Aligned NOMA for Downlink MU-MISO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Telecommunications link; Beamforming; Computer science; Interference (communication); Channel state information; Transmitter; Transmitter power output; Transmission (telecommunications); Power (physics); Channel (broadcasting); Topology (electrical circuits); Electronic engineering; Mathematical optimization; Telecommunications; Mathematics; Wireless; Engineering; Physics","score_opus":0.034341747560174246,"score_gpt":0.2738842251243106,"score_spread":0.23954247756413635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995050929","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.016483631,0.0006640074,0.9803242,0.000089701214,0.00005234666,0.000035673394,0.00003948862,0.00015014979,0.002160742],"genre_scores_gemma":[0.8283039,0.0012355038,0.16731231,0.00011532664,0.00010837273,0.00014299527,0.000057905818,0.00003463794,0.0026889981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992099,0.00041004297,0.000027264196,0.00007251623,0.00019588423,0.00008443626],"domain_scores_gemma":[0.99922013,0.00041168305,0.00013048973,0.000072580144,0.00012284532,0.000042365835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094088784,0.0009215548,0.0006751607,0.00043710644,0.000729698,0.00090114656,0.0005153143,0.00056391204,0.0011478738],"category_scores_gemma":[0.0023491704,0.00042439523,0.0005066912,0.00072925305,0.00074930827,0.0007885995,0.0007548095,0.0006832754,0.0005012536],"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.00028555767,0.00009341647,0.0007710366,0.00030177156,0.0000724048,0.00020015605,0.00020470963,0.86156535,0.020606115,0.04533819,0.0017738644,0.06878741],"study_design_scores_gemma":[0.0000076158776,0.00007992945,0.00013336798,0.000010553934,0.000010612796,0.000064301115,0.000030198695,0.9917366,0.002300386,0.0048613464,0.0007502064,0.0000149139805],"about_ca_topic_score_codex":0.0014554267,"about_ca_topic_score_gemma":0.0028781565,"teacher_disagreement_score":0.0014554267,"about_ca_system_score_codex":0.0006069894,"about_ca_system_score_gemma":0.0010880444,"threshold_uncertainty_score":0.0049759746},"labels":[],"label_agreement":null},{"id":"W2995549874","doi":"10.1109/tcomm.2019.2960345","title":"Secrecy-Enhancing Design for Cooperative Downlink and Uplink NOMA With an Untrusted Relay","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":103,"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":"Engineering and Physical Sciences Research Council","keywords":"Telecommunications link; Relay; Secrecy; Jamming; Computer network; Computer science; Eavesdropping; Noma; Electronic engineering; Engineering; Power (physics); Computer security","score_opus":0.027853277842877104,"score_gpt":0.25839726341204805,"score_spread":0.23054398556917094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995549874","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.028975097,0.0003613034,0.9649379,0.00017240437,0.00003358846,0.0000424351,0.000028947221,0.000095354946,0.0053527956],"genre_scores_gemma":[0.92804015,0.00048213187,0.06915984,0.00008710674,0.00006162348,0.00009712595,0.000021893129,0.000022561911,0.0020275624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837947,0.0006916409,0.000072639385,0.0002474146,0.00043356084,0.00017531529],"domain_scores_gemma":[0.9980186,0.0007113737,0.0004979069,0.00027020558,0.00042899704,0.00007288913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013222824,0.001140683,0.00066644856,0.00045199477,0.00058085134,0.0011011164,0.0010203866,0.00082032004,0.0013732499],"category_scores_gemma":[0.0030797294,0.00046846265,0.000595438,0.0005973129,0.0011771752,0.0012281511,0.0013587375,0.0007478876,0.0005510705],"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.00027410383,0.000100119454,0.0011372628,0.000257783,0.00011641816,0.0005112441,0.0004790969,0.82490134,0.05568551,0.075915836,0.0010665378,0.0395548],"study_design_scores_gemma":[0.000013007582,0.00019689332,0.00015174293,0.000013577208,0.00003279325,0.00016022909,0.000035250534,0.9864579,0.006614022,0.005318587,0.0009889345,0.000017078492],"about_ca_topic_score_codex":0.000707225,"about_ca_topic_score_gemma":0.0007618157,"teacher_disagreement_score":0.0013732499,"about_ca_system_score_codex":0.00074181444,"about_ca_system_score_gemma":0.00079141953,"threshold_uncertainty_score":0.0069929957},"labels":[],"label_agreement":null},{"id":"W2998239782","doi":"10.1109/tcomm.2019.2962397","title":"Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Complete bipartite graph; Algorithm; Graph; Discrete mathematics; Mathematics; Computer science","score_opus":0.02737860117143568,"score_gpt":0.2921835513328338,"score_spread":0.2648049501613981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998239782","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.017418344,0.0008598768,0.9744932,0.0010238105,0.00015626656,0.00035263636,0.00037599463,0.001543399,0.0037764178],"genre_scores_gemma":[0.12571612,0.0013042792,0.8641293,0.0007283046,0.0004135252,0.00075170083,0.001577998,0.00063943514,0.0047393064],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966389,0.0007671391,0.00025261255,0.0008089447,0.0011443121,0.00038804338],"domain_scores_gemma":[0.9928532,0.0040814783,0.00050059234,0.0014541582,0.00081728573,0.00029329275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706641,0.0019353889,0.001768765,0.0034262843,0.0018990013,0.0025334612,0.0031824186,0.0021392533,0.005857742],"category_scores_gemma":[0.007974204,0.0010473551,0.0026798144,0.0033982866,0.0016398989,0.008928562,0.0032718487,0.0030402362,0.0017188026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009698229,0.0007387152,0.004207856,0.0017260535,0.00036517126,0.00050008524,0.0006965612,0.09045961,0.037284493,0.19022329,0.031157538,0.6416708],"study_design_scores_gemma":[0.0002472574,0.00032996535,0.0014171907,0.00013954539,0.00019036884,0.0012831872,0.00026180502,0.63132304,0.016414665,0.32849514,0.019725231,0.00017245892],"about_ca_topic_score_codex":0.0026952685,"about_ca_topic_score_gemma":0.002511583,"teacher_disagreement_score":0.005857742,"about_ca_system_score_codex":0.0014749757,"about_ca_system_score_gemma":0.0021240402,"threshold_uncertainty_score":0.0195961},"labels":[],"label_agreement":null},{"id":"W3000708128","doi":"10.1109/tcomm.2020.2965451","title":"Adaptive Trust Management for Soft Authentication and Progressive Authorization Relying on Physical Layer Attributes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Access Control and Trust","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Authentication (law); Physical layer; Robustness (evolution); Transmitter; Computer network; Computer security; Wireless; Message authentication code; Cryptography; Channel (broadcasting); Telecommunications","score_opus":0.10754168945309621,"score_gpt":0.35708106686571506,"score_spread":0.24953937741261883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000708128","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.061202005,0.00014829039,0.9360305,0.00019819032,0.000058119498,0.00008889064,0.000027112781,0.0005108489,0.001735991],"genre_scores_gemma":[0.97848254,0.000045879704,0.020513449,0.000032669202,0.000021256268,0.000031130596,0.000020295527,0.000011114224,0.00084168604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774677,0.0005616659,0.00019354165,0.0005222247,0.00066537404,0.0003103986],"domain_scores_gemma":[0.9971398,0.0007396525,0.0005580566,0.0007182857,0.00060197525,0.00024225513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015089335,0.0005492972,0.0006216641,0.00046802752,0.00088215194,0.0011296468,0.001282783,0.0006786214,0.0010476181],"category_scores_gemma":[0.006086498,0.00020508275,0.00045447293,0.00047377034,0.0011625888,0.0028585452,0.0019990753,0.0011519036,0.00032054356],"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.0010771502,0.0003454364,0.011673915,0.00024143983,0.0001607922,0.0009799459,0.0013778491,0.4071422,0.09965972,0.11172819,0.0044737845,0.3611396],"study_design_scores_gemma":[0.000025693002,0.00011423714,0.0008243921,0.000007854965,0.000027471167,0.00017512744,0.00006163519,0.9805715,0.0069284695,0.010115991,0.0011160047,0.000031537325],"about_ca_topic_score_codex":0.0022145503,"about_ca_topic_score_gemma":0.0016232582,"teacher_disagreement_score":0.0022145503,"about_ca_system_score_codex":0.0009838289,"about_ca_system_score_gemma":0.0011102051,"threshold_uncertainty_score":0.007980108},"labels":[],"label_agreement":null},{"id":"W3001462167","doi":"10.1109/tcomm.2020.2968907","title":"Dynamic Flow Migration for Embedded Services in SDN/NFV-Enabled 5G Core Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Quality of service; Software-defined networking; Integer programming; Distributed computing; Multi-commodity flow problem; Control reconfiguration; Computer network; Heuristic; Provisioning; Mathematical optimization; Flow network; Algorithm","score_opus":0.03483660970441744,"score_gpt":0.27321670426134753,"score_spread":0.2383800945569301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001462167","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.21202946,0.00075759867,0.78132933,0.0006031178,0.00012023916,0.000107375294,0.0000721522,0.00025539225,0.0047253226],"genre_scores_gemma":[0.92836225,0.00023338397,0.06980574,0.00007513575,0.00002097621,0.000049722166,0.00007342835,0.00002758657,0.001351673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.00009532765,0.000008499207,0.000051397168,0.000036407313,0.00008353259],"domain_scores_gemma":[0.99974006,0.00013399986,0.00003946737,0.00001606791,0.00003813078,0.000032290205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070883497,0.0006678143,0.0004670891,0.00033005455,0.0005816851,0.00064389757,0.0006158861,0.00064796617,0.0010222163],"category_scores_gemma":[0.0010067722,0.00023173128,0.00032594134,0.0004030404,0.00042048402,0.00077681284,0.00063695805,0.00050294877,0.00007781165],"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.00007511519,0.00005661244,0.0004892402,0.00003254748,0.000008665668,0.00008620964,0.00003565721,0.96225566,0.0030977882,0.0049189683,0.000641548,0.028302068],"study_design_scores_gemma":[0.000002681219,0.000014697342,0.000055430013,0.000001856663,0.0000016855157,0.000008762418,0.000014419337,0.9981173,0.00033251318,0.0012291502,0.00021978658,0.0000017580762],"about_ca_topic_score_codex":0.0057680435,"about_ca_topic_score_gemma":0.0061062607,"teacher_disagreement_score":0.0057680435,"about_ca_system_score_codex":0.0012301093,"about_ca_system_score_gemma":0.0009199038,"threshold_uncertainty_score":0.011468887},"labels":[],"label_agreement":null},{"id":"W3003598188","doi":"10.1109/tcomm.2020.2970058","title":"Enhanced Fairness and Scalability of Power Control Schemes in Multi-Cell Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"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":"Stiftelsen för Strategisk Forskning","keywords":"Scalability; MIMO; Computer science; Power control; Transmitter power output; Convex optimization; Max-min fairness; Optimization problem; Power (physics); Channel (broadcasting); Scheme (mathematics); Spectral efficiency; Mathematical optimization; Fairness measure; Distributed computing; Computer network; Regular polygon; Throughput; Wireless; Algorithm; Resource allocation; Mathematics; Telecommunications","score_opus":0.020502040759090515,"score_gpt":0.25071203277559273,"score_spread":0.23020999201650222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003598188","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.050108608,0.001109149,0.940938,0.0005223294,0.0001740589,0.00006602065,0.00006240857,0.00025612026,0.0067633777],"genre_scores_gemma":[0.97560084,0.00032254055,0.022521779,0.000119513374,0.00013233945,0.000042270774,0.000015475865,0.000030430358,0.0012148798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.00057878403,0.00005422653,0.00027258293,0.0004981317,0.00026024366],"domain_scores_gemma":[0.99509615,0.0035084912,0.00039353204,0.0003908555,0.00046573274,0.00014533509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251785,0.0010067995,0.0009920534,0.00039107594,0.0006698313,0.0012505424,0.0013020092,0.0008798984,0.0014187428],"category_scores_gemma":[0.008938969,0.00030356902,0.00046644127,0.0006542927,0.001492445,0.0020397652,0.0014414974,0.0014299537,0.00018637747],"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.00014875937,0.000066693196,0.0005637418,0.000088123896,0.000031545304,0.00018939677,0.000083082596,0.9295321,0.0064675584,0.037884668,0.00083309953,0.024111249],"study_design_scores_gemma":[0.000008364884,0.000047212834,0.00010420015,0.0000047821577,0.0000057773013,0.000035667934,0.000011997214,0.9904587,0.00075870944,0.008298312,0.00025905741,0.0000071244017],"about_ca_topic_score_codex":0.0016457033,"about_ca_topic_score_gemma":0.0012374659,"teacher_disagreement_score":0.003251785,"about_ca_system_score_codex":0.0012117616,"about_ca_system_score_gemma":0.000901707,"threshold_uncertainty_score":0.01719731},"labels":[],"label_agreement":null},{"id":"W3004172495","doi":"10.1109/tcomm.2020.2970986","title":"Joint Long-Term Cache Updating and Short-Term Content Delivery in Cloud-Based Small Cell Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"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":"Computer science; Cache; Computer network; Cloud computing; Small cell; Quality of service; Distributed computing; Radio access network; Base station; Multicast; Mobile station","score_opus":0.10543574234773788,"score_gpt":0.2522205997933782,"score_spread":0.1467848574456403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004172495","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.07983964,0.00041348528,0.91849226,0.00015675808,0.000023076635,0.000027397855,0.000039729748,0.00014399586,0.00086367293],"genre_scores_gemma":[0.951317,0.00027570772,0.047196224,0.000038869286,0.00001934198,0.00005055601,0.00004972017,0.000019233104,0.001033382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970466,0.00008170501,0.00001255846,0.000057993577,0.00008732859,0.00005572073],"domain_scores_gemma":[0.99941695,0.0002966864,0.00008739151,0.000042899363,0.00011364451,0.000042362142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062306935,0.00043815482,0.0006696019,0.00021004566,0.00036614528,0.0005708359,0.00097178307,0.00057164003,0.0003652991],"category_scores_gemma":[0.0017516252,0.0002770181,0.00024064012,0.00056443067,0.0005413154,0.00084798865,0.00055881805,0.0004076143,0.000088848654],"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.000096554875,0.000025183519,0.0008799847,0.000038594757,0.000015369982,0.000077517536,0.00004494597,0.96193045,0.004246861,0.0038418837,0.00041846157,0.028384287],"study_design_scores_gemma":[0.0000023328532,0.000011085184,0.00007810988,9.53452e-7,0.0000031989819,0.0000068483237,0.000005269262,0.99889404,0.0004949226,0.0004214566,0.000080039325,0.000001810556],"about_ca_topic_score_codex":0.011666336,"about_ca_topic_score_gemma":0.010606191,"teacher_disagreement_score":0.011666336,"about_ca_system_score_codex":0.0010020675,"about_ca_system_score_gemma":0.0012129026,"threshold_uncertainty_score":0.023196816},"labels":[],"label_agreement":null},{"id":"W3004878114","doi":"10.1109/tcomm.2020.2971699","title":"Cross-Layer Scheduling and Beamforming in Smart-Grid Powered Cellular Networks With Heterogeneous Energy Coordination","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Smart grid; Lyapunov optimization; Scheduling (production processes); Mathematical optimization; Optimization problem; Grid; Renewable energy; Distributed computing; Base station; Schedule; Real-time computing; Engineering; Computer network; Algorithm; Telecommunications; Electrical engineering; Mathematics","score_opus":0.01849001566145168,"score_gpt":0.23330061396054305,"score_spread":0.21481059829909138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004878114","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.037795767,0.00039679775,0.9581185,0.00017490223,0.000069665046,0.00004055118,0.000039272898,0.00016131507,0.003203266],"genre_scores_gemma":[0.9194048,0.00034812486,0.07797688,0.00008857382,0.000049225797,0.000075688265,0.000053642103,0.00002627903,0.0019767978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996056,0.00014455603,0.000014043097,0.00008354628,0.00007920844,0.00007306382],"domain_scores_gemma":[0.9993825,0.0003166609,0.000107298976,0.0000510271,0.00009857366,0.00004386859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007003296,0.000805882,0.0005878152,0.00026963977,0.00037870018,0.0007896963,0.0004587924,0.00055480003,0.0013197717],"category_scores_gemma":[0.001801654,0.00031068278,0.00027789606,0.0007425262,0.0006895475,0.0008216681,0.0006861825,0.00060776796,0.0002597106],"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.00004784784,0.000021087259,0.000314615,0.00003229942,0.000013921169,0.000041740197,0.000030042353,0.96982175,0.002207568,0.00846309,0.0005318121,0.018474268],"study_design_scores_gemma":[0.0000036627644,0.00001533404,0.000051117564,0.0000012752758,0.0000019853253,0.000006414756,0.0000066598286,0.9982046,0.0002813561,0.0012929983,0.0001323212,0.000002308907],"about_ca_topic_score_codex":0.004282755,"about_ca_topic_score_gemma":0.0035191819,"teacher_disagreement_score":0.004282755,"about_ca_system_score_codex":0.0008580188,"about_ca_system_score_gemma":0.0009871253,"threshold_uncertainty_score":0.008515656},"labels":[],"label_agreement":null},{"id":"W3007600769","doi":"10.1109/tcomm.2020.2974738","title":"A Deep Reinforcement Learning-Based Transcoder Selection Framework for Blockchain-Enabled Wireless D2D Transcoding","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"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; Carleton University","funders":"National Natural Science Foundation of China","keywords":"Transcoding; Computer science; Reinforcement learning; Quality of service; Scheduling (production processes); Distributed computing; Real-time computing; Computer network; Artificial intelligence; Engineering","score_opus":0.02848112148239362,"score_gpt":0.26233327802611983,"score_spread":0.2338521565437262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007600769","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.020055646,0.00026683297,0.9769552,0.00019423511,0.000031104926,0.000029116558,0.00003434396,0.00021014003,0.0022234765],"genre_scores_gemma":[0.93694276,0.0001785762,0.059433907,0.00011684917,0.000028083492,0.000075994685,0.000059608767,0.00003668945,0.0031274532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996921,0.00007742124,0.000013450509,0.00007012853,0.00008822814,0.000058703765],"domain_scores_gemma":[0.999476,0.00025180914,0.00006211736,0.000033109267,0.00012680911,0.000050223978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076234154,0.00053638016,0.0007859655,0.00021315586,0.00027419967,0.00054939435,0.001082592,0.0007189106,0.0015844331],"category_scores_gemma":[0.001419739,0.00028270629,0.00033682128,0.0002445278,0.0006864187,0.000665032,0.0008844323,0.0010266678,0.00018034672],"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.000046014822,0.00004039508,0.00043892645,0.000032291322,0.000020239679,0.00009597001,0.000041376374,0.96226645,0.0024009524,0.0067978306,0.0007049449,0.027114661],"study_design_scores_gemma":[0.000002487423,0.0000068502745,0.000018593613,9.53418e-7,0.000001449388,0.0000044286603,0.00000144509,0.99902797,0.00013414022,0.0007214238,0.00007909995,0.000001239635],"about_ca_topic_score_codex":0.006988518,"about_ca_topic_score_gemma":0.006278863,"teacher_disagreement_score":0.006988518,"about_ca_system_score_codex":0.00079822814,"about_ca_system_score_gemma":0.0010794223,"threshold_uncertainty_score":0.01389569},"labels":[],"label_agreement":null},{"id":"W3007970939","doi":"10.1109/tcomm.2020.2974457","title":"Sparse Channel Estimation and Hybrid Precoding Using Deep Learning for Millimeter Wave Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":219,"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, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Precoding; Zero-forcing precoding; MIMO; Computer science; Algorithm; Quantization (signal processing); Artificial neural network; Electronic engineering; Channel (broadcasting); Control theory (sociology); Artificial intelligence; Engineering; Telecommunications","score_opus":0.09714878866662471,"score_gpt":0.26926534903455496,"score_spread":0.17211656036793024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007970939","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.01764966,0.0003547497,0.9790749,0.00018296234,0.00005145401,0.000022026483,0.000060168855,0.00022505675,0.0023790223],"genre_scores_gemma":[0.848097,0.00064182427,0.14691366,0.00020764738,0.000097757234,0.00007921704,0.00017859942,0.000025806408,0.0037584235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970347,0.00006528523,0.0000118762255,0.00005291,0.00011663196,0.000049722457],"domain_scores_gemma":[0.99964714,0.00014569766,0.000046055444,0.00004878785,0.00009401683,0.000018380806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032438018,0.0006478785,0.0004619545,0.00020923412,0.0002671423,0.00044251975,0.00056573196,0.0004831356,0.000914378],"category_scores_gemma":[0.0010208543,0.00026297543,0.00031631897,0.00048201415,0.00047870274,0.0008368339,0.00070336723,0.0008396936,0.00018445626],"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.00016555325,0.00006883211,0.0014151671,0.00015333122,0.0000747169,0.00020133874,0.00009996701,0.8018685,0.015500187,0.01889867,0.002339042,0.15921463],"study_design_scores_gemma":[0.0000040623804,0.00002553911,0.00009652101,0.000003348156,0.0000055085434,0.0000264083,0.0000071623713,0.9964803,0.0014179691,0.0016348413,0.00029347537,0.0000047980525],"about_ca_topic_score_codex":0.0046452265,"about_ca_topic_score_gemma":0.0076733325,"teacher_disagreement_score":0.0046452265,"about_ca_system_score_codex":0.00037241715,"about_ca_system_score_gemma":0.0007287143,"threshold_uncertainty_score":0.009236395},"labels":[],"label_agreement":null},{"id":"W3008718072","doi":"10.1109/tcomm.2020.2975195","title":"Error Floor Estimation of LDPC Decoders — A Code Independent Approach to Measuring the Harmfulness of Trapping Sets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Randomness; Algorithm; Tanner graph; Message passing; Decoding methods; Computer science; Binary number; Graph; Code (set theory); Belief propagation; Theoretical computer science; Mathematics; Set (abstract data type); Error floor; Statistics","score_opus":0.11425838287925082,"score_gpt":0.3156160599393843,"score_spread":0.20135767706013347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008718072","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.070483975,0.000103953906,0.9275811,0.00006204826,0.000010744309,0.00003344575,0.000050897765,0.00037958997,0.0012943264],"genre_scores_gemma":[0.8647279,0.00014149185,0.13341168,0.000058857673,0.000011007806,0.000060968396,0.00013079843,0.00008431349,0.0013729212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990483,0.00029927128,0.00003299208,0.0001377803,0.00042397936,0.000057652855],"domain_scores_gemma":[0.99735814,0.0014642328,0.00036181678,0.0004140148,0.00033829463,0.000063548345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013868,0.000703142,0.0005938624,0.0009745544,0.00036373708,0.00057810004,0.0010148436,0.00070740335,0.000510635],"category_scores_gemma":[0.005404685,0.00042403693,0.00045226366,0.00052155025,0.00094941206,0.0012227795,0.00096247566,0.00096440385,0.00017435156],"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.00019840854,0.00008260084,0.0056412583,0.00014126197,0.00010141558,0.00019702605,0.00025227907,0.8477139,0.05705209,0.037758008,0.0004779045,0.050383765],"study_design_scores_gemma":[0.0000022549011,0.000017742546,0.00034471555,0.0000046378714,0.0000044769704,0.000033162145,0.0000065257177,0.98698086,0.010091902,0.002412539,0.000092011804,0.00000923799],"about_ca_topic_score_codex":0.0022049765,"about_ca_topic_score_gemma":0.0019681416,"teacher_disagreement_score":0.0022049765,"about_ca_system_score_codex":0.00090255117,"about_ca_system_score_gemma":0.0010150418,"threshold_uncertainty_score":0.0065484643},"labels":[],"label_agreement":null},{"id":"W3010012151","doi":"10.1109/tcomm.2020.2979149","title":"Robust Federated Learning With Noisy Communication","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":146,"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":"National Key Research and Development Program of China","keywords":"Computer science; Maxima and minima; Noise (video); Convergence (economics); Mathematical optimization; Node (physics); Process (computing); Function (biology); Convex function; Wireless; Convexity; Artificial intelligence; Regular polygon; Mathematics; Telecommunications; Engineering","score_opus":0.08482952423078478,"score_gpt":0.2744377171142667,"score_spread":0.1896081928834819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010012151","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.010849282,0.00008742028,0.98796767,0.00008825259,0.000021496817,0.000018118524,0.000019972578,0.00034273363,0.00060494407],"genre_scores_gemma":[0.88480633,0.0001247196,0.11284243,0.00016683599,0.000041838193,0.00011433897,0.00008911846,0.00005592016,0.0017584948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975357,0.00071067753,0.0001450412,0.0007331251,0.00055827916,0.00031711167],"domain_scores_gemma":[0.99577266,0.0018357587,0.00050300313,0.0009048053,0.00083638844,0.00014741553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029695455,0.001207142,0.0018391598,0.0005031576,0.00063922524,0.0013323671,0.0022484965,0.0015055435,0.0011411422],"category_scores_gemma":[0.008834469,0.00056373875,0.00071312085,0.00073889986,0.0014514038,0.00242144,0.002038891,0.0019682907,0.00045015055],"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.0002838603,0.00011906604,0.0007663524,0.00006801566,0.00005994541,0.00010617155,0.00007457119,0.91732544,0.003100683,0.01210605,0.0009148838,0.06507502],"study_design_scores_gemma":[0.000008167125,0.000043781205,0.0000539382,0.0000044456388,0.0000050791614,0.000021516114,0.0000050450976,0.99546945,0.0011984229,0.003035011,0.00014939517,0.000005779491],"about_ca_topic_score_codex":0.0017944468,"about_ca_topic_score_gemma":0.0015312275,"teacher_disagreement_score":0.0029695455,"about_ca_system_score_codex":0.0008755865,"about_ca_system_score_gemma":0.0015606498,"threshold_uncertainty_score":0.015704632},"labels":[],"label_agreement":null},{"id":"W3010268208","doi":"10.1109/tcomm.2020.2979113","title":"Design of General Entropy-Constrained Successively Refinable Unrestricted Polar Quantizer","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Entropy (arrow of time); Combinatorics; Algorithm; Mathematics; Minification; Discrete mathematics; Computer science; Mathematical optimization; Physics","score_opus":0.06519810886652606,"score_gpt":0.30382343160195147,"score_spread":0.23862532273542542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010268208","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.005595148,0.00008213565,0.99317366,0.000031071704,0.0000064630203,0.000027487107,0.000021975242,0.00009095993,0.00097096956],"genre_scores_gemma":[0.30700564,0.0002814122,0.68904734,0.00007254727,0.000020451385,0.0001716281,0.0001668319,0.00006063332,0.0031735022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996431,0.000075685035,0.00002264822,0.00009340525,0.00012904736,0.000036078276],"domain_scores_gemma":[0.9996948,0.00012701482,0.00005704389,0.00003592553,0.00006989291,0.000015396865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006330455,0.0007076137,0.0005891403,0.0003926664,0.000285491,0.0005666329,0.00086548436,0.0006327719,0.002952307],"category_scores_gemma":[0.0014882018,0.0003768047,0.00040968874,0.0003612903,0.0005903015,0.0011431223,0.0011259275,0.0006825182,0.00048316512],"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.000418415,0.000045493103,0.0008746879,0.00029379252,0.00005400266,0.0001808339,0.00029237042,0.5572296,0.1072719,0.063536316,0.0016615575,0.26814103],"study_design_scores_gemma":[0.000039913793,0.000096789874,0.00014837584,0.000013335776,0.000016557342,0.000066090994,0.000026308697,0.97643775,0.013405112,0.007161888,0.002569427,0.000018449291],"about_ca_topic_score_codex":0.0013863068,"about_ca_topic_score_gemma":0.0019325836,"teacher_disagreement_score":0.002952307,"about_ca_system_score_codex":0.00051604625,"about_ca_system_score_gemma":0.00081575534,"threshold_uncertainty_score":0.00987643},"labels":[],"label_agreement":null},{"id":"W3010834347","doi":"10.1109/tcomm.2020.2981332","title":"Improper Gaussian Signaling for Integrated Data and Energy Networking","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":25,"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":"Engineering and Physical Sciences Research Council; Institute for Computational Science and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Society; Australian Research Council; Royal Academy of Engineering","keywords":"Beamforming; Computer science; Telecommunications link; Throughput; Base station; Gaussian; Relay; Energy (signal processing); Computer network; Electronic engineering; Telecommunications; Engineering; Wireless; Mathematics; Power (physics)","score_opus":0.06699094452326423,"score_gpt":0.25907443765887317,"score_spread":0.19208349313560893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010834347","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.007628912,0.00042901438,0.98904383,0.00027542876,0.000045859546,0.000019025472,0.000031329433,0.00004804257,0.0024784144],"genre_scores_gemma":[0.8066052,0.0021412242,0.18507686,0.0005058791,0.00023485492,0.00011990503,0.00009664226,0.00004160077,0.0051778234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988859,0.00042345028,0.00005513578,0.00017036824,0.00033258076,0.0001325625],"domain_scores_gemma":[0.998809,0.0006876028,0.00014190128,0.00012730957,0.00017954948,0.000054617998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019357493,0.0009382376,0.0006333807,0.00049522263,0.00041262346,0.0013422488,0.0008042836,0.0010725157,0.0009811242],"category_scores_gemma":[0.003520346,0.00036506884,0.00045564456,0.0010529697,0.0014632313,0.0018886601,0.0010562158,0.0010912326,0.00023672981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016922232,0.000064108994,0.00081154855,0.00017111779,0.00004787422,0.00018688112,0.00017879745,0.5316288,0.0076120966,0.38688317,0.0017291551,0.070517205],"study_design_scores_gemma":[0.000009308577,0.00006019893,0.00010686111,0.000016684115,0.000017680892,0.000038683636,0.000027226477,0.9096594,0.001666556,0.08647593,0.0019086997,0.000012781498],"about_ca_topic_score_codex":0.0012230672,"about_ca_topic_score_gemma":0.0013039459,"teacher_disagreement_score":0.0019357493,"about_ca_system_score_codex":0.0011641562,"about_ca_system_score_gemma":0.001084914,"threshold_uncertainty_score":0.010237336},"labels":[],"label_agreement":null},{"id":"W3013612420","doi":"10.1109/tcomm.2020.2982632","title":"Relaying Systems With Reciprocity Mismatch: Impact Analysis and Calibration","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Carleton University","funders":"","keywords":"Reciprocity (cultural anthropology); Codebook; Computer science; Calibration; Electronic engineering; Beamforming; Performance improvement; Algorithm; Engineering; Mathematics","score_opus":0.07006073793233017,"score_gpt":0.2958096614110718,"score_spread":0.22574892347874162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013612420","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.08872321,0.002180424,0.8961788,0.00035793716,0.00006575443,0.000098265584,0.0000836432,0.00035838463,0.011953574],"genre_scores_gemma":[0.9730407,0.0013287115,0.024045326,0.00006234614,0.000051392144,0.00006658323,0.00005842317,0.000035411726,0.0013110521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.00066817977,0.00009698867,0.00027982928,0.00084518775,0.00025342964],"domain_scores_gemma":[0.99573886,0.0023029621,0.00059975917,0.0005889901,0.00072076265,0.000048692535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018650725,0.0014069236,0.0009527212,0.0006613198,0.0005984192,0.0012154661,0.000980927,0.001022341,0.001541537],"category_scores_gemma":[0.008661209,0.00041645858,0.00062916166,0.00087660877,0.0013970268,0.0023983584,0.0017514352,0.0010989833,0.00046065287],"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.00020922623,0.00005567436,0.0022840085,0.0002747477,0.00007676419,0.00075407943,0.0003650018,0.85183775,0.028274663,0.059422713,0.00078909245,0.055656195],"study_design_scores_gemma":[0.00000969421,0.00021566545,0.00069923303,0.000031216332,0.00006206084,0.0008431397,0.00012371215,0.97116876,0.014209128,0.011073696,0.0015125797,0.00005106758],"about_ca_topic_score_codex":0.0011984725,"about_ca_topic_score_gemma":0.00085946673,"teacher_disagreement_score":0.0018650725,"about_ca_system_score_codex":0.0012398869,"about_ca_system_score_gemma":0.0006325862,"threshold_uncertainty_score":0.009863555},"labels":[],"label_agreement":null},{"id":"W3017308685","doi":"10.1109/tcomm.2020.2987565","title":"Lattice-Based Robust Distributed Source Coding for Three Correlated Sources","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Rate distortion; Distributed source coding; Lattice (music); Degenerate energy levels; Coding (social sciences); Rate–distortion theory; Mathematics; Algorithm; Quadratic equation; Source code; Gaussian process; Computer science; Statistical physics; Decoding methods; Theoretical computer science; Applied mathematics; Channel code; Physics; Statistics; Quantum mechanics; Geometry","score_opus":0.06467019300070098,"score_gpt":0.2588014935177366,"score_spread":0.19413130051703564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017308685","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.018163078,0.00022613401,0.97969717,0.00021863737,0.000025865726,0.000028335347,0.000049244405,0.00012519,0.0014662957],"genre_scores_gemma":[0.7254981,0.00028082615,0.27165103,0.00012922242,0.000034900084,0.00010249247,0.00014738351,0.000040408395,0.002115514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791676,0.00088213815,0.00007950926,0.00020816583,0.000739624,0.00017393885],"domain_scores_gemma":[0.99653566,0.0020633154,0.0004683333,0.00037850798,0.00040375086,0.00015038156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002663888,0.00067228364,0.0016033326,0.00059274695,0.00053415087,0.0012831913,0.0018003561,0.0014443988,0.0010307442],"category_scores_gemma":[0.005263221,0.00036377626,0.00086436974,0.0011901944,0.0019301231,0.0016451401,0.002700972,0.0018395756,0.00036668323],"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.00038995306,0.000057950514,0.00026839523,0.0001357595,0.000059168655,0.00021153352,0.000117837575,0.8065516,0.013272238,0.13358055,0.00074690836,0.04460816],"study_design_scores_gemma":[0.00002200037,0.000027038192,0.000020167046,0.0000063181556,0.000004215491,0.000041264,0.000009043076,0.98519045,0.0020180782,0.012450385,0.00019423233,0.000016804926],"about_ca_topic_score_codex":0.0014065987,"about_ca_topic_score_gemma":0.0007834951,"teacher_disagreement_score":0.002663888,"about_ca_system_score_codex":0.0014607753,"about_ca_system_score_gemma":0.0015583816,"threshold_uncertainty_score":0.014088213},"labels":[],"label_agreement":null},{"id":"W3019060914","doi":"10.1109/tcomm.2020.2989462","title":"Energy-Constrained UAV-Assisted Secure Communications With Position Optimization and Cooperative Jamming","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":127,"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":"Computer science; Transmitter power output; Artificial noise; Relay; Jamming; Optimization problem; Node (physics); Mathematical optimization; Energy (signal processing); Iterative method; Convex optimization; Maximization; Computer network; Power (physics); Wireless; Transmitter; Algorithm; Physical layer; Regular polygon; Engineering; Telecommunications; Mathematics","score_opus":0.01755361681248436,"score_gpt":0.21634691408716625,"score_spread":0.1987932972746819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019060914","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.06690894,0.00051757175,0.9275128,0.00018626347,0.00003782115,0.000034687644,0.000032931675,0.00009692386,0.0046719485],"genre_scores_gemma":[0.9683479,0.00026864093,0.029394818,0.000041072475,0.000019016143,0.000046980153,0.000023819623,0.000012433895,0.0018452111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995517,0.00016150514,0.000017319846,0.00008664433,0.00012254881,0.000060393137],"domain_scores_gemma":[0.99963653,0.00017246144,0.00009002928,0.000027150538,0.000057200283,0.000016656792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429117,0.0008857606,0.0007077897,0.0002752513,0.00034300296,0.000731119,0.0006267241,0.0008399596,0.00077677105],"category_scores_gemma":[0.00089397706,0.00028365286,0.00042859826,0.0005042588,0.00081201136,0.0007657606,0.0008672969,0.0005509933,0.00018396902],"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.00006608353,0.000019724352,0.00031797084,0.000056998644,0.000024670684,0.0002167213,0.000054784174,0.97808313,0.004927269,0.00866441,0.00018082702,0.007387451],"study_design_scores_gemma":[0.0000059444433,0.000043974454,0.0000679915,0.000003088148,0.0000072971125,0.00003174047,0.000012903363,0.9977041,0.0008030155,0.0011459701,0.00016968262,0.0000042334227],"about_ca_topic_score_codex":0.001955049,"about_ca_topic_score_gemma":0.0015029937,"teacher_disagreement_score":0.001955049,"about_ca_system_score_codex":0.00043195195,"about_ca_system_score_gemma":0.0005459826,"threshold_uncertainty_score":0.0038872957},"labels":[],"label_agreement":null},{"id":"W3022068581","doi":"10.1109/tcomm.2020.2992471","title":"Performance Analysis of Overlay Cognitive NOMA Systems With Imperfect Successive Interference Cancellation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":90,"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, Okanagan Campus; University of British Columbia","funders":"Guangxi University for Nationalities; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Underlay; Overlay; Computer science; Noma; Cognitive radio; Single antenna interference cancellation; Interference (communication); Throughput; Spectral efficiency; Computer network; Signal-to-noise ratio (imaging); Cognitive network; Stochastic geometry; Wireless; Electronic engineering; Telecommunications link; Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.027197595053315943,"score_gpt":0.24946025961041335,"score_spread":0.2222626645570974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022068581","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.5455647,0.0022141298,0.42660704,0.00035825555,0.00008385184,0.00008268555,0.00024199426,0.00036521145,0.024482243],"genre_scores_gemma":[0.9967512,0.00021434434,0.0025253396,0.00001283925,0.000013202456,0.00001084242,0.000022801749,0.0000052159767,0.00044430126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.00027141313,0.000036860452,0.00010648789,0.00030342638,0.00026083007],"domain_scores_gemma":[0.9963245,0.0021420785,0.00043697417,0.00020539982,0.00079101697,0.00010003154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011293541,0.00087662885,0.0008110119,0.0007733429,0.0006659137,0.0010983705,0.0006587574,0.000692158,0.0011734918],"category_scores_gemma":[0.0049976157,0.00025627995,0.0004790298,0.0009201733,0.0010022775,0.0008100943,0.0010593559,0.0006110403,0.00015823843],"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.00016823881,0.000038355003,0.0025859748,0.00011416353,0.00006673742,0.00040063,0.00021727788,0.96175337,0.0058162077,0.016436085,0.0004581772,0.011944752],"study_design_scores_gemma":[0.0000031056202,0.000048821676,0.00063752464,0.000004414346,0.000016187327,0.00008710845,0.000044010616,0.99685466,0.0005301279,0.0016634082,0.00010211854,0.000008413699],"about_ca_topic_score_codex":0.0095643755,"about_ca_topic_score_gemma":0.006079432,"teacher_disagreement_score":0.0095643755,"about_ca_system_score_codex":0.0013182216,"about_ca_system_score_gemma":0.0011561271,"threshold_uncertainty_score":0.019017398},"labels":[],"label_agreement":null},{"id":"W3022887449","doi":"10.1109/tcomm.2021.3119368","title":"Efficient NOMA Design Without Channel Phase Information Using Amplitude-Coherent Detection","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"King Abdullah University of Science and Technology","keywords":"Detector; Single antenna interference cancellation; Noma; Bit error rate; Interference (communication); Multiuser detection; Channel (broadcasting); Electronic engineering; Equalization (audio); Computer science; Phase detector; Amplitude; Phase (matter); Algorithm; Code division multiple access; Detection theory; Engineering; Telecommunications; Physics; Optics; Electrical engineering; Telecommunications link","score_opus":0.06031604428046786,"score_gpt":0.29964927409356584,"score_spread":0.239333229813098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022887449","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.023586778,0.00045684702,0.9689229,0.00018617665,0.000099520694,0.00008551137,0.000056415418,0.00016753413,0.0064383466],"genre_scores_gemma":[0.45762634,0.0005956787,0.53815275,0.00026607251,0.00013855816,0.00023117597,0.00009721758,0.000034300294,0.0028578946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889565,0.00045197745,0.000059593494,0.00013364863,0.00036719616,0.000091980095],"domain_scores_gemma":[0.9986324,0.0006654346,0.00021227673,0.0001318471,0.00031006875,0.000048002617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007761181,0.0007947645,0.0005241228,0.0006222015,0.0007204133,0.0011300091,0.00056689355,0.00074736855,0.0016709531],"category_scores_gemma":[0.003027337,0.0003709907,0.0005260863,0.0004607504,0.0005732179,0.00077322713,0.00077669736,0.0007477101,0.0007839866],"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.00043886263,0.00028580712,0.0024086062,0.0006404774,0.00027346573,0.0004958757,0.0004260825,0.19297655,0.30214325,0.13760321,0.0029510113,0.35935688],"study_design_scores_gemma":[0.00009224018,0.0007269381,0.0008797755,0.000065343425,0.00009019483,0.0009845218,0.00008397595,0.90214634,0.06407428,0.01822322,0.012560538,0.000072534844],"about_ca_topic_score_codex":0.00029109878,"about_ca_topic_score_gemma":0.0007786115,"teacher_disagreement_score":0.0016709531,"about_ca_system_score_codex":0.00038961243,"about_ca_system_score_gemma":0.0008663256,"threshold_uncertainty_score":0.0055899024},"labels":[],"label_agreement":null},{"id":"W3024309904","doi":"10.1109/tcomm.2020.2995223","title":"Popular Matching for Security-Enhanced Resource Allocation in Social Internet of Flying Things","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":13,"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":"China University of Mining and Technology; Queen's University; Newton Fund; National Natural Science Foundation of China; Department for Business, Energy and Industrial Strategy, UK Government; Queen's University Belfast; Royal Academy of Engineering","keywords":"Computer science; Distributed computing; Optimization problem; Resource allocation; Convergence (economics); Matching (statistics); Block (permutation group theory); Computer network; Computer security; Algorithm","score_opus":0.026262925394666674,"score_gpt":0.2590506932225097,"score_spread":0.232787767827843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024309904","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.036978956,0.00024285086,0.9591974,0.00021698001,0.00003885425,0.000058839734,0.00003555246,0.0001281422,0.0031023682],"genre_scores_gemma":[0.917743,0.00024394706,0.07907657,0.0001428594,0.00003983466,0.00010844656,0.000071319184,0.000043162865,0.002530931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990889,0.00033807164,0.000036654026,0.00018195981,0.00018274394,0.00017174442],"domain_scores_gemma":[0.9986754,0.0007483731,0.00017069951,0.00013982484,0.00016402634,0.00010163542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235745,0.00059853727,0.000880571,0.0005144525,0.00080832886,0.00086080143,0.0011201404,0.0008405197,0.0026482302],"category_scores_gemma":[0.004077654,0.00030349204,0.0005318051,0.00089065736,0.0010180004,0.0020109478,0.0020219444,0.0007693296,0.0002951816],"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.0003035241,0.00015681995,0.0013491942,0.00012263126,0.00006246546,0.00018901419,0.00018479335,0.7997872,0.0051769745,0.106737636,0.0028560262,0.08307374],"study_design_scores_gemma":[0.000008621769,0.000036261772,0.000089374735,0.0000035943278,0.0000051298657,0.000028499051,0.000022050877,0.9855226,0.00038726395,0.013429167,0.00046145904,0.0000059388653],"about_ca_topic_score_codex":0.0015385441,"about_ca_topic_score_gemma":0.001566166,"teacher_disagreement_score":0.0026482302,"about_ca_system_score_codex":0.00083417573,"about_ca_system_score_gemma":0.0009658557,"threshold_uncertainty_score":0.008859217},"labels":[],"label_agreement":null},{"id":"W3025756901","doi":"10.1109/tcomm.2020.3039856","title":"Noisy Density Evolution With Asymmetric Deviation Models","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","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":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Low-density parity-check code; Code word; Large deviations theory; Decoding methods; Algorithm; Belief propagation; Range (aeronautics); Computer science; Code (set theory); Mathematics; Statistics","score_opus":0.06863529664891711,"score_gpt":0.2877480401966405,"score_spread":0.21911274354772342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025756901","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.25877848,0.00042900658,0.73269343,0.00034392052,0.0000552642,0.00003348639,0.00009173868,0.00023071989,0.007343964],"genre_scores_gemma":[0.98099476,0.00018930348,0.016912106,0.00005838578,0.000023188803,0.00002426347,0.000058469246,0.00003098123,0.0017086152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918705,0.0003212843,0.000030127125,0.00009549868,0.00029424476,0.00007181234],"domain_scores_gemma":[0.99814963,0.0010967238,0.00025636543,0.0002530809,0.00018375769,0.000060477345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008119847,0.0005736355,0.0006817244,0.00041646766,0.00035827985,0.00080958265,0.000933819,0.00096852944,0.00055147667],"category_scores_gemma":[0.0047455463,0.00029753125,0.00046533725,0.00041293254,0.0012798992,0.0015215316,0.0008554315,0.0009771223,0.0001622287],"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.00007721048,0.000028321032,0.001336039,0.00004613976,0.000033219156,0.00020286169,0.00007560656,0.8897967,0.006779707,0.096345216,0.00022748004,0.0050515244],"study_design_scores_gemma":[0.0000023948505,0.000008101428,0.00008563895,0.000002108894,0.0000031357708,0.000025690779,0.0000035414128,0.9917663,0.0012142018,0.0067942753,0.00008918785,0.0000054660604],"about_ca_topic_score_codex":0.0016311652,"about_ca_topic_score_gemma":0.0010130135,"teacher_disagreement_score":0.0016311652,"about_ca_system_score_codex":0.0009861623,"about_ca_system_score_gemma":0.00055464933,"threshold_uncertainty_score":0.0071551204},"labels":[],"label_agreement":null},{"id":"W3026492770","doi":"10.1109/tcomm.2020.2996781","title":"A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Algorithm; Cryptosystem; Mathematics; Computer science; Theoretical computer science; Plaintext; Encryption; Decoding methods; Cryptography; Computer network","score_opus":0.10968305158944719,"score_gpt":0.28413902087906984,"score_spread":0.17445596928962265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026492770","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.035103567,0.00048766955,0.95632124,0.0006484584,0.00013174205,0.00021269664,0.000163745,0.0004276812,0.0065031936],"genre_scores_gemma":[0.55615515,0.00045357368,0.43665212,0.00024491438,0.000067865134,0.00023613268,0.00015319658,0.000034284374,0.006002747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992617,0.00017990088,0.00004721582,0.00009428734,0.0003417342,0.00007517715],"domain_scores_gemma":[0.9995084,0.00009062492,0.00007999909,0.00015896145,0.000119556236,0.00004257501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592198,0.00034380882,0.00044124495,0.00037120297,0.00050387654,0.0007091475,0.0008429813,0.0006644745,0.0012681271],"category_scores_gemma":[0.0007759136,0.00018515812,0.00037868734,0.0005361711,0.0007408088,0.0011513853,0.0008709477,0.00092249614,0.00054418476],"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.00054336176,0.0002478165,0.0012045061,0.00053981185,0.00010508594,0.00066457037,0.00033018118,0.09649651,0.28611216,0.46910927,0.005034564,0.13961217],"study_design_scores_gemma":[0.00017367481,0.00030574566,0.0003628988,0.000051250172,0.000050184666,0.0010302997,0.00003295129,0.8402829,0.11145711,0.022853937,0.02328605,0.00011299241],"about_ca_topic_score_codex":0.0006248716,"about_ca_topic_score_gemma":0.00061375054,"teacher_disagreement_score":0.0012681271,"about_ca_system_score_codex":0.0006666194,"about_ca_system_score_gemma":0.0011230566,"threshold_uncertainty_score":0.0048366785},"labels":[],"label_agreement":null},{"id":"W3029660360","doi":"10.1109/tcomm.2020.2997400","title":"Design and Analysis of Online Fountain Codes for Intermediate Performance","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Fountain code; Overhead (engineering); Fountain; Computer science; Luby transform code; Tornado code; Online codes; Raptor code; Erasure; Decoding methods; Real-time computing; Algorithm; Block code; Hamming code; Operating system","score_opus":0.07554776408683453,"score_gpt":0.32196956672403737,"score_spread":0.24642180263720284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029660360","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.019521266,0.00083523314,0.97443116,0.0002204845,0.00005634413,0.00008341,0.00006314722,0.00042469657,0.004364193],"genre_scores_gemma":[0.73902476,0.0009889228,0.25564548,0.00023020164,0.0000883121,0.00024650252,0.0001274956,0.00012116853,0.0035271402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852836,0.00035251348,0.000054271743,0.0001711575,0.00064125616,0.0002523956],"domain_scores_gemma":[0.99601763,0.0016664698,0.0005077468,0.0005255678,0.00113267,0.00014989142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208752,0.0012236463,0.0006273429,0.0010953168,0.000776276,0.0011295263,0.0010704105,0.00081159244,0.001964566],"category_scores_gemma":[0.00583698,0.00036638536,0.0004355465,0.0010906555,0.0012822218,0.001203893,0.0011702597,0.0012478877,0.0005089675],"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.00041474449,0.00012273868,0.0018024247,0.00033391477,0.00007547474,0.0003852857,0.00042727235,0.6136224,0.041159388,0.17855132,0.0048331623,0.15827194],"study_design_scores_gemma":[0.000014925272,0.00010607355,0.00017549722,0.000039458435,0.000014977961,0.00020208894,0.000034134035,0.9703106,0.009244399,0.017232765,0.0025940903,0.000030963896],"about_ca_topic_score_codex":0.004017867,"about_ca_topic_score_gemma":0.0041818726,"teacher_disagreement_score":0.004017867,"about_ca_system_score_codex":0.0018416467,"about_ca_system_score_gemma":0.0027531767,"threshold_uncertainty_score":0.013362169},"labels":[],"label_agreement":null},{"id":"W3029883195","doi":"10.1109/tcomm.2020.2997401","title":"Security Enhancement via Antenna Selection in MIMOME Channels With Discrete Inputs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Rayleigh fading; QAM; Quadrature amplitude modulation; Computer science; Antenna (radio); Channel (broadcasting); Topology (electrical circuits); Artificial noise; Communications system; Electronic engineering; Fading; Telecommunications; Bit error rate; Mathematics; Engineering; Transmitter","score_opus":0.021637268988591363,"score_gpt":0.25126453838190155,"score_spread":0.22962726939331018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029883195","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.20497419,0.0008739532,0.78591394,0.00030326893,0.00005768845,0.000019348048,0.00008389722,0.00019676676,0.0075769788],"genre_scores_gemma":[0.9864811,0.0005306135,0.012200637,0.00003856283,0.000029013963,0.00001208253,0.000019142853,0.000007760331,0.0006809698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990939,0.00045431283,0.000032601674,0.00009949025,0.00020851933,0.000111179346],"domain_scores_gemma":[0.9974154,0.0018001565,0.00030379137,0.0002710979,0.0001648352,0.00004476792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087117474,0.0005785313,0.000477755,0.00022625804,0.000293086,0.0007592298,0.00039472908,0.00045275176,0.0006372107],"category_scores_gemma":[0.0028004115,0.00021186678,0.00030633097,0.0005218484,0.0010577359,0.0007463707,0.0008455979,0.0005634481,0.00019302996],"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.00064793456,0.00004734352,0.0038743683,0.00028426846,0.00009074239,0.00089760823,0.0003461228,0.72961855,0.090582706,0.121832386,0.0008432167,0.05093473],"study_design_scores_gemma":[0.000013309056,0.00019718539,0.00088844483,0.000031235166,0.000035888526,0.00037097168,0.00006360607,0.9631539,0.019696204,0.014558535,0.00096342666,0.000027289769],"about_ca_topic_score_codex":0.00024718975,"about_ca_topic_score_gemma":0.00032984253,"teacher_disagreement_score":0.00087117474,"about_ca_system_score_codex":0.00031549312,"about_ca_system_score_gemma":0.00031295072,"threshold_uncertainty_score":0.00460732},"labels":[],"label_agreement":null},{"id":"W3030158821","doi":"10.1109/tcomm.2020.2996737","title":"Sum Power Minimization With Mixed Power and QoS Bounded Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","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":"Ontario Tech University","funders":"","keywords":"Mathematical optimization; Interior point method; Computer science; Power (physics); Throughput; Distributed power; Power optimization; Wireless; Mathematics; Power consumption; Telecommunications","score_opus":0.01806715574617264,"score_gpt":0.22876577054208241,"score_spread":0.2106986147959098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030158821","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.009449079,0.00024332809,0.9872047,0.00012188232,0.000034306173,0.000027494189,0.00004959769,0.00008464276,0.0027850296],"genre_scores_gemma":[0.6804912,0.0006499979,0.3117854,0.00022373426,0.00011229945,0.00027870745,0.00019308925,0.0001824649,0.006083129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936193,0.00021520273,0.000023800732,0.00013309575,0.00016030272,0.00010559855],"domain_scores_gemma":[0.9995517,0.000285279,0.000039538023,0.00003552571,0.00006516107,0.000022745326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930789,0.0015952665,0.0012801443,0.00041049757,0.00040581686,0.0011766298,0.0009204079,0.00084812724,0.0025098396],"category_scores_gemma":[0.0016946493,0.0004712667,0.00074198475,0.0009620631,0.00077984936,0.0013281931,0.0012950875,0.0011143008,0.00037043958],"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.00009397932,0.000037789403,0.0002565257,0.00018183528,0.00003965405,0.00016406609,0.000075822565,0.93544316,0.0034111878,0.026655454,0.0015410725,0.03209939],"study_design_scores_gemma":[0.000009416839,0.000033720487,0.000048542315,0.0000068005706,0.00000671553,0.00003707814,0.000019453613,0.9871951,0.000788024,0.01120865,0.0006418769,0.0000047447843],"about_ca_topic_score_codex":0.0015293857,"about_ca_topic_score_gemma":0.0010233485,"teacher_disagreement_score":0.0025098396,"about_ca_system_score_codex":0.0005966164,"about_ca_system_score_gemma":0.00077844603,"threshold_uncertainty_score":0.008396208},"labels":[],"label_agreement":null},{"id":"W3034663452","doi":"10.1109/tcomm.2020.3001647","title":"Joint Component Design for the JSCC System Based on DP-LDPC Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Source code; Coding (social sciences); Algorithm; Connection (principal bundle); Mathematics; Statistics; Programming language","score_opus":0.14220246899759165,"score_gpt":0.2992184717571124,"score_spread":0.15701600275952077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034663452","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.01606452,0.00018280659,0.9731674,0.00017068691,0.000097091644,0.00017307531,0.00011570167,0.0022219415,0.0078068026],"genre_scores_gemma":[0.66249806,0.00021733578,0.3248237,0.00019023806,0.00007803699,0.0005352676,0.00045678535,0.00031695838,0.010883581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00018930445,0.000046148052,0.00016727073,0.00031968398,0.000094341995],"domain_scores_gemma":[0.99920434,0.00009674298,0.0000636887,0.000112580565,0.00047279274,0.00004990428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057992997,0.0006616814,0.0005104632,0.00066231104,0.0008607985,0.001128582,0.00083328673,0.00062251434,0.005960809],"category_scores_gemma":[0.001317838,0.00026687782,0.00040283415,0.00056931394,0.0004939326,0.0007018158,0.0007184555,0.00071868766,0.0019510903],"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.0013053139,0.0002326613,0.0021612968,0.00049335306,0.00015006063,0.00041965392,0.00055946625,0.3291422,0.13219377,0.1321228,0.020267125,0.38095227],"study_design_scores_gemma":[0.00008323767,0.00040114514,0.0006939772,0.000034914818,0.00009970039,0.00021461741,0.000059670587,0.9215594,0.044471152,0.008629975,0.023693655,0.000058614747],"about_ca_topic_score_codex":0.005064189,"about_ca_topic_score_gemma":0.006110887,"teacher_disagreement_score":0.005960809,"about_ca_system_score_codex":0.0011497309,"about_ca_system_score_gemma":0.0017169906,"threshold_uncertainty_score":0.019940913},"labels":[],"label_agreement":null},{"id":"W3035789229","doi":"10.1109/tcomm.2020.3032700","title":"Optimization of Wireless Relaying With Flexible UAV-Borne Reflecting Surfaces","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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":"York University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ergodic theory; Computer science; Transmission (telecommunications); Key (lock); Mathematical optimization; Maximization; Mode (computer interface); Wireless; Optimization problem; Energy (signal processing); Quadratic equation; Algorithm; Mathematics; Telecommunications","score_opus":0.07035304019683797,"score_gpt":0.3086306269643048,"score_spread":0.23827758676746685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035789229","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.075110026,0.0005402985,0.91478235,0.00025346648,0.00002533692,0.00005270027,0.00008299437,0.00012644006,0.009026403],"genre_scores_gemma":[0.94239485,0.00050743035,0.053827688,0.000042236064,0.000021270056,0.000071966795,0.000064334294,0.000047595186,0.003022713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994412,0.00023727861,0.000016445962,0.000094729185,0.00011445924,0.000095871146],"domain_scores_gemma":[0.9990158,0.00065949495,0.00014058342,0.00004749301,0.00010426101,0.000032486347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093754724,0.0012747432,0.000816218,0.0004521527,0.00031579979,0.0012691681,0.0008003657,0.000888228,0.0012861358],"category_scores_gemma":[0.0022741929,0.00040952474,0.0005213137,0.0006327104,0.0010556027,0.0011548338,0.0008168615,0.0006406057,0.00027790907],"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.000021447799,0.000010292848,0.0001312238,0.000023193212,0.000010105642,0.000049299208,0.000017832645,0.9887673,0.0012483814,0.0055893967,0.00012492361,0.0040066596],"study_design_scores_gemma":[0.00000426193,0.000026707345,0.000063668514,0.0000028154006,0.000004814555,0.000016066098,0.000017212407,0.99696916,0.00046642782,0.0022558083,0.0001695539,0.0000035416103],"about_ca_topic_score_codex":0.0017808515,"about_ca_topic_score_gemma":0.0011577768,"teacher_disagreement_score":0.0017808515,"about_ca_system_score_codex":0.0010624506,"about_ca_system_score_gemma":0.00058486394,"threshold_uncertainty_score":0.0077086687},"labels":[],"label_agreement":null},{"id":"W3039245001","doi":"10.1109/tcomm.2020.3005712","title":"Improved Constructions of Coded Caching Schemes for Combination Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Scheme (mathematics); Computer science; Cache; Transmission (telecommunications); Algorithm; Focus (optics); Theoretical computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Telecommunications","score_opus":0.04293471852267657,"score_gpt":0.26394967175355966,"score_spread":0.22101495323088308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039245001","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.0791472,0.0002674195,0.90979534,0.00014771194,0.000058590955,0.00022283681,0.0002208382,0.0007448544,0.009395224],"genre_scores_gemma":[0.4181734,0.00021326996,0.5762336,0.00009385396,0.000032564054,0.00029339644,0.0002888961,0.00007801556,0.0045929644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899036,0.00027851723,0.00007955868,0.0001888651,0.00030370255,0.00015904795],"domain_scores_gemma":[0.99797076,0.0007034942,0.00024564067,0.00055667904,0.0003794167,0.00014398212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007406852,0.00064165756,0.0006607339,0.00095299305,0.0008674424,0.0015620474,0.0013422021,0.00079990976,0.002442708],"category_scores_gemma":[0.0032319177,0.00040440436,0.0005498902,0.0016300116,0.0008797181,0.0019604436,0.0019326885,0.0011704062,0.00057840423],"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.0006228999,0.00019019327,0.0016186051,0.00028417577,0.00007338816,0.00039836328,0.00066027837,0.17514384,0.05001144,0.5144756,0.0058131577,0.25070813],"study_design_scores_gemma":[0.000111793015,0.00027862017,0.0004600202,0.00005093652,0.000058183534,0.00046104527,0.0001588437,0.85066557,0.033664554,0.095686935,0.018316306,0.000087224296],"about_ca_topic_score_codex":0.0013822068,"about_ca_topic_score_gemma":0.001615342,"teacher_disagreement_score":0.002442708,"about_ca_system_score_codex":0.0018401518,"about_ca_system_score_gemma":0.0012855572,"threshold_uncertainty_score":0.013351381},"labels":[],"label_agreement":null},{"id":"W3040458116","doi":"10.1109/tcomm.2020.3006913","title":"Secure Hybrid A/D Beamforming for Hardware-Efficient Large-Scale Multiple-Antenna SWIPT Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","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":"McGill University","funders":"Engineering and Physical Sciences Research Council; State Key Laboratory of Rail Traffic Control and Safety; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China; Royal Society","keywords":"Computer science; Beamforming; Artificial noise; Optimization problem; Mathematical optimization; Maximum power transfer theorem; Wireless; Algorithm; Base station; Power (physics); Mathematics; Telecommunications","score_opus":0.02894241891680449,"score_gpt":0.2369501768097731,"score_spread":0.2080077578929686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040458116","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.005117834,0.00015207233,0.99360764,0.000053338284,0.000012705009,0.000014257378,0.000016628617,0.000065823864,0.00095976004],"genre_scores_gemma":[0.698998,0.0006513366,0.29740235,0.00014355038,0.000045369157,0.00016260092,0.000081710525,0.000032188796,0.0024829565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994816,0.00018540432,0.000026331936,0.000099641016,0.00016627749,0.000040654733],"domain_scores_gemma":[0.9994418,0.0003305537,0.00007757507,0.00005423531,0.00007085141,0.00002496384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005405127,0.00091752235,0.00066704326,0.00025030845,0.00034015763,0.0007654866,0.00053656165,0.00084362854,0.0014149783],"category_scores_gemma":[0.0011277662,0.00032155364,0.000495424,0.00067515374,0.00055052474,0.00091736636,0.0008376541,0.000731898,0.000425057],"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.00009488831,0.00005014173,0.00039336976,0.00013912142,0.000053596665,0.00013285001,0.00005983087,0.8951152,0.020075181,0.023722239,0.0007937176,0.059369836],"study_design_scores_gemma":[0.000007525143,0.00003210913,0.000042465454,0.0000029881926,0.000004938782,0.000026477921,0.0000072607777,0.99528813,0.0013620019,0.0028886562,0.0003328782,0.0000045604793],"about_ca_topic_score_codex":0.00141402,"about_ca_topic_score_gemma":0.0015651061,"teacher_disagreement_score":0.0014149783,"about_ca_system_score_codex":0.00041788063,"about_ca_system_score_gemma":0.00064824225,"threshold_uncertainty_score":0.004733622},"labels":[],"label_agreement":null},{"id":"W3041662461","doi":"10.1109/tcomm.2020.3008233","title":"Signal Superposition in NOMA With Proper and Improper Gaussian Signaling","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Noma; Decodes; Computer science; Gaussian; Computer network; Interference (communication); Topology (electrical circuits); Theoretical computer science; Decoding methods; Channel (broadcasting); Algorithm; Mathematics; Telecommunications link","score_opus":0.025245074511293666,"score_gpt":0.22159761256668845,"score_spread":0.19635253805539477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041662461","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.042223066,0.0011309158,0.9472114,0.00038054804,0.00017279298,0.000060813873,0.000090840134,0.00015129363,0.00857847],"genre_scores_gemma":[0.83138597,0.0017680373,0.16193746,0.00037941028,0.00024748503,0.00018053493,0.000094202784,0.000034054665,0.0039727744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484634,0.002617909,0.00022412254,0.0004965449,0.0012808228,0.0005342047],"domain_scores_gemma":[0.9955914,0.002248065,0.00053523097,0.00086117414,0.0006137887,0.00015029695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044196937,0.0012771429,0.0013016397,0.0011523576,0.0012683505,0.0017576781,0.0008959716,0.0015437382,0.0011327852],"category_scores_gemma":[0.008888696,0.0006862843,0.000837862,0.0019803387,0.0030157175,0.0029464918,0.002558671,0.0015478808,0.00052529934],"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.0006119065,0.00009965445,0.0034248023,0.00029673017,0.00015886858,0.00088766,0.00065300195,0.40482384,0.020153714,0.47416812,0.002008091,0.09271363],"study_design_scores_gemma":[0.00003938892,0.00019234586,0.0008063,0.00004410676,0.00006149368,0.00041893093,0.000100937126,0.8955594,0.0034611842,0.0953397,0.003912364,0.000063913794],"about_ca_topic_score_codex":0.0015685144,"about_ca_topic_score_gemma":0.0022505268,"teacher_disagreement_score":0.0044196937,"about_ca_system_score_codex":0.0009204175,"about_ca_system_score_gemma":0.0015014805,"threshold_uncertainty_score":0.023373902},"labels":[],"label_agreement":null},{"id":"W3041990688","doi":"10.1109/tcomm.2022.3207820","title":"Age-Limited Capacity of Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematical notation; Mathematics; Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.04138377596060438,"score_gpt":0.2544963150106071,"score_spread":0.21311253905000271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041990688","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.6132617,0.004996134,0.3085702,0.0048754583,0.00037192774,0.00009128129,0.002443302,0.0006624223,0.06472763],"genre_scores_gemma":[0.9913454,0.00075516314,0.002723941,0.0002579193,0.00017210716,0.00005668492,0.0002874248,0.000026625874,0.0043746666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.00034599894,0.000030208552,0.00013365246,0.00026203593,0.00039327887],"domain_scores_gemma":[0.99145526,0.0053796014,0.0009935251,0.0005137524,0.0010801828,0.00057768525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281382,0.00092568557,0.0010587052,0.0012864347,0.0005942624,0.0015860806,0.0013228573,0.0012273963,0.0035957957],"category_scores_gemma":[0.012151875,0.00060797855,0.0005089047,0.0011717986,0.0022548372,0.0027837483,0.002310197,0.0014936158,0.00065299106],"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.00035698633,0.00007113194,0.003099177,0.00022742561,0.000086266555,0.0009520072,0.00037215152,0.59518963,0.004588528,0.38391247,0.0056049237,0.0055392594],"study_design_scores_gemma":[0.00002785451,0.000046756515,0.0010888216,0.00004538232,0.000021116537,0.0002358648,0.00009572775,0.89966947,0.0009814064,0.09668006,0.0010468453,0.000060654405],"about_ca_topic_score_codex":0.0042290688,"about_ca_topic_score_gemma":0.0015727982,"teacher_disagreement_score":0.0042290688,"about_ca_system_score_codex":0.001711542,"about_ca_system_score_gemma":0.0009818592,"threshold_uncertainty_score":0.0124182105},"labels":[],"label_agreement":null},{"id":"W3044929920","doi":"10.1109/tcomm.2020.3010986","title":"Absolute Value Layered ACO-OFDM for Intensity-Modulated Optical Wireless Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Electronic engineering; Spectral efficiency; Bit error rate; Computer science; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.05352686073563345,"score_gpt":0.26696656836190774,"score_spread":0.2134397076262743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044929920","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.12984942,0.0011934894,0.85936373,0.0001789321,0.0000645921,0.000042780684,0.000053026215,0.00018981453,0.009064142],"genre_scores_gemma":[0.9191989,0.000555689,0.078941256,0.000063341926,0.000027952712,0.000027532706,0.000029533689,0.000010911356,0.0011450042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.000043159594,0.000010650076,0.000032922162,0.00010628084,0.00004254768],"domain_scores_gemma":[0.9990858,0.00043739344,0.00017233059,0.00012613616,0.00014690719,0.000031511612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033072702,0.00044290695,0.00020620432,0.00029375489,0.00031218902,0.00069866405,0.0004940074,0.00027780363,0.00090448855],"category_scores_gemma":[0.0014959851,0.00013871031,0.00021253081,0.00038879836,0.0004598838,0.0007060627,0.0004382912,0.0005937294,0.00014869776],"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.00045602032,0.00019045323,0.0027604313,0.00041415653,0.000094763986,0.00042955228,0.00021185567,0.36090684,0.22065118,0.11708619,0.0017295487,0.295069],"study_design_scores_gemma":[0.000008313389,0.00018568247,0.0005405815,0.000019418172,0.000023632532,0.0001852622,0.000030217849,0.9498343,0.039910153,0.00710105,0.0021397586,0.00002166144],"about_ca_topic_score_codex":0.0008778203,"about_ca_topic_score_gemma":0.0017503735,"teacher_disagreement_score":0.00090448855,"about_ca_system_score_codex":0.000496771,"about_ca_system_score_gemma":0.0005250946,"threshold_uncertainty_score":0.0036043525},"labels":[],"label_agreement":null},{"id":"W3047617695","doi":"10.1109/tcomm.2020.3014939","title":"Energy-Efficient and Throughput Fair Resource Allocation for TS-NOMA UAV-Assisted Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University; Department for Business, Energy and Industrial Strategy, UK Government; Queen's University Belfast; Royal Society; Royal Academy of Engineering; Newton Fund","keywords":"Computer science; Throughput; Telecommunications link; Resource allocation; Quality of service; Transmitter power output; Context (archaeology); Computer network; Resource management (computing); Efficient energy use; Distributed computing; Transmitter; Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.04019573114552203,"score_gpt":0.24871362172067657,"score_spread":0.20851789057515455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047617695","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.010511934,0.00042746728,0.9850679,0.000114794464,0.00003608811,0.000043731543,0.000040357914,0.00005632318,0.003701314],"genre_scores_gemma":[0.9025317,0.0007049885,0.09114263,0.00007827149,0.000083021325,0.00018854464,0.000058823516,0.000055049968,0.005156889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994035,0.00022471546,0.000019214893,0.00010407562,0.00015307727,0.00009542285],"domain_scores_gemma":[0.99964345,0.0002032461,0.000056558594,0.000025487607,0.000051110223,0.000020044181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009986032,0.0010536987,0.0007722927,0.00042607504,0.00052363914,0.0011352402,0.0010490183,0.0006794397,0.001557519],"category_scores_gemma":[0.0014686477,0.00032024973,0.00049164525,0.0006790108,0.00080561865,0.0010948849,0.0007837677,0.000728622,0.0002536084],"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.000032052212,0.000028897946,0.00014942435,0.000038855815,0.000019980367,0.00005357007,0.000029804974,0.9641649,0.00178637,0.023237292,0.00056071446,0.0098980395],"study_design_scores_gemma":[0.0000032981418,0.000022386143,0.00006832876,0.0000039777037,0.0000046131304,0.000015036829,0.0000119594115,0.99510926,0.00030276997,0.003988292,0.00046628262,0.000003897782],"about_ca_topic_score_codex":0.0033097225,"about_ca_topic_score_gemma":0.0034185133,"teacher_disagreement_score":0.0033097225,"about_ca_system_score_codex":0.0012610387,"about_ca_system_score_gemma":0.0012661183,"threshold_uncertainty_score":0.009149551},"labels":[],"label_agreement":null},{"id":"W3048045154","doi":"10.1109/tcomm.2020.3014680","title":"Enhanced Channel Estimation in Massive MIMO via Coordinated Pilot Design","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Futurewei Technologies","keywords":"MIMO; Channel (broadcasting); Rayleigh fading; Mean squared error; Mathematical optimization; Algorithm; Computer science; Bipartite graph; Quadratic equation; Control theory (sociology); Fading; Mathematics; Statistics; Telecommunications; Theoretical computer science","score_opus":0.04309593948428443,"score_gpt":0.25991909043634104,"score_spread":0.21682315095205662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048045154","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.015779639,0.00009660611,0.9832661,0.000053866403,0.000013811981,0.0000120545055,0.000015515285,0.00009435563,0.00066803436],"genre_scores_gemma":[0.81946415,0.00019401789,0.179084,0.00008937569,0.000036917187,0.00007896235,0.000047988004,0.00002840138,0.0009761449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991241,0.00042953063,0.000021330432,0.00012119749,0.00020279385,0.00010106738],"domain_scores_gemma":[0.9988751,0.000662142,0.00014833172,0.00011607125,0.00014884994,0.000049471284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011406624,0.00073411834,0.0008671284,0.00028468345,0.00029096892,0.0006313966,0.00061017316,0.0006339632,0.0006967932],"category_scores_gemma":[0.0033709705,0.00044126724,0.00042791443,0.00050492684,0.00085460045,0.0009813238,0.0011301893,0.00060779,0.00019920742],"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.00018566934,0.000044305885,0.0003694822,0.0000579358,0.000038487524,0.0000847167,0.000064457054,0.9365453,0.0082337735,0.011491974,0.00042458955,0.0424594],"study_design_scores_gemma":[0.000011447935,0.00007104563,0.000059813978,0.000004434778,0.0000062401105,0.000019004574,0.0000071921177,0.9952427,0.0014878232,0.002907456,0.000177615,0.0000052965543],"about_ca_topic_score_codex":0.0010413115,"about_ca_topic_score_gemma":0.0010771541,"teacher_disagreement_score":0.0011406624,"about_ca_system_score_codex":0.0003109124,"about_ca_system_score_gemma":0.0008465315,"threshold_uncertainty_score":0.0060325265},"labels":[],"label_agreement":null},{"id":"W3048295980","doi":"10.1109/tcomm.2020.3014945","title":"Optimization for Signal Transmission and Reception in a Macrocell of Heterogeneous Uplinks and Downlinks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":7,"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":"Institute for Computational Science and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Telecommunications link; Computer science; Computer network; Bandwidth (computing); Bandwidth allocation; Quality of service; Electronic engineering; Engineering","score_opus":0.029520247777888763,"score_gpt":0.2407172404711094,"score_spread":0.21119699269322065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048295980","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.17280309,0.0011295953,0.8093056,0.0005024292,0.00007524272,0.00008743721,0.00018011547,0.000256631,0.015659794],"genre_scores_gemma":[0.94591856,0.0005698544,0.04858955,0.00010789918,0.00003887146,0.000092878574,0.00009367481,0.000046809208,0.004541957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995734,0.00012457589,0.000009883928,0.000092597176,0.00008073004,0.000118769065],"domain_scores_gemma":[0.99961424,0.00019209848,0.00005716405,0.000017669763,0.000082785125,0.000035977835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056083954,0.0012428985,0.00087013235,0.0003479147,0.00041379314,0.0012519617,0.0006153698,0.0008874129,0.0017589529],"category_scores_gemma":[0.0010325626,0.00044232473,0.0005820026,0.00062321784,0.0006412257,0.000715441,0.00060406566,0.0004938191,0.00037417372],"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.00008560508,0.000030632847,0.00071072765,0.00005215874,0.00004352012,0.00013960106,0.000029573886,0.9790106,0.0064005554,0.003604028,0.0005295141,0.00936339],"study_design_scores_gemma":[0.000010451339,0.00007567728,0.0003188777,0.0000033908343,0.000020330692,0.00002124146,0.000033022257,0.99748,0.0008447456,0.0008882787,0.00029785777,0.0000062491836],"about_ca_topic_score_codex":0.005925196,"about_ca_topic_score_gemma":0.0047423923,"teacher_disagreement_score":0.005925196,"about_ca_system_score_codex":0.0010994975,"about_ca_system_score_gemma":0.0009847564,"threshold_uncertainty_score":0.011781454},"labels":[],"label_agreement":null},{"id":"W3048824451","doi":"10.1109/tcomm.2020.3015500","title":"Binary Code Optimized for Partial Encryption","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encryption; Binary number; Algorithm; Computer science; Binary code; Distortion (music); Bitstream; Theoretical computer science; Mathematics; Decoding methods; Arithmetic","score_opus":0.07982855011395366,"score_gpt":0.3063544953834262,"score_spread":0.2265259452694725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048824451","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.034142762,0.00057091203,0.9575045,0.00030266016,0.00008100491,0.00008425982,0.00023242306,0.00035707824,0.0067244256],"genre_scores_gemma":[0.70477796,0.0005540964,0.2851797,0.00022055762,0.0000472613,0.0001687594,0.00052390876,0.00014827577,0.008379531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927026,0.00014080897,0.000035042638,0.00008792847,0.00035175882,0.00011424784],"domain_scores_gemma":[0.9989139,0.00038003922,0.00015342575,0.00018494343,0.0003237215,0.000043961863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005180965,0.00050385925,0.00056509196,0.00040541374,0.00027127741,0.00078158645,0.0005487355,0.0005878418,0.0035585843],"category_scores_gemma":[0.0031987012,0.00018176786,0.0002652528,0.0007519779,0.0004336439,0.0011963675,0.00071838126,0.00086828123,0.000670764],"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.0005731818,0.000116064766,0.00073417934,0.0003788016,0.000052198273,0.00023868334,0.00012154301,0.43821928,0.062495638,0.23317371,0.009831665,0.25406516],"study_design_scores_gemma":[0.00003512279,0.00014503684,0.00020521312,0.00003510719,0.00001474754,0.0002478267,0.000018590583,0.95006,0.01672473,0.026401673,0.0060902163,0.000021748068],"about_ca_topic_score_codex":0.0010096927,"about_ca_topic_score_gemma":0.0011491949,"teacher_disagreement_score":0.0035585843,"about_ca_system_score_codex":0.0006744048,"about_ca_system_score_gemma":0.0011752403,"threshold_uncertainty_score":0.011904597},"labels":[],"label_agreement":null},{"id":"W3049056399","doi":"10.1109/tcomm.2020.3016648","title":"A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fast Fourier transform; Computer science; Computational complexity theory; Coding (social sciences); Decoding methods; Distributed algorithm; Distributed computing; Node (physics); Computation; Distributed data store; Parallel computing; Computer engineering; Algorithm; Mathematics; Engineering","score_opus":0.08301009275867412,"score_gpt":0.31403233649428813,"score_spread":0.23102224373561403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049056399","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.0054750703,0.00006982669,0.99220943,0.00007908168,0.000026837737,0.000018727273,0.000013505663,0.00015921067,0.001948327],"genre_scores_gemma":[0.30925575,0.00018417007,0.68452984,0.00009432511,0.00007991752,0.00013979075,0.000068309106,0.00006944639,0.0055784266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981946,0.00003671061,0.000006374185,0.0000249405,0.000090492635,0.000022122753],"domain_scores_gemma":[0.99959177,0.00018209238,0.000031483014,0.0000734696,0.00009702798,0.00002419653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047068,0.00042331134,0.00036030792,0.00030295897,0.00036817684,0.0004226384,0.00077793514,0.00073977595,0.0028927622],"category_scores_gemma":[0.0014513016,0.00014840299,0.0002611766,0.00044162324,0.00047349153,0.00079063105,0.000646584,0.0008478784,0.0007237404],"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.00016074702,0.00008999951,0.00038966627,0.00013575374,0.000026581181,0.00024896592,0.00017197368,0.65406334,0.030026414,0.120031,0.004917409,0.18973821],"study_design_scores_gemma":[0.000016286838,0.00002895529,0.000029521678,0.0000059939935,0.0000035083028,0.000048838552,0.0000101655905,0.9887871,0.0020493164,0.0075996723,0.0014161828,0.0000044309995],"about_ca_topic_score_codex":0.0009897504,"about_ca_topic_score_gemma":0.0020167602,"teacher_disagreement_score":0.0028927622,"about_ca_system_score_codex":0.00042880443,"about_ca_system_score_gemma":0.00083026505,"threshold_uncertainty_score":0.009677231},"labels":[],"label_agreement":null},{"id":"W3079579528","doi":"10.1109/tcomm.2020.3018184","title":"On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Decoding methods; Telecommunications link; Computational complexity theory; Reduction (mathematics); Bit error rate; Algorithm; Tree (set theory); Transmission (telecommunications); Code (set theory); Computer engineering; Theoretical computer science; Parallel computing; Mathematics; Computer network; Telecommunications","score_opus":0.19903381964929953,"score_gpt":0.340194147862292,"score_spread":0.1411603282129925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079579528","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.029575847,0.0010508342,0.9644364,0.0001729087,0.00003889546,0.000040992483,0.0000390165,0.0001935806,0.004451573],"genre_scores_gemma":[0.6066665,0.0017544758,0.38783306,0.00011637984,0.000100175304,0.00011985984,0.00018940949,0.000083753184,0.0031364758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990921,0.0002561322,0.000027038932,0.000058603775,0.0005072888,0.000058884674],"domain_scores_gemma":[0.9982279,0.001203779,0.0000968084,0.00016817893,0.00027229937,0.000031076255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562657,0.00065748097,0.00040934788,0.0004700215,0.00026653556,0.0006408591,0.00046274517,0.00033774445,0.0014230879],"category_scores_gemma":[0.0034122975,0.00019888688,0.00038520794,0.00071540865,0.0004520663,0.0007775294,0.0006634782,0.00073492154,0.00029139116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032959046,0.00009371741,0.0016691559,0.0003328941,0.00007654757,0.00019019241,0.000189784,0.56876767,0.03838468,0.09646726,0.002452063,0.29104638],"study_design_scores_gemma":[0.000008476582,0.000076787335,0.00023722374,0.000010728369,0.000008960519,0.00008278639,0.00000958907,0.9857519,0.0071391244,0.005051847,0.0016137884,0.000008786922],"about_ca_topic_score_codex":0.0014504844,"about_ca_topic_score_gemma":0.0025891021,"teacher_disagreement_score":0.0014504844,"about_ca_system_score_codex":0.0005722814,"about_ca_system_score_gemma":0.0008912635,"threshold_uncertainty_score":0.004760742},"labels":[],"label_agreement":null},{"id":"W3081875647","doi":"10.1109/tcomm.2020.3021145","title":"CoMP Transmission in Downlink NOMA-Based Heterogeneous Cloud Radio Access Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Telecommunications link; User equipment; Computer science; Noma; Transmission (telecommunications); Spectral efficiency; Computer network; Cloud computing; Interference (communication); Enhanced Data Rates for GSM Evolution; Radio access network; Data transmission; Channel (broadcasting); Telecommunications; Base station; Mobile station","score_opus":0.04531447328210351,"score_gpt":0.27657888581954143,"score_spread":0.23126441253743793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081875647","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.218641,0.001883405,0.76820403,0.00039348635,0.00017540815,0.00015720454,0.0001911395,0.00020242545,0.010151942],"genre_scores_gemma":[0.9782707,0.0005491464,0.02013376,0.00008039547,0.000053857322,0.0000346717,0.000039793027,0.000016510692,0.0008211192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984817,0.0005876113,0.000032126958,0.00021990667,0.0002944869,0.00038421227],"domain_scores_gemma":[0.9980178,0.0010717908,0.0003427842,0.0001339467,0.00031275157,0.000120950084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015314383,0.0011189043,0.0008617776,0.0006287277,0.0010061527,0.0015934183,0.0012789328,0.0005980383,0.000622999],"category_scores_gemma":[0.003133678,0.0004105547,0.00064054894,0.0011036409,0.0013098882,0.0009235289,0.0013291523,0.0006067317,0.0001383551],"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.00014115039,0.00006582841,0.0020175686,0.000065905166,0.00005438118,0.00045365584,0.000054124295,0.96358085,0.0036824178,0.018569669,0.0004758784,0.010838562],"study_design_scores_gemma":[0.000005981808,0.00005254409,0.0003104286,0.0000047288777,0.000017836799,0.00009340458,0.000033417215,0.99696916,0.00076229806,0.001468832,0.0002742589,0.000007138179],"about_ca_topic_score_codex":0.012801168,"about_ca_topic_score_gemma":0.010950407,"teacher_disagreement_score":0.012801168,"about_ca_system_score_codex":0.0021158906,"about_ca_system_score_gemma":0.0015170535,"threshold_uncertainty_score":0.02545333},"labels":[],"label_agreement":null},{"id":"W3082208370","doi":"10.1109/tcomm.2020.3020833","title":"A Partially Dynamic Subarrays Structure for Wideband mmWave MIMO Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":54,"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, Okanagan Campus; University of British Columbia","funders":"Basic Research Program of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Precoding; Spectral efficiency; MIMO; Computer science; Wideband; Algorithm; Channel (broadcasting); Electronic engineering; Engineering; Telecommunications","score_opus":0.04343274986315033,"score_gpt":0.2542208639618039,"score_spread":0.21078811409865356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082208370","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.012502628,0.00015172879,0.9846036,0.00005925809,0.000023788803,0.000013712371,0.000035166424,0.00019932221,0.002410656],"genre_scores_gemma":[0.5402113,0.00039093418,0.45349845,0.00020472148,0.00006588897,0.00010829358,0.00018505314,0.000056710865,0.005278646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999846,0.000046110847,0.00000665977,0.000037928516,0.00004298766,0.00002028443],"domain_scores_gemma":[0.9998642,0.00003022602,0.000023667659,0.00003334414,0.000036251306,0.000012294638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114537426,0.00055903115,0.00031444844,0.00015364587,0.00022550384,0.00043758444,0.0005099353,0.00034013204,0.0018784818],"category_scores_gemma":[0.000285033,0.00021824561,0.00024841668,0.00034269525,0.00027109543,0.0006821118,0.00039019412,0.0004195763,0.0007244149],"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.00029121805,0.000084576975,0.0012263544,0.00017772657,0.00011685489,0.00018985372,0.00015043723,0.41688,0.23751026,0.055631347,0.0039971326,0.2837442],"study_design_scores_gemma":[0.000019837913,0.00020632248,0.0003725365,0.0000113474225,0.00002370631,0.00015147323,0.000035158224,0.95449936,0.030452058,0.0072509455,0.0069575366,0.000019756088],"about_ca_topic_score_codex":0.0005855695,"about_ca_topic_score_gemma":0.0016970049,"teacher_disagreement_score":0.0018784818,"about_ca_system_score_codex":0.0002275993,"about_ca_system_score_gemma":0.0002589303,"threshold_uncertainty_score":0.0062841177},"labels":[],"label_agreement":null},{"id":"W3084109717","doi":"10.1109/tcomm.2020.3022692","title":"Virtual Service Placement for Edge Computing Under Finite Memory and Bandwidth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"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 Manitoba","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Server; Bandwidth (computing); Edge computing; Enhanced Data Rates for GSM Evolution; Knapsack problem; Distributed computing; Computer network; Wireless; Service (business); Algorithm; Telecommunications","score_opus":0.06974632060964614,"score_gpt":0.2741229558407045,"score_spread":0.20437663523105837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084109717","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.101867,0.000517194,0.89395386,0.0002033662,0.00007240451,0.000072434486,0.000064807864,0.0005414905,0.00270757],"genre_scores_gemma":[0.8752276,0.0001715553,0.1229492,0.00007591992,0.000025249565,0.00005047922,0.00006787567,0.00006754866,0.0013645622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992791,0.00021991694,0.00003241842,0.00013389834,0.0001267816,0.00020798892],"domain_scores_gemma":[0.9991967,0.00038415607,0.00009671586,0.00009811776,0.00010307808,0.000121251505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885468,0.000918544,0.0010979176,0.0005459865,0.0008427146,0.001254374,0.0016413846,0.0008737194,0.0015096513],"category_scores_gemma":[0.0026696178,0.00042892873,0.00040814385,0.00087717234,0.000918516,0.0013175663,0.0013727668,0.0007763433,0.00028141038],"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.0002704943,0.00007587702,0.0007025737,0.000047410813,0.000023052324,0.00009045523,0.000063705564,0.94870263,0.0036053956,0.012356138,0.0012653824,0.032796867],"study_design_scores_gemma":[0.000007546257,0.000030182437,0.0000575649,0.0000026920047,0.0000035133974,0.000023095972,0.000017814687,0.99403316,0.00089632615,0.0047056777,0.00021795904,0.0000044246426],"about_ca_topic_score_codex":0.004745303,"about_ca_topic_score_gemma":0.004536463,"teacher_disagreement_score":0.004745303,"about_ca_system_score_codex":0.0014606438,"about_ca_system_score_gemma":0.0015538231,"threshold_uncertainty_score":0.010597765},"labels":[],"label_agreement":null},{"id":"W3084353073","doi":"10.1109/tcomm.2020.3022349","title":"Proactive Eavesdropping via Jamming in Full-Duplex Multi-Antenna Systems: Beamforming Design and Antenna Selection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":36,"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":"Eavesdropping; Beamforming; Computer science; Antenna (radio); Jamming; Physical layer; Optimization problem; Electronic engineering; Mathematical optimization; Algorithm; Telecommunications; Engineering; Computer network; Mathematics; Wireless","score_opus":0.06018245510937005,"score_gpt":0.25467473217883313,"score_spread":0.1944922770694631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084353073","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.020895012,0.00026622633,0.9772174,0.00010955591,0.0000144579535,0.000015481683,0.000013706254,0.00006622734,0.0014019499],"genre_scores_gemma":[0.86479115,0.00069862173,0.13277978,0.00012177877,0.00004340156,0.00006494142,0.000025896145,0.000017757011,0.0014566312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.00034286064,0.000024752891,0.00008345183,0.00013980937,0.00006570461],"domain_scores_gemma":[0.99922967,0.0004279765,0.00013008753,0.000092906,0.0000907328,0.000028566548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006738141,0.0007817686,0.00048679035,0.00021678659,0.00023386652,0.0007158724,0.00047968686,0.0006058975,0.00064107723],"category_scores_gemma":[0.0015950911,0.00032312644,0.00028584423,0.0004187913,0.0006648689,0.0008487824,0.00060976594,0.00045867873,0.00026530086],"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.00020783508,0.00007862917,0.0017322786,0.0002507266,0.00010372985,0.0002765578,0.00018935603,0.7777007,0.08477884,0.034348506,0.0011643013,0.09916851],"study_design_scores_gemma":[0.000010946286,0.00010563563,0.0003124208,0.000011462554,0.000018309285,0.00012516482,0.000032232874,0.98653585,0.008449069,0.0037775263,0.0006084066,0.000013045346],"about_ca_topic_score_codex":0.00037485725,"about_ca_topic_score_gemma":0.00061047304,"teacher_disagreement_score":0.0007817686,"about_ca_system_score_codex":0.0003182713,"about_ca_system_score_gemma":0.0004458797,"threshold_uncertainty_score":0.0035635233},"labels":[],"label_agreement":null},{"id":"W3088192645","doi":"10.1109/tcomm.2020.3025555","title":"Coordinated Direct and Relay Transmission With NOMA and Network Coding in Nakagami-<i>m</i> Fading Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Relay; Nakagami distribution; Telecommunications link; Fading; Computer science; Computer network; Base station; Single antenna interference cancellation; Transmission (telecommunications); Linear network coding; Spectral efficiency; Noma; Relay channel; Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering; Network packet; Channel (broadcasting); Physics","score_opus":0.021242222820318794,"score_gpt":0.2272913965673144,"score_spread":0.2060491737469956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088192645","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.090056,0.0010008961,0.90060395,0.00019269415,0.00010382022,0.000084521635,0.00012310193,0.0003826135,0.0074523427],"genre_scores_gemma":[0.9621078,0.0003420215,0.03643652,0.00006493829,0.00002837618,0.000049632952,0.000033862132,0.0000103251305,0.00092659204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998828,0.0004408937,0.000045700024,0.00018190638,0.0002918361,0.00021166471],"domain_scores_gemma":[0.99861133,0.00067390344,0.00022240682,0.0001814527,0.00026510307,0.000045763456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010452699,0.0010335674,0.00088972424,0.0006048549,0.00070439355,0.0009480394,0.0008436659,0.0005257512,0.00063081767],"category_scores_gemma":[0.0023203238,0.0002637146,0.00061143265,0.001060846,0.0010858502,0.0007747533,0.00089894346,0.0004785027,0.00016619307],"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.00034729362,0.000088737754,0.0017732333,0.00026683076,0.00012382363,0.0008006793,0.00026127705,0.8785052,0.018749366,0.041393027,0.001765739,0.055924717],"study_design_scores_gemma":[0.00002198083,0.00013257324,0.00028079946,0.000012287364,0.000044553966,0.0002633267,0.000043139473,0.9891399,0.004604801,0.004782796,0.0006486467,0.000025263902],"about_ca_topic_score_codex":0.00643284,"about_ca_topic_score_gemma":0.0076380814,"teacher_disagreement_score":0.00643284,"about_ca_system_score_codex":0.0011065444,"about_ca_system_score_gemma":0.0013899541,"threshold_uncertainty_score":0.012790799},"labels":[],"label_agreement":null},{"id":"W3088732684","doi":"10.1109/tcomm.2021.3062649","title":"Multiple-Association Supporting HTC/MTC in Limited-Backhaul Capacity Ultra-Dense Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Telecommunications link; Bottleneck; Stochastic geometry; Computer science; Computer network; Path loss; Cellular network; Coverage probability; Distributed computing; Electronic engineering; Engineering; Base station; Telecommunications; Wireless; Mathematics; Embedded system","score_opus":0.02376324035062772,"score_gpt":0.2482431692812244,"score_spread":0.22447992893059668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088732684","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.13318615,0.0007095045,0.8619211,0.00029091132,0.000075598524,0.000050593182,0.000104921724,0.00020674772,0.0034545707],"genre_scores_gemma":[0.9764615,0.0003695625,0.02198358,0.0000731783,0.000039639435,0.000045053835,0.000041650706,0.000011473033,0.00097424333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990522,0.00032554136,0.000030478723,0.0001372946,0.00025408203,0.0002003677],"domain_scores_gemma":[0.9965797,0.0020072558,0.0005776173,0.00021482455,0.00041223958,0.00020840144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015972918,0.00069894374,0.0009068327,0.0005687832,0.0008172414,0.00096256786,0.0013081091,0.00073285034,0.0007498],"category_scores_gemma":[0.004174163,0.00045122224,0.0003637865,0.0009666175,0.0012196881,0.0013553131,0.001691804,0.0007163747,0.00019575418],"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.00010869046,0.000060078284,0.0012124471,0.00009376774,0.000026558606,0.0004813251,0.00010834076,0.9509608,0.0038933465,0.025611034,0.0008915783,0.016551992],"study_design_scores_gemma":[0.0000043690043,0.000032669748,0.00017749457,0.000004303842,0.0000045815473,0.00006963838,0.000020282901,0.9959099,0.00039921675,0.00315364,0.0002172868,0.000006625107],"about_ca_topic_score_codex":0.0038643728,"about_ca_topic_score_gemma":0.003984663,"teacher_disagreement_score":0.0038643728,"about_ca_system_score_codex":0.0010408474,"about_ca_system_score_gemma":0.0009880847,"threshold_uncertainty_score":0.008447349},"labels":[],"label_agreement":null},{"id":"W3089835555","doi":"10.1109/tcomm.2020.3028302","title":"Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Tanner graph; Algorithm; Error floor; Computer science; Block code; Set (abstract data type); Block (permutation group theory); Graph; Decoding methods; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.032120189380703906,"score_gpt":0.2695646230738625,"score_spread":0.23744443369315857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089835555","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.24736547,0.00029567158,0.74294037,0.00020812442,0.00005744529,0.0001219557,0.00028495103,0.00076066924,0.007965426],"genre_scores_gemma":[0.7643226,0.00025039836,0.23223506,0.00007878653,0.000010788664,0.000096776,0.00025825272,0.00006625854,0.002681129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988365,0.000019796118,0.000005660756,0.000022049062,0.000051988412,0.000016911294],"domain_scores_gemma":[0.9996947,0.00007666532,0.000057944573,0.00005617482,0.00008715458,0.0000274112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013969773,0.00024076035,0.00021972365,0.00033401928,0.0002663567,0.00024716783,0.00034205173,0.00026391455,0.0006130651],"category_scores_gemma":[0.0004941902,0.00015313513,0.0001638961,0.00036526637,0.000441259,0.00023495543,0.0002981841,0.0003382586,0.00019462097],"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.00029368995,0.000089488196,0.0024523463,0.00046048439,0.000048239042,0.00059823453,0.00027504473,0.4768437,0.33615422,0.099005066,0.0019353502,0.08184412],"study_design_scores_gemma":[0.000027977261,0.00014571715,0.0006162903,0.000012331821,0.000016363516,0.00028381372,0.000019580904,0.92481536,0.06269501,0.006394374,0.0049497,0.000023472312],"about_ca_topic_score_codex":0.0012975119,"about_ca_topic_score_gemma":0.0020451313,"teacher_disagreement_score":0.0012975119,"about_ca_system_score_codex":0.00051406724,"about_ca_system_score_gemma":0.0008136631,"threshold_uncertainty_score":0.0037297606},"labels":[],"label_agreement":null},{"id":"W3093368304","doi":"10.1109/tcomm.2020.3030780","title":"Energy-Efficient Multi-Cell Massive MIMO Subject to Minimum User-Rate Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"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":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Royal Academy of Engineering; Princeton University; National Science Foundation","keywords":"Beamforming; Computer science; MIMO; Scheduling (production processes); Throughput; Bottleneck; Enhanced Data Rates for GSM Evolution; Computer network; Electronic engineering; Real-time computing; Wireless; Embedded system; Engineering; Telecommunications","score_opus":0.028997463480214418,"score_gpt":0.24918654100462753,"score_spread":0.2201890775244131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093368304","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.036673184,0.0010955017,0.94664353,0.00041635192,0.00013585578,0.00009461036,0.00034326504,0.00022602039,0.014371664],"genre_scores_gemma":[0.89250606,0.0014181795,0.09865324,0.00023979731,0.0001656636,0.00026188485,0.00019736857,0.0000752263,0.0064825728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993154,0.0002086517,0.000021368603,0.00008838712,0.00020270291,0.00016349248],"domain_scores_gemma":[0.99899536,0.00064702326,0.00010564844,0.000058168152,0.00014470275,0.000049087437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228344,0.0016902777,0.0013608095,0.00036727657,0.0003915488,0.0011285197,0.0010131559,0.0009360523,0.0022384825],"category_scores_gemma":[0.002315288,0.00039741537,0.00036156643,0.0013328767,0.0006226879,0.0008802413,0.0010264438,0.00080943265,0.00065633684],"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.00010579184,0.00005339095,0.00026192103,0.00016793073,0.00003952135,0.0001810984,0.000051420255,0.94689155,0.010406592,0.026036289,0.0020040385,0.013800504],"study_design_scores_gemma":[0.000016103428,0.000081181315,0.00013282328,0.000009842242,0.0000095067335,0.000053665965,0.000020986092,0.99074453,0.0018858128,0.0063330885,0.00070242473,0.000009978708],"about_ca_topic_score_codex":0.0013948885,"about_ca_topic_score_gemma":0.002060704,"teacher_disagreement_score":0.0022384825,"about_ca_system_score_codex":0.00064393046,"about_ca_system_score_gemma":0.0009501676,"threshold_uncertainty_score":0.007488489},"labels":[],"label_agreement":null},{"id":"W3095023944","doi":"10.1109/tcomm.2020.3034934","title":"Computation Over Multi-Access Channels: Multi-Hop Implementation and Resource Allocation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":17,"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; Computation; Wireless; Hop (telecommunications); Superposition principle; Fading; Wireless network; Distributed computing; Computer network; Resource allocation; Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.08917838698410775,"score_gpt":0.345838731161207,"score_spread":0.25666034417709926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095023944","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.022015838,0.00045710217,0.96984786,0.00029634996,0.000063413136,0.000060464066,0.000027134745,0.0003198287,0.00691199],"genre_scores_gemma":[0.7293374,0.00055759004,0.26689667,0.00012992707,0.000058614965,0.00015858901,0.0000598162,0.000046709018,0.0027547393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996282,0.000105342086,0.000017752336,0.000052559622,0.00013039372,0.000065718385],"domain_scores_gemma":[0.9995956,0.0001639176,0.00002606228,0.000118537464,0.00007234118,0.00002353314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572878,0.0003080125,0.00033510788,0.0003061663,0.0005007228,0.00078038906,0.000788849,0.0004724953,0.0018088176],"category_scores_gemma":[0.0013834079,0.00016087729,0.00028450845,0.00056922174,0.00064863195,0.0011838992,0.0007822944,0.0007182026,0.0002586971],"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.00021870759,0.00013696725,0.0014214668,0.00016806742,0.000049109465,0.00015045248,0.00022741145,0.45849165,0.021230066,0.3172232,0.0047518685,0.19593106],"study_design_scores_gemma":[0.0000097104785,0.000026351498,0.000092121576,0.0000064015585,0.0000065694358,0.000031596173,0.000020558886,0.97428775,0.0033098948,0.019672716,0.002528316,0.00000796968],"about_ca_topic_score_codex":0.0021199954,"about_ca_topic_score_gemma":0.0026456346,"teacher_disagreement_score":0.0021199954,"about_ca_system_score_codex":0.00060167135,"about_ca_system_score_gemma":0.0009605808,"threshold_uncertainty_score":0.006051123},"labels":[],"label_agreement":null},{"id":"W3101768914","doi":"10.1109/tcomm.2020.3038772","title":"Dual Pilot Scheme (DPS) and Its Application in Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Rayleigh fading; Computer science; Channel state information; Wireless; Interference (communication); Fading; Channel (broadcasting); Precoding; Multi-user MIMO; Electronic engineering; Algorithm; Computer network; Engineering; Telecommunications","score_opus":0.035471273778957826,"score_gpt":0.25852618789724185,"score_spread":0.22305491411828404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101768914","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.028542528,0.00036295454,0.96802425,0.00019009414,0.000102759266,0.000048685426,0.000057671536,0.0001731573,0.002497865],"genre_scores_gemma":[0.82203573,0.00041009922,0.17621262,0.00013666983,0.00007415673,0.00010440634,0.000065165004,0.000017342772,0.0009437933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949384,0.00020651078,0.000024387708,0.000066213994,0.0001541455,0.000054836408],"domain_scores_gemma":[0.9987159,0.00057213125,0.00018502286,0.00029444645,0.00017467781,0.000057892914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086605526,0.00050368474,0.0003848189,0.00026618002,0.00030100092,0.0004209326,0.0006267363,0.00063443376,0.0007061138],"category_scores_gemma":[0.0030458798,0.00025018104,0.00033017917,0.0005775746,0.0008315258,0.00071997097,0.001020528,0.0006896217,0.0002447076],"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.000703894,0.0001558836,0.004462168,0.00035564665,0.000119847224,0.00093627075,0.00033913198,0.52746445,0.08566373,0.17979738,0.0029230642,0.19707847],"study_design_scores_gemma":[0.000048768215,0.00038405112,0.00044214676,0.000020275578,0.000020906191,0.00047914614,0.000022147266,0.9707798,0.008095507,0.017007064,0.0026706115,0.000029618512],"about_ca_topic_score_codex":0.00046492316,"about_ca_topic_score_gemma":0.0003905162,"teacher_disagreement_score":0.00086605526,"about_ca_system_score_codex":0.00022456233,"about_ca_system_score_gemma":0.0005089993,"threshold_uncertainty_score":0.0045801997},"labels":[],"label_agreement":null},{"id":"W3103340483","doi":"10.1109/tcomm.2020.3037345","title":"Height Optimization and Resource Allocation for NOMA Enhanced UAV-Aided Relay Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":103,"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":"Engineering and Physical Sciences Research Council","keywords":"Relay; Computer science; Resource allocation; Protocol (science); Enhanced Data Rates for GSM Evolution; Noma; Macrocell; Relay channel; Optimization problem; Computer network; Transmitter power output; Mathematical optimization; Channel (broadcasting); Power (physics); Base station; Algorithm; Telecommunications link; Mathematics; Telecommunications","score_opus":0.018905719672310417,"score_gpt":0.2198769175134163,"score_spread":0.20097119784110587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103340483","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.04429521,0.00045555294,0.95084363,0.0001274244,0.000031926997,0.000024279443,0.00003684119,0.000075522745,0.0041096047],"genre_scores_gemma":[0.9276186,0.00040712734,0.069724694,0.000047117315,0.000028832686,0.00005444073,0.000036526846,0.000019016465,0.002063652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996668,0.00014598538,0.000008597154,0.00005027157,0.000064649714,0.00006367468],"domain_scores_gemma":[0.9996679,0.00019734915,0.00005154984,0.00002745866,0.000039103594,0.000016652692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000485416,0.00070946384,0.0006376852,0.00029778722,0.00028499088,0.0006624603,0.0005326005,0.0004807083,0.0009215319],"category_scores_gemma":[0.0011579605,0.00026104593,0.00031110513,0.00047268835,0.00056202675,0.00077291706,0.00079992274,0.00042194437,0.00016917943],"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.000043486038,0.000023643872,0.0002342807,0.000035606347,0.000018415587,0.00008460303,0.000038600378,0.961214,0.0041960333,0.015291195,0.00036682826,0.018453393],"study_design_scores_gemma":[0.0000051468473,0.000027257503,0.000070193084,0.0000021306525,0.0000042584265,0.000017852908,0.000012469711,0.9963387,0.00070651894,0.0025387025,0.00027326727,0.0000035454957],"about_ca_topic_score_codex":0.0015194946,"about_ca_topic_score_gemma":0.001537379,"teacher_disagreement_score":0.0015194946,"about_ca_system_score_codex":0.0006347933,"about_ca_system_score_gemma":0.0005819239,"threshold_uncertainty_score":0.00460577},"labels":[],"label_agreement":null},{"id":"W3111673929","doi":"10.1109/tcomm.2021.3081746","title":"Federated Learning in Unreliable and Resource-Constrained Cellular Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless; Federated learning; Convergence (economics); Train; Scheduling (production processes); Distributed computing; Wireless network; Machine learning; Computation; Artificial intelligence; Resource (disambiguation); Computer network; Algorithm; Mathematical optimization; Telecommunications","score_opus":0.03637400621240366,"score_gpt":0.26826778355044845,"score_spread":0.23189377733804478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111673929","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.09217398,0.0005140692,0.904498,0.0006240523,0.00006248017,0.000064543965,0.000097699594,0.00072076655,0.0012443715],"genre_scores_gemma":[0.93087935,0.000171806,0.06755577,0.0001489288,0.0000286434,0.00007698184,0.0001244996,0.000037571448,0.00097636506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998085,0.00082990516,0.00010754103,0.0004322167,0.00025864685,0.00028661065],"domain_scores_gemma":[0.9921245,0.0049806875,0.00067514845,0.0010192319,0.0008911552,0.00030920544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044319634,0.0007415091,0.0016240985,0.0007959013,0.0011142106,0.0016747963,0.0020963326,0.0015556967,0.00065235194],"category_scores_gemma":[0.013065742,0.0003975821,0.0005438422,0.0015125307,0.0015829485,0.0019514192,0.0015869499,0.0015196472,0.00018514488],"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.00013171282,0.00004565812,0.00079292664,0.00002746004,0.000025584295,0.00007173322,0.000048772195,0.9685997,0.00030784257,0.0049514645,0.00050667155,0.024490489],"study_design_scores_gemma":[0.0000072961334,0.0000113613205,0.00007425474,0.0000028052243,0.0000030266922,0.000013258734,0.000012198361,0.9926174,0.0002926722,0.0068502645,0.00011284809,0.0000024846486],"about_ca_topic_score_codex":0.007978629,"about_ca_topic_score_gemma":0.004536362,"teacher_disagreement_score":0.007978629,"about_ca_system_score_codex":0.0019156784,"about_ca_system_score_gemma":0.0017845588,"threshold_uncertainty_score":0.023438752},"labels":[],"label_agreement":null},{"id":"W3118326706","doi":"10.1109/tcomm.2021.3051680","title":"Antenna Clustering for Simultaneous Wireless Information and Power Transfer in a MIMO Full-Duplex System: A Deep Reinforcement Learning-Based Design","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":33,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Precoding; Cluster analysis; Reinforcement learning; Computer science; Multi-user MIMO; Antenna (radio); Electronic engineering; Wireless; 3G MIMO; Maximum power transfer theorem; Energy harvesting; Zero-forcing precoding; Beamforming; Control theory (sociology); Energy (signal processing); Power (physics); Engineering; Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.01772217575845923,"score_gpt":0.2253980461397645,"score_spread":0.20767587038130528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118326706","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.015067901,0.00016056822,0.98150694,0.00016207377,0.000026909369,0.000031428815,0.0000146507,0.00018209398,0.0028474755],"genre_scores_gemma":[0.8959707,0.00012756625,0.10011592,0.00018233976,0.000022583663,0.00012035934,0.000034377106,0.000034529894,0.003391715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997008,0.00007520832,0.000012891463,0.000071509996,0.00009444056,0.000045238598],"domain_scores_gemma":[0.9996519,0.00012017428,0.000052848525,0.00003683171,0.00010528553,0.00003294559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054790836,0.0004887194,0.00061947166,0.000175132,0.00026568814,0.0005458913,0.0010184563,0.0006857102,0.0014774407],"category_scores_gemma":[0.00095853145,0.00030974878,0.00035684186,0.00020072148,0.000727043,0.0006185132,0.00076212466,0.0007490437,0.00025627945],"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.000045835186,0.000047411762,0.0004704538,0.000052154086,0.00002939837,0.0000492086,0.00005331944,0.95085204,0.005531084,0.0077465414,0.0006350764,0.03448737],"study_design_scores_gemma":[0.00000363864,0.000014239944,0.000024323865,0.0000014242055,0.0000022132174,0.000005053091,0.0000017001738,0.9989235,0.00033285728,0.00054850423,0.00014089454,0.0000016990522],"about_ca_topic_score_codex":0.0031233113,"about_ca_topic_score_gemma":0.0030048357,"teacher_disagreement_score":0.0031233113,"about_ca_system_score_codex":0.00071470643,"about_ca_system_score_gemma":0.0009167587,"threshold_uncertainty_score":0.0062102675},"labels":[],"label_agreement":null},{"id":"W3122586336","doi":"10.1109/tcomm.2020.3030057","title":"Capacity-Approaching Polar Codes With Long Codewords and Successive Cancellation Decoding Based on Improved Gaussian Approximation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":19,"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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Additive white Gaussian noise; Decoding methods; Algorithm; Code word; Polar code; Code (set theory); Binary symmetric channel; Channel capacity; Polar; Gaussian; Mathematics; Binary number; List decoding; Channel (broadcasting); Low-density parity-check code; Concatenated error correction code; Computer science; Linear code; Telecommunications; Block code; Physics; Arithmetic","score_opus":0.03976994118903215,"score_gpt":0.26594717886165586,"score_spread":0.2261772376726237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122586336","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.040089037,0.00027358014,0.9541273,0.00013402624,0.000036302616,0.000028666427,0.00003731245,0.00019343688,0.005080396],"genre_scores_gemma":[0.5819472,0.0007011991,0.41270486,0.00013076713,0.000041241678,0.00010059451,0.00013273802,0.00008251809,0.0041588517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.0001889892,0.000018431458,0.000044673117,0.00026632138,0.00006550118],"domain_scores_gemma":[0.99900347,0.0005456342,0.00010580255,0.00010923293,0.0002001654,0.000035762292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007194644,0.00060593477,0.00046796506,0.0005412855,0.0003159823,0.00056677655,0.00055044,0.00061670406,0.00077123666],"category_scores_gemma":[0.0028864585,0.00024000152,0.000485336,0.00073717703,0.0010314903,0.0007445744,0.00091476226,0.0009737256,0.00040406393],"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.00018350875,0.000027957965,0.00062716525,0.00008749108,0.00003104952,0.00022440971,0.00020636007,0.69623196,0.023402154,0.24648255,0.00063888455,0.031856522],"study_design_scores_gemma":[0.000009483849,0.000043745313,0.00006357856,0.000008924371,0.000006312348,0.000100184654,0.000012620079,0.97765017,0.007347555,0.013800078,0.0009435495,0.000013818686],"about_ca_topic_score_codex":0.0016365898,"about_ca_topic_score_gemma":0.0011824224,"teacher_disagreement_score":0.0016365898,"about_ca_system_score_codex":0.0006639042,"about_ca_system_score_gemma":0.00090868666,"threshold_uncertainty_score":0.004817009},"labels":[],"label_agreement":null},{"id":"W3124703125","doi":"10.1109/tcomm.2021.3053040","title":"Joint Resource Allocation for Linear Precoding in Downlink Massive MIMO Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"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","keywords":"Precoding; Telecommunications link; Zero-forcing precoding; MIMO; Mathematical optimization; Maximization; Optimization problem; Computer science; Resource allocation; Mathematics; Control theory (sociology); Telecommunications; Beamforming; Computer network","score_opus":0.042261741950461465,"score_gpt":0.26972668549204704,"score_spread":0.22746494354158558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124703125","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.044116553,0.00059985294,0.9516122,0.00024257682,0.000044070606,0.00004361453,0.00004049086,0.00010884511,0.003191775],"genre_scores_gemma":[0.94834805,0.00046623172,0.048907015,0.00009340298,0.000067546425,0.0000748367,0.000029200572,0.000027017577,0.0019867667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990864,0.00043898335,0.000020901,0.00009139374,0.00017926857,0.0001831292],"domain_scores_gemma":[0.99845874,0.0011122248,0.00014959734,0.00009306604,0.00013083227,0.000055511566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901716,0.000960157,0.0009504039,0.00025590687,0.00036683286,0.0009493058,0.00073862914,0.0007034631,0.0011264044],"category_scores_gemma":[0.0038922338,0.00043428282,0.00040482383,0.00073600723,0.0010284847,0.0010125948,0.0007969391,0.0006327502,0.00020101605],"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.00006017868,0.00003441681,0.00021327994,0.000054405755,0.00002409946,0.00007613525,0.00003420546,0.97645015,0.0018892104,0.010142973,0.00037119217,0.010649835],"study_design_scores_gemma":[0.0000054291745,0.000025691515,0.000048133337,0.0000021406136,0.000003804718,0.000012822336,0.0000069033194,0.9966017,0.00033720428,0.002865131,0.00008850408,0.0000024877154],"about_ca_topic_score_codex":0.0029372524,"about_ca_topic_score_gemma":0.002958361,"teacher_disagreement_score":0.0029372524,"about_ca_system_score_codex":0.00083424326,"about_ca_system_score_gemma":0.0009562652,"threshold_uncertainty_score":0.006823182},"labels":[],"label_agreement":null},{"id":"W3124815611","doi":"10.1109/tcomm.2021.3053613","title":"Achievable Rate Characterization of NOMA-Aided Cell-Free Massive MIMO With Imperfect Successive Interference Cancellation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Noma; Power control; Single antenna interference cancellation; Path loss; Transmitter power output; Channel state information; Moment (physics); Context (archaeology); Control theory (sociology); Topology (electrical circuits); Computer network; Channel (broadcasting); Mathematics; Telecommunications; Power (physics); Wireless; Transmitter","score_opus":0.014609455880716883,"score_gpt":0.22909796706560284,"score_spread":0.21448851118488596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124815611","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.22003311,0.0020366895,0.750975,0.0004783697,0.000082398336,0.00013102457,0.00059658656,0.00080018624,0.024866607],"genre_scores_gemma":[0.98526037,0.00057696324,0.012601142,0.00006687713,0.000043220192,0.00008274755,0.0001757527,0.000046085737,0.0011468006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997147,0.0008594841,0.00009996901,0.00026626053,0.0009979818,0.00062923366],"domain_scores_gemma":[0.98441285,0.011411429,0.0013804742,0.0010309047,0.0015221797,0.00024212037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029365304,0.0019415757,0.001334753,0.0012844279,0.00090506056,0.0017035251,0.0013995804,0.001088245,0.001567235],"category_scores_gemma":[0.020697683,0.00058592035,0.00074121973,0.0011351315,0.0020787092,0.0013553416,0.0019342978,0.0010560754,0.0005413195],"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.0002582786,0.00006877783,0.0017780209,0.00025153495,0.00007648657,0.00049262174,0.00027279864,0.91328114,0.014360749,0.05604346,0.0006874469,0.012428584],"study_design_scores_gemma":[0.000006593497,0.000086846405,0.0007551794,0.00003272675,0.000024954297,0.00025122438,0.000060538146,0.9862439,0.0047360356,0.007362642,0.00041012035,0.000029198913],"about_ca_topic_score_codex":0.0025793763,"about_ca_topic_score_gemma":0.0017497329,"teacher_disagreement_score":0.0029365304,"about_ca_system_score_codex":0.0016029975,"about_ca_system_score_gemma":0.0014595878,"threshold_uncertainty_score":0.01553005},"labels":[],"label_agreement":null},{"id":"W3126241668","doi":"10.1109/tcomm.2021.3057625","title":"Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Phase-shift keying; Algorithm; Quadrature amplitude modulation; Keying; Modulation (music); QAM; Pulse-amplitude modulation; Binary number; Computer science; Estimator; Bit error rate; Mathematics; Decoding methods; Theoretical computer science; Statistics; Telecommunications; Arithmetic","score_opus":0.11458966318581643,"score_gpt":0.3540887267497274,"score_spread":0.23949906356391099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126241668","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.026449881,0.00009832595,0.9725118,0.000039880062,0.000008020391,0.000024270395,0.000018212166,0.00010415036,0.00074540917],"genre_scores_gemma":[0.66772854,0.0002694425,0.33045864,0.00004454521,0.000029246883,0.00008519698,0.00015436421,0.00005179491,0.0011782781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.0002837346,0.00003070222,0.00007314855,0.0003607948,0.00005546373],"domain_scores_gemma":[0.996894,0.0022508774,0.00027065762,0.00017684365,0.00035477796,0.000052846968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013572179,0.0005657511,0.000487478,0.0007983685,0.00021384248,0.00057787466,0.0006373856,0.0003494914,0.0007263155],"category_scores_gemma":[0.0064036422,0.00033676895,0.00032628552,0.0005777816,0.00055368745,0.00072338176,0.00072111253,0.00078056863,0.00016414351],"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.00022536948,0.000054568503,0.002449219,0.00015879182,0.00005023568,0.00014484617,0.00014396258,0.83778435,0.025005136,0.043840922,0.00047792942,0.08966472],"study_design_scores_gemma":[0.0000029622618,0.000012004484,0.00018607074,0.000004676733,0.0000022391735,0.000017108152,0.0000035343373,0.9941934,0.002404404,0.0030660168,0.00010348103,0.000004154851],"about_ca_topic_score_codex":0.0012719762,"about_ca_topic_score_gemma":0.0012270258,"teacher_disagreement_score":0.0013572179,"about_ca_system_score_codex":0.00069673976,"about_ca_system_score_gemma":0.0006999576,"threshold_uncertainty_score":0.0071777105},"labels":[],"label_agreement":null},{"id":"W3131407158","doi":"10.1109/tcomm.2021.3058369","title":"A Trellis-Coded Quantization Approach to Transmitting Correlated Gaussian Sources Over a Fading MAC Without Transmitter-CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Encoder; Codebook; Algorithm; Fading; Rayleigh fading; Transmitter; Trellis modulation; Vector quantization; Quantization (signal processing); MIMO; Precoding; Decoding methods; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering","score_opus":0.025862579811998628,"score_gpt":0.27161996544117073,"score_spread":0.2457573856291721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131407158","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.0032885165,0.0003086079,0.9934336,0.00013757093,0.00003850081,0.000038818354,0.00004448531,0.000112894246,0.0025969143],"genre_scores_gemma":[0.48926893,0.0010569445,0.5026998,0.0002480734,0.00012223907,0.00019490854,0.00012875654,0.00005641514,0.0062239775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00026657907,0.000038236136,0.00012349311,0.00024094965,0.00005943068],"domain_scores_gemma":[0.99919766,0.0003780849,0.00008230108,0.00014428496,0.00017360179,0.000024135516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008769589,0.0005335435,0.0004301815,0.00042499887,0.00038585754,0.0006822866,0.0010001294,0.0005643532,0.002405686],"category_scores_gemma":[0.0024962707,0.00022977732,0.00033273146,0.0008206985,0.0008997018,0.0010673017,0.00079230004,0.0011653423,0.0003544938],"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.00010084141,0.0000530652,0.00024383652,0.00015944394,0.00003543545,0.000111777976,0.0001700543,0.62976843,0.015432151,0.25193617,0.002119684,0.09986915],"study_design_scores_gemma":[0.0000103716075,0.000088976434,0.00006183972,0.000016747254,0.000009947621,0.00009466625,0.000014739662,0.9730453,0.004472826,0.019879973,0.002288228,0.00001645861],"about_ca_topic_score_codex":0.003134575,"about_ca_topic_score_gemma":0.0033900605,"teacher_disagreement_score":0.003134575,"about_ca_system_score_codex":0.0010903011,"about_ca_system_score_gemma":0.0017518412,"threshold_uncertainty_score":0.0080477595},"labels":[],"label_agreement":null},{"id":"W3131641277","doi":"10.1109/tcomm.2021.3058964","title":"Energy-Efficient Resource Allocation for NOMA-MEC Networks With Imperfect CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":114,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Resource allocation; Base station; Mathematical optimization; Channel state information; Computational complexity theory; Energy consumption; Optimization problem; Resource management (computing); Noma; Distributed computing; Computer network; Algorithm; Telecommunications link; Wireless; Engineering; Telecommunications; Mathematics","score_opus":0.0159310288920092,"score_gpt":0.23365854456456564,"score_spread":0.21772751567255644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131641277","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.033890378,0.0005053666,0.960739,0.0002059025,0.000034658344,0.00003307911,0.000048009348,0.00011154016,0.0044321152],"genre_scores_gemma":[0.905686,0.00032597384,0.09125839,0.000097665725,0.00002776381,0.00009243604,0.000055007433,0.00002381816,0.0024328942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995345,0.00021364188,0.000017577899,0.000074460506,0.0000780268,0.00008178198],"domain_scores_gemma":[0.9995296,0.0003110612,0.000056637266,0.000040615414,0.000040992603,0.000021102189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117011,0.0006381335,0.0007106548,0.00032050753,0.0004897684,0.00078248186,0.0008092923,0.0005429462,0.001008431],"category_scores_gemma":[0.0016571349,0.00037641355,0.0003085533,0.0008203569,0.0004777218,0.0010677248,0.0009592076,0.0005315484,0.00022276762],"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.0001235058,0.000075253825,0.0004788319,0.00008658614,0.00003605412,0.00012549954,0.000045043158,0.92850345,0.0043829936,0.0154313445,0.00091661705,0.04979486],"study_design_scores_gemma":[0.000004189202,0.000017337054,0.000083518076,0.0000033505212,0.000004506994,0.000030527986,0.000013379048,0.9945174,0.0006682733,0.004331613,0.00032237876,0.000003488303],"about_ca_topic_score_codex":0.0014610459,"about_ca_topic_score_gemma":0.003332338,"teacher_disagreement_score":0.0014610459,"about_ca_system_score_codex":0.0005736844,"about_ca_system_score_gemma":0.0006906254,"threshold_uncertainty_score":0.004162371},"labels":[],"label_agreement":null},{"id":"W3131701009","doi":"10.1109/tcomm.2021.3060797","title":"Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Tanner graph; Algorithm; Error floor; Invariant (physics); Computer science; Constraint (computer-aided design); Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.0372330144525903,"score_gpt":0.2670990262776684,"score_spread":0.2298660118250781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131701009","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.13741876,0.0001994907,0.85533243,0.00012809433,0.00004461682,0.00010655486,0.00008793532,0.00032485795,0.00635723],"genre_scores_gemma":[0.66931814,0.00026255613,0.3275324,0.00009554113,0.00001797131,0.00015127928,0.0001329157,0.000056389108,0.0024327731],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983907,0.000025450012,0.000009330385,0.000027155598,0.000081198,0.00001782379],"domain_scores_gemma":[0.9996916,0.00007661706,0.00006138502,0.000078310884,0.000067834175,0.000024322311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017320293,0.00029335354,0.00021959045,0.00034201326,0.0003325675,0.00027376213,0.000501558,0.0002872624,0.00064812176],"category_scores_gemma":[0.0005997836,0.000180186,0.00024588188,0.00029976148,0.00053014176,0.00032885253,0.000587781,0.00048132084,0.00019273035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112368216,0.00009391205,0.0013080213,0.0004318826,0.000071785944,0.00043965873,0.00024951933,0.13145256,0.6072076,0.18584631,0.0008202892,0.07196616],"study_design_scores_gemma":[0.000058023983,0.00023818275,0.00078750117,0.000032163258,0.000056507844,0.0005754875,0.000049369068,0.6699796,0.2968655,0.023171432,0.0081363665,0.00004983297],"about_ca_topic_score_codex":0.00038911487,"about_ca_topic_score_gemma":0.0008534982,"teacher_disagreement_score":0.00064812176,"about_ca_system_score_codex":0.0003040229,"about_ca_system_score_gemma":0.00070409453,"threshold_uncertainty_score":0.0022059083},"labels":[],"label_agreement":null},{"id":"W3132925507","doi":"10.1109/tcomm.2021.3078776","title":"Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Sequential decoding; Computer science; Schedule; List decoding; Scheduling (production processes); Tanner graph; Algorithm; Berlekamp–Welch algorithm; Node (physics); Theoretical computer science; Concatenated error correction code; Block code; Mathematical optimization; Mathematics","score_opus":0.022493775674910444,"score_gpt":0.27730869346690273,"score_spread":0.2548149177919923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132925507","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.04287226,0.00020937041,0.9545184,0.00013235323,0.000021851378,0.00003890603,0.00007758098,0.00021810227,0.0019111959],"genre_scores_gemma":[0.67841977,0.00032566595,0.31806892,0.00006660139,0.000020840265,0.00009746323,0.00020161345,0.000045115925,0.0027539625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00011917502,0.000026034573,0.000059870014,0.00017738223,0.000057446767],"domain_scores_gemma":[0.99820197,0.0010209393,0.00018761067,0.00017251098,0.00036368376,0.000053236003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073876005,0.0005028563,0.00035569165,0.0006312106,0.000328583,0.0004915595,0.00086390454,0.00045929715,0.0007009449],"category_scores_gemma":[0.0045654504,0.00024739487,0.00027747857,0.0010999286,0.0006336998,0.0008466609,0.00070836226,0.0007453436,0.00017651072],"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.00015414304,0.000030214573,0.0007828108,0.0000797259,0.000024032846,0.000073699324,0.00010555843,0.86485726,0.009263792,0.041797385,0.00086093956,0.08197044],"study_design_scores_gemma":[0.000013171276,0.000036306727,0.00009120688,0.000004489621,0.000005779331,0.000020426742,0.0000071960335,0.98978007,0.003815041,0.0057904506,0.00042902248,0.000006878589],"about_ca_topic_score_codex":0.005758988,"about_ca_topic_score_gemma":0.0065166927,"teacher_disagreement_score":0.005758988,"about_ca_system_score_codex":0.00087519706,"about_ca_system_score_gemma":0.0014830473,"threshold_uncertainty_score":0.011450946},"labels":[],"label_agreement":null},{"id":"W3135395337","doi":"10.1109/tcomm.2021.3063347","title":"Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":24,"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; Resource allocation; Beamforming; Channel state information; Noma; Matching (statistics); Mathematical optimization; Channel (broadcasting); Transmitter; Distributed computing; Computer network; Mathematics; Telecommunications; Wireless; Telecommunications link","score_opus":0.046216600452990635,"score_gpt":0.25766599503143406,"score_spread":0.21144939457844342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135395337","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.024612747,0.000117472446,0.97421354,0.00006430657,0.000013308116,0.00002253725,0.00001687302,0.00005499221,0.00088424754],"genre_scores_gemma":[0.9550479,0.000121881785,0.04349283,0.000043901593,0.000018763762,0.0000760648,0.00002530557,0.000016523878,0.0011568757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990828,0.00036145936,0.000032770575,0.0001973966,0.00017629095,0.00014927529],"domain_scores_gemma":[0.9991726,0.0004848225,0.00013805262,0.00006937612,0.0000823865,0.000052619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012960464,0.0009034946,0.0009147527,0.00042791953,0.00039623075,0.0009106711,0.0011862151,0.0006973725,0.00066948927],"category_scores_gemma":[0.0022856286,0.00031171585,0.00048566132,0.0007507109,0.00084913435,0.001088933,0.0012073203,0.0005536141,0.00014715242],"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.0000564204,0.000026091699,0.00017848321,0.000019102845,0.00002762456,0.00007671622,0.000028443943,0.97787136,0.0016164354,0.010215573,0.00015371224,0.009729944],"study_design_scores_gemma":[0.0000032815885,0.000012811831,0.000028399254,8.8757014e-7,0.0000034594634,0.0000071565214,0.000007040029,0.9974751,0.00025888227,0.002130951,0.00007001386,0.000002011907],"about_ca_topic_score_codex":0.0021769383,"about_ca_topic_score_gemma":0.0014852945,"teacher_disagreement_score":0.0021769383,"about_ca_system_score_codex":0.00093291956,"about_ca_system_score_gemma":0.0006754092,"threshold_uncertainty_score":0.006854236},"labels":[],"label_agreement":null},{"id":"W3136003212","doi":"10.1109/tcomm.2022.3159836","title":"Self-Organizing mmWave MIMO Cell-Free Networks With Hybrid Beamforming: A Hierarchical DRL-Based Design","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":45,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; MIMO; Cluster analysis; Telecommunications link; Electronic engineering; Computer network; Engineering; Artificial intelligence; Telecommunications","score_opus":0.025813781980052738,"score_gpt":0.20871692085527205,"score_spread":0.1829031388752193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136003212","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.011238571,0.00012073428,0.98522043,0.00013387536,0.000017292117,0.000032317483,0.000020115642,0.00018026913,0.00303642],"genre_scores_gemma":[0.77717257,0.00024943837,0.21756642,0.00028361252,0.000035965313,0.0002159049,0.00008134125,0.000060398354,0.0043343455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995421,0.00016387788,0.000016652866,0.00008935345,0.00013261316,0.0000554254],"domain_scores_gemma":[0.99959356,0.0001258791,0.000067387795,0.00004720565,0.00012737166,0.00003850249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789381,0.00059205166,0.00043351346,0.0002506497,0.00029701993,0.0006389484,0.0012806851,0.00067148,0.0013002248],"category_scores_gemma":[0.0009678616,0.00036172036,0.00035869319,0.00024845195,0.00064852904,0.0009961359,0.0009771916,0.0006774402,0.00045264474],"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.000046091547,0.00004752645,0.00048194593,0.000045887562,0.000025994854,0.000042600364,0.00007012181,0.9343226,0.011162568,0.013621577,0.0008690263,0.039264053],"study_design_scores_gemma":[0.00000293272,0.000021049816,0.000028310313,0.0000017321904,0.0000020848763,0.0000070315,0.0000041827743,0.9983125,0.00054027396,0.0008087845,0.00026864305,0.0000025818617],"about_ca_topic_score_codex":0.00215181,"about_ca_topic_score_gemma":0.0034248142,"teacher_disagreement_score":0.00215181,"about_ca_system_score_codex":0.0009575548,"about_ca_system_score_gemma":0.00064333546,"threshold_uncertainty_score":0.0069475174},"labels":[],"label_agreement":null},{"id":"W3136372906","doi":"10.1109/tcomm.2021.3065980","title":"Lightweight Continuous Authentication via Intelligently Arranged Pseudo-Random Access in 5G-and-Beyond","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Random access; Cryptography; Authentication (law); Overhead (engineering); Transceiver; Distributed computing; Computer engineering; Wireless; Computer security; Telecommunications","score_opus":0.025724177900297625,"score_gpt":0.28288387184848235,"score_spread":0.2571596939481847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136372906","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.10781904,0.0019546698,0.8800636,0.0008407576,0.00024747133,0.00024407699,0.00011572331,0.0017791128,0.0069355234],"genre_scores_gemma":[0.96568954,0.00021548684,0.031976502,0.00017389904,0.00004724269,0.00006400445,0.000043235814,0.000015403639,0.0017748175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986029,0.00048520108,0.000101394355,0.0002248108,0.0003789459,0.0002067703],"domain_scores_gemma":[0.99877435,0.00032110905,0.00026713163,0.0003782281,0.00019796695,0.00006115745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076975,0.00066673534,0.00076681987,0.00063185615,0.0008786739,0.00090350665,0.0008860564,0.0008618836,0.0018337902],"category_scores_gemma":[0.0019757205,0.00025926973,0.00036244545,0.0005610246,0.001078899,0.0024484594,0.0019550705,0.00079224125,0.0005341058],"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.0030735529,0.0002757353,0.003920744,0.0005346543,0.00014936284,0.0022142828,0.0010906697,0.13998589,0.18866546,0.2461386,0.0072696963,0.40668136],"study_design_scores_gemma":[0.00017381663,0.00092719315,0.0013864256,0.00008891632,0.00010719046,0.0017148511,0.00018882613,0.8788437,0.047233704,0.05664321,0.012534339,0.00015778292],"about_ca_topic_score_codex":0.00064567605,"about_ca_topic_score_gemma":0.00094559154,"teacher_disagreement_score":0.0018337902,"about_ca_system_score_codex":0.0004915438,"about_ca_system_score_gemma":0.00062637206,"threshold_uncertainty_score":0.006134689},"labels":[],"label_agreement":null},{"id":"W3136518070","doi":"10.1109/tcomm.2021.3065976","title":"ADMM Check Node Penalized Decoders for LDPC Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Low-density parity-check code; Code word; Algorithm; Node (physics); Mathematics; Parity-check matrix; Computer science; Mathematical optimization","score_opus":0.06324101790705305,"score_gpt":0.3371862364926889,"score_spread":0.27394521858563586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136518070","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.0064129517,0.00014637496,0.991867,0.00009988684,0.000027073596,0.000020600888,0.000035286623,0.00013864727,0.0012522305],"genre_scores_gemma":[0.2814595,0.00033130628,0.7119495,0.00018658635,0.000044993816,0.00016034451,0.0002299128,0.00008121781,0.0055565704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.0001726619,0.000018179404,0.000046970483,0.00016006429,0.000022656934],"domain_scores_gemma":[0.99901354,0.0005741873,0.00010512151,0.00009027003,0.00018999589,0.000026843138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339798,0.00066949276,0.00048473768,0.00036723597,0.00029130394,0.00052808586,0.00071347604,0.00079230196,0.0015348421],"category_scores_gemma":[0.0030132988,0.00025074722,0.00027528146,0.0006012531,0.0005594853,0.0006250678,0.00059056265,0.001156219,0.00041005894],"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.00014322516,0.000037906473,0.00061193935,0.00013754849,0.00004091629,0.00011231264,0.00006412785,0.8350158,0.009384297,0.055144656,0.0024559821,0.09685125],"study_design_scores_gemma":[0.000006705546,0.000016773101,0.000034438923,0.0000050260933,0.0000023889393,0.000021504846,0.0000020384964,0.99452114,0.0016724312,0.0030688052,0.0006443712,0.0000043907316],"about_ca_topic_score_codex":0.0015718918,"about_ca_topic_score_gemma":0.0025987197,"teacher_disagreement_score":0.0015718918,"about_ca_system_score_codex":0.0006302152,"about_ca_system_score_gemma":0.0010959134,"threshold_uncertainty_score":0.0051345825},"labels":[],"label_agreement":null},{"id":"W3139528444","doi":"10.1109/tcomm.2021.3067058","title":"Covert Surveillance via Proactive Eavesdropping Under Channel Uncertainty","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Covert; Transmitter; False alarm; Real-time computing; Transmission (telecommunications); Channel (broadcasting); Wireless; Decoding methods; Computer security; Computer network; Artificial intelligence; Telecommunications","score_opus":0.030790753083949397,"score_gpt":0.26549407510601253,"score_spread":0.23470332202206312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139528444","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.31710774,0.0012054885,0.67408955,0.00034122134,0.00006504285,0.000057744754,0.00007113884,0.00025605527,0.0068060234],"genre_scores_gemma":[0.9951186,0.00021417458,0.004212377,0.00002440392,0.000013485379,0.000011164951,0.000013899871,0.0000062687004,0.00038561827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986603,0.00037022366,0.000043063974,0.0002036206,0.000381284,0.00034137943],"domain_scores_gemma":[0.99298286,0.004896454,0.0010398444,0.0003073737,0.00061247195,0.00016102735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125515,0.0013176723,0.00100674,0.00054323685,0.00067788386,0.0010669592,0.0006768284,0.00089775806,0.00058842],"category_scores_gemma":[0.006045751,0.00032363605,0.00057088543,0.00053209614,0.0014848652,0.0015991414,0.0014210511,0.00083270844,0.0001077707],"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.00029088542,0.000052346622,0.0023125836,0.00012693454,0.00009718275,0.000644558,0.00015385351,0.94973546,0.018368302,0.011606797,0.00038585652,0.01622531],"study_design_scores_gemma":[0.000005543717,0.00010191912,0.0004712061,0.0000069563575,0.000024749112,0.00013300519,0.000032192816,0.99326694,0.004094452,0.0017572575,0.00009166281,0.000014128069],"about_ca_topic_score_codex":0.0016873376,"about_ca_topic_score_gemma":0.0011560026,"teacher_disagreement_score":0.0016873376,"about_ca_system_score_codex":0.000982901,"about_ca_system_score_gemma":0.0007163651,"threshold_uncertainty_score":0.0071314573},"labels":[],"label_agreement":null},{"id":"W3143629415","doi":"10.1109/tcomm.2021.3068958","title":"Popularity and Size-Aware Caching With Cooperative Transmission in Hybrid Microwave/ Millimeter Wave Heterogeneous Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","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":"University of Calgary","funders":"","keywords":"Computer science; Cache; Computer network; Heterogeneous network; Transmission (telecommunications); Base station; Wireless network; Algorithm; Wireless; Telecommunications","score_opus":0.016208010567981726,"score_gpt":0.2294756949494414,"score_spread":0.21326768438145965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143629415","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.20407432,0.0008831017,0.790823,0.00020584655,0.000051009523,0.00004754447,0.00008196213,0.00028770234,0.003545576],"genre_scores_gemma":[0.985369,0.00015600982,0.013632864,0.00003106431,0.000024225972,0.000022243301,0.000021839804,0.000010531952,0.0007322112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943763,0.00017705598,0.00002077324,0.000097396805,0.00015481656,0.0001123762],"domain_scores_gemma":[0.997624,0.0013215574,0.00031747593,0.00027439016,0.00037698288,0.00008554003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081750855,0.0005895967,0.00067547517,0.00050215865,0.00047732008,0.00074158254,0.0014087543,0.00052117184,0.00048676992],"category_scores_gemma":[0.002954131,0.00024875937,0.00029869424,0.0009352183,0.0007673556,0.0016348065,0.00085460936,0.0003294255,0.00010295534],"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.00026307956,0.00008195865,0.0026247723,0.000103692226,0.000075838405,0.00049922965,0.00013879656,0.8981488,0.019543633,0.028341096,0.0012413277,0.04893784],"study_design_scores_gemma":[0.000007282068,0.000056143912,0.00034790055,0.0000034356813,0.000018649738,0.000098662196,0.000031940024,0.99397355,0.0018451555,0.0032584995,0.00034427116,0.0000145810145],"about_ca_topic_score_codex":0.003691276,"about_ca_topic_score_gemma":0.0067758136,"teacher_disagreement_score":0.003691276,"about_ca_system_score_codex":0.0010458342,"about_ca_system_score_gemma":0.0005868831,"threshold_uncertainty_score":0.007588148},"labels":[],"label_agreement":null},{"id":"W3146700414","doi":"","title":"Linear estimation of correlated data in wireless sensor networks with optimum power allocation and analog modulation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Fusion center; Fading; Distortion (music); Minimum mean square error; Additive white Gaussian noise; Mean squared error; Estimator; Algorithm; Mathematics; Sensor fusion; Wireless sensor network; Gaussian; Computer science; Mathematical optimization; Statistics; White noise; Telecommunications; Wireless; Decoding methods; Cognitive radio; Artificial intelligence; Bandwidth (computing)","score_opus":0.032384170415019765,"score_gpt":0.26128573440116365,"score_spread":0.2289015639861439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146700414","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.020428026,0.00091051153,0.9766036,0.0002559515,0.000021191792,0.000025216614,0.000021657546,0.000051897496,0.0016819665],"genre_scores_gemma":[0.839854,0.0017751919,0.1550591,0.0001578268,0.00008787518,0.00012982752,0.000056719713,0.000036890557,0.0028425048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988657,0.0005258421,0.00004073599,0.00015320706,0.00032954532,0.00008491883],"domain_scores_gemma":[0.9967789,0.0026342275,0.00023783006,0.00011856766,0.0002044594,0.000025917063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017771391,0.0007449005,0.00086677144,0.0004854153,0.00032449956,0.00085516006,0.00071741076,0.00084656774,0.0006281967],"category_scores_gemma":[0.009144875,0.0005417978,0.00036858208,0.0010481208,0.0014502013,0.0021062675,0.0010401213,0.00066763,0.0001561282],"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.000039855837,0.000013205075,0.00024835963,0.00006310041,0.000017850269,0.000044757908,0.00004276348,0.9741054,0.00083380763,0.013620516,0.00013669129,0.010833548],"study_design_scores_gemma":[0.000006912463,0.00001977869,0.00007264488,0.000007567784,0.0000047390236,0.00001548167,0.00000852165,0.99424744,0.00051137747,0.004964319,0.00013688329,0.0000043384834],"about_ca_topic_score_codex":0.0020306944,"about_ca_topic_score_gemma":0.0017955004,"teacher_disagreement_score":0.0020306944,"about_ca_system_score_codex":0.00096346193,"about_ca_system_score_gemma":0.00068863336,"threshold_uncertainty_score":0.00939852},"labels":[],"label_agreement":null},{"id":"W3150752166","doi":"10.1109/tcomm.2021.3070892","title":"Spectrum Sensing for Symmetric α-Stable Noise Model With Convolutional Neural Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":25,"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":"Gaussian noise; Computer science; Noise (video); Robustness (evolution); Impulse noise; Detector; Convolutional neural network; Additive white Gaussian noise; Cognitive radio; Noise measurement; Algorithm; Artificial intelligence; Channel (broadcasting); Noise reduction; Telecommunications; Wireless","score_opus":0.029720792999199462,"score_gpt":0.24856221361330144,"score_spread":0.21884142061410197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150752166","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.10389128,0.0006284239,0.8909523,0.00027192844,0.00004432565,0.000028986615,0.00011258374,0.00031784255,0.0037522735],"genre_scores_gemma":[0.97482616,0.00030459143,0.02264055,0.000065182554,0.000018621813,0.000021298663,0.00007872323,0.00001823828,0.0020266715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997378,0.000053310894,0.000013264615,0.00007864847,0.00005979255,0.000057225123],"domain_scores_gemma":[0.9994598,0.00029130196,0.000091378475,0.000038667364,0.00010122222,0.00001761043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916432,0.0006750887,0.0005528329,0.00032401734,0.0002374652,0.0005397229,0.00077982625,0.0006702907,0.00074858137],"category_scores_gemma":[0.0020128395,0.0002790925,0.0004853334,0.0003300256,0.0005230169,0.0009018982,0.0005953804,0.00062455446,0.00012953383],"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.00011769726,0.000029556582,0.0012779352,0.00006323753,0.000037381233,0.00009704455,0.000042756183,0.94950897,0.004594953,0.015201918,0.00038397041,0.028644588],"study_design_scores_gemma":[8.7152677e-7,0.0000062249132,0.00005971476,0.0000014527697,0.000002431542,0.0000066476464,0.000001491229,0.9984952,0.0003096911,0.0010812194,0.000033232656,0.0000017498614],"about_ca_topic_score_codex":0.011129143,"about_ca_topic_score_gemma":0.008576873,"teacher_disagreement_score":0.011129143,"about_ca_system_score_codex":0.00090358756,"about_ca_system_score_gemma":0.0007978795,"threshold_uncertainty_score":0.022128701},"labels":[],"label_agreement":null},{"id":"W3153816843","doi":"10.1109/tcomm.2021.3104225","title":"Multi-Point Coordination in Massive MIMO Systems With Sectorized Antennas","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"New York University; National Science Foundation","keywords":"Precoding; MIMO; Computer science; Telecommunications link; Throughput; Transmitter power output; Base station; Power control; Computer network; Cellular network; Channel (broadcasting); Power (physics); Transmitter; Telecommunications; Wireless; Physics","score_opus":0.028411254150382773,"score_gpt":0.2605340669703282,"score_spread":0.23212281281994546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153816843","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.080748394,0.00029415503,0.9149125,0.00015490479,0.0000322818,0.000025382464,0.00005438105,0.00015161672,0.003626294],"genre_scores_gemma":[0.97441065,0.00016769161,0.02427647,0.000045582932,0.000026732248,0.000029883131,0.000020561049,0.000011344586,0.0010110089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.0002793703,0.000018456329,0.000099989054,0.00015062059,0.000121380406],"domain_scores_gemma":[0.9989735,0.00054691714,0.00019129932,0.0001290976,0.000111253015,0.00004804462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089861127,0.00048347932,0.00044597706,0.0001920756,0.00034614204,0.0007878359,0.00049861835,0.00038956598,0.0007850504],"category_scores_gemma":[0.002104258,0.00025795228,0.00025295973,0.0004253973,0.0007060307,0.0006150414,0.0006245054,0.00043811783,0.00020551457],"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.00010748297,0.000025298348,0.0007232715,0.000029958674,0.000022159982,0.00016786689,0.00007317438,0.9495261,0.0055019977,0.030586679,0.0005554312,0.012680664],"study_design_scores_gemma":[0.000008353465,0.00004350033,0.00017480551,0.0000030356239,0.0000058597057,0.00003569998,0.000019851886,0.990042,0.0011606661,0.008222323,0.00027816818,0.0000057210955],"about_ca_topic_score_codex":0.0013766912,"about_ca_topic_score_gemma":0.0016337016,"teacher_disagreement_score":0.0013766912,"about_ca_system_score_codex":0.0006238222,"about_ca_system_score_gemma":0.0004988256,"threshold_uncertainty_score":0.0047523975},"labels":[],"label_agreement":null},{"id":"W3157654480","doi":"10.1109/tcomm.2021.3077935","title":"Robust Deception Scheme for Secure Interference Exploitation Under PSK Modulations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"Key Science and Technology Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Deception; Channel state information; Transmission (telecommunications); Interference (communication); Artificial noise; Overhead (engineering); Channel (broadcasting); Precoding; Transmitter; Relaxation (psychology); Antenna (radio); Wireless; Computer network; Electronic engineering; Telecommunications; MIMO; Engineering","score_opus":0.09581227425649212,"score_gpt":0.2970397573741499,"score_spread":0.20122748311765776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157654480","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.013570721,0.00022938405,0.9841462,0.000105945255,0.000023311091,0.000025638628,0.000016707576,0.00007994894,0.0018022419],"genre_scores_gemma":[0.8629959,0.00050052337,0.13391235,0.00010185521,0.00004742529,0.00008080573,0.000044485532,0.000020438001,0.0022962554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868435,0.00043563734,0.0000612306,0.00017240185,0.0004718028,0.00017466414],"domain_scores_gemma":[0.99837387,0.0008412134,0.00027979715,0.00022750384,0.00020528617,0.000072240844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012678354,0.00087906834,0.0008655833,0.0004240391,0.00046784818,0.000991596,0.0011377026,0.00084785454,0.0011135017],"category_scores_gemma":[0.003649609,0.0002789571,0.00056826114,0.00067628967,0.0010473706,0.0014014569,0.0015015518,0.0016134284,0.00034710052],"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.00030928245,0.00007211377,0.00056735077,0.00019517234,0.00008031718,0.00031516212,0.00026417244,0.8148435,0.020829458,0.08211258,0.0010549739,0.079356015],"study_design_scores_gemma":[0.000012858269,0.00006231592,0.000049594437,0.0000089127125,0.000008490623,0.00007698403,0.00001654431,0.9906502,0.0032744699,0.0054975213,0.00033213722,0.000010035158],"about_ca_topic_score_codex":0.0009090889,"about_ca_topic_score_gemma":0.0006988565,"teacher_disagreement_score":0.0012678354,"about_ca_system_score_codex":0.00071854796,"about_ca_system_score_gemma":0.0009194871,"threshold_uncertainty_score":0.0067050457},"labels":[],"label_agreement":null},{"id":"W3160735954","doi":"10.1109/tcomm.2021.3075523","title":"K-Means Clustering-Aided Non-Coherent Detection for Molecular Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","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":"York University","funders":"European Commission","keywords":"Cluster analysis; Computer science; Transmission (telecommunications); Detector; Interference (communication); Bit error rate; Channel (broadcasting); Algorithm; Artificial intelligence; Decoding methods; Telecommunications","score_opus":0.026966955219374342,"score_gpt":0.2640879482571508,"score_spread":0.23712099303777648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160735954","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.011058297,0.000598844,0.9869515,0.00012784259,0.000045462686,0.000027928118,0.000024986803,0.00014314594,0.0010219886],"genre_scores_gemma":[0.43549138,0.0009585898,0.55808973,0.00020683472,0.00007244732,0.0001586726,0.00014932433,0.00008580963,0.0047871773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992843,0.0002278373,0.00003498563,0.00016106071,0.00024152633,0.00005015036],"domain_scores_gemma":[0.9990716,0.00045329172,0.00012280869,0.000108971515,0.00022244248,0.00002081492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000686074,0.00069062936,0.0007869368,0.00056891306,0.00048591764,0.0007742455,0.0012441523,0.00095971406,0.00093382306],"category_scores_gemma":[0.0027071906,0.00031993844,0.0004887499,0.0010748089,0.0007985982,0.001329429,0.0007748049,0.00084760773,0.00042177126],"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.00022195048,0.00010198876,0.0006660848,0.00032074976,0.00013446297,0.00012722179,0.00032236092,0.7442527,0.03181053,0.07197958,0.0021893196,0.14787307],"study_design_scores_gemma":[0.0000043745245,0.000022418195,0.00009554471,0.000004606524,0.0000055255946,0.000022434988,0.000011226017,0.9893148,0.004405311,0.0055616056,0.00053903,0.000013253215],"about_ca_topic_score_codex":0.0027187893,"about_ca_topic_score_gemma":0.0031496584,"teacher_disagreement_score":0.0027187893,"about_ca_system_score_codex":0.0011322977,"about_ca_system_score_gemma":0.0011468782,"threshold_uncertainty_score":0.008215427},"labels":[],"label_agreement":null},{"id":"W3164808597","doi":"10.1109/tcomm.2023.3256415","title":"Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"McMaster University","funders":"","keywords":"Intersymbol interference; Computer science; Markov chain; Markov process; Nyquist ISI criterion; Mathematical optimization; Secrecy; Iterative method; Interference (communication); Algorithm; Mathematics; Decoding methods; Computer network; Channel (broadcasting); Statistics; Computer security","score_opus":0.06085588529188848,"score_gpt":0.28098068462304443,"score_spread":0.22012479933115595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164808597","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.12381711,0.0007609943,0.8530121,0.00056017295,0.000046181623,0.0000650884,0.0006656871,0.00026737677,0.020805307],"genre_scores_gemma":[0.9780766,0.00084645895,0.018418679,0.000056213572,0.00004552939,0.000119903634,0.0002022017,0.0000525014,0.0021818518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853575,0.0004959312,0.000050654595,0.0001690712,0.00047688445,0.00027170798],"domain_scores_gemma":[0.9923889,0.0059248833,0.00052616,0.00048665603,0.0005434583,0.00012979642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016314354,0.0010085304,0.00097487995,0.00071037206,0.0005328673,0.0017342097,0.0014265337,0.0008973958,0.0028094237],"category_scores_gemma":[0.008240204,0.00039329822,0.00047809712,0.0013992884,0.0021002237,0.002427548,0.0015289941,0.001273255,0.00047225103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009617301,0.00002655489,0.0002172708,0.0001451539,0.000026183641,0.00026232365,0.000083297666,0.8261541,0.0035327142,0.16247804,0.0006017607,0.006376308],"study_design_scores_gemma":[0.000008469805,0.00001675108,0.00011442561,0.000022916634,0.000006379871,0.000043967455,0.000019989235,0.93520445,0.0018883332,0.062362444,0.00029863187,0.000013240939],"about_ca_topic_score_codex":0.002080915,"about_ca_topic_score_gemma":0.00121301,"teacher_disagreement_score":0.0028094237,"about_ca_system_score_codex":0.0014668341,"about_ca_system_score_gemma":0.0015733751,"threshold_uncertainty_score":0.010642707},"labels":[],"label_agreement":null},{"id":"W3164862323","doi":"10.1109/tcomm.2021.3082779","title":"Covert Transmission Assisted by Intelligent Reflecting Surface","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":127,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Beamforming; Channel state information; Transmission (telecommunications); Transmitter power output; Optimization problem; Algorithm; Mathematical optimization; Relaxation (psychology); Channel (broadcasting); Mathematics; Wireless; Telecommunications","score_opus":0.054788839119600995,"score_gpt":0.3152848826105058,"score_spread":0.2604960434909048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164862323","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.1310679,0.000694348,0.8536495,0.00042686865,0.00010441649,0.000045764646,0.00009391557,0.00028398455,0.013633286],"genre_scores_gemma":[0.9753768,0.0003268681,0.02190416,0.000052062616,0.000028155937,0.000030206018,0.00004235899,0.000019498828,0.0022200593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.00022406041,0.000017872744,0.00012619949,0.00026916497,0.00019661662],"domain_scores_gemma":[0.9986964,0.00065406493,0.0002723705,0.00016140651,0.00016096426,0.00005484692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711635,0.0010051357,0.0009990318,0.00046601507,0.00061748544,0.00080501166,0.00086168194,0.0008632874,0.0015041278],"category_scores_gemma":[0.0020099652,0.00025914787,0.0006514644,0.0008547173,0.0012151108,0.001468563,0.0013606002,0.00067778764,0.00029508903],"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.00028180043,0.000053881016,0.0011985396,0.00015947116,0.00006877765,0.0008623059,0.00018063214,0.90546656,0.024675122,0.031287648,0.0014082035,0.0343571],"study_design_scores_gemma":[0.0000058036167,0.000061993036,0.00012644481,0.0000040188097,0.000010584256,0.00011563261,0.000030321815,0.9936645,0.0031051894,0.0024754438,0.00038850197,0.000011670674],"about_ca_topic_score_codex":0.0017487713,"about_ca_topic_score_gemma":0.0015400223,"teacher_disagreement_score":0.0017487713,"about_ca_system_score_codex":0.0008142797,"about_ca_system_score_gemma":0.0005977064,"threshold_uncertainty_score":0.0059080124},"labels":[],"label_agreement":null},{"id":"W3166530189","doi":"10.1109/tcomm.2021.3094509","title":"Joint Active and Passive Beamforming Design for IRS-Assisted Multi-User MIMO Systems: A VAMP-Based Approach","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coordinate descent; Beamforming; Computer science; Optimization problem; MIMO; Telecommunications link; Minimum mean square error; Robustness (evolution); Mathematical optimization; Base station; Algorithm; Control theory (sociology); Mathematics; Telecommunications; Estimator","score_opus":0.10417126347042943,"score_gpt":0.29000979088003387,"score_spread":0.18583852740960444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166530189","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.0018015192,0.00007364732,0.9972042,0.000038103877,0.000008789219,0.00001012823,0.0000082307315,0.00005428901,0.0008011445],"genre_scores_gemma":[0.36597553,0.0007204507,0.6262631,0.00017529908,0.00015642135,0.00029876025,0.00013891548,0.000089500805,0.0061819986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945396,0.000198456,0.00002067316,0.00008286711,0.0001940974,0.000049856088],"domain_scores_gemma":[0.9994535,0.00026662028,0.000061844774,0.00005108667,0.00014540253,0.000021618567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071409676,0.0012356279,0.0008449366,0.00032712304,0.00023994457,0.00096899,0.0011873195,0.0010682737,0.0018530648],"category_scores_gemma":[0.0016384607,0.0005969355,0.0006420152,0.00047554597,0.0006658074,0.001084916,0.00093023764,0.00084958883,0.00081132265],"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.000103037375,0.00004154662,0.000312002,0.00015638777,0.0000683379,0.00008537587,0.00010297549,0.8694395,0.015363122,0.021761889,0.000985865,0.0915799],"study_design_scores_gemma":[0.0000084346775,0.000059255926,0.000050948107,0.0000069265666,0.00000945214,0.000035233017,0.000010605194,0.99367416,0.0021003052,0.0032117267,0.0008262276,0.0000068676445],"about_ca_topic_score_codex":0.000662538,"about_ca_topic_score_gemma":0.00073190714,"teacher_disagreement_score":0.0018530648,"about_ca_system_score_codex":0.00038124013,"about_ca_system_score_gemma":0.0006572232,"threshold_uncertainty_score":0.006199181},"labels":[],"label_agreement":null},{"id":"W3170007158","doi":"10.1109/tcomm.2021.3086535","title":"Caching Transient Content for IoT Sensing: Multi-Agent Soft Actor-Critic","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":69,"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":"Natural Sciences and Engineering Research Council of Canada; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Cache; Computer science; Upload; Cloud computing; Markov decision process; Reinforcement learning; Distributed computing; Computer network; Smart Cache; Enhanced Data Rates for GSM Evolution; Cache algorithms; Real-time computing; Markov process; CPU cache; Telecommunications; Artificial intelligence","score_opus":0.1064839323359109,"score_gpt":0.30545701768773714,"score_spread":0.19897308535182623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170007158","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.06375908,0.00057373266,0.92965096,0.0006610349,0.00012945879,0.000056981124,0.000058413112,0.0003509292,0.004759301],"genre_scores_gemma":[0.9855494,0.00013815875,0.012391713,0.000117132775,0.000029843131,0.000053898984,0.000038955717,0.000021478092,0.0016593968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.00019950132,0.000025940653,0.0001171301,0.00010489747,0.000079933474],"domain_scores_gemma":[0.9975078,0.0017084118,0.00028796998,0.0000871415,0.0002824742,0.00012616233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014825742,0.0010639243,0.0012269544,0.0003227108,0.00032619157,0.0011054813,0.0011846218,0.0012367882,0.0010504419],"category_scores_gemma":[0.0037809862,0.0004745638,0.0005045088,0.00034207126,0.00115606,0.00078705413,0.00091710285,0.001559183,0.00017085437],"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.000042596235,0.000019089553,0.0004125442,0.00002110147,0.000022692915,0.000046132813,0.000018743534,0.9939027,0.00032408797,0.0020085261,0.00018627642,0.002995428],"study_design_scores_gemma":[0.0000034599846,0.000006292186,0.000025304194,0.0000013989911,0.0000025309441,0.0000021332514,0.0000019948193,0.9994814,0.000039271894,0.00040611267,0.00002912442,0.000001098219],"about_ca_topic_score_codex":0.009357079,"about_ca_topic_score_gemma":0.0063238316,"teacher_disagreement_score":0.009357079,"about_ca_system_score_codex":0.0010600544,"about_ca_system_score_gemma":0.0010888351,"threshold_uncertainty_score":0.018605173},"labels":[],"label_agreement":null},{"id":"W3172818029","doi":"10.1109/tcomm.2021.3088898","title":"Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":406,"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; McGill University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Beamforming; Telecommunications link; Computer science; Mathematical optimization; Optimization problem; Convex optimization; Iterative method; Base station; Communications satellite; Satellite; Algorithm; Mathematics; Telecommunications; Regular polygon; Engineering","score_opus":0.03608583246600989,"score_gpt":0.25723979008194703,"score_spread":0.22115395761593715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172818029","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.0089800535,0.00021172641,0.9890276,0.00005006429,0.000010970984,0.000012222872,0.000017625594,0.000042652337,0.001647067],"genre_scores_gemma":[0.79039824,0.0008837674,0.205254,0.00010260302,0.00004704655,0.00009235245,0.00007730979,0.000026143078,0.003118556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958676,0.0001550115,0.000015133844,0.000052873816,0.00013684623,0.00005345556],"domain_scores_gemma":[0.999554,0.0002391463,0.00007827308,0.000040552542,0.00007116134,0.000016835715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007219174,0.0008082145,0.0005094954,0.00027877896,0.00024785218,0.0005597846,0.00043206004,0.00052911777,0.0012499546],"category_scores_gemma":[0.0010027216,0.00026363012,0.0003530503,0.0007817723,0.00057304144,0.0008672197,0.000703569,0.0005406757,0.00029947984],"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.00007974898,0.000027040254,0.0003520667,0.00007036105,0.00003994633,0.00007021612,0.00004685264,0.91496,0.01289267,0.031858042,0.00048892346,0.03911412],"study_design_scores_gemma":[0.0000071198765,0.00005087,0.00006542405,0.000005399286,0.000007896355,0.000028405511,0.000010850843,0.99353796,0.0020874946,0.0036931504,0.0004990279,0.0000064960705],"about_ca_topic_score_codex":0.00090610376,"about_ca_topic_score_gemma":0.0012008162,"teacher_disagreement_score":0.0012499546,"about_ca_system_score_codex":0.000423539,"about_ca_system_score_gemma":0.00043794076,"threshold_uncertainty_score":0.004181564},"labels":[],"label_agreement":null},{"id":"W3173445790","doi":"10.1109/tcomm.2021.3093331","title":"Joint Sparse Observation and Coding Design for Multiple Phenomena Monitoring","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Linear network coding; Computer science; Coding (social sciences); Energy consumption; Power consumption; Convex optimization; Power (physics); Real-time computing; Algorithm; Regular polygon; Computer network; Mathematics; Engineering","score_opus":0.14802491627745495,"score_gpt":0.2861491786325252,"score_spread":0.13812426235507025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173445790","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.0049722968,0.00008063779,0.9942115,0.000088946115,0.000011293961,0.000016376063,0.000027249522,0.00005957283,0.0005320495],"genre_scores_gemma":[0.7067066,0.0005865013,0.28957844,0.000193535,0.00008802437,0.00027505364,0.000268295,0.000043674743,0.0022599008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990176,0.0003265711,0.000042165444,0.0001922594,0.00031636635,0.000105111],"domain_scores_gemma":[0.9980445,0.001086915,0.00027559538,0.0001976043,0.00032778617,0.00006770181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010858363,0.00083727384,0.00076916756,0.00041982956,0.0003754103,0.000660292,0.0009752222,0.00071379024,0.0011385167],"category_scores_gemma":[0.0037793987,0.00038594345,0.00052588875,0.00087620126,0.0008050424,0.0016773312,0.0014338722,0.0010746855,0.00024708794],"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.0003129408,0.000081413134,0.0010201824,0.0001944573,0.00007661605,0.00018571036,0.00024061487,0.7964228,0.025826069,0.053256784,0.001923728,0.12045868],"study_design_scores_gemma":[0.000014083335,0.00005287447,0.00011973289,0.0000066074776,0.000013223547,0.00004561282,0.0000146045195,0.9872565,0.0022679346,0.009674671,0.00052283023,0.000011403107],"about_ca_topic_score_codex":0.001975365,"about_ca_topic_score_gemma":0.0022204162,"teacher_disagreement_score":0.001975365,"about_ca_system_score_codex":0.0005367425,"about_ca_system_score_gemma":0.0010378922,"threshold_uncertainty_score":0.0057424903},"labels":[],"label_agreement":null},{"id":"W3178826893","doi":"10.1109/tcomm.2021.3096559","title":"UAV-Aided Ultra-Reliable Low-Latency Computation Offloading in Future IoT Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Computation offloading; Latency (audio); Internet of Things; Computer network; Embedded system; Distributed computing; Telecommunications; Edge computing; Algorithm","score_opus":0.01105959361391108,"score_gpt":0.22766019802114404,"score_spread":0.21660060440723297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178826893","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.06125744,0.00047267447,0.9331876,0.0003776932,0.000043330994,0.00007153099,0.00008805279,0.00023984331,0.004261855],"genre_scores_gemma":[0.87788093,0.00035432685,0.118713096,0.00009194024,0.000025850835,0.00015375698,0.00011139782,0.00006821208,0.0026004831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.00011214462,0.000012538556,0.000058039655,0.00006569151,0.00009385326],"domain_scores_gemma":[0.9993736,0.0004201673,0.000081128004,0.000035140274,0.00005063974,0.00003937705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072848,0.0007530844,0.00096777035,0.00021062404,0.00040995557,0.0010853182,0.0007844573,0.0008694267,0.0012812188],"category_scores_gemma":[0.0016418518,0.0004175623,0.00045342467,0.0004269158,0.0005356776,0.00077614165,0.0008111908,0.0007135648,0.00017297188],"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.00003916848,0.000012626876,0.00019794657,0.00003265936,0.00000576753,0.000047774058,0.000022306718,0.9901046,0.0007815191,0.0028462773,0.0002662583,0.005643016],"study_design_scores_gemma":[0.0000027082735,0.000009645093,0.000039887957,0.000002735065,0.0000017184948,0.00000734729,0.000010655464,0.99862146,0.00020431916,0.000971669,0.00012660056,0.0000012359193],"about_ca_topic_score_codex":0.0070534186,"about_ca_topic_score_gemma":0.005934092,"teacher_disagreement_score":0.0070534186,"about_ca_system_score_codex":0.0007882696,"about_ca_system_score_gemma":0.0010209987,"threshold_uncertainty_score":0.014024675},"labels":[],"label_agreement":null},{"id":"W3188476661","doi":"10.1109/tcomm.2021.3102641","title":"A Unified MIMO Optimization Framework Relying on the KKT Conditions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"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 Alberta","funders":"Engineering and Physical Sciences Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Karush–Kuhn–Tucker conditions; Mathematics; MIMO; Weighting; Mathematical optimization; Covariance matrix; Covariance; Applied mathematics; Topology (electrical circuits); Algorithm; Beamforming; Combinatorics","score_opus":0.03432338657052311,"score_gpt":0.27284112252192116,"score_spread":0.23851773595139805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188476661","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.0008646189,0.0002693381,0.99522746,0.00013909963,0.000039259485,0.000022004751,0.00006772487,0.000056883237,0.0033134941],"genre_scores_gemma":[0.3493066,0.0047538313,0.6330112,0.0007083458,0.0006490217,0.00075863634,0.000713508,0.00018238448,0.009916451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854636,0.0004929794,0.00007531803,0.0002879349,0.00047092134,0.00012652407],"domain_scores_gemma":[0.99955314,0.0001540218,0.00007136469,0.000060823662,0.00013738991,0.00002328173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421876,0.0018061367,0.0017374239,0.00069939747,0.0005677449,0.0018724226,0.001132959,0.0012401136,0.0029588619],"category_scores_gemma":[0.0017287353,0.00061820296,0.0012776569,0.0010332351,0.0011264887,0.0019962215,0.0014751274,0.0018504135,0.0011696428],"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.000038700335,0.000040017367,0.00015135661,0.00019940508,0.00006087981,0.00015483041,0.00007421431,0.61717415,0.0039568963,0.3389131,0.004142744,0.03509378],"study_design_scores_gemma":[0.000017055825,0.000077735625,0.0001138995,0.000027304091,0.000021844524,0.00007470616,0.000022061502,0.9141093,0.0013339887,0.080070116,0.0040964168,0.000035721387],"about_ca_topic_score_codex":0.0015935656,"about_ca_topic_score_gemma":0.0013874691,"teacher_disagreement_score":0.0029588619,"about_ca_system_score_codex":0.00094050914,"about_ca_system_score_gemma":0.002086813,"threshold_uncertainty_score":0.009898365},"labels":[],"label_agreement":null},{"id":"W3189202224","doi":"10.1109/tcomm.2021.3097726","title":"Deep Learning Optimized Sparse Antenna Activation for Reconfigurable Intelligent Surface Assisted Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Antenna (radio); Reconfigurable antenna; Electronic engineering; Smart antenna; Channel state information; Channel (broadcasting); Directional antenna; Wireless; Engineering; Computer network; Telecommunications; Radiation pattern; Antenna efficiency","score_opus":0.050836460090818845,"score_gpt":0.28157925751726753,"score_spread":0.23074279742644868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189202224","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.054720864,0.00037309286,0.9407994,0.00025123724,0.000038665148,0.00001679508,0.000047396534,0.00055222696,0.003200307],"genre_scores_gemma":[0.90722305,0.00020985254,0.088489436,0.00020943029,0.00002469195,0.000057970745,0.00012517729,0.00003956467,0.0036208539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988914,0.000026740545,0.0000039024817,0.000024961058,0.000031327956,0.00002381608],"domain_scores_gemma":[0.9998198,0.00009158967,0.000023507191,0.000017771172,0.000035315275,0.000012098089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024600944,0.00046347198,0.00038947669,0.00014831599,0.00012367434,0.00028453558,0.00067015376,0.0005068731,0.0012945043],"category_scores_gemma":[0.0006904079,0.00019796022,0.00026192423,0.00025333892,0.00041019556,0.000557013,0.00050262286,0.000741313,0.0002441732],"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.00009016068,0.00006625349,0.0006801173,0.00004645866,0.000026483569,0.000055906177,0.000033321652,0.8905763,0.008578484,0.005342586,0.0017258269,0.09277811],"study_design_scores_gemma":[0.0000023146667,0.000012386264,0.000027999176,0.0000011306828,0.0000016401927,0.000004637148,0.0000017769452,0.998524,0.0006211649,0.0006836615,0.000118180025,0.0000011320961],"about_ca_topic_score_codex":0.0016884819,"about_ca_topic_score_gemma":0.002590749,"teacher_disagreement_score":0.0016884819,"about_ca_system_score_codex":0.00037447904,"about_ca_system_score_gemma":0.00044392355,"threshold_uncertainty_score":0.004330516},"labels":[],"label_agreement":null},{"id":"W3194106282","doi":"10.1109/tcomm.2022.3160540","title":"Modulating Intelligent Surfaces for Multiuser MIMO Systems: Beamforming and Modulation Design","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":13,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Base station; Telecommunications link; Modulation (music); Optimization problem; Notation; MIMO; Set (abstract data type); Computer science; Mathematics; Mathematical optimization; Algorithm; Telecommunications; Acoustics; Arithmetic","score_opus":0.06546507744018185,"score_gpt":0.27681455023122487,"score_spread":0.21134947279104302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194106282","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.0077362102,0.000621903,0.9851062,0.00019040023,0.000051042334,0.000027552715,0.000024282279,0.00012629243,0.006116033],"genre_scores_gemma":[0.5467833,0.0022747854,0.44144398,0.00031940642,0.00018954459,0.00019015654,0.0001089476,0.00008466176,0.008605242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975127,0.00007024233,0.0000097116,0.000040131796,0.00010336491,0.000025418234],"domain_scores_gemma":[0.9998074,0.00006919995,0.00003415993,0.00003145151,0.00004562641,0.000012154489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541552,0.0007125326,0.00039465295,0.00025256473,0.00016305498,0.00085620454,0.0004811211,0.00071787374,0.0017193616],"category_scores_gemma":[0.00054046395,0.0002339843,0.00033336808,0.0004424114,0.000493625,0.0006881839,0.0005780281,0.0006342793,0.00082137453],"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.00014710658,0.000086205466,0.001097248,0.00033616176,0.00006424705,0.00022082387,0.00018847357,0.4323982,0.15581448,0.1405367,0.0033390808,0.2657713],"study_design_scores_gemma":[0.000011863306,0.00015550622,0.0002593344,0.000021958216,0.000016333344,0.00013965793,0.00003667188,0.95265985,0.019540947,0.016048845,0.01108423,0.000024749295],"about_ca_topic_score_codex":0.0003217045,"about_ca_topic_score_gemma":0.0004503023,"teacher_disagreement_score":0.0017193616,"about_ca_system_score_codex":0.00035053515,"about_ca_system_score_gemma":0.00029849014,"threshold_uncertainty_score":0.0057517886},"labels":[],"label_agreement":null},{"id":"W3195227469","doi":"10.1109/tcomm.2021.3106099","title":"Exploiting Impacts of Antenna Selection and Energy Harvesting for Massive Network Connectivity","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":34,"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; Exfo Electro-Optical Engineering (Canada)","funders":"","keywords":"Computer science; Energy harvesting; Throughput; Interference (communication); Transmission (telecommunications); Stochastic geometry; Small cell; Antenna (radio); Selection (genetic algorithm); Cellular network; Noma; Energy (signal processing); Communications system; Electronic engineering; Efficient energy use; Computer network; Distributed computing; Wireless; Telecommunications; Telecommunications link; Engineering; Electrical engineering; Channel (broadcasting); Mathematics","score_opus":0.0251014766377111,"score_gpt":0.2444844166799369,"score_spread":0.2193829400422258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195227469","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.32108575,0.000832035,0.6616147,0.00044630948,0.00006456858,0.0000411359,0.000054493772,0.00017039318,0.015690517],"genre_scores_gemma":[0.9936743,0.00022148693,0.005511645,0.000022844675,0.0000087794315,0.000010029313,0.000007393932,0.0000055095,0.00053799205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998035,0.00008484799,0.0000041602448,0.000024028253,0.000049327416,0.000034124663],"domain_scores_gemma":[0.99930143,0.00053220487,0.00006295731,0.000042659096,0.000038456306,0.00002229313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351547,0.00030705877,0.00028583797,0.00015173743,0.0002487468,0.00051130174,0.00035251456,0.00031497714,0.000878234],"category_scores_gemma":[0.0014361565,0.00013060904,0.00019760887,0.00035680033,0.0005004494,0.00064661296,0.00049156044,0.00029175254,0.00009725414],"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.000119983255,0.00006901515,0.0027287265,0.000100862075,0.000044696662,0.0007324606,0.00013117662,0.88360685,0.04216644,0.04025035,0.00074597175,0.02930352],"study_design_scores_gemma":[0.000004541451,0.000071801456,0.00074833643,0.0000049093037,0.000014841647,0.00014684518,0.000048366386,0.98806053,0.002505327,0.007994562,0.00039315803,0.0000067904275],"about_ca_topic_score_codex":0.00054667756,"about_ca_topic_score_gemma":0.0010927604,"teacher_disagreement_score":0.000878234,"about_ca_system_score_codex":0.00031428903,"about_ca_system_score_gemma":0.000249466,"threshold_uncertainty_score":0.0029380322},"labels":[],"label_agreement":null},{"id":"W3195752840","doi":"10.1109/tcomm.2021.3107582","title":"Nonconvex Regularized Gradient Projection Sparse Reconstruction for Massive MIMO Channel Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; MIMO; Stiefel manifold; Benchmark (surveying); Rate of convergence; Convergence (economics); Mathematics; Channel (broadcasting); Norm (philosophy); Projection (relational algebra); Compressed sensing; Computer science; Mathematical optimization","score_opus":0.041401377492737014,"score_gpt":0.2680507651052697,"score_spread":0.2266493876125327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195752840","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.0021795442,0.00006398038,0.99707913,0.000057068042,0.000013640668,0.000012877682,0.000018421199,0.00015788534,0.0004175014],"genre_scores_gemma":[0.15770435,0.00047163188,0.83817744,0.00014253239,0.00008114616,0.00013696714,0.00027751338,0.00012720803,0.0028811675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961567,0.00012916273,0.000014144205,0.000055471835,0.00014860275,0.000036841477],"domain_scores_gemma":[0.99937207,0.00028199021,0.000080102305,0.000093080926,0.00013919981,0.000033619788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067286624,0.0010263382,0.0007711466,0.00042282254,0.0002688922,0.0006777463,0.00091324915,0.00082493044,0.0014063905],"category_scores_gemma":[0.0021774305,0.0004378185,0.0006193639,0.00077875477,0.0005668419,0.0010235197,0.0010671909,0.0014395501,0.0006013391],"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.00015253035,0.00006484685,0.0005642162,0.00016508387,0.000071633876,0.00013343527,0.00011897601,0.73747617,0.012309151,0.03648173,0.0047590267,0.20770317],"study_design_scores_gemma":[0.0000048030174,0.000012640298,0.00003182268,0.000003063375,0.0000023116445,0.000020977157,0.000004738964,0.9960978,0.0012322601,0.0020753362,0.00050986675,0.0000043778664],"about_ca_topic_score_codex":0.0019516319,"about_ca_topic_score_gemma":0.0025671427,"teacher_disagreement_score":0.0019516319,"about_ca_system_score_codex":0.0003463685,"about_ca_system_score_gemma":0.0010707822,"threshold_uncertainty_score":0.0047048926},"labels":[],"label_agreement":null},{"id":"W3199320363","doi":"10.1109/tcomm.2021.3113948","title":"Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Computer network; Scalability; Dynamic Source Routing; Bottleneck; Distributed computing; Wireless network; Physical layer; Static routing; Wireless Routing Protocol; Routing (electronic design automation); Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Network topology; Wireless; Artificial intelligence; Telecommunications","score_opus":0.03049595639539128,"score_gpt":0.29311828541247237,"score_spread":0.2626223290170811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199320363","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.02296329,0.00028521533,0.97420007,0.0002575303,0.00004600302,0.000030167908,0.00002785869,0.0004470782,0.0017427724],"genre_scores_gemma":[0.93252295,0.0001600887,0.064629585,0.00015284528,0.000046648172,0.00010718296,0.000060395672,0.000051502626,0.0022688103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999534,0.0001356403,0.000018588224,0.000095180825,0.00011376952,0.000102824066],"domain_scores_gemma":[0.99893075,0.0006532543,0.000121880425,0.000079838646,0.0001419711,0.00007220652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845461,0.00084437075,0.0010813026,0.00024796778,0.0003209616,0.0006013471,0.0013813114,0.0008622959,0.0015441948],"category_scores_gemma":[0.002822354,0.000447466,0.00040407604,0.00029557332,0.0010913262,0.0010482845,0.0011051492,0.0016363498,0.00020051833],"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.000031375865,0.000034628352,0.00028212412,0.00002127247,0.000020053149,0.000030754712,0.000018544963,0.97914344,0.00067388784,0.004993445,0.00040689926,0.014343571],"study_design_scores_gemma":[0.0000030171745,0.000005760402,0.00001526616,7.9114e-7,0.0000010311013,0.0000014699865,8.215829e-7,0.9986053,0.00006297751,0.0012575195,0.000045243487,8.532541e-7],"about_ca_topic_score_codex":0.006647949,"about_ca_topic_score_gemma":0.005850926,"teacher_disagreement_score":0.006647949,"about_ca_system_score_codex":0.0013132554,"about_ca_system_score_gemma":0.0013775509,"threshold_uncertainty_score":0.013218522},"labels":[],"label_agreement":null},{"id":"W3199707837","doi":"10.1109/tcomm.2021.3111609","title":"Group-Based Random Access and Data Transmission Scheme for Massive MTC Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":20,"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, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Queue; Random access; Markov chain; Partition (number theory); Computer network; Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.07620587417700127,"score_gpt":0.3394941081480693,"score_spread":0.26328823397106804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199707837","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.020446163,0.00015250608,0.9770757,0.00013520596,0.000040881714,0.000059879356,0.000035312118,0.00019973193,0.0018546287],"genre_scores_gemma":[0.8843753,0.00025357265,0.11187678,0.0001169393,0.000049931325,0.00018274643,0.000101462974,0.000038424572,0.0030048774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.00018418411,0.000033952925,0.00014771565,0.00020855115,0.00012191231],"domain_scores_gemma":[0.9992219,0.0003192168,0.00013129236,0.00010055827,0.00016785345,0.00005921017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079088804,0.0005454253,0.00059740536,0.0004361015,0.00068059,0.0005280808,0.0017193255,0.0005605571,0.0017910199],"category_scores_gemma":[0.0018886952,0.00020258884,0.00058576994,0.00076112925,0.00058706413,0.0010608309,0.0009781744,0.00076569204,0.00033579321],"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.00023122398,0.00015925153,0.00079284335,0.00013658579,0.00005665112,0.00033961446,0.00026405777,0.7651941,0.02034079,0.13979231,0.0042022485,0.06849024],"study_design_scores_gemma":[0.000014250384,0.000029962253,0.000047512924,0.0000021918415,0.000007024979,0.00003883947,0.0000061820106,0.99432373,0.00064925535,0.004409739,0.0004639346,0.0000074229847],"about_ca_topic_score_codex":0.00263229,"about_ca_topic_score_gemma":0.002734152,"teacher_disagreement_score":0.00263229,"about_ca_system_score_codex":0.0011145402,"about_ca_system_score_gemma":0.0010739327,"threshold_uncertainty_score":0.008086622},"labels":[],"label_agreement":null},{"id":"W3200381634","doi":"10.1109/tcomm.2021.3111615","title":"Performance Analysis of Minimum Hop Count-Based Routing Techniques in Millimeter Wave Networks: A Stochastic Geometry Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic geometry; Relay; Computer science; Hop (telecommunications); Extremely high frequency; Probability distribution; Computer network; Electronic engineering; Millimeter; Spectral efficiency; Topology (electrical circuits); Algorithm; Mathematics; Telecommunications; Engineering; Electrical engineering; Statistics; Physics; Optics","score_opus":0.036632621309998045,"score_gpt":0.24754512677167867,"score_spread":0.2109125054616806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200381634","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.12680347,0.0016254971,0.8632791,0.00078397244,0.000055196342,0.00009893625,0.00016719577,0.00028774727,0.0068988493],"genre_scores_gemma":[0.96815455,0.0010814925,0.029414192,0.000080262966,0.000048847,0.000054917957,0.00009873615,0.000032198444,0.0010348038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829155,0.00074223685,0.000047608537,0.00014052317,0.000578822,0.00019922908],"domain_scores_gemma":[0.9945734,0.0038083172,0.00066358683,0.00023074512,0.0006405132,0.0000835239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260442,0.0009684883,0.00079366105,0.0014268652,0.00049265404,0.001111556,0.0011551974,0.00085118355,0.00074449775],"category_scores_gemma":[0.0066818795,0.0004119219,0.0006346624,0.0009853824,0.0009326746,0.0012029238,0.00092823314,0.00051618146,0.00018552678],"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.000039275677,0.000018153816,0.00047328413,0.00003469976,0.000023679073,0.000040191357,0.000026210419,0.9806733,0.0020212925,0.011355792,0.00024911805,0.0050449204],"study_design_scores_gemma":[0.0000016988687,0.000030648873,0.00015542415,0.000002651808,0.000005140345,0.000025076484,0.000007729556,0.99802715,0.0004302563,0.0012154087,0.0000945644,0.0000042178367],"about_ca_topic_score_codex":0.0032238814,"about_ca_topic_score_gemma":0.0023052138,"teacher_disagreement_score":0.0032238814,"about_ca_system_score_codex":0.002324801,"about_ca_system_score_gemma":0.00090326,"threshold_uncertainty_score":0.016867697},"labels":[],"label_agreement":null},{"id":"W3203055641","doi":"10.1109/tcomm.2021.3114764","title":"Weighted Online Fountain Codes With Limited Buffer Size and Feedback Transmissions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Fountain code; Computer science; Overhead (engineering); Transmission (telecommunications); Real-time computing; Computer network; Block code; Decoding methods; Algorithm; Concatenated error correction code; Telecommunications","score_opus":0.029588972418161785,"score_gpt":0.28177046987122895,"score_spread":0.25218149745306717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203055641","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.06569629,0.0011638578,0.92976826,0.00021395304,0.00008602328,0.000068270645,0.00008739336,0.0007201357,0.0021959515],"genre_scores_gemma":[0.85279745,0.0005085387,0.14409383,0.00019591351,0.00007176111,0.00012167714,0.00008591449,0.00006709622,0.002057796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985177,0.00029143287,0.00007740547,0.00025646898,0.000571473,0.0002855977],"domain_scores_gemma":[0.994578,0.0023073333,0.0007919713,0.00092250167,0.0012545855,0.00014558173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010062611,0.0012877426,0.0008056451,0.0008491429,0.0006908057,0.0009653102,0.0016390582,0.0009895859,0.0010379534],"category_scores_gemma":[0.009158915,0.00026208485,0.00031460647,0.0010677985,0.0010791149,0.0023533201,0.0012103687,0.0010210965,0.0002893098],"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.0015495182,0.00018895655,0.004143549,0.00043331378,0.00012253565,0.0007673884,0.00068323786,0.5368965,0.07432237,0.080254816,0.0039010255,0.29673672],"study_design_scores_gemma":[0.000028824594,0.00014993352,0.0003264187,0.000034756464,0.000024280496,0.00032667266,0.000052252868,0.97239065,0.014511005,0.0104591185,0.0016493773,0.00004671181],"about_ca_topic_score_codex":0.0046283603,"about_ca_topic_score_gemma":0.004537329,"teacher_disagreement_score":0.0046283603,"about_ca_system_score_codex":0.001051143,"about_ca_system_score_gemma":0.0017226253,"threshold_uncertainty_score":0.009202838},"labels":[],"label_agreement":null},{"id":"W3203387279","doi":"10.1109/tcomm.2021.3117599","title":"Multi-RIS-Aided Wireless Systems: Statistical Characterization and Performance Analysis","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":238,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Ministry of Science and Technology, Taiwan; National Science Foundation","keywords":"Ergodic theory; Fading; Independent and identically distributed random variables; Wireless; Channel (broadcasting); Computer science; Outage probability; Topology (electrical circuits); Algorithm; Random variable; Mathematics; Computer network; Telecommunications; Statistics","score_opus":0.02745581189989359,"score_gpt":0.26052869973748877,"score_spread":0.23307288783759517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203387279","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.06304756,0.0006356768,0.93318903,0.00023619442,0.000027705733,0.00006394359,0.00013407222,0.00022741775,0.0024383615],"genre_scores_gemma":[0.9724043,0.0008461831,0.024493624,0.00009885748,0.00007121387,0.00011289017,0.00014540368,0.00003968233,0.0017878504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981243,0.0005720983,0.000077900666,0.0003163576,0.000630891,0.00027849508],"domain_scores_gemma":[0.99336773,0.003740245,0.0013701094,0.0006121393,0.0007987465,0.000111085006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018452782,0.001303479,0.0011190638,0.001006195,0.00041918652,0.0012920826,0.0014551019,0.0011670381,0.00097177335],"category_scores_gemma":[0.0077115973,0.0006770968,0.00062574376,0.0016301024,0.0017644907,0.00233018,0.0011597815,0.0011254745,0.00033867566],"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.000040557014,0.000032176482,0.0023421661,0.000065039385,0.000039818686,0.00020616793,0.0000667645,0.9623097,0.0033132483,0.02265664,0.0003012937,0.008626425],"study_design_scores_gemma":[0.0000016888944,0.0000231629,0.00042397925,0.000003350488,0.0000064326023,0.000071395356,0.000015666332,0.9964651,0.00060952944,0.0022199114,0.00015123554,0.000008512294],"about_ca_topic_score_codex":0.0026516619,"about_ca_topic_score_gemma":0.0022921937,"teacher_disagreement_score":0.0026516619,"about_ca_system_score_codex":0.0015546437,"about_ca_system_score_gemma":0.0009937561,"threshold_uncertainty_score":0.011279762},"labels":[],"label_agreement":null},{"id":"W3203705619","doi":"10.1109/tcomm.2021.3115115","title":"Joint Optimization of Trajectory and Communication Resource Allocation for Unmanned Surface Vehicle Enabled Maritime Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":85,"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, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China","keywords":"Resource allocation; Computer science; Throughput; Wireless; Transmission (telecommunications); Base station; Telecommunications link; Wireless network; Computer network; Optimization problem; Real-time computing; Telecommunications; Algorithm","score_opus":0.016451570641529255,"score_gpt":0.21763369664278237,"score_spread":0.20118212600125313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203705619","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.034269597,0.00042524355,0.9623479,0.0002296933,0.000032402062,0.000038168877,0.00005030821,0.00011108162,0.0024954975],"genre_scores_gemma":[0.8819943,0.0006500313,0.11288257,0.00008830496,0.000042298245,0.000180217,0.00014583372,0.000088815075,0.003927657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999559,0.00016827637,0.000012057135,0.0000744103,0.00008611642,0.000100123216],"domain_scores_gemma":[0.99934477,0.0004234206,0.000081217935,0.000029787083,0.00007978959,0.000040936582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009565158,0.001236024,0.0010915768,0.0004854063,0.0004473097,0.0010184097,0.00080281653,0.00090511056,0.0013639501],"category_scores_gemma":[0.0019236213,0.0005134605,0.00051872135,0.00092742156,0.00084001326,0.0011407298,0.00091378833,0.0009819864,0.00019692912],"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.000016709955,0.000013982422,0.00012537415,0.000019391447,0.000008824484,0.000018818384,0.000015309193,0.99146324,0.00038037085,0.0032058829,0.00021567004,0.00451649],"study_design_scores_gemma":[0.0000014786848,0.000006189585,0.000021352369,9.4247997e-7,0.0000013029986,0.0000018945883,0.0000048913057,0.9990706,0.000082257655,0.00074369577,0.00006451874,9.680025e-7],"about_ca_topic_score_codex":0.008317372,"about_ca_topic_score_gemma":0.006394965,"teacher_disagreement_score":0.008317372,"about_ca_system_score_codex":0.0014761954,"about_ca_system_score_gemma":0.0018733767,"threshold_uncertainty_score":0.016537964},"labels":[],"label_agreement":null},{"id":"W3205682784","doi":"10.1109/tcomm.2021.3096959","title":"Outage Performance Analysis of Widely Linear Receivers in Uplink Multi-User MIMO Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems 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":"University of British Columbia","funders":"China Scholarship Council","keywords":"Telecommunications link; Diversity gain; Single antenna interference cancellation; Computer science; Coding gain; Dirty paper coding; MIMO; Base station; Array gain; Computer network; Fading; Automatic gain control; Spectral efficiency; Decoding methods; Topology (electrical circuits); Electronic engineering; Channel (broadcasting); Telecommunications; Precoding; Engineering; Antenna (radio); Antenna array; Electrical engineering; Amplifier","score_opus":0.032943870387021845,"score_gpt":0.2715823383833993,"score_spread":0.23863846799637745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205682784","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.22400647,0.0031968162,0.7554063,0.00034473167,0.00004397098,0.000027770075,0.00014171135,0.00041875974,0.016413419],"genre_scores_gemma":[0.99136,0.00071806094,0.006676594,0.000038315648,0.000036342877,0.0000118457065,0.000053325686,0.0000167683,0.0010886327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988053,0.0004173978,0.000041157356,0.00009390371,0.0004524903,0.000189766],"domain_scores_gemma":[0.9962489,0.0025694326,0.00032385637,0.00020198186,0.0005991486,0.00005667464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841274,0.00074007,0.00068477145,0.0005255478,0.00028910243,0.0010152671,0.00047088027,0.00070423045,0.0008435947],"category_scores_gemma":[0.0049843173,0.0002638635,0.0002680391,0.0006513381,0.00095772225,0.0006989767,0.00071312493,0.0005601651,0.0003036275],"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.00009257005,0.000021231153,0.0016499036,0.0001067345,0.000036070556,0.0003415292,0.00014742669,0.95677215,0.008108109,0.019573808,0.00038702492,0.012763476],"study_design_scores_gemma":[0.0000023469129,0.000034100893,0.00039012916,0.000008463108,0.0000072253197,0.00006699011,0.000030711373,0.9962555,0.001084529,0.0019831012,0.00012971296,0.000007262348],"about_ca_topic_score_codex":0.002328748,"about_ca_topic_score_gemma":0.00109838,"teacher_disagreement_score":0.002328748,"about_ca_system_score_codex":0.00097217207,"about_ca_system_score_gemma":0.00046580855,"threshold_uncertainty_score":0.0073200464},"labels":[],"label_agreement":null},{"id":"W3212556128","doi":"10.1109/tcomm.2021.3126626","title":"Deep Reinforcement Learning-Based Multidimensional Resource Management for Energy Harvesting Cognitive NOMA Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":56,"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":"Chongqing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Cognitive radio; Energy harvesting; Wireless; Network packet; Battery (electricity); Mathematical optimization; Noma; Resource allocation; Spectral efficiency; Efficient energy use; Resource management (computing); Distributed computing; Computer network; Energy (signal processing); Power (physics); Telecommunications link; Engineering; Telecommunications; Electrical engineering; Artificial intelligence; Mathematics","score_opus":0.025881027198448255,"score_gpt":0.2515816174549294,"score_spread":0.22570059025648115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212556128","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.07075387,0.00071483926,0.92401856,0.00039077428,0.00009237047,0.00003837516,0.000031153533,0.00040816402,0.0035519174],"genre_scores_gemma":[0.97400653,0.00012295814,0.024397884,0.00011615448,0.000019892963,0.00005007476,0.000027874736,0.000013188834,0.0012455349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975723,0.00006252084,0.000013081706,0.000050027218,0.000055098473,0.000062034545],"domain_scores_gemma":[0.99954695,0.00023742052,0.00006326002,0.000024109944,0.00009085505,0.000037427064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006401937,0.00056958693,0.0006987552,0.00019912541,0.0002819155,0.0005208689,0.0008351691,0.0005940237,0.00084411865],"category_scores_gemma":[0.001364579,0.00024543828,0.00032429825,0.00023545258,0.0005448005,0.0005037676,0.00071712397,0.0010159953,0.00011120544],"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.000048450158,0.000060037783,0.00061020214,0.00002863236,0.000028767377,0.00004488186,0.00003049009,0.9649711,0.0016365706,0.0028544313,0.00051453995,0.02917187],"study_design_scores_gemma":[0.0000024359713,0.000008523695,0.000028733226,7.972748e-7,0.0000014307259,0.0000021348758,0.000001259989,0.99945873,0.00008983292,0.00036448406,0.000040643456,0.0000010310382],"about_ca_topic_score_codex":0.00681447,"about_ca_topic_score_gemma":0.004973741,"teacher_disagreement_score":0.00681447,"about_ca_system_score_codex":0.00074043154,"about_ca_system_score_gemma":0.0010212999,"threshold_uncertainty_score":0.013549626},"labels":[],"label_agreement":null},{"id":"W3215609878","doi":"10.1109//tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 Alberta","funders":"","keywords":"Hop (telecommunications); Relay; Beamforming; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Array gain; Monte Carlo method; Probability density function; Electronic engineering; Control theory (sociology); Topology (electrical circuits); Algorithm; Telecommunications; Channel (broadcasting); Engineering; Mathematics; Antenna array; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215609878","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.058452837,0.001312244,0.9293237,0.0001874732,0.00002489807,0.00004257545,0.00011551551,0.00022166534,0.0103191035],"genre_scores_gemma":[0.95393527,0.0016045696,0.0415049,0.00005866787,0.000043823275,0.00008087916,0.00009790131,0.000032251777,0.0026417708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935323,0.0002038678,0.000025769448,0.00006035828,0.00027102584,0.0000857766],"domain_scores_gemma":[0.99799573,0.0012756105,0.00017456102,0.0001055995,0.0004085377,0.000039964558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953082,0.0011128776,0.00065225153,0.0006900007,0.0003983363,0.00097527093,0.0005709167,0.0007895225,0.0018494151],"category_scores_gemma":[0.0037328675,0.00031041275,0.00042919684,0.00068692485,0.000520007,0.00087130093,0.00073410926,0.0005734857,0.0005826631],"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.0000599356,0.000017651997,0.0005185631,0.000063286556,0.00002373814,0.000109553745,0.00005015721,0.9593461,0.008028603,0.017749282,0.0003404522,0.013692653],"study_design_scores_gemma":[0.0000024156482,0.00004789472,0.00020853702,0.0000068647087,0.0000090501535,0.00007965894,0.000016442644,0.99489504,0.0012434857,0.003250928,0.00023015638,0.0000094637435],"about_ca_topic_score_codex":0.0019330824,"about_ca_topic_score_gemma":0.0016052336,"teacher_disagreement_score":0.0019330824,"about_ca_system_score_codex":0.0009824033,"about_ca_system_score_gemma":0.0006408738,"threshold_uncertainty_score":0.007127881},"labels":[],"label_agreement":null},{"id":"W3217279469","doi":"10.1109/tcomm.2021.3130198","title":"A POMDP-Based Antenna Selection for Massive MIMO Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Computer science; Channel state information; MIMO; Beamforming; Telecommunications link; Antenna (radio); Quantization (signal processing); Multi-user MIMO; Fading; Selection (genetic algorithm); Markov chain; Channel (broadcasting); Algorithm; Base station; Precoding; Mathematical optimization; Markov model; Mathematics; Computer network; Telecommunications; Machine learning; Wireless","score_opus":0.02405551029369564,"score_gpt":0.2661404194294252,"score_spread":0.24208490913572955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217279469","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.011704659,0.0002625581,0.98331785,0.0003240617,0.00007647634,0.00006807437,0.00009516155,0.0002899432,0.003861083],"genre_scores_gemma":[0.85584486,0.00031039282,0.14046478,0.00019906748,0.000056658686,0.00022585671,0.00010538079,0.000041426698,0.0027516242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937254,0.00021805974,0.000020497018,0.0001243689,0.00014410875,0.00012043723],"domain_scores_gemma":[0.9992648,0.00048323834,0.00006839171,0.00003329734,0.00007911017,0.00007117163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010102913,0.00086541637,0.0010677945,0.00026979743,0.00048540698,0.0009927611,0.00091981393,0.0009733587,0.0023679729],"category_scores_gemma":[0.0016621066,0.00047933287,0.0007629734,0.0003594086,0.0008804653,0.0006889849,0.0010016494,0.001320315,0.00027069173],"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.00004403415,0.000023284769,0.00015126907,0.00003799418,0.000013825312,0.000058877915,0.00002329723,0.98531103,0.0007071016,0.007522113,0.00047884576,0.005628261],"study_design_scores_gemma":[0.000011801389,0.000019034735,0.000023702149,0.0000033709573,0.0000031521024,0.000005667338,0.000004827085,0.9972339,0.0001566895,0.002350956,0.00018374552,0.000003123754],"about_ca_topic_score_codex":0.006818757,"about_ca_topic_score_gemma":0.004571249,"teacher_disagreement_score":0.006818757,"about_ca_system_score_codex":0.0012342294,"about_ca_system_score_gemma":0.0019032113,"threshold_uncertainty_score":0.013558149},"labels":[],"label_agreement":null},{"id":"W4205439215","doi":"10.1109/tcomm.2022.3144986","title":"Joint Design of Hybrid Beamforming and Reflection Coefficients in RIS-Aided mmWave MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":131,"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 Toronto","funders":"National Natural Science Foundation of China; Canada Research Chairs","keywords":"Beamforming; MIMO; Relaxation (psychology); Telecommunications link; Computer science; Base station; Optimization problem; Mathematical optimization; Reduction (mathematics); Algorithm; Electronic engineering; Mathematics; Telecommunications; Engineering","score_opus":0.058585240517986116,"score_gpt":0.2675568819341841,"score_spread":0.20897164141619798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205439215","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.016850939,0.00010098112,0.97998595,0.00009179857,0.00002582033,0.000023349827,0.000023516473,0.00017492291,0.0027228722],"genre_scores_gemma":[0.774801,0.00024157875,0.22021058,0.00016019025,0.000048612103,0.00016057356,0.00009326854,0.000060410242,0.0042238897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994873,0.0001421742,0.000018544417,0.00009432698,0.00017304439,0.000084619496],"domain_scores_gemma":[0.9996532,0.00012506644,0.00007058959,0.000026772967,0.000094725256,0.000029606892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045756294,0.0011639433,0.00071594917,0.00024240889,0.00027127407,0.0008204612,0.0007664403,0.0007013709,0.0017364648],"category_scores_gemma":[0.0010071492,0.00042449977,0.00039427463,0.00042412785,0.0005333155,0.0008066377,0.0007937563,0.0006655139,0.000618553],"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.00016407284,0.00007398228,0.0005735325,0.00009009161,0.00004134556,0.00011650153,0.00007956488,0.8948743,0.028427854,0.011136198,0.0010612531,0.0633613],"study_design_scores_gemma":[0.000011464541,0.0000774933,0.00008249158,0.0000043596274,0.000007610602,0.000030280811,0.000013737848,0.9946951,0.0033989071,0.0010885032,0.0005824646,0.000007535937],"about_ca_topic_score_codex":0.0010473077,"about_ca_topic_score_gemma":0.0015825416,"teacher_disagreement_score":0.0017364648,"about_ca_system_score_codex":0.00037285214,"about_ca_system_score_gemma":0.0007813363,"threshold_uncertainty_score":0.0058090687},"labels":[],"label_agreement":null},{"id":"W4205676769","doi":"10.1109/tcomm.2021.3137834","title":"Mobility-Aware Performance in Hybrid RF and Terahertz Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Terahertz radiation; Computer science; Electronic engineering; Radio frequency; Computer network; Electrical engineering; Telecommunications; Engineering; Materials science; Optoelectronics","score_opus":0.014121172441853487,"score_gpt":0.23152525699588367,"score_spread":0.21740408455403018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205676769","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.29507464,0.00089153426,0.6978979,0.0003467869,0.00003447472,0.000053171047,0.000188332,0.00038965797,0.0051234527],"genre_scores_gemma":[0.9930561,0.0002717857,0.00606381,0.000030199652,0.000012342967,0.000021209216,0.00003410825,0.000017360519,0.00049308984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990644,0.00028329028,0.000030844196,0.00016034274,0.00022100998,0.00024012952],"domain_scores_gemma":[0.9979127,0.0013015922,0.0003614043,0.00014701036,0.00020829387,0.00006896726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418895,0.0009721928,0.0008856138,0.0008395175,0.0005054146,0.0012136567,0.0010781043,0.00083836116,0.0006926163],"category_scores_gemma":[0.004401088,0.00042891502,0.0006115003,0.0006687167,0.0013885928,0.002006207,0.0013956499,0.0004928199,0.00018417208],"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.000050678624,0.000020511508,0.001406047,0.00003424264,0.000029602781,0.00015963224,0.0000735078,0.9667304,0.0046211807,0.022875534,0.00016719537,0.0038314296],"study_design_scores_gemma":[0.0000022969075,0.000023020206,0.00039727642,0.0000031706365,0.0000075222547,0.000058399888,0.000020832256,0.9953636,0.00068154273,0.003341559,0.00009305356,0.000007785664],"about_ca_topic_score_codex":0.003807289,"about_ca_topic_score_gemma":0.001844711,"teacher_disagreement_score":0.003807289,"about_ca_system_score_codex":0.001813388,"about_ca_system_score_gemma":0.0006050077,"threshold_uncertainty_score":0.01315707},"labels":[],"label_agreement":null},{"id":"W4205901604","doi":"10.1109/tcomm.2014.03.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Computer network","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205901604","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.00040101891,0.0034185997,0.0066396315,0.009696581,0.025509536,0.00077726936,0.028853618,0.005992767,0.91871095],"genre_scores_gemma":[0.0012305474,0.002124111,0.0016996241,0.0027557737,0.0028268169,0.00044822003,0.015082801,0.0015560837,0.97227615],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843985,0.00023303297,0.00011084071,0.00020618796,0.000798754,0.00021130881],"domain_scores_gemma":[0.9851879,0.0024878986,0.0004769557,0.0016144447,0.0070330077,0.0031998488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022430378,0.0011814659,0.0021366095,0.0058384878,0.0021786368,0.005875705,0.0029352533,0.0026590605,0.93705374],"category_scores_gemma":[0.022745008,0.0005672113,0.00080567395,0.004050487,0.00056704023,0.0032895727,0.0030388448,0.002049446,0.93771553],"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.000017088832,0.000021831054,0.00004573043,0.00013815427,0.0000015429898,0.000016444501,0.0000070580636,0.000043150612,0.000106875406,0.001203355,0.96171886,0.03667984],"study_design_scores_gemma":[0.000013164638,0.000018232671,0.00010780111,0.00018434357,0.000003696051,0.000038503455,0.000023677781,0.00011092025,0.00017379917,0.0016975475,0.9976205,0.000007861781],"about_ca_topic_score_codex":0.0017683366,"about_ca_topic_score_gemma":0.0030835161,"teacher_disagreement_score":0.06294626,"about_ca_system_score_codex":0.0012519212,"about_ca_system_score_gemma":0.0042593167,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206110203","doi":"10.1109/tcomm.2021.3131622","title":"Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scrambling; Fading; Permutation (music); Computer science; Repetition (rhetorical device); Algorithm; Random access; Telecommunications; Electronic engineering; Mathematics; Computer network; Decoding methods; Physics; Engineering; Acoustics","score_opus":0.07834630463077291,"score_gpt":0.33405389797550694,"score_spread":0.25570759334473403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206110203","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.043921504,0.0003022979,0.9522248,0.00008017388,0.000030031164,0.00005602673,0.000028764578,0.0005142574,0.0028422223],"genre_scores_gemma":[0.72514224,0.0004718106,0.2716992,0.00008791215,0.00008214585,0.00011140302,0.000051791205,0.000047321268,0.002306236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929786,0.00032001105,0.000029953095,0.00008554573,0.00019970453,0.00006702597],"domain_scores_gemma":[0.9988557,0.0004829802,0.0002209263,0.0002496133,0.000162576,0.000028334553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626492,0.00076393667,0.000513107,0.00039981274,0.00034515827,0.00060721353,0.0008725343,0.00034609207,0.00080803083],"category_scores_gemma":[0.0015955042,0.00021700538,0.000363035,0.00057507254,0.0006727015,0.00074627355,0.0006914519,0.00048739507,0.00054659287],"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.0006622388,0.00016843813,0.0017074714,0.0005975764,0.00015502605,0.0008826832,0.0004337993,0.37608197,0.2773153,0.0886635,0.0019492926,0.2513827],"study_design_scores_gemma":[0.000039193346,0.00044908302,0.00034522478,0.000026067946,0.000049939623,0.00085679983,0.00003024569,0.88969475,0.09633457,0.007361853,0.0047595655,0.000052684412],"about_ca_topic_score_codex":0.00031933875,"about_ca_topic_score_gemma":0.00052544335,"teacher_disagreement_score":0.0008725343,"about_ca_system_score_codex":0.00023216936,"about_ca_system_score_gemma":0.00040449636,"threshold_uncertainty_score":0.0033132434},"labels":[],"label_agreement":null},{"id":"W4206658746","doi":"10.1109/tcomm.2022.3142159","title":"Non-Coherent Multi-Level Index Modulation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Mathematics; Binary number; Discrete mathematics; Algorithm; Metric (unit); Notation; Code rate; Modulation (music); Decoding methods; Arithmetic","score_opus":0.06547698234084603,"score_gpt":0.2831065720946803,"score_spread":0.21762958975383428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206658746","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.09810532,0.00092135306,0.8867927,0.0002760864,0.00006139107,0.00005435882,0.00007988859,0.000185681,0.013523139],"genre_scores_gemma":[0.9117088,0.0005494983,0.08286945,0.00013693234,0.00006225868,0.00005909534,0.00007920759,0.0000274443,0.004507317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995573,0.00013634977,0.000018972667,0.000072192655,0.00016571351,0.00004947463],"domain_scores_gemma":[0.99937844,0.000247137,0.000118861695,0.00011536984,0.00011301836,0.000027063812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032969884,0.0004405893,0.00040016545,0.0001971728,0.0002601537,0.00082856696,0.0006937413,0.00049089856,0.0011812133],"category_scores_gemma":[0.0016010549,0.00016039542,0.00018843418,0.00045819275,0.0005128962,0.0009927488,0.00062842487,0.0005684185,0.00042557454],"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.0003642992,0.00016875043,0.0028843968,0.0003924218,0.0000770585,0.0005617426,0.00038100244,0.40558144,0.17645234,0.3057407,0.0016240663,0.10577173],"study_design_scores_gemma":[0.000010331715,0.0001226322,0.00046065272,0.000016427295,0.000015057839,0.0002250442,0.000027231608,0.9631455,0.018098596,0.016003074,0.0018585926,0.000016990183],"about_ca_topic_score_codex":0.0004757985,"about_ca_topic_score_gemma":0.00057641364,"teacher_disagreement_score":0.0011812133,"about_ca_system_score_codex":0.0006946397,"about_ca_system_score_gemma":0.00039711126,"threshold_uncertainty_score":0.0050399303},"labels":[],"label_agreement":null},{"id":"W4206740046","doi":"10.1109/tcomm.2014.01.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","cited_by":1,"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 Waterloo; Institut National de la Recherche Scientifique","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Engineering; Electrical engineering; Telecommunications","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206740046","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.00040101891,0.0034185997,0.0066396315,0.009696581,0.025509536,0.00077726936,0.028853618,0.005992767,0.91871095],"genre_scores_gemma":[0.0012305474,0.002124111,0.0016996241,0.0027557737,0.0028268169,0.00044822003,0.015082801,0.0015560837,0.97227615],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843985,0.00023303297,0.00011084071,0.00020618796,0.000798754,0.00021130881],"domain_scores_gemma":[0.9851879,0.0024878986,0.0004769557,0.0016144447,0.0070330077,0.0031998488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022430378,0.0011814659,0.0021366095,0.0058384878,0.0021786368,0.005875705,0.0029352533,0.0026590605,0.93705374],"category_scores_gemma":[0.022745008,0.0005672113,0.00080567395,0.004050487,0.00056704023,0.0032895727,0.0030388448,0.002049446,0.93771553],"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.000017088832,0.000021831054,0.00004573043,0.00013815427,0.0000015429898,0.000016444501,0.0000070580636,0.000043150612,0.000106875406,0.001203355,0.96171886,0.03667984],"study_design_scores_gemma":[0.000013164638,0.000018232671,0.00010780111,0.00018434357,0.000003696051,0.000038503455,0.000023677781,0.00011092025,0.00017379917,0.0016975475,0.9976205,0.000007861781],"about_ca_topic_score_codex":0.0017683366,"about_ca_topic_score_gemma":0.0030835161,"teacher_disagreement_score":0.06294626,"about_ca_system_score_codex":0.0012519212,"about_ca_system_score_gemma":0.0042593167,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4210790754","doi":"10.1109/tcomm.2022.3148261","title":"Uplink Outage Performance of NOMA-Based Hybrid Satellite-Terrestrial Relay Networks Over Generalized Inhomogeneous Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nanjing University of Posts and Telecommunications","keywords":"Telecommunications link; Single antenna interference cancellation; Decoding methods; Relay; Computer science; Fading; Noma; Communications satellite; Channel (broadcasting); Quality of service; Interference (communication); Satellite; Power (physics); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Electrical engineering; Engineering; Physics","score_opus":0.03603204741687708,"score_gpt":0.2505246991599449,"score_spread":0.21449265174306784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210790754","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.81863433,0.0019340543,0.17294264,0.00024612498,0.00004545002,0.000025955114,0.00026012963,0.0002446721,0.0056666103],"genre_scores_gemma":[0.9980544,0.00026983,0.0013678743,0.000015467433,0.0000110563215,0.000006785926,0.000034378303,0.0000066803,0.00023356052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00034698297,0.00003304819,0.000098830555,0.00014149857,0.00017730135],"domain_scores_gemma":[0.9975005,0.0015155353,0.00041414695,0.00013633381,0.0003478835,0.00008557831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694732,0.000925648,0.00093442603,0.0005093349,0.00052005704,0.00084543467,0.00072949496,0.0006047373,0.00055460253],"category_scores_gemma":[0.0030918692,0.00021549506,0.00032842768,0.0008685138,0.0010548945,0.0008020137,0.0009608434,0.00036779235,0.000111427595],"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.00014836244,0.000023122097,0.0038513367,0.00008460026,0.0000593886,0.0004568351,0.00008531911,0.9820873,0.00313447,0.004604469,0.00034824418,0.0051165745],"study_design_scores_gemma":[0.0000050788444,0.0000438795,0.00084815855,0.000004417044,0.00001783673,0.0000874074,0.00004906568,0.9974866,0.00044212502,0.00094098574,0.00006672009,0.000007653783],"about_ca_topic_score_codex":0.006218625,"about_ca_topic_score_gemma":0.0043497253,"teacher_disagreement_score":0.006218625,"about_ca_system_score_codex":0.0010204493,"about_ca_system_score_gemma":0.000518748,"threshold_uncertainty_score":0.012364805},"labels":[],"label_agreement":null},{"id":"W4211026530","doi":"10.1109/tcomm.2021.3075507","title":"IEEE Communications Society","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","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":"Memorial University of Newfoundland","funders":"Chinese University of Hong Kong; National University of Singapore","keywords":"Computer science; Telecommunications; Electronic engineering; Electrical engineering; Engineering","score_opus":0.08469967876516518,"score_gpt":0.3152166116791916,"score_spread":0.23051693291402645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211026530","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.0031818168,0.02364588,0.037095178,0.012929362,0.012506926,0.00016925985,0.0017095527,0.0017193555,0.90704274],"genre_scores_gemma":[0.017992498,0.018395757,0.0118364915,0.002056459,0.001788869,0.00010920828,0.002681223,0.00029515778,0.94484425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992016,0.00012658717,0.0000489348,0.0001400591,0.00041354413,0.000069304864],"domain_scores_gemma":[0.99664426,0.0003755777,0.00011549835,0.00040958848,0.0021589643,0.00029615042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012540526,0.0009401539,0.00044310125,0.001473153,0.0006906152,0.0025811177,0.0006162842,0.0017845436,0.119746335],"category_scores_gemma":[0.0026844302,0.000353399,0.00029025823,0.0013516182,0.0004903645,0.001467367,0.0013837616,0.0028132815,0.11040578],"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.00008595026,0.00005717855,0.0007581136,0.00024813958,0.00002266764,0.00016717617,0.00012795712,0.00069534907,0.0035004339,0.031266447,0.54399467,0.41907597],"study_design_scores_gemma":[0.0000058271703,0.000026855161,0.0005352542,0.000095077696,0.000007200249,0.00016853528,0.00004177106,0.000532913,0.00066678674,0.0024458424,0.9954666,0.0000072928815],"about_ca_topic_score_codex":0.003699598,"about_ca_topic_score_gemma":0.0044516814,"teacher_disagreement_score":0.8802537,"about_ca_system_score_codex":0.0009931689,"about_ca_system_score_gemma":0.002314147,"threshold_uncertainty_score":0.40059137},"labels":[],"label_agreement":null},{"id":"W4214508141","doi":"10.1109/tcomm.2021.3069654","title":"IEEE Communications Society","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","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":"Memorial University of Newfoundland","funders":"Chinese University of Hong Kong; National University of Singapore","keywords":"Computer science; Telecommunications; Electronic engineering; Electrical engineering; Engineering","score_opus":0.08469967876516518,"score_gpt":0.3152166116791916,"score_spread":0.23051693291402645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214508141","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.0031818168,0.02364588,0.037095178,0.012929362,0.012506926,0.00016925985,0.0017095527,0.0017193555,0.90704274],"genre_scores_gemma":[0.017992498,0.018395757,0.0118364915,0.002056459,0.001788869,0.00010920828,0.002681223,0.00029515778,0.94484425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992016,0.00012658717,0.0000489348,0.0001400591,0.00041354413,0.000069304864],"domain_scores_gemma":[0.99664426,0.0003755777,0.00011549835,0.00040958848,0.0021589643,0.00029615042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012540526,0.0009401539,0.00044310125,0.001473153,0.0006906152,0.0025811177,0.0006162842,0.0017845436,0.119746335],"category_scores_gemma":[0.0026844302,0.000353399,0.00029025823,0.0013516182,0.0004903645,0.001467367,0.0013837616,0.0028132815,0.11040578],"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.00008595026,0.00005717855,0.0007581136,0.00024813958,0.00002266764,0.00016717617,0.00012795712,0.00069534907,0.0035004339,0.031266447,0.54399467,0.41907597],"study_design_scores_gemma":[0.0000058271703,0.000026855161,0.0005352542,0.000095077696,0.000007200249,0.00016853528,0.00004177106,0.000532913,0.00066678674,0.0024458424,0.9954666,0.0000072928815],"about_ca_topic_score_codex":0.003699598,"about_ca_topic_score_gemma":0.0044516814,"teacher_disagreement_score":0.8802537,"about_ca_system_score_codex":0.0009931689,"about_ca_system_score_gemma":0.002314147,"threshold_uncertainty_score":0.40059137},"labels":[],"label_agreement":null},{"id":"W4214926958","doi":"10.1109/tcomm.2022.3156065","title":"Efficient Channel Estimation for Wideband Millimeter Wave Massive MIMO Systems With Beam Squint","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wideband; Computer science; Precoding; Cramér–Rao bound; Channel (broadcasting); Estimator; Subcarrier; MIMO; Algorithm; Bandwidth (computing); Electronic engineering; Estimation theory; Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.03915403437497746,"score_gpt":0.23971287613088954,"score_spread":0.20055884175591207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214926958","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.013010353,0.00036698714,0.9851119,0.00014155525,0.000038532227,0.000020428004,0.000038597398,0.00028317224,0.0009884011],"genre_scores_gemma":[0.75101244,0.0012852486,0.24387471,0.0002544496,0.00014647255,0.0001428611,0.00028666534,0.000050064376,0.0029471046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.000155076,0.00002244456,0.00009222819,0.00015405948,0.00007406893],"domain_scores_gemma":[0.9994172,0.00030075025,0.00008124567,0.00006545005,0.00011190207,0.000023544475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381277,0.0009207855,0.0007100587,0.00030277128,0.0004534629,0.0005742624,0.0004462994,0.0005016441,0.00082827173],"category_scores_gemma":[0.0017824627,0.00040212207,0.00042151744,0.00046907554,0.00044855263,0.0009926732,0.00088010164,0.000998772,0.00047094378],"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.0002588008,0.00010276042,0.0016744267,0.00028976492,0.000101169404,0.00029382942,0.00021691239,0.71030354,0.051845327,0.021046955,0.0038137627,0.21005283],"study_design_scores_gemma":[0.000011629213,0.00006144055,0.00029969035,0.000011529583,0.000012746845,0.00006980124,0.000028494169,0.9915045,0.0046474244,0.0025484588,0.000788184,0.000016005928],"about_ca_topic_score_codex":0.0026327004,"about_ca_topic_score_gemma":0.004075929,"teacher_disagreement_score":0.0026327004,"about_ca_system_score_codex":0.0003337748,"about_ca_system_score_gemma":0.0010063176,"threshold_uncertainty_score":0.0052347183},"labels":[],"label_agreement":null},{"id":"W4225486508","doi":"10.1109/tcomm.2022.3168280","title":"Sparse and Low-Rank Optimization for Pliable Index Coding via Alternating Projection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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 Toronto","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Coding (social sciences); Computer science; Mathematical optimization; Greedy algorithm; Algorithm; Convergence (economics); Sparse matrix; Theoretical computer science; Mathematics","score_opus":0.05500643778611547,"score_gpt":0.29587582894695347,"score_spread":0.240869391160838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225486508","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.004620871,0.0001219672,0.9935336,0.00014612146,0.000015719786,0.000028761826,0.00003223077,0.00007293204,0.0014277897],"genre_scores_gemma":[0.42576078,0.00093819026,0.565305,0.00033700105,0.00013555515,0.00045706998,0.0003456165,0.00013929933,0.0065814597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868816,0.00057111884,0.000047869522,0.00019215475,0.00034681728,0.0001539073],"domain_scores_gemma":[0.9968491,0.0022025744,0.0002651893,0.0002620635,0.00029983072,0.00012115874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016260411,0.0014850426,0.0011323198,0.00057416473,0.00050583755,0.0011880724,0.0012917436,0.0011293982,0.002640402],"category_scores_gemma":[0.0062367567,0.0005519839,0.0006684972,0.0013602535,0.0017082414,0.002004844,0.002167761,0.0026486157,0.0007232819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023471963,0.00012424111,0.000572541,0.00022305828,0.000062758576,0.00022870538,0.00019667785,0.7111025,0.007875398,0.17364742,0.004405081,0.101326846],"study_design_scores_gemma":[0.000012316742,0.000038566854,0.000029381501,0.000007162606,0.000004105575,0.000034280387,0.000012286627,0.97947043,0.0008087199,0.01909182,0.00048323162,0.000007797502],"about_ca_topic_score_codex":0.0021999592,"about_ca_topic_score_gemma":0.002289733,"teacher_disagreement_score":0.002640402,"about_ca_system_score_codex":0.0009236011,"about_ca_system_score_gemma":0.0017559371,"threshold_uncertainty_score":0.008832991},"labels":[],"label_agreement":null},{"id":"W4226303299","doi":"10.1109/tcomm.2022.3170615","title":"Fair and Energy-Efficient Coverage Optimization for UAV Placement Problem in the Cellular Network","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Quality of service; Mathematical optimization; Base station; Optimization problem; Energy consumption; Cellular network; Efficient energy use; Real-time computing; Distributed computing; Computer network; Algorithm; Engineering","score_opus":0.012299090056973749,"score_gpt":0.20712894805253082,"score_spread":0.19482985799555708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226303299","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.0324714,0.0003538613,0.96410686,0.00021561698,0.00003964981,0.000045906414,0.0000369818,0.00012376977,0.002605947],"genre_scores_gemma":[0.8624409,0.00039910016,0.13384126,0.00010915027,0.000045376448,0.00015773106,0.000092922804,0.000054606862,0.002859017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996426,0.000119833596,0.000012369361,0.00006778448,0.00007971889,0.00007768432],"domain_scores_gemma":[0.9994783,0.00035159138,0.000048125177,0.000024123881,0.00006722527,0.00003064132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656563,0.0008531717,0.0010133219,0.00052831724,0.00057502615,0.0008930308,0.00064636377,0.0010481752,0.0010358144],"category_scores_gemma":[0.0015514216,0.00039517073,0.00055204175,0.00062875374,0.0006749407,0.00060785573,0.00064153504,0.0006944478,0.00014802552],"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.000024162026,0.000015060341,0.00027617818,0.000025669959,0.000010011296,0.00002733275,0.000021175343,0.9877517,0.0006508227,0.002770314,0.00034841182,0.0080791535],"study_design_scores_gemma":[0.0000033182353,0.000008445674,0.0000419119,0.0000018960453,0.0000024430128,0.0000052188984,0.0000058977516,0.9988525,0.00016582487,0.000816618,0.000094421994,0.0000014449423],"about_ca_topic_score_codex":0.0123361,"about_ca_topic_score_gemma":0.008763653,"teacher_disagreement_score":0.0123361,"about_ca_system_score_codex":0.00110928,"about_ca_system_score_gemma":0.0015617358,"threshold_uncertainty_score":0.024528623},"labels":[],"label_agreement":null},{"id":"W4230998896","doi":"10.1109/tcomm.2015.2432433","title":"IEEE Communications Society Information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.14249385993036548,"score_gpt":0.26309510870931524,"score_spread":0.12060124877894976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230998896","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.0021928577,0.0063778264,0.038811985,0.008528788,0.00934998,0.00030508338,0.009500415,0.0046176333,0.92031544],"genre_scores_gemma":[0.011336225,0.0069204266,0.0042192633,0.001266308,0.001625653,0.00020219714,0.009830827,0.000647663,0.9639515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993766,0.00009242465,0.00003693594,0.00011047539,0.00031255797,0.00007102526],"domain_scores_gemma":[0.99764156,0.0004038036,0.00012091936,0.000642631,0.0010069808,0.00018407605],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000780192,0.0016049293,0.0012913296,0.0029489666,0.0010748841,0.0034935176,0.00086085964,0.0022508232,0.34008083],"category_scores_gemma":[0.0038450598,0.0006246447,0.0003536324,0.003570706,0.0005708712,0.0027179206,0.001664059,0.0024968737,0.34322244],"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.00004858329,0.000044127897,0.00015335476,0.00013485429,0.000011235023,0.00006428548,0.000022185663,0.0010796288,0.0009952036,0.010076139,0.7589745,0.22839586],"study_design_scores_gemma":[0.000015035869,0.000029981493,0.00040548618,0.00012157465,0.000018074681,0.00009202359,0.000024369343,0.0031698947,0.0009026345,0.007169923,0.9880332,0.000017727314],"about_ca_topic_score_codex":0.004072013,"about_ca_topic_score_gemma":0.0035130305,"teacher_disagreement_score":0.65991914,"about_ca_system_score_codex":0.0010410224,"about_ca_system_score_gemma":0.0022443517,"threshold_uncertainty_score":0.9412946},"labels":[],"label_agreement":null},{"id":"W4231803097","doi":"10.1109/tcomm.2014.2340651","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network; Electronic engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231803097","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.0022357749,0.0064472076,0.03804381,0.008620051,0.009558786,0.0003000528,0.009066425,0.004494875,0.92123294],"genre_scores_gemma":[0.011411946,0.006888014,0.0041156434,0.0012738688,0.0016498597,0.00019826328,0.009435436,0.0006348014,0.9643922],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993755,0.000093224626,0.000036495487,0.000110993264,0.00031226804,0.00007162636],"domain_scores_gemma":[0.99765694,0.00040052313,0.0001190841,0.0006337312,0.0010057639,0.00018391763],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077717233,0.0016097794,0.001284524,0.0029271506,0.0010852779,0.0034855055,0.00085827924,0.0022599965,0.3392559],"category_scores_gemma":[0.003777801,0.00062060886,0.00035549383,0.003567952,0.00057516847,0.002684166,0.0016661087,0.0025051737,0.34051612],"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.000049651393,0.000044883942,0.00015701813,0.0001350588,0.000011424276,0.00006548786,0.000022419734,0.0010865743,0.001028331,0.010056734,0.75534827,0.23199406],"study_design_scores_gemma":[0.0000150613,0.000030709114,0.00041161527,0.00012028861,0.000018369894,0.00009290541,0.000024524967,0.0031337985,0.0009043885,0.007062858,0.98816794,0.000017630271],"about_ca_topic_score_codex":0.004071866,"about_ca_topic_score_gemma":0.0035040078,"teacher_disagreement_score":0.6607441,"about_ca_system_score_codex":0.0010398241,"about_ca_system_score_gemma":0.0022341616,"threshold_uncertainty_score":0.94247127},"labels":[],"label_agreement":null},{"id":"W4233470818","doi":"10.1109/twc.2011.09.4416-tc1310-filler","title":"Call for papers","year":2013,"lang":"en","type":"paratext","venue":"IEEE Transactions on Communications","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Telecommunications; Engineering","score_opus":0.06486297646993994,"score_gpt":0.30716628557203274,"score_spread":0.2423033091020928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233470818","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.0005179537,0.004485749,0.0026159342,0.03461368,0.12145087,0.0008420029,0.006401627,0.0018258422,0.82724637],"genre_scores_gemma":[0.001963,0.0026216665,0.0010244055,0.011145531,0.012822947,0.00026756278,0.0033721796,0.0007405869,0.9660421],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970381,0.00038898562,0.00024562326,0.0005973272,0.001418976,0.0003109087],"domain_scores_gemma":[0.9896024,0.0011318417,0.00042653058,0.0014549269,0.0042451997,0.0031390926],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0024215265,0.0012081325,0.0013764676,0.0030300524,0.0019771473,0.009589786,0.0035584946,0.005829392,0.86952287],"category_scores_gemma":[0.015643187,0.0004486401,0.0013521533,0.0026795748,0.0007482037,0.0056488845,0.0038468027,0.00331748,0.82517684],"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.000027895274,0.000034421206,0.00008901019,0.00017826272,0.0000047802855,0.000094532516,0.000015260777,0.000024942166,0.000094457006,0.0019452556,0.9283435,0.06914772],"study_design_scores_gemma":[0.000007045425,0.000008803935,0.000103267696,0.0000962134,0.000002339561,0.00007122511,0.00002963803,0.000015978427,0.000031615993,0.0008515982,0.99877864,0.0000036545678],"about_ca_topic_score_codex":0.0009887222,"about_ca_topic_score_gemma":0.0014853589,"teacher_disagreement_score":0.13047713,"about_ca_system_score_codex":0.0018101067,"about_ca_system_score_gemma":0.0037346357,"threshold_uncertainty_score":0.18610978},"labels":[],"label_agreement":null},{"id":"W4234617096","doi":"10.1109/tcomm.2006.876882","title":"Spectral-Efficient Differential Space–Time Coding Using Non-Full-Diverse Constellations","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spectral efficiency; Decoding methods; Algorithm; Space–time code; Constellation; Computer science; Coding (social sciences); Code (set theory); Antenna (radio); Differential (mechanical device); Transmit diversity; Theoretical computer science; Mathematics; Block code; Topology (electrical circuits); Telecommunications; Fading; Engineering; Beamforming","score_opus":0.03159270436252829,"score_gpt":0.28822678721589323,"score_spread":0.2566340828533649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234617096","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.014394626,0.00021201106,0.98275244,0.00012478342,0.00003362878,0.000022842994,0.000029394103,0.00009235881,0.002337925],"genre_scores_gemma":[0.40365094,0.0006086737,0.59207267,0.00016369583,0.00007462461,0.00013646262,0.00018031301,0.00005463377,0.0030579227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931896,0.00023580999,0.00003306447,0.00007579641,0.00028059696,0.000055788973],"domain_scores_gemma":[0.99882704,0.0005426186,0.00012110993,0.00026883918,0.0001823879,0.000057945097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006753249,0.0005276529,0.00057425833,0.00078585534,0.00042965834,0.00059996115,0.0006799213,0.0006069853,0.0013142244],"category_scores_gemma":[0.002805595,0.00020418483,0.00049097365,0.0009271495,0.0009341678,0.0012160196,0.0014774061,0.00081312715,0.00047536538],"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.00026494268,0.000097512806,0.0007340362,0.00029753157,0.000054556247,0.00041128174,0.00047906113,0.18814236,0.05689933,0.53885704,0.001804172,0.21195816],"study_design_scores_gemma":[0.000065987115,0.00021064526,0.0002635322,0.00004784229,0.000019632545,0.0007670485,0.000055665583,0.88696694,0.036357738,0.066536754,0.008657202,0.000051004306],"about_ca_topic_score_codex":0.00024737458,"about_ca_topic_score_gemma":0.00037955458,"teacher_disagreement_score":0.0013142244,"about_ca_system_score_codex":0.0004654612,"about_ca_system_score_gemma":0.0005236564,"threshold_uncertainty_score":0.004396498},"labels":[],"label_agreement":null},{"id":"W4234843542","doi":"10.1109/tcomm.2006.877972","title":"Applications of algebraic soft-decision decoding of Reed-Solomon codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":57,"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; McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Computational complexity theory; Reed–Solomon error correction; Rayleigh fading; Fading; Sequential decoding; Concatenated error correction code; Electronic engineering; Theoretical computer science; Computer engineering; Block code; Engineering","score_opus":0.01607861547041342,"score_gpt":0.2638310748973232,"score_spread":0.2477524594269098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234843542","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.031867668,0.00075440155,0.9530516,0.00025867173,0.000071396185,0.00006263499,0.000036405974,0.00047735035,0.01341988],"genre_scores_gemma":[0.6660341,0.001330077,0.32680058,0.00014618279,0.00012327965,0.0000642974,0.00008692488,0.00007331113,0.0053413394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.00032677123,0.00008376243,0.00009250337,0.00049492257,0.00006992576],"domain_scores_gemma":[0.9976209,0.0013161305,0.00024245131,0.00030995032,0.00046913937,0.000041433774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006109291,0.0004751092,0.00037037476,0.0007495672,0.00040279652,0.0008023538,0.0006038475,0.00040522154,0.0015669486],"category_scores_gemma":[0.004483208,0.00019835283,0.00026773108,0.0006616678,0.0009415102,0.0008175245,0.0011051744,0.00073015154,0.0006197521],"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.00028357637,0.000068231755,0.0012364633,0.00039106657,0.000042451597,0.0003244524,0.00032642848,0.20089735,0.05611531,0.41920152,0.00126993,0.31984323],"study_design_scores_gemma":[0.000037864516,0.00024867838,0.00035049842,0.0000620319,0.000025717452,0.0006413429,0.00006661369,0.76203614,0.092010655,0.13234182,0.012127911,0.00005076205],"about_ca_topic_score_codex":0.00045549017,"about_ca_topic_score_gemma":0.00066195667,"teacher_disagreement_score":0.0015669486,"about_ca_system_score_codex":0.00060822227,"about_ca_system_score_gemma":0.0006819272,"threshold_uncertainty_score":0.0052419305},"labels":[],"label_agreement":null},{"id":"W4235436422","doi":"10.1109/tcomm.2013.011613.120145","title":"Efficient Parallel Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Algorithm; Computer science; Turbo code; Concatenated error correction code; Linear code; Codec; Mathematics; Block code; Decoding methods; Telecommunications","score_opus":0.02986627749641636,"score_gpt":0.2824168001553823,"score_spread":0.25255052265896594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235436422","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.019365685,0.00013566586,0.9777044,0.00005109705,0.000012269889,0.00007311285,0.000049605413,0.00060998276,0.001998211],"genre_scores_gemma":[0.14729406,0.00012258749,0.85014045,0.000051401297,0.0000142616245,0.00027057112,0.00023871212,0.00007504222,0.0017929169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.00005732776,0.00002424051,0.000050431732,0.000112101945,0.000034341476],"domain_scores_gemma":[0.9994624,0.0002642777,0.00006602043,0.000055340282,0.0001344663,0.000017501663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046922,0.00060659467,0.0005408994,0.0008975951,0.00039021476,0.00048631313,0.00073377875,0.00051022315,0.002704913],"category_scores_gemma":[0.0018950485,0.00028309063,0.00027712216,0.0007720573,0.00041462743,0.000637539,0.00071313005,0.0003897389,0.00072265277],"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.0003455703,0.00013044829,0.00216342,0.0002483255,0.00007059581,0.00017994877,0.00021607304,0.34687522,0.026064932,0.027874727,0.003037936,0.59279275],"study_design_scores_gemma":[0.00007929391,0.0000951145,0.00031633436,0.000015604966,0.000013618528,0.00012523639,0.000030671396,0.9851364,0.0061246366,0.00635055,0.0016975173,0.000015047906],"about_ca_topic_score_codex":0.002246112,"about_ca_topic_score_gemma":0.003942522,"teacher_disagreement_score":0.002704913,"about_ca_system_score_codex":0.00048342606,"about_ca_system_score_gemma":0.0020269146,"threshold_uncertainty_score":0.009048879},"labels":[],"label_agreement":null},{"id":"W4238337071","doi":"10.1109/tcomm.2014.05.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238337071","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.00040101891,0.0034185997,0.0066396315,0.009696581,0.025509536,0.00077726936,0.028853618,0.005992767,0.91871095],"genre_scores_gemma":[0.0012305474,0.002124111,0.0016996241,0.0027557737,0.0028268169,0.00044822003,0.015082801,0.0015560837,0.97227615],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843985,0.00023303297,0.00011084071,0.00020618796,0.000798754,0.00021130881],"domain_scores_gemma":[0.9851879,0.0024878986,0.0004769557,0.0016144447,0.0070330077,0.0031998488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022430378,0.0011814659,0.0021366095,0.0058384878,0.0021786368,0.005875705,0.0029352533,0.0026590605,0.93705374],"category_scores_gemma":[0.022745008,0.0005672113,0.00080567395,0.004050487,0.00056704023,0.0032895727,0.0030388448,0.002049446,0.93771553],"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.000017088832,0.000021831054,0.00004573043,0.00013815427,0.0000015429898,0.000016444501,0.0000070580636,0.000043150612,0.000106875406,0.001203355,0.96171886,0.03667984],"study_design_scores_gemma":[0.000013164638,0.000018232671,0.00010780111,0.00018434357,0.000003696051,0.000038503455,0.000023677781,0.00011092025,0.00017379917,0.0016975475,0.9976205,0.000007861781],"about_ca_topic_score_codex":0.0017683366,"about_ca_topic_score_gemma":0.0030835161,"teacher_disagreement_score":0.06294626,"about_ca_system_score_codex":0.0012519212,"about_ca_system_score_gemma":0.0042593167,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4242178054","doi":"10.1109/tcomm.2015.2513639","title":"IEEE Communications Society","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Telecommunications; Electrical engineering; Engineering; Electronic engineering; Computer network","score_opus":0.0792515733670414,"score_gpt":0.3074151961265445,"score_spread":0.22816362275950308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242178054","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.002701931,0.004883072,0.039767854,0.0040332777,0.007954101,0.00015398744,0.0016609887,0.0033981896,0.9354466],"genre_scores_gemma":[0.007058639,0.0029396473,0.0029506742,0.00054029905,0.00058757263,0.00007070038,0.0016177444,0.000225806,0.984009],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994979,0.00006777428,0.000024419038,0.00010674794,0.00023873753,0.000064364256],"domain_scores_gemma":[0.99819404,0.0001679796,0.000050678133,0.00040703223,0.001030539,0.00014983864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000658975,0.0014381395,0.0006526455,0.0017460462,0.0010354765,0.0026847748,0.00067575363,0.0018402123,0.28581628],"category_scores_gemma":[0.0018552939,0.0004075669,0.00033419923,0.0017976759,0.00056193385,0.0013574893,0.001685578,0.0019497417,0.37568375],"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.00007161126,0.000070899514,0.00041713295,0.00011520425,0.000013807376,0.00010999914,0.00005426663,0.00086020224,0.0031085873,0.007629158,0.5519355,0.4356137],"study_design_scores_gemma":[0.0000070373144,0.000025718191,0.00054909,0.0000718295,0.000011779564,0.00012474308,0.000041513842,0.0013869453,0.0010227342,0.0021350023,0.9946127,0.000010996842],"about_ca_topic_score_codex":0.004089466,"about_ca_topic_score_gemma":0.005427934,"teacher_disagreement_score":0.7141837,"about_ca_system_score_codex":0.00075711106,"about_ca_system_score_gemma":0.0016241365,"threshold_uncertainty_score":0.9561507},"labels":[],"label_agreement":null},{"id":"W4243853725","doi":"10.1109/tcomm.2007.906433","title":"Precise Outage Analysis of Selection Diversity and Switched Diversity in Bandlimited Microcellular Systems With Cochannel Interference","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"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":"Fading; Independent and identically distributed random variables; Nakagami distribution; Rayleigh fading; Diversity combining; Electronic engineering; Interference (communication); Fading distribution; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Control theory (sociology); Random variable; Statistics; Engineering; Channel (broadcasting)","score_opus":0.034387275844938385,"score_gpt":0.24979258444161978,"score_spread":0.2154053085966814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243853725","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.45564902,0.0015016225,0.53400654,0.00035888425,0.000032087308,0.000025015514,0.00017145992,0.00028237925,0.007972966],"genre_scores_gemma":[0.9957974,0.00024500056,0.0033586754,0.000016948896,0.000016221578,0.000009105096,0.000038407186,0.000009437296,0.00050875917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992398,0.00023701802,0.00002747089,0.00005786134,0.00030869464,0.00012919486],"domain_scores_gemma":[0.9954377,0.0034496954,0.00031057018,0.00022250149,0.00048400412,0.00009555316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013269199,0.00051656464,0.0006536732,0.0005258695,0.00036749075,0.00073876785,0.0005278949,0.0005154924,0.00078781496],"category_scores_gemma":[0.005906632,0.00027955454,0.00031879608,0.000653538,0.0010401703,0.000810728,0.0006988705,0.0004944538,0.00010839175],"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.000098873556,0.000014253979,0.0011780041,0.000053275195,0.000030307414,0.00025263373,0.00010714992,0.96223515,0.004777319,0.02330384,0.00031639627,0.0076328227],"study_design_scores_gemma":[0.0000033420388,0.000026153144,0.0006166994,0.0000043722002,0.000010488173,0.00007371717,0.000025315712,0.9935846,0.00076669484,0.0047845435,0.00009773317,0.0000064553064],"about_ca_topic_score_codex":0.0029776306,"about_ca_topic_score_gemma":0.0017989827,"teacher_disagreement_score":0.0029776306,"about_ca_system_score_codex":0.0017849079,"about_ca_system_score_gemma":0.0005388303,"threshold_uncertainty_score":0.01295048},"labels":[],"label_agreement":null},{"id":"W4244152842","doi":"10.1109/tcomm.2014.2350266","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network; Electronic engineering; Electrical engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244152842","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.0022357749,0.0064472076,0.03804381,0.008620051,0.009558786,0.0003000528,0.009066425,0.004494875,0.92123294],"genre_scores_gemma":[0.011411946,0.006888014,0.0041156434,0.0012738688,0.0016498597,0.00019826328,0.009435436,0.0006348014,0.9643922],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993755,0.000093224626,0.000036495487,0.000110993264,0.00031226804,0.00007162636],"domain_scores_gemma":[0.99765694,0.00040052313,0.0001190841,0.0006337312,0.0010057639,0.00018391763],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077717233,0.0016097794,0.001284524,0.0029271506,0.0010852779,0.0034855055,0.00085827924,0.0022599965,0.3392559],"category_scores_gemma":[0.003777801,0.00062060886,0.00035549383,0.003567952,0.00057516847,0.002684166,0.0016661087,0.0025051737,0.34051612],"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.000049651393,0.000044883942,0.00015701813,0.0001350588,0.000011424276,0.00006548786,0.000022419734,0.0010865743,0.001028331,0.010056734,0.75534827,0.23199406],"study_design_scores_gemma":[0.0000150613,0.000030709114,0.00041161527,0.00012028861,0.000018369894,0.00009290541,0.000024524967,0.0031337985,0.0009043885,0.007062858,0.98816794,0.000017630271],"about_ca_topic_score_codex":0.004071866,"about_ca_topic_score_gemma":0.0035040078,"teacher_disagreement_score":0.6607441,"about_ca_system_score_codex":0.0010398241,"about_ca_system_score_gemma":0.0022341616,"threshold_uncertainty_score":0.94247127},"labels":[],"label_agreement":null},{"id":"W4245340520","doi":"10.1109/tcomm.2007.902541","title":"Equalization for DS-UWB Systems---Part II: 4BOK Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":19,"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":"MIMO; Computer science; Equalization (audio); Intersymbol interference; Electronic engineering; Transmission (telecommunications); Filter (signal processing); Bit error rate; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.03750000190879173,"score_gpt":0.27680409319304683,"score_spread":0.23930409128425512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245340520","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.01451466,0.0030740753,0.9725461,0.00028981103,0.00019817242,0.000038519316,0.000036402227,0.00017305491,0.009129199],"genre_scores_gemma":[0.72371566,0.010655892,0.23291545,0.00034262554,0.000670394,0.00015610667,0.00017489106,0.00017094157,0.03119792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997812,0.000054382035,0.00001238947,0.000027536304,0.00010340764,0.000021036001],"domain_scores_gemma":[0.99983835,0.000084230065,0.000016082691,0.000019941117,0.000037758928,0.000003622761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500263,0.00046235273,0.00038023724,0.00026256856,0.00023703177,0.00066790334,0.00022253429,0.0004885128,0.0028743492],"category_scores_gemma":[0.00063591625,0.000209387,0.00030018447,0.00024296931,0.00041922485,0.0006601857,0.00037974783,0.0005064575,0.0008589865],"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.00021709711,0.00007057729,0.0008558675,0.0005855476,0.00009730355,0.00020013946,0.00019018597,0.36928147,0.102552205,0.2143703,0.0058061257,0.3057732],"study_design_scores_gemma":[0.000017554048,0.00012780914,0.0008064108,0.00009088011,0.000043238855,0.0002776943,0.000043728185,0.87095535,0.046407375,0.046239566,0.034952216,0.000038196238],"about_ca_topic_score_codex":0.00032088693,"about_ca_topic_score_gemma":0.0003808113,"teacher_disagreement_score":0.0028743492,"about_ca_system_score_codex":0.00053931895,"about_ca_system_score_gemma":0.00031447512,"threshold_uncertainty_score":0.00961566},"labels":[],"label_agreement":null},{"id":"W4245810436","doi":"10.1109/tcomm.2014.2329232","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 Waterloo; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Telecommunications; Electronic engineering; Computer network; Electrical engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245810436","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.0022357749,0.0064472076,0.03804381,0.008620051,0.009558786,0.0003000528,0.009066425,0.004494875,0.92123294],"genre_scores_gemma":[0.011411946,0.006888014,0.0041156434,0.0012738688,0.0016498597,0.00019826328,0.009435436,0.0006348014,0.9643922],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993755,0.000093224626,0.000036495487,0.000110993264,0.00031226804,0.00007162636],"domain_scores_gemma":[0.99765694,0.00040052313,0.0001190841,0.0006337312,0.0010057639,0.00018391763],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077717233,0.0016097794,0.001284524,0.0029271506,0.0010852779,0.0034855055,0.00085827924,0.0022599965,0.3392559],"category_scores_gemma":[0.003777801,0.00062060886,0.00035549383,0.003567952,0.00057516847,0.002684166,0.0016661087,0.0025051737,0.34051612],"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.000049651393,0.000044883942,0.00015701813,0.0001350588,0.000011424276,0.00006548786,0.000022419734,0.0010865743,0.001028331,0.010056734,0.75534827,0.23199406],"study_design_scores_gemma":[0.0000150613,0.000030709114,0.00041161527,0.00012028861,0.000018369894,0.00009290541,0.000024524967,0.0031337985,0.0009043885,0.007062858,0.98816794,0.000017630271],"about_ca_topic_score_codex":0.004071866,"about_ca_topic_score_gemma":0.0035040078,"teacher_disagreement_score":0.6607441,"about_ca_system_score_codex":0.0010398241,"about_ca_system_score_gemma":0.0022341616,"threshold_uncertainty_score":0.94247127},"labels":[],"label_agreement":null},{"id":"W4247032108","doi":"10.1109/tcomm.2019.2962931","title":"IEEE Communications Society","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":0,"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":"Khalifa University of Science, Technology and Research; Jinan University; Linköpings Universitet; Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Institut national de recherche en informatique et en automatique (INRIA); Queen Mary University of London; Hamad Bin Khalifa University; Purdue University","keywords":"Computer science; Telecommunications; Electronic engineering; Engineering; Electrical engineering","score_opus":0.11878727707518973,"score_gpt":0.30981089710015713,"score_spread":0.19102362002496742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247032108","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.003109296,0.023026563,0.036746547,0.012745123,0.012411687,0.00016669095,0.0016889947,0.001726173,0.90837896],"genre_scores_gemma":[0.01777274,0.018051742,0.011627932,0.00203295,0.00177781,0.000107394946,0.0026510444,0.00029328032,0.9456852],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992083,0.00012522626,0.00004806696,0.00013973104,0.0004093917,0.000069308764],"domain_scores_gemma":[0.9967145,0.00036656111,0.000112935515,0.00040386684,0.0021101257,0.00029212926],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012426641,0.0009423223,0.00044130968,0.0014639783,0.0006919968,0.002581627,0.0006166418,0.001793874,0.12168673],"category_scores_gemma":[0.0026572265,0.00035171965,0.00028953492,0.0013467484,0.0004915651,0.0014715785,0.001388645,0.0028068093,0.11287021],"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.00008573705,0.000057272606,0.0007418737,0.00024502247,0.000022382208,0.00016563514,0.00012651394,0.00069058686,0.0034804116,0.031092096,0.54884744,0.41444507],"study_design_scores_gemma":[0.0000057748766,0.00002645595,0.0005162964,0.00009290716,0.000007059432,0.0001650428,0.0000411763,0.00053221214,0.0006594639,0.0024345869,0.9955117,0.000007180757],"about_ca_topic_score_codex":0.003674008,"about_ca_topic_score_gemma":0.0044071707,"teacher_disagreement_score":0.8783133,"about_ca_system_score_codex":0.000989857,"about_ca_system_score_gemma":0.0023092479,"threshold_uncertainty_score":0.40708268},"labels":[],"label_agreement":null},{"id":"W4250121933","doi":"10.1109/tcomm.2011.122110.090548","title":"Linear Precoding for Orthogonal Space-Time Block Coded MIMO-OFDM Cognitive Radio","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; MIMO; Transmitter; Orthogonal frequency-division multiplexing; Subcarrier; Cognitive radio; Transmitter power output; Rayleigh fading; Computer science; MIMO-OFDM; Convex optimization; Algorithm; Mathematics; Electronic engineering; Fading; Telecommunications; Beamforming; Wireless; Engineering; Regular polygon; Decoding methods; Channel (broadcasting)","score_opus":0.02480730036098968,"score_gpt":0.28760023525765516,"score_spread":0.2627929348966655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250121933","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.004151834,0.00016606132,0.99331737,0.000060842798,0.000037725484,0.000029819501,0.00002596234,0.0001174095,0.002092923],"genre_scores_gemma":[0.54669636,0.00075796957,0.44595733,0.00023067863,0.00012811276,0.00021250523,0.00014096248,0.00003727096,0.005838775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00010393224,0.000014889557,0.000047062076,0.00014327405,0.000041103234],"domain_scores_gemma":[0.9996226,0.00017456467,0.000045754958,0.000036064495,0.000109730514,0.00001125368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034001307,0.00048026448,0.0002727089,0.00016360317,0.00026039415,0.0005211393,0.00044061214,0.00044529352,0.0015352118],"category_scores_gemma":[0.0013625713,0.00017679116,0.00021896469,0.000323525,0.0003204623,0.00027371748,0.00035666057,0.00050008175,0.0006626068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001915113,0.00010668672,0.0006712051,0.0002615558,0.000077053875,0.00040782947,0.00018478344,0.5693173,0.056627348,0.038161237,0.0048051532,0.32918844],"study_design_scores_gemma":[0.00001670381,0.00015071702,0.00018681558,0.000019170166,0.000019207513,0.00011064425,0.000017455033,0.9838494,0.009066129,0.003573354,0.002977264,0.000013029528],"about_ca_topic_score_codex":0.0021393267,"about_ca_topic_score_gemma":0.004879829,"teacher_disagreement_score":0.0021393267,"about_ca_system_score_codex":0.0003561066,"about_ca_system_score_gemma":0.0007813661,"threshold_uncertainty_score":0.0051357746},"labels":[],"label_agreement":null},{"id":"W4250310517","doi":"10.1109/tcomm.2009.5336832","title":"Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Channel (broadcasting); Transmission (telecommunications); Rayleigh fading; Computer network; Automatic repeat request; Real-time computing; Fading; Bitstream; Algorithm; Hybrid automatic repeat request; Decoding methods; Telecommunications","score_opus":0.012811417657053988,"score_gpt":0.2546309348805072,"score_spread":0.2418195172234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250310517","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.04188905,0.00024308157,0.95672303,0.0001339521,0.000041984164,0.000050531275,0.000017236693,0.000216988,0.00068423606],"genre_scores_gemma":[0.8865638,0.00017503493,0.11209108,0.00005479626,0.00003608455,0.000073421914,0.00002647349,0.00003158783,0.0009477697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901414,0.00038708243,0.00006754279,0.000112200105,0.00028561844,0.00013340138],"domain_scores_gemma":[0.9969008,0.0020606285,0.00038061728,0.0001923582,0.00036617884,0.000099437675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016081793,0.00046033924,0.0008138492,0.00037741082,0.0004729865,0.0008128854,0.0007158574,0.0005759579,0.00090742816],"category_scores_gemma":[0.0063973106,0.0003224857,0.00022947324,0.00034792942,0.0008518038,0.0008233324,0.0006558541,0.00062627776,0.00018845878],"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.0007584043,0.0001021027,0.0009147422,0.00012175226,0.000046408746,0.0001849557,0.00023331387,0.8503733,0.015505815,0.025187166,0.0011981364,0.10537396],"study_design_scores_gemma":[0.000014050171,0.000033522654,0.000059518643,0.0000038434264,0.0000039233523,0.000023771234,0.000007511598,0.995739,0.0017772968,0.0021471633,0.00018528027,0.0000051927764],"about_ca_topic_score_codex":0.0012772457,"about_ca_topic_score_gemma":0.00090496737,"teacher_disagreement_score":0.0016081793,"about_ca_system_score_codex":0.0009706541,"about_ca_system_score_gemma":0.0011410862,"threshold_uncertainty_score":0.008504987},"labels":[],"label_agreement":null},{"id":"W4285170208","doi":"10.1109/tcomm.2022.3176851","title":"Learning-Based User Clustering in NOMA-Aided MIMO Networks With Spatially Correlated Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; MIMO; Spatial multiplexing; Computer science; Transmitter power output; Beamforming; Telecommunications link; Multi-user MIMO; Interference (communication); Noma; 3G MIMO; Channel (broadcasting); Algorithm; Computer network; Transmitter; Telecommunications; Artificial intelligence","score_opus":0.01612280484982464,"score_gpt":0.2266190071807459,"score_spread":0.21049620233092126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285170208","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.050032273,0.0002673992,0.94767773,0.00014072683,0.000025683752,0.000030994084,0.000024056153,0.00015003125,0.0016511509],"genre_scores_gemma":[0.92106754,0.00018197054,0.07664455,0.00009739773,0.00003998418,0.00007232975,0.000033686025,0.000027287133,0.0018352128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.000608945,0.000030747062,0.00018896861,0.00020906866,0.00016008219],"domain_scores_gemma":[0.9978162,0.0014144856,0.0002586006,0.00016616483,0.00025924906,0.00008534927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215792,0.0008988621,0.0010386028,0.0004006659,0.0008036607,0.00078673725,0.0011112817,0.0008933209,0.00057967275],"category_scores_gemma":[0.0035925868,0.0005856633,0.00044937243,0.0007851398,0.0010548095,0.0010893672,0.0012181434,0.0007558888,0.00022973484],"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.000047595826,0.000023321634,0.00028273178,0.000018472805,0.000020034837,0.000041913696,0.00005232147,0.9825334,0.0011632567,0.0039191945,0.00021405249,0.011683661],"study_design_scores_gemma":[0.0000035380015,0.000020951664,0.000073289426,0.0000015297057,0.0000039347224,0.000015284728,0.000013932547,0.9973999,0.0005079694,0.00185648,0.00009827028,0.0000048355982],"about_ca_topic_score_codex":0.0032631163,"about_ca_topic_score_gemma":0.005109721,"teacher_disagreement_score":0.0032631163,"about_ca_system_score_codex":0.0011437879,"about_ca_system_score_gemma":0.001047653,"threshold_uncertainty_score":0.008298755},"labels":[],"label_agreement":null},{"id":"W4285181159","doi":"10.1109/tcomm.2022.3186997","title":"Robust Task Scheduling for Delay-Aware IoT Applications in Civil Aircraft-Augmented SAGIN","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":47,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Transmission delay; Queuing delay; Optimization problem; Queueing theory; Real-time computing; Data transmission; Computer network; Mathematical optimization; Algorithm","score_opus":0.030315066493719796,"score_gpt":0.2542974678061702,"score_spread":0.2239824013124504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285181159","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.14873195,0.00042019787,0.847611,0.00030687512,0.00007681121,0.00006700423,0.00007336846,0.000183915,0.0025288677],"genre_scores_gemma":[0.9739862,0.00014779934,0.025001962,0.00004545822,0.0000193287,0.000037795027,0.000043604818,0.00002041278,0.0006974479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996081,0.00010418304,0.000019455778,0.000092217204,0.000073786,0.00010231675],"domain_scores_gemma":[0.99945146,0.00026186235,0.00011575167,0.000028922163,0.00007300519,0.000068939684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077800703,0.00078804017,0.00059497816,0.00021217972,0.00043052592,0.00072715833,0.0005615451,0.0003815426,0.0007488903],"category_scores_gemma":[0.0012705703,0.00022818532,0.00039164544,0.0003759977,0.0004123008,0.00060122536,0.00062702433,0.0006278708,0.00007384955],"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.000087385226,0.000032490734,0.00035968356,0.000032940065,0.000013384611,0.00006672492,0.000031219373,0.9842046,0.0036027287,0.0027828128,0.000307557,0.008478484],"study_design_scores_gemma":[0.000004396387,0.0000267106,0.00009711103,0.0000013544583,0.0000033998674,0.000007937866,0.000010789794,0.99843615,0.00036716167,0.0009110334,0.00013193113,0.000002152514],"about_ca_topic_score_codex":0.0060962616,"about_ca_topic_score_gemma":0.0041271048,"teacher_disagreement_score":0.0060962616,"about_ca_system_score_codex":0.00076865545,"about_ca_system_score_gemma":0.0015442204,"threshold_uncertainty_score":0.012121558},"labels":[],"label_agreement":null},{"id":"W4285244839","doi":"10.1109/tcomm.2022.3178752","title":"An Analysis of the Error Rate Performance for Uplink Asynchronous Signal Detection in Non-Orthogonal Multiple Access","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":9,"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, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Asynchronous communication; Telecommunications link; Quadrature amplitude modulation; Single antenna interference cancellation; Multiuser detection; Iterative method; Algorithm; Detection theory; Computer science; Notation; Mathematics; Bit error rate; Detector; Arithmetic; Decoding methods; Telecommunications","score_opus":0.029364823971240947,"score_gpt":0.2896016232259396,"score_spread":0.2602367992546986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285244839","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.043968566,0.0017319728,0.9452632,0.00026740556,0.00008504857,0.00005349269,0.000075168915,0.0002589365,0.0082961405],"genre_scores_gemma":[0.9045711,0.0032881992,0.08723677,0.0002209567,0.00024495958,0.0001470674,0.00015725811,0.00012124553,0.0040123616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.00091820816,0.00009452457,0.00036056168,0.00089644745,0.0003015034],"domain_scores_gemma":[0.99257845,0.004507324,0.0008337048,0.0005834463,0.0013928292,0.00010429587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003248431,0.0017848748,0.0010112677,0.0009861238,0.0005479157,0.0015749076,0.0013069615,0.0013220154,0.0018034668],"category_scores_gemma":[0.013554255,0.00045900937,0.0008121062,0.0010344958,0.0013608016,0.0018162177,0.0011867321,0.0013952372,0.00062361354],"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.00022575099,0.00008028577,0.0013326253,0.0003722576,0.00010312741,0.00045150236,0.00027153126,0.8395851,0.017102873,0.10439559,0.0011182142,0.03496125],"study_design_scores_gemma":[0.0000056318413,0.00005703668,0.00024261691,0.000018295155,0.0000148001645,0.000089263056,0.000018508252,0.9934956,0.0018920891,0.0038868587,0.00026549763,0.000013819156],"about_ca_topic_score_codex":0.0024150352,"about_ca_topic_score_gemma":0.0013842527,"teacher_disagreement_score":0.003248431,"about_ca_system_score_codex":0.0011485197,"about_ca_system_score_gemma":0.0011999449,"threshold_uncertainty_score":0.017179608},"labels":[],"label_agreement":null},{"id":"W4285274232","doi":"10.1109/tcomm.2022.3171450","title":"Grant Free Age-Optimal Random Access Protocol for Satellite-Based Internet of Things","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":33,"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 New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Random access; Computer science; Computer network; Throughput; Frame (networking); Markov chain; Protocol (science); Markov process; Transmission (telecommunications); Real-time computing; Distributed computing; Telecommunications; Wireless; Mathematics","score_opus":0.059858787999661,"score_gpt":0.3227953658612915,"score_spread":0.2629365778616305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285274232","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.03146626,0.000948816,0.96387875,0.00045178251,0.00014235858,0.00012240962,0.00007597194,0.0004698485,0.0024437206],"genre_scores_gemma":[0.95649505,0.0005525456,0.04104682,0.00017816719,0.000085073225,0.00021406016,0.00006790803,0.000031995325,0.0013284582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778,0.0007317241,0.00014383423,0.00039851136,0.0005807172,0.00036529027],"domain_scores_gemma":[0.99615484,0.0022146495,0.0005746678,0.0002959903,0.0006210071,0.00013893428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002069502,0.000786738,0.0009123872,0.00092390785,0.0009062868,0.0010814263,0.0014530912,0.0007287317,0.0009760737],"category_scores_gemma":[0.009067253,0.00033727725,0.00054031896,0.0010364644,0.0012386056,0.0019915872,0.0015984534,0.0011706571,0.00020450553],"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.0007296494,0.00020084207,0.003067325,0.00042185013,0.00018141903,0.00083640637,0.0010628345,0.60881126,0.034397956,0.23881575,0.0054287775,0.10604586],"study_design_scores_gemma":[0.000048895927,0.00015690524,0.00027827415,0.000021699218,0.000043241092,0.00027418154,0.00006223333,0.96043056,0.0026817736,0.034214657,0.0017289107,0.000058723257],"about_ca_topic_score_codex":0.0022235825,"about_ca_topic_score_gemma":0.0025851044,"teacher_disagreement_score":0.0022235825,"about_ca_system_score_codex":0.0011621696,"about_ca_system_score_gemma":0.0016665118,"threshold_uncertainty_score":0.010944724},"labels":[],"label_agreement":null},{"id":"W4285282375","doi":"10.1109/tcomm.2022.3189072","title":"Spectrum Reconstruction via Deep Convolutional Neural Networks for Satellite Communication Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Data transmission; Spectrum (functional analysis); Satellite; Transmission (telecommunications); Artificial neural network; Artificial intelligence; Remote sensing; Algorithm; Telecommunications; Computer network; Engineering; Physics","score_opus":0.024181353669605263,"score_gpt":0.23487012382597253,"score_spread":0.21068877015636728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285282375","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.061808996,0.0013868589,0.93198687,0.00050231256,0.00006481703,0.000029013692,0.000123259,0.0007443705,0.0033535317],"genre_scores_gemma":[0.91306436,0.00060506,0.08274705,0.00013241392,0.000041716146,0.000032587926,0.00022391108,0.000042127696,0.0031108079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.000046573157,0.000010329273,0.000041884614,0.00007106092,0.000034859007],"domain_scores_gemma":[0.99964297,0.00018708032,0.00005106489,0.00003082464,0.0000740384,0.000014033446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044849276,0.0006035187,0.00035163297,0.00026691242,0.00019164388,0.00042830623,0.000603813,0.0005922017,0.0009028728],"category_scores_gemma":[0.0014678723,0.0002519767,0.0002842444,0.0003671798,0.00041950832,0.00066789443,0.0006001453,0.0010101858,0.00016500344],"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.000098643904,0.000034463857,0.00081588246,0.000056333214,0.000027757029,0.00006671653,0.000030640425,0.93130034,0.0041896263,0.0048914426,0.00078166596,0.057706464],"study_design_scores_gemma":[7.7432503e-7,0.0000048851784,0.000040609455,0.000001589712,0.0000013513395,0.000003991413,0.0000016270044,0.9988998,0.00040976092,0.00056160433,0.00007275019,0.0000011479548],"about_ca_topic_score_codex":0.010299519,"about_ca_topic_score_gemma":0.010697824,"teacher_disagreement_score":0.010299519,"about_ca_system_score_codex":0.0007696394,"about_ca_system_score_gemma":0.0006554161,"threshold_uncertainty_score":0.020479083},"labels":[],"label_agreement":null},{"id":"W4285291292","doi":"10.1109/tcomm.2022.3189398","title":"Multi-IRS-Assisted mmWave MIMO Communication Using Twin-Timescale Channel State Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":20,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Channel state information; MIMO; Computer science; Precoding; Spectral efficiency; Channel (broadcasting); Overhead (engineering); Computational complexity theory; Base station; Algorithm; Electronic engineering; Wireless; Telecommunications; Engineering","score_opus":0.045724442038667004,"score_gpt":0.26985905295118423,"score_spread":0.22413461091251724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285291292","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.010931495,0.00014763443,0.9862113,0.0000627484,0.000032619355,0.000018576362,0.000034283454,0.0003122763,0.002248977],"genre_scores_gemma":[0.7035424,0.0004211651,0.2914826,0.00018151196,0.00008546261,0.00009062456,0.00017434673,0.00004103436,0.0039808657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.0000949913,0.000020394487,0.00009542186,0.00014259586,0.000064779306],"domain_scores_gemma":[0.9995553,0.00014795856,0.00007290061,0.00010611015,0.00009223467,0.000025505833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035589738,0.0009322997,0.00058667647,0.00024001663,0.00036853077,0.0007182974,0.0007887555,0.0005155644,0.0016450336],"category_scores_gemma":[0.0010209826,0.00033882953,0.0004136742,0.00050897524,0.0004365116,0.0011389658,0.00094089046,0.00081787555,0.00065701746],"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.00029994157,0.0001525766,0.0012715778,0.00024541188,0.000115763396,0.0002601184,0.00024464028,0.6145886,0.06851439,0.024910243,0.0024357047,0.28696108],"study_design_scores_gemma":[0.000016141577,0.00012958111,0.0002162316,0.000013883574,0.000023623781,0.0001421842,0.000036282476,0.9816341,0.012124942,0.00385626,0.0017864015,0.00002042977],"about_ca_topic_score_codex":0.00096171984,"about_ca_topic_score_gemma":0.0026538495,"teacher_disagreement_score":0.0016450336,"about_ca_system_score_codex":0.00031010422,"about_ca_system_score_gemma":0.00069645036,"threshold_uncertainty_score":0.0055031776},"labels":[],"label_agreement":null},{"id":"W4285292779","doi":"10.1109/tcomm.2022.3175915","title":"New Antenna Selection Schemes for Full-Duplex Cooperative MIMO-NOMA Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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 Alberta","funders":"Shahrekord University","keywords":"Computer science; Relay; MIMO; Antenna (radio); Quality of service; Computer network; Interference (communication); Topology (electrical circuits); Electronic engineering; Telecommunications; Engineering; Electrical engineering; Channel (broadcasting); Power (physics)","score_opus":0.0332674395243072,"score_gpt":0.2705876941051294,"score_spread":0.2373202545808222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285292779","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.0355418,0.0019904473,0.9547017,0.00019789554,0.00015991429,0.000065186374,0.000062951345,0.00032197524,0.006958069],"genre_scores_gemma":[0.8627843,0.0011338607,0.13245845,0.0001614119,0.00017952734,0.00011594826,0.000071437746,0.000019330608,0.0030757445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.0003599136,0.00004042939,0.00013337024,0.00017478001,0.000101941674],"domain_scores_gemma":[0.9993149,0.00024983476,0.00009181341,0.00016267727,0.00014344914,0.000037296533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961915,0.0007368912,0.00048863783,0.0003354219,0.00055711594,0.0007703791,0.00097018905,0.00046012097,0.0012002478],"category_scores_gemma":[0.0012236609,0.00025473206,0.00031734476,0.0007956685,0.0005732906,0.000711411,0.0007539985,0.0005347372,0.00049171626],"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.00044891532,0.00016855964,0.0018391042,0.00041538238,0.00014317324,0.00057278556,0.000743886,0.38767153,0.09750785,0.13486736,0.008159042,0.3674625],"study_design_scores_gemma":[0.0000396118,0.00031832026,0.00061716407,0.000027024162,0.000057571873,0.0007743808,0.00013183463,0.9607791,0.008781389,0.014719002,0.0137032205,0.000051378844],"about_ca_topic_score_codex":0.0005638242,"about_ca_topic_score_gemma":0.0014810101,"teacher_disagreement_score":0.0012002478,"about_ca_system_score_codex":0.00043730292,"about_ca_system_score_gemma":0.00035183283,"threshold_uncertainty_score":0.004015267},"labels":[],"label_agreement":null},{"id":"W4285412026","doi":"10.1109/tcomm.2022.3190904","title":"Scheduling Versus Contention for Massive Random Access in Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; MIMO; Scheduling (production processes); Random access; Distributed computing; Computer network; Electronic engineering; Telecommunications; Engineering; Mathematics; Mathematical optimization; Beamforming","score_opus":0.07794852188147287,"score_gpt":0.32419180367179923,"score_spread":0.24624328179032634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285412026","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.113786586,0.0008043861,0.87975156,0.000341258,0.00014004005,0.0000785397,0.000032369553,0.0002248903,0.004840396],"genre_scores_gemma":[0.97941476,0.00015868538,0.019689506,0.000046504378,0.000038878658,0.00002864254,0.000009385327,0.000008945461,0.0006048428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.00043307076,0.00002972836,0.00010577228,0.00023295869,0.00012933377],"domain_scores_gemma":[0.9962799,0.0025396727,0.00038509766,0.0003548713,0.00029914355,0.0001412891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015355283,0.0003712794,0.0005227485,0.00027674568,0.000408297,0.0008567093,0.00068374997,0.00040896412,0.0011047744],"category_scores_gemma":[0.0050276457,0.0001871439,0.0002091013,0.00044416395,0.0009762057,0.00104738,0.0007175571,0.0005431519,0.00014819596],"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.0003689304,0.00006156462,0.0010696083,0.000114850576,0.000038099,0.0002860432,0.00014713603,0.8908573,0.0122694895,0.067155994,0.0006803692,0.026950628],"study_design_scores_gemma":[0.000015422373,0.00007326716,0.0001506709,0.0000042087736,0.0000065456256,0.000042838292,0.000024717685,0.99190825,0.00107781,0.0063363747,0.00035351166,0.000006346404],"about_ca_topic_score_codex":0.0011447034,"about_ca_topic_score_gemma":0.0016296493,"teacher_disagreement_score":0.0015355283,"about_ca_system_score_codex":0.0006655209,"about_ca_system_score_gemma":0.00076624274,"threshold_uncertainty_score":0.008120775},"labels":[],"label_agreement":null},{"id":"W4288064493","doi":"10.1109/tcomm.2022.3194018","title":"Superposition-Based URLLC Traffic Scheduling in 5G and Beyond Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Concordia University","keywords":"Computer science; Quality of service; Scheduling (production processes); Telecommunications link; Mobile broadband; Mathematical optimization; Network packet; Computer network; Multiplexing; Wireless; Mathematics; Telecommunications","score_opus":0.014778589685058324,"score_gpt":0.23351615323855734,"score_spread":0.21873756355349902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288064493","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.106172696,0.0006860739,0.8878199,0.00044565328,0.00008117992,0.000062775805,0.000068466565,0.00031952836,0.00434381],"genre_scores_gemma":[0.9467875,0.00031668236,0.05144816,0.00010124469,0.000050695275,0.000041257907,0.000051593146,0.00003189566,0.001171002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990946,0.00037985845,0.00003278184,0.00012883356,0.00018041194,0.00018356454],"domain_scores_gemma":[0.99898833,0.00058776204,0.00013404794,0.000056878787,0.00014772327,0.00008522719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480457,0.00060248876,0.00089366024,0.00034178214,0.00066169206,0.0007563085,0.0008977499,0.0005921388,0.0013280243],"category_scores_gemma":[0.0019691715,0.00035635673,0.00047114003,0.0008389605,0.0007107916,0.00091557886,0.00088350073,0.0007858138,0.00017626869],"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.00021396902,0.000066670735,0.000621249,0.00007981603,0.000026754815,0.00011520482,0.00009136461,0.9300648,0.0062274514,0.015053439,0.0011486874,0.04629054],"study_design_scores_gemma":[0.0000060562966,0.000029566789,0.00007901557,0.0000027771573,0.000005343027,0.000014021507,0.000012369182,0.99661356,0.00068270555,0.0023287765,0.00022184591,0.000003997273],"about_ca_topic_score_codex":0.004153038,"about_ca_topic_score_gemma":0.004768911,"teacher_disagreement_score":0.004153038,"about_ca_system_score_codex":0.0014924976,"about_ca_system_score_gemma":0.0016393055,"threshold_uncertainty_score":0.010828912},"labels":[],"label_agreement":null},{"id":"W4288064661","doi":"10.1109/tcomm.2022.3194134","title":"Fine-Grained Analysis of Reconfigurable Intelligent Surface-Assisted mmWave Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":20,"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":"National Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Key Technology Research and Development Program of Shandong; Department for the Economy","keywords":"Stochastic geometry; Non-line-of-sight propagation; Path loss; Beamforming; Computer science; Base station; Coverage probability; Enhanced Data Rates for GSM Evolution; Scalability; Electronic engineering; Cellular network; Extremely high frequency; Midpoint; Topology (electrical circuits); Spectral efficiency; Computer network; Telecommunications; Wireless; Engineering; Mathematics; Electrical engineering; Geometry","score_opus":0.037606325234539294,"score_gpt":0.2638831526853431,"score_spread":0.22627682745080382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288064661","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.3907626,0.00074882904,0.59170216,0.0006608551,0.00009248758,0.00006554025,0.00021053155,0.00026999693,0.015487038],"genre_scores_gemma":[0.99065,0.00018603652,0.0072528385,0.00005292553,0.000019744977,0.00002761283,0.00003777147,0.000025138774,0.001748094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971884,0.00006475953,0.000006694134,0.000040959017,0.00006978682,0.00009890926],"domain_scores_gemma":[0.99925107,0.00039628986,0.00016195037,0.00004807681,0.00008756453,0.000055009215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119216,0.00055403274,0.00052699575,0.00052653404,0.00034119323,0.00081865414,0.0008531388,0.00079135085,0.001491187],"category_scores_gemma":[0.0019189523,0.00035864086,0.000497784,0.00029665316,0.0009975657,0.0009720266,0.0006522382,0.00046268714,0.00014989685],"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.000010046374,0.0000074292816,0.00034506712,0.000010211299,0.000007545175,0.00003803692,0.0000096612275,0.9850263,0.0010601245,0.012402246,0.00014192033,0.00094146014],"study_design_scores_gemma":[8.566511e-7,0.0000040463074,0.000107714164,7.9009897e-7,0.0000011498768,0.000004569466,0.0000039917823,0.99804294,0.000091385315,0.0016843001,0.000056954083,0.0000012047433],"about_ca_topic_score_codex":0.005463815,"about_ca_topic_score_gemma":0.002987193,"teacher_disagreement_score":0.005463815,"about_ca_system_score_codex":0.0015921876,"about_ca_system_score_gemma":0.0005630973,"threshold_uncertainty_score":0.011552215},"labels":[],"label_agreement":null},{"id":"W4291805098","doi":"10.1109/tcomm.2022.3199018","title":"Learning-Based Resource Allocation for Ultra-Reliable V2X Networks With Partial CSI","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":28,"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":"Fundamental Research Funds for the Central Universities; Shaanxi Province Postdoctoral Science Foundation; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Throughput; Reliability (semiconductor); Probabilistic logic; Constraint (computer-aided design); Mathematical optimization; Resource management (computing); Artificial neural network; Transformation (genetics); Signal-to-noise ratio (imaging); Distributed computing; Power (physics); Computer network; Artificial intelligence; Engineering; Mathematics; Wireless","score_opus":0.012999795496169734,"score_gpt":0.21804364489659991,"score_spread":0.2050438494004302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291805098","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.031477574,0.00093276624,0.9636655,0.0002644378,0.00006160909,0.00003613025,0.00004564988,0.0001706834,0.0033456152],"genre_scores_gemma":[0.9541046,0.0004891641,0.042219248,0.00012293427,0.000055857978,0.00007917018,0.00006720278,0.000038385537,0.0028233952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962366,0.0000821661,0.000014973352,0.00010835133,0.000073198134,0.00009763275],"domain_scores_gemma":[0.99944454,0.00032377706,0.000075254036,0.000030447627,0.00009377269,0.000032103766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136855,0.0009438499,0.0009852725,0.00028689456,0.0004633024,0.0008257598,0.0013536105,0.0007888678,0.0014762903],"category_scores_gemma":[0.0016183386,0.00040720648,0.00036709104,0.00057584804,0.0007593286,0.0014398531,0.0008874849,0.0010004996,0.00019156751],"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.000039290826,0.000019321546,0.00022750317,0.000044880093,0.000013065822,0.000056927667,0.000029408588,0.97745323,0.0009205974,0.004430721,0.0004827978,0.016282363],"study_design_scores_gemma":[0.0000022215743,0.000008394871,0.000031694814,0.0000019293088,0.000002444214,0.000007977994,0.000006059471,0.9983929,0.00018559027,0.001254258,0.00010467088,0.0000019308552],"about_ca_topic_score_codex":0.008445891,"about_ca_topic_score_gemma":0.0062985956,"teacher_disagreement_score":0.008445891,"about_ca_system_score_codex":0.0011284886,"about_ca_system_score_gemma":0.0011917662,"threshold_uncertainty_score":0.01679343},"labels":[],"label_agreement":null},{"id":"W4293255001","doi":"10.1109/tcomm.2022.3161021","title":"UAV-Assisted Edge Caching Under Uncertain Demand: A Data-Driven Distributionally Robust Joint Strategy","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"China Postdoctoral Science Foundation","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Robust optimization; Latency (audio); Mathematical optimization","score_opus":0.09997441899558798,"score_gpt":0.28153602154583934,"score_spread":0.18156160255025136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293255001","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.033275425,0.00032526738,0.963273,0.00027352123,0.000039822862,0.00003908183,0.000073913056,0.00018289489,0.0025169763],"genre_scores_gemma":[0.9759622,0.00016966416,0.02221361,0.000118063705,0.00002548738,0.000044976423,0.000071929244,0.00002883959,0.0013651437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991067,0.00019855739,0.000046932244,0.00022031854,0.0002311126,0.00019636468],"domain_scores_gemma":[0.9977107,0.0010848864,0.00042866266,0.0001733828,0.00046632133,0.0001359989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010041216,0.0011709544,0.0012868998,0.00040783643,0.000479398,0.0012409614,0.0013504094,0.0012176447,0.0009384951],"category_scores_gemma":[0.0036868595,0.00044502152,0.00059843686,0.0005874397,0.0009350886,0.0015274704,0.0015007457,0.0010080112,0.00021622427],"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.00009940834,0.000032836804,0.00074560347,0.000056309393,0.000043217413,0.00020245908,0.00006988536,0.968275,0.0044193896,0.012665954,0.0006999786,0.012690003],"study_design_scores_gemma":[0.0000052013456,0.000032717573,0.00008349651,0.000003587674,0.000007832966,0.000029553015,0.000013716704,0.99689627,0.00052189524,0.0022530186,0.00014549833,0.0000070563583],"about_ca_topic_score_codex":0.0063605774,"about_ca_topic_score_gemma":0.004019474,"teacher_disagreement_score":0.0063605774,"about_ca_system_score_codex":0.0010404002,"about_ca_system_score_gemma":0.0012087655,"threshold_uncertainty_score":0.012647152},"labels":[],"label_agreement":null},{"id":"W4294811270","doi":"10.1109/tcomm.2022.3204846","title":"Delay-Aware and Energy-Efficient Carrier Aggregation in 5G Using Double Deep Q-Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Quality of service; Energy consumption; User equipment; Scheme (mathematics); Distributed computing; Computer network; Mathematical optimization; Real-time computing; Base station; Engineering; Mathematics","score_opus":0.020509438444781973,"score_gpt":0.2438146212081365,"score_spread":0.2233051827633545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811270","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.07476706,0.00056391454,0.9212197,0.0002952891,0.00006944796,0.000069731876,0.00003524187,0.00014798323,0.00283166],"genre_scores_gemma":[0.95993465,0.00017635972,0.038526274,0.00011067306,0.000024820602,0.000029611901,0.000018392058,0.000010233658,0.0011688876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00017747868,0.000022520562,0.00011642432,0.00011344312,0.00015117362],"domain_scores_gemma":[0.99940073,0.00030302865,0.00009562867,0.000044875385,0.00010076521,0.000054882148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019993,0.00078540464,0.0008468074,0.0002853552,0.00058662053,0.00088229275,0.0010243835,0.0006612981,0.0008305906],"category_scores_gemma":[0.0014506598,0.00026819017,0.0003023651,0.00047980665,0.00075406174,0.0012858919,0.001080938,0.0006205054,0.000095617936],"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.00019707772,0.00009188008,0.0010437946,0.000063055944,0.000036585552,0.0001449813,0.000096638985,0.9128975,0.007331997,0.019992294,0.0010295622,0.05707456],"study_design_scores_gemma":[0.000009523661,0.00004218744,0.000093067145,0.0000033948625,0.0000064597766,0.000027664586,0.000013265679,0.99505806,0.00056814554,0.0038939535,0.0002795954,0.000004642555],"about_ca_topic_score_codex":0.005440627,"about_ca_topic_score_gemma":0.007749818,"teacher_disagreement_score":0.005440627,"about_ca_system_score_codex":0.0011318619,"about_ca_system_score_gemma":0.0013035975,"threshold_uncertainty_score":0.010817885},"labels":[],"label_agreement":null},{"id":"W4298335015","doi":"10.1109/tcomm.2022.3196648","title":"Adaptive Physical Layer Authentication Using Machine Learning With Antenna Diversity","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":39,"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; Physical layer; Computer network; Wireless; Support vector machine; Antenna diversity; Real-time computing; Electronic engineering; Artificial intelligence; Engineering; Telecommunications","score_opus":0.09099514232114575,"score_gpt":0.27726405819970656,"score_spread":0.18626891587856081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298335015","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.051226553,0.0003412141,0.94533867,0.00017878944,0.00008484666,0.00004575275,0.000030171466,0.0012105382,0.0015435495],"genre_scores_gemma":[0.88428986,0.00013599091,0.113202654,0.000109941284,0.00007177366,0.000057663452,0.00008855032,0.000022811893,0.0020208177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888796,0.00037225816,0.000065656386,0.00021233107,0.00031802646,0.0001437714],"domain_scores_gemma":[0.99824286,0.0007319525,0.00027033174,0.0003466013,0.0003597358,0.00004846597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010896163,0.0006130026,0.0007621551,0.00062435394,0.00048121743,0.00078113825,0.00083134125,0.00077610544,0.0008853767],"category_scores_gemma":[0.0028477274,0.00023431382,0.0005511028,0.00068556546,0.0005616305,0.0013723086,0.0011228716,0.0010066907,0.0007272623],"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.0006010342,0.00033150346,0.003523958,0.00007264886,0.00012962503,0.00017983577,0.00010431548,0.27790555,0.050309878,0.006245123,0.0020479285,0.65854865],"study_design_scores_gemma":[0.000010736407,0.00012048121,0.00043664104,0.000003952695,0.000010505677,0.00007062416,0.000007524613,0.9906708,0.0067535643,0.0014464544,0.00045505745,0.000013636103],"about_ca_topic_score_codex":0.00055911805,"about_ca_topic_score_gemma":0.00053554337,"teacher_disagreement_score":0.0010896163,"about_ca_system_score_codex":0.00047233797,"about_ca_system_score_gemma":0.00044513762,"threshold_uncertainty_score":0.0057625175},"labels":[],"label_agreement":null},{"id":"W4309757106","doi":"10.1109/tcomm.2022.3211101","title":"Decoding Reed-Muller Codes With Successive Codeword Permutations","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"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":"Code word; Decoding methods; Permutation (music); Algorithm; List decoding; Error detection and correction; Hadamard transform; Computational complexity theory; Computer science; Sequential decoding; Mathematics; Discrete mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.03302514777196357,"score_gpt":0.2903340931662864,"score_spread":0.2573089453943228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309757106","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.033533137,0.00026888825,0.9623453,0.00007107219,0.00003789891,0.00008611298,0.000093386814,0.0011540639,0.0024100894],"genre_scores_gemma":[0.24902532,0.0002972848,0.74647546,0.00008733875,0.000046721783,0.00018046427,0.00038637026,0.00010523335,0.0033957742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994004,0.00013021329,0.00005150013,0.00007331675,0.0002831732,0.0000614114],"domain_scores_gemma":[0.99927944,0.00022389977,0.00011903537,0.00014801144,0.00021048907,0.000019157438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045023017,0.0006401138,0.00046381654,0.0007337487,0.00038630914,0.00056966516,0.0007945472,0.00041669086,0.0010675519],"category_scores_gemma":[0.0017258248,0.00026390224,0.00040780066,0.00068688986,0.00040314128,0.00057451037,0.0006828809,0.00050296605,0.00075749063],"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.00047912958,0.000083123814,0.0012169946,0.0003751323,0.00008135367,0.00036840673,0.0002886618,0.17188439,0.23621492,0.065275945,0.002432874,0.521299],"study_design_scores_gemma":[0.00007930922,0.00027160937,0.00038060985,0.000035131954,0.000031261854,0.0004516446,0.000026451955,0.8107147,0.16726342,0.012300787,0.008406343,0.000038698035],"about_ca_topic_score_codex":0.0017655174,"about_ca_topic_score_gemma":0.002918231,"teacher_disagreement_score":0.0017655174,"about_ca_system_score_codex":0.000503374,"about_ca_system_score_gemma":0.0018167399,"threshold_uncertainty_score":0.0036522746},"labels":[],"label_agreement":null},{"id":"W4312040304","doi":"10.1109/tcomm.2022.3217574","title":"Age of Information With Hybrid-ARQ: A Unified Explicit Result","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Computer science; Automatic repeat request; Decoding methods; Robustness (evolution); Minification; Real-time computing; Coding (social sciences); Algorithm; Computer network; Mathematics; Telecommunications link","score_opus":0.021544466944623218,"score_gpt":0.2362473509092995,"score_spread":0.21470288396467627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312040304","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.011333248,0.0017716731,0.97663,0.0004213329,0.00013079174,0.000040732957,0.000067131296,0.00011878257,0.009486204],"genre_scores_gemma":[0.84553033,0.004101159,0.13992633,0.0005057848,0.0005801932,0.00016336488,0.0001172931,0.00019364865,0.008881843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840325,0.00050040695,0.00005730766,0.00020502396,0.00058963755,0.00024431627],"domain_scores_gemma":[0.9940322,0.003883921,0.0005096348,0.00038472554,0.0010566475,0.00013287165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035162338,0.0012103993,0.00089094555,0.0011292363,0.00062759884,0.0021641757,0.0013089721,0.0008385905,0.0031352784],"category_scores_gemma":[0.010745235,0.0004648746,0.00074373087,0.0010409387,0.002069093,0.0031076432,0.0016993055,0.0019351173,0.0006347954],"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.00010853373,0.00006923382,0.0009589598,0.00032667784,0.000066216955,0.00023039884,0.00038576577,0.5487507,0.0067105545,0.40112972,0.0032493705,0.03801376],"study_design_scores_gemma":[0.0000061658543,0.000048151443,0.00020362617,0.000031779393,0.000025097575,0.00009966665,0.000051559146,0.95272267,0.0011082318,0.044015005,0.0016669922,0.00002103928],"about_ca_topic_score_codex":0.0023106488,"about_ca_topic_score_gemma":0.0017408883,"teacher_disagreement_score":0.0035162338,"about_ca_system_score_codex":0.0017453748,"about_ca_system_score_gemma":0.0014801832,"threshold_uncertainty_score":0.018595815},"labels":[],"label_agreement":null},{"id":"W4312050867","doi":"10.1109/tcomm.2022.3218822","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Upper and lower bounds; Encoder; Lossy compression; Gaussian; Mathematics; Distortion (music); Algorithm; Discrete mathematics; Cramér–Rao bound; Combinatorics; Computer science; Mathematical analysis; Statistics; Telecommunications; Physics","score_opus":0.0212321375510016,"score_gpt":0.2501063285394391,"score_spread":0.2288741909884375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050867","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.039864153,0.0011719072,0.95175457,0.0005124769,0.00006081778,0.000058372367,0.00018655819,0.00018260036,0.006208482],"genre_scores_gemma":[0.8798155,0.0030103244,0.10149034,0.00034653218,0.00019921846,0.00033089894,0.0006786019,0.0000860801,0.014042458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992155,0.000249632,0.000031287214,0.00011949157,0.00027107119,0.00011299702],"domain_scores_gemma":[0.9967847,0.0022853406,0.00026919186,0.00020535011,0.0003817514,0.0000736648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409199,0.0012299535,0.0010225007,0.0008740799,0.00037975726,0.0010902061,0.0018019464,0.0013245132,0.0022556453],"category_scores_gemma":[0.0062594144,0.0005323026,0.00040622018,0.0011674784,0.0015595091,0.0024324558,0.0018655005,0.0015813133,0.00053121086],"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.00022709338,0.00003164397,0.0002460413,0.00010720667,0.000027723345,0.00016907399,0.000104943196,0.86443716,0.002552224,0.10306369,0.0016288966,0.02740428],"study_design_scores_gemma":[0.000009414283,0.000024345614,0.000059904687,0.000013283371,0.000005954355,0.000033073582,0.000009449569,0.97664475,0.00065936527,0.022207472,0.00032463268,0.0000083964105],"about_ca_topic_score_codex":0.0034149317,"about_ca_topic_score_gemma":0.0027609854,"teacher_disagreement_score":0.0034149317,"about_ca_system_score_codex":0.0019803226,"about_ca_system_score_gemma":0.0010561635,"threshold_uncertainty_score":0.014368296},"labels":[],"label_agreement":null},{"id":"W4312050976","doi":"10.1109/tcomm.2022.3220319","title":"RIS-Aided Mobile Localization Error Bounds Under Hardware Impairments","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Transceiver; Cramér–Rao bound; Estimator; Position (finance); Computer science; Interference (communication); Mean squared error; Algorithm; Computer hardware; Mathematics; Telecommunications; Statistics; Estimation theory; Wireless","score_opus":0.028594535705980476,"score_gpt":0.27934001001857856,"score_spread":0.2507454743125981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050976","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.041686684,0.0013753333,0.9503839,0.00034444802,0.00008967247,0.00003943303,0.00012895212,0.0005663282,0.0053852582],"genre_scores_gemma":[0.9020175,0.00084689865,0.09357291,0.00012137183,0.000057112396,0.00010739194,0.00022007675,0.00009886468,0.002957914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867404,0.00039330707,0.00005924976,0.00017331533,0.00050591625,0.0001941184],"domain_scores_gemma":[0.9919551,0.005878859,0.00056350866,0.00039362526,0.0010971058,0.000111839385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021199165,0.0011279801,0.0008263863,0.0008342357,0.00035357356,0.0010922019,0.0007186856,0.0009784754,0.0022370908],"category_scores_gemma":[0.016081998,0.000336335,0.00043764676,0.0006229393,0.0010751478,0.0012418944,0.0019987235,0.0012356491,0.00054664235],"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.00011217561,0.000012668616,0.0006435965,0.000110263165,0.000017823664,0.00008745857,0.00006324421,0.9740292,0.0028864976,0.00634616,0.00047268634,0.015218348],"study_design_scores_gemma":[0.0000057706056,0.000049287464,0.00022128559,0.00002750197,0.00000651356,0.000050304217,0.000027447835,0.9949633,0.0024283994,0.0018475814,0.00036059067,0.000011935498],"about_ca_topic_score_codex":0.0034003286,"about_ca_topic_score_gemma":0.0030709577,"teacher_disagreement_score":0.0034003286,"about_ca_system_score_codex":0.0007230114,"about_ca_system_score_gemma":0.0013772164,"threshold_uncertainty_score":0.011211336},"labels":[],"label_agreement":null},{"id":"W4312051168","doi":"10.1109/tcomm.2022.3217575","title":"Constellation Design for Multiuser Non-Coherent Massive SIMO Based on DMPSK Modulation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Agencia Estatal de Investigación; Secretaría de Estado de Investigación, Desarrollo e Innovación; HORIZON EUROPE Marie Sklodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Bit error rate; Algorithm; Phase-shift keying; Keying; Channel (broadcasting); Constellation; Modulation (music); Reduction (mathematics); Theoretical computer science; Computer engineering; Decoding methods; Mathematics; Telecommunications","score_opus":0.038651794184268895,"score_gpt":0.2640161425969967,"score_spread":0.2253643484127278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051168","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.02213128,0.00022138016,0.9752855,0.00010766163,0.000021001699,0.000028520364,0.000027770562,0.00011352762,0.0020632881],"genre_scores_gemma":[0.63429934,0.00040004656,0.36306074,0.000090770314,0.000038337188,0.000080249796,0.00009174031,0.00004255203,0.0018961524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.00025663342,0.000026075844,0.00006428697,0.00016326726,0.000047156635],"domain_scores_gemma":[0.99937963,0.00023013572,0.00011588638,0.0001159516,0.00012299413,0.000035415214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063680427,0.00054284785,0.0004442101,0.00037622216,0.00026432704,0.00044293693,0.00068038807,0.0003748469,0.0010226162],"category_scores_gemma":[0.0018318954,0.00022229805,0.00028914903,0.0006422636,0.0004180474,0.000666789,0.0007759635,0.00047231384,0.00027777159],"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.00036478267,0.00009012204,0.001281581,0.00019291327,0.0000650124,0.00021783062,0.00022143027,0.69053787,0.044343825,0.07341737,0.001494541,0.18777277],"study_design_scores_gemma":[0.000030830386,0.0001110375,0.00021093272,0.000012311783,0.000012892565,0.000121518264,0.000016154929,0.97538084,0.009333102,0.012700924,0.002055957,0.00001354884],"about_ca_topic_score_codex":0.00043835974,"about_ca_topic_score_gemma":0.00060457166,"teacher_disagreement_score":0.0010226162,"about_ca_system_score_codex":0.0005449155,"about_ca_system_score_gemma":0.0005122596,"threshold_uncertainty_score":0.0039536953},"labels":[],"label_agreement":null},{"id":"W4312051182","doi":"10.1109/tcomm.2022.3218651","title":"Throughput of Hybrid UAV Networks With Scale-Free Topology","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; Beijing Municipal Natural Science Foundation; Young Elite Scientists Sponsorship Program by Tianjin; National Natural Science Foundation of China","keywords":"Network topology; Computer science; Computer network; Distributed computing; Throughput; Wireless ad hoc network; Resilience (materials science); Topology (electrical circuits); Network performance; Hierarchical network model; Engineering; Wireless; Telecommunications","score_opus":0.01096488450062982,"score_gpt":0.21302590059510776,"score_spread":0.20206101609447794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051182","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.76207,0.0022137456,0.22264756,0.0006350767,0.00013027951,0.00009019853,0.0005297641,0.0005847427,0.011098757],"genre_scores_gemma":[0.996191,0.00020674651,0.0028841095,0.00001563239,0.0000110473675,0.000019034876,0.00008255176,0.00000973728,0.0005801237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995016,0.00015347941,0.000019628378,0.00009834614,0.00011734021,0.000109603345],"domain_scores_gemma":[0.9978357,0.0013747934,0.000261133,0.00017800051,0.00026939812,0.00008100439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007158073,0.0005116547,0.0005459186,0.0009144904,0.00062989036,0.0009979982,0.0006754359,0.00045854473,0.0011171555],"category_scores_gemma":[0.002643905,0.00023176707,0.00029222635,0.0009756604,0.00063936325,0.0016044222,0.00070249435,0.00028476326,0.00013529006],"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.00033125922,0.000040383813,0.0028172263,0.00013355458,0.00006525357,0.00030293845,0.00013023405,0.96049017,0.008222177,0.011107908,0.0012071395,0.015151719],"study_design_scores_gemma":[0.000005745611,0.000072085175,0.0007951289,0.0000059852964,0.000015663025,0.000070682094,0.00007086169,0.9938028,0.0015138166,0.0033867378,0.00025284436,0.0000076262145],"about_ca_topic_score_codex":0.003128014,"about_ca_topic_score_gemma":0.0022640561,"teacher_disagreement_score":0.003128014,"about_ca_system_score_codex":0.0015270873,"about_ca_system_score_gemma":0.0003828656,"threshold_uncertainty_score":0.011079848},"labels":[],"label_agreement":null},{"id":"W4312237357","doi":"10.1109/tcomm.2022.3217516","title":"Polarization-Enabled MIMO Bidirectional Device-to-Device Communications via RIS","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Computer science; MIMO; Fading; Spectral efficiency; Electronic engineering; Wireless; Communications system; Polarization (electrochemistry); Bit error rate; Channel (broadcasting); Computer network; Telecommunications; Engineering","score_opus":0.03142694127445828,"score_gpt":0.2736240886959142,"score_spread":0.24219714742145593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312237357","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.11899147,0.001322742,0.8418705,0.0003132661,0.00012706615,0.000061775856,0.00017327185,0.00071582047,0.036423977],"genre_scores_gemma":[0.96050227,0.00063660584,0.035776585,0.00010599706,0.000040706458,0.00004176034,0.000056862078,0.000012515576,0.0028265815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996038,0.000121951845,0.00001185472,0.000051731902,0.00013620159,0.000074480515],"domain_scores_gemma":[0.99959594,0.00017115042,0.00007008388,0.00006817171,0.00007338209,0.000021309532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443494,0.0006236224,0.00047118447,0.00029147035,0.0004105522,0.0008030242,0.0005621253,0.00046688592,0.0014207778],"category_scores_gemma":[0.00054407143,0.00018729278,0.00034766,0.00046312288,0.00052787905,0.00069350173,0.0010519916,0.00058260426,0.0005001649],"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.00044149958,0.00017406058,0.0034216628,0.000399422,0.00010950948,0.0011076988,0.00043369315,0.59069526,0.1306667,0.13519603,0.0036214585,0.13373305],"study_design_scores_gemma":[0.00001492267,0.0002524195,0.00043985163,0.00002810541,0.000032701588,0.00045678075,0.00009451795,0.9598499,0.024320632,0.009061405,0.00541156,0.000037240938],"about_ca_topic_score_codex":0.0005774799,"about_ca_topic_score_gemma":0.00095679745,"teacher_disagreement_score":0.0014207778,"about_ca_system_score_codex":0.00035019947,"about_ca_system_score_gemma":0.0004012182,"threshold_uncertainty_score":0.004752934},"labels":[],"label_agreement":null},{"id":"W4312288984","doi":"10.1109/tcomm.2022.3225163","title":"Deep Reinforcement Learning for Resource Allocation in Multi-Band and Hybrid OMA-NOMA Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":48,"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 à Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Resource allocation; Wireless network; Mathematical optimization; Wireless; Greedy algorithm; Heuristic; Power control; Optimization problem; Spectral efficiency; Noma; Distributed computing; Channel (broadcasting); Power (physics); Algorithm; Mathematics; Artificial intelligence; Computer network; Telecommunications link; Telecommunications","score_opus":0.026820198413611003,"score_gpt":0.2564614589231429,"score_spread":0.22964126050953193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312288984","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.0480805,0.00076202996,0.9472382,0.00041318356,0.00006151276,0.000042867046,0.0000386532,0.000340083,0.0030230032],"genre_scores_gemma":[0.95962554,0.00022204252,0.038284626,0.00011819611,0.00002865457,0.00008878097,0.00004098077,0.000023221208,0.0015680034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995578,0.00017586653,0.000018066321,0.000068881156,0.00007862913,0.00010065166],"domain_scores_gemma":[0.99892825,0.0007423934,0.00012077086,0.000045349152,0.000114456685,0.0000488254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014471923,0.0007468986,0.0010937814,0.0003554271,0.00041145372,0.0008495925,0.0010961823,0.0008901122,0.0011727493],"category_scores_gemma":[0.002507806,0.0004132856,0.0003796492,0.00044259152,0.00083311443,0.0009364055,0.0009664283,0.0012799504,0.0001515454],"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.00003928386,0.00002768164,0.0002486148,0.000023009987,0.00001913949,0.000023998631,0.000014107839,0.983098,0.0003365097,0.0031883202,0.00026706833,0.012714256],"study_design_scores_gemma":[0.0000027790472,0.0000062340114,0.000019881412,0.0000011344363,0.0000017436485,0.0000018488803,0.000001637269,0.99885464,0.00006004577,0.0010096137,0.00003945408,9.685606e-7],"about_ca_topic_score_codex":0.0072281426,"about_ca_topic_score_gemma":0.00823396,"teacher_disagreement_score":0.0072281426,"about_ca_system_score_codex":0.001303261,"about_ca_system_score_gemma":0.0011912113,"threshold_uncertainty_score":0.01437211},"labels":[],"label_agreement":null},{"id":"W4312392926","doi":"10.1109/tcomm.2022.3227304","title":"A POMDP-Based Approach to Joint Antenna Selection and User Scheduling for Multi-User Massive MIMO Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Computer science; MIMO; Scheduling (production processes); Beamforming; Rayleigh fading; Base station; Channel (broadcasting); Channel state information; Mathematical optimization; Markov chain; Wireless; Markov model; Fading; Computer network; Telecommunications; Mathematics; Machine learning","score_opus":0.04856729260952792,"score_gpt":0.2736771149631247,"score_spread":0.22510982235359678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312392926","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.0056216405,0.00019548376,0.99060327,0.00027997565,0.00007895894,0.000077533776,0.00009368712,0.00013402067,0.0029153829],"genre_scores_gemma":[0.7897775,0.0004814809,0.20444103,0.0003134232,0.00014226382,0.00048462892,0.00018047073,0.000071301394,0.004107824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926656,0.00022420158,0.000030366267,0.00013932229,0.00019662849,0.00014287114],"domain_scores_gemma":[0.9985475,0.0009969188,0.00014651807,0.0000512391,0.00014909901,0.00010866224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013205783,0.0012673567,0.0014022953,0.00037968106,0.0005806927,0.0010981059,0.0011450818,0.0011813422,0.0029335679],"category_scores_gemma":[0.0024912958,0.0006583184,0.0009198034,0.0004767455,0.0012021724,0.0007315194,0.0013813266,0.002161353,0.0002923774],"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.000033102464,0.000024046112,0.00014200981,0.00005011559,0.000017622147,0.00005183534,0.000025950454,0.9843143,0.00047859343,0.011076392,0.00044048086,0.0033455496],"study_design_scores_gemma":[0.0000105947765,0.000023172126,0.000027996752,0.000005109885,0.000004438199,0.0000061269816,0.000006865985,0.99506867,0.00013119944,0.004470663,0.00024156344,0.000003618489],"about_ca_topic_score_codex":0.0075579057,"about_ca_topic_score_gemma":0.0065608486,"teacher_disagreement_score":0.0075579057,"about_ca_system_score_codex":0.0015671917,"about_ca_system_score_gemma":0.002791836,"threshold_uncertainty_score":0.015027821},"labels":[],"label_agreement":null},{"id":"W4312497239","doi":"10.1109/tcomm.2022.3223706","title":"Energy-Efficient Design of STAR-RIS Aided MIMO-NOMA Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Beamforming; MIMO; Precoding; Computer science; Efficient energy use; Optimization problem; Mathematical optimization; Convex optimization; Spectral efficiency; Electronic engineering; Algorithm; Telecommunications; Mathematics; Regular polygon; Engineering; Electrical engineering","score_opus":0.030850913700618134,"score_gpt":0.23956988260553802,"score_spread":0.2087189689049199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312497239","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.033000134,0.0002543741,0.9562467,0.00014279672,0.000044523313,0.000049188155,0.00006314234,0.00014096628,0.010058164],"genre_scores_gemma":[0.88165206,0.00043234206,0.1140386,0.00010994939,0.00003910583,0.00019113749,0.00008761483,0.00003201486,0.0034171455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.00015714805,0.000012843303,0.000073518015,0.000111454756,0.00006965859],"domain_scores_gemma":[0.99967515,0.00013030089,0.00006462406,0.000022941818,0.0000819166,0.000025105845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037994864,0.0007903234,0.0005957962,0.00030841216,0.00035374486,0.0008018131,0.000909137,0.0005008135,0.001481362],"category_scores_gemma":[0.0008321433,0.00040375857,0.0003750247,0.00043780805,0.00054983,0.00059160456,0.0007686063,0.00049565354,0.00045533915],"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.00007358378,0.00003399173,0.00039117623,0.000056356854,0.000026111999,0.000110184264,0.000061121784,0.94854987,0.012136869,0.015258704,0.0009341258,0.02236802],"study_design_scores_gemma":[0.0000041280005,0.00004167451,0.00006576823,0.0000029866353,0.0000046298696,0.000021221957,0.000015391435,0.9965233,0.001141647,0.0016814412,0.0004934253,0.000004290898],"about_ca_topic_score_codex":0.0011372003,"about_ca_topic_score_gemma":0.0021885992,"teacher_disagreement_score":0.001481362,"about_ca_system_score_codex":0.0006142986,"about_ca_system_score_gemma":0.00075140985,"threshold_uncertainty_score":0.0049556494},"labels":[],"label_agreement":null},{"id":"W4312849087","doi":"10.1109/tcomm.2022.3222374","title":"Joint Optimization Framework for User Clustering, Downlink Beamforming, and Power Allocation in MIMO NOMA Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Beamforming; MIMO; Mathematical optimization; Cluster analysis; Computer science; Transmitter power output; Optimization problem; Benchmark (surveying); Computational complexity theory; Mathematics; Algorithm; Computer network; Transmitter","score_opus":0.028579321233462116,"score_gpt":0.2618756455393728,"score_spread":0.23329632430591069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312849087","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.0019303657,0.00026175097,0.9955264,0.00017263631,0.000025404042,0.000027704647,0.000034331242,0.00005379616,0.0019677076],"genre_scores_gemma":[0.39339703,0.0016694645,0.5949819,0.0003888225,0.00031493886,0.00067494734,0.0002880536,0.00021991109,0.0080649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987085,0.00068219914,0.000037054724,0.00017123949,0.00026784025,0.00013319051],"domain_scores_gemma":[0.99922,0.0005260878,0.000070148315,0.000045391,0.00010171713,0.000036573947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021297492,0.001873158,0.0016255411,0.00061094714,0.00055158185,0.0017497138,0.0014151611,0.0014037932,0.0030595919],"category_scores_gemma":[0.0025466501,0.00067477673,0.0009491452,0.001208807,0.0010314053,0.0015245888,0.001648326,0.0020872978,0.0006910705],"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.000034335742,0.00006497493,0.00014925595,0.000092951734,0.000031368054,0.0000624364,0.000045406854,0.925869,0.00092998514,0.057362754,0.0014236841,0.013933902],"study_design_scores_gemma":[0.0000056599397,0.000017433726,0.000040720755,0.0000052631212,0.0000044437325,0.0000128289075,0.000010879781,0.9911746,0.00017403883,0.007978572,0.00057153666,0.0000040803734],"about_ca_topic_score_codex":0.0032068978,"about_ca_topic_score_gemma":0.0033711165,"teacher_disagreement_score":0.0032068978,"about_ca_system_score_codex":0.0012218574,"about_ca_system_score_gemma":0.0019340228,"threshold_uncertainty_score":0.011263311},"labels":[],"label_agreement":null},{"id":"W4313167004","doi":"10.1109/tcomm.2022.3226186","title":"Optimizing Caching in a C-RAN With a Hybrid Millimeter-Wave/Microwave Fronthaul Link via Dynamic Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Toronto","funders":"","keywords":"Computer science; Radio access network; Cache; Computer network; Backup; Latency (audio); Cellular network; Cloud computing; Key (lock); Markov decision process; Distributed computing; Markov process; Base station; Telecommunications","score_opus":0.025801369291841035,"score_gpt":0.2385912547649464,"score_spread":0.21278988547310534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313167004","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.1437797,0.00076257024,0.8449136,0.00085070945,0.00007182274,0.00010856417,0.00017108102,0.00045533478,0.008886569],"genre_scores_gemma":[0.89782983,0.00027536307,0.09693321,0.00022021796,0.00003475977,0.00014516398,0.00011987735,0.00007488067,0.004366733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960095,0.000121416284,0.0000115727735,0.00008236917,0.00006734531,0.00011638424],"domain_scores_gemma":[0.99828964,0.0012852693,0.0001270066,0.000034437864,0.00018625085,0.000077385725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097116706,0.0010857546,0.0011315106,0.00043309692,0.00054924877,0.0014135797,0.0010552302,0.001340039,0.0017715784],"category_scores_gemma":[0.002391732,0.0006688352,0.0006201031,0.00070640893,0.0008462556,0.00079380773,0.00076368265,0.0011367898,0.0001819489],"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.000018170691,0.00001916758,0.00015715385,0.000008689133,0.0000067313936,0.00001974802,0.0000037980865,0.9971481,0.00018137474,0.0008865202,0.000106995285,0.0014436239],"study_design_scores_gemma":[0.0000029350772,0.00000620341,0.00001990754,0.0000010463165,0.0000023542143,0.0000022621505,0.0000024635863,0.999579,0.00005453176,0.00030220498,0.000025960639,0.0000010901593],"about_ca_topic_score_codex":0.02719469,"about_ca_topic_score_gemma":0.022615964,"teacher_disagreement_score":0.02719469,"about_ca_system_score_codex":0.0016090279,"about_ca_system_score_gemma":0.0025261191,"threshold_uncertainty_score":0.054072797},"labels":[],"label_agreement":null},{"id":"W4313195381","doi":"10.1109/tcomm.2022.3228611","title":"Future Space Networks: Toward the Next Giant Leap for Humankind","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; St. Francis Xavier University; Carleton University","funders":"National Research Council Canada; Mitacs","keywords":"Standardization; Software deployment; Space (punctuation); Communications satellite; Telecommunications; Satellite; Systems engineering; Computer science; Space technology; Architecture; Space exploration; Engineering; Aerospace engineering; Software engineering","score_opus":0.07624539177131777,"score_gpt":0.2821979077412448,"score_spread":0.20595251596992703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313195381","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.049831524,0.13137166,0.2878558,0.20592983,0.0073524723,0.000101005346,0.0004962697,0.0015750045,0.3154865],"genre_scores_gemma":[0.58451754,0.15136364,0.15579009,0.013541261,0.004530755,0.00015886345,0.0008049518,0.00036092746,0.08893199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961156,0.00012891694,0.0000108627255,0.000045763187,0.0001370322,0.00006590998],"domain_scores_gemma":[0.99920684,0.00022959856,0.00006526949,0.000111389956,0.00020153004,0.00018534593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132481,0.00035226645,0.00017051227,0.00052051106,0.0010905521,0.003173722,0.0007380205,0.0016528945,0.0052016024],"category_scores_gemma":[0.0011729705,0.0001300462,0.00013403744,0.0007868768,0.0014515158,0.007218691,0.0018797894,0.0014192023,0.0011023224],"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.000034949924,0.00001843436,0.00063811423,0.000195247,0.000011161764,0.00007750372,0.0005616744,0.003477128,0.002028454,0.77734685,0.05031554,0.16529503],"study_design_scores_gemma":[0.0000033173853,0.00003381146,0.00030881708,0.00019911668,0.0000065084873,0.00016733585,0.0010890086,0.0046191826,0.000723896,0.23173101,0.7611056,0.000012375958],"about_ca_topic_score_codex":0.0014908505,"about_ca_topic_score_gemma":0.002116515,"teacher_disagreement_score":0.0052016024,"about_ca_system_score_codex":0.0011985805,"about_ca_system_score_gemma":0.0017610573,"threshold_uncertainty_score":0.0174011},"labels":[],"label_agreement":null},{"id":"W4317553693","doi":"10.1109/tcomm.2023.3238368","title":"Analysis of Massive Ultra-Reliable and Low-Latency Communications Over the <i>κ</i>-<i>μ</i> Shadowed Fading Channel","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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":"Western University","funders":"Beijing Institute of Technology Research Fund Program for Young Scholars; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Fading; Channel state information; Channel (broadcasting); Probability density function; Algorithm; Mathematics; MIMO; Computer science; Statistics; Decoding methods; Wireless; Telecommunications","score_opus":0.02711708926833861,"score_gpt":0.2677241242540996,"score_spread":0.24060703498576097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317553693","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.22890876,0.00319155,0.7404971,0.0014460413,0.00015666308,0.00011053467,0.00040217716,0.00044385708,0.024843361],"genre_scores_gemma":[0.9822858,0.0014693381,0.010732763,0.00016648068,0.00010373758,0.00006237467,0.00013444037,0.00008244535,0.004962635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.000116138,0.000015226234,0.00006033428,0.00024151028,0.00017644264],"domain_scores_gemma":[0.99715734,0.00162435,0.00043839612,0.00011297784,0.0005876316,0.00007937234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008172943,0.0011962104,0.00073611346,0.0006104687,0.0005314284,0.001141171,0.0009703282,0.00085741194,0.002715347],"category_scores_gemma":[0.0037694962,0.00034084843,0.00058039505,0.0007103331,0.0013247177,0.0014163763,0.0009889506,0.00071578135,0.0003964907],"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.000059748345,0.000019436075,0.0009490087,0.00010254588,0.00003025506,0.00034610392,0.00012362118,0.9644667,0.0059456276,0.022946682,0.0008098678,0.004200503],"study_design_scores_gemma":[0.0000027959018,0.000015610938,0.0002855242,0.0000072315265,0.000007202743,0.00004913655,0.000027250611,0.99661887,0.00054409413,0.0022825764,0.0001522588,0.000007385219],"about_ca_topic_score_codex":0.008595516,"about_ca_topic_score_gemma":0.005220492,"teacher_disagreement_score":0.008595516,"about_ca_system_score_codex":0.0015409462,"about_ca_system_score_gemma":0.0012469402,"threshold_uncertainty_score":0.017090976},"labels":[],"label_agreement":null},{"id":"W4318821623","doi":"10.1109/tcomm.2023.3241355","title":"RIS-Assisted Energy- and Spectrum-Efficient Symbiotic Transmission in NOMA Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China","keywords":"Noma; Computer science; Telecommunications link; Optimization problem; Convex optimization; Resource allocation; Efficient energy use; Quality of service; Transmission (telecommunications); Spectral efficiency; Distributed computing; Computer network; Mathematical optimization; Channel (broadcasting); Telecommunications; Algorithm; Engineering; Regular polygon; Mathematics","score_opus":0.025162206452299423,"score_gpt":0.24681921717346308,"score_spread":0.22165701072116367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318821623","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.040740527,0.0005170071,0.94957775,0.00018032761,0.00006163916,0.000031154443,0.000032509575,0.0001174173,0.00874168],"genre_scores_gemma":[0.9442306,0.0003835353,0.05200381,0.00007008973,0.000040506875,0.000081067876,0.00002405732,0.000021749673,0.0031445727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00016404754,0.000011845049,0.00006854908,0.00009699734,0.00006405974],"domain_scores_gemma":[0.9997441,0.00012129907,0.000054864475,0.00002333337,0.000037918362,0.00001847507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047374432,0.0006624092,0.00059712277,0.0002537709,0.00040705028,0.0008122219,0.0005744532,0.0006472431,0.0009388376],"category_scores_gemma":[0.0007929985,0.00030159956,0.00043971612,0.0005288273,0.0007808592,0.00068282103,0.00087908003,0.0005564462,0.00029282653],"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.000077218996,0.000055772845,0.00048447575,0.0001184695,0.00003351463,0.0002141863,0.00012332336,0.91459495,0.019188197,0.035193674,0.0011298564,0.028786456],"study_design_scores_gemma":[0.0000041011267,0.000053132306,0.00006846948,0.0000037835362,0.0000053216004,0.000031337484,0.000014164406,0.9953839,0.0010551175,0.0028020972,0.0005716845,0.0000068348886],"about_ca_topic_score_codex":0.0010382581,"about_ca_topic_score_gemma":0.0013388889,"teacher_disagreement_score":0.0010382581,"about_ca_system_score_codex":0.0005087398,"about_ca_system_score_gemma":0.0005242037,"threshold_uncertainty_score":0.0036911964},"labels":[],"label_agreement":null},{"id":"W4320015699","doi":"10.1109/tcomm.2023.3240393","title":"Cognitive NOMA With Blind Transmission-Mode Identification","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Cognitive radio; Noma; Detector; Underlay; Transmission (telecommunications); Throughput; Algorithm; Transmitter power output; Network packet; Real-time computing; Electronic engineering; Telecommunications link; Computer network; Transmitter; Signal-to-noise ratio (imaging); Telecommunications; Channel (broadcasting); Engineering; Wireless","score_opus":0.03852526292210831,"score_gpt":0.30531319393813855,"score_spread":0.26678793101603027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015699","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.043310482,0.00070750643,0.9511843,0.00011210039,0.00016629304,0.000080951984,0.00004607062,0.00040672056,0.0039856336],"genre_scores_gemma":[0.88086855,0.00038859673,0.11508687,0.00023496589,0.00017536999,0.00016321978,0.000043786713,0.000018926397,0.0030197045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.00035685187,0.00005682615,0.00026474858,0.000380624,0.00022790804],"domain_scores_gemma":[0.99870753,0.0005081038,0.00022519205,0.00024140303,0.00025376314,0.000064163025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671731,0.0010165205,0.0008089565,0.00074394455,0.00087946374,0.0011443453,0.0011962047,0.0007540121,0.0006000761],"category_scores_gemma":[0.003005993,0.00034078603,0.00071115076,0.00061851414,0.0009210667,0.0010782337,0.0013798986,0.0008519686,0.00042665235],"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.0013040693,0.0005874023,0.0047525424,0.000719699,0.0004410737,0.0014952071,0.0006015915,0.36208102,0.08473795,0.08681802,0.004230346,0.45223102],"study_design_scores_gemma":[0.00006009764,0.00034059226,0.0006882581,0.00002288069,0.000103455895,0.0008841278,0.000050153063,0.9748395,0.008791185,0.01121501,0.0029427395,0.000062110805],"about_ca_topic_score_codex":0.00233069,"about_ca_topic_score_gemma":0.0032224,"teacher_disagreement_score":0.00233069,"about_ca_system_score_codex":0.0004482423,"about_ca_system_score_gemma":0.0012201953,"threshold_uncertainty_score":0.0056438446},"labels":[],"label_agreement":null},{"id":"W4320015708","doi":"10.1109/tcomm.2023.3240440","title":"Lightweight Flexible Group Authentication Utilizing Historical Collaboration Process Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Process (computing); Computer science; Authentication (law); Group (periodic table); Computer network; Embedded system; Engineering; Computer security; Operating system","score_opus":0.02182675359350712,"score_gpt":0.2588762021408052,"score_spread":0.2370494485472981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015708","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.024112524,0.00023907062,0.9720772,0.00013547896,0.000065995184,0.00016638533,0.00006707782,0.0012577547,0.0018785628],"genre_scores_gemma":[0.90740323,0.00015606257,0.08861946,0.00009581235,0.00007286358,0.00017120581,0.00018413286,0.000049997085,0.0032471486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964778,0.00094340864,0.00033041774,0.0007680699,0.0010903708,0.00038993944],"domain_scores_gemma":[0.99402726,0.0011575787,0.00087933237,0.0030318429,0.0006558702,0.0002480234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167001,0.0009010444,0.0012252219,0.0010913642,0.0014862275,0.0012888653,0.0022239308,0.0012852694,0.0020044053],"category_scores_gemma":[0.0052882796,0.00037618467,0.0007876449,0.0011437453,0.0011725605,0.004967321,0.0043872804,0.0013937432,0.001196849],"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.0026466802,0.00035275912,0.008060819,0.00052136654,0.00022968686,0.0014268921,0.0016426216,0.13726184,0.1101157,0.116923206,0.004865428,0.61595297],"study_design_scores_gemma":[0.00020928211,0.0009567431,0.0025658403,0.000069303394,0.00017702642,0.0025127425,0.00049315643,0.8345503,0.06761489,0.06841275,0.022237757,0.0002002543],"about_ca_topic_score_codex":0.00059859717,"about_ca_topic_score_gemma":0.00049812713,"teacher_disagreement_score":0.0022239308,"about_ca_system_score_codex":0.0006416613,"about_ca_system_score_gemma":0.001338054,"threshold_uncertainty_score":0.011460364},"labels":[],"label_agreement":null},{"id":"W4320713259","doi":"10.1109/tcomm.2023.3244960","title":"Optimal Power Allocation for Multiuser Photon-Counting Underwater Optical Wireless Communications Under Poisson Shot Noise","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"University of Manitoba","funders":"Science and Technology Innovation Plan Of Shanghai Science and Technology Commission; National Natural Science Foundation of China","keywords":"Shot noise; Convexity; Poisson distribution; Photon counting; Mathematical optimization; Wireless; Computer science; Optical wireless; Power (physics); Signal-to-noise ratio (imaging); Photon; Mathematics; Telecommunications; Physics; Statistics; Optics","score_opus":0.05447320542319371,"score_gpt":0.2984343982703953,"score_spread":0.24396119284720158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320713259","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.016836692,0.00020818383,0.98028606,0.00013622674,0.000019477498,0.000036117424,0.00002371206,0.00010216747,0.0023512314],"genre_scores_gemma":[0.8069664,0.0006291166,0.18798597,0.00018604874,0.00005901223,0.00023281723,0.0000733896,0.00008972412,0.0037774637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989801,0.0003534132,0.000039183044,0.00016308964,0.00028396936,0.00018015779],"domain_scores_gemma":[0.99863225,0.00093604217,0.000140495,0.0000627277,0.00017522059,0.000053203312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013745158,0.0011467164,0.0012578748,0.00049686857,0.0005065367,0.0012091594,0.0011613773,0.00088426843,0.0015032993],"category_scores_gemma":[0.0032184676,0.00058801216,0.0005230543,0.0010351031,0.001231278,0.0011882528,0.0015846164,0.0010312393,0.00037471988],"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.00012862826,0.000057962214,0.00035642035,0.00011633703,0.000036444086,0.00013009897,0.00010165615,0.9312824,0.0067940736,0.026486073,0.0009251486,0.03358469],"study_design_scores_gemma":[0.0000069303683,0.00002059806,0.000038330458,0.000003893959,0.0000050654985,0.000018397226,0.000013251946,0.99451256,0.0010153786,0.004178455,0.00018163974,0.0000054307047],"about_ca_topic_score_codex":0.002281954,"about_ca_topic_score_gemma":0.0018673597,"teacher_disagreement_score":0.002281954,"about_ca_system_score_codex":0.0012438098,"about_ca_system_score_gemma":0.001474244,"threshold_uncertainty_score":0.00902456},"labels":[],"label_agreement":null},{"id":"W4320713284","doi":"10.1109/tcomm.2023.3244954","title":"UAV-Aided Secure Short-Packet Data Collection and Transmission","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Base station; Network packet; Data transmission; Real-time computing; Transmitter power output; Eavesdropping; Transmission (telecommunications); Wireless; Computer network; Data collection; Scheduling (production processes); Channel (broadcasting); Mathematical optimization; Transmitter; Telecommunications","score_opus":0.062392837115184674,"score_gpt":0.28916976607328115,"score_spread":0.22677692895809648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320713284","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.051715575,0.0003047678,0.94580305,0.00012520856,0.000054563694,0.000055190925,0.000080981714,0.00026331472,0.001597377],"genre_scores_gemma":[0.9222955,0.0003113985,0.07528133,0.00006304641,0.00003469605,0.00007775858,0.00015220311,0.000020188583,0.0017637602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952793,0.00009878885,0.00003107486,0.00008577637,0.00017281312,0.00008368484],"domain_scores_gemma":[0.9993789,0.00020774762,0.00013636406,0.00013629514,0.000109288994,0.000031332733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043869767,0.00066824775,0.00052783045,0.0002653803,0.00039399188,0.0004009993,0.00066533254,0.00037451042,0.00073581433],"category_scores_gemma":[0.0009312437,0.00019024799,0.00037290514,0.00046468613,0.00039682063,0.0008222022,0.0010518563,0.0005830242,0.00024317256],"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.000706782,0.0001566967,0.0023169704,0.0002814574,0.00009446158,0.00066034374,0.00028288228,0.71360916,0.10102263,0.0222459,0.0034549995,0.1551677],"study_design_scores_gemma":[0.0000184283,0.00019149385,0.00037733492,0.0000062500453,0.000013829485,0.00017574373,0.000037629816,0.9807591,0.015538364,0.001807552,0.0010618625,0.000012410629],"about_ca_topic_score_codex":0.0013671415,"about_ca_topic_score_gemma":0.0017628748,"teacher_disagreement_score":0.0013671415,"about_ca_system_score_codex":0.00034438635,"about_ca_system_score_gemma":0.00078234065,"threshold_uncertainty_score":0.002718389},"labels":[],"label_agreement":null},{"id":"W4321021465","doi":"10.1109/tcomm.2023.3245659","title":"Physical-Layer Authentication for Ambient Backscatter-Aided NOMA Symbiotic Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":157,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Université Laval","funders":"CHIST-ERA; Basic and Applied Basic Research Foundation of Guangdong Province; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Multiplexing; Noma; Physical layer; Computer network; Wireless; Backscatter (email); Telecommunications; Telecommunications link; Computer security","score_opus":0.044549290945610755,"score_gpt":0.27801917021509515,"score_spread":0.2334698792694844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321021465","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.12906739,0.0009564135,0.86583406,0.00015530172,0.000076203774,0.00006165316,0.00004385147,0.00035408366,0.0034510791],"genre_scores_gemma":[0.97682446,0.00019117193,0.022260057,0.000047815003,0.000022092096,0.000032534375,0.000018324636,0.000004046851,0.0005995218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992107,0.0003055978,0.000046912694,0.000112985275,0.00021782429,0.00010586649],"domain_scores_gemma":[0.9983359,0.00071197824,0.0003225625,0.00025436928,0.0003295628,0.00004570975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008364815,0.0006775554,0.00043743424,0.00038732175,0.0006200815,0.0008133666,0.0004974337,0.0006570146,0.00093163113],"category_scores_gemma":[0.0026901695,0.00017313556,0.0002986652,0.0003958783,0.00062415673,0.0010643187,0.0010539145,0.0004723404,0.00035561723],"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.0010265841,0.00020770055,0.0111525785,0.0005759861,0.00022469535,0.0014324712,0.0008823579,0.45301542,0.17600517,0.087886766,0.0028376593,0.26475272],"study_design_scores_gemma":[0.00001591703,0.000258855,0.0010564785,0.00002204634,0.000052528285,0.0005000615,0.00007715174,0.9774665,0.013626978,0.004874094,0.0020190433,0.0000303427],"about_ca_topic_score_codex":0.00051613525,"about_ca_topic_score_gemma":0.0007488835,"teacher_disagreement_score":0.00093163113,"about_ca_system_score_codex":0.0004361614,"about_ca_system_score_gemma":0.00044285064,"threshold_uncertainty_score":0.0044237375},"labels":[],"label_agreement":null},{"id":"W4323338322","doi":"10.1109/tcomm.2023.3253721","title":"Dynamic Transmission and Computation Resource Optimization for Dense LEO Satellite Assisted Mobile-Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":65,"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, Okanagan Campus; University of British Columbia","funders":"ZTE Corporation","keywords":"Precoding; Computer science; Mobile edge computing; Mathematical optimization; Lyapunov optimization; MIMO; Optimization problem; Resource allocation; Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Computer network; Lyapunov equation; Lyapunov exponent; Telecommunications","score_opus":0.04445506079455381,"score_gpt":0.3064221589831568,"score_spread":0.261967098188603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323338322","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.06060437,0.00052040076,0.93033785,0.00024371882,0.000056530065,0.00004240432,0.00006015964,0.00015803902,0.00797658],"genre_scores_gemma":[0.9417586,0.0003161195,0.054386698,0.0000708128,0.000025285035,0.000077230514,0.00006881225,0.000028388713,0.003268149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998272,0.00003535833,0.0000053352,0.00003824814,0.00004753521,0.00004628224],"domain_scores_gemma":[0.9998605,0.000062112464,0.00002116142,0.000010419708,0.000031504696,0.000014287052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021757741,0.0005293576,0.00045320106,0.00018468963,0.0004088298,0.0006041716,0.00062755786,0.00031082556,0.0013915098],"category_scores_gemma":[0.0004856518,0.00019619125,0.00023376777,0.00050663546,0.0003504441,0.00070294476,0.00059443404,0.0004929984,0.0001411247],"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.000046457844,0.0000343249,0.0004299335,0.000053592936,0.0000139797385,0.00009869891,0.000040496452,0.9606363,0.0052210432,0.010841754,0.0011164871,0.0214669],"study_design_scores_gemma":[0.0000024136227,0.000011885537,0.000050671326,0.0000012415193,0.0000022264383,0.000008701758,0.000008175645,0.9985684,0.0002903012,0.0008255318,0.00022863797,0.0000017120649],"about_ca_topic_score_codex":0.005312941,"about_ca_topic_score_gemma":0.009138763,"teacher_disagreement_score":0.005312941,"about_ca_system_score_codex":0.0007913211,"about_ca_system_score_gemma":0.0010035712,"threshold_uncertainty_score":0.010564029},"labels":[],"label_agreement":null},{"id":"W4323338515","doi":"10.1109/tcomm.2023.3253718","title":"Decentralized Aggregation for Energy-Efficient Federated Learning via D2D Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":55,"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, Okanagan Campus; University of British Columbia; Carleton University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Efficient energy use; Energy (signal processing); Computer network; Distributed computing; Electronic engineering; Electrical engineering; Engineering","score_opus":0.06539950561102888,"score_gpt":0.31741512092832697,"score_spread":0.2520156153172981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323338515","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.02399695,0.00019294069,0.97301245,0.00024182857,0.000041049174,0.00004431343,0.0000761441,0.0006234655,0.0017708906],"genre_scores_gemma":[0.90731245,0.00011038772,0.09056922,0.00015047261,0.000035041874,0.00008173738,0.00014363072,0.000025004209,0.0015720292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916863,0.0002345885,0.000039366343,0.00021249973,0.0002097098,0.00013517446],"domain_scores_gemma":[0.9987388,0.00048930146,0.00013487981,0.00035704148,0.00020710041,0.00007292302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012788634,0.0006056282,0.0009938575,0.00046463226,0.00086758414,0.00095774734,0.0016028892,0.0008117166,0.001092358],"category_scores_gemma":[0.0026580833,0.00026537853,0.00042679845,0.00091145793,0.00059445953,0.0014412386,0.0019978667,0.00095232413,0.00023856331],"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.0003005146,0.00015910836,0.0015457215,0.00008703656,0.000054877353,0.000166491,0.00014996249,0.8278416,0.0047413516,0.018533355,0.0039782366,0.14244173],"study_design_scores_gemma":[0.000009988254,0.000023994644,0.00010398543,0.000002352957,0.0000039992638,0.000023361774,0.000018618082,0.9921491,0.00088202575,0.006214989,0.00056330906,0.000004303443],"about_ca_topic_score_codex":0.0033362443,"about_ca_topic_score_gemma":0.0042566257,"teacher_disagreement_score":0.0033362443,"about_ca_system_score_codex":0.0008809126,"about_ca_system_score_gemma":0.001254613,"threshold_uncertainty_score":0.006763339},"labels":[],"label_agreement":null},{"id":"W4327522659","doi":"10.1109/tcomm.2023.3257371","title":"On the Performance of Training-Based IRS-Assisted Communications Under Correlated Rayleigh Fading","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Estimator; Rayleigh fading; Transmitter; Minimum mean square error; Channel state information; Channel (broadcasting); Fading; Computer science; Mean squared error; Communications system; Algorithm; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics; Wireless","score_opus":0.08409364230072279,"score_gpt":0.28237486345245516,"score_spread":0.19828122115173236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327522659","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.56365556,0.0017516522,0.42015997,0.0004458582,0.00009467554,0.00006695362,0.00020763736,0.00063109596,0.012986535],"genre_scores_gemma":[0.9914682,0.00030835942,0.0075104125,0.000041535375,0.00001918662,0.00002064735,0.00005857197,0.000011112723,0.00056194945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986051,0.0005500557,0.00004810102,0.00015522137,0.00034223672,0.00029929404],"domain_scores_gemma":[0.990715,0.0070732404,0.00072828867,0.0004526554,0.0008986233,0.0001321532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629657,0.0012365804,0.0008033625,0.00054847583,0.0005053231,0.00071422575,0.00076680706,0.00096907764,0.0011283923],"category_scores_gemma":[0.010093231,0.00025436803,0.00039758475,0.0007043838,0.0014144772,0.0012543662,0.001702434,0.00074759615,0.00022545308],"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.00031219702,0.000036874084,0.0016996803,0.00009227787,0.000043522145,0.00012113525,0.0000800581,0.9723723,0.004347823,0.0035521386,0.00027938973,0.01706267],"study_design_scores_gemma":[0.0000095129935,0.00013855356,0.00079923385,0.000013403642,0.000022915505,0.00010251659,0.00003235999,0.9948435,0.0029570116,0.0009877766,0.00007716103,0.00001596774],"about_ca_topic_score_codex":0.004513425,"about_ca_topic_score_gemma":0.0028417206,"teacher_disagreement_score":0.004513425,"about_ca_system_score_codex":0.0006970675,"about_ca_system_score_gemma":0.0011976645,"threshold_uncertainty_score":0.008974254},"labels":[],"label_agreement":null},{"id":"W4327796594","doi":"10.1109/tcomm.2023.3258487","title":"Deep Reinforcement Learning for Latency-Sensitive Communication With Adaptive Redundant Retransmissions","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Channel (broadcasting); Network packet; Estimator; Erasure; Reinforcement learning; Acknowledgement; Communication source; Binary erasure channel; Transmission (telecommunications); Upper and lower bounds; Computer network; Markov process; Latency (audio); Real-time computing; Artificial intelligence; Channel capacity; Telecommunications; Mathematics","score_opus":0.061484670496015435,"score_gpt":0.29618449034481087,"score_spread":0.23469981984879543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327796594","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.09647721,0.0009962091,0.8981066,0.00056038186,0.00009615942,0.000053854863,0.00006481168,0.00075364625,0.0028912732],"genre_scores_gemma":[0.96791226,0.00018256465,0.029056374,0.00011341233,0.00003789408,0.00006534946,0.000049346098,0.000041501815,0.0025413856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00019829089,0.000029298102,0.00010564365,0.000107621316,0.00014024302],"domain_scores_gemma":[0.9970372,0.0021811782,0.00027683878,0.00014465839,0.00024357934,0.0001166762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018127329,0.00090126775,0.0010869255,0.0003633806,0.0003351619,0.00064565113,0.0016064462,0.0010012477,0.0016229484],"category_scores_gemma":[0.005384897,0.0004470667,0.00032398396,0.000393057,0.0009399595,0.0013225223,0.000996913,0.0017551007,0.00020565571],"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.00008991707,0.0000657182,0.00037187047,0.000036917976,0.00002578003,0.000038343693,0.000041115363,0.9698158,0.0007243015,0.0057933456,0.00047577606,0.02252107],"study_design_scores_gemma":[0.000005260135,0.000016590286,0.000025120778,0.0000016824897,0.0000023212647,0.0000028715692,0.000002239725,0.9975243,0.00014814753,0.002218532,0.000051416304,0.0000015595845],"about_ca_topic_score_codex":0.0052185436,"about_ca_topic_score_gemma":0.00438626,"teacher_disagreement_score":0.0052185436,"about_ca_system_score_codex":0.0013195756,"about_ca_system_score_gemma":0.0013906348,"threshold_uncertainty_score":0.010376334},"labels":[],"label_agreement":null},{"id":"W4360597077","doi":"10.1109/tcomm.2023.3260249","title":"Binary Modeling and Capacity-Approaching Coding for the IM/DD Channel","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":1,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Channel capacity; Decoding methods; Algorithm; Coding (social sciences); Computer science; Channel (broadcasting); Binary code; Wireless; Binary erasure channel; Electronic engineering; Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Engineering; Statistics; Arithmetic","score_opus":0.10276714110586883,"score_gpt":0.278147380541027,"score_spread":0.17538023943515818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360597077","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.019399982,0.00036403004,0.97094554,0.00036193884,0.000053898984,0.000028075452,0.000107873195,0.00007787269,0.008660818],"genre_scores_gemma":[0.88562155,0.0010010748,0.10696891,0.00023965679,0.000119476776,0.00013265824,0.00014566323,0.000057313107,0.0057137148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999388,0.00025634345,0.000017381535,0.000059025035,0.00019486986,0.00008436823],"domain_scores_gemma":[0.9987103,0.00081615563,0.00013320701,0.000138212,0.00017132278,0.000030840205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051093,0.0006867674,0.00040431012,0.00056982774,0.00043823395,0.001094127,0.00077811826,0.0007295958,0.0017897751],"category_scores_gemma":[0.0030726444,0.000221132,0.00035555387,0.000621793,0.0015858548,0.0014768022,0.0009687238,0.00147863,0.00030115075],"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.000060719085,0.00002613107,0.0001897514,0.000072876595,0.000007263087,0.00006522854,0.00011219157,0.38039407,0.004057033,0.60215044,0.0010491492,0.011815183],"study_design_scores_gemma":[0.0000030313338,0.000014176549,0.000040635343,0.000008939408,0.0000028537265,0.000028995742,0.000013144679,0.94130975,0.0012197347,0.056614093,0.0007353343,0.000009280119],"about_ca_topic_score_codex":0.002812625,"about_ca_topic_score_gemma":0.0013484283,"teacher_disagreement_score":0.002812625,"about_ca_system_score_codex":0.0012748739,"about_ca_system_score_gemma":0.0008652598,"threshold_uncertainty_score":0.009249866},"labels":[],"label_agreement":null},{"id":"W4360993814","doi":"10.1109/tcomm.2023.3262305","title":"Spectrum Sharing Between High Altitude Platform Network and Terrestrial Network: Modeling and Performance Analysis","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China; National Key Research and Development Program of China; China Association for Science and Technology","keywords":"Stochastic geometry; Poisson point process; Computer science; Interference (communication); Network performance; Base station; Cellular network; Coverage probability; Network topology; Transmission (telecommunications); Poisson distribution; Topology (electrical circuits); Distributed computing; Computer network; Telecommunications; Engineering; Mathematics; Electrical engineering","score_opus":0.07377783082778891,"score_gpt":0.27478291019527135,"score_spread":0.20100507936748244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360993814","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.3330519,0.0017654352,0.6422827,0.0009908465,0.000096773525,0.00013806585,0.00031501186,0.0003831556,0.020976111],"genre_scores_gemma":[0.99087536,0.0004713127,0.0063260347,0.00004133143,0.000028052365,0.00005652792,0.000077362194,0.000018020653,0.0021060875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00021279241,0.000020058907,0.00013341797,0.0002219947,0.000260047],"domain_scores_gemma":[0.9986959,0.00063967897,0.00023557128,0.000062647996,0.00030262495,0.000063525775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011005601,0.0010270464,0.0007152454,0.0008848727,0.0007824104,0.0011318398,0.0014885496,0.0013371031,0.0015360841],"category_scores_gemma":[0.0022449242,0.0003911667,0.001027566,0.0011282929,0.0010681943,0.0016112959,0.001128395,0.0008825159,0.00025700888],"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.000022884778,0.000020132478,0.0014928209,0.000022659142,0.000015458632,0.00011031126,0.000057464553,0.9869943,0.0009206867,0.007324614,0.00030958335,0.0027090053],"study_design_scores_gemma":[0.0000013054633,0.0000103325965,0.00015340908,0.0000014728704,0.0000044463222,0.000024519297,0.000013100512,0.9990007,0.000100241225,0.00062832696,0.000059270496,0.0000028115865],"about_ca_topic_score_codex":0.023379097,"about_ca_topic_score_gemma":0.009634749,"teacher_disagreement_score":0.023379097,"about_ca_system_score_codex":0.0025300232,"about_ca_system_score_gemma":0.0012412108,"threshold_uncertainty_score":0.04648602},"labels":[],"label_agreement":null},{"id":"W4361802077","doi":"10.1109/tcomm.2023.3262833","title":"Achieving Cooperative Mobile-Edge Computing Using Helper Scheduling","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mobile edge computing; Computer network; Server; Fair-share scheduling; Energy consumption; Engineering; Quality of service","score_opus":0.07867904597553951,"score_gpt":0.33519266204172016,"score_spread":0.2565136160661806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361802077","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.19878298,0.00040534206,0.7940608,0.00014333783,0.00007442733,0.00009302688,0.000048833634,0.0002735738,0.0061176843],"genre_scores_gemma":[0.9722663,0.00011027331,0.026585493,0.000043465847,0.000024034447,0.00003147576,0.000029247061,0.000014337343,0.0008953122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956435,0.00008715976,0.000015133692,0.00007751751,0.000093647985,0.00016218897],"domain_scores_gemma":[0.9989967,0.0004235687,0.00008926332,0.00019323453,0.00016164886,0.00013564018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005848327,0.00090344547,0.0006501076,0.00035004993,0.0008071413,0.0005452026,0.0008717136,0.00032996142,0.00073896954],"category_scores_gemma":[0.0014885807,0.00018452486,0.00031679915,0.00056072755,0.0006909661,0.00083554356,0.001362982,0.00040648534,0.00018807391],"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.0008473487,0.00034642138,0.0049725636,0.0002622103,0.00009917976,0.0011560305,0.001014386,0.72409123,0.066767536,0.04947629,0.002993459,0.14797324],"study_design_scores_gemma":[0.000023161867,0.00016754943,0.00037255706,0.000007043607,0.000020933066,0.0001554035,0.00018086306,0.97775674,0.007842742,0.012086332,0.0013710081,0.000015709571],"about_ca_topic_score_codex":0.0021548038,"about_ca_topic_score_gemma":0.0035235658,"teacher_disagreement_score":0.0021548038,"about_ca_system_score_codex":0.00046366575,"about_ca_system_score_gemma":0.0008515969,"threshold_uncertainty_score":0.0042845607},"labels":[],"label_agreement":null},{"id":"W4361985268","doi":"10.1109/tcomm.2023.3263566","title":"Relay-Assisted Federated Edge Learning: Performance Analysis and System Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":61,"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":"Natural Science Foundation of Guangdong Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Relay; Computer science; Bandwidth (computing); Notation; Computer network; Multiplexing; Wireless; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Mathematics; Artificial intelligence; Telecommunications; Arithmetic","score_opus":0.04689439866739662,"score_gpt":0.2800039392541482,"score_spread":0.23310954058675157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361985268","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.056942753,0.00090728427,0.93551224,0.00044183404,0.00004413259,0.000085989,0.000105376625,0.00031525904,0.0056451885],"genre_scores_gemma":[0.9658769,0.0004419772,0.031109484,0.00008367053,0.00003858074,0.00007969276,0.00006211097,0.00002432134,0.0022833091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875975,0.00048501103,0.000038093134,0.0002264264,0.00020301456,0.00028774387],"domain_scores_gemma":[0.99647695,0.0022681816,0.0004048958,0.00020127329,0.0005229609,0.00012576576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019662974,0.0014641234,0.0016000537,0.0005751786,0.00052999705,0.001592255,0.0016589914,0.0017837621,0.0022214265],"category_scores_gemma":[0.005938921,0.00033845936,0.00046124868,0.00095076615,0.0011665545,0.0016798754,0.0015634946,0.0012634293,0.00036306205],"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.00012552577,0.000056249373,0.00034350905,0.00007196737,0.000027045813,0.000074000265,0.00003666204,0.9770106,0.0008280776,0.00794366,0.0005833609,0.012899281],"study_design_scores_gemma":[0.000005690635,0.000028782833,0.000056407876,0.0000041125454,0.0000065055933,0.000018668963,0.000012980778,0.99749506,0.00031338172,0.0019680362,0.00008650399,0.000003892767],"about_ca_topic_score_codex":0.0037724392,"about_ca_topic_score_gemma":0.0024732207,"teacher_disagreement_score":0.0037724392,"about_ca_system_score_codex":0.0016389966,"about_ca_system_score_gemma":0.0010859118,"threshold_uncertainty_score":0.011891782},"labels":[],"label_agreement":null},{"id":"W4362683604","doi":"10.1109/tcomm.2023.3265123","title":"Energy-Efficient Optimization of Multi-User NOMA-Assisted Cooperative THz-SIMO MEC Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Carleton University; McMaster University","funders":"King Fahd University of Petroleum and Minerals","keywords":"Computer science; Mobile edge computing; Beamforming; Noma; Spectral efficiency; Telecommunications link; Computer network; Base station; Efficient energy use; Optimization problem; Transmission (telecommunications); Electronic engineering; Cellular network; Distributed computing; Engineering; Telecommunications; Server; Electrical engineering","score_opus":0.04163928372749435,"score_gpt":0.27322972817536983,"score_spread":0.2315904444478755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362683604","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.104638726,0.001194701,0.8677643,0.0005018863,0.000091391346,0.000087293025,0.00014720116,0.00016677579,0.025407765],"genre_scores_gemma":[0.9714722,0.00041853337,0.024016779,0.00008446898,0.000022621278,0.00008524213,0.00004724374,0.000017098087,0.0038358923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995522,0.00015099507,0.000014333338,0.00007331761,0.00012199324,0.000087188455],"domain_scores_gemma":[0.999647,0.00018439596,0.00006164898,0.00002127204,0.0000652719,0.000020422562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004887037,0.0010155443,0.00073370046,0.0002764224,0.00040582073,0.0010564211,0.000684379,0.0008118663,0.001596834],"category_scores_gemma":[0.0009503229,0.00038120922,0.0004297448,0.00071453105,0.00069820706,0.00054901035,0.00090136303,0.00046571158,0.0002918296],"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.000087756256,0.000021338747,0.0003887513,0.00004942583,0.000029940338,0.00012513867,0.000042313743,0.97973263,0.0036394864,0.007520611,0.0005219101,0.007840618],"study_design_scores_gemma":[0.0000060293905,0.00003066574,0.00008790956,0.000003199084,0.000005596098,0.00001887601,0.000017280367,0.9979499,0.0005440121,0.0010690846,0.00026327177,0.0000042348533],"about_ca_topic_score_codex":0.0023432036,"about_ca_topic_score_gemma":0.002955519,"teacher_disagreement_score":0.0023432036,"about_ca_system_score_codex":0.0006930973,"about_ca_system_score_gemma":0.00062343676,"threshold_uncertainty_score":0.005341947},"labels":[],"label_agreement":null},{"id":"W4366201171","doi":"10.1109/tcomm.2023.3263694","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"National and Kapodistrian University of Athens; Chinese University of Hong Kong; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366201171","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.0051209494,0.038052607,0.040751226,0.016504223,0.04454707,0.0004555303,0.008012808,0.0019290406,0.8446265],"genre_scores_gemma":[0.026282508,0.040096913,0.007110583,0.0022906468,0.007382347,0.00017972958,0.010487595,0.00040636363,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.000099413184,0.00004464549,0.000087667264,0.00036725312,0.00007512893],"domain_scores_gemma":[0.99737906,0.00059985067,0.00011260353,0.0003260734,0.0013835704,0.00019887867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038276,0.0010753564,0.00089291163,0.0018301366,0.0006711521,0.0026463869,0.00068668986,0.0016401722,0.2848078],"category_scores_gemma":[0.0035322136,0.00037220222,0.00035314792,0.0021499689,0.0004312476,0.002220729,0.0011248555,0.0019721582,0.15456499],"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.000136478,0.000077938785,0.00058868463,0.00037973013,0.000028107697,0.00008782286,0.000044421522,0.0005760108,0.0014611691,0.014737316,0.744742,0.23714034],"study_design_scores_gemma":[0.00001881595,0.0000519161,0.00081286725,0.00021110733,0.000025922613,0.00018738367,0.00004418644,0.0013369377,0.0008055887,0.0042113387,0.9922799,0.000013947228],"about_ca_topic_score_codex":0.0019838146,"about_ca_topic_score_gemma":0.0032619128,"teacher_disagreement_score":0.7151922,"about_ca_system_score_codex":0.0011598372,"about_ca_system_score_gemma":0.0016104179,"threshold_uncertainty_score":0.952777},"labels":[],"label_agreement":null},{"id":"W4366957259","doi":"10.1109/tcomm.2023.3269839","title":"Robust Task Offloading and Resource Allocation in Mobile Edge Computing With Uncertain Distribution of Computation Burden","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","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":"University of Windsor; University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Mobile edge computing; Computer science; Computation offloading; Computation; Task (project management); Edge computing; Resource allocation; Distributed computing; Enhanced Data Rates for GSM Evolution; Resource management (computing); Mathematical optimization; Computer network; Algorithm; Engineering; Mathematics; Telecommunications","score_opus":0.041510134733567516,"score_gpt":0.2769400113834664,"score_spread":0.2354298766498989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366957259","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.033022813,0.0006299975,0.9632329,0.00032422983,0.000054423115,0.00004663258,0.000059251033,0.00015841224,0.0024713846],"genre_scores_gemma":[0.94550186,0.00042718055,0.051901452,0.00012843196,0.00008192207,0.00008159911,0.0000639451,0.0000623159,0.001751344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905616,0.00021262236,0.000043165757,0.00025894862,0.0001780755,0.0002510836],"domain_scores_gemma":[0.9987979,0.0007745873,0.00013956193,0.000094903604,0.0001235816,0.00006943428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097393617,0.0011568161,0.0014139513,0.00035885084,0.00066467945,0.0013557335,0.0012627363,0.0009138763,0.0014007484],"category_scores_gemma":[0.0026738453,0.000563965,0.0005974282,0.00078279024,0.0008918462,0.0014379047,0.0013899469,0.0010380183,0.00019758155],"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.0001321908,0.00003899713,0.00041813738,0.00008664334,0.000025878655,0.00016506054,0.000049510367,0.9692645,0.003066427,0.009368389,0.00085780676,0.01652642],"study_design_scores_gemma":[0.0000036115077,0.000013500246,0.00007831819,0.0000028868346,0.0000037664388,0.000018481795,0.000010207697,0.9968182,0.00034383696,0.0025768976,0.00012634412,0.0000038322733],"about_ca_topic_score_codex":0.0050656595,"about_ca_topic_score_gemma":0.0038508596,"teacher_disagreement_score":0.0050656595,"about_ca_system_score_codex":0.0011767884,"about_ca_system_score_gemma":0.001169611,"threshold_uncertainty_score":0.0100723505},"labels":[],"label_agreement":null},{"id":"W4367277145","doi":"10.1109/tcomm.2023.3270907","title":"Energy Consumption Optimization in RIS-Assisted Cooperative RSMA Cellular Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":37,"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":"Precoding; Telecommunications link; Computer science; Optimization problem; Mathematical optimization; Base station; Beamforming; Transmitter power output; Karush–Kuhn–Tucker conditions; Convex optimization; Energy consumption; Quality of service; MIMO; Algorithm; Mathematics; Computer network; Regular polygon; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.03623933895583812,"score_gpt":0.2610534787965382,"score_spread":0.22481413984070006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367277145","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.07379019,0.00065952475,0.91905016,0.000189162,0.000029811074,0.000025476837,0.000041442803,0.00016890606,0.006045365],"genre_scores_gemma":[0.96829796,0.00026926957,0.028715776,0.000043842,0.0000148916715,0.000046476005,0.000036763373,0.000021879345,0.0025532255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970216,0.00010940643,0.000008450594,0.0000558249,0.000075766635,0.000048340215],"domain_scores_gemma":[0.99983275,0.000089912915,0.00002414404,0.000013284054,0.000030658266,0.000009217598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283757,0.0006592693,0.00052244886,0.00022398883,0.0002399711,0.0006526809,0.0006842291,0.0005042509,0.0005834205],"category_scores_gemma":[0.0005402803,0.00029275284,0.00029839028,0.00045590874,0.0004961175,0.00053123286,0.00055465323,0.000395614,0.00011916087],"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.000033008262,0.000013568143,0.0002002502,0.00002316588,0.000014655012,0.000048977206,0.000021309643,0.9817191,0.0019054081,0.0047724214,0.00024144353,0.011006675],"study_design_scores_gemma":[0.0000017552915,0.000013651352,0.000040802817,8.809736e-7,0.0000027031317,0.000006558785,0.000005524726,0.99863976,0.0002922863,0.0008328837,0.00016158818,0.0000015621832],"about_ca_topic_score_codex":0.003451296,"about_ca_topic_score_gemma":0.0034716425,"teacher_disagreement_score":0.003451296,"about_ca_system_score_codex":0.00065229443,"about_ca_system_score_gemma":0.00057973986,"threshold_uncertainty_score":0.006862402},"labels":[],"label_agreement":null},{"id":"W4376481190","doi":"10.1109/tcomm.2023.3275590","title":"Doppler Shift and Channel Estimation for Intelligent Transparent Surface Assisted Communication Systems on High-Speed Railways","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Estimator; Cramér–Rao bound; Channel (broadcasting); Computer science; Benchmark (surveying); Doppler effect; Algorithm; Wireless; Estimation theory; Mean squared error; Electronic engineering; Real-time computing; Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.08266190891484038,"score_gpt":0.3013899624863311,"score_spread":0.21872805357149072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376481190","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.073591016,0.00042063484,0.92378676,0.00019303778,0.000043643493,0.000018815459,0.000033569453,0.0001563457,0.0017561906],"genre_scores_gemma":[0.9333151,0.0005355655,0.064112194,0.000055593187,0.000047657333,0.000032740758,0.00008006503,0.000018740302,0.0018023568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996511,0.000112551556,0.000011005123,0.000054974375,0.00012184263,0.00004865896],"domain_scores_gemma":[0.9994999,0.00027139127,0.00008177557,0.000039815477,0.00009041481,0.000016723017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004240167,0.00054441014,0.00037095835,0.00025162208,0.00034260374,0.0005405523,0.0003168354,0.00058563706,0.0008448968],"category_scores_gemma":[0.0021986836,0.0001890217,0.00031377852,0.00042564896,0.0005869248,0.0008833674,0.0006634472,0.0006740305,0.00020069737],"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.00015902364,0.000038145652,0.0016256601,0.00011719875,0.000033201406,0.00017235285,0.00011552611,0.89681697,0.015954886,0.011675678,0.0008573505,0.07243406],"study_design_scores_gemma":[0.000005070667,0.000028630437,0.00028810513,0.0000053542108,0.000005868215,0.000028225593,0.000019239154,0.9964999,0.0018861206,0.0009902567,0.00023573036,0.00000750184],"about_ca_topic_score_codex":0.0042170715,"about_ca_topic_score_gemma":0.0039149555,"teacher_disagreement_score":0.0042170715,"about_ca_system_score_codex":0.00041239397,"about_ca_system_score_gemma":0.00085852336,"threshold_uncertainty_score":0.008385003},"labels":[],"label_agreement":null},{"id":"W4376870731","doi":"10.1109/tcomm.2023.3264893","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376870731","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.0051209494,0.038052607,0.040751226,0.016504223,0.04454707,0.0004555303,0.008012808,0.0019290406,0.8446265],"genre_scores_gemma":[0.026282508,0.040096913,0.007110583,0.0022906468,0.007382347,0.00017972958,0.010487595,0.00040636363,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.000099413184,0.00004464549,0.000087667264,0.00036725312,0.00007512893],"domain_scores_gemma":[0.99737906,0.00059985067,0.00011260353,0.0003260734,0.0013835704,0.00019887867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038276,0.0010753564,0.00089291163,0.0018301366,0.0006711521,0.0026463869,0.00068668986,0.0016401722,0.2848078],"category_scores_gemma":[0.0035322136,0.00037220222,0.00035314792,0.0021499689,0.0004312476,0.002220729,0.0011248555,0.0019721582,0.15456499],"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.000136478,0.000077938785,0.00058868463,0.00037973013,0.000028107697,0.00008782286,0.000044421522,0.0005760108,0.0014611691,0.014737316,0.744742,0.23714034],"study_design_scores_gemma":[0.00001881595,0.0000519161,0.00081286725,0.00021110733,0.000025922613,0.00018738367,0.00004418644,0.0013369377,0.0008055887,0.0042113387,0.9922799,0.000013947228],"about_ca_topic_score_codex":0.0019838146,"about_ca_topic_score_gemma":0.0032619128,"teacher_disagreement_score":0.7151922,"about_ca_system_score_codex":0.0011598372,"about_ca_system_score_gemma":0.0016104179,"threshold_uncertainty_score":0.952777},"labels":[],"label_agreement":null},{"id":"W4377001514","doi":"10.1109/tcomm.2023.3277033","title":"RSMA Precoding Design Based on Interference Nulling and Sum Rate Upper Bound","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Precoding; Upper and lower bounds; Maximization; Mathematical optimization; Mathematics; Zero-forcing precoding; Interference (communication); Computer science; Optimization problem; Algorithm; Topology (electrical circuits); MIMO; Beamforming; Telecommunications; Channel (broadcasting); Statistics; Combinatorics","score_opus":0.06948614300454585,"score_gpt":0.2835017649438014,"score_spread":0.21401562193925555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377001514","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.0038433461,0.00020326112,0.99354595,0.00005471299,0.00003073637,0.00002480458,0.000014515649,0.00011073513,0.0021718943],"genre_scores_gemma":[0.45925608,0.0011871898,0.53493166,0.00019632281,0.00014587448,0.00021564239,0.000116289084,0.000084778665,0.0038661559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831676,0.0005517988,0.000087686705,0.00020384991,0.00071068417,0.00012912697],"domain_scores_gemma":[0.9980457,0.00082564115,0.00021229754,0.00026468697,0.00060014223,0.00005158476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010610729,0.0013026736,0.0008320993,0.00070438354,0.00042802154,0.0012373055,0.0009832999,0.00064489554,0.0014913568],"category_scores_gemma":[0.0048550535,0.00043976516,0.00046218,0.0010706307,0.0009406584,0.0012932047,0.0010271692,0.0011082613,0.00067900243],"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.00016758585,0.000103621685,0.00057471363,0.0002730995,0.00009851056,0.00017262089,0.0002535614,0.6117991,0.049139313,0.14427997,0.0035692593,0.1895686],"study_design_scores_gemma":[0.000011860682,0.00008409405,0.00006766626,0.000015280599,0.00001586841,0.00010065595,0.000021839156,0.9782631,0.009359128,0.010260959,0.0017857489,0.0000137112675],"about_ca_topic_score_codex":0.0012528725,"about_ca_topic_score_gemma":0.0016756178,"teacher_disagreement_score":0.0014913568,"about_ca_system_score_codex":0.00056996464,"about_ca_system_score_gemma":0.0014222703,"threshold_uncertainty_score":0.005611539},"labels":[],"label_agreement":null},{"id":"W4377001549","doi":"10.1109/tcomm.2023.3277041","title":"Power Allocation for Adaptive-Connectivity Wireless Networks Under Imperfect CSI","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"National Research Foundation of Korea","keywords":"Computer science; MIMO; Channel state information; Transmitter power output; Transmission (telecommunications); Power control; Wireless; Channel (broadcasting); Throughput; Wireless network; Computer network; Signal-to-noise ratio (imaging); Interference (communication); Real-time computing; Power (physics); Transmitter; Telecommunications","score_opus":0.028603687142327083,"score_gpt":0.2676376317139196,"score_spread":0.2390339445715925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377001549","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.016456774,0.00022435201,0.98106706,0.0001102326,0.000031512274,0.00004414548,0.0000162572,0.00016413523,0.0018855417],"genre_scores_gemma":[0.8841552,0.00021386362,0.11394273,0.00011076798,0.00006826541,0.00009571407,0.00004309003,0.000036376983,0.0013340709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995055,0.0001262686,0.00002864084,0.00012844359,0.00012648964,0.00008459344],"domain_scores_gemma":[0.99899906,0.0006167583,0.00012754598,0.000077517856,0.00014303422,0.00003612707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097645,0.0007602869,0.000614491,0.00042766097,0.00050185714,0.0006853029,0.0012970411,0.00055118185,0.0014543039],"category_scores_gemma":[0.002566056,0.00024794508,0.00023942944,0.0005791528,0.0006670268,0.0009775977,0.0007320965,0.0005966227,0.0002107494],"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.00010785816,0.00007262729,0.0008849941,0.000078866404,0.000031868523,0.00013335343,0.00011147771,0.8664806,0.005022754,0.013687072,0.0015245788,0.11186402],"study_design_scores_gemma":[0.000010167881,0.000035818666,0.0001361095,0.0000038419225,0.000005606879,0.00005071007,0.0000123478985,0.9950477,0.00053720985,0.0037444218,0.00041190683,0.0000041959634],"about_ca_topic_score_codex":0.0016331917,"about_ca_topic_score_gemma":0.0019394433,"teacher_disagreement_score":0.0016331917,"about_ca_system_score_codex":0.0006007391,"about_ca_system_score_gemma":0.00054139615,"threshold_uncertainty_score":0.00486511},"labels":[],"label_agreement":null},{"id":"W4378421727","doi":"10.1109/tcomm.2023.3280213","title":"Impact of Channel Aging on Dual-Function Radar-Communication Systems: Performance Analysis and Resource Allocation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Real-time computing; Resource allocation; Channel (broadcasting); Communications system; Radar; Electronic engineering; Retransmission; Engineering; Transmission (telecommunications); Computer network; Telecommunications","score_opus":0.022686372734460367,"score_gpt":0.25690553870756927,"score_spread":0.2342191659731089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421727","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.120783076,0.0018767021,0.87207,0.0002368387,0.000053774955,0.0000386612,0.000054343283,0.0002620136,0.0046245437],"genre_scores_gemma":[0.9681027,0.0009849533,0.02995523,0.00006886986,0.000033229626,0.00003331927,0.00003986528,0.000026372092,0.00075544347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.00037371655,0.000046100522,0.00017746836,0.0003256264,0.0002305866],"domain_scores_gemma":[0.9974026,0.0013548376,0.000416455,0.00020317515,0.0005592459,0.00006356925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014482926,0.00095988,0.0006707403,0.0004424447,0.00038754134,0.00093030365,0.00053609314,0.0006384967,0.0006888237],"category_scores_gemma":[0.004231855,0.00024291998,0.00031208634,0.0006878193,0.0008783629,0.0011481423,0.00078385696,0.00070131477,0.00020717214],"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.00008797612,0.000036001387,0.0014025628,0.00008338576,0.000020710087,0.00015377792,0.00006959079,0.9627915,0.00730744,0.006138076,0.00032196872,0.021587063],"study_design_scores_gemma":[0.0000020708355,0.000051183157,0.00035502328,0.0000057467496,0.00001172215,0.00006245536,0.00002074513,0.9955414,0.0031233083,0.00063720375,0.00018036173,0.000008730465],"about_ca_topic_score_codex":0.0027284229,"about_ca_topic_score_gemma":0.0017757566,"teacher_disagreement_score":0.0027284229,"about_ca_system_score_codex":0.0009992231,"about_ca_system_score_gemma":0.0009994379,"threshold_uncertainty_score":0.0076593757},"labels":[],"label_agreement":null},{"id":"W4378421815","doi":"10.1109/tcomm.2023.3280219","title":"Coverage Analysis of SAGIN With Sectorized Beam Pattern Under Shadowed-Rician Fading Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":19,"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":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Rician fading; Fading; Telecommunications link; Path loss; Stochastic geometry; Computer science; Interference (communication); Applied mathematics; Topology (electrical circuits); Telecommunications; Mathematics; Mathematical optimization; Statistics; Decoding methods; Wireless; Channel (broadcasting)","score_opus":0.046390646691294404,"score_gpt":0.27213380369793155,"score_spread":0.22574315700663716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421815","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.38215572,0.0016419765,0.60386956,0.0003734592,0.000042547046,0.000049047674,0.00024313829,0.00025265125,0.011371912],"genre_scores_gemma":[0.99393696,0.000514574,0.0047436543,0.000036024998,0.000017348231,0.000013028365,0.00006751299,0.000012085393,0.0006589578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994318,0.00017731903,0.000014785277,0.00006786267,0.00016100846,0.00014721141],"domain_scores_gemma":[0.9982849,0.0009607545,0.0002778641,0.0000886539,0.00031393865,0.000073876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008401653,0.00063038134,0.00044534597,0.0006729134,0.00032075297,0.00070518575,0.00075313996,0.0005514583,0.00091807905],"category_scores_gemma":[0.003036804,0.00025250408,0.0003937328,0.0008324371,0.0009400777,0.00091273896,0.00095411245,0.00043213976,0.000106772146],"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.00010939762,0.000017934262,0.0041910806,0.00006285929,0.000029816969,0.00033800863,0.00010525683,0.96423644,0.004760117,0.018278211,0.0005517926,0.0073192446],"study_design_scores_gemma":[0.0000023648079,0.000021422804,0.00076059595,0.0000029755313,0.000007436172,0.00008982992,0.000033295288,0.9966252,0.00036875426,0.0019589781,0.00012365145,0.0000055537093],"about_ca_topic_score_codex":0.0064906,"about_ca_topic_score_gemma":0.0029099404,"teacher_disagreement_score":0.0064906,"about_ca_system_score_codex":0.0010463608,"about_ca_system_score_gemma":0.000525757,"threshold_uncertainty_score":0.012905598},"labels":[],"label_agreement":null},{"id":"W4378421951","doi":"10.1109/tcomm.2023.3280212","title":"Value of Service Maximization in Integrated Localization and Communication System Through Joint Resource Allocation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Western University","funders":"","keywords":"Computer science; Resource allocation; Maximization; Particle swarm optimization; Distributed computing; Wireless; Mathematical optimization; Computer network; Bandwidth (computing); Provisioning; Telecommunications; Algorithm; Mathematics","score_opus":0.027918244147136596,"score_gpt":0.23940948211350205,"score_spread":0.21149123796636546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421951","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.028374357,0.00044534483,0.96790385,0.00020980841,0.000027417058,0.000039470924,0.000019902325,0.00008998087,0.0028898637],"genre_scores_gemma":[0.9421476,0.00027349358,0.05607724,0.000065405686,0.00003081445,0.00008127986,0.000025453839,0.000025328114,0.0012734563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983834,0.0006909735,0.00005651791,0.00025597567,0.0003231487,0.0002899862],"domain_scores_gemma":[0.998896,0.00062367256,0.00015935737,0.00005798448,0.00018063051,0.0000823428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018185334,0.0009517569,0.0012790529,0.0005562455,0.00057444116,0.0016681976,0.0010422936,0.00086927915,0.0009253355],"category_scores_gemma":[0.0030128018,0.00041692055,0.000527796,0.0009696794,0.0012300594,0.0014986714,0.0014831298,0.00074815983,0.00014065034],"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.00010928606,0.00004750102,0.00055107643,0.00007873351,0.000046006382,0.00011244301,0.00009942811,0.9487662,0.003378192,0.0247805,0.0006713558,0.021359364],"study_design_scores_gemma":[0.000005387131,0.000023979306,0.00006166579,0.0000032582277,0.000005418205,0.000016560254,0.000011933319,0.99610883,0.0003037909,0.0032859019,0.00016845916,0.0000048625297],"about_ca_topic_score_codex":0.0043724985,"about_ca_topic_score_gemma":0.002543123,"teacher_disagreement_score":0.0043724985,"about_ca_system_score_codex":0.001454128,"about_ca_system_score_gemma":0.001684273,"threshold_uncertainty_score":0.010550499},"labels":[],"label_agreement":null},{"id":"W4379116684","doi":"10.1109/tcomm.2023.3282220","title":"Power Control With QoS Guarantees: A Differentiable Projection-Based Unsupervised Learning Framework","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Projection (relational algebra); Differentiable function; Power control; Quality of service; Unsupervised learning; Control (management); Competitive learning; Power (physics); Artificial intelligence; Computer network; Mathematics; Algorithm","score_opus":0.014030329029693233,"score_gpt":0.22561910392406992,"score_spread":0.2115887748943767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379116684","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.0058862213,0.00019609008,0.99191564,0.00016808035,0.000017808114,0.000014774726,0.000029296589,0.00015032841,0.0016217116],"genre_scores_gemma":[0.78358626,0.0008450584,0.20893177,0.0002761118,0.00013332465,0.00021045703,0.00018622144,0.00012958291,0.005701265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00013812972,0.00001689022,0.00008118028,0.00010519234,0.00004712418],"domain_scores_gemma":[0.99940014,0.00031393443,0.00006879271,0.00005165324,0.00013176665,0.000033756216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090199057,0.00093152636,0.00077792397,0.00030113125,0.00026162324,0.0007186099,0.0013881703,0.0008801696,0.0012413509],"category_scores_gemma":[0.0018826787,0.00040037936,0.00042481092,0.000509842,0.0009296121,0.0012239703,0.0009745326,0.0018258396,0.00019296075],"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.000021450662,0.000024945432,0.00014593336,0.0000319741,0.000017901586,0.00003422263,0.000025398505,0.956977,0.0008773748,0.019644156,0.000641407,0.021558255],"study_design_scores_gemma":[0.0000015394199,0.000004097598,0.000008439932,0.0000011076411,0.0000011525677,0.000002537041,9.4966714e-7,0.99679595,0.00009212438,0.0029931036,0.00009806299,9.298027e-7],"about_ca_topic_score_codex":0.0041593653,"about_ca_topic_score_gemma":0.0039726547,"teacher_disagreement_score":0.0041593653,"about_ca_system_score_codex":0.00088598725,"about_ca_system_score_gemma":0.0014989533,"threshold_uncertainty_score":0.008270323},"labels":[],"label_agreement":null},{"id":"W4380434584","doi":"10.1109/tcomm.2023.3285799","title":"Joint Trajectory and Radio Resource Optimization for Autonomous Mobile Robots Exploiting Multi-Agent Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Florida Center for Cybersecurity, University of South Florida","keywords":"Reinforcement learning; Computer science; Mathematical optimization; Robot; Mobile robot; Greedy algorithm; Markov decision process; Trajectory; Wireless sensor network; Wireless; Distributed computing; Real-time computing; Markov process; Artificial intelligence; Computer network; Algorithm; Mathematics","score_opus":0.056437383574556445,"score_gpt":0.2757989399046327,"score_spread":0.21936155633007628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380434584","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.03771812,0.00021732524,0.9595405,0.0002883543,0.000025992114,0.00003514704,0.00001891264,0.00018421987,0.0019714078],"genre_scores_gemma":[0.9453428,0.00011975943,0.05251384,0.000072022194,0.000023676494,0.00010440295,0.000033675133,0.000029742669,0.001760139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.0001462834,0.000014771831,0.00006284693,0.000079563026,0.00007304443],"domain_scores_gemma":[0.99855393,0.0009326959,0.00020755714,0.00006866148,0.00014934389,0.000087661465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553654,0.00082016917,0.0009790722,0.0003601273,0.00042578674,0.00060621294,0.00085868785,0.00080808904,0.0010548],"category_scores_gemma":[0.0027742803,0.0003994693,0.00044296673,0.00036277834,0.0010077539,0.0007322148,0.0009520643,0.000927563,0.00016671905],"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.000019045308,0.000014005133,0.0001931077,0.000010748241,0.000011004766,0.000023391996,0.000013702746,0.99204564,0.00024213348,0.0032350882,0.00014635483,0.0040457123],"study_design_scores_gemma":[0.0000044423423,0.000007350102,0.000019784882,9.3192773e-7,0.000001239184,0.0000023830155,0.0000017455158,0.99855405,0.00004839848,0.0013161511,0.000042441654,0.0000010427435],"about_ca_topic_score_codex":0.006394574,"about_ca_topic_score_gemma":0.0048100497,"teacher_disagreement_score":0.006394574,"about_ca_system_score_codex":0.0009948034,"about_ca_system_score_gemma":0.001349068,"threshold_uncertainty_score":0.012714684},"labels":[],"label_agreement":null},{"id":"W4380793125","doi":"10.1109/tcomm.2023.3280273","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380793125","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.7151923,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4383220456","doi":"10.1109/tcomm.2023.3292482","title":"Minimum Symbol Error Probability Discrete Symbol Level Precoding for MU-MIMO Systems With PSK Modulation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Manitoba","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Fundação de Amparo à Pesquisa do Estado de São Paulo; Agence Nationale de la Recherche","keywords":"Precoding; Symbol (formal); Modulation (music); MIMO; Phase-shift keying; Quadrature amplitude modulation; Mathematics; Computer science; Algorithm; Electronic engineering; Bit error rate; Telecommunications; Decoding methods; Channel (broadcasting); Engineering; Physics","score_opus":0.0829865496730114,"score_gpt":0.29299418660000004,"score_spread":0.21000763692698865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383220456","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.009920928,0.00035649815,0.9873354,0.00011035853,0.000020780833,0.000018454426,0.000030049481,0.000060021095,0.0021475265],"genre_scores_gemma":[0.60475785,0.0014397515,0.3900129,0.000122008634,0.00008419129,0.00013605556,0.00010738122,0.00003626375,0.0033036824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.00021078816,0.000025119081,0.00006386598,0.00032567154,0.000058984686],"domain_scores_gemma":[0.9990386,0.00062648574,0.00010155629,0.00008235848,0.00012661805,0.00002436923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006134026,0.0005725283,0.00061213266,0.00025373074,0.00023143471,0.0009788134,0.00047651047,0.00049699575,0.001278064],"category_scores_gemma":[0.0034285805,0.0002485645,0.0002623616,0.0006220307,0.00050146674,0.000650275,0.0006274714,0.00087958947,0.00036666065],"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.00012409335,0.000046695623,0.00046353272,0.00024213396,0.00003954715,0.0000787778,0.00010523503,0.8212097,0.014619023,0.060663033,0.0012403574,0.10116782],"study_design_scores_gemma":[0.000007912003,0.00005303776,0.00011494305,0.0000145882495,0.0000056818217,0.000034135337,0.000011345056,0.989502,0.0035176028,0.0060519553,0.00068174384,0.000005064034],"about_ca_topic_score_codex":0.00096860697,"about_ca_topic_score_gemma":0.0016234647,"teacher_disagreement_score":0.001278064,"about_ca_system_score_codex":0.0005547707,"about_ca_system_score_gemma":0.0011644773,"threshold_uncertainty_score":0.0042755604},"labels":[],"label_agreement":null},{"id":"W4384304709","doi":"10.1109/tcomm.2023.3290802","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384304709","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.28480768,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4384787755","doi":"10.1109/tcomm.2023.3296619","title":"Active RIS-Aided EH-NOMA Networks: A Deep Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":27,"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":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Noma; Reinforcement learning; Computer science; Artificial intelligence; Computer network; Telecommunications link","score_opus":0.031140085127844,"score_gpt":0.2611409502011849,"score_spread":0.2300008650733409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384787755","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.05514318,0.0008492574,0.9361334,0.0006209802,0.0001112549,0.000039201237,0.000059384853,0.0005513642,0.0064919414],"genre_scores_gemma":[0.95920956,0.00016619347,0.036605008,0.00022776453,0.000042911262,0.00006357763,0.00006218848,0.000029523459,0.0035933717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997708,0.000055507597,0.000009248461,0.000058085207,0.000043707245,0.00006251848],"domain_scores_gemma":[0.99941313,0.00034479826,0.00006201373,0.000026946178,0.000117143114,0.00003599771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754423,0.0008125261,0.0008148735,0.00024088736,0.00027972012,0.0006397869,0.0012077705,0.0010733395,0.0013588216],"category_scores_gemma":[0.0013550036,0.0003723027,0.00035549013,0.00027678738,0.0006506444,0.0007306593,0.0008128401,0.0013280875,0.00024218619],"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.00006047845,0.000044087337,0.0005021271,0.00003866669,0.00003023367,0.00006842983,0.000040938663,0.95906293,0.0015166382,0.0038976092,0.0007754678,0.03396239],"study_design_scores_gemma":[0.0000020282612,0.000009028953,0.000019000812,0.0000013997092,0.0000021478434,0.000003337745,0.0000020370153,0.999268,0.00013631213,0.0004929331,0.00006259039,0.0000012433727],"about_ca_topic_score_codex":0.007030026,"about_ca_topic_score_gemma":0.0075098313,"teacher_disagreement_score":0.007030026,"about_ca_system_score_codex":0.00074799446,"about_ca_system_score_gemma":0.0009686287,"threshold_uncertainty_score":0.013978243},"labels":[],"label_agreement":null},{"id":"W4385575065","doi":"10.1109/tcomm.2023.3302067","title":"Redundancy Management in Federated Learning for Fast Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Queen's University","funders":"Huawei Technologies","keywords":"Retransmission; Redundancy (engineering); Computer science; Decoding methods; Network packet; Wireless; Error detection and correction; Cyclic redundancy check; Real-time computing; Baseline (sea); Machine learning; Computer network; Artificial intelligence; Computer engineering; Algorithm; Telecommunications","score_opus":0.06826406456159706,"score_gpt":0.3272213245812685,"score_spread":0.25895726001967145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385575065","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.061384853,0.0005779009,0.9344122,0.00034472978,0.00008055934,0.00007271755,0.00005429387,0.0014643682,0.0016084241],"genre_scores_gemma":[0.9338756,0.00013443535,0.06442779,0.00018933653,0.000044346667,0.000079093275,0.00005480408,0.000039263647,0.0011553348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974171,0.0009348038,0.00017528833,0.00044433188,0.00067686,0.00035161647],"domain_scores_gemma":[0.99193597,0.0036087662,0.0008262924,0.0019641838,0.0014334592,0.00023141896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034639386,0.0007488856,0.0011725192,0.0007748012,0.00090915477,0.0012427375,0.0022810705,0.0012163728,0.0009721581],"category_scores_gemma":[0.011385949,0.00030730476,0.00033360845,0.000830032,0.001284644,0.0027125154,0.0020513975,0.001385129,0.00036426436],"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.0010188051,0.00027010738,0.0020407937,0.00028729456,0.00010307814,0.0005859559,0.0004951447,0.7113577,0.015479251,0.040924657,0.0039099753,0.22352722],"study_design_scores_gemma":[0.000025805386,0.00013086572,0.00012600329,0.000019298348,0.000013377408,0.00016622555,0.000037610298,0.97823787,0.0078007192,0.012531764,0.0008891967,0.000021326192],"about_ca_topic_score_codex":0.0013686919,"about_ca_topic_score_gemma":0.0011490203,"teacher_disagreement_score":0.0034639386,"about_ca_system_score_codex":0.000897956,"about_ca_system_score_gemma":0.0014536497,"threshold_uncertainty_score":0.01831925},"labels":[],"label_agreement":null},{"id":"W4385833862","doi":"10.1109/tcomm.2023.3299397","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385833862","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.28480768,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4386124425","doi":"10.1109/tcomm.2023.3308150","title":"Extreme Learning Machine-Based Channel Estimation in IRS-Assisted Multi-User ISAC System","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Fundamental Research Funds for the Central Universities; State Key Laboratory of Rail Traffic Control and Safety; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Channel (broadcasting); Computer science; Extreme learning machine; Base station; Transmission (telecommunications); Real-time computing; Communications system; Computational complexity theory; Artificial neural network; Computer engineering; Computer network; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.06699789630198195,"score_gpt":0.2853595238666975,"score_spread":0.21836162756471555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386124425","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.046005707,0.00024626695,0.9509274,0.00012721244,0.000039234128,0.00002260693,0.000025114365,0.00048365028,0.002122707],"genre_scores_gemma":[0.9330542,0.00013041362,0.06489315,0.000108617714,0.000033865923,0.000045627025,0.000048008256,0.000019184603,0.0016669533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993967,0.00019765795,0.000024576197,0.00012684501,0.00017180045,0.00008252892],"domain_scores_gemma":[0.9994628,0.00023155664,0.000071850314,0.00006350348,0.00014629966,0.000023998406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598007,0.00055949495,0.00073211605,0.00025512924,0.00035769353,0.0005480747,0.0007988026,0.00064574124,0.00069707644],"category_scores_gemma":[0.0013444864,0.0002574712,0.0003823865,0.0004355357,0.00059577374,0.0007944249,0.00069587445,0.00083750003,0.00021064693],"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.00021121856,0.00006384672,0.0017645641,0.0000818997,0.000061092156,0.00014012822,0.00010010913,0.8732941,0.008234573,0.003845681,0.0008669603,0.1113358],"study_design_scores_gemma":[0.0000030698732,0.000022934617,0.00013266141,0.000001999036,0.0000040703007,0.000020449872,0.0000045345732,0.9982022,0.0010430226,0.00044632884,0.000113197435,0.000005459832],"about_ca_topic_score_codex":0.0024306655,"about_ca_topic_score_gemma":0.0023724504,"teacher_disagreement_score":0.0024306655,"about_ca_system_score_codex":0.00037871714,"about_ca_system_score_gemma":0.0005973951,"threshold_uncertainty_score":0.0048330426},"labels":[],"label_agreement":null},{"id":"W4386124507","doi":"10.1109/tcomm.2023.3308153","title":"Efficient Constrained Codes That Enable Page Separation in Modern Flash Memories","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"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":"University of California, San Diego; University of Oxford; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; University of Warwick; California Institute of Technology; York University; Massachusetts Institute of Technology; Princeton University; National Science Foundation","keywords":"Computer science; Decoding methods; Coding (social sciences); Flash memory; Variable-length code; Flash file system; Theoretical computer science; Algorithm; Computer engineering; Computer hardware; Mathematics; Computer memory","score_opus":0.055586202226156456,"score_gpt":0.31395266680229666,"score_spread":0.2583664645761402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386124507","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.16538562,0.0010456102,0.8233544,0.00041436107,0.00011584765,0.0000831175,0.00016211547,0.0005001758,0.008938815],"genre_scores_gemma":[0.78070825,0.0007140542,0.21267642,0.00029813283,0.0000636094,0.00016571167,0.0001958519,0.00007636987,0.00510158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967325,0.00007764441,0.00002830468,0.00004351649,0.00012787855,0.000049380855],"domain_scores_gemma":[0.9988952,0.0005488157,0.00014105161,0.00019280959,0.00017602454,0.000046093104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029683425,0.0003701944,0.00029695028,0.00035685478,0.00034330573,0.0005425569,0.00053277647,0.0005497039,0.0015784092],"category_scores_gemma":[0.0023975645,0.00018857671,0.0002152035,0.00049143087,0.0008109029,0.0010620508,0.00092312787,0.00065232924,0.00035692248],"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.0005209624,0.0001565518,0.0010909582,0.0002844099,0.00004570008,0.00038149647,0.00048863713,0.30655956,0.10588516,0.36434034,0.005394757,0.21485151],"study_design_scores_gemma":[0.000045913202,0.0001568276,0.0002076418,0.000059132948,0.00001508866,0.00021863305,0.000059126854,0.8770394,0.04192539,0.075129785,0.005096733,0.000046371595],"about_ca_topic_score_codex":0.00086347037,"about_ca_topic_score_gemma":0.0013691735,"teacher_disagreement_score":0.0015784092,"about_ca_system_score_codex":0.00042618127,"about_ca_system_score_gemma":0.00065798627,"threshold_uncertainty_score":0.005280316},"labels":[],"label_agreement":null},{"id":"W4386766959","doi":"10.1109/tcomm.2023.3309118","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network; Electrical engineering; Engineering","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386766959","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.28480768,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4386869660","doi":"10.1109/tcomm.2023.3317300","title":"Joint Age-Based Client Selection and Resource Allocation for Communication-Efficient Federated Learning Over NOMA Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Resource allocation; Selection (genetic algorithm); Convergence (economics); Throughput; Wireless; Noma; Distributed computing; Computer network; Dual (grammatical number); Wireless network; Joint (building); Resource management (computing); Artificial intelligence; Telecommunications; Engineering","score_opus":0.05404172855537724,"score_gpt":0.29405518640086536,"score_spread":0.2400134578454881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386869660","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.050342355,0.00029133755,0.9472087,0.00019721065,0.000043599084,0.000047549252,0.000053363725,0.00056692417,0.0012489073],"genre_scores_gemma":[0.9474253,0.0001071125,0.050601687,0.00010454805,0.000036704158,0.00006455427,0.000058770107,0.000028745699,0.0015725557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987896,0.00044721077,0.0000547353,0.00024618313,0.0001988627,0.00026342843],"domain_scores_gemma":[0.9979025,0.0010109299,0.00025321907,0.00029807206,0.00037137294,0.00016389017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021282386,0.0008300462,0.001295831,0.00048014158,0.0007051468,0.0009248415,0.0019676874,0.00091038254,0.001055904],"category_scores_gemma":[0.0047262493,0.00033252884,0.00042809235,0.0007155382,0.0006297937,0.0017860534,0.0015524774,0.0011200252,0.00029664187],"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.00034983805,0.00022596182,0.0026146397,0.000059054262,0.000047758327,0.00014163274,0.00012656128,0.8549923,0.0033165875,0.009464086,0.0021424661,0.12651919],"study_design_scores_gemma":[0.0000031023205,0.000016460524,0.00007952009,0.0000014454812,0.000003091629,0.000018876603,0.00000775784,0.99773955,0.0004281623,0.0015959948,0.00010252158,0.000003467298],"about_ca_topic_score_codex":0.0031748945,"about_ca_topic_score_gemma":0.003954147,"teacher_disagreement_score":0.0031748945,"about_ca_system_score_codex":0.00096461835,"about_ca_system_score_gemma":0.001317877,"threshold_uncertainty_score":0.0112553835},"labels":[],"label_agreement":null},{"id":"W4387385575","doi":"10.1109/tcomm.2023.3322174","title":"A Family of Binary Locally Repairable Codes for Coded Distributed Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"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 Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Block code; Decoding methods; Linear code; Matrix multiplication; Computational complexity theory; Concatenated error correction code; Coding (social sciences); Theoretical computer science; Multiplication (music); List decoding; Binary number; Algorithm; Mathematics; Arithmetic","score_opus":0.05301074733122166,"score_gpt":0.30565334862846394,"score_spread":0.25264260129724225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387385575","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.012524551,0.00135804,0.980988,0.0003056711,0.000098649296,0.00010402911,0.0002145844,0.0004898101,0.0039165695],"genre_scores_gemma":[0.40948522,0.0022117207,0.57372797,0.00042871237,0.00012982458,0.0006286274,0.00065186934,0.00021181107,0.012524218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990878,0.00022346628,0.000045232595,0.00014431411,0.0004101884,0.00008899282],"domain_scores_gemma":[0.9975236,0.00081402523,0.00033215695,0.00044395658,0.0007737714,0.000112483205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080970925,0.0006419644,0.00051701587,0.0010393185,0.00063132227,0.00077378296,0.00092731963,0.0008101418,0.002169508],"category_scores_gemma":[0.004992838,0.00020475684,0.00036307503,0.0012050408,0.0009250627,0.0010520788,0.000899224,0.0015805033,0.0010999348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045763902,0.00010770077,0.00084387016,0.00050129567,0.00005731958,0.00030194368,0.00031741595,0.26102695,0.033459906,0.33903432,0.012142634,0.35174897],"study_design_scores_gemma":[0.000076642056,0.00020563848,0.00035577663,0.00012594895,0.00002599322,0.0006437486,0.000070750284,0.8513069,0.018673716,0.09677621,0.03166029,0.00007845328],"about_ca_topic_score_codex":0.0021186129,"about_ca_topic_score_gemma":0.001726704,"teacher_disagreement_score":0.002169508,"about_ca_system_score_codex":0.00086948014,"about_ca_system_score_gemma":0.0016347279,"threshold_uncertainty_score":0.0072577596},"labels":[],"label_agreement":null},{"id":"W4387709849","doi":"10.1109/tcomm.2023.3320966","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387709849","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.7151923,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4388206377","doi":"10.1109/tcomm.2023.3327778","title":"M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Computer science; Algorithm; Distortion (music); Computer network; Bandwidth (computing)","score_opus":0.04696945932755964,"score_gpt":0.3033612843625715,"score_spread":0.25639182503501184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388206377","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.0030459831,0.00015090218,0.9942431,0.00017952028,0.00005546285,0.00007361191,0.00003924984,0.0013924842,0.00081970735],"genre_scores_gemma":[0.11477894,0.00017922666,0.8783746,0.000442674,0.00011207709,0.0004889405,0.0003606614,0.0005262682,0.004736697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.0005313283,0.00014569744,0.00029877105,0.00061303313,0.00016596729],"domain_scores_gemma":[0.99789846,0.0008484109,0.00017765131,0.00052153686,0.0004335429,0.00012044885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031309638,0.001937954,0.001832901,0.0011980782,0.0008088089,0.0017329,0.0033591443,0.0026687079,0.005492954],"category_scores_gemma":[0.010185107,0.0006839751,0.001097236,0.0010474315,0.0014421997,0.002927379,0.0035405194,0.003282159,0.0024218007],"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.000667654,0.0002149143,0.00096302154,0.00015150008,0.000100092475,0.00015049911,0.00019450806,0.3445613,0.0061011757,0.046030883,0.011921548,0.5889428],"study_design_scores_gemma":[0.000045547684,0.000058954553,0.00005692999,0.000012737419,0.000006496096,0.000058733,0.000011545917,0.9827574,0.0028300923,0.012468984,0.00167823,0.000014343604],"about_ca_topic_score_codex":0.004367573,"about_ca_topic_score_gemma":0.004098158,"teacher_disagreement_score":0.005492954,"about_ca_system_score_codex":0.002094828,"about_ca_system_score_gemma":0.0028292777,"threshold_uncertainty_score":0.018375754},"labels":[],"label_agreement":null},{"id":"W4388757405","doi":"10.1109/tcomm.2023.3329856","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388757405","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.0051209494,0.038052607,0.040751226,0.016504223,0.04454707,0.0004555303,0.008012808,0.0019290406,0.8446265],"genre_scores_gemma":[0.026282508,0.040096913,0.007110583,0.0022906468,0.007382347,0.00017972958,0.010487595,0.00040636363,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.000099413184,0.00004464549,0.000087667264,0.00036725312,0.00007512893],"domain_scores_gemma":[0.99737906,0.00059985067,0.00011260353,0.0003260734,0.0013835704,0.00019887867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038276,0.0010753564,0.00089291163,0.0018301366,0.0006711521,0.0026463869,0.00068668986,0.0016401722,0.2848078],"category_scores_gemma":[0.0035322136,0.00037220222,0.00035314792,0.0021499689,0.0004312476,0.002220729,0.0011248555,0.0019721582,0.15456499],"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.000136478,0.000077938785,0.00058868463,0.00037973013,0.000028107697,0.00008782286,0.000044421522,0.0005760108,0.0014611691,0.014737316,0.744742,0.23714034],"study_design_scores_gemma":[0.00001881595,0.0000519161,0.00081286725,0.00021110733,0.000025922613,0.00018738367,0.00004418644,0.0013369377,0.0008055887,0.0042113387,0.9922799,0.000013947228],"about_ca_topic_score_codex":0.0019838146,"about_ca_topic_score_gemma":0.0032619128,"teacher_disagreement_score":0.7151922,"about_ca_system_score_codex":0.0011598372,"about_ca_system_score_gemma":0.0016104179,"threshold_uncertainty_score":0.952777},"labels":[],"label_agreement":null},{"id":"W4388878400","doi":"10.1109/tcomm.2023.3335414","title":"Multi-Objective Multi-Dimensional Resource Allocation for Categorized QoS Provisioning in Beyond 5G and 6G Radio Access Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Backhaul (telecommunications); Quality of service; Computer network; Provisioning; Resource allocation; Radio access network; Optimization problem; Distributed computing; Mathematical optimization; Base station; Algorithm","score_opus":0.055631326846803365,"score_gpt":0.3173117384049071,"score_spread":0.26168041155810373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878400","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.05510118,0.0010472777,0.9386141,0.0002945866,0.000060545604,0.00010614103,0.00007084313,0.00016602039,0.0045393836],"genre_scores_gemma":[0.801516,0.0005588318,0.19479363,0.00020997043,0.000040117528,0.00033732012,0.00014495428,0.000057233698,0.0023419124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00027102095,0.000024955989,0.00008920955,0.00013520215,0.000099602104],"domain_scores_gemma":[0.99960846,0.00021891933,0.00006199208,0.000013429992,0.00006128943,0.000035996018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014547325,0.00106587,0.0010710148,0.00056511245,0.00048679012,0.0011496444,0.0010535336,0.00082831905,0.001439511],"category_scores_gemma":[0.0011922552,0.00056284,0.00077275693,0.0007429839,0.00047283954,0.0008895692,0.0009787225,0.00090299716,0.00012139351],"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.000034036857,0.000041544645,0.00027743363,0.00005322846,0.000033018074,0.000050446906,0.000021177524,0.9840575,0.00093794335,0.0026271024,0.00038185294,0.011484647],"study_design_scores_gemma":[0.0000052516807,0.000018318755,0.000060822018,0.000003323575,0.000006433113,0.000006332072,0.000009951768,0.9988487,0.00013050681,0.0007375358,0.00017011982,0.0000027024803],"about_ca_topic_score_codex":0.004935912,"about_ca_topic_score_gemma":0.004499501,"teacher_disagreement_score":0.004935912,"about_ca_system_score_codex":0.0008524538,"about_ca_system_score_gemma":0.0012159762,"threshold_uncertainty_score":0.009814382},"labels":[],"label_agreement":null},{"id":"W4389161164","doi":"10.1109/tcomm.2023.3337785","title":"A Resource-Efficient Coexistence Scheme for Massive Machine-Type and Human-to-Human Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Markov chain; Mathematical optimization; Quality of service; Queueing theory; Markov process; Transmission (telecommunications); Resource allocation; Markov model; Distributed computing; Computer network; Mathematics; Machine learning; Telecommunications; Statistics","score_opus":0.07661140621436864,"score_gpt":0.34583299120069194,"score_spread":0.2692215849863233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389161164","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.049631726,0.00034185295,0.94596857,0.00022277363,0.000060000006,0.00007461847,0.000059419985,0.00027900882,0.0033619616],"genre_scores_gemma":[0.9580519,0.00021124155,0.03989025,0.00008816901,0.00004152427,0.000086818465,0.000045860106,0.000021197724,0.0015629238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993166,0.00015414094,0.000034321834,0.00016240163,0.00016656933,0.00016600428],"domain_scores_gemma":[0.9991322,0.0003738839,0.00013657231,0.00008426318,0.00018120176,0.00009184863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068051217,0.0006675953,0.0006514386,0.0005088785,0.0010343746,0.000889476,0.0013774688,0.0006769897,0.0017860832],"category_scores_gemma":[0.0018547968,0.0003174755,0.000522426,0.00085806096,0.0006849458,0.0015624431,0.0018489142,0.0009341666,0.0002714275],"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.00035287128,0.00026740934,0.0014485656,0.00029332947,0.00008226813,0.0009236217,0.000584967,0.73508346,0.036944497,0.11525866,0.004555756,0.10420456],"study_design_scores_gemma":[0.000007939916,0.00005863543,0.00008815543,0.000006327953,0.000012141335,0.00009014216,0.000030542386,0.9929172,0.0012907067,0.0049698483,0.0005140514,0.000014352041],"about_ca_topic_score_codex":0.0033489303,"about_ca_topic_score_gemma":0.003358214,"teacher_disagreement_score":0.0033489303,"about_ca_system_score_codex":0.0010879023,"about_ca_system_score_gemma":0.0014516894,"threshold_uncertainty_score":0.007893324},"labels":[],"label_agreement":null},{"id":"W4389252359","doi":"10.1109/tcomm.2023.3338737","title":"Near-Field Beamforming Optimization for Holographic XL-MIMO Multiuser Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Beamforming; Computer science; MIMO; Electronic engineering; Overhead (engineering); Weighting; Antenna (radio); Telecommunications link; Interference (communication); Optimization problem; Algorithm; Mathematical optimization; Engineering; Mathematics; Channel (broadcasting); Telecommunications; Physics; Acoustics","score_opus":0.035924376837295345,"score_gpt":0.2651196178104822,"score_spread":0.22919524097318686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389252359","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.010352043,0.000366928,0.9865371,0.00013915585,0.000022939057,0.00001645323,0.00005733165,0.00010393199,0.00240419],"genre_scores_gemma":[0.58616626,0.001292003,0.40391266,0.0002688071,0.000068607515,0.00020430915,0.00033540576,0.00008393473,0.0076680044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997956,0.00007144794,0.00000846638,0.000040687177,0.000060274248,0.0000235317],"domain_scores_gemma":[0.99966705,0.0001919568,0.000047808855,0.000019840527,0.00005541758,0.000017968392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004604351,0.0009184705,0.00060772424,0.00023254045,0.00019566389,0.00065137906,0.00041731575,0.0007193287,0.001973254],"category_scores_gemma":[0.00083730137,0.0003831482,0.00041787824,0.00047727162,0.00054210617,0.0006013626,0.0006020663,0.00072382006,0.00052281126],"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.000050833063,0.00002645043,0.00039068118,0.00009891758,0.00003573062,0.000068048364,0.00004213104,0.9520591,0.0071363985,0.011166165,0.0010478148,0.027877733],"study_design_scores_gemma":[0.0000054295924,0.000018303566,0.000064211104,0.000003911915,0.0000030193498,0.000015766687,0.000007761676,0.9972204,0.0006540145,0.0016286968,0.00037414397,0.00000436409],"about_ca_topic_score_codex":0.0020675815,"about_ca_topic_score_gemma":0.0021067816,"teacher_disagreement_score":0.0020675815,"about_ca_system_score_codex":0.00043711078,"about_ca_system_score_gemma":0.00069340714,"threshold_uncertainty_score":0.006601155},"labels":[],"label_agreement":null},{"id":"W4389692244","doi":"10.1109/tcomm.2023.3342237","title":"Media-Based Modulation for Next-Generation Wireless: Latest Progress and New Applications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"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","keywords":"Computer science; Transmitter; MIMO; Bit error rate; Channel state information; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Computer engineering; Engineering","score_opus":0.11169321078531082,"score_gpt":0.29868933042418583,"score_spread":0.18699611963887502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389692244","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.014354527,0.69773805,0.17596182,0.019203428,0.0050392286,0.0001067684,0.00016583804,0.00087666436,0.08655371],"genre_scores_gemma":[0.169712,0.66056013,0.1233785,0.0036951934,0.008545177,0.00014903393,0.00041145977,0.00027453707,0.03327385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997433,0.000055955225,0.000018964764,0.000027742437,0.00012394796,0.000030093344],"domain_scores_gemma":[0.99937314,0.0002663897,0.000058838472,0.000059507292,0.00019795286,0.000044120796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883539,0.00053112453,0.00037823291,0.0008797777,0.0003911028,0.0013379666,0.00063930143,0.0010830872,0.00538071],"category_scores_gemma":[0.0014925104,0.000229663,0.00022772369,0.0013113937,0.0007039644,0.0031221225,0.0008869894,0.0014840249,0.0018473099],"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.00012937152,0.000058162186,0.00067098986,0.0013569163,0.000022654785,0.00020133842,0.00026166282,0.0034199727,0.021214768,0.11457622,0.026065243,0.83202267],"study_design_scores_gemma":[0.000026321311,0.00023250494,0.00082215446,0.0011048578,0.000048162015,0.0010066554,0.0003014782,0.027493957,0.0137678655,0.07014124,0.88497823,0.00007655473],"about_ca_topic_score_codex":0.00051404076,"about_ca_topic_score_gemma":0.0006877774,"teacher_disagreement_score":0.00538071,"about_ca_system_score_codex":0.0006102936,"about_ca_system_score_gemma":0.00053804484,"threshold_uncertainty_score":0.018000305},"labels":[],"label_agreement":null},{"id":"W4389799364","doi":"10.1109/tcomm.2023.3342242","title":"Secure Offloading in NOMA-Enabled Multi-Access Edge Computing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Windsor","funders":"Fundamental Research Funds for the Central Universities; Australian Research Council; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Eavesdropping; Mobile edge computing; Transmitter power output; Base station; Wireless; Performance metric; Computation offloading; Wireless network; Decoding methods; Node (physics); Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Algorithm; Channel (broadcasting); Server; Transmitter","score_opus":0.05679806892226748,"score_gpt":0.3131329780830248,"score_spread":0.25633490916075735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389799364","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.11964936,0.0007554248,0.8732469,0.0002871765,0.000071072085,0.000057119145,0.000060161266,0.00021929773,0.0056534717],"genre_scores_gemma":[0.9549744,0.00023067341,0.043218944,0.00007128388,0.00001599759,0.000045748773,0.00003185411,0.000020363157,0.0013906757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945015,0.00021437224,0.000018618597,0.000078681944,0.00012025215,0.0001179985],"domain_scores_gemma":[0.99936813,0.00039254042,0.00007606743,0.00006428733,0.00005652614,0.00004242674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119333,0.0007243137,0.00067597977,0.00030020848,0.0005571377,0.00080487435,0.0006020964,0.00047751828,0.00093975494],"category_scores_gemma":[0.0014895515,0.00027480265,0.0003415439,0.00046697422,0.0006272299,0.0007399786,0.001111042,0.000611192,0.00019032383],"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.00022810212,0.00006544366,0.00067945133,0.000077607314,0.000019684805,0.00025255297,0.00006987001,0.93347543,0.0072678057,0.013779494,0.0006573104,0.04342725],"study_design_scores_gemma":[0.0000033224462,0.000022672388,0.00005249194,0.0000026758496,0.0000022207405,0.000026493868,0.00001116017,0.996833,0.0007445391,0.0021148473,0.00018394862,0.0000025415015],"about_ca_topic_score_codex":0.0017743416,"about_ca_topic_score_gemma":0.0029414685,"teacher_disagreement_score":0.0017743416,"about_ca_system_score_codex":0.00055911957,"about_ca_system_score_gemma":0.00076109625,"threshold_uncertainty_score":0.0040567517},"labels":[],"label_agreement":null},{"id":"W4389887843","doi":"10.1109/tcomm.2023.3337957","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389887843","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.0051209456,0.038052544,0.040751245,0.01650423,0.04454702,0.00045553042,0.008012791,0.0019290387,0.8446267],"genre_scores_gemma":[0.026282532,0.040096913,0.0071105934,0.0022906489,0.007382347,0.00017972974,0.010487589,0.000406364,0.90576327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993259,0.00009941357,0.000044645618,0.0000876676,0.00036725414,0.00007512916],"domain_scores_gemma":[0.99737906,0.00059985236,0.00011260384,0.00032607466,0.001383575,0.00019887924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011038292,0.0010753564,0.00089291163,0.0018301385,0.00067115336,0.0026463908,0.00068669085,0.0016401722,0.28480768],"category_scores_gemma":[0.0035322206,0.00037220222,0.00035314792,0.002149971,0.0004312482,0.0022207343,0.0011248587,0.0019721612,0.15456487],"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.00013647796,0.000077938836,0.00058868475,0.00037973037,0.000028107688,0.000087823,0.000044421635,0.00057601056,0.0014611699,0.014737351,0.74474174,0.2371405],"study_design_scores_gemma":[0.000018815968,0.00005191615,0.0008128677,0.00021110733,0.000025922638,0.00018738404,0.000044186483,0.0013369389,0.0008055899,0.0042113494,0.9922799,0.000013947255],"about_ca_topic_score_codex":0.0019838156,"about_ca_topic_score_gemma":0.0032619145,"teacher_disagreement_score":0.7151923,"about_ca_system_score_codex":0.0011598383,"about_ca_system_score_gemma":0.001610421,"threshold_uncertainty_score":0.9527766},"labels":[],"label_agreement":null},{"id":"W4390204295","doi":"10.1109/tcomm.2023.3346930","title":"Analysis of One-Bit Quantized Linear Precoding Schemes in Multi-Cell Massive MIMO Downlink","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Precoding; Telecommunications link; MIMO; Converters; Zero-forcing precoding; Electronic engineering; Computer science; Quantization (signal processing); Multi-user MIMO; Bit error rate; Algorithm; Mathematics; Channel (broadcasting); Engineering; Decoding methods; Telecommunications; Electrical engineering","score_opus":0.06886396547341693,"score_gpt":0.3110609133776165,"score_spread":0.24219694790419954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390204295","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.19240937,0.0015723694,0.79306155,0.00035936927,0.000060902985,0.00007039549,0.0001243247,0.00023465566,0.012106994],"genre_scores_gemma":[0.9784638,0.0005681817,0.019336047,0.000059620812,0.000028475348,0.00002845488,0.0000464961,0.000014402311,0.0014545803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889886,0.0003642832,0.000029493616,0.00008850511,0.00045858542,0.00016028313],"domain_scores_gemma":[0.99772805,0.0013202528,0.0002508969,0.00017207686,0.00047857425,0.000050203555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011464565,0.0007232832,0.0005059082,0.00028233914,0.0002839494,0.0008725417,0.0006053203,0.00051795284,0.0015082842],"category_scores_gemma":[0.0035721227,0.00032102063,0.00028854565,0.0005191789,0.00095711066,0.0010469117,0.0005656303,0.00046151213,0.00022053464],"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.00012911473,0.000037855472,0.001155203,0.0001371897,0.00004842361,0.00022518975,0.00010162932,0.93651944,0.011021374,0.03317116,0.00044792725,0.017005503],"study_design_scores_gemma":[0.0000038868006,0.000049585968,0.0002813985,0.0000089666955,0.000009425773,0.0000566316,0.000024370425,0.9957545,0.0013150666,0.0023176104,0.00017159144,0.0000070970427],"about_ca_topic_score_codex":0.0023923295,"about_ca_topic_score_gemma":0.002888,"teacher_disagreement_score":0.0023923295,"about_ca_system_score_codex":0.0009931339,"about_ca_system_score_gemma":0.00076267245,"threshold_uncertainty_score":0.0072057247},"labels":[],"label_agreement":null},{"id":"W4390357257","doi":"10.1109/tcomm.2023.3347768","title":"IRS-Assisted Covert Communication With Equal and Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Covert; Transmitter power output; Transmission (telecommunications); Computer science; Signal-to-noise ratio (imaging); Wireless; Throughput; Statistical power; Computer network; Power (physics); Algorithm; Channel (broadcasting); Mathematics; Telecommunications; Transmitter; Statistics","score_opus":0.03447038401678132,"score_gpt":0.25948539314202695,"score_spread":0.22501500912524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357257","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.108870424,0.00060666923,0.88133305,0.0003186494,0.00005934485,0.000054763666,0.00007167495,0.00036596798,0.008319492],"genre_scores_gemma":[0.9345778,0.00035386492,0.062855914,0.00007679126,0.0000341095,0.00005694833,0.000057144407,0.000027678328,0.0019597006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910396,0.00018173034,0.000031787888,0.00017970512,0.00033079385,0.00017199089],"domain_scores_gemma":[0.9984642,0.00067287625,0.0003234672,0.00025168355,0.00021923358,0.00006850109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061211514,0.0008577654,0.0006090541,0.0005601248,0.0005164374,0.00069507444,0.00085655507,0.00068010954,0.0010982989],"category_scores_gemma":[0.0028892567,0.00023712286,0.0004351091,0.0007655428,0.0009345417,0.0015908357,0.0014135567,0.0007062376,0.0003294164],"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.0006895941,0.00014086938,0.0030301833,0.0002904525,0.00010965029,0.0006921591,0.00044173584,0.61539817,0.11272495,0.06993237,0.0024014013,0.19414847],"study_design_scores_gemma":[0.0000240622,0.00020400953,0.00057488267,0.000017983451,0.000030039682,0.00038605407,0.000058544545,0.95508546,0.032613136,0.009021282,0.0019486945,0.000035924342],"about_ca_topic_score_codex":0.00072942825,"about_ca_topic_score_gemma":0.0008928006,"teacher_disagreement_score":0.0010982989,"about_ca_system_score_codex":0.00073891005,"about_ca_system_score_gemma":0.00066823664,"threshold_uncertainty_score":0.00536114},"labels":[],"label_agreement":null},{"id":"W4390357323","doi":"10.1109/tcomm.2023.3347772","title":"Coded Reactive Stragglers Mitigation in Distributed Computing Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Redundancy (engineering); Computer science; Erasure; Erasure code; Exploit; Computation; Distributed computing; Real-time computing; Decoding methods; Algorithm; Computer security; Operating system","score_opus":0.040177227710613383,"score_gpt":0.29294832556789424,"score_spread":0.25277109785728086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357323","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.08773148,0.0009557977,0.9073011,0.00026174847,0.000102525344,0.000060186758,0.000044637094,0.0007200751,0.0028223821],"genre_scores_gemma":[0.9346015,0.00021937228,0.06282161,0.00011456196,0.000029424918,0.000048840066,0.000030799925,0.00004348306,0.002090474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992538,0.00021464328,0.000027918204,0.00013947579,0.00023617203,0.00012795514],"domain_scores_gemma":[0.99834406,0.0007352286,0.00022420961,0.0002456086,0.00037725177,0.000073643874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066463795,0.0007144364,0.0004512805,0.00043078,0.0006582139,0.00066704454,0.0011561771,0.0005173491,0.0009351919],"category_scores_gemma":[0.0022247583,0.00023076488,0.0002877654,0.00057324633,0.0007935291,0.0012425038,0.00084735575,0.0007664709,0.0002067339],"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.00046355874,0.00009579788,0.00096443354,0.00024645988,0.00005822983,0.00023385927,0.00027718503,0.83282745,0.04366408,0.029525962,0.002012227,0.08963075],"study_design_scores_gemma":[0.000018602323,0.00011396694,0.00014286154,0.000011660724,0.00001513303,0.000066289314,0.000036106827,0.9805958,0.011484394,0.0061585014,0.0013379093,0.000018769224],"about_ca_topic_score_codex":0.0030418336,"about_ca_topic_score_gemma":0.0038003975,"teacher_disagreement_score":0.0030418336,"about_ca_system_score_codex":0.0008580536,"about_ca_system_score_gemma":0.0013076146,"threshold_uncertainty_score":0.0062256455},"labels":[],"label_agreement":null},{"id":"W4390494415","doi":"10.1109/tcomm.2023.3349166","title":"Energy-Delay Tradeoff in Helper-Assisted NOMA-MEC Systems: A Four-Sided Matching Algorithm","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":15,"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":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Karush–Kuhn–Tucker conditions; Mathematical optimization; Energy consumption; Optimization problem; Algorithm; Convex optimization; Mobile edge computing; Blossom algorithm; Resource allocation; Computational complexity theory; Energy (signal processing); Matching (statistics); Enhanced Data Rates for GSM Evolution; Mathematics; Regular polygon; Computer network; Engineering","score_opus":0.03402669637067395,"score_gpt":0.2610717514449532,"score_spread":0.22704505507427925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390494415","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.011092421,0.000104326056,0.98725253,0.00010253971,0.000015028447,0.000030370082,0.000015467425,0.000107822336,0.0012795491],"genre_scores_gemma":[0.648747,0.00022657338,0.3461988,0.00016886115,0.000046678626,0.00020100434,0.00010171008,0.00006803167,0.004241264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.00022967551,0.00002739018,0.00011963881,0.00016201215,0.0001215822],"domain_scores_gemma":[0.9992323,0.0004609173,0.00008176912,0.000073520125,0.00010341051,0.000048223126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015406,0.00078662334,0.0010499991,0.0004092102,0.00047563005,0.0008624734,0.0014368923,0.0011181718,0.0019843944],"category_scores_gemma":[0.0024794706,0.00043048797,0.0005575295,0.00082116795,0.0007227317,0.0012351708,0.0014140536,0.0010766591,0.00047594935],"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.00021666574,0.00009213995,0.00054375874,0.000051292358,0.00003820357,0.000072172435,0.00010395161,0.89297366,0.0031947915,0.019675205,0.0011982023,0.081839845],"study_design_scores_gemma":[0.00001055686,0.000025840432,0.000029092882,0.0000019621718,0.0000030852432,0.000016824059,0.000006489209,0.99637115,0.00040977335,0.0029063048,0.00021588997,0.0000030576857],"about_ca_topic_score_codex":0.0019593234,"about_ca_topic_score_gemma":0.0013705441,"teacher_disagreement_score":0.0019843944,"about_ca_system_score_codex":0.0007156204,"about_ca_system_score_gemma":0.0013905884,"threshold_uncertainty_score":0.0066384673},"labels":[],"label_agreement":null},{"id":"W4390873725","doi":"10.1109/tcomm.2024.3354204","title":"RL-Based Hyperparameter Selection for Spectrum Sensing With CNNs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"","keywords":"Hyperparameter; Computer science; Convolutional neural network; Selection (genetic algorithm); Artificial intelligence; Reinforcement learning; Cognitive radio; Detector; Hyperparameter optimization; Machine learning; Artificial neural network; Channel (broadcasting); Pattern recognition (psychology); Wireless","score_opus":0.02687445469216907,"score_gpt":0.2662217112580339,"score_spread":0.23934725656586484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390873725","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.057194516,0.00090126775,0.9376415,0.0004052206,0.000060144423,0.00010720604,0.00006339856,0.0007905244,0.0028362693],"genre_scores_gemma":[0.92486984,0.00019867651,0.073366046,0.00024179218,0.000023959741,0.00013397819,0.00007496039,0.00006702881,0.0010238366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.0002596024,0.000041942,0.00014030289,0.00011183254,0.00009556517],"domain_scores_gemma":[0.99793833,0.0014145649,0.00020423294,0.00013506171,0.00024553738,0.00006222061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021146666,0.0012756445,0.0009323343,0.000560543,0.00033497787,0.00088601885,0.0012664341,0.0010985903,0.001339607],"category_scores_gemma":[0.008275186,0.0005708261,0.0004859878,0.00035615923,0.0008300522,0.0011315203,0.0009295403,0.0015407783,0.00024580827],"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.0000882128,0.0000652871,0.0014382002,0.00007495453,0.00006139868,0.000061310326,0.000043354958,0.9428037,0.0027029759,0.0035267964,0.00066641916,0.04846732],"study_design_scores_gemma":[0.000007169296,0.000015693897,0.00008394752,0.0000075003427,0.0000065355543,0.000010524092,0.0000046195223,0.9975674,0.0007586678,0.0014314561,0.000102996586,0.000003462028],"about_ca_topic_score_codex":0.004293941,"about_ca_topic_score_gemma":0.0047326144,"teacher_disagreement_score":0.004293941,"about_ca_system_score_codex":0.0011496262,"about_ca_system_score_gemma":0.0013426853,"threshold_uncertainty_score":0.01118356},"labels":[],"label_agreement":null},{"id":"W4390908051","doi":"10.1109/tcomm.2023.3348311","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390908051","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.005114772,0.03792548,0.04053936,0.016561141,0.04390094,0.00044928357,0.008030233,0.0019268544,0.84555197],"genre_scores_gemma":[0.026563058,0.039825723,0.007129054,0.0022907413,0.0073394133,0.00017856949,0.01055494,0.00040720523,0.90571135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932253,0.00010047867,0.000044732882,0.00008786416,0.00036855845,0.00007574971],"domain_scores_gemma":[0.99737,0.00060439395,0.00011383805,0.00032897218,0.0013831198,0.00019968703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011064933,0.0010727303,0.0008805576,0.0018318858,0.0006726355,0.0026372708,0.00068774534,0.0016338325,0.28569832],"category_scores_gemma":[0.0035636248,0.00037086767,0.00035365362,0.0021296446,0.00042992693,0.0022294694,0.0011277877,0.0019663975,0.15411995],"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.00013679033,0.00007812818,0.0005908799,0.0003821806,0.000028106917,0.00008768159,0.00004481516,0.00057662243,0.001460359,0.015009632,0.7422255,0.23937926],"study_design_scores_gemma":[0.000018731635,0.00005155247,0.00081350806,0.000210865,0.00002582425,0.00018696183,0.00004444601,0.0013224275,0.0008033245,0.0042572916,0.9922512,0.000013865781],"about_ca_topic_score_codex":0.0019881318,"about_ca_topic_score_gemma":0.0032723632,"teacher_disagreement_score":0.7143017,"about_ca_system_score_codex":0.0011629525,"about_ca_system_score_gemma":0.0016166875,"threshold_uncertainty_score":0.9557561},"labels":[],"label_agreement":null},{"id":"W4391092817","doi":"10.1109/tcomm.2024.3356792","title":"Joint Port Selection Based Channel Acquisition for FDD Cell-Free Massive MIMO","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Joint (building); Selection (genetic algorithm); Computer science; Channel (broadcasting); Electronic engineering; Port (circuit theory); Telecommunications; Engineering","score_opus":0.023577014986526444,"score_gpt":0.2511629988034114,"score_spread":0.22758598381688497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391092817","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.04492379,0.0001291057,0.95247084,0.00010224513,0.00002914628,0.000040146944,0.00005145299,0.000511194,0.0017421119],"genre_scores_gemma":[0.826655,0.000104473045,0.17133671,0.000085070555,0.00002314058,0.00006551037,0.000109239,0.000023793358,0.0015969931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996507,0.00012700376,0.00001423613,0.000048998365,0.000095419164,0.00006359718],"domain_scores_gemma":[0.9994141,0.0002771909,0.000067505294,0.000113740796,0.00008569409,0.0000418019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048297565,0.0006238026,0.00051769987,0.00023871302,0.00038048925,0.0004052468,0.00062914187,0.00038125974,0.00096095464],"category_scores_gemma":[0.0015470977,0.00022827325,0.00028806544,0.0004314211,0.0005522357,0.0006696947,0.00094779383,0.0005547992,0.0002728072],"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.00056236214,0.00018016752,0.0022714986,0.000102884325,0.00005816014,0.0002955253,0.00014429753,0.64085907,0.039062127,0.01774014,0.0028550415,0.29586884],"study_design_scores_gemma":[0.000014030814,0.000055334513,0.00013818499,0.0000026577313,0.0000051157735,0.00006271764,0.000009084964,0.99282175,0.004222251,0.0023580072,0.0003031577,0.00000780972],"about_ca_topic_score_codex":0.0013084456,"about_ca_topic_score_gemma":0.0026080767,"teacher_disagreement_score":0.0013084456,"about_ca_system_score_codex":0.0003084992,"about_ca_system_score_gemma":0.0007369059,"threshold_uncertainty_score":0.0032146573},"labels":[],"label_agreement":null},{"id":"W4391467973","doi":"10.1109/tcomm.2024.3361504","title":"Two-Timescale Design for Simultaneous Transmitting and Reflecting RIS-Assisted Massive MIMO Systems With Imperfect CSI","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"Western University","funders":"Fundamental Research Funds for the Central Universities; Southeast University; National Natural Science Foundation of China","keywords":"MIMO; Imperfect; Electronic engineering; Computer science; Telecommunications; Engineering; Beamforming","score_opus":0.03868857414904158,"score_gpt":0.28771474013117754,"score_spread":0.24902616598213595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391467973","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.02492257,0.00020026889,0.97129434,0.00009280749,0.000037823367,0.000031510306,0.000028566155,0.00025586286,0.0031362253],"genre_scores_gemma":[0.87862736,0.00025672096,0.11932823,0.00012047988,0.00005128272,0.000084294814,0.0000518096,0.000027698852,0.0014520547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916625,0.00024574055,0.000036886493,0.0001432184,0.00029953534,0.000108296175],"domain_scores_gemma":[0.99912673,0.00033080703,0.00017557738,0.00013835917,0.00017080468,0.00005776757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346818,0.0009303113,0.0006346424,0.00024195376,0.0003136703,0.00070570986,0.00076757686,0.00045277504,0.001142517],"category_scores_gemma":[0.0019604845,0.00031062055,0.00040416332,0.0004868827,0.0005789078,0.0008301024,0.0009900408,0.0007077516,0.00041011072],"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.00032314387,0.00009001606,0.0013225335,0.00021808964,0.00008535384,0.00022395157,0.00026836386,0.80390793,0.05068216,0.025549976,0.0012787457,0.11604976],"study_design_scores_gemma":[0.000018577754,0.00024150495,0.0002085064,0.0000073846472,0.000018407287,0.00009142555,0.000026271038,0.9906082,0.0054587387,0.0024041492,0.0009015379,0.000015246008],"about_ca_topic_score_codex":0.00063431286,"about_ca_topic_score_gemma":0.0008832129,"teacher_disagreement_score":0.001142517,"about_ca_system_score_codex":0.0003866352,"about_ca_system_score_gemma":0.0005515127,"threshold_uncertainty_score":0.003885448},"labels":[],"label_agreement":null},{"id":"W4391677760","doi":"10.1109/tcomm.2024.3362973","title":"Performance of Multi-RIS-Aided Cell-Free Massive MIMO: Do More RISs Always Help?","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":14,"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, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Rician fading; Throughput; Spectral efficiency; Channel state information; Beamforming; Channel (broadcasting); Electronic engineering; Algorithm; Wireless; Fading; Computer network; Engineering; Telecommunications","score_opus":0.026610401920520225,"score_gpt":0.26838194155181927,"score_spread":0.24177153963129905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391677760","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.7700092,0.0017839744,0.21625236,0.00068243133,0.000079608544,0.0000293679,0.00011768746,0.0004038239,0.010641601],"genre_scores_gemma":[0.9959925,0.000118828175,0.0036035678,0.000040935123,0.000010038063,0.0000041327435,0.000014799389,0.000005936662,0.00020936978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994381,0.0001926377,0.000014605188,0.000077761804,0.00014779555,0.00012903652],"domain_scores_gemma":[0.9978538,0.0012450109,0.0002681984,0.00021939856,0.00030462537,0.000108928405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740549,0.00071094267,0.00064070337,0.00023135508,0.00028606015,0.00075485837,0.00053887296,0.00071063853,0.00065873796],"category_scores_gemma":[0.0028984533,0.00018724993,0.00029735145,0.0003893466,0.00078908773,0.0007354989,0.000721152,0.00051162916,0.00021443683],"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.0003965671,0.000070739,0.0031722859,0.00010796257,0.0000798324,0.00018066436,0.00007614415,0.94417536,0.026529787,0.003955999,0.00044589746,0.020808835],"study_design_scores_gemma":[0.000016005133,0.00025585972,0.00124361,0.0000121562225,0.000031086056,0.00009467958,0.000054247106,0.9872829,0.009613879,0.001232984,0.00014656864,0.000016016615],"about_ca_topic_score_codex":0.0014599026,"about_ca_topic_score_gemma":0.0019447339,"teacher_disagreement_score":0.0014599026,"about_ca_system_score_codex":0.00054994447,"about_ca_system_score_gemma":0.00050826283,"threshold_uncertainty_score":0.004622519},"labels":[],"label_agreement":null},{"id":"W4391849703","doi":"10.1109/tcomm.2024.3359723","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391849703","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.005114772,0.03792548,0.04053936,0.016561141,0.04390094,0.00044928357,0.008030233,0.0019268544,0.84555197],"genre_scores_gemma":[0.026563058,0.039825723,0.007129054,0.0022907413,0.0073394133,0.00017856949,0.01055494,0.00040720523,0.90571135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932253,0.00010047867,0.000044732882,0.00008786416,0.00036855845,0.00007574971],"domain_scores_gemma":[0.99737,0.00060439395,0.00011383805,0.00032897218,0.0013831198,0.00019968703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011064933,0.0010727303,0.0008805576,0.0018318858,0.0006726355,0.0026372708,0.00068774534,0.0016338325,0.28569832],"category_scores_gemma":[0.0035636248,0.00037086767,0.00035365362,0.0021296446,0.00042992693,0.0022294694,0.0011277877,0.0019663975,0.15411995],"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.00013679033,0.00007812818,0.0005908799,0.0003821806,0.000028106917,0.00008768159,0.00004481516,0.00057662243,0.001460359,0.015009632,0.7422255,0.23937926],"study_design_scores_gemma":[0.000018731635,0.00005155247,0.00081350806,0.000210865,0.00002582425,0.00018696183,0.00004444601,0.0013224275,0.0008033245,0.0042572916,0.9922512,0.000013865781],"about_ca_topic_score_codex":0.0019881318,"about_ca_topic_score_gemma":0.0032723632,"teacher_disagreement_score":0.28569832,"about_ca_system_score_codex":0.0011629525,"about_ca_system_score_gemma":0.0016166875,"threshold_uncertainty_score":0.9557561},"labels":[],"label_agreement":null},{"id":"W4391878022","doi":"10.1109/tcomm.2024.3366816","title":"Multi-Band Wireless Communication Networks: Fundamentals, Challenges, and Resource Allocation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"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 Manitoba; University of Victoria; University of Guelph; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Computer science; Computer network; Resource allocation; Wireless network; Resource management (computing); Telecommunications; Radio resource management; Distributed computing","score_opus":0.03237932125287004,"score_gpt":0.2570997276444319,"score_spread":0.22472040639156185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391878022","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.014688511,0.09209519,0.8346542,0.008561734,0.0010744408,0.00010592402,0.0001113002,0.0002228962,0.048485704],"genre_scores_gemma":[0.46681106,0.18954271,0.31846052,0.001842726,0.0036997406,0.00039046744,0.00025060173,0.00018435143,0.018817777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933344,0.00024357405,0.00002995796,0.00008856912,0.00022724782,0.00007714623],"domain_scores_gemma":[0.99946815,0.0003142281,0.000054843837,0.000054499767,0.00007630704,0.00003208016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097208633,0.00065908773,0.00048979337,0.0005128789,0.00060844317,0.0028350225,0.0010223185,0.001428566,0.0018856324],"category_scores_gemma":[0.0015854004,0.00039554425,0.00026174824,0.0011830408,0.0009200739,0.0034333318,0.0011898624,0.0023637647,0.0006591043],"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.000052454176,0.00008098378,0.0008649221,0.0007662241,0.000037825415,0.0002038353,0.0002308261,0.17074381,0.0048873606,0.535209,0.01128288,0.27563992],"study_design_scores_gemma":[0.000011225722,0.00013073164,0.00073574606,0.0005362827,0.000026289394,0.00063335814,0.0005034187,0.47424877,0.0030790605,0.34272122,0.17731692,0.000057038775],"about_ca_topic_score_codex":0.00095429196,"about_ca_topic_score_gemma":0.0011681853,"teacher_disagreement_score":0.0028350225,"about_ca_system_score_codex":0.0008842748,"about_ca_system_score_gemma":0.0008394159,"threshold_uncertainty_score":0.0064159036},"labels":[],"label_agreement":null},{"id":"W4391952694","doi":"10.1109/tcomm.2024.3367941","title":"Spectrally-Efficient Beamforming Design for STAR-RIS-Aided URLLC NOMA Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Noma; Beamforming; Computer science; Star (game theory); Electronic engineering; Telecommunications; Engineering; Telecommunications link; Physics","score_opus":0.051019262363660486,"score_gpt":0.2807499190507882,"score_spread":0.22973065668712772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952694","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.020632267,0.00016190673,0.9749289,0.00012599681,0.000020728687,0.000026898,0.000032875098,0.00009708287,0.003973315],"genre_scores_gemma":[0.76147056,0.0005767425,0.23381522,0.00012490108,0.000060385657,0.00018344096,0.00011641395,0.00004231206,0.003609973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999534,0.00019497029,0.000017905655,0.0000661348,0.0001242728,0.000062733576],"domain_scores_gemma":[0.9995977,0.0001886335,0.00007707624,0.000024133116,0.00008888493,0.000023572813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612109,0.00087159657,0.00053003186,0.00025680242,0.00023350024,0.0006899189,0.00052123045,0.00054545625,0.0015035514],"category_scores_gemma":[0.0010183821,0.00036323792,0.00040390698,0.00043578135,0.0005768682,0.00050740386,0.0005691981,0.00053051405,0.0005591004],"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.00016635911,0.000046696965,0.00061807845,0.00012955492,0.000049015256,0.00012803994,0.00012159573,0.89928234,0.028465867,0.021571836,0.0011900222,0.048230603],"study_design_scores_gemma":[0.000009892731,0.00006790876,0.000106473795,0.000005427183,0.000007935475,0.000025662459,0.000018520925,0.995243,0.0021172368,0.0018296207,0.0005601461,0.000008063162],"about_ca_topic_score_codex":0.0010678896,"about_ca_topic_score_gemma":0.0015266176,"teacher_disagreement_score":0.0015035514,"about_ca_system_score_codex":0.00040808963,"about_ca_system_score_gemma":0.00079026574,"threshold_uncertainty_score":0.0050299168},"labels":[],"label_agreement":null},{"id":"W4391952742","doi":"10.1109/tcomm.2024.3367784","title":"Performance Analysis of User-Centric Clustering and Limited Cooperation in Cell Free Architecture","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems 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":"University of British Columbia","funders":"Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Computer architecture; User-centered design; Architecture; Computer network; Human–computer interaction; Artificial intelligence","score_opus":0.012390946427618512,"score_gpt":0.22926695424423663,"score_spread":0.21687600781661812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952742","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.6423345,0.002171764,0.33267117,0.0005558631,0.00006991204,0.00010915124,0.00018653454,0.00068267167,0.02121846],"genre_scores_gemma":[0.994995,0.00020921118,0.004000902,0.00003167953,0.000011505595,0.000015423066,0.00002905187,0.000014496479,0.00069267116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981481,0.00060512475,0.000037477977,0.00019656094,0.00050957483,0.000503101],"domain_scores_gemma":[0.99428743,0.002603725,0.0006905882,0.0004235276,0.0017470757,0.0002476744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018750144,0.001009585,0.0007875203,0.0008599071,0.0007541109,0.00092591974,0.0011670553,0.0008429254,0.0011437655],"category_scores_gemma":[0.006207611,0.00028242506,0.00047030585,0.0011864834,0.0011620584,0.00083628873,0.0011816066,0.00051554176,0.00023727055],"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.00013022164,0.000026309972,0.0018930694,0.000047267124,0.00003947945,0.00011391165,0.00008053263,0.98010135,0.0035053648,0.00782295,0.00052872766,0.0057108095],"study_design_scores_gemma":[0.0000028793127,0.000069451686,0.000594011,0.0000033666076,0.000014657917,0.000071091024,0.000031044365,0.9972691,0.0009349098,0.000905883,0.000092854316,0.000010745409],"about_ca_topic_score_codex":0.012042637,"about_ca_topic_score_gemma":0.006864236,"teacher_disagreement_score":0.012042637,"about_ca_system_score_codex":0.0024971815,"about_ca_system_score_gemma":0.0014941649,"threshold_uncertainty_score":0.023945093},"labels":[],"label_agreement":null},{"id":"W4392172655","doi":"10.1109/tcomm.2024.3369731","title":"Performance-Complexity-Latency Trade-Offs of Concatenated RS-BCH Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of Toronto","funders":"","keywords":"BCH code; Computer science; Concatenated error correction code; Serial concatenated convolutional codes; Turbo code; Decoding methods; Block code; Algorithm","score_opus":0.07034727249593856,"score_gpt":0.3143094297924595,"score_spread":0.24396215729652096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172655","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.6802579,0.0026407756,0.27510405,0.0010337294,0.00006585404,0.0001946418,0.00046017877,0.00043900078,0.039803855],"genre_scores_gemma":[0.9824723,0.00047961157,0.014992331,0.00005731966,0.00003202916,0.00007050546,0.000086283995,0.000073451105,0.0017362109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712354,0.00090768636,0.00010909103,0.00017029617,0.001150894,0.0005385388],"domain_scores_gemma":[0.9762831,0.019451616,0.0015668613,0.0008677333,0.0015514523,0.0002792714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039042172,0.0013961629,0.0009169626,0.0020381778,0.0008622388,0.0020979543,0.001053054,0.0011465116,0.0019841054],"category_scores_gemma":[0.020397317,0.00044943925,0.0005484311,0.0018924988,0.0014570118,0.0017920118,0.0012174271,0.0008570273,0.00041168203],"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.00020776784,0.000056972433,0.00073885865,0.00007289972,0.000023402543,0.00019072159,0.00009483121,0.93900335,0.0055047935,0.043621223,0.00031135973,0.010173798],"study_design_scores_gemma":[0.000013758955,0.00014735444,0.0005132758,0.000034256216,0.000017029819,0.00014657587,0.00005192625,0.9727079,0.0053524524,0.020736653,0.00025429408,0.000024536483],"about_ca_topic_score_codex":0.002009884,"about_ca_topic_score_gemma":0.0023258817,"teacher_disagreement_score":0.0039042172,"about_ca_system_score_codex":0.0028327908,"about_ca_system_score_gemma":0.0019798637,"threshold_uncertainty_score":0.020647764},"labels":[],"label_agreement":null},{"id":"W4392824349","doi":"10.1109/tcomm.2024.3375815","title":"Secure Transmission of UAV Control Information via NOMA","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Western University","funders":"Natural Science Foundation of Anhui Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Noma; Transmission (telecommunications); Computer science; Computer network; Information transmission; Control (management); Electronic engineering; Telecommunications; Engineering; Telecommunications link","score_opus":0.006643681355305813,"score_gpt":0.21452768196223632,"score_spread":0.2078840006069305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392824349","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.23070265,0.0017276506,0.7524729,0.00047718745,0.000120371915,0.00006966545,0.00018631908,0.00020096272,0.014042314],"genre_scores_gemma":[0.9872432,0.0003335325,0.01136029,0.000034151017,0.000018199431,0.00002760856,0.00002929195,0.0000052596265,0.00094853673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.0001855607,0.000026517564,0.00007327917,0.0001537921,0.000099052864],"domain_scores_gemma":[0.99906605,0.0004804399,0.000214251,0.00009755214,0.000115401104,0.000026286194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885501,0.00084476714,0.00052509987,0.00037983982,0.00074093655,0.00073966815,0.0003474561,0.00047747593,0.0007475997],"category_scores_gemma":[0.001909984,0.00020319803,0.0002983237,0.0005068325,0.0007923571,0.0008429017,0.0010636568,0.000398514,0.00022338101],"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.00036882912,0.000053832882,0.0021695057,0.00018911589,0.00006670335,0.00065850205,0.00018146556,0.89302224,0.02334631,0.04121118,0.0011068067,0.037625566],"study_design_scores_gemma":[0.000009653768,0.00011890513,0.00034146308,0.00001159804,0.000014909104,0.00011396086,0.00004446827,0.9891571,0.0052212817,0.0043269442,0.00062740315,0.0000123807495],"about_ca_topic_score_codex":0.0016892923,"about_ca_topic_score_gemma":0.0022328396,"teacher_disagreement_score":0.0016892923,"about_ca_system_score_codex":0.00051692495,"about_ca_system_score_gemma":0.0005998456,"threshold_uncertainty_score":0.0037505627},"labels":[],"label_agreement":null},{"id":"W4392824812","doi":"10.1109/tcomm.2024.3375816","title":"Joint Spectrum, Precoding, and Phase Shifts Design for RIS-Aided Multiuser MIMO THz Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":27,"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":"Precoding; Electronic engineering; Joint (building); MIMO; Zero-forcing precoding; Computer science; Telecommunications; Engineering; Physics; Electrical engineering; Beamforming","score_opus":0.08285189962042602,"score_gpt":0.3117082542903233,"score_spread":0.22885635466989726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392824812","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.022078173,0.00010319267,0.97488016,0.00008114298,0.000019083373,0.00003250782,0.00003709052,0.0001985378,0.002570166],"genre_scores_gemma":[0.8060119,0.00021364324,0.19124655,0.00010183018,0.000026714133,0.00010209992,0.00010250325,0.000044195545,0.002150589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968123,0.00009209528,0.000011862367,0.000071753704,0.00010016889,0.000042770404],"domain_scores_gemma":[0.9997296,0.000092392336,0.000056868852,0.000026032832,0.00007296953,0.000022184693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033051803,0.000747062,0.00038834312,0.00032110914,0.00023681311,0.0004925383,0.0008639716,0.00044070918,0.0013416909],"category_scores_gemma":[0.00068575237,0.00025174685,0.00034202336,0.00041146725,0.0004256743,0.00059953186,0.00044837012,0.00043260964,0.00033615885],"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.00015537099,0.00007748236,0.00054738176,0.00007121541,0.000047382808,0.00010186553,0.00007149086,0.8593251,0.03241612,0.013613474,0.0008436317,0.092729405],"study_design_scores_gemma":[0.000014604047,0.00009344241,0.00009653721,0.000003275993,0.000011126513,0.000033746615,0.000011933214,0.99216557,0.004566551,0.002408021,0.0005886211,0.000006523465],"about_ca_topic_score_codex":0.0015900007,"about_ca_topic_score_gemma":0.002968703,"teacher_disagreement_score":0.0015900007,"about_ca_system_score_codex":0.0005476351,"about_ca_system_score_gemma":0.00070623966,"threshold_uncertainty_score":0.0044884086},"labels":[],"label_agreement":null},{"id":"W4392910296","doi":"10.1109/tcomm.2024.3371758","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392910296","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.005114772,0.03792548,0.04053936,0.016561141,0.04390094,0.00044928357,0.008030233,0.0019268544,0.84555197],"genre_scores_gemma":[0.026563058,0.039825723,0.007129054,0.0022907413,0.0073394133,0.00017856949,0.01055494,0.00040720523,0.90571135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932253,0.00010047867,0.000044732882,0.00008786416,0.00036855845,0.00007574971],"domain_scores_gemma":[0.99737,0.00060439395,0.00011383805,0.00032897218,0.0013831198,0.00019968703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011064933,0.0010727303,0.0008805576,0.0018318858,0.0006726355,0.0026372708,0.00068774534,0.0016338325,0.28569832],"category_scores_gemma":[0.0035636248,0.00037086767,0.00035365362,0.0021296446,0.00042992693,0.0022294694,0.0011277877,0.0019663975,0.15411995],"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.00013679033,0.00007812818,0.0005908799,0.0003821806,0.000028106917,0.00008768159,0.00004481516,0.00057662243,0.001460359,0.015009632,0.7422255,0.23937926],"study_design_scores_gemma":[0.000018731635,0.00005155247,0.00081350806,0.000210865,0.00002582425,0.00018696183,0.00004444601,0.0013224275,0.0008033245,0.0042572916,0.9922512,0.000013865781],"about_ca_topic_score_codex":0.0019881318,"about_ca_topic_score_gemma":0.0032723632,"teacher_disagreement_score":0.7143017,"about_ca_system_score_codex":0.0011629525,"about_ca_system_score_gemma":0.0016166875,"threshold_uncertainty_score":0.9557561},"labels":[],"label_agreement":null},{"id":"W4392940210","doi":"10.1109/tcomm.2024.3379368","title":"Distributed-Optimization With Centralized-Refining for Efficient Resource Allocation in Future Wireless Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Computer science; Resource allocation; Wireless; Distributed computing; Refining (metallurgy); Wireless network; Computer network; Resource management (computing); Telecommunications","score_opus":0.010284369780962782,"score_gpt":0.23265946193595569,"score_spread":0.2223750921549929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392940210","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.008705756,0.00015096468,0.989342,0.000089702626,0.000014374198,0.000028722787,0.000009454614,0.00009863206,0.0015604534],"genre_scores_gemma":[0.7937927,0.00032399074,0.20358567,0.000097238764,0.00003224152,0.00012432071,0.000047833917,0.00006755127,0.0019283762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999388,0.00024848263,0.000018504346,0.00010916874,0.00016318362,0.00007267463],"domain_scores_gemma":[0.9995271,0.00022679189,0.00006967408,0.0000711057,0.000084168605,0.000021168613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014449739,0.0008177111,0.00077094085,0.0003591265,0.00046656645,0.0006901704,0.00097131747,0.0005161404,0.0010038213],"category_scores_gemma":[0.0017181558,0.00030404056,0.0005801169,0.0006859726,0.00079320814,0.0009050632,0.0007749821,0.0008457022,0.00012471947],"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.000022665847,0.000026441505,0.0001815577,0.000023358969,0.000015956331,0.000021176053,0.00001553509,0.9709646,0.0011129758,0.012563176,0.00043796404,0.014614556],"study_design_scores_gemma":[0.000005930011,0.000014273531,0.000048886774,0.0000015491354,0.0000030246774,0.0000059809454,0.0000043273894,0.9953511,0.0002718631,0.0040706787,0.00021970336,0.0000026182993],"about_ca_topic_score_codex":0.004633475,"about_ca_topic_score_gemma":0.0047442857,"teacher_disagreement_score":0.004633475,"about_ca_system_score_codex":0.00091170415,"about_ca_system_score_gemma":0.001420117,"threshold_uncertainty_score":0.00921303},"labels":[],"label_agreement":null},{"id":"W4393118835","doi":"10.1109/tcomm.2024.3381726","title":"Learning-to-Learn the Wave Angle Estimation","year":2024,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Speech and Audio Processing","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":"Polytechnique Montréal","funders":"","keywords":"Estimation; Computer science; Artificial intelligence; Economics; Management","score_opus":0.04476140233275326,"score_gpt":0.3017466270132261,"score_spread":0.2569852246804728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393118835","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.036034424,0.0003962764,0.96092534,0.00020933621,0.000046214598,0.000032915297,0.00009811962,0.0008377986,0.0014194993],"genre_scores_gemma":[0.83379906,0.00023452114,0.16193254,0.00024003183,0.000070662834,0.0001333088,0.00057035516,0.000107118176,0.0029123917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999526,0.00015320195,0.000028517035,0.0001431326,0.000082130115,0.000067038534],"domain_scores_gemma":[0.99887913,0.00057608064,0.0001034798,0.00017617116,0.00021844856,0.0000465803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008671903,0.0009839034,0.001022789,0.00042448728,0.0003007554,0.00091468904,0.0014249613,0.0013635436,0.0013954684],"category_scores_gemma":[0.0036185896,0.0004301557,0.0007582346,0.00042957172,0.00046405153,0.0011518098,0.0012546554,0.0017346068,0.00062809075],"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.00012491531,0.0001031429,0.0012131149,0.00009413379,0.00007516862,0.000063329004,0.00007630009,0.8562354,0.0031112018,0.0040639886,0.0013293959,0.13350998],"study_design_scores_gemma":[0.0000020337422,0.000023862167,0.00006729648,0.000004255484,0.0000039671713,0.000010193208,0.000006130521,0.9975853,0.00071335305,0.0014521063,0.00012905365,0.000002372017],"about_ca_topic_score_codex":0.0025044065,"about_ca_topic_score_gemma":0.0023079638,"teacher_disagreement_score":0.0025044065,"about_ca_system_score_codex":0.00059153803,"about_ca_system_score_gemma":0.00091309735,"threshold_uncertainty_score":0.00497967},"labels":[],"label_agreement":null},{"id":"W4393241092","doi":"10.1109/tcomm.2024.3382328","title":"Exploiting Parity-Polytope Geometry in Approximate and Randomized Scheduled ADMM-LP Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","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 Toronto","funders":"","keywords":"Polytope; Decoding methods; Parity (physics); Mathematics; Computer science; Combinatorics; Algorithm; Mathematical optimization; Physics","score_opus":0.022132572506266306,"score_gpt":0.2540489958127179,"score_spread":0.2319164233064516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393241092","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.005250819,0.00006959768,0.9931954,0.00013071264,0.000020375164,0.000020215179,0.000033965393,0.0002580465,0.001020823],"genre_scores_gemma":[0.23809205,0.00023990276,0.7581177,0.00022119562,0.00007160757,0.00024460084,0.00028715286,0.0001558413,0.0025699376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990589,0.00037469293,0.000036053236,0.00012464436,0.00030671156,0.00009897121],"domain_scores_gemma":[0.9983115,0.0010138995,0.00012209515,0.0002845449,0.0002039101,0.000064120584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015025337,0.0013197599,0.0011487457,0.00050829287,0.00044601873,0.0013218266,0.0012167472,0.0011326338,0.0021873906],"category_scores_gemma":[0.0056807008,0.0005798709,0.00060516485,0.00082396215,0.0014188044,0.0016924993,0.0017742383,0.0017382147,0.0007990965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013801,0.00004062884,0.00031318312,0.0000775014,0.000025391346,0.00009329118,0.00006008942,0.89503795,0.0030803978,0.047944203,0.0015445343,0.051644895],"study_design_scores_gemma":[0.000011918609,0.000029078972,0.000023612465,0.0000047938156,0.000002316297,0.000015285957,0.000005339999,0.98670006,0.0010163469,0.0118348,0.00035097453,0.0000054743646],"about_ca_topic_score_codex":0.0030291881,"about_ca_topic_score_gemma":0.004176106,"teacher_disagreement_score":0.0030291881,"about_ca_system_score_codex":0.00086230825,"about_ca_system_score_gemma":0.0028679944,"threshold_uncertainty_score":0.007946253},"labels":[],"label_agreement":null},{"id":"W4394805297","doi":"10.1109/tcomm.2024.3388501","title":"Multi-UAV Aided Multi-Access Edge Computing in Marine Communication Networks: A Joint System-Welfare and Energy-Efficient Design","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":24,"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 New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; National Research Foundation","keywords":"Joint (building); Computer science; Enhanced Data Rates for GSM Evolution; Communications system; Efficient energy use; Telecommunications; Energy (signal processing); Computer network; Engineering; Electrical engineering","score_opus":0.07157588372520994,"score_gpt":0.2966938969345554,"score_spread":0.22511801320934544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394805297","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.037147433,0.00037563342,0.95768595,0.00025046195,0.00003468382,0.00009702544,0.000039936524,0.000091503614,0.004277421],"genre_scores_gemma":[0.8739497,0.0005348767,0.122800775,0.00010091016,0.00003179506,0.00021572178,0.00006795676,0.00003963172,0.0022586288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944955,0.00017454277,0.00002016825,0.0000938228,0.0001318453,0.00013008922],"domain_scores_gemma":[0.9996557,0.0001239974,0.000052084437,0.000030943498,0.0000954119,0.000041775373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057317014,0.0007915326,0.0006334055,0.00035313852,0.00050231855,0.0012195116,0.0008618774,0.0005891187,0.0015253469],"category_scores_gemma":[0.001083451,0.00026484038,0.00052992936,0.0005073337,0.0005115738,0.00086312904,0.0010902778,0.00062858476,0.00018968341],"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.000067784145,0.00005507534,0.0008078121,0.00010932011,0.000026978027,0.0001223957,0.000049514347,0.94093376,0.009115212,0.015822364,0.00082744495,0.03206231],"study_design_scores_gemma":[0.0000035253493,0.000036714002,0.00008261353,0.000004354425,0.000005569586,0.00001858697,0.00001709256,0.99682224,0.00074725976,0.0018785115,0.00038060467,0.000002921157],"about_ca_topic_score_codex":0.0021828744,"about_ca_topic_score_gemma":0.0030726357,"teacher_disagreement_score":0.0021828744,"about_ca_system_score_codex":0.0009058629,"about_ca_system_score_gemma":0.0012355838,"threshold_uncertainty_score":0.006572485},"labels":[],"label_agreement":null},{"id":"W4394894309","doi":"10.1109/tcomm.2024.3384855","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394894309","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.005114772,0.03792548,0.04053936,0.016561141,0.04390094,0.00044928357,0.008030233,0.0019268544,0.84555197],"genre_scores_gemma":[0.026563058,0.039825723,0.007129054,0.0022907413,0.0073394133,0.00017856949,0.01055494,0.00040720523,0.90571135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932253,0.00010047867,0.000044732882,0.00008786416,0.00036855845,0.00007574971],"domain_scores_gemma":[0.99737,0.00060439395,0.00011383805,0.00032897218,0.0013831198,0.00019968703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011064933,0.0010727303,0.0008805576,0.0018318858,0.0006726355,0.0026372708,0.00068774534,0.0016338325,0.28569832],"category_scores_gemma":[0.0035636248,0.00037086767,0.00035365362,0.0021296446,0.00042992693,0.0022294694,0.0011277877,0.0019663975,0.15411995],"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.00013679033,0.00007812818,0.0005908799,0.0003821806,0.000028106917,0.00008768159,0.00004481516,0.00057662243,0.001460359,0.015009632,0.7422255,0.23937926],"study_design_scores_gemma":[0.000018731635,0.00005155247,0.00081350806,0.000210865,0.00002582425,0.00018696183,0.00004444601,0.0013224275,0.0008033245,0.0042572916,0.9922512,0.000013865781],"about_ca_topic_score_codex":0.0019881318,"about_ca_topic_score_gemma":0.0032723632,"teacher_disagreement_score":0.7143017,"about_ca_system_score_codex":0.0011629525,"about_ca_system_score_gemma":0.0016166875,"threshold_uncertainty_score":0.9557561},"labels":[],"label_agreement":null},{"id":"W4395056573","doi":"10.1109/tcomm.2024.3392801","title":"Toward Generic Cross-Modal Transmission Strategy","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":15,"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":"Natural Science Research of Jiangsu Higher Education Institutions of China; National Natural Science Foundation of China","keywords":"Electronic engineering; Computer science; Transmission (telecommunications); Modal; Telecommunications; Engineering; Materials science","score_opus":0.047068633690698976,"score_gpt":0.29647147032742865,"score_spread":0.24940283663672969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395056573","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.012678127,0.00022742902,0.98376393,0.00018103194,0.000032084026,0.00007081414,0.000037784073,0.00045263013,0.0025562167],"genre_scores_gemma":[0.69242674,0.00043934115,0.30110067,0.00043724538,0.0001092536,0.00022336547,0.00024373684,0.00011273652,0.0049069976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840575,0.00048314722,0.00010788452,0.00034511293,0.00046815083,0.000190035],"domain_scores_gemma":[0.9977508,0.0007368278,0.00022518713,0.0005745175,0.000581529,0.00013116623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024090458,0.0011644408,0.0007389703,0.00073233305,0.00066024764,0.0010776833,0.0017092216,0.0012594033,0.0025536292],"category_scores_gemma":[0.004220034,0.0002989686,0.00049110566,0.0005456055,0.0011289815,0.0025060507,0.0031069752,0.0013528133,0.00082375854],"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.0010069285,0.00043857688,0.0018288397,0.0005569362,0.00016868704,0.0010990213,0.000998432,0.22764474,0.15263343,0.16009034,0.009208153,0.4443259],"study_design_scores_gemma":[0.000051672152,0.00029025413,0.000379546,0.00003196029,0.000047201196,0.0005837835,0.00020415384,0.93000233,0.026303044,0.036707036,0.005357111,0.000041824],"about_ca_topic_score_codex":0.0008722275,"about_ca_topic_score_gemma":0.0008741107,"teacher_disagreement_score":0.0025536292,"about_ca_system_score_codex":0.00053141214,"about_ca_system_score_gemma":0.0010153039,"threshold_uncertainty_score":0.012740374},"labels":[],"label_agreement":null},{"id":"W4395680492","doi":"10.1109/tcomm.2024.3393977","title":"Multipath Identification, User Localization, and Environment Mapping in Radio SLAM","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Multipath propagation; Computer science; Identification (biology); Simultaneous localization and mapping; Mobile radio; Electronic engineering; Telecommunications; Engineering; Artificial intelligence; Mobile robot; Robot","score_opus":0.017238302473879533,"score_gpt":0.2263310459018137,"score_spread":0.20909274342793416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395680492","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.0019255881,0.0011768201,0.9949911,0.00013926835,0.00012228865,0.00002100569,0.000026998556,0.00031057684,0.001286346],"genre_scores_gemma":[0.3145861,0.004666127,0.6750867,0.00022850868,0.000593727,0.00023046094,0.0002441951,0.00023382668,0.0041304403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714017,0.0011702979,0.00012794817,0.00051388977,0.0007536881,0.00029406653],"domain_scores_gemma":[0.99902034,0.00037207108,0.00012579947,0.00027873577,0.00015096224,0.00005207333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020294026,0.001307347,0.0010880812,0.0014732976,0.0010248282,0.0018678833,0.0015566495,0.0016097848,0.0009333738],"category_scores_gemma":[0.0043358766,0.00086459256,0.00095384294,0.0032555598,0.002133976,0.0033737447,0.0027905537,0.0023036858,0.00077452516],"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.00014470633,0.00006503326,0.0019888263,0.0003717247,0.00012256169,0.00036634502,0.00038298356,0.4655939,0.0061097816,0.1917918,0.00496111,0.3281013],"study_design_scores_gemma":[0.000017210356,0.00011465546,0.0011049008,0.00008246526,0.000053580574,0.00031300893,0.0001450563,0.85308063,0.0038260533,0.11653475,0.024632765,0.000094867515],"about_ca_topic_score_codex":0.00763961,"about_ca_topic_score_gemma":0.006344823,"teacher_disagreement_score":0.00763961,"about_ca_system_score_codex":0.0010461779,"about_ca_system_score_gemma":0.0015496144,"threshold_uncertainty_score":0.015190303},"labels":[],"label_agreement":null},{"id":"W4396564070","doi":"10.1109/tcomm.2024.3392785","title":"Multiplexed Streaming Codes for Multi-Hop Multi-Link Communication Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Erasure; Multiplexing; Hop (telecommunications); Telecommunications","score_opus":0.11563991827086129,"score_gpt":0.35260650149080514,"score_spread":0.23696658321994385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396564070","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.019667834,0.0018885711,0.9750158,0.00027775136,0.00006807544,0.000059273367,0.00006305329,0.00014280365,0.0028167996],"genre_scores_gemma":[0.7308689,0.0030023195,0.2597219,0.00018729162,0.00017785255,0.00020862371,0.00012946813,0.000072943425,0.005630743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952626,0.00017842047,0.000016662643,0.000048430076,0.00018317421,0.00004704527],"domain_scores_gemma":[0.9986627,0.0008697246,0.00014069691,0.000112089845,0.00016832794,0.00004643503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007975845,0.00064113707,0.0003777852,0.0006134713,0.00039287048,0.0005805278,0.0007280698,0.00066832296,0.0015354626],"category_scores_gemma":[0.002803836,0.00023252117,0.00024442057,0.00088868476,0.0006192535,0.0011556305,0.0006318029,0.0009878295,0.00029096616],"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.00007713277,0.000043812754,0.00033260667,0.00018835985,0.000028115028,0.00009561777,0.00008001004,0.77639055,0.007069341,0.1355955,0.0016477862,0.07845114],"study_design_scores_gemma":[0.000005451904,0.000038025977,0.000053758813,0.000011620949,0.000005165571,0.000039150375,0.000009154564,0.97614163,0.0013812906,0.021023275,0.0012831928,0.000008171518],"about_ca_topic_score_codex":0.0019356388,"about_ca_topic_score_gemma":0.0021986344,"teacher_disagreement_score":0.0019356388,"about_ca_system_score_codex":0.0011799234,"about_ca_system_score_gemma":0.0008325244,"threshold_uncertainty_score":0.0085609555},"labels":[],"label_agreement":null},{"id":"W4396980047","doi":"10.1109/tcomm.2024.3397105","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396980047","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.005114772,0.03792548,0.04053936,0.016561141,0.04390094,0.00044928357,0.008030233,0.0019268544,0.84555197],"genre_scores_gemma":[0.026563058,0.039825723,0.007129054,0.0022907413,0.0073394133,0.00017856949,0.01055494,0.00040720523,0.90571135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932253,0.00010047867,0.000044732882,0.00008786416,0.00036855845,0.00007574971],"domain_scores_gemma":[0.99737,0.00060439395,0.00011383805,0.00032897218,0.0013831198,0.00019968703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011064933,0.0010727303,0.0008805576,0.0018318858,0.0006726355,0.0026372708,0.00068774534,0.0016338325,0.28569832],"category_scores_gemma":[0.0035636248,0.00037086767,0.00035365362,0.0021296446,0.00042992693,0.0022294694,0.0011277877,0.0019663975,0.15411995],"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.00013679033,0.00007812818,0.0005908799,0.0003821806,0.000028106917,0.00008768159,0.00004481516,0.00057662243,0.001460359,0.015009632,0.7422255,0.23937926],"study_design_scores_gemma":[0.000018731635,0.00005155247,0.00081350806,0.000210865,0.00002582425,0.00018696183,0.00004444601,0.0013224275,0.0008033245,0.0042572916,0.9922512,0.000013865781],"about_ca_topic_score_codex":0.0019881318,"about_ca_topic_score_gemma":0.0032723632,"teacher_disagreement_score":0.7143017,"about_ca_system_score_codex":0.0011629525,"about_ca_system_score_gemma":0.0016166875,"threshold_uncertainty_score":0.9557561},"labels":[],"label_agreement":null},{"id":"W4399110347","doi":"10.1109/tcomm.2024.3406400","title":"Latency Minimization for UAV-Assisted MEC Networks With Blockchain","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":17,"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":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Minification; Latency (audio); Computer network; Real-time computing; Embedded system; Telecommunications; Computer security","score_opus":0.033568293356906524,"score_gpt":0.2726619263693608,"score_spread":0.2390936330124543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399110347","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.14371185,0.00093394425,0.84487206,0.00043931665,0.00007002705,0.00009587174,0.00015337161,0.00021522341,0.009508222],"genre_scores_gemma":[0.9563087,0.00033600515,0.039770547,0.000047534057,0.000018129409,0.00008377663,0.000104678955,0.0000276518,0.0033029856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973637,0.000073881165,0.000008232469,0.0000470399,0.00005579195,0.00007874599],"domain_scores_gemma":[0.9994368,0.00033322276,0.00006890029,0.00003601171,0.0000862373,0.000038822218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046050118,0.00073604967,0.00053295493,0.00027945382,0.0005609767,0.0006496261,0.00075148616,0.00055443787,0.0020245789],"category_scores_gemma":[0.0012295487,0.00022246642,0.00021468171,0.00053598866,0.00041915756,0.0010228889,0.0008386392,0.00053205405,0.00022736484],"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.00007995539,0.000028302331,0.00029621564,0.000043644544,0.00000887289,0.0000686263,0.000032301694,0.97493863,0.0025338153,0.007697999,0.00078527565,0.013486452],"study_design_scores_gemma":[0.00000358296,0.000015675163,0.000029761157,0.0000013473118,0.0000011584863,0.000007417088,0.000006865346,0.99816656,0.00027279826,0.0013560525,0.00013744895,0.0000013547306],"about_ca_topic_score_codex":0.0055235256,"about_ca_topic_score_gemma":0.0069951424,"teacher_disagreement_score":0.0055235256,"about_ca_system_score_codex":0.001102785,"about_ca_system_score_gemma":0.0012022079,"threshold_uncertainty_score":0.010982752},"labels":[],"label_agreement":null},{"id":"W4399169098","doi":"10.1109/tcomm.2024.3407208","title":"Decentralized Federated Learning Over Imperfect Communication Channels","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Imperfect; Computer science; Computer network; Telecommunications; Distributed computing","score_opus":0.04205023638544281,"score_gpt":0.3145488807666332,"score_spread":0.27249864438119037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169098","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.12332662,0.0002843806,0.8725204,0.0004691873,0.00006223394,0.00007837311,0.00009889364,0.00081146654,0.0023485066],"genre_scores_gemma":[0.9789909,0.000054677686,0.019870063,0.000072245064,0.00002059691,0.000054017382,0.00004740722,0.000020536383,0.00086965517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975605,0.0008522188,0.00011393583,0.0006204702,0.00040646634,0.00044642022],"domain_scores_gemma":[0.99011874,0.005200474,0.001012263,0.0018491226,0.0014042439,0.0004151388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004232144,0.0008836136,0.0017645656,0.0005059707,0.00095441705,0.0015653595,0.0019116256,0.0012197613,0.0011232852],"category_scores_gemma":[0.015178402,0.00042662164,0.0004437782,0.00068347953,0.0015855167,0.0032090216,0.0024590446,0.0016277691,0.00025579368],"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.0002618315,0.00007227321,0.0010599267,0.000049247003,0.000029275297,0.00006904221,0.00006888858,0.9568722,0.0011668032,0.008184272,0.0006292783,0.031536933],"study_design_scores_gemma":[0.000009784577,0.00003810093,0.000119494325,0.000004540026,0.0000049414043,0.000015032457,0.000017498527,0.9932861,0.0005716993,0.005803524,0.00012479573,0.0000046332534],"about_ca_topic_score_codex":0.0030311674,"about_ca_topic_score_gemma":0.0027556259,"teacher_disagreement_score":0.004232144,"about_ca_system_score_codex":0.0013878333,"about_ca_system_score_gemma":0.0020009123,"threshold_uncertainty_score":0.022381961},"labels":[],"label_agreement":null},{"id":"W4399486976","doi":"10.1109/tcomm.2024.3411769","title":"Robust Security Energy Efficiency Optimization for RIS-Aided Cell-Free Networks With Multiple Eavesdroppers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":32,"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; Université Laval","funders":"National Mobile Communications Research Laboratory, Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Efficient energy use; Energy (signal processing); Electronic engineering; Computer network; Engineering; Electrical engineering","score_opus":0.015550724406221848,"score_gpt":0.2173430108017894,"score_spread":0.20179228639556754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399486976","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.035077292,0.0002492801,0.9613292,0.00015282765,0.000018569295,0.000021128755,0.000036934172,0.00007427711,0.0030405698],"genre_scores_gemma":[0.96043795,0.00033729992,0.03620053,0.00006686826,0.000019015915,0.00006728111,0.000056360084,0.000026657119,0.002788041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00016880386,0.000015626603,0.00011108913,0.00013136519,0.00010201347],"domain_scores_gemma":[0.99929214,0.00044139737,0.00010943771,0.000042806714,0.000088760025,0.000025460724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007669689,0.0011564421,0.0008535067,0.00029419461,0.00029199105,0.0010113134,0.00064262765,0.0007244774,0.0011829406],"category_scores_gemma":[0.0016180659,0.0003325789,0.0004539804,0.00053654786,0.0009973842,0.0011359255,0.0009268479,0.0006999476,0.0002012151],"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.00005519857,0.000014816833,0.0003138607,0.00003424048,0.000021286485,0.00008116659,0.000027071106,0.9774655,0.0031159353,0.011973637,0.00021199383,0.0066853105],"study_design_scores_gemma":[0.0000040860946,0.000019447521,0.000064949956,0.0000021160445,0.0000050596846,0.000013390481,0.000009940669,0.99640346,0.0008729001,0.002464691,0.00013670202,0.000003374034],"about_ca_topic_score_codex":0.0015538365,"about_ca_topic_score_gemma":0.0011164597,"teacher_disagreement_score":0.0015538365,"about_ca_system_score_codex":0.00094838,"about_ca_system_score_gemma":0.00072363624,"threshold_uncertainty_score":0.006881058},"labels":[],"label_agreement":null},{"id":"W4399728424","doi":"10.1109/tcomm.2024.3415611","title":"Coverage Analysis of Single-Swarm mmWave UAV Networks Under Multiple Types of Blockages","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Key Research and Development Projects of Shaanxi Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Swarm behaviour; Electronic engineering; Computer network; Engineering; Artificial intelligence","score_opus":0.02220172154341891,"score_gpt":0.24211430117842742,"score_spread":0.21991257963500851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728424","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.81883335,0.0013134427,0.17407714,0.0003174422,0.000029032746,0.000036453544,0.00018014561,0.00012276632,0.0050902767],"genre_scores_gemma":[0.99798846,0.00025575823,0.0012905245,0.000013480385,0.000009060623,0.000009098628,0.00004372613,0.000005397672,0.00038447246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997218,0.000071401926,0.000008780329,0.000042553896,0.0000689246,0.00008645708],"domain_scores_gemma":[0.99871707,0.0006846873,0.0002925959,0.00004918077,0.00019061328,0.000065789056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262977,0.0004487081,0.00039627645,0.0005690121,0.0002628804,0.00046145826,0.0005567826,0.0004957942,0.0005687886],"category_scores_gemma":[0.001828164,0.00016803958,0.00038997602,0.0004284743,0.00049981865,0.0006697525,0.000573006,0.0002470922,0.00007548459],"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.000088326284,0.000013028599,0.0055777524,0.000045448785,0.00003470488,0.00024249329,0.00006976032,0.97994107,0.0055755,0.00379196,0.00029898694,0.004321033],"study_design_scores_gemma":[0.0000015562272,0.000020703463,0.0014468891,0.0000027791793,0.000007787491,0.00004420877,0.000030687886,0.9974904,0.0004151788,0.00048749847,0.00004929968,0.0000029589994],"about_ca_topic_score_codex":0.009296077,"about_ca_topic_score_gemma":0.0032434203,"teacher_disagreement_score":0.009296077,"about_ca_system_score_codex":0.00090002595,"about_ca_system_score_gemma":0.00030766943,"threshold_uncertainty_score":0.018483937},"labels":[],"label_agreement":null},{"id":"W4399728456","doi":"10.1109/tcomm.2024.3415608","title":"Age of Information Minimization for Opportunistic Channel Access","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Minification; Computer science; Channel (broadcasting); Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.06464501266160738,"score_gpt":0.31630535704874535,"score_spread":0.25166034438713797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728456","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.024219606,0.0008962934,0.9692899,0.00028006622,0.000071139904,0.00004095953,0.00008086378,0.00009618695,0.0050249267],"genre_scores_gemma":[0.8919906,0.0010363432,0.100515395,0.00019725533,0.00016450507,0.00013993315,0.00013969048,0.0001006842,0.005715608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991412,0.0003000725,0.000034771612,0.00014845857,0.00023718861,0.00013834523],"domain_scores_gemma":[0.9982374,0.0011432562,0.00019358289,0.000092189344,0.00025177305,0.00008169954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012639505,0.0009906981,0.0010062788,0.00052872376,0.00035883015,0.0010201951,0.0008126864,0.00060439535,0.0013349641],"category_scores_gemma":[0.003931008,0.00034432625,0.0004195689,0.00069549785,0.00070897926,0.0014166901,0.0010303161,0.0008839508,0.00021306482],"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.00011828568,0.00006519093,0.0009163001,0.00017278598,0.0000577161,0.000121986704,0.00009853841,0.905375,0.0032040963,0.048864897,0.0024125688,0.038592603],"study_design_scores_gemma":[0.0000047524413,0.000035771867,0.00014412886,0.000007252706,0.000009393345,0.000029760717,0.000012987404,0.99162877,0.0005921282,0.006784075,0.00074568193,0.0000053220656],"about_ca_topic_score_codex":0.0018336698,"about_ca_topic_score_gemma":0.001411434,"teacher_disagreement_score":0.0018336698,"about_ca_system_score_codex":0.0010715685,"about_ca_system_score_gemma":0.0012984693,"threshold_uncertainty_score":0.00777483},"labels":[],"label_agreement":null},{"id":"W4399939577","doi":"10.1109/tcomm.2024.3418915","title":"Robust Constant Curvature Curve Communications With Complex and Quaternion Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"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":"Army Research Laboratory; University of Waterloo; Cairo University","keywords":"Constant (computer programming); Constant curvature; Curvature; Quaternion; Artificial neural network; Computer science; Control theory (sociology); Mathematics; Topology (electrical circuits); Mathematical analysis; Geometry; Artificial intelligence; Combinatorics; Control (management)","score_opus":0.0450136031972007,"score_gpt":0.2781434220915432,"score_spread":0.23312981889434248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399939577","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.06406154,0.00050024263,0.92944217,0.00047015888,0.00011924578,0.00003735967,0.00005673638,0.00032853303,0.0049839364],"genre_scores_gemma":[0.8926727,0.00028363825,0.10315065,0.00014059657,0.000065888555,0.000042427808,0.00007195915,0.000025693918,0.003546334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995963,0.00011029143,0.000021204145,0.00007482261,0.00015003969,0.00004734699],"domain_scores_gemma":[0.999337,0.00025918946,0.00011407235,0.000096649404,0.0001718136,0.000021208574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064934226,0.00048084487,0.0003053763,0.00035396937,0.00029921214,0.0006024325,0.00058771885,0.0006798014,0.0009395947],"category_scores_gemma":[0.0029411525,0.00017369479,0.0002017032,0.0004897962,0.0007765301,0.0011109483,0.0007451721,0.0006714234,0.00025554528],"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.00025413765,0.0000446355,0.00089343573,0.00007629897,0.000044371216,0.00015496444,0.00014127474,0.7525117,0.0238858,0.0641469,0.0016080461,0.15623851],"study_design_scores_gemma":[0.0000056196027,0.000033168704,0.00008926508,0.000005806825,0.0000029346843,0.000025793826,0.000007278051,0.99006385,0.0033364403,0.0057501886,0.00067117705,0.000008494277],"about_ca_topic_score_codex":0.0028045971,"about_ca_topic_score_gemma":0.0027160302,"teacher_disagreement_score":0.0028045971,"about_ca_system_score_codex":0.0006574271,"about_ca_system_score_gemma":0.0005786565,"threshold_uncertainty_score":0.0055764914},"labels":[],"label_agreement":null},{"id":"W4400020230","doi":"10.1109/tcomm.2024.3418889","title":"Two-Step Adaptive Grouping Access Based on RSMA for Multibeam Satellite System","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Communications satellite; Satellite; Electronic engineering; Remote sensing; Engineering; Geology; Aerospace engineering","score_opus":0.07875642421680518,"score_gpt":0.3226099651497055,"score_spread":0.24385354093290035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400020230","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.029877026,0.00044430644,0.9666145,0.00015307404,0.000082681734,0.00008478475,0.000020016081,0.00039268224,0.0023308895],"genre_scores_gemma":[0.86910945,0.00031060752,0.12803037,0.00011888574,0.0001004296,0.00015873753,0.000039007555,0.00002193215,0.0021106952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988564,0.00041333976,0.00005886427,0.00021886964,0.00030856708,0.00014401223],"domain_scores_gemma":[0.9994392,0.00018994002,0.00009082733,0.00009633773,0.00013227365,0.00005153962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474476,0.000878905,0.00065222353,0.00046197648,0.0006717082,0.0005437238,0.0013819417,0.0006981256,0.0014983425],"category_scores_gemma":[0.0010668478,0.00027514214,0.000686545,0.0005971817,0.0007128022,0.00088226964,0.0010506901,0.0006833799,0.0004304231],"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.0005203387,0.00029450224,0.0020681832,0.00033815138,0.00022519175,0.00074300636,0.00059075066,0.6672289,0.09590297,0.040331747,0.0044340394,0.18732229],"study_design_scores_gemma":[0.000033708275,0.00017171484,0.00017677512,0.0000067165056,0.000029137715,0.00019226015,0.000023296416,0.99265575,0.0034328627,0.0021505142,0.0010983311,0.000029061288],"about_ca_topic_score_codex":0.0022973348,"about_ca_topic_score_gemma":0.002881444,"teacher_disagreement_score":0.0022973348,"about_ca_system_score_codex":0.0004251603,"about_ca_system_score_gemma":0.0006907106,"threshold_uncertainty_score":0.0050124526},"labels":[],"label_agreement":null},{"id":"W4400188705","doi":"10.1109/tcomm.2024.3420736","title":"Signal-Dependent Shot and Relative Intensity Noise in Channel Estimation of Laser Diode-Based Indoor VLC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Semiconductor Lasers and Optical Devices","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relative intensity noise; Visible light communication; Electronic engineering; Channel (broadcasting); SIGNAL (programming language); Computer science; Noise (video); Laser; Acoustics; Optics; Semiconductor laser theory; Telecommunications; Light-emitting diode; Physics; Engineering","score_opus":0.03303700034403073,"score_gpt":0.2577344935715171,"score_spread":0.2246974932274864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400188705","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.091322064,0.0020086141,0.90293485,0.0003441709,0.000059631915,0.000029425444,0.0000759784,0.00035412598,0.002871067],"genre_scores_gemma":[0.92980593,0.001423098,0.06701342,0.0001324008,0.000070794194,0.000054095974,0.00015715578,0.0000692553,0.0012737986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809617,0.000571253,0.00007276484,0.00027029152,0.00081430766,0.00017514057],"domain_scores_gemma":[0.9951456,0.003602058,0.00031615343,0.00020768559,0.0006720612,0.00005641871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017470197,0.0007530557,0.000566027,0.00071369985,0.0004485488,0.0010340145,0.00064045703,0.0010473477,0.0005308072],"category_scores_gemma":[0.009692288,0.00039285794,0.00041412184,0.0007128552,0.0008631607,0.0012384228,0.00081151095,0.0010217747,0.00024194868],"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.0002963655,0.00007727691,0.0065147765,0.00036094777,0.00009945023,0.0003558676,0.00035204645,0.8697665,0.025538828,0.017416516,0.000948645,0.07827282],"study_design_scores_gemma":[0.00000444911,0.000056737077,0.0011633518,0.00003328797,0.000018747285,0.00014317928,0.00004297513,0.98633355,0.009355193,0.0022819862,0.00054167124,0.000024926048],"about_ca_topic_score_codex":0.005300107,"about_ca_topic_score_gemma":0.004827469,"teacher_disagreement_score":0.005300107,"about_ca_system_score_codex":0.00074157055,"about_ca_system_score_gemma":0.0013880625,"threshold_uncertainty_score":0.010538518},"labels":[],"label_agreement":null},{"id":"W4400230279","doi":"10.1109/tcomm.2024.3422221","title":"Weighted Sum Rate Maximization for RIS Backscatter Aided NOMA Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Noma; Backscatter (email); Maximization; Computer science; Maximum likelihood; Electronic engineering; Algorithm; Mathematics; Telecommunications link; Statistics; Telecommunications; Wireless; Mathematical optimization; Engineering","score_opus":0.022960376343134185,"score_gpt":0.26213629902454855,"score_spread":0.23917592268141435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400230279","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.01326078,0.0005549787,0.98174113,0.00017420744,0.000048777263,0.00004634352,0.00006727212,0.00012458631,0.003981872],"genre_scores_gemma":[0.78360075,0.0015231759,0.20681973,0.00021724937,0.00017532623,0.00034443953,0.00027302577,0.00013135135,0.006914944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983854,0.0008372681,0.000048381815,0.00020917485,0.00031319575,0.00020642759],"domain_scores_gemma":[0.9990482,0.00059021096,0.00011326528,0.00006882037,0.00014521473,0.000034356297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017768508,0.002035519,0.0013191038,0.0005020179,0.00051472103,0.0014718383,0.0011338854,0.0008716563,0.0016672664],"category_scores_gemma":[0.0021370987,0.00057429523,0.00065951404,0.0010399112,0.0010173692,0.0012032419,0.0012448332,0.0012935053,0.00060703215],"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.00015513814,0.00008666856,0.00030567238,0.00022962922,0.00006843061,0.00024404842,0.0001061935,0.9220439,0.0070921434,0.030610865,0.002522257,0.03653503],"study_design_scores_gemma":[0.000009495091,0.000042344993,0.00005251377,0.0000056493327,0.000008141,0.000035773766,0.000018644265,0.99388087,0.00086673885,0.0045828647,0.00049103866,0.0000059471545],"about_ca_topic_score_codex":0.0017249337,"about_ca_topic_score_gemma":0.002144899,"teacher_disagreement_score":0.002035519,"about_ca_system_score_codex":0.0010650133,"about_ca_system_score_gemma":0.0012217247,"threshold_uncertainty_score":0.00939697},"labels":[],"label_agreement":null},{"id":"W4400276324","doi":"10.1109/tcomm.2024.3422220","title":"Optimal Configuration of Reconfigurable Intelligent Surfaces With Arbitrary Discrete Phase Shifts","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":12,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Phase (matter); Electronic engineering; Topology (electrical circuits); Physics; Engineering; Electrical engineering","score_opus":0.03418049745005786,"score_gpt":0.2869608673854388,"score_spread":0.25278036993538094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400276324","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.32726276,0.00029246075,0.6509405,0.00036465464,0.00006103436,0.000057713474,0.00006609043,0.0005287729,0.020426081],"genre_scores_gemma":[0.9319863,0.000091655565,0.065372825,0.000043776643,0.000009944949,0.000051666953,0.000040886895,0.00005240912,0.0023504351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00009454737,0.000014215965,0.000083289255,0.00008705702,0.00009135957],"domain_scores_gemma":[0.9996,0.00014143398,0.000098596705,0.00006177679,0.00005428752,0.00004392222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443898,0.00076753227,0.0005790667,0.0004399912,0.00026049797,0.0008505632,0.0006758004,0.0007948777,0.0020844145],"category_scores_gemma":[0.0011707207,0.0004166408,0.00039221076,0.00029229213,0.0010503428,0.0008891569,0.0009136969,0.00050070416,0.00052100373],"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.0002386584,0.000086356835,0.0007668955,0.00010244258,0.00003811934,0.00030052746,0.00010262387,0.87563485,0.05273036,0.030719692,0.00092987483,0.038349662],"study_design_scores_gemma":[0.00004162728,0.0002088104,0.0002845593,0.000010702154,0.000017290144,0.00010354535,0.00010598924,0.96538925,0.017226918,0.015201484,0.0013836791,0.000026177693],"about_ca_topic_score_codex":0.00028046488,"about_ca_topic_score_gemma":0.00027061717,"teacher_disagreement_score":0.0020844145,"about_ca_system_score_codex":0.0004906712,"about_ca_system_score_gemma":0.0003437685,"threshold_uncertainty_score":0.006973028},"labels":[],"label_agreement":null},{"id":"W4400351845","doi":"10.1109/tcomm.2024.3424233","title":"On Power-Line-Based Front-Hauling for IoT Cellular Indoor Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","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 Waterloo","funders":"","keywords":"Line (geometry); Power-line communication; Computer science; Power (physics); Electrical engineering; Internet of Things; Telecommunications; Engineering; Cellular radio; Electronic engineering; Embedded system; Base station; Physics","score_opus":0.038067462171337926,"score_gpt":0.28450116704071315,"score_spread":0.24643370486937521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400351845","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.09556151,0.0009025107,0.8975022,0.00012994511,0.00005209355,0.00003205634,0.00002102346,0.00023136057,0.005567349],"genre_scores_gemma":[0.9617517,0.00053505594,0.03607172,0.00006394725,0.00003537654,0.000013793379,0.000017829134,0.000015665224,0.0014948118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999627,0.0001267649,0.000009286777,0.00006410253,0.00011176023,0.00006109402],"domain_scores_gemma":[0.99954957,0.00024147388,0.00005505662,0.00005636838,0.00008430538,0.000013153979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041661182,0.00038616758,0.0003218002,0.00023511138,0.00039631914,0.0005285975,0.00056791265,0.0003442729,0.00072362385],"category_scores_gemma":[0.00087565085,0.00012987692,0.00023556464,0.00041781436,0.00041377262,0.00083646644,0.0004070586,0.00035956127,0.00020404198],"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.00026619807,0.00018201357,0.0017134448,0.00016138755,0.000044939992,0.00031368146,0.0001892275,0.7422409,0.055528518,0.030635318,0.0012143053,0.16751012],"study_design_scores_gemma":[0.0000032314342,0.000091624555,0.00017700248,0.0000062147906,0.000008439429,0.00007103741,0.000023388728,0.9909984,0.005768659,0.0019068001,0.0009382336,0.0000068534837],"about_ca_topic_score_codex":0.001745614,"about_ca_topic_score_gemma":0.0022054235,"teacher_disagreement_score":0.001745614,"about_ca_system_score_codex":0.00065173826,"about_ca_system_score_gemma":0.00049031444,"threshold_uncertainty_score":0.004728675},"labels":[],"label_agreement":null},{"id":"W4400526165","doi":"10.1109/tcomm.2024.3399202","title":"Semi-Passive Intelligent Reflecting Surface-Enabled Sensing Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":17,"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":"National Key Research and Development Program of China; Fundo para o Desenvolvimento das Ciências e da Tecnologia; National Natural Science Foundation of China","keywords":"Computer science; Electronic engineering; Engineering; Electrical engineering","score_opus":0.0412102546407868,"score_gpt":0.29920993725060285,"score_spread":0.25799968260981604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400526165","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.023303784,0.00022941125,0.9724443,0.00009629359,0.000038168575,0.00002678614,0.000029848774,0.00049387047,0.0033376052],"genre_scores_gemma":[0.72680134,0.00044625945,0.26742992,0.00022886274,0.00007398741,0.000118027056,0.00012478369,0.000050475483,0.004726266],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992716,0.00018675328,0.000031755517,0.00014077667,0.00030139144,0.00006767692],"domain_scores_gemma":[0.99952376,0.00014684733,0.00009587705,0.000096310054,0.000110080204,0.000027109443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039907193,0.00068543846,0.00067691965,0.0002771539,0.00023216849,0.00070422207,0.0011137055,0.00075279776,0.001169898],"category_scores_gemma":[0.0008638408,0.00028704695,0.00042983264,0.0004030387,0.00061793905,0.0012119965,0.0014829398,0.0005692342,0.0007272367],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044947304,0.00015911149,0.0017273376,0.00036107755,0.00011130231,0.00028029474,0.00031697768,0.28314105,0.37377414,0.020364411,0.0019842286,0.31733054],"study_design_scores_gemma":[0.000034360535,0.00056462357,0.0009276673,0.000022778408,0.000042222728,0.0003979145,0.00008274285,0.93754417,0.047084514,0.006320129,0.0069348593,0.00004405955],"about_ca_topic_score_codex":0.00036688568,"about_ca_topic_score_gemma":0.000505221,"teacher_disagreement_score":0.001169898,"about_ca_system_score_codex":0.00023431939,"about_ca_system_score_gemma":0.00036287657,"threshold_uncertainty_score":0.0039137006},"labels":[],"label_agreement":null},{"id":"W4400681763","doi":"10.1109/tcomm.2024.3429170","title":"Federated Unfolding Learning for CSI Feedback in Distributed Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Distributed learning; Distributed computing; Electronic engineering; Artificial intelligence; Engineering","score_opus":0.035331092696284025,"score_gpt":0.29249002089749704,"score_spread":0.257158928201213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400681763","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.04470197,0.00018150118,0.9525073,0.00016273772,0.000030991225,0.000030149851,0.000052871612,0.0010245374,0.0013078701],"genre_scores_gemma":[0.9263497,0.000097579876,0.071009666,0.00017128089,0.00002442924,0.00006386173,0.00015756713,0.00005175726,0.0020740707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995426,0.00010015921,0.00002081145,0.00014593411,0.00009180972,0.000098651806],"domain_scores_gemma":[0.99910897,0.00041336502,0.00006787065,0.00016374126,0.00019360361,0.000052374697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008300032,0.00076205895,0.0010313635,0.00024249351,0.0005304918,0.00058312394,0.0016321603,0.0009821993,0.0013536736],"category_scores_gemma":[0.0028946388,0.00043812115,0.00035356786,0.00040269937,0.0007209583,0.0015932999,0.0013573653,0.0015296027,0.00026085286],"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.00015413514,0.00008398439,0.0007961708,0.000033500542,0.000024812436,0.00008434004,0.000074869,0.913367,0.0025687818,0.0034064192,0.00093350175,0.07847258],"study_design_scores_gemma":[0.0000027294059,0.000010675656,0.000038027614,0.0000010376485,0.0000018007235,0.0000057339676,0.0000042226634,0.99832255,0.00047405995,0.001068814,0.00006835812,0.0000019918205],"about_ca_topic_score_codex":0.006748281,"about_ca_topic_score_gemma":0.00950046,"teacher_disagreement_score":0.006748281,"about_ca_system_score_codex":0.00072319875,"about_ca_system_score_gemma":0.0012173831,"threshold_uncertainty_score":0.013418019},"labels":[],"label_agreement":null},{"id":"W4400878106","doi":"10.1109/tcomm.2024.3432455","title":"Phase-Shift and Transmit Power Optimization for RIS-Aided Massive MIMO SWIPT IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":23,"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":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; European Commission; Department for the Economy","keywords":"MIMO; Computer science; Power (physics); Electronic engineering; Transmitter power output; Telecommunications; Engineering; Transmitter; Beamforming; Channel (broadcasting); Physics","score_opus":0.019004879734326185,"score_gpt":0.26550850821662664,"score_spread":0.24650362848230045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400878106","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.044921964,0.00045513536,0.94693196,0.00024297395,0.000048832368,0.000028570506,0.000056369165,0.00012914812,0.007185003],"genre_scores_gemma":[0.94885695,0.0004078136,0.047744974,0.00010730158,0.000037264723,0.000062332205,0.000042195625,0.00003281589,0.0027084383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.0000997968,0.0000075583703,0.000047695485,0.00008795529,0.0000541912],"domain_scores_gemma":[0.99960047,0.0002451976,0.00006601953,0.000021511054,0.00004831728,0.000018537607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049208925,0.00075396866,0.0006648958,0.00019756574,0.00022440289,0.0006979373,0.0004696556,0.00049065764,0.001012466],"category_scores_gemma":[0.0011461524,0.00034282543,0.00034932335,0.00052396895,0.0007607155,0.0006135336,0.000622442,0.0004996639,0.00021313736],"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.00003703007,0.000024754967,0.00017065622,0.000041804513,0.000017484144,0.000065232845,0.000027544906,0.97966,0.0044297855,0.0069730263,0.0003086515,0.008244108],"study_design_scores_gemma":[0.0000035874348,0.00002736992,0.000048323338,0.000001909629,0.0000033776764,0.000011521238,0.000006170898,0.9970161,0.0005610766,0.0021766012,0.00014131033,0.000002601475],"about_ca_topic_score_codex":0.0010935985,"about_ca_topic_score_gemma":0.0011842794,"teacher_disagreement_score":0.0010935985,"about_ca_system_score_codex":0.00065896084,"about_ca_system_score_gemma":0.00056969665,"threshold_uncertainty_score":0.004781127},"labels":[],"label_agreement":null},{"id":"W4401070703","doi":"10.1109/tcomm.2024.3435404","title":"Optimal Binary Signaling for a Two Sensor Gaussian MAC Network","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Gaussian; Computer science; Wireless sensor network; Computer network; Topology (electrical circuits); Electronic engineering; Mathematics; Engineering; Physics; Electrical engineering","score_opus":0.03203395873517382,"score_gpt":0.2960845230958686,"score_spread":0.26405056436069474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070703","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.20276272,0.0005946818,0.78928787,0.0013762711,0.000051887993,0.00009815783,0.00018038655,0.00015089852,0.00549716],"genre_scores_gemma":[0.9638689,0.00022451948,0.034013063,0.00009744411,0.000023134635,0.00007288525,0.00005195706,0.000014890775,0.0016332116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749714,0.0013507535,0.00008473886,0.00029688617,0.00043704585,0.00033338167],"domain_scores_gemma":[0.99489164,0.0035567256,0.00067756895,0.00026908223,0.000416132,0.00018879183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033566407,0.0010562988,0.0011072847,0.0006607868,0.000513082,0.00137277,0.0011534755,0.0015303713,0.0012266162],"category_scores_gemma":[0.0077141165,0.00059003575,0.00043466385,0.0007414395,0.0022845068,0.0017485389,0.0018552594,0.0010777767,0.00017380877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021673873,0.00004875131,0.0004576612,0.00007955038,0.000026625461,0.00016168122,0.000118868644,0.93939275,0.0026368902,0.051753215,0.0003240424,0.004783262],"study_design_scores_gemma":[0.000019515368,0.000030059926,0.00006219622,0.000004980604,0.0000055302244,0.00001678444,0.000016937825,0.9885238,0.00037153656,0.010844432,0.00009690322,0.000007359473],"about_ca_topic_score_codex":0.0022015884,"about_ca_topic_score_gemma":0.0013359955,"teacher_disagreement_score":0.0033566407,"about_ca_system_score_codex":0.0022937155,"about_ca_system_score_gemma":0.0011823546,"threshold_uncertainty_score":0.017751813},"labels":[],"label_agreement":null},{"id":"W4401070793","doi":"10.1109/tcomm.2024.3435514","title":"Device-to-Device Communications With Selection-Based Cooperative RIS","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Computer science; Electronic engineering; Engineering; Artificial intelligence","score_opus":0.028222871578996365,"score_gpt":0.2770088932361451,"score_spread":0.24878602165714872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070793","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.28841156,0.0009958092,0.6980639,0.00022953792,0.00009908712,0.000109133645,0.0000339738,0.00097546127,0.011081595],"genre_scores_gemma":[0.9708792,0.00015449578,0.027393535,0.00009024396,0.000026267397,0.000043150587,0.000023556837,0.000009916962,0.0013796057],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994493,0.00014560953,0.00002736368,0.00010625695,0.00018936806,0.00008212013],"domain_scores_gemma":[0.99932635,0.00023590666,0.00010665096,0.00018044862,0.00012251172,0.000028195946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003742779,0.00047262103,0.000489721,0.00039695704,0.00047397625,0.00046627768,0.0007390798,0.0003977612,0.00052866526],"category_scores_gemma":[0.000799837,0.00016915136,0.00030677288,0.00048581086,0.00050128513,0.00070872385,0.0012689166,0.00034374685,0.00026670334],"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.00073917484,0.00031049867,0.00677851,0.00043124484,0.00018209251,0.0013480876,0.001296134,0.18560871,0.4613884,0.029181156,0.0022992354,0.31043673],"study_design_scores_gemma":[0.00004618583,0.0012397233,0.0018175117,0.000027371872,0.00009462837,0.0012937835,0.00030308985,0.8905594,0.09101487,0.005221232,0.00831832,0.00006382148],"about_ca_topic_score_codex":0.0005083183,"about_ca_topic_score_gemma":0.0009024505,"teacher_disagreement_score":0.0007390798,"about_ca_system_score_codex":0.00022993206,"about_ca_system_score_gemma":0.00032974692,"threshold_uncertainty_score":0.001979351},"labels":[],"label_agreement":null},{"id":"W4401358046","doi":"10.1109/tcomm.2024.3439445","title":"User Sensing in RIS-Aided Wideband mmWave System With Beam-Squint and Beam-Split","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Wideband; Beam (structure); Computer science; Electronic engineering; Telecommunications; Optics; Physics; Engineering","score_opus":0.023981186207659683,"score_gpt":0.23591484589771358,"score_spread":0.2119336596900539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401358046","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.20577087,0.0004978556,0.7850814,0.0002905071,0.00005844547,0.00007956167,0.00007367134,0.0006973703,0.007450359],"genre_scores_gemma":[0.91330165,0.00013571656,0.08504027,0.00012355884,0.000018457318,0.00003856709,0.00003518419,0.000011330759,0.0012951535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962246,0.0000872797,0.000021910464,0.000071510396,0.00015519808,0.000041630097],"domain_scores_gemma":[0.9996158,0.00011413062,0.000093620656,0.000074418356,0.00008472922,0.000017239414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026723478,0.0005094184,0.00027202725,0.00020473459,0.00026114626,0.00035182663,0.00065921363,0.00046605416,0.0008774248],"category_scores_gemma":[0.000521837,0.00020968808,0.00024346326,0.0003113719,0.0004524461,0.00085761095,0.00063971494,0.0002679504,0.00023277782],"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.00067578396,0.00013548878,0.0037464367,0.000238863,0.0000693555,0.00044656306,0.00049455866,0.074777335,0.7713429,0.02767997,0.0013696455,0.119023174],"study_design_scores_gemma":[0.000038789778,0.0004089645,0.0012508102,0.000018693829,0.000029582236,0.0004926124,0.00008925287,0.7535871,0.23873712,0.0027710956,0.002529737,0.00004614411],"about_ca_topic_score_codex":0.0004948652,"about_ca_topic_score_gemma":0.0011028528,"teacher_disagreement_score":0.0008774248,"about_ca_system_score_codex":0.00033562872,"about_ca_system_score_gemma":0.0002468539,"threshold_uncertainty_score":0.0029352307},"labels":[],"label_agreement":null},{"id":"W4401415032","doi":"10.1109/tcomm.2024.3440875","title":"Learned Trimmed-Ridge Regression for Channel Estimation in Millimeter-Wave Massive MIMO","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ridge; MIMO; Extremely high frequency; Channel (broadcasting); Computer science; Regression; Electronic engineering; Geology; Telecommunications; Statistics; Mathematics; Engineering","score_opus":0.08766293036883493,"score_gpt":0.3098626632485247,"score_spread":0.22219973287968975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401415032","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.013314215,0.00016384387,0.9850957,0.00012549532,0.000017629043,0.000007755532,0.00005162759,0.0006069862,0.0006166272],"genre_scores_gemma":[0.69802064,0.00046612715,0.29580584,0.00024213362,0.0000747357,0.00007609106,0.0004705267,0.00022601354,0.0046180403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997199,0.00009411976,0.000009468546,0.00005573434,0.000075680306,0.00004507061],"domain_scores_gemma":[0.99945,0.00025772498,0.00006009526,0.000094808114,0.00011057015,0.00002676247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006753352,0.0006762543,0.0006883017,0.0002859249,0.00023689441,0.00044396776,0.0009091981,0.00071018963,0.0011738949],"category_scores_gemma":[0.0024724572,0.00043602008,0.0004834429,0.00050579006,0.0005346197,0.0009911649,0.00083773426,0.0018195317,0.00057069823],"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.00008854365,0.000056191293,0.0008360626,0.00004890493,0.000044771674,0.000076276054,0.000047716134,0.90028393,0.006442063,0.007911104,0.0018057133,0.082358696],"study_design_scores_gemma":[0.0000013006983,0.000004875143,0.000033379158,0.0000012365192,0.0000012420302,0.0000043564596,0.0000018969971,0.9984251,0.0004455428,0.0009874788,0.00009212064,0.0000015046048],"about_ca_topic_score_codex":0.0038400204,"about_ca_topic_score_gemma":0.00540275,"teacher_disagreement_score":0.0038400204,"about_ca_system_score_codex":0.00034504425,"about_ca_system_score_gemma":0.0007696896,"threshold_uncertainty_score":0.007635355},"labels":[],"label_agreement":null},{"id":"W4401568031","doi":"10.1109/tcomm.2024.3443740","title":"Parallelized Block-Based Distribution Matching","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","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":"Huawei Technologies (Canada); University of Toronto","funders":"Huawei Technologies","keywords":"Block (permutation group theory); Computer science; Matching (statistics); Algorithm; Distribution (mathematics); Mathematics; Statistics","score_opus":0.020111770240884414,"score_gpt":0.25652057856643934,"score_spread":0.23640880832555491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568031","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.031069437,0.00014861867,0.9642237,0.00006847195,0.000028868031,0.00007207967,0.00005709954,0.0008654457,0.0034663153],"genre_scores_gemma":[0.68285394,0.00019045579,0.310084,0.00012969044,0.00003376621,0.00014300003,0.00015419757,0.00009919351,0.006311816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999466,0.00011816433,0.000028837285,0.00011247996,0.00020430093,0.000070253496],"domain_scores_gemma":[0.9991442,0.000264779,0.0001468519,0.0002549307,0.00015469982,0.000034482564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045568822,0.00042884264,0.00045837602,0.00039887585,0.00037447934,0.00057328015,0.0010966152,0.0004618004,0.0031747886],"category_scores_gemma":[0.0013448828,0.00023567112,0.00031508194,0.00062970066,0.00045013725,0.00092594937,0.0008459069,0.00055419246,0.00088654325],"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.000741132,0.00021787142,0.0011168263,0.00018236201,0.000099041485,0.0002030756,0.00012783539,0.36878675,0.20064062,0.058525413,0.0021351718,0.36722383],"study_design_scores_gemma":[0.00004670702,0.00022421165,0.00024473917,0.000012300902,0.000023334596,0.0003153537,0.0000135160835,0.88217694,0.09621274,0.014387544,0.006321108,0.000021450638],"about_ca_topic_score_codex":0.00070592575,"about_ca_topic_score_gemma":0.0010795889,"teacher_disagreement_score":0.0031747886,"about_ca_system_score_codex":0.0006481153,"about_ca_system_score_gemma":0.0008329371,"threshold_uncertainty_score":0.010620713},"labels":[],"label_agreement":null},{"id":"W4401568511","doi":"10.1109/tcomm.2024.3443737","title":"Counterfactual Quantum Protocols for Dialogue, Teleportation, and Comparison","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Teleportation; Quantum teleportation; Computer science; Quantum channel; Superdense coding; Counterfactual thinking; Quantum; Quantum entanglement; Electronic engineering; Computer network; Telecommunications; Physics; Quantum mechanics; Engineering; Psychology","score_opus":0.047096189818737665,"score_gpt":0.34189919099485916,"score_spread":0.2948030011761215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568511","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.0038979454,0.00030194962,0.98736143,0.0007257735,0.00016772244,0.00023376534,0.000049863444,0.00014198611,0.00711948],"genre_scores_gemma":[0.3439691,0.00063339184,0.6480696,0.000711163,0.00031389785,0.0018223749,0.00017946718,0.00014055018,0.004160373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9697202,0.018681925,0.0014552828,0.0031612818,0.0060367677,0.0009445786],"domain_scores_gemma":[0.9707008,0.016163178,0.0022091211,0.00864215,0.001782735,0.0005020418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021019956,0.0013460573,0.001235938,0.0019266153,0.0027375799,0.0050380155,0.0043869577,0.0031844962,0.005522648],"category_scores_gemma":[0.04024986,0.00080457295,0.0017920032,0.0018680203,0.015160835,0.013942443,0.0070067374,0.005937328,0.0008055193],"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.00003054117,0.000011029687,0.000030338104,0.000025591187,0.000009374854,0.000025964213,0.00007232352,0.0030564233,0.00027191493,0.9919652,0.00024500003,0.00425635],"study_design_scores_gemma":[0.000052674386,0.00004611369,0.00003847017,0.000042082967,0.000021951566,0.000073035175,0.000030092093,0.06639026,0.0031462782,0.9228569,0.007261908,0.000040216513],"about_ca_topic_score_codex":0.001145898,"about_ca_topic_score_gemma":0.00068887556,"teacher_disagreement_score":0.021019956,"about_ca_system_score_codex":0.0039156363,"about_ca_system_score_gemma":0.0033673486,"threshold_uncertainty_score":0.111165464},"labels":[],"label_agreement":null},{"id":"W4401879106","doi":"10.1109/tcomm.2024.3447781","title":"Fast Successive-Cancellation Decoding of 2 × 2 Kernel Non-Binary Polar Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Huawei Technologies (Canada)","funders":"","keywords":"Decoding methods; Binary number; Computer science; Polar; Algorithm; Binary code; Kernel (algebra); Sequential decoding; Single antenna interference cancellation; Electronic engineering; Mathematics; Arithmetic; Block code; Discrete mathematics; Physics; Engineering","score_opus":0.019163258678105723,"score_gpt":0.2856103899155721,"score_spread":0.2664471312374664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401879106","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.0676018,0.00018413714,0.9258311,0.00008819264,0.000057812387,0.000060944763,0.00012634206,0.00047017212,0.005579491],"genre_scores_gemma":[0.54881907,0.0004908173,0.44242632,0.00009757144,0.000047902267,0.000115080344,0.00046837464,0.00013767064,0.0073971534],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958616,0.00008423693,0.000028540137,0.000056129575,0.00018158428,0.00006324278],"domain_scores_gemma":[0.99905735,0.0003479045,0.000093060225,0.00018275593,0.00028409212,0.000034939276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034446892,0.00055412593,0.0004332747,0.00041783924,0.00033340653,0.0006319775,0.00046035988,0.00039919312,0.0014209524],"category_scores_gemma":[0.0023159513,0.00019182304,0.0003371387,0.0006468827,0.0004797653,0.0007459014,0.00071379397,0.00063032366,0.0007746285],"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.0006562909,0.0001107941,0.0014858459,0.00041318804,0.00006340141,0.00079538993,0.0006352369,0.2181575,0.2320707,0.1953348,0.0027166076,0.34756023],"study_design_scores_gemma":[0.000026508582,0.00009091134,0.00040361038,0.000020750942,0.000014576765,0.00028412545,0.00003672989,0.88209146,0.09190328,0.021241074,0.0038601167,0.000026865651],"about_ca_topic_score_codex":0.0017875828,"about_ca_topic_score_gemma":0.0023588086,"teacher_disagreement_score":0.0017875828,"about_ca_system_score_codex":0.0003863659,"about_ca_system_score_gemma":0.0011754748,"threshold_uncertainty_score":0.00475353},"labels":[],"label_agreement":null},{"id":"W4401906854","doi":"10.1109/tcomm.2024.3450586","title":"SF-Adaptive Duty-Cycled LoRa Networks: Scalability, Reliability, and Latency Tradeoffs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","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":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Scalability; Computer science; Reliability (semiconductor); Latency (audio); Reliability engineering; Computer network; Embedded system; Electronic engineering; Real-time computing; Engineering; Telecommunications; Operating system","score_opus":0.02739282850427004,"score_gpt":0.2634692032686514,"score_spread":0.23607637476438137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401906854","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.42540818,0.0007765301,0.5677471,0.0003784711,0.00004268322,0.00006546311,0.00007438365,0.0002918727,0.005215323],"genre_scores_gemma":[0.9899704,0.0001225534,0.009530842,0.000017781682,0.000009251606,0.000016284634,0.000013296622,0.0000071475865,0.0003125347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999295,0.00024017235,0.000021991113,0.00009774261,0.00016423049,0.00018073678],"domain_scores_gemma":[0.9968522,0.0019086826,0.00036739328,0.00035916615,0.00037046554,0.00014200766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015683015,0.0005144633,0.00044101386,0.0005280904,0.00048585096,0.0008199473,0.00090815214,0.00053897745,0.0004467821],"category_scores_gemma":[0.0062845876,0.00021012296,0.0003032092,0.0005054067,0.0010144545,0.0016249168,0.0011903447,0.00055819604,0.0001049427],"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.00016123685,0.00004273973,0.0017836073,0.000045224286,0.000023726301,0.00008293005,0.00013508122,0.959217,0.009169367,0.011144299,0.00027650103,0.017918184],"study_design_scores_gemma":[0.0000034416792,0.00005777494,0.00020968336,0.0000027498006,0.0000050416165,0.00004311848,0.00003378945,0.9957373,0.0011181859,0.0026126944,0.0001695131,0.0000066073967],"about_ca_topic_score_codex":0.0030322082,"about_ca_topic_score_gemma":0.002361474,"teacher_disagreement_score":0.0030322082,"about_ca_system_score_codex":0.0010232409,"about_ca_system_score_gemma":0.00072546327,"threshold_uncertainty_score":0.008294046},"labels":[],"label_agreement":null},{"id":"W4402129557","doi":"10.1109/tcomm.2024.3453399","title":"Rate Adaptation in Delay-Sensitive and Energy-Constrained Large-Scale IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"King Abdullah University of Science and Technology","keywords":"Computer science; Adaptation (eye); Scale (ratio); Energy (signal processing); Computer network; Electronic engineering; Engineering; Mathematics; Statistics; Physics","score_opus":0.01671568903830576,"score_gpt":0.24189795354700083,"score_spread":0.22518226450869508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402129557","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.09055882,0.0016214403,0.90359616,0.0004149804,0.00011469133,0.000073413365,0.000090029636,0.000280812,0.0032496464],"genre_scores_gemma":[0.9873848,0.0007510483,0.010483656,0.00005578734,0.00005394712,0.00006118637,0.00002332541,0.00003174029,0.0011545623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998749,0.00037284286,0.00005479209,0.00031035885,0.00031593943,0.00019700405],"domain_scores_gemma":[0.99684674,0.0018532063,0.0006624841,0.00020469302,0.00030484074,0.00012802376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018345244,0.0008654799,0.0008827645,0.00055948104,0.00060886494,0.0011354998,0.001534186,0.0009737697,0.000564275],"category_scores_gemma":[0.005575821,0.00051375595,0.00054336374,0.00072036556,0.0021003317,0.001650289,0.0011026206,0.0009116443,0.0001058881],"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.000041856143,0.00002342386,0.00035353817,0.00005543716,0.000021002541,0.00015024927,0.000097580894,0.965221,0.0036118592,0.026651854,0.00022992314,0.0035423967],"study_design_scores_gemma":[0.0000031503594,0.000017649423,0.00015121792,0.0000032030605,0.0000060831076,0.000021661039,0.000013677924,0.99431485,0.0002887662,0.005054844,0.00011797828,0.0000068544796],"about_ca_topic_score_codex":0.006139049,"about_ca_topic_score_gemma":0.002219826,"teacher_disagreement_score":0.006139049,"about_ca_system_score_codex":0.002083508,"about_ca_system_score_gemma":0.0009616265,"threshold_uncertainty_score":0.01511699},"labels":[],"label_agreement":null},{"id":"W4402265864","doi":"10.1109/tcomm.2024.3454702","title":"Profit Maximization for Multi-Time-Scale Hierarchical DRL-Based Joint Optimization in MEC-Enabled Air-Ground Integrated Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":33,"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":"Scientific Research Foundation of Education Department of Anhui Province of China; National Natural Science Foundation of China","keywords":"Maximization; Profit maximization; Computer science; Joint (building); Scale (ratio); Mathematical optimization; Profit (economics); Engineering; Mathematics; Economics; Geography; Civil engineering","score_opus":0.03500127704073615,"score_gpt":0.2687114211379617,"score_spread":0.23371014409722557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402265864","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.09170385,0.0006742917,0.89999515,0.0008037381,0.000063567786,0.00008365866,0.00010024841,0.000398824,0.0061767595],"genre_scores_gemma":[0.9570043,0.00014264676,0.039785054,0.00020866125,0.000024841731,0.00008156391,0.000071635564,0.00006129132,0.0026199291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00016989977,0.000019510087,0.00011493735,0.00009288907,0.00016724323],"domain_scores_gemma":[0.99833316,0.0010862804,0.00019193262,0.000054982487,0.0002186657,0.000115066316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014277025,0.0009990019,0.0014094006,0.00040931962,0.0005195148,0.0010745621,0.0012183709,0.0012757508,0.0024883363],"category_scores_gemma":[0.003388062,0.0005534294,0.0004040959,0.0004505951,0.0012612562,0.0013470786,0.0013223843,0.0011386762,0.00025897176],"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.000034075492,0.000021147787,0.00025067976,0.000018387434,0.00001034521,0.000028334243,0.000012842683,0.9926514,0.0002663583,0.0020256187,0.0002809422,0.004399896],"study_design_scores_gemma":[0.0000034046452,0.0000068348495,0.000024478846,0.0000010507472,0.0000013607422,0.0000022554937,0.0000027726965,0.99922633,0.000044393746,0.00065163133,0.000034441622,9.3515035e-7],"about_ca_topic_score_codex":0.011824492,"about_ca_topic_score_gemma":0.010032908,"teacher_disagreement_score":0.011824492,"about_ca_system_score_codex":0.002101706,"about_ca_system_score_gemma":0.0020005733,"threshold_uncertainty_score":0.02351135},"labels":[],"label_agreement":null},{"id":"W4402475164","doi":"10.1109/tcomm.2024.3459851","title":"Reduced-Complexity Projection-Aggregation List Decoder for Reed-Muller Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Soft-decision decoder; Reed–Muller code; Decoding methods; Projection (relational algebra); Algorithm; Theoretical computer science; Electronic engineering; Telecommunications; Block code; Concatenated error correction code; Engineering","score_opus":0.1000569589430676,"score_gpt":0.36026396986538434,"score_spread":0.26020701092231674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475164","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.031259768,0.00031378993,0.963274,0.000101281374,0.00004578599,0.00006640421,0.00013897267,0.0020125166,0.0027874862],"genre_scores_gemma":[0.49188298,0.00044662447,0.5017454,0.00015688075,0.000068596804,0.00014084173,0.00044327774,0.0001284528,0.0049869316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996001,0.00008845447,0.000035806253,0.000051348812,0.00018502021,0.000039243612],"domain_scores_gemma":[0.9988305,0.00040441076,0.00013335969,0.00019592809,0.0004019099,0.00003389338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694526,0.0006789115,0.0003430659,0.00057622936,0.00044659688,0.0005832221,0.000777339,0.00036223957,0.002027177],"category_scores_gemma":[0.0015235926,0.0002156371,0.00032948673,0.0007878029,0.00027256724,0.00093399076,0.00051713834,0.0007617431,0.001115052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063528743,0.00017149646,0.0026415857,0.00046780796,0.00012500524,0.00037904552,0.00026413487,0.18844472,0.24526736,0.09254838,0.0052272202,0.4638279],"study_design_scores_gemma":[0.000028064398,0.0003124586,0.00045429563,0.0000231921,0.000046246943,0.00039874524,0.000020674115,0.8262861,0.15980312,0.0070825564,0.005509658,0.00003490819],"about_ca_topic_score_codex":0.0017977639,"about_ca_topic_score_gemma":0.0044521843,"teacher_disagreement_score":0.002027177,"about_ca_system_score_codex":0.00062807725,"about_ca_system_score_gemma":0.0018143904,"threshold_uncertainty_score":0.006781578},"labels":[],"label_agreement":null},{"id":"W4402571484","doi":"10.1109/tcomm.2024.3462688","title":"Output-Constrained Lossy Source Coding With Application to Rate-Distortion-Perception Theory","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"","keywords":"Lossy compression; Rate–distortion theory; Computer science; Rate distortion; Electronic engineering; Coding (social sciences); Distortion (music); Perception; Algorithm; Mathematics; Data compression; Telecommunications; Engineering; Artificial intelligence; Statistics; Bandwidth (computing); Amplifier; Psychology","score_opus":0.02080988183123293,"score_gpt":0.293523723734041,"score_spread":0.27271384190280806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402571484","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.00295493,0.00052655675,0.99272436,0.0003217405,0.000035123692,0.000013992252,0.000045200897,0.000059359503,0.003318791],"genre_scores_gemma":[0.7015003,0.004483196,0.28299165,0.00050344167,0.00044774765,0.0003036757,0.00032714492,0.00031597342,0.009126894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859565,0.00051097304,0.00007005389,0.00016505748,0.00057000434,0.00008829482],"domain_scores_gemma":[0.9955729,0.003097186,0.0003207211,0.00040308296,0.0005367141,0.00006940336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517738,0.0012367778,0.00087185396,0.0009442074,0.00028728184,0.001710853,0.0016111855,0.0011578894,0.002247707],"category_scores_gemma":[0.012558165,0.0004929138,0.0007759997,0.0013548299,0.002274653,0.0032223694,0.0028461707,0.0027141802,0.00050841377],"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.000058516875,0.00001893111,0.00015924507,0.00014290873,0.000032466774,0.00013259379,0.00012545218,0.218443,0.002390196,0.7557396,0.0014806703,0.021276409],"study_design_scores_gemma":[0.0000070304263,0.000023725857,0.00006679354,0.000029089024,0.000008362887,0.00010187072,0.000014679019,0.7488846,0.0012189805,0.2486123,0.0010134311,0.000019089022],"about_ca_topic_score_codex":0.0010796244,"about_ca_topic_score_gemma":0.0005062541,"teacher_disagreement_score":0.002517738,"about_ca_system_score_codex":0.0014754175,"about_ca_system_score_gemma":0.0008332632,"threshold_uncertainty_score":0.01331526},"labels":[],"label_agreement":null},{"id":"W4402673386","doi":"10.1109/tcomm.2024.3465375","title":"Enhanced Learning-Based Hybrid Optimization Framework for RSMA-Aided Underlay LEO Communication With Non-Collaborative Terrestrial Primary Network","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Underlay; Computer science; Computer network; Computer architecture; Distributed computing; Telecommunications; Signal-to-noise ratio (imaging)","score_opus":0.022098703310058077,"score_gpt":0.2694166547637589,"score_spread":0.24731795145370083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402673386","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.021767192,0.00066926423,0.9704021,0.00036247392,0.00007273223,0.000046259072,0.00008211327,0.00032542375,0.006272441],"genre_scores_gemma":[0.91118485,0.00037573234,0.07856221,0.00032415244,0.00007343644,0.00021680575,0.00019781943,0.00009738216,0.008967588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966216,0.00008024264,0.00001233698,0.00007694284,0.000076946584,0.000091283655],"domain_scores_gemma":[0.99948394,0.00029218654,0.000046486515,0.000017513228,0.00012251643,0.000037335158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073523435,0.0010114334,0.0011379047,0.00032414062,0.00035208583,0.0009578573,0.0013080181,0.0013949043,0.003490607],"category_scores_gemma":[0.0013329738,0.00044508072,0.0005959438,0.00037026816,0.0007305695,0.0006666604,0.0011320027,0.0012942712,0.00040958973],"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.00003266583,0.000024141329,0.00024307815,0.00003193915,0.000018373672,0.00006323511,0.000024906374,0.9850439,0.0006725443,0.0027221425,0.0006475405,0.0104755405],"study_design_scores_gemma":[0.000002497118,0.000008788926,0.000018980098,0.0000015666407,0.0000021939734,0.0000032433916,0.0000024798367,0.99935395,0.00005359541,0.00044422268,0.000107233915,0.0000012110622],"about_ca_topic_score_codex":0.010701853,"about_ca_topic_score_gemma":0.009669874,"teacher_disagreement_score":0.010701853,"about_ca_system_score_codex":0.00084847485,"about_ca_system_score_gemma":0.0014761855,"threshold_uncertainty_score":0.021279156},"labels":[],"label_agreement":null},{"id":"W4402831789","doi":"10.1109/tcomm.2024.3468211","title":"Linearization of Fully-Connected Hybrid Beamforming Transmitters Using Analytical Multi-Input Models for Millimeter-Wave Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Science Basic Research Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Beamforming; Linearization; Extremely high frequency; Transmitter; Electronic engineering; Computer science; Telecommunications; Engineering; Physics; Nonlinear system","score_opus":0.13458883250029358,"score_gpt":0.3085188945485586,"score_spread":0.173930062048265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402831789","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.023908742,0.00022457184,0.9695309,0.00010459,0.000027118738,0.00002118,0.000051232757,0.0005312537,0.005600398],"genre_scores_gemma":[0.8536405,0.000808742,0.1366705,0.00011882473,0.000034725705,0.00014916559,0.00015552242,0.00006217067,0.008359803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987364,0.000028718794,0.0000044050857,0.000020645522,0.00006332422,0.0000093148465],"domain_scores_gemma":[0.99989235,0.00004175754,0.000022170687,0.000012911923,0.000027610844,0.000003140435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013362347,0.0005219869,0.00025431177,0.00014874697,0.00020313002,0.00045176278,0.0004338864,0.00046483785,0.0016614683],"category_scores_gemma":[0.00029179789,0.00029379354,0.0004249478,0.00021222282,0.00023484456,0.0005904605,0.00029125507,0.0003917849,0.0006034289],"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.00007245217,0.00003275668,0.00046009696,0.0001687615,0.000049730766,0.00017048235,0.00022401896,0.8483242,0.087643445,0.021080157,0.001305552,0.040468335],"study_design_scores_gemma":[0.0000028109641,0.00002223909,0.00006951045,0.000007858524,0.000005152837,0.0000284925,0.000010435883,0.9934388,0.0044265836,0.0012054933,0.0007770367,0.000005556221],"about_ca_topic_score_codex":0.0011586203,"about_ca_topic_score_gemma":0.0018394154,"teacher_disagreement_score":0.0016614683,"about_ca_system_score_codex":0.00041233993,"about_ca_system_score_gemma":0.00030677347,"threshold_uncertainty_score":0.0055581927},"labels":[],"label_agreement":null},{"id":"W4402915682","doi":"10.1109/tcomm.2024.3469542","title":"Rate-Splitting for Cell-Free Massive MIMO: Performance Analysis and Generative AI Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"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":"MIMO; Computer science; Electronic engineering; Theoretical computer science; Algorithm; Telecommunications; Engineering; Beamforming","score_opus":0.019266319526402943,"score_gpt":0.2542887351162682,"score_spread":0.23502241558986525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402915682","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.01991833,0.00023685767,0.97418547,0.00017072375,0.000022724536,0.00003645573,0.000017958184,0.00014299223,0.0052684257],"genre_scores_gemma":[0.8906981,0.00039993876,0.10595253,0.00015752525,0.000051696592,0.00011092697,0.000052709936,0.000049744445,0.0025268842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931955,0.00023260256,0.000019005309,0.00008314361,0.0002485621,0.00009706457],"domain_scores_gemma":[0.9977877,0.0014944,0.00017032349,0.00012697821,0.00032591098,0.00009464483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012157607,0.0010143598,0.0006178015,0.0006120224,0.0005118194,0.0009998083,0.001464997,0.00097360776,0.0016627626],"category_scores_gemma":[0.003538342,0.00039542172,0.0007023136,0.00094608724,0.0012634274,0.00091280375,0.0013187232,0.0011602218,0.00035886216],"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.000039018774,0.000034705507,0.0004412887,0.000048002614,0.000024622706,0.0000745989,0.0000860873,0.9504511,0.003936518,0.024676967,0.00034813592,0.01983902],"study_design_scores_gemma":[0.0000022252996,0.000014957768,0.000044851207,0.000002121036,0.000003432572,0.000021477077,0.0000064148403,0.99756384,0.0003364125,0.0019190668,0.00008145341,0.0000036846886],"about_ca_topic_score_codex":0.002776306,"about_ca_topic_score_gemma":0.0017990094,"teacher_disagreement_score":0.002776306,"about_ca_system_score_codex":0.0009897957,"about_ca_system_score_gemma":0.000913889,"threshold_uncertainty_score":0.007181525},"labels":[],"label_agreement":null},{"id":"W4402915697","doi":"10.1109/tcomm.2024.3469555","title":"Quantum Property Learning for NISQ Networks: Universal Quantum Witness Machines","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Computer science; Property (philosophy); Quantum; Quantum computer; Theoretical computer science; Quantum network; Physics; Quantum mechanics","score_opus":0.02382551532390113,"score_gpt":0.27054382374946895,"score_spread":0.24671830842556783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402915697","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.117554285,0.0002489578,0.8744712,0.00095377234,0.00005461956,0.00008345995,0.00015197079,0.00045602213,0.0060257106],"genre_scores_gemma":[0.9135674,0.00015309121,0.084413,0.00014461274,0.00003202833,0.0001050466,0.00017356078,0.0000691814,0.0013421169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935216,0.00024375778,0.00002681723,0.00014161468,0.00016064991,0.00007500721],"domain_scores_gemma":[0.9971308,0.0017434022,0.00027517774,0.00047978072,0.0002667941,0.00010414431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025559634,0.00042635782,0.00059952843,0.00069348846,0.0006886783,0.0014809727,0.0012311132,0.0009489422,0.0031455874],"category_scores_gemma":[0.011565997,0.0002802596,0.00048894394,0.00045052488,0.0027896333,0.005382285,0.0020566706,0.0017722127,0.00026681117],"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.00016748338,0.00006798331,0.0022992832,0.000120938304,0.000037213824,0.00007222892,0.0002092191,0.25397626,0.004221899,0.68645567,0.0018049752,0.0505668],"study_design_scores_gemma":[0.0000053930457,0.000015686377,0.00018462625,0.000009431877,0.000003474416,0.000011112385,0.00001836503,0.8759212,0.0015906619,0.12176841,0.00046518215,0.000006451991],"about_ca_topic_score_codex":0.0010682533,"about_ca_topic_score_gemma":0.0011046313,"teacher_disagreement_score":0.0031455874,"about_ca_system_score_codex":0.0016877779,"about_ca_system_score_gemma":0.0008777062,"threshold_uncertainty_score":0.01351738},"labels":[],"label_agreement":null},{"id":"W4403059543","doi":"10.1109/tcomm.2024.3472001","title":"Non-Coherent Communication Over Ultra-Fast Fading Channels in the Presence of Barrage Jamming","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fading; Jamming; Electronic engineering; Computer science; Telecommunications; Computer network; Engineering; Channel (broadcasting); Physics","score_opus":0.020352973862138267,"score_gpt":0.2688338815762117,"score_spread":0.2484809077140734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403059543","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.7839394,0.00070689403,0.20830286,0.00036126797,0.00005261192,0.000020727302,0.00004327788,0.00011292634,0.0064600627],"genre_scores_gemma":[0.9970161,0.00012166839,0.0024747904,0.000024687664,0.000010859367,0.000004349523,0.000006158963,0.0000037024524,0.00033780828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926203,0.00031066342,0.000019462308,0.00005644473,0.00021820182,0.00013314516],"domain_scores_gemma":[0.99560034,0.0030086264,0.0006302813,0.00030140424,0.00036508022,0.0000942457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770816,0.00039771723,0.0006534636,0.00039271655,0.00044109227,0.00070649816,0.00048910175,0.00061103655,0.00042481822],"category_scores_gemma":[0.005236325,0.0001975859,0.00017586259,0.0005334967,0.0011977068,0.0010875014,0.0011030587,0.00066223374,0.00010704863],"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.00036650637,0.00006416527,0.0027031796,0.00021701308,0.000076814904,0.0016589068,0.0004846984,0.88795704,0.043160852,0.049663305,0.000513944,0.013133581],"study_design_scores_gemma":[0.000013734891,0.00017352888,0.0017713968,0.000016664131,0.000022121912,0.00028997773,0.00013650462,0.9847282,0.0052617164,0.007280927,0.00027907555,0.00002608824],"about_ca_topic_score_codex":0.0007294748,"about_ca_topic_score_gemma":0.00091713166,"teacher_disagreement_score":0.0011770816,"about_ca_system_score_codex":0.00027892916,"about_ca_system_score_gemma":0.00037965228,"threshold_uncertainty_score":0.006225109},"labels":[],"label_agreement":null},{"id":"W4403060886","doi":"10.1109/tcomm.2024.3471968","title":"Exploiting Active STAR-RIS to Enable URLLC in Digitally-Twinned Internet-of-Things Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Science and Technology Council; Engineering and Physical Sciences Research Council; Canada Excellence Research Chairs, Government of Canada","keywords":"The Internet; Computer science; Star (game theory); Computer network; Physics; World Wide Web","score_opus":0.03136073566344771,"score_gpt":0.2727278462796461,"score_spread":0.24136711061619837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403060886","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.19313224,0.00019217025,0.8017002,0.00012802483,0.000040785246,0.000036074056,0.00003109793,0.0005664154,0.004173081],"genre_scores_gemma":[0.8294533,0.00008601431,0.16918126,0.000049727736,0.0000074046607,0.00002830773,0.000055534318,0.00002636732,0.001112104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983203,0.00005535504,0.000008487084,0.000028137078,0.00004745984,0.00002856137],"domain_scores_gemma":[0.9997613,0.000109441804,0.000031485408,0.000040838047,0.000038650745,0.000018372355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035022167,0.00032528787,0.0002885737,0.000138636,0.00021820399,0.0003981438,0.0005177445,0.00035362365,0.00036785475],"category_scores_gemma":[0.00073066866,0.00015824041,0.00022645811,0.0002656157,0.0002999127,0.0007600341,0.0006207701,0.00039629798,0.00012850804],"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.00022207109,0.00009724856,0.0019381637,0.000084094616,0.000034171262,0.0001849795,0.00017451418,0.78495455,0.05521456,0.012486383,0.0009776199,0.14363159],"study_design_scores_gemma":[0.000005863469,0.000060124257,0.00016383527,0.0000021492979,0.00000478629,0.000041235206,0.000022593842,0.9896315,0.007788408,0.0016822465,0.0005920259,0.0000052293904],"about_ca_topic_score_codex":0.0010544403,"about_ca_topic_score_gemma":0.0023846533,"teacher_disagreement_score":0.0010544403,"about_ca_system_score_codex":0.000250323,"about_ca_system_score_gemma":0.00042834852,"threshold_uncertainty_score":0.002096653},"labels":[],"label_agreement":null},{"id":"W4403183026","doi":"10.1109/tcomm.2024.3475270","title":"Joint Channel Estimation, User Activity Identification, and Pilot Contamination Attack Detection for mmWave Grant-Free Massive MTC Networks: A Three-Dimensional Compressive Sensing-Based Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Basic Research Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Compressed sensing; Joint (building); Identification (biology); Channel (broadcasting); Electronic engineering; Computer science; Engineering; Telecommunications; Algorithm; Structural engineering","score_opus":0.06367440333539089,"score_gpt":0.2648081269570482,"score_spread":0.20113372362165732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403183026","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.012092275,0.0001824976,0.9863477,0.00020966321,0.000028419488,0.000032596,0.000041228122,0.00014989299,0.00091568433],"genre_scores_gemma":[0.76218146,0.00086245046,0.23262218,0.00031484253,0.00015165826,0.00020270306,0.0003281293,0.000045147415,0.0032914241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925286,0.00021401698,0.00003110941,0.00013581284,0.0002604223,0.00010580868],"domain_scores_gemma":[0.99893814,0.00045644972,0.00017469087,0.00014086772,0.00020855285,0.00008131755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006690035,0.0009737196,0.0007700091,0.0004218551,0.00037573223,0.00066990795,0.0009447437,0.0008014426,0.0008006713],"category_scores_gemma":[0.0024592024,0.00044382177,0.00062690774,0.0006700244,0.00092722464,0.0015962557,0.0014198135,0.0013028745,0.00025701796],"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.0002989567,0.00013313358,0.002268601,0.00019067814,0.00008345481,0.00032990432,0.0002638998,0.789017,0.025962101,0.034652192,0.0029647562,0.14383534],"study_design_scores_gemma":[0.0000046189743,0.000029932398,0.00011503022,0.0000035194105,0.0000050008607,0.000040650917,0.000013218139,0.9967378,0.0011313393,0.0016721489,0.00023821111,0.000008443456],"about_ca_topic_score_codex":0.0044902023,"about_ca_topic_score_gemma":0.0037995747,"teacher_disagreement_score":0.0044902023,"about_ca_system_score_codex":0.00054964423,"about_ca_system_score_gemma":0.0015111918,"threshold_uncertainty_score":0.00892812},"labels":[],"label_agreement":null},{"id":"W4403278240","doi":"10.1109/tcomm.2024.3476090","title":"THz Network Placement and Mobility-Aware Resource Allocation for Indoor Hybrid THz/VLC Wireless Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless; Computer network; Electronic engineering; Resource allocation; Terahertz radiation; Visible light communication; Telecommunications; Electrical engineering; Engineering; Optoelectronics; Materials science; Light-emitting diode","score_opus":0.02784014856313798,"score_gpt":0.255103599195668,"score_spread":0.22726345063253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403278240","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.016876211,0.00022105422,0.9791989,0.0001376584,0.000024532574,0.000028192853,0.000030090407,0.00014943504,0.0033338822],"genre_scores_gemma":[0.7601362,0.00047253838,0.23472837,0.0001137798,0.00005856503,0.00017971575,0.000081506216,0.00009630156,0.0041331095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.0001249858,0.000008273495,0.000067065725,0.000070116235,0.00006891493],"domain_scores_gemma":[0.99976283,0.00011303919,0.000052747884,0.000022797823,0.00002837354,0.000020140818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003586443,0.0009187042,0.00072543975,0.0003278852,0.00042422288,0.0007226666,0.00055768015,0.00057817716,0.0014265019],"category_scores_gemma":[0.0008386716,0.0004546051,0.0004215918,0.00054347795,0.00048742205,0.00068341056,0.0007810151,0.00055620976,0.00029411667],"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.000025971902,0.00002337403,0.00021903419,0.000029414505,0.000010802174,0.000043665066,0.000018512788,0.97301584,0.0047377064,0.004858909,0.0005501,0.016466677],"study_design_scores_gemma":[0.0000030135534,0.000021050488,0.00006734043,0.0000025106674,0.000003925628,0.000017307735,0.000014712338,0.9970161,0.0009317179,0.0014366842,0.0004820438,0.000003503393],"about_ca_topic_score_codex":0.0022974461,"about_ca_topic_score_gemma":0.0024023673,"teacher_disagreement_score":0.0022974461,"about_ca_system_score_codex":0.0010750009,"about_ca_system_score_gemma":0.0008313511,"threshold_uncertainty_score":0.007799685},"labels":[],"label_agreement":null},{"id":"W4403296935","doi":"10.1109/tcomm.2024.3478111","title":"Joint Task Offloading and Resource Allocation Strategy for Hybrid MEC-Enabled LEO Satellite Networks: A Hierarchical Game Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":15,"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, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Resource allocation; Resource management (computing); Task (project management); Satellite; Game theory; Distributed computing; Communications satellite; Computer network; Engineering; Systems engineering","score_opus":0.05598929363202184,"score_gpt":0.26930614316860846,"score_spread":0.2133168495365866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403296935","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.07250523,0.0003083486,0.9087155,0.00050408026,0.000063695836,0.00022482125,0.00010841993,0.00010884095,0.017461093],"genre_scores_gemma":[0.9615602,0.00024316089,0.032776948,0.00012508032,0.000023542949,0.000209636,0.000054419193,0.000018740348,0.004988367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991887,0.00025754928,0.00003192636,0.00014095708,0.00014858815,0.00023226732],"domain_scores_gemma":[0.9992823,0.0003669605,0.000085728076,0.000030073043,0.00011215404,0.00012281723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093382434,0.0011535222,0.00089011306,0.00048246465,0.0007252148,0.0013422007,0.0014353982,0.0012788379,0.003738749],"category_scores_gemma":[0.0016029357,0.00043510643,0.0006527083,0.00042602347,0.0010383546,0.0013938295,0.0016396254,0.0010991142,0.00025709908],"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.0001437254,0.00007304279,0.00065972336,0.00008812744,0.000051711882,0.00035778823,0.00016212257,0.9366637,0.0036723677,0.047277015,0.0011909278,0.0096597215],"study_design_scores_gemma":[0.000011984589,0.000029082406,0.00007258031,0.0000042129564,0.000008737271,0.000020343088,0.00003276934,0.99421304,0.00016960602,0.005144949,0.00028681962,0.0000059176864],"about_ca_topic_score_codex":0.008476471,"about_ca_topic_score_gemma":0.007055399,"teacher_disagreement_score":0.008476471,"about_ca_system_score_codex":0.001791783,"about_ca_system_score_gemma":0.0017639314,"threshold_uncertainty_score":0.016854227},"labels":[],"label_agreement":null},{"id":"W4403678738","doi":"10.1109/tcomm.2024.3485587","title":"Reconfigurable Massive MIMO: Precoding Design and Channel Estimation in the Electromagnetic Domain","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"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":"Beijing Nova Program; Beijing Municipal Natural Science Foundation; Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Government of Jiangxi Province; Deutsche Forschungsgemeinschaft; Queen's University Belfast; National Natural Science Foundation of China; Northwestern University; Beijing Institute of Technology; Royal Academy of Engineering; Northwestern Polytechnical University; Queen's University; European Commission; Tsinghua University; Chalmers Tekniska Högskola; Alexander von Humboldt-Stiftung; Natural Science Foundation of Shandong Province; Leverhulme Trust","keywords":"Precoding; Electronic engineering; MIMO; Computer science; Channel (broadcasting); Zero-forcing precoding; Engineering; Telecommunications","score_opus":0.023852624585781728,"score_gpt":0.25262624621510255,"score_spread":0.22877362162932083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403678738","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.012442764,0.000105051426,0.98512924,0.00010259148,0.000025371968,0.000016266282,0.000028492703,0.00015754241,0.0019926485],"genre_scores_gemma":[0.6555881,0.0003781805,0.34072903,0.00018643204,0.000086573105,0.00014453343,0.00012649762,0.000039772258,0.0027209632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000088243185,0.000009267879,0.000052484236,0.00009123878,0.000034273715],"domain_scores_gemma":[0.99974364,0.00009018004,0.000050407652,0.000051864718,0.000044814642,0.00001903656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027079138,0.0005326231,0.0003818097,0.00015866087,0.00017030218,0.0004891318,0.0005698582,0.0004323027,0.00085556635],"category_scores_gemma":[0.000872491,0.0002239506,0.00031059867,0.0003175312,0.0004007029,0.00055605336,0.0005352838,0.00055987714,0.00039369697],"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.00016398434,0.0000764659,0.0008031089,0.00012537099,0.00005404098,0.00018513195,0.000104273466,0.73406506,0.068663254,0.038875144,0.0020385764,0.15484557],"study_design_scores_gemma":[0.000008905663,0.00007523321,0.00013804159,0.0000061974715,0.000006939879,0.000056124234,0.000011914685,0.98840827,0.0064413557,0.0037663507,0.0010710876,0.000009584005],"about_ca_topic_score_codex":0.00065875956,"about_ca_topic_score_gemma":0.0010163491,"teacher_disagreement_score":0.00085556635,"about_ca_system_score_codex":0.00025034233,"about_ca_system_score_gemma":0.00047565138,"threshold_uncertainty_score":0.0028621554},"labels":[],"label_agreement":null},{"id":"W4403863666","doi":"10.1109/tcomm.2024.3487801","title":"A Riemannian Manifold Approach to Constrained Resource Allocation in ISAC","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Control Systems Optimization","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 Alberta","funders":"National Science Foundation","keywords":"Computer science; Riemannian manifold; Manifold (fluid mechanics); Resource (disambiguation); Mathematical optimization; Mathematics; Topology (electrical circuits); Engineering; Pure mathematics; Combinatorics; Computer network; Mechanical engineering","score_opus":0.018745533012262474,"score_gpt":0.24577700594199559,"score_spread":0.2270314729297331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403863666","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.0046391236,0.00018059407,0.9918331,0.00017677051,0.000023438339,0.000018164052,0.00002044847,0.00014208745,0.002966213],"genre_scores_gemma":[0.5844511,0.0005795887,0.408569,0.00026590994,0.0001283552,0.00019804614,0.00013334995,0.0002525954,0.005422171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994931,0.00019832111,0.00001731186,0.00009028271,0.00013799041,0.000062989755],"domain_scores_gemma":[0.99955255,0.00019396943,0.000054785785,0.000067962064,0.00009350802,0.00003709729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071320037,0.0009539738,0.0008845655,0.0005024646,0.00044483537,0.0008333637,0.00095534686,0.0008310339,0.002044524],"category_scores_gemma":[0.0019298879,0.000364314,0.0005294653,0.0005512646,0.0013411498,0.0011447214,0.001378677,0.0011680123,0.000389118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018994504,0.000016633318,0.00021171084,0.00004504559,0.000021102136,0.000051895237,0.000051148592,0.8966216,0.0017697988,0.08057011,0.0015226516,0.019099195],"study_design_scores_gemma":[0.0000017503187,0.0000126222,0.0000429812,0.0000023434252,0.0000014551088,0.000010373692,0.0000059594345,0.989804,0.00023067837,0.009175437,0.00070789916,0.0000045392535],"about_ca_topic_score_codex":0.003797546,"about_ca_topic_score_gemma":0.0028233537,"teacher_disagreement_score":0.003797546,"about_ca_system_score_codex":0.000994289,"about_ca_system_score_gemma":0.0012264544,"threshold_uncertainty_score":0.0075508356},"labels":[],"label_agreement":null},{"id":"W4404057520","doi":"10.1109/tcomm.2024.3492057","title":"Signal Enhancement and Suppression Schemes for Bi-Static ISAC With IRS-Mounted Target","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Systems and Laser Technology","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Electronic engineering; Computer science; SIGNAL (programming language); Signal processing; Telecommunications; Electrical engineering; Engineering; Radar","score_opus":0.015752107354227992,"score_gpt":0.2663865365476073,"score_spread":0.2506344291933793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404057520","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.07025285,0.0003765491,0.92293894,0.0001484678,0.000046844307,0.00002906483,0.000018203922,0.00018348494,0.0060055596],"genre_scores_gemma":[0.9093354,0.00032502026,0.087528184,0.00010244593,0.000033951485,0.000046225214,0.000032489213,0.000024636287,0.0025717563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952185,0.00012438536,0.000013123656,0.00008349166,0.0001758255,0.00008131937],"domain_scores_gemma":[0.9994974,0.00017608849,0.000120425626,0.000061475075,0.00011091612,0.000033609613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045534456,0.001017252,0.0004498256,0.00032875064,0.00030779385,0.00055730477,0.00078808825,0.00053286785,0.0008222437],"category_scores_gemma":[0.000888476,0.0002092022,0.0003810123,0.0005663799,0.0008030679,0.0007628393,0.00090503297,0.0006401788,0.00032120373],"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.00033358298,0.00013362503,0.0013820619,0.00017388214,0.000074835356,0.00037038824,0.00024068738,0.7041049,0.14802787,0.021046918,0.0013995579,0.122711636],"study_design_scores_gemma":[0.0000060880107,0.00014894648,0.00016429396,0.0000050558,0.0000149100615,0.0000897646,0.000029068438,0.98605114,0.01165472,0.0011801901,0.0006450884,0.000010757078],"about_ca_topic_score_codex":0.00071982207,"about_ca_topic_score_gemma":0.0013496425,"teacher_disagreement_score":0.001017252,"about_ca_system_score_codex":0.0003951828,"about_ca_system_score_gemma":0.0004845155,"threshold_uncertainty_score":0.0028672218},"labels":[],"label_agreement":null},{"id":"W4404563375","doi":"10.1109/tcomm.2024.3502667","title":"Quantum-Enhanced Federated Learning for Metaverse-Empowered Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada; National Science and Technology Council; Canada Research Chairs","keywords":"Computer science; Computer network","score_opus":0.048211720136368964,"score_gpt":0.30970884862535425,"score_spread":0.26149712848898526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404563375","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.031643935,0.00036623573,0.96271574,0.00029088522,0.000084201616,0.000032480726,0.000054200595,0.00032901313,0.0044833818],"genre_scores_gemma":[0.9438314,0.00021518067,0.053125296,0.00015207892,0.000028287703,0.000060051894,0.00008683611,0.000042868433,0.0024580369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.000095100266,0.000015099789,0.00008405153,0.00008848441,0.00008093956],"domain_scores_gemma":[0.9994221,0.00023785111,0.000055470882,0.0001012914,0.00012407418,0.00005924553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600603,0.00047541404,0.0007909792,0.0003136039,0.00070786086,0.0011895071,0.0017776281,0.00090154423,0.001999217],"category_scores_gemma":[0.0019325679,0.00025085412,0.0004669084,0.0004480597,0.0010277227,0.0017549018,0.0019904985,0.0012459358,0.0002956159],"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.00006933814,0.000041418938,0.00076141255,0.000057979447,0.000032038995,0.00007973825,0.00006869234,0.90612704,0.0022197198,0.058516145,0.0010479462,0.030978555],"study_design_scores_gemma":[0.0000031778811,0.000018121127,0.000043485375,0.0000035453484,0.000003174958,0.000011562093,0.000011853191,0.98635083,0.00039517306,0.012618817,0.00053600036,0.0000041904173],"about_ca_topic_score_codex":0.0029605196,"about_ca_topic_score_gemma":0.0033126997,"teacher_disagreement_score":0.0029605196,"about_ca_system_score_codex":0.0011697542,"about_ca_system_score_gemma":0.001325391,"threshold_uncertainty_score":0.008487225},"labels":[],"label_agreement":null},{"id":"W4404788505","doi":"10.1109/tcomm.2024.3506932","title":"Secure 3D Directional Modulation Using Subarrays Based on Planar Frequency Diverse Array With Nonuniform Frequency Offsets","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Institute for Information and Communications Technology Promotion; Iran Telecommunication Research Center; National Research Foundation of Korea; Ministry of Science and ICT, South Korea; Queen's University; National Research Foundation; Queen's University Belfast","keywords":"Frequency modulation; Modulation (music); Planar; Electronic engineering; Computer science; Acoustics; Radio frequency; Telecommunications; Physics; Engineering","score_opus":0.02550333099564002,"score_gpt":0.23710782122754911,"score_spread":0.21160449023190908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788505","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.10530832,0.00047001612,0.88716763,0.00017084953,0.000044553584,0.000034761066,0.000054679636,0.00031814256,0.006431068],"genre_scores_gemma":[0.8443174,0.00033168268,0.15349041,0.00013050578,0.000028793205,0.00005881279,0.000055011966,0.000020420866,0.001567072],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00010776744,0.000017292206,0.00007752654,0.00009309788,0.00003872881],"domain_scores_gemma":[0.9995586,0.00014165988,0.00012742223,0.000110119436,0.000042763204,0.000019461126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023517123,0.0004937598,0.00037985647,0.0002083061,0.00020861876,0.00047255185,0.00035205326,0.00040809254,0.0008189549],"category_scores_gemma":[0.0007046671,0.00013309701,0.00036406232,0.00044026726,0.00037276364,0.0006998426,0.00061569776,0.00037100344,0.00035462156],"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.000642077,0.00010226059,0.0031516734,0.00017962926,0.00010229609,0.00021769908,0.0002222644,0.22090837,0.46949458,0.05429336,0.0010987781,0.2495871],"study_design_scores_gemma":[0.00007284606,0.00065473106,0.0012469613,0.000030550713,0.00006902348,0.0007081529,0.00007650753,0.80895823,0.16773435,0.011278342,0.009108368,0.0000619154],"about_ca_topic_score_codex":0.00017765923,"about_ca_topic_score_gemma":0.00027421195,"teacher_disagreement_score":0.0008189549,"about_ca_system_score_codex":0.00031866602,"about_ca_system_score_gemma":0.00020721421,"threshold_uncertainty_score":0.0027397275},"labels":[],"label_agreement":null},{"id":"W4404788734","doi":"10.1109/tcomm.2024.3507640","title":"Cooperative Relaying for Connected Construction Equipment Networks With Hybrid Hierarchical Proximal Policy Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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","funders":"Beijing Jiaotong University","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.034839173393217356,"score_gpt":0.29640736590646694,"score_spread":0.2615681925132496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788734","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.020794706,0.0002897027,0.975486,0.00026497035,0.000035364337,0.0000391017,0.0000409209,0.00015153452,0.0028976696],"genre_scores_gemma":[0.93768346,0.0002642282,0.057933487,0.00012908009,0.000030648065,0.00017792913,0.00008599054,0.00004150042,0.0036536555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00024057933,0.00002447344,0.00013713681,0.00011900639,0.00011400615],"domain_scores_gemma":[0.99817514,0.001331859,0.00017387375,0.00005912282,0.00017779312,0.00008223286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013779826,0.0009585306,0.0012287239,0.0005413518,0.00047916017,0.0009459377,0.0012543615,0.0013021263,0.002013081],"category_scores_gemma":[0.0031117955,0.0005781196,0.0006520778,0.0005489332,0.0011954911,0.00089050847,0.0013950957,0.0012775997,0.0002456335],"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.000022392593,0.000012819607,0.00015676316,0.000021508187,0.000011763483,0.000042646934,0.000027725255,0.9899356,0.00022575937,0.005279731,0.00021934397,0.004043943],"study_design_scores_gemma":[0.0000041874346,0.000008979008,0.000015206689,0.0000016210909,0.0000026319906,0.0000034136874,0.0000032955056,0.9981998,0.00004497192,0.0016305227,0.000084061314,0.000001279591],"about_ca_topic_score_codex":0.009282872,"about_ca_topic_score_gemma":0.00617531,"teacher_disagreement_score":0.009282872,"about_ca_system_score_codex":0.001348402,"about_ca_system_score_gemma":0.0015647947,"threshold_uncertainty_score":0.01845771},"labels":[],"label_agreement":null},{"id":"W4405056253","doi":"10.1109/tcomm.2024.3511942","title":"Performance Analysis of Multi-RIS-Aided LoRa Systems With Outdated and Imperfect CSI","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Imperfect; Electronic engineering; Engineering","score_opus":0.027767240087969297,"score_gpt":0.2690430596930529,"score_spread":0.24127581960508362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056253","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.58101434,0.0013345701,0.40402442,0.00060812326,0.00009077542,0.00007976878,0.00011925936,0.0008289427,0.011899749],"genre_scores_gemma":[0.99250835,0.00014342526,0.006587447,0.000034744353,0.000014887543,0.000018062852,0.00002676009,0.0000094167435,0.0006569479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984907,0.00057608954,0.000056573597,0.00019048611,0.00037213406,0.00031405492],"domain_scores_gemma":[0.99614835,0.001829378,0.0006016664,0.00035828943,0.00093985547,0.00012234849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011271283,0.0010683949,0.00086351327,0.00056056277,0.00072449946,0.0010341485,0.0007106267,0.00094909,0.0011768837],"category_scores_gemma":[0.004188242,0.00033985588,0.0004083361,0.00052880065,0.0010247119,0.0009018033,0.0014650724,0.00073340646,0.00033769457],"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.00064015697,0.00006981212,0.0056195646,0.00014447472,0.00014009821,0.0003695256,0.00028029707,0.9372648,0.01962722,0.00702608,0.00054826535,0.02826976],"study_design_scores_gemma":[0.000010669307,0.00017488771,0.00069310935,0.0000066127373,0.00002601567,0.00011138612,0.000053226355,0.9940799,0.0040049474,0.0006231242,0.00019715693,0.000019040315],"about_ca_topic_score_codex":0.0032549608,"about_ca_topic_score_gemma":0.0025841997,"teacher_disagreement_score":0.0032549608,"about_ca_system_score_codex":0.00091997045,"about_ca_system_score_gemma":0.0011036316,"threshold_uncertainty_score":0.0066748857},"labels":[],"label_agreement":null},{"id":"W4405056259","doi":"10.1109/tcomm.2024.3511940","title":"Online Digital Twin-Empowered Content Resale Mechanism in Age of Information-Aware Edge Caching Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Mechanism (biology); Computer network; Telecommunications","score_opus":0.04553048250129581,"score_gpt":0.2670242672641039,"score_spread":0.22149378476280807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056259","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.11663471,0.00068547664,0.8776814,0.00036291807,0.0001109601,0.00013726408,0.00015646896,0.000782843,0.003448146],"genre_scores_gemma":[0.90577,0.00017771445,0.09209299,0.00010593502,0.000044494926,0.000052198142,0.00009637669,0.000032547716,0.0016277051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.00018237058,0.000045403856,0.00020228287,0.0001401643,0.00017455111],"domain_scores_gemma":[0.99801564,0.0007296587,0.00026610697,0.0003942145,0.00035291677,0.00024149338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501778,0.00058959104,0.0012816034,0.0005161077,0.00081907545,0.0011286003,0.0021227964,0.00091677177,0.0010723145],"category_scores_gemma":[0.0038094495,0.00029061156,0.000403227,0.00085331313,0.0005647011,0.0023478186,0.0015202014,0.0008639881,0.00020877976],"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.0006470997,0.00036434905,0.005686958,0.000229283,0.00009803324,0.0006058656,0.00039229324,0.7119948,0.017016105,0.04839909,0.007100093,0.20746593],"study_design_scores_gemma":[0.000008938302,0.000037725695,0.00016001258,0.0000029982937,0.000012654699,0.00009548602,0.000031069652,0.9938176,0.0013478806,0.0037744446,0.00070192176,0.000009230755],"about_ca_topic_score_codex":0.004102097,"about_ca_topic_score_gemma":0.005603446,"teacher_disagreement_score":0.004102097,"about_ca_system_score_codex":0.0010997589,"about_ca_system_score_gemma":0.0014613597,"threshold_uncertainty_score":0.008156478},"labels":[],"label_agreement":null},{"id":"W4405056279","doi":"10.1109/tcomm.2024.3511959","title":"Aerial Reconfigurable Intelligent Surfaces-Enabled Secured Wireless Communications: Performance Analysis and Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; European Commission; McMaster University","keywords":"Wireless; Computer science; Computer network; Computer architecture; Telecommunications","score_opus":0.02467703200065774,"score_gpt":0.260722545284927,"score_spread":0.23604551328426926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056279","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.43805698,0.002036983,0.5312529,0.00084352086,0.000048770635,0.00008595391,0.0001910994,0.00026792966,0.02721579],"genre_scores_gemma":[0.98821324,0.00047960284,0.009540984,0.000023745106,0.000010031813,0.000031539163,0.000042387877,0.000011783628,0.0016466683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999665,0.000116762036,0.00000907548,0.00004066832,0.0000906565,0.00007786184],"domain_scores_gemma":[0.99905485,0.00057470246,0.0001821602,0.00004522079,0.00011368636,0.000029217907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152681,0.0007746897,0.00051753287,0.0004378429,0.00027268106,0.00082408864,0.00038145552,0.00065182085,0.0010821986],"category_scores_gemma":[0.0013516331,0.00023403115,0.00039230927,0.0007190675,0.0006324795,0.00056108396,0.0006383595,0.00041076457,0.00019836001],"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.000025537858,0.0000114237855,0.00036721755,0.000020369993,0.000009214652,0.00004139906,0.000010629308,0.9933611,0.0010395392,0.0017145546,0.0001420658,0.0032567992],"study_design_scores_gemma":[0.0000014991483,0.000015843685,0.00013149861,0.0000017182756,0.0000028659715,0.000006656165,0.000007407955,0.9991961,0.00029223476,0.0002857119,0.00005673193,0.0000016310825],"about_ca_topic_score_codex":0.004947739,"about_ca_topic_score_gemma":0.0028608388,"teacher_disagreement_score":0.004947739,"about_ca_system_score_codex":0.0012325634,"about_ca_system_score_gemma":0.000698644,"threshold_uncertainty_score":0.009837925},"labels":[],"label_agreement":null},{"id":"W4405907220","doi":"10.1109/tcomm.2024.3523961","title":"Smart Helper-Aided F-RANs: Improving Delay and Reducing Fronthaul Load","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","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 Toronto; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Reynolds-averaged Navier–Stokes equations; Computer science; Computer network; Electronic engineering; Engineering; Computational fluid dynamics; Aerospace engineering","score_opus":0.021889517049378512,"score_gpt":0.26064661059643196,"score_spread":0.23875709354705343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405907220","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.25403076,0.0005398149,0.74040854,0.00014032029,0.00007481994,0.00007078582,0.0000465995,0.0007448714,0.003943478],"genre_scores_gemma":[0.95917237,0.000087610824,0.0398153,0.00004423751,0.000016238273,0.000020417125,0.000020808939,0.00001271359,0.0008101738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967957,0.000076621756,0.000008920579,0.000060129412,0.00007431119,0.00010038294],"domain_scores_gemma":[0.9994185,0.0002653819,0.00009246511,0.00007755366,0.00010013197,0.00004609315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499413,0.00082184,0.0005890763,0.00021860735,0.00033990238,0.00039374802,0.0009788452,0.00065059174,0.0010037783],"category_scores_gemma":[0.0012454985,0.00018108834,0.00026681955,0.0002133478,0.00053710176,0.0007982882,0.00066285,0.00045589937,0.00020044224],"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.0005398513,0.00019266825,0.0018437902,0.00008262443,0.000045676563,0.00036075222,0.000102101134,0.8843841,0.030211117,0.0048018186,0.0010187768,0.07641664],"study_design_scores_gemma":[0.00001224947,0.0001305366,0.00016258686,0.0000028030856,0.000008629353,0.00005803209,0.000016878736,0.9958339,0.0030130723,0.00049860636,0.0002555329,0.00000715808],"about_ca_topic_score_codex":0.0031540615,"about_ca_topic_score_gemma":0.0054734703,"teacher_disagreement_score":0.0031540615,"about_ca_system_score_codex":0.00036978716,"about_ca_system_score_gemma":0.0008070916,"threshold_uncertainty_score":0.006271422},"labels":[],"label_agreement":null},{"id":"W4406311201","doi":"10.1109/tcomm.2025.3529209","title":"Performance Analysis of Holographic MIMO Based Integrated Sensing and Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"CHIST-ERA; Engineering and Physical Sciences Research Council; China Scholarship Council","keywords":"MIMO; Electronic engineering; Computer science; Telecommunications; Engineering; Beamforming","score_opus":0.01906864819779537,"score_gpt":0.2487661049935463,"score_spread":0.22969745679575093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406311201","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.085732326,0.0018304732,0.8942477,0.00029219416,0.00006938274,0.00007227196,0.00013297464,0.0003230136,0.01729966],"genre_scores_gemma":[0.9558847,0.0007134932,0.04071196,0.00012976778,0.0000340205,0.00006295126,0.000075597505,0.000013440446,0.0023738793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867475,0.0003620965,0.00004103864,0.00019117391,0.00052680756,0.00020410745],"domain_scores_gemma":[0.99815935,0.0009172268,0.00027733707,0.00016078199,0.00041357044,0.00007171987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673531,0.0009292345,0.0007567266,0.00041371878,0.00038867904,0.0013028695,0.0009354224,0.0008468852,0.0014849938],"category_scores_gemma":[0.0017981518,0.00027520355,0.0003565122,0.00087203144,0.0008773583,0.0009740406,0.001124345,0.0004818497,0.00032488097],"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.00037086153,0.00010899109,0.0016486718,0.0002902886,0.00011630888,0.00022962624,0.00016429172,0.8378639,0.042528875,0.04199303,0.0013472234,0.07333791],"study_design_scores_gemma":[0.0000065233894,0.0001634882,0.00036086544,0.000010285954,0.000019818472,0.00011004494,0.00004109503,0.98977345,0.007094155,0.0019805012,0.00042183776,0.00001796208],"about_ca_topic_score_codex":0.001609266,"about_ca_topic_score_gemma":0.0018113669,"teacher_disagreement_score":0.001609266,"about_ca_system_score_codex":0.00094473705,"about_ca_system_score_gemma":0.0011140656,"threshold_uncertainty_score":0.006854534},"labels":[],"label_agreement":null},{"id":"W4406311207","doi":"10.1109/tcomm.2025.3529260","title":"Explainable Application Intent for Zero-Touch Networking: An Incorporation of Hypergraph and Transformer","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Hypergraph; Transformer; Computer science; Zero (linguistics); Electronic engineering; Electrical engineering; Mathematics; Engineering; Discrete mathematics; Voltage","score_opus":0.048377073338598295,"score_gpt":0.36221044477659864,"score_spread":0.31383337143800033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406311207","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.05062792,0.00028671866,0.94443905,0.00067151355,0.000032257198,0.00007826067,0.00017680723,0.0007904576,0.0028970998],"genre_scores_gemma":[0.8643854,0.00036827452,0.13156605,0.0002362806,0.000042760064,0.00010209493,0.00041669607,0.00019437654,0.0026881185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991235,0.000249012,0.00004520708,0.00027031387,0.00022906745,0.00008288159],"domain_scores_gemma":[0.99478334,0.0032617778,0.00043688883,0.0007602264,0.0005418633,0.00021593727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012819188,0.00083242526,0.00066503044,0.0013146388,0.0006494843,0.0016222756,0.001583158,0.0012574783,0.0024682835],"category_scores_gemma":[0.009501021,0.00055223855,0.0011266329,0.0009762983,0.0018289917,0.0052518365,0.002334366,0.0021531538,0.00029977376],"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.00027565935,0.0001560519,0.009505805,0.00026912865,0.00013130227,0.00070622924,0.0020398193,0.61398804,0.009231257,0.21051021,0.0033125416,0.14987387],"study_design_scores_gemma":[0.000008122622,0.000024331857,0.0005859087,0.000012609642,0.000024660689,0.000071584705,0.0000672153,0.945433,0.0009291572,0.05190094,0.0009244674,0.000017889486],"about_ca_topic_score_codex":0.016657744,"about_ca_topic_score_gemma":0.017121824,"teacher_disagreement_score":0.016657744,"about_ca_system_score_codex":0.001945476,"about_ca_system_score_gemma":0.0020992905,"threshold_uncertainty_score":0.033121586},"labels":[],"label_agreement":null},{"id":"W4406417209","doi":"10.1109/tcomm.2025.3529659","title":"Joint Interference Management and Traffic Offloading in Integrated Terrestrial and Non-Terrestrial Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Université Laval","funders":"","keywords":"Interference (communication); Joint (building); Computer science; Computer network; Telecommunications; Engineering","score_opus":0.020545441888456365,"score_gpt":0.2503002576300801,"score_spread":0.22975481574162376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406417209","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.13812241,0.00046513355,0.85203695,0.00015315178,0.000040638923,0.000055466993,0.000056672747,0.00021947101,0.008850057],"genre_scores_gemma":[0.9728156,0.00016733617,0.025539,0.00004652651,0.000022406592,0.0000323372,0.000029521016,0.000015012204,0.0013323434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947935,0.0001415023,0.000013089775,0.00008484152,0.00012578875,0.0001554112],"domain_scores_gemma":[0.99968886,0.00013111268,0.000059433176,0.000029265517,0.00005802608,0.000033305434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050736085,0.0005836981,0.0005350515,0.00030711,0.0005253041,0.00088188215,0.0007736536,0.0005178524,0.00072076725],"category_scores_gemma":[0.000856724,0.00022335758,0.00034151002,0.00064419745,0.00057137094,0.0007890091,0.00081258337,0.00041468223,0.00011046013],"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.00006752553,0.000060722305,0.00071522646,0.000036068155,0.00002425921,0.00017440731,0.0000431548,0.9572387,0.005293027,0.008819853,0.00041397152,0.02711301],"study_design_scores_gemma":[0.0000037175614,0.000032289143,0.00017496476,0.000002636694,0.0000071613877,0.00002706182,0.000019994231,0.9964233,0.0008973806,0.002090443,0.00031766042,0.0000033347405],"about_ca_topic_score_codex":0.0043684775,"about_ca_topic_score_gemma":0.0057397606,"teacher_disagreement_score":0.0043684775,"about_ca_system_score_codex":0.00086518924,"about_ca_system_score_gemma":0.0009372204,"threshold_uncertainty_score":0.008686125},"labels":[],"label_agreement":null},{"id":"W4406858232","doi":"10.1109/tcomm.2025.3534576","title":"NOMA-Assisted Semi-Grant-Free Transmission for UAV Networks: A Multi-User Scheduling Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication 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":"Western University","funders":"Natural Science Foundation of Anhui Province; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Noma; Scheduling (production processes); Computer science; Computer network; Transmission (telecommunications); Telecommunications; Engineering; Telecommunications link","score_opus":0.03938552843464514,"score_gpt":0.2853721639322381,"score_spread":0.24598663549759292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406858232","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.023609025,0.00067746965,0.97315764,0.00016246049,0.00008383271,0.000062493644,0.000037927675,0.00012325666,0.0020859176],"genre_scores_gemma":[0.8750128,0.000615189,0.12239549,0.000111112044,0.00015032684,0.00012333869,0.000044948072,0.000025012789,0.0015217771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992386,0.00033039477,0.000035534606,0.00008334931,0.00017690426,0.00013529317],"domain_scores_gemma":[0.99859303,0.0006592529,0.00019761035,0.00019196702,0.00025906836,0.00009907716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011201069,0.0007100256,0.0006521891,0.00075298967,0.0009235075,0.0007675516,0.0010463154,0.0005195839,0.0009798276],"category_scores_gemma":[0.0022304442,0.0002873194,0.00049641577,0.00072810764,0.0007109576,0.0010140177,0.0009200125,0.00052489195,0.00022738305],"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.00024662123,0.00015983738,0.0015440148,0.00025238591,0.00010516736,0.0004808881,0.0004129171,0.72009677,0.027700381,0.09953125,0.0032752447,0.14619456],"study_design_scores_gemma":[0.000007902749,0.000062769584,0.000117275624,0.000005487387,0.000008759894,0.000081308695,0.00003050868,0.9919349,0.001065019,0.0059491596,0.0007234843,0.000013403269],"about_ca_topic_score_codex":0.0023661533,"about_ca_topic_score_gemma":0.003975199,"teacher_disagreement_score":0.0023661533,"about_ca_system_score_codex":0.00085489894,"about_ca_system_score_gemma":0.0014574288,"threshold_uncertainty_score":0.0062026978},"labels":[],"label_agreement":null},{"id":"W4406858266","doi":"10.1109/tcomm.2025.3534527","title":"RIS Alignment via Virtual Partitioning for Resilient Uplink Multi-RIS-Assisted UAV Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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 Toronto","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Electronic engineering; Engineering","score_opus":0.06650032825176445,"score_gpt":0.321050210440961,"score_spread":0.25454988218919655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406858266","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.051963963,0.00043648927,0.9416556,0.000107046195,0.00005254053,0.000032691052,0.00004189152,0.00035121868,0.0053585414],"genre_scores_gemma":[0.9056016,0.00021455617,0.09228319,0.00006485931,0.000025851366,0.000052158288,0.00008502942,0.00004615533,0.0016265692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996685,0.000114686554,0.000010236709,0.00005510057,0.000087493645,0.000064054344],"domain_scores_gemma":[0.9997004,0.000121668665,0.000056125074,0.00004622807,0.000052376727,0.000023252938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003146848,0.00078092323,0.00044713766,0.00032896135,0.00042727127,0.00056962227,0.0006512685,0.0004370046,0.0011118911],"category_scores_gemma":[0.001050623,0.00022016322,0.00031137574,0.0003919943,0.00043235236,0.0007195258,0.00089741463,0.0005327523,0.00036078208],"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.000092927905,0.00002838312,0.00064395595,0.000046652996,0.000022523862,0.00014266533,0.00007287369,0.9288744,0.013202128,0.008044849,0.0011227905,0.04770582],"study_design_scores_gemma":[0.000003893984,0.00004600922,0.00012409405,0.0000039335137,0.0000053126932,0.000041810887,0.000021450089,0.99522865,0.0023157604,0.0015478819,0.0006562297,0.000005007137],"about_ca_topic_score_codex":0.0016713397,"about_ca_topic_score_gemma":0.002617544,"teacher_disagreement_score":0.0016713397,"about_ca_system_score_codex":0.0005333325,"about_ca_system_score_gemma":0.0004958674,"threshold_uncertainty_score":0.0038695931},"labels":[],"label_agreement":null},{"id":"W4406949003","doi":"10.1109/tcomm.2025.3535882","title":"Constituent Automorphism Decoding of Reed-Muller Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reed–Muller code; List decoding; Computer science; Mathematics; Concatenated error correction code; Telecommunications; Block code","score_opus":0.026309699697830938,"score_gpt":0.2870004848657971,"score_spread":0.2606907851679662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949003","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.13679174,0.00027228825,0.845117,0.00028601606,0.00019332486,0.00008162557,0.00018928626,0.0018802909,0.015188496],"genre_scores_gemma":[0.8245443,0.00036466913,0.16160099,0.00014029366,0.00012807817,0.00007062782,0.00043916446,0.00046748304,0.012244272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990121,0.0003190433,0.0000537188,0.00015689214,0.0003251445,0.00013305398],"domain_scores_gemma":[0.9986816,0.00048761815,0.00013134933,0.0003434122,0.00028249473,0.00007355673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007629254,0.0006022921,0.0007059446,0.00060261885,0.0006078056,0.0013010268,0.000673815,0.0007857572,0.002149614],"category_scores_gemma":[0.0035051988,0.00025480252,0.00052264536,0.0006375499,0.000855822,0.0013980684,0.001832205,0.0013576741,0.0018520073],"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.00092250627,0.00012450427,0.0019936108,0.00018756425,0.000093457624,0.00048692335,0.0007672882,0.17210048,0.15584154,0.45693716,0.0037419808,0.20680289],"study_design_scores_gemma":[0.00002534442,0.00018560184,0.00039977935,0.00003765325,0.000027951115,0.00023474488,0.00006402016,0.71878576,0.12846756,0.14449657,0.0072209043,0.000054097138],"about_ca_topic_score_codex":0.0004042801,"about_ca_topic_score_gemma":0.0006493293,"teacher_disagreement_score":0.002149614,"about_ca_system_score_codex":0.00054349867,"about_ca_system_score_gemma":0.0008075221,"threshold_uncertainty_score":0.007191181},"labels":[],"label_agreement":null},{"id":"W4406949338","doi":"10.1109/tcomm.2025.3535878","title":"Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Caching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"Queen's University","funders":"King Abdullah University of Science and Technology","keywords":"Computer science; Human–computer interaction; Online learning; Multimedia","score_opus":0.02282307567392406,"score_gpt":0.2909144032025605,"score_spread":0.26809132752863646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949338","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.027839564,0.0005511708,0.9684284,0.00019992965,0.000044812878,0.00003930546,0.00005542768,0.0007344806,0.002106953],"genre_scores_gemma":[0.86068535,0.00046014076,0.135825,0.00014033058,0.000053442123,0.00007054865,0.00014384926,0.00006937215,0.00255188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.00021100252,0.00004021972,0.00017950794,0.0001715219,0.0001272312],"domain_scores_gemma":[0.9979481,0.0008118774,0.00015011479,0.00058654783,0.0003971545,0.00010624194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008701975,0.0006257897,0.00093370385,0.00038799562,0.00060871174,0.0014892302,0.0020711736,0.0011864918,0.0016097358],"category_scores_gemma":[0.004230605,0.00025715816,0.00044069364,0.0008915735,0.0005747147,0.0020883835,0.0012765646,0.0009685055,0.00041752247],"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.00037337316,0.00025556385,0.0017076436,0.00013385608,0.00006995792,0.00022309912,0.00016574831,0.67122984,0.009865723,0.048871044,0.0050848583,0.26201925],"study_design_scores_gemma":[0.0000068305294,0.000028470206,0.000119347096,0.000004862727,0.000006709066,0.00004241939,0.000014827575,0.9907651,0.0012314123,0.007098507,0.0006753647,0.0000061732235],"about_ca_topic_score_codex":0.006245981,"about_ca_topic_score_gemma":0.00748499,"teacher_disagreement_score":0.006245981,"about_ca_system_score_codex":0.0014558155,"about_ca_system_score_gemma":0.0011294655,"threshold_uncertainty_score":0.012419224},"labels":[],"label_agreement":null},{"id":"W4407129048","doi":"10.1109/tcomm.2025.3538830","title":"QoE-Oriented Hybrid Semantic and Bit Communications Under Mismatched Knowledge","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Bit (key); Electronic engineering; Bit error rate; Computer network; Computer architecture; Engineering; Channel (broadcasting)","score_opus":0.02362569454684672,"score_gpt":0.27473106836976885,"score_spread":0.25110537382292214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407129048","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.03854662,0.00038990026,0.9571791,0.00030734274,0.000053761734,0.000047149395,0.000059830327,0.00023779113,0.0031784896],"genre_scores_gemma":[0.9512155,0.00026397436,0.0465709,0.0001714045,0.00005253786,0.00006853379,0.0000713356,0.000033002976,0.0015528615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899286,0.00032892724,0.00004253001,0.00018129904,0.00023534399,0.00021910212],"domain_scores_gemma":[0.9979923,0.0011528478,0.00017863183,0.00014767241,0.0004033416,0.00012535592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013271556,0.0009369597,0.0010938247,0.0005574078,0.00064878527,0.0011327938,0.0013762665,0.00091084896,0.0016064262],"category_scores_gemma":[0.004370255,0.00027141042,0.00038320155,0.0007982437,0.00083421625,0.0021658156,0.0016902351,0.00093067874,0.00025536187],"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.00046820764,0.00019523404,0.0015234489,0.00022472395,0.000065187734,0.00029233372,0.00027841283,0.82079387,0.014046866,0.0378516,0.0030914764,0.121168666],"study_design_scores_gemma":[0.000014430135,0.00006267872,0.00012215349,0.0000053398785,0.0000104116625,0.000048540485,0.000029232271,0.9917902,0.0010017444,0.0065238834,0.00038184924,0.000009615374],"about_ca_topic_score_codex":0.003256442,"about_ca_topic_score_gemma":0.0030975963,"teacher_disagreement_score":0.003256442,"about_ca_system_score_codex":0.0008428981,"about_ca_system_score_gemma":0.0013361075,"threshold_uncertainty_score":0.007018745},"labels":[],"label_agreement":null},{"id":"W4407129083","doi":"10.1109/tcomm.2025.3538825","title":"Joint Transmission Mode Selection and Scheduling for AoI Minimization in NOMA-Capable WP-IoT Networks: A Deep Transfer Learning Solution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":0,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Joint (building); Scheduling (production processes); Transmission (telecommunications); Selection (genetic algorithm); Internet of Things; Minification; Transfer of learning; Data transmission; Distributed computing; Electronic engineering; Computer network; Artificial intelligence; Telecommunications link; Mathematical optimization; Engineering; Telecommunications; Embedded system; Mathematics","score_opus":0.017097912223009798,"score_gpt":0.2476384517630057,"score_spread":0.2305405395399959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407129083","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.024567861,0.0002754908,0.9718392,0.0005359997,0.000053032374,0.00006323418,0.00006299445,0.00014878051,0.002453288],"genre_scores_gemma":[0.89945424,0.00035999477,0.09546043,0.0003415921,0.00010411862,0.00021090306,0.00012281704,0.00007682162,0.0038690849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993918,0.00015395274,0.000026260883,0.00017687031,0.00011240942,0.00013874359],"domain_scores_gemma":[0.9982741,0.0010166886,0.00021874516,0.00008649192,0.00027523746,0.00012878461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015045939,0.0010932357,0.0011216518,0.0004158413,0.0005300614,0.00082056096,0.0016277226,0.0011849643,0.0021232227],"category_scores_gemma":[0.0040258532,0.0004822256,0.0005293624,0.0006225173,0.0011004285,0.0015473843,0.0014623975,0.0015882635,0.00026487018],"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.000047516103,0.000060559316,0.00049038546,0.000050010705,0.000021738737,0.000053305364,0.00004643673,0.9690791,0.0010539726,0.007336569,0.00087512966,0.02088532],"study_design_scores_gemma":[0.000003328198,0.000011926399,0.000041401312,0.0000021718033,0.0000027006445,0.000005809852,0.000006431687,0.99761826,0.00011425853,0.0021068046,0.0000848165,0.0000021573758],"about_ca_topic_score_codex":0.0059516695,"about_ca_topic_score_gemma":0.005279691,"teacher_disagreement_score":0.0059516695,"about_ca_system_score_codex":0.0015007206,"about_ca_system_score_gemma":0.0021993094,"threshold_uncertainty_score":0.011834085},"labels":[],"label_agreement":null},{"id":"W4407168756","doi":"10.1109/tcomm.2025.3538832","title":"Transmission Design and Optimization for STAR-RIS-Assisted Symbiotic Radio Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","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":"National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Transmission (telecommunications); Computer science; Star (game theory); Radio frequency; Telecommunications; Electronic engineering; Engineering; Physics","score_opus":0.04765365984188698,"score_gpt":0.2746973401533905,"score_spread":0.22704368031150352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407168756","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.008578612,0.00026827125,0.98668253,0.000112197326,0.00002777831,0.000023728073,0.00002673514,0.0000755997,0.0042046146],"genre_scores_gemma":[0.78788286,0.0010262075,0.20342362,0.0001634952,0.000067839974,0.000220968,0.0001558613,0.00010069066,0.0069583976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952257,0.00016913532,0.00001594054,0.00008365638,0.00015309875,0.000055599812],"domain_scores_gemma":[0.99960166,0.00018793126,0.000060696,0.000023352884,0.00010246696,0.000023885512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073835114,0.0010424869,0.0007116151,0.00030098515,0.00032414027,0.0010870016,0.00071327004,0.0007111358,0.0026762101],"category_scores_gemma":[0.0012087937,0.00046657672,0.0005494404,0.0005071423,0.0006387149,0.00085881347,0.0010133296,0.0010021682,0.0006802399],"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.000054176304,0.00003070642,0.00036431255,0.000111873844,0.000032701035,0.000103054364,0.00007402926,0.948444,0.005555741,0.016799347,0.0009868229,0.027443118],"study_design_scores_gemma":[0.0000038206767,0.00002677287,0.000032773816,0.0000031391905,0.0000036166994,0.000015208992,0.000009283055,0.998035,0.00037259638,0.0011342926,0.00035999753,0.0000034622274],"about_ca_topic_score_codex":0.0015137295,"about_ca_topic_score_gemma":0.0012890206,"teacher_disagreement_score":0.0026762101,"about_ca_system_score_codex":0.0006053829,"about_ca_system_score_gemma":0.0008417127,"threshold_uncertainty_score":0.008952856},"labels":[],"label_agreement":null},{"id":"W4407360756","doi":"10.1109/tcomm.2025.3541031","title":"Computation-and-Communication Efficient Coordinated Multicast Beamforming in Massive MIMO Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Multicast; MIMO; Computer network; 3G MIMO; Computation; Electronic engineering; Telecommunications; Engineering; Algorithm","score_opus":0.010845922898898469,"score_gpt":0.2595270424442462,"score_spread":0.24868111954534772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407360756","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.010072101,0.00014348849,0.9880866,0.00009983169,0.000016857735,0.000010437202,0.000020625674,0.00015840343,0.0013917484],"genre_scores_gemma":[0.7371431,0.00034870894,0.2601764,0.000090245005,0.000058318536,0.00013613042,0.00008979036,0.000043221888,0.0019140915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959534,0.00016156689,0.000012513762,0.00005221094,0.00012031678,0.000058052028],"domain_scores_gemma":[0.999648,0.00018664234,0.00004010328,0.000044922075,0.000061716804,0.00001859249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955704,0.00061379914,0.0007051249,0.00026129792,0.00036445018,0.00057239627,0.0005218718,0.0005325251,0.00068341347],"category_scores_gemma":[0.0012150164,0.00032537812,0.00030804338,0.00051126815,0.00045075387,0.00069719704,0.0006468599,0.00047290762,0.00026174673],"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.000066419845,0.000019533602,0.00019160073,0.000037172624,0.000017935008,0.000055846267,0.00003289476,0.9419913,0.00572735,0.011564015,0.0009417194,0.039354105],"study_design_scores_gemma":[0.000005975793,0.000017767989,0.000050724677,0.0000022064917,0.0000026810048,0.000011411861,0.000007719119,0.99454206,0.0010331436,0.0040136822,0.00031003132,0.00000259759],"about_ca_topic_score_codex":0.0017526454,"about_ca_topic_score_gemma":0.0027501343,"teacher_disagreement_score":0.0017526454,"about_ca_system_score_codex":0.00048217914,"about_ca_system_score_gemma":0.00075676164,"threshold_uncertainty_score":0.003498435},"labels":[],"label_agreement":null},{"id":"W4407361295","doi":"10.1109/tcomm.2025.3541047","title":"Conditional Generative Adversarial Networks for Channel Estimation in RIS-Assisted ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Research Chairs","keywords":"Computer science; Channel (broadcasting); Adversarial system; Generative grammar; Computer network; Electronic engineering; Engineering; Artificial intelligence","score_opus":0.04958479910581601,"score_gpt":0.3073108358533916,"score_spread":0.25772603674757555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407361295","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.016664922,0.00027774274,0.98019445,0.000322045,0.000047620746,0.0000225395,0.00005276649,0.0003648423,0.0020530575],"genre_scores_gemma":[0.9385979,0.00025846183,0.05665378,0.00029226486,0.000056904784,0.00007233345,0.00014229798,0.00007890997,0.003847062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995427,0.00017096382,0.000014103627,0.00009931999,0.000102252605,0.00007068297],"domain_scores_gemma":[0.9984895,0.0010415994,0.00014469694,0.00008501664,0.00018657366,0.000052647356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010599308,0.00095213956,0.0006878246,0.00037707496,0.00036247013,0.00063980214,0.0009877185,0.00089382665,0.001492472],"category_scores_gemma":[0.0031036069,0.0005015117,0.00047863272,0.0003640153,0.0012523935,0.0009842269,0.0013293651,0.0019276546,0.00030636016],"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.000035335535,0.000008822569,0.0003035603,0.000016696418,0.00001234604,0.00003502867,0.000023444047,0.98486125,0.000719949,0.0048571033,0.0003763707,0.008750105],"study_design_scores_gemma":[0.0000011507542,0.000004539725,0.00003358612,0.0000016050493,0.0000018683963,0.000005036609,0.0000018897626,0.99852645,0.00017938335,0.0011664557,0.000075817676,0.0000022529555],"about_ca_topic_score_codex":0.006009455,"about_ca_topic_score_gemma":0.005939079,"teacher_disagreement_score":0.006009455,"about_ca_system_score_codex":0.00092259014,"about_ca_system_score_gemma":0.0007881165,"threshold_uncertainty_score":0.011948943},"labels":[],"label_agreement":null},{"id":"W4407374643","doi":"10.1109/tcomm.2025.3541092","title":"Robust and Secure Multi-User STAR-RIS-Aided Communications: Optimization Versus Machine Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Space Satellite Systems and Control","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada; National Science and Technology Council; Canada Research Chairs","keywords":"Computer science; Star (game theory); Robustness (evolution); Electronic engineering; Engineering; Physics","score_opus":0.03455601189354794,"score_gpt":0.2572922130072263,"score_spread":0.22273620111367837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407374643","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.0157639,0.0004966454,0.97996855,0.0002802003,0.000026940263,0.000022227172,0.000029132956,0.00022949267,0.0031828952],"genre_scores_gemma":[0.8884732,0.0006083516,0.106883295,0.00021255105,0.00007459919,0.00008636246,0.000094897565,0.000058026206,0.00350868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.0002650361,0.000025992733,0.00012948143,0.00016640291,0.00009754459],"domain_scores_gemma":[0.99873275,0.00081205944,0.00017282144,0.000104462844,0.00013292333,0.000044933662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987472,0.0010202286,0.0012360888,0.00029317848,0.00026734642,0.0011623158,0.0008056071,0.0010053358,0.0013133298],"category_scores_gemma":[0.0024337023,0.00044845647,0.0004940171,0.0005631684,0.0010482161,0.0010202185,0.0011096024,0.0013000353,0.00042834194],"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.000050454044,0.000024403287,0.0002388362,0.000045168435,0.00002538816,0.000042335658,0.000021578566,0.9707399,0.0013015409,0.007682245,0.00036287543,0.019465227],"study_design_scores_gemma":[0.0000023543687,0.000016692484,0.000023712724,0.0000022366653,0.0000021619412,0.000006494926,0.0000030387823,0.9984603,0.00028816992,0.0010932249,0.00009933901,0.0000022975194],"about_ca_topic_score_codex":0.00263581,"about_ca_topic_score_gemma":0.002223246,"teacher_disagreement_score":0.00263581,"about_ca_system_score_codex":0.0006715319,"about_ca_system_score_gemma":0.001246163,"threshold_uncertainty_score":0.005240977},"labels":[],"label_agreement":null},{"id":"W4407693351","doi":"10.1109/tcomm.2025.3543216","title":"Ground-to-AAV and RIS-Assisted AAV-to-Ground Communication Under Channel Aging: Statistical Characterization and Outage Performance","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and 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":"Polytechnique Montréal","funders":"","keywords":"Channel (broadcasting); Characterization (materials science); Computer science; Communications system; Engineering; Electronic engineering; Telecommunications; Reliability engineering; Materials science","score_opus":0.019745642242155026,"score_gpt":0.25689375706329287,"score_spread":0.23714811482113785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407693351","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.8816942,0.0005483861,0.114957385,0.0001228274,0.000029594512,0.000039793096,0.00038519537,0.00033250535,0.0018901603],"genre_scores_gemma":[0.99734324,0.00011852962,0.0020581917,0.00001577779,0.000012664011,0.0000142530125,0.00016279757,0.000010233372,0.0002641299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927455,0.00015325619,0.000038207283,0.00014303217,0.0002521854,0.00013875007],"domain_scores_gemma":[0.9947503,0.0028006593,0.00086781976,0.0005376005,0.0008975744,0.000146079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012013322,0.0006243283,0.00060130673,0.00071523787,0.00037210007,0.0005057889,0.0005480288,0.00044542068,0.00051484053],"category_scores_gemma":[0.006126418,0.00016716332,0.00026392538,0.0008332085,0.0007366433,0.0010876097,0.00064672733,0.00043284477,0.00013902069],"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.00025722926,0.00006164935,0.04369307,0.00009645728,0.00009314449,0.0005672262,0.00025008144,0.90250003,0.014877699,0.008353767,0.0008829599,0.028366702],"study_design_scores_gemma":[0.0000032355952,0.00008286763,0.0086528445,0.000005873631,0.000022145447,0.00026530868,0.00007182395,0.9850541,0.0039362255,0.0016315122,0.000254881,0.000019225734],"about_ca_topic_score_codex":0.005219014,"about_ca_topic_score_gemma":0.004577989,"teacher_disagreement_score":0.005219014,"about_ca_system_score_codex":0.0008226705,"about_ca_system_score_gemma":0.0006523389,"threshold_uncertainty_score":0.010377288},"labels":[],"label_agreement":null},{"id":"W4407938071","doi":"10.1109/tcomm.2025.3545702","title":"NOMA-Based Ze-RIS Empowered Backscatter Communication With Energy-Efficient Resource Management","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","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":"Memorial University of Newfoundland","funders":"Project 333 of Jiangsu Province","keywords":"Backscatter (email); Resource management (computing); Computer science; Telecommunications; Noma; Electronic engineering; Telecommunications link; Business; Engineering; Computer network; Wireless","score_opus":0.007771064357079768,"score_gpt":0.2130028045903966,"score_spread":0.20523174023331683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407938071","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.027741978,0.00023206981,0.9662217,0.00011529019,0.000038739287,0.000021589458,0.000025706348,0.00018651389,0.005416563],"genre_scores_gemma":[0.80664647,0.00033151693,0.18711807,0.0001563996,0.000033930308,0.00008995444,0.000067172725,0.000046382273,0.0055100094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997811,0.000057382476,0.000009001289,0.00004130725,0.00007654204,0.000034714165],"domain_scores_gemma":[0.9998435,0.00006248112,0.00003102727,0.000024517101,0.00002836885,0.000010185153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026345853,0.0005337501,0.0004606443,0.00019155601,0.00020816852,0.0006509117,0.00068188424,0.00035009513,0.0012780415],"category_scores_gemma":[0.00043456917,0.00020298231,0.00037225385,0.00030949552,0.00038965882,0.00064201787,0.0008060441,0.00050079514,0.00040309672],"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.00023031795,0.00009407241,0.0012414133,0.00022562887,0.00007843287,0.0003497677,0.00015128573,0.6787633,0.13215394,0.050723545,0.002038179,0.13395011],"study_design_scores_gemma":[0.000009107997,0.000095059244,0.00015225448,0.0000074139566,0.000012629727,0.00010652823,0.000025585092,0.9844504,0.009746537,0.00389327,0.0014889996,0.000012160598],"about_ca_topic_score_codex":0.00031270552,"about_ca_topic_score_gemma":0.0008104275,"teacher_disagreement_score":0.0012780415,"about_ca_system_score_codex":0.00025967517,"about_ca_system_score_gemma":0.0003677133,"threshold_uncertainty_score":0.004275501},"labels":[],"label_agreement":null},{"id":"W4407938106","doi":"10.1109/tcomm.2025.3545678","title":"Predictive Beamforming Approach for Secure Integrated Sensing and Communication With Multiple Aerial Eavesdroppers","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","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":"University of Alberta; Memorial University of Newfoundland","funders":"","keywords":"Beamforming; Computer science; Computer network; Telecommunications","score_opus":0.011092105826457796,"score_gpt":0.22477026845793838,"score_spread":0.2136781626314806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407938106","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.0045115054,0.00018922442,0.9934628,0.00009655711,0.000027025144,0.000010459222,0.000026662623,0.000120568686,0.0015552897],"genre_scores_gemma":[0.76386124,0.0012178507,0.2258738,0.00035882322,0.00013209392,0.00019527503,0.00024457637,0.000055056484,0.00806119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999602,0.000084396364,0.000015915663,0.00008712946,0.00014594139,0.000064572516],"domain_scores_gemma":[0.99959487,0.00021316532,0.0000459919,0.000040862335,0.00008699583,0.0000181521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045031405,0.000915421,0.000607998,0.00026589696,0.00035595184,0.000602035,0.00083394244,0.00070418045,0.0018221551],"category_scores_gemma":[0.0011764079,0.0003882952,0.00053011626,0.00053861697,0.00067652046,0.0009977168,0.001067073,0.0014351502,0.0005392637],"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.00015259183,0.000032404787,0.00066700595,0.00013825297,0.00007331631,0.0002783154,0.00017585958,0.8126452,0.020533746,0.039970763,0.0024342376,0.12289834],"study_design_scores_gemma":[0.0000050232184,0.000035922185,0.00006374544,0.000006140558,0.000010397536,0.000036365596,0.000013304259,0.99386793,0.0015795208,0.0038177243,0.0005565451,0.000007419115],"about_ca_topic_score_codex":0.0028525249,"about_ca_topic_score_gemma":0.0029374338,"teacher_disagreement_score":0.0028525249,"about_ca_system_score_codex":0.00042120452,"about_ca_system_score_gemma":0.00088153855,"threshold_uncertainty_score":0.0060957074},"labels":[],"label_agreement":null},{"id":"W4408145489","doi":"10.1109/tcomm.2025.3547764","title":"Toward Zero Touch Networks: Cross-Layer Automated Security Solutions for 6G Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University; Ontario Tech University","funders":"","keywords":"Computer science; Wireless; Computer network; Layer (electronics); Zero (linguistics); Physical layer; Wireless network; Telecommunications; Materials science","score_opus":0.03211102483972217,"score_gpt":0.3004036182890676,"score_spread":0.2682925934493454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145489","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.010416913,0.000647105,0.98576605,0.00034828155,0.000045162564,0.000040516174,0.00004234384,0.0018037008,0.000889954],"genre_scores_gemma":[0.6200849,0.00093613175,0.3752576,0.00054310524,0.00009795295,0.000094064526,0.00040391975,0.00017217301,0.0024102458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986082,0.0004379906,0.00006709294,0.0002784019,0.000476419,0.00013191585],"domain_scores_gemma":[0.99884856,0.0003729161,0.00019119386,0.00035484254,0.00017949512,0.000052975436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019309674,0.0009825325,0.0005621546,0.0007983061,0.00045307275,0.001295723,0.0014093617,0.0011144616,0.001331819],"category_scores_gemma":[0.0032574588,0.00032183764,0.00067425537,0.00036984764,0.0008735578,0.0028993825,0.0025921983,0.0019635577,0.00056224293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023066538,0.0001482001,0.0032590094,0.00015791097,0.00012466138,0.00017179728,0.00029062695,0.3555864,0.022739012,0.037052263,0.0067902156,0.5734493],"study_design_scores_gemma":[0.000008950874,0.00006939392,0.00035618467,0.00001539622,0.000012799753,0.00007571891,0.000031859145,0.97465104,0.0049743615,0.0153314965,0.004460141,0.000012585373],"about_ca_topic_score_codex":0.0018034893,"about_ca_topic_score_gemma":0.0017778187,"teacher_disagreement_score":0.0019309674,"about_ca_system_score_codex":0.00061426056,"about_ca_system_score_gemma":0.00091662677,"threshold_uncertainty_score":0.010212064},"labels":[],"label_agreement":null},{"id":"W4408324641","doi":"10.1109/tcomm.2025.3550371","title":"Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation With Gradient-Based Meta Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Computer science; Pairing; Resource allocation; Computer network; Resource management (computing); Resource (disambiguation); Distributed computing","score_opus":0.03390401326356322,"score_gpt":0.27480089268033675,"score_spread":0.24089687941677354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324641","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.03930984,0.00060008967,0.95721203,0.0003520484,0.000041307874,0.000063853695,0.000034661767,0.00023620763,0.002149932],"genre_scores_gemma":[0.87917835,0.00029335104,0.11777329,0.00028546888,0.00006616769,0.00025918745,0.000120671844,0.000060599486,0.001963019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991518,0.0004049112,0.00003412109,0.00014308283,0.0001325945,0.00013357254],"domain_scores_gemma":[0.9980348,0.0013125223,0.00020007299,0.00007440595,0.0002710193,0.00010717829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002263653,0.0013852358,0.0024043052,0.00072973,0.00039565115,0.0012612182,0.0017363854,0.0019525505,0.0010726838],"category_scores_gemma":[0.004122355,0.0007997813,0.0008331736,0.00076428143,0.0010920984,0.0012237309,0.0014460586,0.0014448721,0.00027021213],"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.00005599967,0.000077524826,0.0004977722,0.000036478898,0.00006012908,0.00003716554,0.000029909983,0.98314744,0.00035193187,0.002429021,0.00028333155,0.012993272],"study_design_scores_gemma":[0.0000041687435,0.000014456814,0.000019766569,0.0000021796031,0.0000032194448,0.0000023916853,0.00000332326,0.99939144,0.000047605117,0.0004773561,0.00003268982,0.0000013684376],"about_ca_topic_score_codex":0.0042473087,"about_ca_topic_score_gemma":0.0027684632,"teacher_disagreement_score":0.0042473087,"about_ca_system_score_codex":0.00090633857,"about_ca_system_score_gemma":0.0016352985,"threshold_uncertainty_score":0.011971474},"labels":[],"label_agreement":null},{"id":"W4408540244","doi":"10.1109/tcomm.2025.3552299","title":"Hierarchical Digital Twin for Efficient 6G Network Orchestration via Adaptive Attribute Selection and Scalable Network Modeling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Orchestration; Scalability; Selection (genetic algorithm); Distributed computing; Computer network; Computer architecture; Artificial intelligence; Database","score_opus":0.03393740673714284,"score_gpt":0.26806203071405205,"score_spread":0.2341246239769092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408540244","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.013734729,0.0000679617,0.9836818,0.00007815401,0.000020175647,0.000038998434,0.000038565926,0.0003901739,0.0019494466],"genre_scores_gemma":[0.60507333,0.0002309279,0.39126545,0.00009059504,0.000033211607,0.00012708407,0.00025326308,0.0001106548,0.0028155348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908304,0.00026736816,0.00006702684,0.00016682208,0.0003081098,0.00010759314],"domain_scores_gemma":[0.99946064,0.00012505306,0.000064657776,0.00015451759,0.000112446534,0.000082581915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012633463,0.0006164761,0.0006463225,0.00064207724,0.0006451301,0.0016518255,0.0014621149,0.00050133484,0.0018695038],"category_scores_gemma":[0.0023218852,0.00034058662,0.00072528806,0.0006435571,0.0006925374,0.0024455774,0.002760962,0.0011773951,0.0004178984],"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.0001962865,0.00011739831,0.0026134981,0.00007611532,0.00007014346,0.00023375713,0.00034619722,0.7986684,0.018982079,0.089163445,0.0019715058,0.087561235],"study_design_scores_gemma":[0.0000038323383,0.000018863575,0.0000806369,0.0000035002292,0.000008848958,0.000029779938,0.000021294496,0.9888825,0.0015232597,0.008130563,0.0012899326,0.0000069495286],"about_ca_topic_score_codex":0.0033244402,"about_ca_topic_score_gemma":0.0045544812,"teacher_disagreement_score":0.0033244402,"about_ca_system_score_codex":0.0009351639,"about_ca_system_score_gemma":0.0014416422,"threshold_uncertainty_score":0.0067851543},"labels":[],"label_agreement":null},{"id":"W4409058078","doi":"10.1109/tcomm.2025.3556779","title":"RIS-Aided MIMO Beamforming: Piecewise Near-Field Channel Model","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"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":"National Key Research and Development Program of China; National High-tech Research and Development Program; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Beamforming; MIMO; Channel (broadcasting); Electronic engineering; Piecewise; Precoding; Field (mathematics); Computer science; Engineering; Telecommunications; Mathematics","score_opus":0.022868776150361328,"score_gpt":0.26848977757457554,"score_spread":0.24562100142421422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409058078","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.006535821,0.00008442862,0.99040496,0.00006729426,0.000017651722,0.000011247898,0.000023364004,0.00014723826,0.0027080346],"genre_scores_gemma":[0.828164,0.0005435415,0.16460277,0.00017260908,0.000055277407,0.00011843535,0.00010393824,0.000057319947,0.0061821886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969065,0.00009405833,0.000009373886,0.00005317677,0.00011802103,0.000034685978],"domain_scores_gemma":[0.9997944,0.00007497709,0.000040532097,0.000029318586,0.000048859532,0.000011872346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025667364,0.00066326075,0.0004499485,0.00024640758,0.0002017255,0.0005572142,0.0007448345,0.0005130417,0.0013521964],"category_scores_gemma":[0.0004981682,0.0002877816,0.0003711782,0.00035119377,0.00044729604,0.00092557754,0.00053375715,0.0005892703,0.0006631608],"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.00008584443,0.000027018745,0.0005252619,0.00008163133,0.00002592627,0.000113103575,0.000058327547,0.90407753,0.025370667,0.01848342,0.0007791717,0.050372064],"study_design_scores_gemma":[0.0000045332663,0.00007539875,0.00009263367,0.000005046495,0.000007899411,0.000054126816,0.00001167808,0.99404573,0.0026951227,0.0018014514,0.0011974486,0.0000089502155],"about_ca_topic_score_codex":0.0009321563,"about_ca_topic_score_gemma":0.0011622045,"teacher_disagreement_score":0.0013521964,"about_ca_system_score_codex":0.00031022992,"about_ca_system_score_gemma":0.0004891626,"threshold_uncertainty_score":0.0045235157},"labels":[],"label_agreement":null},{"id":"W4409581412","doi":"10.1109/tcomm.2025.3562320","title":"Channel Estimation and Localization for Cylindrical RIS-Assisted Multi-User ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":3,"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":"Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China; Queen's University Belfast; Queen's University; European Commission; Royal Academy of Engineering; Engineering and Physical Sciences Research Council; Leverhulme Trust; National Science Foundation","keywords":"Computer science; Channel (broadcasting); Electronic engineering; Electrical engineering; Engineering; Telecommunications","score_opus":0.036938874910843744,"score_gpt":0.2989945903976763,"score_spread":0.26205571548683254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581412","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.024729881,0.00023705163,0.9733138,0.00011014887,0.000029739243,0.000017809163,0.000031880856,0.000295154,0.0012345044],"genre_scores_gemma":[0.82408947,0.00045365476,0.17307958,0.00012211327,0.00005932082,0.0000537021,0.00012357249,0.00003541039,0.001983165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993788,0.00018319172,0.000018645751,0.00013783283,0.00018683121,0.00009459418],"domain_scores_gemma":[0.9993037,0.0002707086,0.00011623396,0.00010820782,0.00016423818,0.00003679571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037634646,0.00084871985,0.0006021168,0.00032742004,0.00033452376,0.0006478164,0.00062638964,0.0006323659,0.00078103406],"category_scores_gemma":[0.0015210283,0.00025537334,0.00043454682,0.0005139234,0.0007871887,0.0010859888,0.0007926807,0.00070840854,0.00031191352],"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.0003646692,0.00007201947,0.0028558702,0.00024277682,0.000091528826,0.00042311606,0.00033256938,0.72020036,0.06449397,0.030405408,0.0019406937,0.17857704],"study_design_scores_gemma":[0.0000036088268,0.00004637846,0.00025720408,0.000004118887,0.000008827501,0.00007607449,0.000031187163,0.993276,0.0042532776,0.0014507113,0.0005779894,0.000014550175],"about_ca_topic_score_codex":0.0031181285,"about_ca_topic_score_gemma":0.0029578172,"teacher_disagreement_score":0.0031181285,"about_ca_system_score_codex":0.00046770083,"about_ca_system_score_gemma":0.0006848423,"threshold_uncertainty_score":0.006199956},"labels":[],"label_agreement":null},{"id":"W4409581518","doi":"10.1109/tcomm.2025.3562327","title":"Multi-Objective Regular Mapping QoS Path Planning for Mega LEO Constellation Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Chengdu Science and Technology Program; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Constellation; Quality of service; Computer science; Computer network; Path (computing); Motion planning; Mega-; Real-time computing; Telecommunications; Artificial intelligence; Physics","score_opus":0.05681788074542186,"score_gpt":0.29650450401546286,"score_spread":0.239686623270041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581518","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.061660845,0.00030886676,0.9349792,0.00019908001,0.000024020446,0.00006403186,0.000050919516,0.00018823978,0.0025247696],"genre_scores_gemma":[0.8908921,0.000191916,0.10674763,0.000061073864,0.000013056038,0.00013382062,0.00009663533,0.000047829566,0.0018158498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000106867454,0.000007949001,0.000045963076,0.00005726103,0.00005582661],"domain_scores_gemma":[0.9996269,0.00018916577,0.00006812793,0.000020383175,0.000057552443,0.00003787828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066646,0.0007567995,0.000642937,0.0005057898,0.00041201068,0.00060639234,0.00070173125,0.0005320875,0.0011326019],"category_scores_gemma":[0.001121311,0.00040119851,0.00042585089,0.00053792895,0.00049372826,0.00060800527,0.0006517569,0.00062113494,0.0001045075],"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.000009595501,0.0000069079792,0.00015642786,0.00001023702,0.0000065334984,0.000016798842,0.000011044543,0.9941105,0.00024947233,0.0013237693,0.00015153631,0.003947179],"study_design_scores_gemma":[0.0000018344776,0.000009318263,0.00003145664,7.88035e-7,0.0000011168727,0.0000026093135,0.000004627609,0.9992536,0.000055755856,0.0005685343,0.00006935099,0.0000010156699],"about_ca_topic_score_codex":0.00950903,"about_ca_topic_score_gemma":0.0064876024,"teacher_disagreement_score":0.00950903,"about_ca_system_score_codex":0.0009716034,"about_ca_system_score_gemma":0.0014346439,"threshold_uncertainty_score":0.018907368},"labels":[],"label_agreement":null},{"id":"W4409916814","doi":"10.1109/tcomm.2025.3565584","title":"Mobile Edge Computing Networks: Online Low-Latency and Fresh Service Provisioning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Mobile edge computing; Provisioning; Latency (audio); Mobile telephony; Edge computing; Telecommunications; Enhanced Data Rates for GSM Evolution; Mobile radio; Server","score_opus":0.01964552470552086,"score_gpt":0.28527458108404097,"score_spread":0.2656290563785201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409916814","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.060545273,0.0013779146,0.9313729,0.00070392655,0.00013116685,0.0000690266,0.00008396135,0.00032859255,0.005387309],"genre_scores_gemma":[0.9591632,0.000529485,0.037985485,0.00013995644,0.0000604955,0.000042955864,0.000064914326,0.00003147007,0.0019820072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.000071149036,0.000009276535,0.00006789082,0.00006002605,0.000077713645],"domain_scores_gemma":[0.9995378,0.00023370476,0.00006143197,0.00004139096,0.000087820255,0.00003774423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005527647,0.0007447592,0.00062395184,0.0001590908,0.00037370317,0.00075679296,0.0009908061,0.0007725791,0.0010550412],"category_scores_gemma":[0.0018297256,0.00024238252,0.00023162413,0.000356007,0.000536907,0.001155565,0.00071980804,0.0010489498,0.00017337545],"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.00012344212,0.00010654081,0.0013976325,0.00013228563,0.000034242148,0.00015409091,0.00005413579,0.90815824,0.0057781343,0.01897801,0.0030486197,0.062034644],"study_design_scores_gemma":[0.0000024561343,0.000014193823,0.000063822125,0.000002699147,0.0000035287273,0.000011250253,0.000006208259,0.997531,0.00030168993,0.0018021379,0.0002590022,0.0000020446523],"about_ca_topic_score_codex":0.0064338455,"about_ca_topic_score_gemma":0.008179588,"teacher_disagreement_score":0.0064338455,"about_ca_system_score_codex":0.00089504063,"about_ca_system_score_gemma":0.0011470371,"threshold_uncertainty_score":0.012792766},"labels":[],"label_agreement":null},{"id":"W4410086878","doi":"10.1109/tcomm.2025.3567007","title":"DBRAA: Sub-6 GHz and Millimeter Wave Dual-Band Reconfigurable Antenna Array for ISAC","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Extremely high frequency; Antenna (radio); Antenna array; Reconfigurable antenna; Multi-band device; Electrical engineering; Physics; Electronic engineering; Computer science; Microstrip antenna; Optoelectronics; Telecommunications; Engineering; Coaxial antenna","score_opus":0.028513677166250966,"score_gpt":0.2458977564579314,"score_spread":0.21738407929168044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086878","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.015417434,0.000608408,0.97198266,0.00019300744,0.000118230644,0.000025858855,0.00004843923,0.00055181264,0.011054149],"genre_scores_gemma":[0.44126317,0.0008726524,0.5486525,0.00039753612,0.000136806,0.00014238046,0.00016617271,0.0000936189,0.008275104],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978155,0.000049897448,0.000008468174,0.000046857334,0.000083856605,0.000029370203],"domain_scores_gemma":[0.9998734,0.00002900925,0.000032062515,0.000026747826,0.00002440877,0.000014347095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015955674,0.0005479625,0.0003310715,0.00027243653,0.00017296826,0.0005027446,0.00060682074,0.00047098444,0.001883168],"category_scores_gemma":[0.00023393278,0.00021094942,0.00044132234,0.00032694096,0.00025543006,0.00038157738,0.0004157202,0.00060318917,0.0014194084],"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.00027945545,0.000108048465,0.0015354118,0.00022601077,0.00010821305,0.0003012306,0.000097783886,0.2754283,0.3247495,0.049199406,0.005786866,0.34217978],"study_design_scores_gemma":[0.000043499556,0.00043953906,0.0007367412,0.00003311349,0.00005141171,0.0007045397,0.000046910824,0.8768194,0.07407283,0.006719944,0.040275864,0.000056297067],"about_ca_topic_score_codex":0.00026641667,"about_ca_topic_score_gemma":0.0005016945,"teacher_disagreement_score":0.001883168,"about_ca_system_score_codex":0.00029810308,"about_ca_system_score_gemma":0.00025796608,"threshold_uncertainty_score":0.0062998533},"labels":[],"label_agreement":null},{"id":"W4410537232","doi":"10.1109/tcomm.2025.3571910","title":"Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation Techniques","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Channel (broadcasting); Computer science; Column (typography); Bayesian probability; Algorithm; Tensor (intrinsic definition); Electronic engineering; Mathematics; Artificial intelligence; Telecommunications; Engineering","score_opus":0.040754293905622026,"score_gpt":0.3243394170097982,"score_spread":0.28358512310417616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410537232","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.0063261203,0.00025307215,0.99150074,0.00018729833,0.000040917894,0.000021797789,0.000074544914,0.00029854616,0.0012969176],"genre_scores_gemma":[0.5797289,0.0012814152,0.41173938,0.0004330705,0.00025894295,0.00014961409,0.00070863037,0.00013701538,0.005563019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990884,0.00027426274,0.000034683435,0.00014285425,0.00031313245,0.000146685],"domain_scores_gemma":[0.9983259,0.0007252955,0.00021549095,0.00023344389,0.00040256899,0.00009720768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274681,0.0011910559,0.00090676744,0.00043723357,0.00048767624,0.00079687877,0.001197396,0.00085992547,0.0019488661],"category_scores_gemma":[0.0042918134,0.0005476022,0.0007186216,0.0009057442,0.00092882017,0.0017816798,0.0014220617,0.002058767,0.0008236184],"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.00041671685,0.00012215659,0.0019359277,0.00024859072,0.00012606288,0.00029820844,0.00031278172,0.70670515,0.01900605,0.031667747,0.0067839636,0.23237664],"study_design_scores_gemma":[0.000008267749,0.000030535564,0.00012715862,0.00000810833,0.000010518086,0.000046096473,0.000013686704,0.9938047,0.0018860121,0.0033372834,0.00071141956,0.000016199032],"about_ca_topic_score_codex":0.01018437,"about_ca_topic_score_gemma":0.011156475,"teacher_disagreement_score":0.01018437,"about_ca_system_score_codex":0.00064275996,"about_ca_system_score_gemma":0.0017425233,"threshold_uncertainty_score":0.020250201},"labels":[],"label_agreement":null},{"id":"W4410738567","doi":"10.1109/tcomm.2025.3573444","title":"Ordered Reliability Direct Error Pattern Testing Decoding Algorithm","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Fault Detection and Control Systems","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":"Huawei Technologies (Canada); Dalhousie University","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Reliability (semiconductor); Sequential decoding; List decoding; Error detection and correction; Reliability engineering; Concatenated error correction code; Engineering; Block code","score_opus":0.02729509991514346,"score_gpt":0.2736570403137389,"score_spread":0.24636194039859544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410738567","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.020410046,0.00024259316,0.97266364,0.00015736792,0.00006728556,0.00011428328,0.0001869152,0.0013484957,0.004809359],"genre_scores_gemma":[0.3994901,0.00022811924,0.5929411,0.00024194286,0.000046755962,0.00021560112,0.00072593417,0.000121547615,0.0059888773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.00021587418,0.00007780636,0.00014757761,0.0004634867,0.000115857096],"domain_scores_gemma":[0.9985013,0.0005144857,0.00013601362,0.0003163947,0.00047237898,0.00005939474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547799,0.0005171638,0.00056810107,0.0006925031,0.00028087912,0.00079270976,0.00112813,0.00058734673,0.0027727846],"category_scores_gemma":[0.0031598362,0.0001892641,0.00027627376,0.00055026636,0.0005090813,0.0006634633,0.00090324704,0.00066683,0.001389524],"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.00057834544,0.00011062047,0.0027505145,0.00022149355,0.0000435716,0.00028694072,0.000118878495,0.12709963,0.031440005,0.056818217,0.0053585907,0.7751731],"study_design_scores_gemma":[0.00009826489,0.0002738986,0.0005896495,0.000039303126,0.000023156514,0.0006579657,0.000025715564,0.9212701,0.042146172,0.02666015,0.008177543,0.00003817565],"about_ca_topic_score_codex":0.0013449058,"about_ca_topic_score_gemma":0.0013686181,"teacher_disagreement_score":0.0027727846,"about_ca_system_score_codex":0.0005004079,"about_ca_system_score_gemma":0.0017675598,"threshold_uncertainty_score":0.009275854},"labels":[],"label_agreement":null},{"id":"W4411270537","doi":"10.1109/tcomm.2025.3579703","title":"Mobile Traffic Prediction Using LLMs With Efficient In-Context Demonstration Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"Mitacs","keywords":"Selection (genetic algorithm); Context (archaeology); Computer science; Mobile telephony; Mobile radio; Telecommunications; Artificial intelligence; Geography","score_opus":0.013213217808181934,"score_gpt":0.24524226073041358,"score_spread":0.23202904292223164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411270537","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.18186578,0.0009123258,0.8024676,0.00077715196,0.00014784245,0.00022294483,0.0013798645,0.009174798,0.003051795],"genre_scores_gemma":[0.8523791,0.00016237798,0.14433575,0.00019782771,0.00007860379,0.00019655119,0.0013786288,0.00012850876,0.0011426205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.00028165328,0.000043028682,0.00023288942,0.00015262561,0.000069907685],"domain_scores_gemma":[0.9985153,0.0008329662,0.00012569941,0.00018560542,0.00024864858,0.000091708454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011099449,0.0012678159,0.0010058791,0.0011229834,0.00041743313,0.0008694615,0.0014851934,0.0007905798,0.0014939095],"category_scores_gemma":[0.0046146945,0.00040885963,0.0007909103,0.0006668284,0.000349338,0.001740799,0.0012517655,0.0013667542,0.0006323478],"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.0005733859,0.00059355656,0.024888566,0.0001841029,0.00015437587,0.00036044017,0.00028644098,0.5363345,0.010144814,0.004820153,0.0072278897,0.41443175],"study_design_scores_gemma":[0.000008275827,0.000026981876,0.00041282686,0.0000048592556,0.000008307741,0.000014571506,0.00001673524,0.9968651,0.0010155782,0.0012904352,0.00032996634,0.000006265668],"about_ca_topic_score_codex":0.0067538386,"about_ca_topic_score_gemma":0.012079131,"teacher_disagreement_score":0.0067538386,"about_ca_system_score_codex":0.00062217563,"about_ca_system_score_gemma":0.0009757822,"threshold_uncertainty_score":0.013429046},"labels":[],"label_agreement":null},{"id":"W4411688153","doi":"10.1109/tcomm.2025.3583637","title":"Cell-Free Full-Duplex Communication—An Overview","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","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 Alberta","funders":"","keywords":"Duplex (building); Computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.042732577135999934,"score_gpt":0.2929486101944307,"score_spread":0.25021603305843076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411688153","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.00472382,0.8693458,0.063147806,0.0011184698,0.0014357773,0.00008269303,0.00018959572,0.00022820698,0.059727833],"genre_scores_gemma":[0.055885434,0.90225583,0.024471812,0.0010796852,0.0026698366,0.000116043775,0.00036028566,0.00005162082,0.013109446],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976605,0.000028861461,0.000024486208,0.000055852375,0.000093330724,0.000031497817],"domain_scores_gemma":[0.99967265,0.00016762291,0.000031001917,0.000018214922,0.00008729299,0.000023235976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033240867,0.0006570422,0.00045576924,0.0017972061,0.00038627695,0.0017091124,0.00079624983,0.0011266281,0.0041689635],"category_scores_gemma":[0.0005537064,0.0004905103,0.00036062734,0.001979179,0.0005229725,0.002709916,0.0008294142,0.0012227702,0.002266384],"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.00008247556,0.0001484859,0.0009588538,0.0076025934,0.000051839004,0.0003835355,0.00027725557,0.008854879,0.009962542,0.11491964,0.027418058,0.8293399],"study_design_scores_gemma":[0.0000071513605,0.0002881876,0.0011297088,0.0016500456,0.000056379347,0.001575696,0.00020048444,0.012649354,0.0030779615,0.025492484,0.9537987,0.00007389196],"about_ca_topic_score_codex":0.0012576676,"about_ca_topic_score_gemma":0.0007348845,"teacher_disagreement_score":0.0041689635,"about_ca_system_score_codex":0.00066446763,"about_ca_system_score_gemma":0.0007639428,"threshold_uncertainty_score":0.013946533},"labels":[],"label_agreement":null},{"id":"W4411983358","doi":"10.1109/tcomm.2025.3585578","title":"Toward Multicast NFV-Enabled IoT Frameworks: Game Theory for Mixed-AoAI","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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":"Concordia University","funders":"Natural Science Foundation of Ningbo; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Multicast; Computer science; Game theory; Distributed computing; Computer network; Internet of Things; Embedded system; Mathematics","score_opus":0.03771412842204852,"score_gpt":0.3085123847551772,"score_spread":0.2707982563331287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983358","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.009071861,0.00016831672,0.9848964,0.0002691015,0.00003591546,0.00005810816,0.000039000995,0.00004794451,0.0054133534],"genre_scores_gemma":[0.6948524,0.000793846,0.29620135,0.00040375654,0.0001227802,0.00049996504,0.00011817288,0.00010229693,0.0069053792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989686,0.00046443252,0.00003265079,0.0001274774,0.00025229866,0.0001544754],"domain_scores_gemma":[0.99834454,0.0010606376,0.00019848805,0.00006881081,0.00020066102,0.00012682706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022270468,0.0011004243,0.0007776854,0.00076653744,0.0007101257,0.0016695975,0.0017091117,0.0013808339,0.002348679],"category_scores_gemma":[0.0044019576,0.0004929183,0.0012042538,0.00062443817,0.0015128094,0.002129658,0.0022264237,0.0020888567,0.00019858558],"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.00002592231,0.000048321854,0.00038483058,0.000058505088,0.000029941635,0.0000904197,0.00014863128,0.71305925,0.0008499696,0.2772189,0.00095272006,0.007132625],"study_design_scores_gemma":[0.0000041153667,0.00001121098,0.00003258541,0.000007249552,0.0000038258927,0.000011042034,0.000021837473,0.9542404,0.0000714137,0.045032132,0.00055981905,0.0000044771937],"about_ca_topic_score_codex":0.006849981,"about_ca_topic_score_gemma":0.0043680896,"teacher_disagreement_score":0.006849981,"about_ca_system_score_codex":0.0023474658,"about_ca_system_score_gemma":0.0016973458,"threshold_uncertainty_score":0.017032146},"labels":[],"label_agreement":null},{"id":"W4411983365","doi":"10.1109/tcomm.2025.3585699","title":"Spectrally Efficient RIS-Assisted Full Duplex Communication Using Quadrature Channel Modulation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic engineering; Quadrature (astronomy); Quadrature amplitude modulation; Modulation (music); Channel (broadcasting); Duplex (building); Materials science; Computer science; Physics; Telecommunications; Engineering; Acoustics; Bit error rate","score_opus":0.028330621357194687,"score_gpt":0.2706327238314235,"score_spread":0.24230210247422881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983365","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.24660027,0.0011469688,0.74067557,0.0003031004,0.00016298163,0.00006864986,0.000111091875,0.0011336149,0.009797778],"genre_scores_gemma":[0.8982853,0.00021355675,0.09843725,0.00013286433,0.000047434725,0.000031390075,0.000077965364,0.000020741933,0.002753416],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.000046498295,0.000008715865,0.000043557557,0.00010248114,0.00003861434],"domain_scores_gemma":[0.999746,0.000070131784,0.000051112107,0.00005996939,0.00005883175,0.000013831541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018084314,0.0002730893,0.0003873801,0.00029393024,0.00024008003,0.0005670494,0.00067569414,0.0003536081,0.00094384217],"category_scores_gemma":[0.00035354306,0.00012246548,0.00021696482,0.000313008,0.0003751064,0.00059627875,0.0005226227,0.00035131132,0.00046084105],"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.0006038157,0.00016300686,0.0018001045,0.00024294181,0.000060031012,0.0003169355,0.00021111056,0.028023662,0.6531624,0.019890722,0.00245595,0.29306936],"study_design_scores_gemma":[0.000078332225,0.0009549765,0.0015826395,0.000029699111,0.00005899989,0.0011824052,0.000077863515,0.6130551,0.36142647,0.004633829,0.016845465,0.000074316886],"about_ca_topic_score_codex":0.00021996198,"about_ca_topic_score_gemma":0.00042153493,"teacher_disagreement_score":0.00094384217,"about_ca_system_score_codex":0.00023945344,"about_ca_system_score_gemma":0.0002634216,"threshold_uncertainty_score":0.0031574368},"labels":[],"label_agreement":null},{"id":"W4411983370","doi":"10.1109/tcomm.2025.3585509","title":"Joint Optimization of 3-D Placement and Transmission Power for a Relay Based Covert Communication System","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","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":"Toronto Metropolitan University","funders":"Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Joint (building); Relay; Computer science; Transmission (telecommunications); Power (physics); Electronic engineering; Communications system; Engineering; Computer network; Telecommunications; Physics","score_opus":0.034511773974405524,"score_gpt":0.28388432599865493,"score_spread":0.2493725520242494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983370","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.06355303,0.00062080496,0.9258895,0.0005236703,0.00006653659,0.00010410371,0.00016679602,0.00028864082,0.008787006],"genre_scores_gemma":[0.915942,0.0004550601,0.07922365,0.000096897675,0.000034266875,0.00017010127,0.0001444545,0.0000496615,0.0038838997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.00011693206,0.0000125736,0.00009533638,0.000077405246,0.0000775534],"domain_scores_gemma":[0.9994863,0.00026809616,0.000096474774,0.000028007165,0.00008169199,0.000039290033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053709,0.0018423558,0.001268252,0.00051440863,0.00048690892,0.0011816527,0.00095410156,0.0015270726,0.0028396621],"category_scores_gemma":[0.0015930209,0.0006270655,0.0007275035,0.0008716509,0.0008003421,0.00090722897,0.0011569847,0.00078802963,0.00049044134],"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.000055074506,0.000018908982,0.00025493946,0.000041245046,0.000016855683,0.00012936321,0.000033249147,0.9878956,0.0012177544,0.0026926675,0.0005257201,0.0071185646],"study_design_scores_gemma":[0.000010321687,0.00004812936,0.00008421918,0.0000039630836,0.000009488791,0.00003323199,0.000016570364,0.9980792,0.0003150147,0.0011890993,0.00020552229,0.000005208441],"about_ca_topic_score_codex":0.005556192,"about_ca_topic_score_gemma":0.0036584784,"teacher_disagreement_score":0.005556192,"about_ca_system_score_codex":0.0014584472,"about_ca_system_score_gemma":0.0011242485,"threshold_uncertainty_score":0.011047721},"labels":[],"label_agreement":null},{"id":"W4412375702","doi":"10.1109/tcomm.2025.3587046","title":"Enhancing Resilience Against Jamming Attacks: A Cooperative Anti-Jamming Method Using Direction Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Jamming; Resilience (materials science); Computer science; Electronic engineering; Computer security; Computer network; Engineering; Physics","score_opus":0.029858865139317254,"score_gpt":0.3414343569913991,"score_spread":0.3115754918520819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375702","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.018899746,0.00013948746,0.9795385,0.00006649007,0.00003185243,0.000016897347,0.0000054731618,0.00019263005,0.0011088931],"genre_scores_gemma":[0.5901673,0.0003779673,0.40655592,0.0001075393,0.00008224411,0.00005806153,0.00003391625,0.000042368596,0.0025746918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996327,0.000113053255,0.000014081068,0.00007431118,0.00012382829,0.000042046362],"domain_scores_gemma":[0.999332,0.00024191316,0.00010417404,0.00010284074,0.00017706865,0.00004200382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941756,0.0006101043,0.00044273896,0.00053479,0.00032774112,0.00038392408,0.0006432912,0.0006145004,0.0005482007],"category_scores_gemma":[0.0018331305,0.00024775698,0.00039213427,0.00040542264,0.0004030333,0.00082631357,0.000815394,0.00054649834,0.0002946533],"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.00033104926,0.00018969919,0.0018912466,0.00014483837,0.00009470294,0.0002854201,0.00038245443,0.17202234,0.26914707,0.021496672,0.0012783593,0.5327362],"study_design_scores_gemma":[0.000028022427,0.000353081,0.0007644828,0.0000121811845,0.00003717438,0.0004805404,0.00007676084,0.96340585,0.028379282,0.0033457074,0.0030728139,0.000044117765],"about_ca_topic_score_codex":0.00045333107,"about_ca_topic_score_gemma":0.00067983125,"teacher_disagreement_score":0.0006432912,"about_ca_system_score_codex":0.00012088571,"about_ca_system_score_gemma":0.0004180253,"threshold_uncertainty_score":0.0026135445},"labels":[],"label_agreement":null},{"id":"W4412375768","doi":"10.1109/tcomm.2025.3587048","title":"Power-Efficient Optimization for Coexisting Semantic and Bit-Based Users in NOMA Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Power (physics); Bit (key); Electronic engineering; Power optimization; Computer network; Telecommunications link; Engineering; Physics; Power consumption","score_opus":0.015502145950213013,"score_gpt":0.2546892917713081,"score_spread":0.2391871458210951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375768","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.030151283,0.0006515665,0.96207047,0.00042239513,0.00006820981,0.000039879116,0.00010441561,0.0001322409,0.006359576],"genre_scores_gemma":[0.8916681,0.0010394073,0.10046061,0.00028644965,0.0000958206,0.0001813861,0.00014330389,0.00007168587,0.006053346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992545,0.00030847877,0.00002393864,0.0001320569,0.00013506663,0.00014592767],"domain_scores_gemma":[0.99873275,0.0008665012,0.00012100671,0.000056395787,0.00017205805,0.000051307685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011502343,0.0015651123,0.0010488629,0.00047403414,0.0006057792,0.0013934387,0.0012515665,0.0010864488,0.0018236458],"category_scores_gemma":[0.0027101715,0.000644013,0.00053024513,0.0011160164,0.0013639553,0.001244029,0.0013890808,0.0012950684,0.00044270395],"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.00008068299,0.000037987335,0.0003763696,0.00011058504,0.000039510905,0.0001388446,0.000068781985,0.9553844,0.0025237254,0.021997945,0.001386466,0.017854787],"study_design_scores_gemma":[0.000005326004,0.000024453726,0.0000656434,0.000005199433,0.000006574849,0.00002289549,0.000020153086,0.9929826,0.00027898882,0.0062714415,0.0003111096,0.0000057118273],"about_ca_topic_score_codex":0.0032587505,"about_ca_topic_score_gemma":0.0044716904,"teacher_disagreement_score":0.0032587505,"about_ca_system_score_codex":0.0012325076,"about_ca_system_score_gemma":0.0012015473,"threshold_uncertainty_score":0.008942485},"labels":[],"label_agreement":null},{"id":"W4412536758","doi":"10.1109/tcomm.2025.3591165","title":"Radiation Footprint Control in Cell-Free Cooperative ISAC: Optimal Joint BS Activation and Beamforming Coordination","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Nanoplatforms for cancer theranostics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Joint (building); Footprint; Computer science; Control (management); Electronic engineering; Engineering; Telecommunications","score_opus":0.011926483358400774,"score_gpt":0.23175504064301816,"score_spread":0.2198285572846174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412536758","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.035749774,0.00023099374,0.9584343,0.00015795263,0.00001949905,0.000034597106,0.000025807098,0.00018244464,0.0051645567],"genre_scores_gemma":[0.91165537,0.00018079957,0.08547369,0.000090711765,0.000017590008,0.000101194746,0.000033875796,0.000033158823,0.0024135378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958414,0.00011710619,0.000010670854,0.000083330284,0.000119354416,0.000085281594],"domain_scores_gemma":[0.99952614,0.00023171799,0.00008599722,0.000042919186,0.00006899587,0.000044201508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910289,0.0007025868,0.0005946539,0.00024904535,0.00031837632,0.00066126656,0.0007565287,0.00058883487,0.0008535551],"category_scores_gemma":[0.0011273834,0.0002815011,0.00024438865,0.00045159878,0.00075041445,0.0006931577,0.0009620205,0.0005727938,0.00022397452],"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.00007578732,0.000042068903,0.00032494988,0.00003358356,0.000010961955,0.000059766833,0.00006051103,0.95084906,0.009089758,0.009510729,0.00059852476,0.029344376],"study_design_scores_gemma":[0.000008140145,0.000038216094,0.00008369498,0.0000024499911,0.0000042851843,0.000017427941,0.000018789293,0.99518114,0.0018384173,0.0023980055,0.00040427112,0.0000050901117],"about_ca_topic_score_codex":0.0025943753,"about_ca_topic_score_gemma":0.002836693,"teacher_disagreement_score":0.0025943753,"about_ca_system_score_codex":0.00070094754,"about_ca_system_score_gemma":0.0009957824,"threshold_uncertainty_score":0.005158484},"labels":[],"label_agreement":null},{"id":"W4412623610","doi":"10.1109/tcomm.2025.3592583","title":"Cooperative Jamming Detection Using Low-Rank Structure of Received Signal Matrix","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radar Systems and Signal Processing","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":"École de Technologie Supérieure","funders":"","keywords":"Jamming; Detection theory; Computer science; Signal processing; Matrix (chemical analysis); Rank (graph theory); Matrix algebra; Electronic engineering; Algorithm; Telecommunications; Mathematics; Engineering; Detector; Physics; Materials science","score_opus":0.01547889449179436,"score_gpt":0.2689468440726552,"score_spread":0.25346794958086083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623610","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.03841029,0.00009827372,0.9599805,0.00005751305,0.000011023134,0.000030516621,0.00002014094,0.00024748294,0.0011442407],"genre_scores_gemma":[0.7997128,0.00017204577,0.19878432,0.00006885471,0.00003215368,0.00005789125,0.00008408087,0.000028237899,0.0010597548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987921,0.0003586926,0.000055189153,0.00019827236,0.0005054391,0.00009033106],"domain_scores_gemma":[0.996838,0.0016239033,0.0006128448,0.00037816665,0.00047657397,0.00007054886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011635255,0.00076423486,0.000518235,0.0008509849,0.0002898899,0.0006628875,0.00062459346,0.0006118658,0.0005511054],"category_scores_gemma":[0.006782161,0.000272834,0.00043326645,0.0005403483,0.0008034517,0.0011052991,0.0006795381,0.00063487137,0.00027189267],"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.0005379443,0.00025953114,0.0046660146,0.00042908976,0.00016949874,0.00035459187,0.00051709265,0.5306084,0.15595573,0.067545444,0.0010066137,0.23794995],"study_design_scores_gemma":[0.000012668085,0.00017576551,0.00070167717,0.000009117686,0.000013977951,0.00019998512,0.000023861048,0.97292536,0.019782435,0.0056333677,0.0004978816,0.000023909955],"about_ca_topic_score_codex":0.00044547755,"about_ca_topic_score_gemma":0.0005983724,"teacher_disagreement_score":0.0011635255,"about_ca_system_score_codex":0.00034796062,"about_ca_system_score_gemma":0.0005695647,"threshold_uncertainty_score":0.0061534047},"labels":[],"label_agreement":null},{"id":"W4412623651","doi":"10.1109/tcomm.2025.3592606","title":"A Novel Deep Learning-Based Receiver for Non-Coherent Chaotic Communication Systems With Temporal Dependencies and Spectral Properties of Chaotic Signals","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","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":"Université du Québec à Montréal","funders":"Science and Technology Projects of Fujian Province","keywords":"Chaotic; Computer science; Chaotic systems; Spread spectrum; Electronic engineering; Artificial intelligence; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.022459891474809097,"score_gpt":0.24060137253277575,"score_spread":0.21814148105796666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623651","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.021118946,0.0003220824,0.974451,0.00027100934,0.00007854867,0.000034432996,0.0000606535,0.0005279489,0.0031354306],"genre_scores_gemma":[0.72161204,0.00048870634,0.2649407,0.00060781254,0.00011425438,0.000087067085,0.00020233705,0.00005529034,0.01189181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.000050906932,0.000017270006,0.000063000734,0.00012832835,0.00004171089],"domain_scores_gemma":[0.99973184,0.00007836588,0.000034513574,0.000030063798,0.00010473131,0.000020348936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045335878,0.00046182153,0.00048069915,0.0002378039,0.0003242083,0.00049755676,0.0010029357,0.00078431086,0.0013539082],"category_scores_gemma":[0.0008173703,0.0002497923,0.00031901893,0.00024815626,0.0004432472,0.0009571908,0.0008027327,0.0010461784,0.00049914664],"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.0005088887,0.0004095895,0.002733465,0.0004565594,0.0001988442,0.00047559565,0.0002803445,0.26567093,0.22009613,0.051963285,0.0073291184,0.44987723],"study_design_scores_gemma":[0.000017659764,0.0001049662,0.00016330113,0.00001433299,0.00002238874,0.00011911687,0.0000062759855,0.97575855,0.019244164,0.0022299478,0.0023040364,0.000015278734],"about_ca_topic_score_codex":0.0011107281,"about_ca_topic_score_gemma":0.0024362437,"teacher_disagreement_score":0.0013539082,"about_ca_system_score_codex":0.00060127577,"about_ca_system_score_gemma":0.000823775,"threshold_uncertainty_score":0.0045292974},"labels":[],"label_agreement":null},{"id":"W4412623658","doi":"10.1109/tcomm.2025.3592581","title":"Handoff Design in User-Centric Cell-Free Massive MIMO Networks Using DRL","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; University of Toronto; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Handover; Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.023007865553227185,"score_gpt":0.2539787545558812,"score_spread":0.23097088900265403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623658","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.056712136,0.00022491768,0.9393839,0.00026849896,0.000050607323,0.000039661732,0.000026772688,0.00053042016,0.00276309],"genre_scores_gemma":[0.97856015,0.000053497766,0.019993164,0.000097768025,0.000015872154,0.00002497581,0.000013643211,0.000012964968,0.0012279758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965584,0.000082212806,0.000014849459,0.00008776373,0.00007729766,0.000081963626],"domain_scores_gemma":[0.9995491,0.00016012124,0.000082325314,0.000044600223,0.00010039319,0.000063323714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066271983,0.00046510578,0.00050610694,0.00018296261,0.00034145484,0.00052690477,0.00096666906,0.00061224005,0.0009685516],"category_scores_gemma":[0.0011451091,0.00028868433,0.00022830896,0.00015930604,0.00058955065,0.0005728403,0.00078141,0.0007102364,0.00023989903],"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.00011625506,0.0000728652,0.0009484084,0.00004319628,0.000026682748,0.00014043636,0.00009021383,0.93854445,0.0108764395,0.0043838364,0.00070389884,0.044053312],"study_design_scores_gemma":[0.000003945371,0.000025408683,0.000061070896,0.0000014079975,0.0000023688972,0.000010929587,0.000004181649,0.9988953,0.00043929112,0.0004687971,0.000084749256,0.000002487707],"about_ca_topic_score_codex":0.0028967368,"about_ca_topic_score_gemma":0.003425506,"teacher_disagreement_score":0.0028967368,"about_ca_system_score_codex":0.0006432643,"about_ca_system_score_gemma":0.0007036358,"threshold_uncertainty_score":0.005759716},"labels":[],"label_agreement":null},{"id":"W4412722439","doi":"10.1109/tcomm.2025.3593643","title":"Cross-Modal Semantic Transmission Strategy for Mobile Scenarios","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IPv6, Mobility, Handover, Networks, Security","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 Waterloo","funders":"Qinglan Project of Jiangsu Province of China; National Natural Science Foundation of China","keywords":"Computer science; Modal; Transmission (telecommunications); Mobile telephony; Electronic engineering; Computer network; Telecommunications; Mobile radio; Engineering; Materials science","score_opus":0.023340102178004613,"score_gpt":0.3099964418576507,"score_spread":0.2866563396796461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722439","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.009549082,0.0001308903,0.9875665,0.000087945766,0.00002473207,0.000019920479,0.000017106164,0.00014475391,0.0024590183],"genre_scores_gemma":[0.77703774,0.00034802096,0.21733855,0.00019661554,0.000049090875,0.000112243004,0.00015145271,0.00008442977,0.0046817656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996984,0.00009159968,0.000019451432,0.000051540897,0.00010098332,0.000038134865],"domain_scores_gemma":[0.99959165,0.00016043163,0.000047093283,0.000055620258,0.000112422356,0.00003281824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395333,0.0007217458,0.00046865497,0.00053897384,0.00049812475,0.00061688514,0.0009236865,0.0008133406,0.0021000048],"category_scores_gemma":[0.001404552,0.00024122313,0.0005530872,0.0004102198,0.00063693954,0.0017139626,0.0016957993,0.0007902801,0.0004496115],"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.0002683667,0.00009702344,0.00066924095,0.00023219135,0.000073423376,0.0005987377,0.0004663443,0.61600274,0.056343433,0.13708329,0.0029401805,0.18522501],"study_design_scores_gemma":[0.0000088567995,0.00007366213,0.000075175114,0.0000075566313,0.000012091561,0.00015528116,0.000048850477,0.97944516,0.0042262175,0.014455573,0.001477356,0.000014130387],"about_ca_topic_score_codex":0.0009569369,"about_ca_topic_score_gemma":0.000855599,"teacher_disagreement_score":0.0021000048,"about_ca_system_score_codex":0.00041424172,"about_ca_system_score_gemma":0.0005337788,"threshold_uncertainty_score":0.0070251822},"labels":[],"label_agreement":null},{"id":"W4412939912","doi":"10.1109/tcomm.2025.3595728","title":"Spectral Efficiency Analysis of Near-Field Holographic MIMO Over Ricean Fading Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":0,"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":"European Research Council; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Fading; MIMO; Electronic engineering; Computer science; Field (mathematics); Fading distribution; Spectral efficiency; Telecommunications; Channel (broadcasting); Engineering; Rayleigh fading; Mathematics","score_opus":0.017016397045830543,"score_gpt":0.26355113786251255,"score_spread":0.246534740816682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412939912","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.1160874,0.0020630474,0.8546815,0.00038896952,0.000055379653,0.00003765545,0.00019462022,0.00023414014,0.0262573],"genre_scores_gemma":[0.9792797,0.0014511602,0.016157752,0.00013848355,0.00005382338,0.00004285996,0.00010372769,0.00004150498,0.002730968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919695,0.00023302114,0.00002818673,0.000095383126,0.00027702763,0.00016940886],"domain_scores_gemma":[0.9980996,0.0010171797,0.00024584186,0.00018681002,0.00040400735,0.000046472982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919423,0.0009654266,0.0006509232,0.0007186658,0.00038570492,0.0009787398,0.0006381989,0.0006156174,0.0020195963],"category_scores_gemma":[0.003077382,0.0002935438,0.00051454885,0.00094699993,0.001163491,0.0010576084,0.0008727559,0.00053540507,0.0006096683],"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.00015476524,0.000050461582,0.0019451817,0.00019559494,0.000080248734,0.0004224126,0.00020494442,0.855894,0.01880821,0.101352006,0.0013634287,0.019528653],"study_design_scores_gemma":[0.0000044795547,0.000039778526,0.0006266674,0.000021979838,0.000016095446,0.00015735999,0.000062995,0.9842353,0.002902605,0.011319967,0.0005931781,0.000019504336],"about_ca_topic_score_codex":0.0016093809,"about_ca_topic_score_gemma":0.00095646427,"teacher_disagreement_score":0.0020195963,"about_ca_system_score_codex":0.0009896618,"about_ca_system_score_gemma":0.00067429745,"threshold_uncertainty_score":0.007180512},"labels":[],"label_agreement":null},{"id":"W4413212913","doi":"10.1109/tcomm.2025.3597660","title":"Cell-Free Massive MIMO SWIPT With Beyond Diagonal Reconfigurable Intelligent Surfaces","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"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":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; European Commission; Department for the Economy","keywords":"MIMO; Computer science; Diagonal; Electronic engineering; Engineering; Telecommunications; Beamforming; Mathematics","score_opus":0.015529626569516893,"score_gpt":0.24173722365507233,"score_spread":0.22620759708555543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212913","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.3310273,0.0008759346,0.64748186,0.00030565963,0.00013194978,0.000040840798,0.000080856225,0.0006054439,0.019450061],"genre_scores_gemma":[0.9630312,0.00017059447,0.034913085,0.00005813824,0.0000142246345,0.000019998444,0.00003097712,0.000012276584,0.001749424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998592,0.00003379392,0.0000036846848,0.000030062038,0.00004411717,0.000029167513],"domain_scores_gemma":[0.99982893,0.000065163855,0.000037188816,0.000028813527,0.00002414961,0.000015654083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013028613,0.0005239702,0.0004212539,0.0001292747,0.00017606122,0.00056717184,0.0005291793,0.00037982644,0.00077365985],"category_scores_gemma":[0.00030294195,0.00016938426,0.00031307995,0.00026298946,0.00046415307,0.0005257379,0.0005679787,0.00038394786,0.0003114767],"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.00017267597,0.00011163013,0.0016531363,0.00017599574,0.000081811595,0.0008527891,0.00015159603,0.7824332,0.12293379,0.025218494,0.0012846434,0.06493014],"study_design_scores_gemma":[0.00000824767,0.00014137228,0.0002369702,0.000003843256,0.000011174859,0.0000914809,0.000029562532,0.9871703,0.007975105,0.0032661383,0.0010550737,0.000010695695],"about_ca_topic_score_codex":0.00051969703,"about_ca_topic_score_gemma":0.00074627507,"teacher_disagreement_score":0.00077365985,"about_ca_system_score_codex":0.00025552823,"about_ca_system_score_gemma":0.00018091593,"threshold_uncertainty_score":0.002588153},"labels":[],"label_agreement":null},{"id":"W4413212977","doi":"10.1109/tcomm.2025.3597810","title":"A Multi-Agent DRL-Based Dynamic Resource Allocation in O-RAN-Enabled TN-NTN Metaverse Services","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","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":"Université du Québec à Montréal","funders":"Qatar National Research Fund","keywords":"Computer science; Resource allocation; Resource (disambiguation); Computer network; Distributed computing","score_opus":0.02391676841734021,"score_gpt":0.2875243269563546,"score_spread":0.2636075585390144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212977","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.05750677,0.00032540533,0.9309348,0.00045286157,0.00008037305,0.00009733825,0.000065144966,0.00043730024,0.010099906],"genre_scores_gemma":[0.9497042,0.00012510845,0.04641468,0.00013656501,0.00001625513,0.00008043815,0.000044912893,0.000025762396,0.0034520908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00007221742,0.000013966128,0.00009062242,0.000080172475,0.00008771957],"domain_scores_gemma":[0.99973637,0.00008131813,0.000046380537,0.000020178428,0.000057080168,0.00005863687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052561815,0.0005165248,0.000705531,0.00021271853,0.0005180913,0.0010208859,0.0011787972,0.0007548267,0.0020978854],"category_scores_gemma":[0.0008579195,0.00028074766,0.00050154846,0.00020326643,0.00058213796,0.0007100929,0.0015372758,0.00084701437,0.00026277718],"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.00007870713,0.000058990987,0.00053324975,0.00004527756,0.000021732845,0.0002103891,0.00006675839,0.9675644,0.00391945,0.0074332603,0.00087841885,0.019189544],"study_design_scores_gemma":[0.0000053045424,0.000014647918,0.000031762276,0.0000020468044,0.0000027852548,0.000009416719,0.0000080523805,0.9988991,0.0002049936,0.00058140233,0.0002380749,0.0000023095374],"about_ca_topic_score_codex":0.0075022327,"about_ca_topic_score_gemma":0.006292391,"teacher_disagreement_score":0.0075022327,"about_ca_system_score_codex":0.0007593579,"about_ca_system_score_gemma":0.0013212583,"threshold_uncertainty_score":0.014917135},"labels":[],"label_agreement":null},{"id":"W4413277705","doi":"10.1109/tcomm.2025.3599900","title":"Fundamental Tradeoff Between Computation and Communication With Joint Coding and Interference Management in Wireless Distributed Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","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":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Coding (social sciences); Interference (communication); Computation; Joint (building); Computer network; Distributed computing; Telecommunications; Electronic engineering; Engineering; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.036934669478127326,"score_gpt":0.28132045936146954,"score_spread":0.24438578988334222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413277705","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.07414546,0.0014732245,0.9118731,0.0011876603,0.00006699969,0.00004638119,0.000031004565,0.00010884212,0.01106736],"genre_scores_gemma":[0.929397,0.00073194667,0.06830965,0.00013485014,0.00008663278,0.000084087405,0.000016935164,0.00003456935,0.0012043437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794585,0.0008186413,0.00006344659,0.00021962647,0.00066086894,0.00029166625],"domain_scores_gemma":[0.99481684,0.003882071,0.00029887748,0.0005740213,0.0003129576,0.00011523732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026318517,0.00075889163,0.0006316749,0.00044483112,0.00075580925,0.0018825575,0.0014715826,0.000934727,0.0010333045],"category_scores_gemma":[0.007414101,0.0003299979,0.0002749413,0.0009974061,0.0019969512,0.0038407284,0.0016685199,0.0013949755,0.00015809998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014404283,0.00009157903,0.0006397019,0.00023816875,0.000038692036,0.00014014871,0.00027373657,0.48699552,0.019905487,0.43573302,0.0009963136,0.0548036],"study_design_scores_gemma":[0.0000134833,0.00010942068,0.0001717836,0.000017708377,0.000014907412,0.00011625011,0.00008501253,0.89430505,0.0058377124,0.09787288,0.0014346892,0.000021223741],"about_ca_topic_score_codex":0.0006831149,"about_ca_topic_score_gemma":0.0011374555,"teacher_disagreement_score":0.0026318517,"about_ca_system_score_codex":0.0015744263,"about_ca_system_score_gemma":0.0013224089,"threshold_uncertainty_score":0.013918757},"labels":[],"label_agreement":null},{"id":"W4413277782","doi":"10.1109/tcomm.2025.3599901","title":"Hybrid Beamforming Design for RSMA-Enabled Near-Field Integrated Sensing and Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Electronic engineering; Field (mathematics); Computer science; Engineering","score_opus":0.030205145550511923,"score_gpt":0.2591823782947144,"score_spread":0.22897723274420248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413277782","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.0061102123,0.000097683704,0.99135476,0.000062476385,0.000019642948,0.000018264493,0.000017616661,0.0001543877,0.0021649469],"genre_scores_gemma":[0.43839103,0.00025304584,0.5565438,0.00019022725,0.000043859607,0.00013644682,0.00008142236,0.000041482657,0.0043186364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963045,0.00009678184,0.0000151410595,0.00007069847,0.00015417435,0.00003273196],"domain_scores_gemma":[0.9997359,0.0000792248,0.000045359157,0.000031515192,0.000089045534,0.000018902057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689996,0.00057959295,0.00030898018,0.00024219288,0.00019990021,0.000554551,0.0005931256,0.000455253,0.0020568145],"category_scores_gemma":[0.00061890774,0.00019827795,0.0002234366,0.00038116486,0.00036979828,0.00064613187,0.0005344569,0.0004997415,0.0008798476],"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.00024096787,0.00013584635,0.0010871948,0.00018657971,0.000079701,0.00014155007,0.00015785781,0.34448263,0.23502453,0.062370308,0.0037981237,0.35229465],"study_design_scores_gemma":[0.00001534976,0.00016304066,0.0001708373,0.000011084078,0.000010345626,0.00011746268,0.000021109485,0.96912885,0.02068797,0.004790202,0.0048650634,0.00001876335],"about_ca_topic_score_codex":0.00052693416,"about_ca_topic_score_gemma":0.001028131,"teacher_disagreement_score":0.0020568145,"about_ca_system_score_codex":0.00039548863,"about_ca_system_score_gemma":0.00046245212,"threshold_uncertainty_score":0.0068807006},"labels":[],"label_agreement":null},{"id":"W4413359259","doi":"10.1109/tcomm.2025.3600568","title":"Performance Analysis and Enhancement of P-LDPC Codes for Lossy Compression of Binary Sources","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Low-density parity-check code; Lossy compression; Electronic engineering; Computer science; Binary number; Compression (physics); Decoding methods; Algorithm; Materials science; Mathematics; Engineering; Arithmetic","score_opus":0.026199155251223852,"score_gpt":0.313538639331471,"score_spread":0.2873394840802472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359259","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.17577033,0.0016055998,0.80995417,0.000559849,0.000036250818,0.000069012625,0.00011276123,0.00054491113,0.011346997],"genre_scores_gemma":[0.9280105,0.0012530077,0.06863693,0.00008828524,0.00003363865,0.000051194005,0.0001134189,0.000057118836,0.001755935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990946,0.00026513374,0.000026659989,0.00008683545,0.00046151772,0.00006528836],"domain_scores_gemma":[0.9956749,0.0026829946,0.00038113625,0.00039157344,0.0008138656,0.000055445238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049684,0.0005915711,0.00034006865,0.0006426037,0.00026854582,0.0006932839,0.00045598717,0.00048414434,0.00096080365],"category_scores_gemma":[0.00728309,0.00020774182,0.00020079843,0.0005826487,0.0006880797,0.0009547045,0.0005890869,0.00066058687,0.00028101358],"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.00036165738,0.00005253301,0.0019887297,0.00018861047,0.00003805575,0.0001784283,0.00016867509,0.80868256,0.06091629,0.053004395,0.00081510463,0.07360494],"study_design_scores_gemma":[0.000004414599,0.00005230833,0.00029027124,0.000010479539,0.000006423798,0.00006315001,0.000008467082,0.9804017,0.015462143,0.0032986295,0.00039388926,0.000008127306],"about_ca_topic_score_codex":0.0012221803,"about_ca_topic_score_gemma":0.0011458336,"teacher_disagreement_score":0.0013049684,"about_ca_system_score_codex":0.0011826521,"about_ca_system_score_gemma":0.0009273385,"threshold_uncertainty_score":0.008580744},"labels":[],"label_agreement":null},{"id":"W4413359266","doi":"10.1109/tcomm.2025.3600529","title":"A Hypernetwork Framework for Learning Adaptive Beamforming Schemes in RIS Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"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","keywords":"Beamforming; Computer science; Adaptive beamformer; Electronic engineering; Computer architecture; Telecommunications; Engineering","score_opus":0.03158023583484575,"score_gpt":0.29312365746922214,"score_spread":0.2615434216343764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359266","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.004999134,0.0002413184,0.99120235,0.00016669965,0.000027761474,0.000026567755,0.00005140431,0.00018157688,0.0031031498],"genre_scores_gemma":[0.7060942,0.0008401648,0.27774978,0.00043822208,0.00015813201,0.00051198114,0.00035121583,0.00015746565,0.013698849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996176,0.00015994845,0.000016413856,0.00008058776,0.00007800716,0.00004738242],"domain_scores_gemma":[0.9993199,0.00040840966,0.00006107059,0.00004814583,0.00012267227,0.000039678605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908,0.0011051644,0.00075410877,0.0005535674,0.00041919333,0.000899776,0.0015026296,0.0013012375,0.0040681455],"category_scores_gemma":[0.0023549597,0.00055082445,0.00053091446,0.0006240737,0.0010579092,0.00156475,0.0012972913,0.0019424325,0.0006845985],"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.000018295033,0.000013348652,0.000109524255,0.000021463726,0.000012445493,0.00002563874,0.000015831763,0.9760503,0.0005235583,0.011049187,0.0004845242,0.011675866],"study_design_scores_gemma":[0.0000026430369,0.00000921523,0.000015869311,0.0000026629232,0.000001732893,0.0000035510027,0.0000024405986,0.99520147,0.00009432401,0.004451147,0.00021274597,0.00000206203],"about_ca_topic_score_codex":0.005280375,"about_ca_topic_score_gemma":0.0061832713,"teacher_disagreement_score":0.005280375,"about_ca_system_score_codex":0.001097802,"about_ca_system_score_gemma":0.0009840248,"threshold_uncertainty_score":0.01360929},"labels":[],"label_agreement":null},{"id":"W4413554257","doi":"10.1109/tcomm.2025.3602366","title":"A Novel CNN-Based Standalone Detector for Faster-Than-Nyquist Signaling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","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":"Carleton University; University of Saskatchewan","funders":"","keywords":"Detector; Computer science; Nyquist–Shannon sampling theorem; Electronic engineering; Telecommunications; Engineering","score_opus":0.03585470650869732,"score_gpt":0.28586555918146267,"score_spread":0.25001085267276535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413554257","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.03187211,0.00043527628,0.9606256,0.00021213003,0.00014003488,0.00006250396,0.00018808382,0.0011461322,0.005318157],"genre_scores_gemma":[0.5612059,0.000490382,0.42606932,0.0005519177,0.00008628045,0.00008887601,0.0005293316,0.00008349463,0.010894404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968886,0.00002653766,0.000013401605,0.00006374127,0.00015685325,0.000050745024],"domain_scores_gemma":[0.99964976,0.00008808425,0.00004289168,0.000045878554,0.00015025563,0.000023122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004135664,0.0005373227,0.00041354785,0.00044195613,0.0002513998,0.00056190515,0.00093535596,0.00063519855,0.0017609549],"category_scores_gemma":[0.0010330884,0.00020394962,0.00025856937,0.000306918,0.0003314135,0.00081907347,0.00058613403,0.0006381879,0.00064377027],"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.00051766814,0.00019193647,0.0028992544,0.00023916103,0.00011449317,0.0002999125,0.000086338056,0.09487366,0.25797358,0.021746047,0.006338137,0.6147198],"study_design_scores_gemma":[0.00001779945,0.00011627783,0.00060406094,0.000016729122,0.000032971595,0.00027472808,0.000010529053,0.9209026,0.07108651,0.0020075007,0.0049086115,0.00002169899],"about_ca_topic_score_codex":0.002528445,"about_ca_topic_score_gemma":0.0054225107,"teacher_disagreement_score":0.002528445,"about_ca_system_score_codex":0.0007604894,"about_ca_system_score_gemma":0.0011700875,"threshold_uncertainty_score":0.005891025},"labels":[],"label_agreement":null},{"id":"W4413925946","doi":"10.1109/tcomm.2025.3605463","title":"Super-Resolution Angle Estimation for RIS-Aided Wideband mmWave Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Wideband; Electronic engineering; Computer science; Remote sensing; Engineering; Geology","score_opus":0.04902322468381776,"score_gpt":0.29535819902970367,"score_spread":0.24633497434588592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925946","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.004494479,0.00017670066,0.9944022,0.00005116903,0.000018519686,0.000013615599,0.000021492475,0.000113234324,0.0007086506],"genre_scores_gemma":[0.39618924,0.00076990254,0.59886503,0.00020796341,0.00008478985,0.00010875309,0.00021608178,0.00006149668,0.003496703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.00023354423,0.000052930074,0.0001440939,0.00041657867,0.000083542254],"domain_scores_gemma":[0.99854183,0.00069650996,0.00018134684,0.0002594188,0.00027294797,0.00004798307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083361263,0.0007068561,0.00059518777,0.0003801555,0.00029315028,0.0005670435,0.00084015896,0.0006031127,0.001801654],"category_scores_gemma":[0.0036488776,0.0003375571,0.00033549065,0.00057830167,0.0004941247,0.001712939,0.0012563231,0.0010165587,0.0007369719],"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.0006109267,0.00010128825,0.002097434,0.00025972433,0.00007572818,0.00021313872,0.0002889184,0.3534208,0.1118279,0.04742448,0.0023811255,0.48129848],"study_design_scores_gemma":[0.000019486459,0.00009577814,0.0003411468,0.0000192921,0.000014495006,0.00015421535,0.00003351031,0.9647534,0.025802819,0.005379045,0.003358441,0.000028336977],"about_ca_topic_score_codex":0.0009980415,"about_ca_topic_score_gemma":0.0016267007,"teacher_disagreement_score":0.001801654,"about_ca_system_score_codex":0.00033410083,"about_ca_system_score_gemma":0.00055683806,"threshold_uncertainty_score":0.0060271025},"labels":[],"label_agreement":null},{"id":"W4413925949","doi":"10.1109/tcomm.2025.3605466","title":"QoS-Aware NOMA Design for Downlink Pinching-Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Noma; Telecommunications link; Computer science; Quality of service; Antenna (radio); Electronic engineering; Computer network; Telecommunications; Engineering","score_opus":0.04436238810960799,"score_gpt":0.28950746102610675,"score_spread":0.24514507291649876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925949","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.032703403,0.0007352578,0.95964277,0.00024530164,0.000108549655,0.000047114532,0.00006368344,0.00022146049,0.0062324274],"genre_scores_gemma":[0.9306104,0.00070821575,0.06605173,0.00015054931,0.000094799245,0.00011485136,0.00006734651,0.00004369618,0.002158402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.00022603189,0.000020861286,0.000093354,0.0001236808,0.00011749844],"domain_scores_gemma":[0.9992895,0.00032020986,0.00010833898,0.000054122112,0.00017760094,0.000050201634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059781154,0.0014232532,0.0009114319,0.0003218229,0.0004913255,0.0012152068,0.001032556,0.00082721206,0.00190787],"category_scores_gemma":[0.0016287992,0.000526075,0.00043575492,0.00060247787,0.00066478556,0.0008136216,0.0009702293,0.0008945339,0.0005327574],"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.00012591595,0.000030331272,0.0006087132,0.00010644004,0.000035806148,0.00020133019,0.00008152827,0.9536432,0.010647264,0.008714156,0.0012658291,0.024539456],"study_design_scores_gemma":[0.0000070215824,0.000049030867,0.000077154255,0.00000454593,0.0000082601855,0.000042891814,0.000023525177,0.99752444,0.00071526086,0.0011141418,0.0004273731,0.0000063855764],"about_ca_topic_score_codex":0.0019339031,"about_ca_topic_score_gemma":0.001963081,"teacher_disagreement_score":0.0019339031,"about_ca_system_score_codex":0.00071013183,"about_ca_system_score_gemma":0.0007623092,"threshold_uncertainty_score":0.0063824058},"labels":[],"label_agreement":null},{"id":"W4414008401","doi":"10.1109/tcomm.2025.3606647","title":"Knowledge Sharing-Enabled Semantic Rate Maximization for Multi-Cell Task-Oriented Hybrid Semantic-Bit Communication Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Maximization; Bit error rate; Computer network; Computer architecture; Distributed computing; Channel (broadcasting); Engineering; Mathematics","score_opus":0.035913565002770986,"score_gpt":0.290979862205952,"score_spread":0.255066297203181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008401","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.029497623,0.00034781595,0.9664288,0.00017205795,0.000028087257,0.000039731123,0.00006330828,0.00015737933,0.0032651965],"genre_scores_gemma":[0.8996989,0.00031180755,0.097298585,0.00012577408,0.00003693335,0.00013241766,0.00011188521,0.000054635828,0.0022291585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00028864207,0.000039626924,0.00017346155,0.00021670062,0.00018718997],"domain_scores_gemma":[0.9987582,0.00065967714,0.0001881466,0.00010081611,0.00021809929,0.00007502242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447617,0.0011236367,0.0010235026,0.0006498063,0.0006886409,0.0013954911,0.0016349605,0.00096911745,0.0016301839],"category_scores_gemma":[0.003354182,0.0003335496,0.0004317023,0.0012433401,0.00086251897,0.0019830274,0.0018731545,0.00083602173,0.00030142453],"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.0001605239,0.00006227111,0.00030327064,0.000111046895,0.000030584266,0.00009219114,0.00013511602,0.9263888,0.004859392,0.025315747,0.0011709493,0.041370127],"study_design_scores_gemma":[0.000006298427,0.000032090607,0.000047809393,0.0000046373266,0.0000069335315,0.000025612913,0.000020241261,0.99131525,0.0009230393,0.0072923433,0.00031894044,0.000006697253],"about_ca_topic_score_codex":0.002265628,"about_ca_topic_score_gemma":0.0024645142,"teacher_disagreement_score":0.002265628,"about_ca_system_score_codex":0.0012668811,"about_ca_system_score_gemma":0.0013571299,"threshold_uncertainty_score":0.00919193},"labels":[],"label_agreement":null},{"id":"W4414008967","doi":"10.1109/tcomm.2025.3606641","title":"Efficient STAR-RIS Mode for Energy Minimization in WPT-FL Networks With NOMA","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","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":"Thompson Rivers University; University of the Fraser Valley; Université Laval","funders":"","keywords":"Noma; Minification; Electronic engineering; Computer science; Energy (signal processing); Mode (computer interface); Electrical engineering; Physics; Engineering; Telecommunications; Telecommunications link","score_opus":0.01217439715830907,"score_gpt":0.24447084893080984,"score_spread":0.23229645177250077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008967","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.026243804,0.0005968082,0.965116,0.00029005588,0.000055899247,0.00004540158,0.000082278784,0.00013623456,0.007433496],"genre_scores_gemma":[0.8716777,0.0009994133,0.11953144,0.00031107114,0.000105382904,0.00027798925,0.00017726075,0.00008204442,0.006837763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995857,0.00015732842,0.000013943451,0.00008392401,0.000085433545,0.000073730545],"domain_scores_gemma":[0.99956435,0.00027046568,0.00005048048,0.000028513505,0.000058751873,0.00002741968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896217,0.0011291547,0.00075810816,0.00030349637,0.00046067903,0.0009993436,0.0009725258,0.00079701014,0.0019639763],"category_scores_gemma":[0.0012637572,0.00040733148,0.0005394642,0.0006516579,0.00081333757,0.0011125919,0.0011727571,0.00089489995,0.00042446074],"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.00013883691,0.00006414799,0.00062542007,0.00016047564,0.000050022823,0.00024802503,0.00015453792,0.92361766,0.006620435,0.027898308,0.00258084,0.037841257],"study_design_scores_gemma":[0.0000052491946,0.000034340737,0.000075421805,0.000007683683,0.0000067894325,0.000035843317,0.00002977336,0.99324566,0.00053895783,0.0054918025,0.0005226972,0.0000058463966],"about_ca_topic_score_codex":0.0017370493,"about_ca_topic_score_gemma":0.0029124583,"teacher_disagreement_score":0.0019639763,"about_ca_system_score_codex":0.00070482364,"about_ca_system_score_gemma":0.0006538782,"threshold_uncertainty_score":0.0065701604},"labels":[],"label_agreement":null},{"id":"W4414230458","doi":"10.1109/tcomm.2025.3610221","title":"Resilience of Mega-Satellite Constellations: How Node Failures Impact Inter-Satellite Networking Over Time?","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":5,"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":"Division of Electrical, Communications and Cyber Systems; Japan Science and Technology Agency; China Scholarship Council; Ministry of Education, India; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Resilience (materials science); Node (physics); Constellation; Survivability; Betweenness centrality; Satellite constellation; Satellite; Leverage (statistics)","score_opus":0.021820230298060742,"score_gpt":0.28371442148037734,"score_spread":0.2618941911823166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414230458","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.73062545,0.0025922153,0.25328213,0.0030220337,0.00021002484,0.00007299678,0.0005232897,0.0003227426,0.009349195],"genre_scores_gemma":[0.9947313,0.000503344,0.00396372,0.00005968093,0.00002350241,0.000012877743,0.00006911657,0.000024353325,0.00061211817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00015159049,0.000018478282,0.000097467404,0.0001094884,0.00012830299],"domain_scores_gemma":[0.99658775,0.0015931355,0.00080022897,0.00033930747,0.00042016484,0.0002592926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013382535,0.00051324273,0.0004799096,0.0009039212,0.0005516086,0.0010156783,0.0013107868,0.0008000588,0.0017708889],"category_scores_gemma":[0.008411601,0.00026630872,0.00045199605,0.00090736244,0.0011315213,0.0030939674,0.0010930285,0.0007818849,0.00022237735],"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.00009705721,0.000029565,0.011563046,0.000092755734,0.000057587964,0.0002845616,0.00024532943,0.9392989,0.0034309777,0.027276516,0.0010475563,0.016576108],"study_design_scores_gemma":[0.0000063931734,0.00009940094,0.006755532,0.000043971726,0.000052466006,0.0002638671,0.00056283356,0.9528442,0.0014252269,0.03575683,0.0021607222,0.000028457398],"about_ca_topic_score_codex":0.01059152,"about_ca_topic_score_gemma":0.008816895,"teacher_disagreement_score":0.01059152,"about_ca_system_score_codex":0.0016396763,"about_ca_system_score_gemma":0.000747785,"threshold_uncertainty_score":0.021059692},"labels":[],"label_agreement":null},{"id":"W4414603553","doi":"10.1109/tcomm.2025.3615770","title":"Tracking and Positioning Dynamic Targets in VLC: Signal Dependent Noises and Bayesian Bound Analysis","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kalman filter; Tracking (education); Position (finance); Bayesian probability; Noise (video); Visible light communication; Upper and lower bounds; Particle filter; Noise measurement","score_opus":0.012754772127856062,"score_gpt":0.3002715988149857,"score_spread":0.28751682668712963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603553","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.0057511344,0.00033470316,0.9924664,0.00013401125,0.000016962893,0.000010913209,0.000027140823,0.000083982064,0.001174712],"genre_scores_gemma":[0.8154117,0.0018529738,0.176638,0.00031493223,0.00015661941,0.00020004857,0.00033635937,0.00015413832,0.0049353084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818414,0.0004313407,0.000065875465,0.00040121702,0.000732467,0.00018484835],"domain_scores_gemma":[0.9950983,0.0034393182,0.0004751324,0.000277521,0.00063604605,0.0000736564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023812186,0.00095662556,0.0010045924,0.0008294967,0.0005573789,0.0016876664,0.0012538813,0.0015325834,0.00087731786],"category_scores_gemma":[0.01358622,0.00054811576,0.000535745,0.0010736331,0.0018099439,0.0019417503,0.0017770301,0.0014822008,0.00043166403],"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.00008671137,0.000027845652,0.0011822043,0.0001599634,0.000046323083,0.00008196055,0.00011831947,0.91692793,0.0050783223,0.03566412,0.0007336346,0.03989272],"study_design_scores_gemma":[0.000003084623,0.000022168002,0.00032482605,0.000015026637,0.000007491964,0.000027322787,0.000014360673,0.99102086,0.0015509491,0.0064712246,0.0005280644,0.000014622895],"about_ca_topic_score_codex":0.009061462,"about_ca_topic_score_gemma":0.005143465,"teacher_disagreement_score":0.009061462,"about_ca_system_score_codex":0.0015237195,"about_ca_system_score_gemma":0.0019177137,"threshold_uncertainty_score":0.018017411},"labels":[],"label_agreement":null},{"id":"W4414603913","doi":"10.1109/tcomm.2025.3615774","title":"Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Decoding methods; Lattice (music); Algebraic number; Additive white Gaussian noise; Error detection and correction; Coding (social sciences); Generator matrix; List decoding; Concatenated error correction code","score_opus":0.037425545459896375,"score_gpt":0.2737209845405429,"score_spread":0.2362954390806465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603913","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.005415019,0.00025767862,0.9880598,0.00018327613,0.00004377757,0.000048099926,0.00006241237,0.00019976949,0.005730122],"genre_scores_gemma":[0.28165853,0.0009255952,0.7110179,0.00026790012,0.00013030012,0.0002002098,0.00020253504,0.00010020839,0.0054967776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.0006143387,0.00008684679,0.00017386438,0.0005913545,0.00015610181],"domain_scores_gemma":[0.99846125,0.0005783862,0.000132515,0.000387967,0.0003208223,0.000119139186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012962994,0.0008027962,0.0006566613,0.00077567,0.0008182821,0.0019259701,0.0010401352,0.00081524433,0.002360918],"category_scores_gemma":[0.0030305507,0.00041851273,0.000614049,0.00094299234,0.0015934788,0.0017873428,0.0019620517,0.0015100036,0.001359494],"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.00024377441,0.00007646753,0.00058646547,0.00018796601,0.000036316585,0.00020036109,0.0002442749,0.13403207,0.020734642,0.71203846,0.003176133,0.12844314],"study_design_scores_gemma":[0.000092510905,0.00033270734,0.00015670127,0.0000785326,0.000028278986,0.00051409286,0.00009606318,0.67147976,0.024293737,0.27958798,0.023237564,0.00010202388],"about_ca_topic_score_codex":0.0012347902,"about_ca_topic_score_gemma":0.0014172797,"teacher_disagreement_score":0.002360918,"about_ca_system_score_codex":0.0012133031,"about_ca_system_score_gemma":0.001874238,"threshold_uncertainty_score":0.008803129},"labels":[],"label_agreement":null},{"id":"W4414692552","doi":"10.1109/tcomm.2025.3616229","title":"Cooperative Inference for Real-Time 3D Human Pose Estimation in Multi-Device Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Inference; Approximate inference; Transmission (telecommunications); Pose; Enhanced Data Rates for GSM Evolution; Reduction (mathematics); Filter (signal processing)","score_opus":0.05838340793875502,"score_gpt":0.3588135928364608,"score_spread":0.3004301848977058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414692552","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.015125673,0.0002132965,0.9833097,0.000069118054,0.000033342283,0.000021286965,0.000039786697,0.00037552306,0.0008123863],"genre_scores_gemma":[0.7580724,0.00034531648,0.23872635,0.0001766756,0.00007146166,0.00010760804,0.00025323112,0.000098126344,0.002148875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992193,0.0001686878,0.000038564056,0.00025049815,0.0002280529,0.000094806834],"domain_scores_gemma":[0.99883133,0.0006257661,0.000100969075,0.00017935992,0.000205961,0.000056561494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090062775,0.00116642,0.0009930559,0.0005092026,0.000597339,0.00094254775,0.0019261397,0.0010692817,0.0014382051],"category_scores_gemma":[0.004139085,0.0005810286,0.00056973356,0.00061472703,0.0005292529,0.0018753652,0.0018305297,0.0011167076,0.00043413564],"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.0006122329,0.00013459455,0.003698143,0.00016106447,0.00009995972,0.0005175123,0.00038165224,0.6581265,0.019225799,0.0076702423,0.002622546,0.30674973],"study_design_scores_gemma":[0.0000068443996,0.000030679006,0.00037972262,0.0000050345197,0.00001055576,0.00006392359,0.000029379638,0.9940048,0.0026512807,0.002345154,0.0004627427,0.000009949753],"about_ca_topic_score_codex":0.0047302833,"about_ca_topic_score_gemma":0.005967076,"teacher_disagreement_score":0.0047302833,"about_ca_system_score_codex":0.00044360373,"about_ca_system_score_gemma":0.0006323505,"threshold_uncertainty_score":0.009405494},"labels":[],"label_agreement":null},{"id":"W4415124307","doi":"10.1109/tcomm.2025.3621045","title":"Cooperative Digital Twin-Enhanced UAV Topology Optimization for Multi-Target Tracking","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","cited_by":10,"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":"Info-communications Media Development Authority; Queen's University; National Research Foundation Singapore; National Research Foundation; Queen's University Belfast","keywords":"Network topology; Topology optimization; Graph; Tracking (education); Position (finance); Topology (electrical circuits)","score_opus":0.03873767822150669,"score_gpt":0.3340459563494326,"score_spread":0.2953082781279259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415124307","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.027039072,0.00017442576,0.9700955,0.000089132576,0.0000295542,0.000020957266,0.00004570094,0.00031002692,0.0021957026],"genre_scores_gemma":[0.8856869,0.00018541938,0.1108762,0.000072799594,0.000018621708,0.00005821912,0.00019003835,0.00007340269,0.0028384198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.000059615715,0.00001220744,0.00008323088,0.00008385175,0.000048840284],"domain_scores_gemma":[0.9995864,0.00015854312,0.00006302574,0.000060981576,0.0000832724,0.000047721413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043270347,0.0007001327,0.00062077364,0.0004679648,0.0003828572,0.00065748696,0.0011080101,0.00055460754,0.0015738986],"category_scores_gemma":[0.0013213477,0.00029767706,0.0004872353,0.00060764025,0.00036736394,0.0013891232,0.0009392085,0.00066015765,0.0002297725],"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.000035649016,0.000021054855,0.0004320328,0.000021300544,0.000010807105,0.000034568322,0.000036223322,0.9578608,0.0018990493,0.0038346264,0.00061940576,0.03519457],"study_design_scores_gemma":[0.0000025231384,0.000013874272,0.000035596604,8.615187e-7,0.0000024739259,0.000008477678,0.0000065141858,0.99823356,0.00030991805,0.0011418522,0.00024288378,0.0000015604686],"about_ca_topic_score_codex":0.004872973,"about_ca_topic_score_gemma":0.006034832,"teacher_disagreement_score":0.004872973,"about_ca_system_score_codex":0.00084815227,"about_ca_system_score_gemma":0.0008685696,"threshold_uncertainty_score":0.009689212},"labels":[],"label_agreement":null},{"id":"W4415125084","doi":"10.1109/tcomm.2025.3621094","title":"RIS With Coupled Phase Shift and Amplitude: Capacity Maximization and Configuration Set Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Reflection (computer programming); Maximization; Amplitude; Reflection coefficient; Phase (matter); Set (abstract data type); Continuous phase modulation; Surface (topology)","score_opus":0.03237185869466722,"score_gpt":0.28570488005841255,"score_spread":0.2533330213637453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415125084","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.046503924,0.0003560518,0.93513936,0.00034433787,0.000032275653,0.00009239739,0.000120329416,0.0005090908,0.01690228],"genre_scores_gemma":[0.82875603,0.0003343199,0.16260643,0.00017162708,0.00004985006,0.0002369676,0.00017844248,0.00023877923,0.0074274573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.00047279103,0.000031646672,0.00016536757,0.00022618679,0.0001902146],"domain_scores_gemma":[0.99836713,0.0010662554,0.00013982355,0.00018316708,0.00014924277,0.00009434031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702386,0.0014021324,0.0011903567,0.00082865654,0.0004402916,0.0011136094,0.0014128623,0.0009390174,0.00447186],"category_scores_gemma":[0.0032632218,0.00073683495,0.0007270607,0.0011643188,0.0013153603,0.0015342947,0.0016565174,0.0012264561,0.00074353104],"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.00006982356,0.000043845823,0.00017653377,0.000076352895,0.000028045275,0.00010149419,0.00003512215,0.9476076,0.0049651265,0.02782533,0.0015982536,0.017472379],"study_design_scores_gemma":[0.0000072456337,0.000027275328,0.000039254643,0.000006260499,0.000006696555,0.000028170325,0.000012164185,0.98733807,0.0013530619,0.010790508,0.00038354358,0.000007779245],"about_ca_topic_score_codex":0.0013265932,"about_ca_topic_score_gemma":0.0016258307,"teacher_disagreement_score":0.00447186,"about_ca_system_score_codex":0.0011627161,"about_ca_system_score_gemma":0.0009623569,"threshold_uncertainty_score":0.014959872},"labels":[],"label_agreement":null},{"id":"W4415159121","doi":"10.1109/tcomm.2025.3621247","title":"Power Minimization Under Quality of Service Constraints for MIMO Systems With a RIS-Based Transmitter","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computational complexity theory; MIMO; Transmitter power output; Minification; Quality of service; Transmitter; Power (physics)","score_opus":0.029691741313085124,"score_gpt":0.29307509423841427,"score_spread":0.26338335292532916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415159121","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.05714178,0.00043126813,0.937697,0.00014305752,0.00001692452,0.000020900268,0.000027375409,0.00007531185,0.004446344],"genre_scores_gemma":[0.9327271,0.0005393771,0.06465366,0.000052418127,0.000044049404,0.0000563437,0.00004260946,0.000043042874,0.0018414336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995123,0.00019226783,0.000012516351,0.000057978883,0.00016526053,0.000059654114],"domain_scores_gemma":[0.99943835,0.00036369154,0.00008357183,0.00002879263,0.00006815556,0.00001749657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005514796,0.00089098286,0.0005764771,0.0002169276,0.00022880864,0.000944944,0.00046475008,0.0005425432,0.0008518659],"category_scores_gemma":[0.0013522627,0.0003374329,0.00036475988,0.00051771564,0.0005831643,0.0007765464,0.000566786,0.00053408876,0.00020778202],"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.0000526993,0.000022479027,0.00030572832,0.00006929412,0.000025008361,0.000080768485,0.000044591965,0.96668166,0.008046604,0.011250899,0.00021846646,0.013201866],"study_design_scores_gemma":[0.0000040422906,0.000033000822,0.000075667616,0.000002287216,0.000004080286,0.000014528721,0.000009063516,0.9965749,0.0013160934,0.0018251206,0.00013833324,0.0000029152425],"about_ca_topic_score_codex":0.001044574,"about_ca_topic_score_gemma":0.0008317656,"teacher_disagreement_score":0.001044574,"about_ca_system_score_codex":0.00058074057,"about_ca_system_score_gemma":0.0005872885,"threshold_uncertainty_score":0.004213631},"labels":[],"label_agreement":null},{"id":"W4415179915","doi":"10.1109/tcomm.2025.3621209","title":"From Rigid Isolation to Elastic Integration: Progressively Unified Resource Allocation in ISAC for Value of Service Maximization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Resource allocation; Maximization; Bandwidth (computing); Resource (disambiguation); Service (business); Scheme (mathematics); Resource management (computing); Isolation (microbiology); Heterogeneous network","score_opus":0.01652308937204438,"score_gpt":0.2663079426144888,"score_spread":0.24978485324244443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415179915","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.034125037,0.0002210089,0.9630538,0.0001398178,0.000020045678,0.000065367996,0.000014480597,0.00024980638,0.0021106352],"genre_scores_gemma":[0.9064885,0.00010203592,0.09263427,0.00010221883,0.000027552891,0.00006903938,0.000024341698,0.000040361432,0.0005116836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861467,0.0003151627,0.00005420629,0.0002987414,0.0004152474,0.0003020482],"domain_scores_gemma":[0.9988927,0.0004514669,0.00018249665,0.00018196259,0.00018037429,0.00011086339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016916349,0.0010270415,0.001034385,0.00062534877,0.0007056786,0.0013244956,0.0017231946,0.00070362433,0.00070569065],"category_scores_gemma":[0.0033702177,0.00037630394,0.0004889402,0.0008766777,0.0017020887,0.0019488605,0.0024159395,0.0016013286,0.000147082],"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.00020648671,0.00014766655,0.0016613873,0.00007271879,0.000059825743,0.00016109168,0.00038502552,0.8131485,0.02028006,0.042418316,0.0011986026,0.12026035],"study_design_scores_gemma":[0.0000058299543,0.00005070675,0.00012912204,0.000004876236,0.0000070794918,0.000025935891,0.000020421503,0.9929075,0.0014410816,0.005079503,0.00031831113,0.000009518652],"about_ca_topic_score_codex":0.004442631,"about_ca_topic_score_gemma":0.003722446,"teacher_disagreement_score":0.004442631,"about_ca_system_score_codex":0.0011865768,"about_ca_system_score_gemma":0.002004807,"threshold_uncertainty_score":0.008946359},"labels":[],"label_agreement":null},{"id":"W4415398673","doi":"10.1109/tcomm.2025.3624157","title":"On the Fundamental Limits of Integrated Sensing and Communications Under Logarithmic Loss","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Transmitter; Logarithm; Channel (broadcasting); Function (biology); Gaussian; Distortion (music); Log amplifier","score_opus":0.04461909036190977,"score_gpt":0.2924702234357977,"score_spread":0.24785113307388792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415398673","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.044199117,0.0039097946,0.92176884,0.0026235592,0.00014164613,0.000077171346,0.0003037493,0.0003501016,0.026625965],"genre_scores_gemma":[0.91858417,0.004043348,0.069301,0.001088567,0.00046537453,0.00037210246,0.000272012,0.0003195532,0.005553955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935622,0.0021338947,0.00024093014,0.0008797746,0.0022170867,0.00096611585],"domain_scores_gemma":[0.94101536,0.04877245,0.0028179376,0.003936121,0.0025838746,0.0008742952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007856369,0.00203611,0.0017460296,0.00202939,0.0012963976,0.0048265764,0.0033638477,0.0026131321,0.004031806],"category_scores_gemma":[0.0527315,0.00095624424,0.0010007499,0.0022560176,0.008338475,0.011635521,0.006654284,0.0044639744,0.0010327317],"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.00025615774,0.000078470315,0.0007573897,0.0002889454,0.00005488543,0.00034068158,0.00040485366,0.24560854,0.0046217996,0.72136956,0.0022984564,0.023920264],"study_design_scores_gemma":[0.000027379152,0.00009367737,0.00032530498,0.0001136512,0.000023660607,0.0004484472,0.00011802661,0.5460112,0.0030971703,0.44770712,0.0019704842,0.00006386981],"about_ca_topic_score_codex":0.0015387059,"about_ca_topic_score_gemma":0.00063016056,"teacher_disagreement_score":0.007856369,"about_ca_system_score_codex":0.004208734,"about_ca_system_score_gemma":0.0014141976,"threshold_uncertainty_score":0.041548967},"labels":[],"label_agreement":null},{"id":"W4415624518","doi":"10.1109/tcomm.2025.3626652","title":"Beamforming for Massive MIMO Aerial Communications: A Robust and Scalable DRL Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; École de Technologie Supérieure","funders":"","keywords":"Beamforming; Scalability; Robustness (evolution); Telecommunications link; Base station; MIMO; Channel state information; Overhead (engineering)","score_opus":0.03286685200953706,"score_gpt":0.26466470695522565,"score_spread":0.23179785494568858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624518","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.0039121937,0.000113533475,0.993634,0.00011535305,0.000022348948,0.000015405109,0.00002229475,0.00026668858,0.0018981692],"genre_scores_gemma":[0.75894666,0.00026700727,0.23449153,0.00026663352,0.00008302124,0.00010128453,0.0001219477,0.000088915855,0.005632868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.000059648304,0.000008481319,0.000051533745,0.00008280163,0.000035659705],"domain_scores_gemma":[0.9996842,0.00013073011,0.00004766686,0.00003924781,0.00007433485,0.000023832235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522417,0.0006654084,0.000567805,0.00022936627,0.0002272073,0.00048010703,0.00087579316,0.0005751317,0.002008767],"category_scores_gemma":[0.0009823322,0.00030729861,0.00032504575,0.00025985646,0.0005506696,0.00082476693,0.0009481564,0.00090697437,0.00052672153],"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.000037329566,0.000023100734,0.00029031892,0.00004593271,0.000019880206,0.00006832737,0.00003149674,0.92390007,0.0050716703,0.008817059,0.001207258,0.060487594],"study_design_scores_gemma":[0.000003591177,0.000013116539,0.000029491788,0.0000020002822,0.0000018843026,0.000010424041,0.00000389638,0.9979372,0.0004305617,0.001253838,0.00031170147,0.0000023023988],"about_ca_topic_score_codex":0.0030155885,"about_ca_topic_score_gemma":0.0037752592,"teacher_disagreement_score":0.0030155885,"about_ca_system_score_codex":0.0004869957,"about_ca_system_score_gemma":0.0006702965,"threshold_uncertainty_score":0.0067200065},"labels":[],"label_agreement":null},{"id":"W4415883602","doi":"10.1109/tcomm.2025.3628766","title":"2D-AoI: Age-of-Information of Distributed Sensors for Spatio-Temporal Processes","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deutsche Forschungsgemeinschaft","keywords":"Covariance; Wireless sensor network; Offset (computer science); Gaussian; Measure (data warehouse); Network topology; Gaussian process; Exponential function","score_opus":0.026065578182485005,"score_gpt":0.28333200764214417,"score_spread":0.25726642945965916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415883602","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.022669984,0.001153644,0.9701045,0.00036536032,0.00015183662,0.00008902296,0.00032941217,0.00034757706,0.004788805],"genre_scores_gemma":[0.7271256,0.0021098796,0.26629245,0.00023668446,0.00018725691,0.00030540253,0.0006876959,0.00026059983,0.0027944925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00030791498,0.00008552626,0.00023229877,0.0006112913,0.00012121467],"domain_scores_gemma":[0.99431497,0.0031303936,0.00088975363,0.00077945174,0.00068774534,0.00019771914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030874058,0.00094577984,0.00079114916,0.0011347887,0.00053677114,0.00208115,0.0017575986,0.001433217,0.00234437],"category_scores_gemma":[0.012683537,0.00040656846,0.0010383204,0.0015642404,0.0014308883,0.0036973732,0.0019564917,0.0022679619,0.0004530395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014166086,0.00010312407,0.005927537,0.00029760905,0.00006792724,0.00023272193,0.0002309644,0.79765224,0.0055667115,0.15196058,0.0018313999,0.03598754],"study_design_scores_gemma":[0.000004882159,0.000035801837,0.0008940734,0.00001841308,0.000011534518,0.00009528264,0.000033432236,0.97707295,0.0011706963,0.018806564,0.0018403169,0.000016045597],"about_ca_topic_score_codex":0.0044785114,"about_ca_topic_score_gemma":0.003061648,"teacher_disagreement_score":0.0044785114,"about_ca_system_score_codex":0.0017897187,"about_ca_system_score_gemma":0.0016477745,"threshold_uncertainty_score":0.016327918},"labels":[],"label_agreement":null},{"id":"W4416323737","doi":"10.1109/tcomm.2025.3634201","title":"Combating AI-Based Jamming in LEO Satellite Networks Using Quantum Adversarial Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Mitacs","keywords":"Jamming; Reinforcement learning; Satellite; Communications satellite; Adversarial system; Quality of service; Q-learning","score_opus":0.038270743336895514,"score_gpt":0.2993720070131984,"score_spread":0.2611012636763029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323737","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.10079292,0.00043109708,0.8925051,0.0006041367,0.000072234114,0.000042738237,0.000030029181,0.00043000074,0.005091872],"genre_scores_gemma":[0.9855223,0.00009604375,0.012803196,0.00016947452,0.000017272048,0.000022518961,0.0000218542,0.000013590563,0.001333742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996414,0.00010510795,0.000012461235,0.000061093786,0.000088704124,0.000091253554],"domain_scores_gemma":[0.9988877,0.0006633342,0.00016197255,0.00005390917,0.00015727164,0.00007580699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008832243,0.00059621653,0.0005220382,0.00023058716,0.00028893215,0.0005417872,0.0007454441,0.0006260339,0.0009975173],"category_scores_gemma":[0.002065526,0.00023864477,0.00030690274,0.00017608995,0.00095633947,0.0007009382,0.0009114094,0.0012364462,0.00012432432],"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.000053595322,0.000033901353,0.0006639402,0.00002288994,0.000021334856,0.000048723206,0.000029094537,0.98136234,0.0016841856,0.0035786417,0.0003767137,0.012124668],"study_design_scores_gemma":[0.0000021209862,0.0000132698115,0.000038065216,0.000001074683,0.0000020219588,0.000003456669,0.0000023049406,0.99910754,0.00016689078,0.0006093659,0.00005253891,0.0000012928348],"about_ca_topic_score_codex":0.005638486,"about_ca_topic_score_gemma":0.0049997955,"teacher_disagreement_score":0.005638486,"about_ca_system_score_codex":0.0007677071,"about_ca_system_score_gemma":0.0008517669,"threshold_uncertainty_score":0.011211336},"labels":[],"label_agreement":null},{"id":"W4416323772","doi":"10.1109/tcomm.2025.3634252","title":"Beamforming Designs for Multiple UAV Interference Systems With LOS Channels","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; WSDMA; Telecommunications link; Base station; Interference (communication); Channel (broadcasting); Antenna array","score_opus":0.04698644900073002,"score_gpt":0.2766050349413391,"score_spread":0.22961858594060908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323772","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.0045189247,0.00037257688,0.99256927,0.00006795653,0.000027947877,0.000025683568,0.000027896886,0.000055093682,0.0023346073],"genre_scores_gemma":[0.5218536,0.0030506596,0.46721742,0.0002739195,0.00024429118,0.0004592828,0.00026661338,0.000057337085,0.006576868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992449,0.00030805304,0.000037440597,0.000108584354,0.00022396016,0.00007705829],"domain_scores_gemma":[0.99940646,0.00025265056,0.00012741039,0.00003380411,0.00015839882,0.000021222733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370039,0.0014604636,0.00050296506,0.00043352591,0.00035108367,0.00067055627,0.00051071215,0.0006273226,0.0025367567],"category_scores_gemma":[0.0017689478,0.00037555044,0.00050256395,0.00091669534,0.00045587352,0.00070343626,0.0007098808,0.0006710693,0.0010092397],"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.0001652625,0.00007481343,0.0008934501,0.0005058909,0.00010548846,0.00028028444,0.00025147907,0.69350606,0.045238066,0.05894629,0.0027699473,0.19726297],"study_design_scores_gemma":[0.00005028881,0.0004603629,0.000462772,0.00007585487,0.000055277615,0.00027702932,0.00012456243,0.96508646,0.010368297,0.017465858,0.005528914,0.000044212687],"about_ca_topic_score_codex":0.000890931,"about_ca_topic_score_gemma":0.0011906078,"teacher_disagreement_score":0.0025367567,"about_ca_system_score_codex":0.00039820664,"about_ca_system_score_gemma":0.0005853586,"threshold_uncertainty_score":0.008486271},"labels":[],"label_agreement":null},{"id":"W4416513336","doi":"10.1109/tcomm.2025.3635782","title":"Distributed Near-Field Channel Estimation for U6G XL-MIMO Systems Under Beam Squint","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"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":"Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Wideband; Channel (broadcasting); Overhead (engineering); Computational complexity theory; Parametric statistics; Upper and lower bounds; Path (computing); Beam (structure)","score_opus":0.021321261858657542,"score_gpt":0.27715116148665236,"score_spread":0.25582989962799485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513336","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.013808622,0.00009950601,0.9847589,0.00008418735,0.000017626813,0.000029300474,0.000038475137,0.00029700322,0.00086634106],"genre_scores_gemma":[0.45472345,0.0003522762,0.5410749,0.00013989952,0.00008390933,0.0001788542,0.0003854584,0.00006209467,0.0029991958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995084,0.00015829311,0.000023505203,0.00009719307,0.00014129738,0.00007130626],"domain_scores_gemma":[0.9993131,0.00029592545,0.00010761864,0.00008582864,0.00015225733,0.000045334313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007928265,0.00095028075,0.00068778003,0.00038449836,0.00056953536,0.00068673794,0.0007070299,0.00052479416,0.0016596344],"category_scores_gemma":[0.0020603284,0.00046800496,0.0005638806,0.000546055,0.00047495798,0.0009894501,0.0010247895,0.0009160955,0.00074693386],"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.0007267156,0.000119838616,0.0022189175,0.00018325238,0.00011754539,0.0002205835,0.0002925543,0.53185683,0.051029477,0.015198027,0.0028742529,0.39516208],"study_design_scores_gemma":[0.00002140333,0.000053243097,0.00031031808,0.0000059542185,0.000010665592,0.00005014158,0.000029253044,0.9933036,0.004217085,0.0014790985,0.0005066386,0.000012652666],"about_ca_topic_score_codex":0.003967236,"about_ca_topic_score_gemma":0.0067260945,"teacher_disagreement_score":0.003967236,"about_ca_system_score_codex":0.0004883359,"about_ca_system_score_gemma":0.0016894887,"threshold_uncertainty_score":0.0078882575},"labels":[],"label_agreement":null},{"id":"W4416650073","doi":"10.1109/tcomm.2025.3637046","title":"Two-Timescales Optimization of Content Placement and Delivery in Satellite-Terrestrial Edge Computing Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":1,"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":"Natural Science Foundation of Beijing Municipality; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Markov decision process; Leverage (statistics); Reinforcement learning; Optimization problem; Cache; Enhanced Data Rates for GSM Evolution; Edge device; Integer programming; Edge computing; Quality of service","score_opus":0.05139023337721987,"score_gpt":0.2743349580219171,"score_spread":0.22294472464469722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650073","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.07134573,0.0006578023,0.92198384,0.00065332715,0.00009455903,0.000098870645,0.00010689782,0.00026212598,0.0047967713],"genre_scores_gemma":[0.92851144,0.00037252795,0.06771524,0.0001436204,0.00005592464,0.00013024412,0.000087429595,0.00009207462,0.0028914325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992894,0.00022721635,0.000024792853,0.00015311134,0.00012896453,0.0001764413],"domain_scores_gemma":[0.99898213,0.0006072028,0.0001349559,0.000053304906,0.000101106896,0.00012129901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012611474,0.0009075315,0.001179761,0.00039325922,0.0006429732,0.0010017377,0.0013196397,0.0012333744,0.0018587667],"category_scores_gemma":[0.0033855059,0.00055548735,0.0003732179,0.00061066943,0.0009109509,0.0014677892,0.0013227384,0.001087719,0.00017572647],"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.000040617604,0.000030381661,0.00024541028,0.00003129181,0.000009175345,0.000045235007,0.000019377529,0.9860253,0.0010291808,0.00594588,0.00051308086,0.0060650804],"study_design_scores_gemma":[0.0000036420133,0.000012250579,0.00004474273,0.0000012999257,0.0000018975126,0.000005959618,0.0000068185195,0.99818605,0.00013881864,0.0014742238,0.00012249066,0.0000018013204],"about_ca_topic_score_codex":0.00650438,"about_ca_topic_score_gemma":0.005273129,"teacher_disagreement_score":0.00650438,"about_ca_system_score_codex":0.0018008987,"about_ca_system_score_gemma":0.0017110949,"threshold_uncertainty_score":0.013066471},"labels":[],"label_agreement":null},{"id":"W4416650074","doi":"10.1109/tcomm.2025.3637109","title":"Enhancing Massive MIMO Symbol Detection in Unknown Noise Environments: A Generative Modeling Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Noise (video); Detector; Gaussian noise; Prior probability; MIMO; Benchmark (surveying); Probability density function; Detection theory; Symbol (formal)","score_opus":0.04023166016438158,"score_gpt":0.27317580816424497,"score_spread":0.2329441479998634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650074","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.00477267,0.000074939526,0.9943311,0.00009709064,0.000016851853,0.000008526789,0.000019703652,0.000095536,0.00058355334],"genre_scores_gemma":[0.62351006,0.0007377523,0.36817846,0.0003862454,0.00020529582,0.000103306826,0.0002241053,0.00014309218,0.006511769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.00024390209,0.000022867825,0.00015011175,0.0002945207,0.000060663933],"domain_scores_gemma":[0.99843353,0.0009505097,0.00017963695,0.00021227293,0.0001637525,0.000060352155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009978095,0.0007361486,0.0009267507,0.0004817218,0.0004020128,0.0009545921,0.0014528352,0.000988807,0.0010627563],"category_scores_gemma":[0.0036804704,0.0006258171,0.0009703296,0.0005604295,0.0010997888,0.0011866795,0.0017955073,0.0012052216,0.00053201144],"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.000090551664,0.000062147825,0.001376153,0.000114664814,0.00008208913,0.00020551163,0.00024191783,0.83310014,0.015859887,0.07213783,0.0010460292,0.07568306],"study_design_scores_gemma":[0.0000044867843,0.000019350411,0.00014068859,0.0000055756823,0.000008439448,0.00008097092,0.0000074511113,0.9907568,0.0017913947,0.0066522695,0.00052187155,0.000010676085],"about_ca_topic_score_codex":0.0014853149,"about_ca_topic_score_gemma":0.0018667368,"teacher_disagreement_score":0.0014853149,"about_ca_system_score_codex":0.000588022,"about_ca_system_score_gemma":0.0008745414,"threshold_uncertainty_score":0.005276978},"labels":[],"label_agreement":null},{"id":"W7092293057","doi":"10.1109/tcomm.2025.3622931","title":"Channel Modeling for Molecular Communication With Heterogeneous Circular/Spherical Boundary","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","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":"York University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Boundary (topology); Boundary value problem; Molecular communication; Channel (broadcasting); Bounded function; Impulse (physics); Impulse response","score_opus":0.02317440386942953,"score_gpt":0.2614233357826782,"score_spread":0.23824893191324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092293057","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.067333005,0.0008053265,0.91898024,0.00038217526,0.000096839976,0.000054322405,0.00015040995,0.00026221984,0.011935457],"genre_scores_gemma":[0.923869,0.0011874408,0.06548622,0.00021333298,0.00007357573,0.00016689966,0.00017624385,0.000090064124,0.008737286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978584,0.000054570362,0.0000073771294,0.000039770315,0.000067674046,0.000044765275],"domain_scores_gemma":[0.99962723,0.00017675245,0.00005907003,0.00003627231,0.0000730585,0.000027605416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025482316,0.00043996223,0.00047554463,0.00036672343,0.00043637623,0.00077644276,0.0006997325,0.0011993576,0.0011576792],"category_scores_gemma":[0.0008326216,0.00020298173,0.000563865,0.0003171751,0.0008226701,0.00097104674,0.00076375616,0.0005353359,0.00034667968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032694177,0.000026702155,0.0005874228,0.000061139974,0.000012009016,0.00022049878,0.000093555085,0.9419198,0.012388742,0.03939863,0.0005978242,0.0046610753],"study_design_scores_gemma":[0.0000024241708,0.000008724098,0.00005387881,0.0000025660006,0.0000024519816,0.00002725874,0.000013998863,0.99695325,0.0007214143,0.0017215384,0.0004869219,0.0000056154845],"about_ca_topic_score_codex":0.004079887,"about_ca_topic_score_gemma":0.0016341242,"teacher_disagreement_score":0.004079887,"about_ca_system_score_codex":0.00068590144,"about_ca_system_score_gemma":0.0008048651,"threshold_uncertainty_score":0.008112252},"labels":[],"label_agreement":null},{"id":"W7092293895","doi":"10.1109/tcomm.2025.3622963","title":"Fluid Antenna Index Modulation for MIMO Systems: Robust Transmission and Low-Complexity Detection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","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":"Western University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Robustness (evolution); Detector; MIMO; Spectral efficiency; Spatial modulation; Bit error rate; Upper and lower bounds; Transmission (telecommunications); Transmission system","score_opus":0.03706253087122901,"score_gpt":0.2678976060728884,"score_spread":0.23083507520165936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092293895","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.012006916,0.00058662315,0.98484844,0.00017180547,0.00005648317,0.000025039504,0.000020005697,0.00020240505,0.0020823814],"genre_scores_gemma":[0.78797996,0.0008861426,0.20847294,0.00026099943,0.00015665335,0.000087591434,0.000061674895,0.00003062849,0.0020632278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905235,0.00031509702,0.000042719174,0.0001275113,0.00036475877,0.00009751909],"domain_scores_gemma":[0.9987717,0.0005842937,0.00025038165,0.00016261863,0.00019114342,0.00003985209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082695036,0.00073436537,0.00070938474,0.00037168348,0.00036420187,0.0010064968,0.00074614346,0.0007867729,0.00073998503],"category_scores_gemma":[0.003277195,0.00028349497,0.0002613941,0.0006181384,0.0008261014,0.0012899234,0.0010130082,0.0009929124,0.00037850149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058041315,0.00013997166,0.0027140696,0.00053439784,0.00013260062,0.00047860853,0.00035423585,0.33486527,0.18436414,0.18656059,0.003494399,0.2857813],"study_design_scores_gemma":[0.000015324502,0.00019790637,0.00025494964,0.000029156718,0.000021536409,0.0002255902,0.00002176394,0.9584331,0.024919705,0.012119605,0.0037281448,0.000033250006],"about_ca_topic_score_codex":0.000418108,"about_ca_topic_score_gemma":0.0005142174,"teacher_disagreement_score":0.0010064968,"about_ca_system_score_codex":0.0005480604,"about_ca_system_score_gemma":0.0005190169,"threshold_uncertainty_score":0.004373431},"labels":[],"label_agreement":null},{"id":"W7116676737","doi":"10.1109/tcomm.2025.3646885","title":"Non-Orthogonal Multiple-Access for Coherent-State Optical Quantum Communications Under Lossy Photon Channels","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Telecommunications link; Lossy compression; Photon; Interference (communication); Coherent states; Power (physics); Optical communication; Topology (electrical circuits); Key (lock)","score_opus":0.06032627751340057,"score_gpt":0.334258999771827,"score_spread":0.2739327222584264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116676737","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.015602733,0.00044170866,0.9818938,0.000098264485,0.00002323734,0.000021908756,0.00001357325,0.000056840105,0.0018479698],"genre_scores_gemma":[0.77780014,0.0010169158,0.21878496,0.00013458852,0.0000668361,0.00009417171,0.000051664523,0.000027455208,0.0020232855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914026,0.00040293272,0.000024024726,0.00007940809,0.00027838768,0.000075009615],"domain_scores_gemma":[0.9989656,0.0006651895,0.00012006028,0.000080390324,0.00014078108,0.000028056904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242144,0.0005224907,0.0004444308,0.00031285317,0.0003968961,0.00070198375,0.00070580165,0.00042331096,0.00079477776],"category_scores_gemma":[0.002630958,0.00021431093,0.00036040376,0.000634311,0.0007360697,0.0008002921,0.0008874967,0.0009872076,0.00020137976],"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.00015606068,0.000109524844,0.0010080375,0.00026853147,0.00006723227,0.00018442287,0.00016917511,0.67589533,0.016828094,0.18797423,0.0014499933,0.115889356],"study_design_scores_gemma":[0.0000038055714,0.00002810379,0.00004921759,0.0000040972295,0.000004311595,0.000021619822,0.0000051323873,0.9931283,0.0011546467,0.005215043,0.00038135043,0.000004313289],"about_ca_topic_score_codex":0.0010843007,"about_ca_topic_score_gemma":0.002312734,"teacher_disagreement_score":0.001242144,"about_ca_system_score_codex":0.0005295408,"about_ca_system_score_gemma":0.001033302,"threshold_uncertainty_score":0.006569147},"labels":[],"label_agreement":null},{"id":"W7116909563","doi":"10.1109/tcomm.2025.3647766","title":"Cooperation-Based Federated Learning and Communication Optimization Under Intermittent Device Participation in Industrial IoT","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China; National Research Foundation","keywords":"Coordinate descent; Relay; Transmission (telecommunications); Convergence (economics); Optimization problem; Convex optimization; Block (permutation group theory); Relaxation (psychology); Selection (genetic algorithm); Rate of convergence","score_opus":0.08651429102178537,"score_gpt":0.3489656001974394,"score_spread":0.262451309175654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116909563","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.07300456,0.00027931514,0.9243819,0.00014260635,0.000020905843,0.00002717576,0.000020963384,0.00023333356,0.001889182],"genre_scores_gemma":[0.9680714,0.00008943321,0.030713923,0.000052748237,0.000012648403,0.000046504676,0.000028459204,0.000017157672,0.00096761016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.00024697988,0.000028933044,0.00017160672,0.00017796418,0.00012459082],"domain_scores_gemma":[0.9984536,0.0008788322,0.00021782142,0.00016227439,0.00021731555,0.000070111164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014853539,0.0006902855,0.0009260239,0.00030534255,0.00041383217,0.00064739364,0.0012682189,0.00070295815,0.0005037594],"category_scores_gemma":[0.0030667796,0.00028003898,0.00036419893,0.00047236786,0.0007797442,0.0011434926,0.0012582571,0.0006402703,0.00010617707],"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.00006791315,0.000037003687,0.0005922623,0.000029119521,0.000019285964,0.000093078816,0.00006779744,0.97005403,0.0016121521,0.0038133531,0.00030235635,0.02331167],"study_design_scores_gemma":[0.0000038017813,0.000026937607,0.0000735038,0.0000015779893,0.0000037070608,0.000011338381,0.0000067132473,0.99815995,0.0003051984,0.0013245777,0.00008037828,0.000002280778],"about_ca_topic_score_codex":0.0027994146,"about_ca_topic_score_gemma":0.0020749765,"teacher_disagreement_score":0.0027994146,"about_ca_system_score_codex":0.00061263284,"about_ca_system_score_gemma":0.00075496547,"threshold_uncertainty_score":0.007855356},"labels":[],"label_agreement":null},{"id":"W7116967589","doi":"10.1109/tcomm.2025.3647758","title":"Synchronization, Identification, and Signal Detection for Underwater Photon-Counting Communications With Input-Dependent Shot Noise","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Detection theory; Interference (communication); Transmission (telecommunications); Noise (video); Asynchronous communication; SIGNAL (programming language); Underwater; Multiuser detection; Shot noise; Signal-to-noise ratio (imaging)","score_opus":0.020520720528624338,"score_gpt":0.25534337010261415,"score_spread":0.23482264957398982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116967589","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.042527802,0.00016077797,0.95584965,0.00008187923,0.000019173352,0.000030816896,0.000014242406,0.00019902471,0.0011165687],"genre_scores_gemma":[0.6656041,0.00017738048,0.33213317,0.000073779076,0.00003362726,0.00008765351,0.00004582655,0.000027757882,0.0018167357],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993135,0.00018154479,0.000026868129,0.000111382185,0.0003154431,0.000051179035],"domain_scores_gemma":[0.9992872,0.00032021006,0.00015789024,0.00007371632,0.00013258377,0.000028452203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865915,0.0003501776,0.00037830308,0.00039820324,0.0004267592,0.00040946147,0.00074494915,0.00045235097,0.00042290258],"category_scores_gemma":[0.0022388946,0.00021572737,0.0002000558,0.00041216012,0.00056281907,0.00070965214,0.0008154775,0.0005441489,0.0002029918],"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.00068938633,0.00018692244,0.005425656,0.00023088732,0.0000933395,0.00051275076,0.00066258886,0.18814987,0.31005353,0.08417122,0.0021197062,0.40770406],"study_design_scores_gemma":[0.000022841561,0.00015950322,0.00052877434,0.000013204057,0.000017678454,0.00017063864,0.000028629442,0.9349915,0.058504533,0.0036531046,0.0018800991,0.00002950206],"about_ca_topic_score_codex":0.0013484046,"about_ca_topic_score_gemma":0.0017770301,"teacher_disagreement_score":0.0013484046,"about_ca_system_score_codex":0.00066337734,"about_ca_system_score_gemma":0.0010877071,"threshold_uncertainty_score":0.0048131943},"labels":[],"label_agreement":null}]}